-
Notifications
You must be signed in to change notification settings - Fork 1.7k
/
filter.go
428 lines (407 loc) · 13.4 KB
/
filter.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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
package filter
import (
"fmt"
"strings"
"github.com/hashicorp/go-hclog"
"github.com/pkg/errors"
"github.com/pyr-sh/dag"
"github.com/vercel/turbo/cli/internal/doublestar"
"github.com/vercel/turbo/cli/internal/turbopath"
"github.com/vercel/turbo/cli/internal/util"
"github.com/vercel/turbo/cli/internal/workspace"
)
type SelectedPackages struct {
pkgs util.Set
unusedFilters []*TargetSelector
}
// PackagesChangedInRange is the signature of a function to provide the set of
// packages that have changed in a particular range of git refs.
type PackagesChangedInRange = func(fromRef string, toRef string) (util.Set, error)
// PackageInference holds the information we have inferred from the working-directory
// (really --infer-filter-root flag) about which packages are of interest.
type PackageInference struct {
// PackageName, if set, means that we have determined that filters without a package-specifier
// should get this package name
PackageName string
// DirectoryRoot is used to infer a "parentDir" for the filter in the event that we haven't
// identified a specific package. If the filter already contains a parentDir, this acts as
// a prefix. If the filter does not contain a parentDir, we consider this to be a glob for
// all subdirectories
DirectoryRoot turbopath.RelativeSystemPath
}
type Resolver struct {
Graph *dag.AcyclicGraph
WorkspaceInfos workspace.Catalog
Cwd turbopath.AbsoluteSystemPath
Inference *PackageInference
PackagesChangedInRange PackagesChangedInRange
Logger hclog.Logger
}
// GetPackagesFromPatterns compiles filter patterns and applies them, returning
// the selected packages
func (r *Resolver) GetPackagesFromPatterns(patterns []string) (util.Set, error) {
selectors := []*TargetSelector{}
for _, pattern := range patterns {
selector, err := ParseTargetSelector(pattern)
if err != nil {
return nil, err
}
r.Logger.Debug("Parsed selector", "selector", hclog.Fmt("%+v", selector))
selectors = append(selectors, selector)
}
selected, err := r.getFilteredPackages(selectors)
if err != nil {
return nil, err
}
return selected.pkgs, nil
}
func (pi *PackageInference) apply(selector *TargetSelector) error {
if selector.namePattern != "" {
// The selector references a package name, don't apply inference
return nil
}
if pi.PackageName != "" {
selector.namePattern = pi.PackageName
}
if selector.parentDir != "" {
parentDir := pi.DirectoryRoot.Join(selector.parentDir)
selector.parentDir = parentDir
} else if pi.PackageName == "" {
// The user didn't set a parent directory and we didn't find a single package,
// so use the directory we inferred and select all subdirectories
selector.parentDir = pi.DirectoryRoot.Join("**")
}
return nil
}
func (r *Resolver) applyInference(selectors []*TargetSelector) ([]*TargetSelector, error) {
if r.Inference == nil {
return selectors, nil
}
// If there are existing patterns, use inference on those. If there are no
// patterns, but there is a directory supplied, synthesize a selector
if len(selectors) == 0 {
selectors = append(selectors, &TargetSelector{})
}
for _, selector := range selectors {
if err := r.Inference.apply(selector); err != nil {
return nil, err
}
}
return selectors, nil
}
func (r *Resolver) getFilteredPackages(selectors []*TargetSelector) (*SelectedPackages, error) {
selectors, err := r.applyInference(selectors)
if err != nil {
return nil, err
}
prodPackageSelectors := []*TargetSelector{}
allPackageSelectors := []*TargetSelector{}
for _, selector := range selectors {
if selector.followProdDepsOnly {
prodPackageSelectors = append(prodPackageSelectors, selector)
} else {
allPackageSelectors = append(allPackageSelectors, selector)
}
}
r.Logger.Debug("Filtering packages", "allPackageSelectors", allPackageSelectors)
if len(allPackageSelectors) > 0 || len(prodPackageSelectors) > 0 {
if len(allPackageSelectors) > 0 {
selected, err := r.filterGraph(allPackageSelectors)
if err != nil {
return nil, err
}
return selected, nil
}
}
return &SelectedPackages{
pkgs: make(util.Set),
}, nil
}
func (r *Resolver) filterGraph(selectors []*TargetSelector) (*SelectedPackages, error) {
includeSelectors := []*TargetSelector{}
excludeSelectors := []*TargetSelector{}
for _, selector := range selectors {
if selector.exclude {
excludeSelectors = append(excludeSelectors, selector)
} else {
includeSelectors = append(includeSelectors, selector)
}
}
var include *SelectedPackages
if len(includeSelectors) > 0 {
found, err := r.filterGraphWithSelectors(includeSelectors)
if err != nil {
return nil, err
}
include = found
} else {
vertexSet := make(util.Set)
for _, v := range r.Graph.Vertices() {
vertexSet.Add(v)
}
include = &SelectedPackages{
pkgs: vertexSet,
}
}
exclude, err := r.filterGraphWithSelectors(excludeSelectors)
if err != nil {
return nil, err
}
return &SelectedPackages{
pkgs: include.pkgs.Difference(exclude.pkgs),
unusedFilters: append(include.unusedFilters, exclude.unusedFilters...),
}, nil
}
func (r *Resolver) filterGraphWithSelectors(selectors []*TargetSelector) (*SelectedPackages, error) {
unmatchedSelectors := []*TargetSelector{}
cherryPickedPackages := make(dag.Set)
walkedDependencies := make(dag.Set)
walkedDependents := make(dag.Set)
walkedDependentsDependencies := make(dag.Set)
for _, selector := range selectors {
// TODO(gsoltis): this should be a list?
entryPackages, err := r.filterGraphWithSelector(selector)
r.Logger.Debug("Filtered packages", "selector", hclog.Fmt("%+v", selector), "entryPackages", entryPackages)
if err != nil {
return nil, err
}
if entryPackages.Len() == 0 {
unmatchedSelectors = append(unmatchedSelectors, selector)
}
for _, pkg := range entryPackages {
if selector.includeDependencies {
dependencies, err := r.Graph.Ancestors(pkg)
if err != nil {
return nil, errors.Wrapf(err, "failed to get dependencies of package %v", pkg)
}
for dep := range dependencies {
walkedDependencies.Add(dep)
}
if !selector.excludeSelf {
walkedDependencies.Add(pkg)
}
}
if selector.includeDependents {
dependents, err := r.Graph.Descendents(pkg)
if err != nil {
return nil, errors.Wrapf(err, "failed to get dependents of package %v", pkg)
}
for dep := range dependents {
walkedDependents.Add(dep)
if selector.includeDependencies {
dependentDeps, err := r.Graph.Ancestors(dep)
if err != nil {
return nil, errors.Wrapf(err, "failed to get dependencies of dependent %v", dep)
}
for dependentDep := range dependentDeps {
walkedDependentsDependencies.Add(dependentDep)
}
}
}
if !selector.excludeSelf {
walkedDependents.Add(pkg)
}
}
if !selector.includeDependencies && !selector.includeDependents {
cherryPickedPackages.Add(pkg)
}
}
}
r.Logger.Debug("Filtered packages", "cherryPickedPackages", cherryPickedPackages, "walkedDependencies", walkedDependencies, "walkedDependents", walkedDependents, "walkedDependentsDependencies", walkedDependentsDependencies)
allPkgs := make(util.Set)
for pkg := range cherryPickedPackages {
allPkgs.Add(pkg)
}
for pkg := range walkedDependencies {
allPkgs.Add(pkg)
}
for pkg := range walkedDependents {
allPkgs.Add(pkg)
}
for pkg := range walkedDependentsDependencies {
allPkgs.Add(pkg)
}
return &SelectedPackages{
pkgs: allPkgs,
unusedFilters: unmatchedSelectors,
}, nil
}
func (r *Resolver) filterGraphWithSelector(selector *TargetSelector) (util.Set, error) {
if selector.matchDependencies {
return r.filterSubtreesWithSelector(selector)
}
return r.filterNodesWithSelector(selector)
}
// filterNodesWithSelector returns the set of nodes that match a given selector
func (r *Resolver) filterNodesWithSelector(selector *TargetSelector) (util.Set, error) {
entryPackages := make(util.Set)
selectorWasUsed := false
if selector.fromRef != "" {
// get changed packaged
selectorWasUsed = true
changedPkgs, err := r.PackagesChangedInRange(selector.fromRef, selector.getToRef())
if err != nil {
return nil, err
}
parentDir := selector.parentDir
for pkgName := range changedPkgs {
if parentDir != "" {
// Type assert/coerce to string here because we want to use
// this value in a map that has string keys.
// TODO(mehulkar) `changedPkgs` is a util.Set, we could make a `util.PackageNamesSet``
// or something similar that is all strings.
pkgNameStr := pkgName.(string)
if pkgName == util.RootPkgName {
// The root package changed, only add it if
// the parentDir is equivalent to the root
if matches, err := doublestar.PathMatch(r.Cwd.Join(parentDir).ToString(), r.Cwd.ToString()); err != nil {
return nil, fmt.Errorf("failed to resolve directory relationship %v contains %v: %v", parentDir, r.Cwd, err)
} else if matches {
entryPackages.Add(pkgName)
}
} else if pkg, ok := r.WorkspaceInfos.PackageJSONs[pkgNameStr]; !ok {
return nil, fmt.Errorf("missing info for package %v", pkgName)
} else if matches, err := doublestar.PathMatch(r.Cwd.Join(parentDir).ToString(), pkg.Dir.RestoreAnchor(r.Cwd).ToString()); err != nil {
return nil, fmt.Errorf("failed to resolve directory relationship %v contains %v: %v", selector.parentDir, pkg.Dir, err)
} else if matches {
entryPackages.Add(pkgName)
}
} else {
entryPackages.Add(pkgName)
}
}
} else if selector.parentDir != "" {
// get packages by path
selectorWasUsed = true
parentDir := selector.parentDir
if parentDir == "." {
entryPackages.Add(util.RootPkgName)
} else {
for name, pkg := range r.WorkspaceInfos.PackageJSONs {
if matches, err := doublestar.PathMatch(r.Cwd.Join(parentDir).ToString(), pkg.Dir.RestoreAnchor(r.Cwd).ToString()); err != nil {
return nil, fmt.Errorf("failed to resolve directory relationship %v contains %v: %v", selector.parentDir, pkg.Dir, err)
} else if matches {
entryPackages.Add(name)
}
}
}
}
if selector.namePattern != "" {
// find packages that match name
if !selectorWasUsed {
matched, err := matchPackageNamesToVertices(selector.namePattern, r.Graph.Vertices())
if err != nil {
return nil, err
}
entryPackages = matched
selectorWasUsed = true
} else {
matched, err := matchPackageNames(selector.namePattern, entryPackages)
if err != nil {
return nil, err
}
entryPackages = matched
}
}
// TODO(gsoltis): we can do this earlier
// Check if the selector specified anything
if !selectorWasUsed {
return nil, fmt.Errorf("invalid selector: %v", selector.raw)
}
return entryPackages, nil
}
// filterSubtreesWithSelector returns the set of nodes where the node or any of its dependencies
// match a selector
func (r *Resolver) filterSubtreesWithSelector(selector *TargetSelector) (util.Set, error) {
// foreach package that matches parentDir && namePattern, check if any dependency is in changed packages
changedPkgs, err := r.PackagesChangedInRange(selector.fromRef, selector.getToRef())
if err != nil {
return nil, err
}
parentDir := selector.parentDir
entryPackages := make(util.Set)
for name, pkg := range r.WorkspaceInfos.PackageJSONs {
if parentDir == "" {
entryPackages.Add(name)
} else if matches, err := doublestar.PathMatch(r.Cwd.Join(parentDir).ToString(), pkg.Dir.RestoreAnchor(r.Cwd).ToString()); err != nil {
return nil, fmt.Errorf("failed to resolve directory relationship %v contains %v: %v", selector.parentDir, pkg.Dir, err)
} else if matches {
entryPackages.Add(name)
}
}
if selector.namePattern != "" {
matched, err := matchPackageNames(selector.namePattern, entryPackages)
if err != nil {
return nil, err
}
entryPackages = matched
}
roots := make(util.Set)
matched := make(util.Set)
for pkg := range entryPackages {
if matched.Includes(pkg) {
roots.Add(pkg)
continue
}
deps, err := r.Graph.Ancestors(pkg)
if err != nil {
return nil, err
}
for changedPkg := range changedPkgs {
if !selector.excludeSelf && pkg == changedPkg {
roots.Add(pkg)
break
}
if deps.Include(changedPkg) {
roots.Add(pkg)
matched.Add(changedPkg)
break
}
}
}
return roots, nil
}
func matchPackageNamesToVertices(pattern string, vertices []dag.Vertex) (util.Set, error) {
packages := make(util.Set)
for _, v := range vertices {
packages.Add(v)
}
packages.Add(util.RootPkgName)
return matchPackageNames(pattern, packages)
}
func matchPackageNames(pattern string, packages util.Set) (util.Set, error) {
matcher, err := matcherFromPattern(pattern)
if err != nil {
return nil, err
}
matched := make(util.Set)
for _, pkg := range packages {
pkg := pkg.(string)
if matcher(pkg) {
matched.Add(pkg)
}
}
if matched.Len() == 0 && !strings.HasPrefix(pattern, "@") && !strings.Contains(pattern, "/") {
// we got no matches and the pattern isn't a scoped package.
// Check if we have exactly one scoped package that does match
scopedPattern := fmt.Sprintf("@*/%v", pattern)
matcher, err = matcherFromPattern(scopedPattern)
if err != nil {
return nil, err
}
foundScopedPkg := false
for _, pkg := range packages {
pkg := pkg.(string)
if matcher(pkg) {
if foundScopedPkg {
// we found a second scoped package. Return the empty set, we can't
// disambiguate
return make(util.Set), nil
}
foundScopedPkg = true
matched.Add(pkg)
}
}
}
return matched, nil
}