-
Notifications
You must be signed in to change notification settings - Fork 0
/
node.go
122 lines (98 loc) · 1.67 KB
/
node.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
package internal
import (
"context"
"fmt"
"cuelang.org/go/cue"
"github.com/pkg/errors"
)
type Node interface {
fmt.Stringer
Path() cue.Path
Deps() []Node
}
type node struct {
*Controller
path cue.Path
deps []*node
}
func (n *node) String() string {
return FormatAsJSONPath(n.path)
}
func (n *node) Path() cue.Path {
return n.path
}
func (n *node) Deps() []Node {
deps := make([]Node, len(n.deps))
for i := range n.deps {
deps[i] = n.deps[i]
}
return deps
}
func (n *node) addDep(dep *node) {
added := false
for _, d := range n.deps {
if d == dep {
added = true
}
}
if !added {
if ps, ok := PlatformScoped(n.path); ok {
if depPs, ok := PlatformScoped(dep.path); ok {
if !ps.Equals(*depPs) {
return
}
}
}
n.deps = append(n.deps, dep)
}
}
func (n *node) cycledDeps() bool {
for d := range n.rangeDep() {
if n == d {
return true
}
}
return false
}
func (n *node) rangeDep() func(yield func(n *node) bool) {
return func(yield func(n *node) bool) {
for _, d := range n.deps {
if !yield(d) {
return
}
for s := range d.rangeDep() {
if !yield(s) {
return
}
}
}
}
}
func (n *node) Run(ctx context.Context) error {
if n.cycledDeps() {
deps := []*node{n}
for d := range n.rangeDep() {
deps = append(deps, d)
if n == d {
break
}
}
return errors.Errorf("cycle deps: %s", deps)
}
if len(n.deps) > 0 {
eg, c := WithContext(ctx)
for _, d := range n.deps {
eg.Go(func() error {
return d.Run(c)
})
}
if err := eg.Wait(); err != nil {
// ignore cancel
if errors.Is(err, context.Canceled) {
return nil
}
return err
}
}
return n.runOnce(ctx, n)
}