dep_resolver.go 1.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172
  1. package preview
  2. import (
  3. "fmt"
  4. "github.com/porter-dev/switchboard/pkg/types"
  5. )
  6. type dependencyResolver struct {
  7. resources []*types.Resource
  8. graph map[string][]string
  9. resolved map[string]bool
  10. unresolved map[string]bool
  11. }
  12. func newDependencyResolver(resources []*types.Resource) *dependencyResolver {
  13. return &dependencyResolver{
  14. resources: resources,
  15. graph: make(map[string][]string),
  16. resolved: make(map[string]bool),
  17. unresolved: make(map[string]bool),
  18. }
  19. }
  20. func (r *dependencyResolver) Resolve() error {
  21. if len(r.resources) > 0 {
  22. // construct dependency graph
  23. for _, resource := range r.resources {
  24. // check for duplicate resource
  25. if _, ok := r.graph[resource.Name]; ok {
  26. return fmt.Errorf("duplicate resource detected: '%s'", resource.Name)
  27. }
  28. r.graph[resource.Name] = append(r.graph[resource.Name], resource.DependsOn...)
  29. }
  30. for _, resource := range r.resources {
  31. err := r.depResolve(resource.Name)
  32. if err != nil {
  33. return err
  34. }
  35. }
  36. }
  37. return nil
  38. }
  39. func (r *dependencyResolver) depResolve(name string) error {
  40. r.unresolved[name] = true
  41. for _, dep := range r.graph[name] {
  42. if _, ok := r.graph[dep]; !ok {
  43. return fmt.Errorf("for resource '%s': invalid dependency '%s'", name, dep)
  44. }
  45. if _, ok := r.resolved[dep]; !ok {
  46. if _, ok = r.unresolved[dep]; ok {
  47. return fmt.Errorf("circular depedency detected: '%s' -> '%s'", name, dep)
  48. }
  49. err := r.depResolve(dep)
  50. if err != nil {
  51. return err
  52. }
  53. }
  54. }
  55. r.resolved[name] = true
  56. delete(r.unresolved, name)
  57. return nil
  58. }