-
Notifications
You must be signed in to change notification settings - Fork 3.2k
/
ancestry.go
182 lines (157 loc) · 5.74 KB
/
ancestry.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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
package common
import (
"fmt"
"regexp"
"sort"
"strings"
"time"
wfv1 "github.com/argoproj/argo-workflows/v3/pkg/apis/workflow/v1alpha1"
)
type DagContext interface {
GetTask(taskName string) *wfv1.DAGTask
GetTaskDependencies(taskName string) []string
GetTaskFinishedAtTime(taskName string) time.Time
}
type TaskResult string
const (
TaskResultSucceeded TaskResult = "Succeeded"
TaskResultFailed TaskResult = "Failed"
TaskResultErrored TaskResult = "Errored"
TaskResultSkipped TaskResult = "Skipped"
TaskResultOmitted TaskResult = "Omitted"
TaskResultDaemoned TaskResult = "Daemoned"
TaskResultAnySucceeded TaskResult = "AnySucceeded"
TaskResultAllFailed TaskResult = "AllFailed"
)
var (
// TODO: This should use validate.workflowFieldNameFmt, but we can't import it here because an import cycle would be created
taskNameRegex = regexp.MustCompile(`([a-zA-Z0-9][-a-zA-Z0-9]*?\.[A-Z][a-zA-Z]+)|([a-zA-Z0-9][-a-zA-Z0-9]*)`)
taskResultRegex = regexp.MustCompile(`([a-zA-Z0-9][-a-zA-Z0-9]*?\.[A-Z][a-zA-Z]+)`)
)
type expansionMatch struct {
taskName string
start int
end int
}
type DependencyType int
const (
DependencyTypeTask DependencyType = iota
DependencyTypeItems
)
func GetTaskDependencies(task *wfv1.DAGTask, ctx DagContext) (map[string]DependencyType, string) {
depends := getTaskDependsLogic(task, ctx)
matches := taskNameRegex.FindAllStringSubmatchIndex(depends, -1)
var expansionMatches []expansionMatch
dependencies := make(map[string]DependencyType)
for _, matchGroup := range matches {
// We have matched a taskName.TaskResult
if matchGroup[2] != -1 {
match := depends[matchGroup[2]:matchGroup[3]]
split := strings.Split(match, ".")
if split[1] == string(TaskResultAnySucceeded) || split[1] == string(TaskResultAllFailed) {
dependencies[split[0]] = DependencyTypeItems
} else if _, ok := dependencies[split[0]]; !ok { // DependencyTypeItems takes precedence
dependencies[split[0]] = DependencyTypeTask
}
} else if matchGroup[4] != -1 {
match := depends[matchGroup[4]:matchGroup[5]]
dependencies[match] = DependencyTypeTask
expansionMatches = append(expansionMatches, expansionMatch{taskName: match, start: matchGroup[4], end: matchGroup[5]})
}
}
if len(expansionMatches) == 0 {
return dependencies, depends
}
sort.Slice(expansionMatches, func(i, j int) bool {
// Sort in descending order
return expansionMatches[i].start > expansionMatches[j].start
})
for _, match := range expansionMatches {
matchTask := ctx.GetTask(match.taskName)
depends = depends[:match.start] + expandDependency(match.taskName, matchTask) + depends[match.end:]
}
return dependencies, depends
}
func ValidateTaskResults(dagTask *wfv1.DAGTask) error {
// If a user didn't specify a depends expression, there are no task results to validate
if dagTask.Depends == "" {
return nil
}
matches := taskResultRegex.FindAllStringSubmatch(dagTask.Depends, -1)
for _, matchGroup := range matches {
split := strings.Split(matchGroup[1], ".")
taskName, taskResult := split[0], TaskResult(split[1])
switch taskResult {
case TaskResultSucceeded, TaskResultFailed, TaskResultSkipped, TaskResultOmitted, TaskResultErrored, TaskResultDaemoned, TaskResultAnySucceeded, TaskResultAllFailed:
// Do nothing
default:
return fmt.Errorf("task result '%s' for task '%s' is invalid", taskResult, taskName)
}
}
return nil
}
func getTaskDependsLogic(dagTask *wfv1.DAGTask, ctx DagContext) string {
if dagTask.Depends != "" {
return dagTask.Depends
}
// For backwards compatibility, "dependencies: [A, B]" is equivalent to "depends: (A.Successful || A.Skipped || A.Daemoned)) && (B.Successful || B.Skipped || B.Daemoned)"
var dependencies []string
for _, dependency := range dagTask.Dependencies {
depTask := ctx.GetTask(dependency)
dependencies = append(dependencies, expandDependency(dependency, depTask))
}
return strings.Join(dependencies, " && ")
}
func expandDependency(depName string, depTask *wfv1.DAGTask) string {
resultForTask := func(result TaskResult) string { return fmt.Sprintf("%s.%s", depName, result) }
taskDepends := []string{resultForTask(TaskResultSucceeded), resultForTask(TaskResultSkipped), resultForTask(TaskResultDaemoned)}
if depTask.ContinueOn != nil {
if depTask.ContinueOn.Error {
taskDepends = append(taskDepends, resultForTask(TaskResultErrored))
}
if depTask.ContinueOn.Failed {
taskDepends = append(taskDepends, resultForTask(TaskResultFailed))
}
}
return "(" + strings.Join(taskDepends, " || ") + ")"
}
// GetTaskAncestry returns a list of taskNames which are ancestors of this task.
// The list is ordered by the tasks finished time.
func GetTaskAncestry(ctx DagContext, taskName string) []string {
visited := make(map[string]time.Time)
var getAncestry func(currTask string)
getAncestry = func(currTask string) {
if _, seen := visited[currTask]; seen {
return
}
for _, depTask := range ctx.GetTaskDependencies(currTask) {
getAncestry(depTask)
}
if currTask != taskName {
if _, ok := visited[currTask]; !ok {
visited[currTask] = ctx.GetTaskFinishedAtTime(currTask)
}
}
}
getAncestry(taskName)
ancestry := make([]string, len(visited))
for newTask, newFinishedAt := range visited {
insertTask(visited, ancestry, newTask, newFinishedAt)
}
return ancestry
}
// insertTask inserts the newTaskName at the right position ordered by time into the ancestry list.
func insertTask(visited map[string]time.Time, ancestry []string, newTaskName string, finishedAt time.Time) {
for i, taskName := range ancestry {
if taskName == "" {
ancestry[i] = newTaskName
return
}
if finishedAt.Before(visited[taskName]) {
// insert at position i and shift others
copy(ancestry[i+1:], ancestry[i:])
ancestry[i] = newTaskName
return
}
}
}