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
|
// Copyright 2014 The Bazel Authors. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package com.google.devtools.build.lib.query2.engine;
import com.google.common.base.Predicate;
import com.google.common.base.Predicates;
import com.google.common.collect.ImmutableList;
import com.google.common.collect.Iterables;
import com.google.common.collect.Sets;
import com.google.devtools.build.lib.query2.engine.QueryEnvironment.Argument;
import com.google.devtools.build.lib.query2.engine.QueryEnvironment.ArgumentType;
import com.google.devtools.build.lib.query2.engine.QueryEnvironment.QueryFunction;
import com.google.devtools.build.lib.query2.engine.QueryEnvironment.QueryTaskCallable;
import com.google.devtools.build.lib.query2.engine.QueryEnvironment.QueryTaskFuture;
import com.google.devtools.build.lib.query2.engine.QueryEnvironment.ThreadSafeMutableSet;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
/**
* Implementation of the <code>allpaths()</code> function.
*/
public class AllPathsFunction implements QueryFunction {
AllPathsFunction() {
}
@Override
public String getName() {
return "allpaths";
}
@Override
public int getMandatoryArguments() {
return 2;
}
@Override
public List<ArgumentType> getArgumentTypes() {
return ImmutableList.of(ArgumentType.EXPRESSION, ArgumentType.EXPRESSION);
}
@Override
public <T> QueryTaskFuture<Void> eval(
final QueryEnvironment<T> env,
QueryExpressionContext<T> context,
final QueryExpression expression,
List<Argument> args,
final Callback<T> callback) {
final QueryTaskFuture<ThreadSafeMutableSet<T>> fromValueFuture =
QueryUtil.evalAll(env, context, args.get(0).getExpression());
final QueryTaskFuture<ThreadSafeMutableSet<T>> toValueFuture =
QueryUtil.evalAll(env, context, args.get(1).getExpression());
return env.whenAllSucceedCall(
ImmutableList.of(fromValueFuture, toValueFuture),
new QueryTaskCallable<Void>() {
@Override
public Void call() throws QueryException, InterruptedException {
// Algorithm: compute "reachableFromX", the forward transitive closure of
// the "from" set, then find the intersection of "reachableFromX" with the
// reverse transitive closure of the "to" set. The reverse transitive
// closure and intersection operations are interleaved for efficiency.
// "result" holds the intersection.
ThreadSafeMutableSet<T> fromValue = fromValueFuture.getIfSuccessful();
ThreadSafeMutableSet<T> toValue = toValueFuture.getIfSuccessful();
env.buildTransitiveClosure(expression, fromValue, Integer.MAX_VALUE);
Set<T> reachableFromX = env.getTransitiveClosure(fromValue, context);
Predicate<T> reachable = Predicates.in(reachableFromX);
Uniquifier<T> uniquifier = env.createUniquifier();
Collection<T> result = uniquifier.unique(intersection(reachableFromX, toValue));
callback.process(result);
Collection<T> worklist = result;
while (!worklist.isEmpty()) {
Iterable<T> reverseDeps = env.getReverseDeps(worklist, context);
worklist = uniquifier.unique(Iterables.filter(reverseDeps, reachable));
callback.process(worklist);
}
return null;
}
});
}
/**
* Returns a (new, mutable, unordered) set containing the intersection of the
* two specified sets.
*/
private static <T> Set<T> intersection(Set<T> x, Set<T> y) {
Set<T> result = new HashSet<>();
if (x.size() > y.size()) {
Sets.intersection(y, x).copyInto(result);
} else {
Sets.intersection(x, y).copyInto(result);
}
return result;
}
}
|
