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
|
// 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.skyframe;
import com.google.common.base.Function;
import com.google.devtools.build.lib.concurrent.AbstractQueueVisitor;
import com.google.devtools.build.lib.concurrent.ErrorHandler;
import com.google.devtools.build.lib.concurrent.ExecutorParams;
import com.google.devtools.build.skyframe.InvalidatingNodeVisitor.DeletingNodeVisitor;
import com.google.devtools.build.skyframe.InvalidatingNodeVisitor.DirtyingNodeVisitor;
import com.google.devtools.build.skyframe.InvalidatingNodeVisitor.InvalidationState;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.ForkJoinPool;
import javax.annotation.Nullable;
/**
* Utility class for performing eager invalidation on Skyframe graphs.
*
* <p>This is intended only for use in alternative {@code MemoizingEvaluator} implementations.
*/
public final class EagerInvalidator {
private EagerInvalidator() {}
/**
* Deletes given values. The {@code traverseGraph} parameter controls whether this method deletes
* (transitive) dependents of these nodes and relevant graph edges, or just the nodes themselves.
* Deleting just the nodes is inconsistent unless the graph will not be used for incremental
* builds in the future, but unfortunately there is a case where we delete nodes intra-build. As
* long as the full upward transitive closure of the nodes is specified for deletion, the graph
* remains consistent.
*/
public static void delete(
InMemoryGraph graph,
Iterable<SkyKey> diff,
DirtyTrackingProgressReceiver progressReceiver,
InvalidationState state,
boolean traverseGraph)
throws InterruptedException {
DeletingNodeVisitor visitor =
createDeletingVisitorIfNeeded(
graph, diff, progressReceiver, state, traverseGraph);
if (visitor != null) {
visitor.run();
}
}
@Nullable
static DeletingNodeVisitor createDeletingVisitorIfNeeded(
InMemoryGraph graph,
Iterable<SkyKey> diff,
DirtyTrackingProgressReceiver progressReceiver,
InvalidationState state,
boolean traverseGraph) {
state.update(diff);
return state.isEmpty() ? null
: new DeletingNodeVisitor(graph, progressReceiver, state, traverseGraph);
}
@Nullable
static DirtyingNodeVisitor createInvalidatingVisitorIfNeeded(
QueryableGraph graph,
Iterable<SkyKey> diff,
DirtyTrackingProgressReceiver progressReceiver,
InvalidationState state,
Function<ExecutorParams, ? extends ExecutorService> executorFactory) {
state.update(diff);
return state.isEmpty() ? null
: new DirtyingNodeVisitor(graph, progressReceiver, state, executorFactory);
}
@Nullable
private static DirtyingNodeVisitor createInvalidatingVisitorIfNeeded(
QueryableGraph graph,
Iterable<SkyKey> diff,
DirtyTrackingProgressReceiver progressReceiver,
InvalidationState state,
ForkJoinPool forkJoinPool,
boolean supportInterruptions,
ErrorHandler errorHandler) {
state.update(diff);
return state.isEmpty()
? null
: new DirtyingNodeVisitor(
graph,
progressReceiver,
state,
forkJoinPool,
supportInterruptions);
}
/**
* Invalidates given values and their upward transitive closure in the graph if necessary, using
* an executor constructed with the provided factory.
*/
public static void invalidate(
QueryableGraph graph,
Iterable<SkyKey> diff,
DirtyTrackingProgressReceiver progressReceiver,
InvalidationState state,
Function<ExecutorParams, ? extends ExecutorService> executorFactory)
throws InterruptedException {
DirtyingNodeVisitor visitor =
createInvalidatingVisitorIfNeeded(
graph, diff, progressReceiver, state, executorFactory);
if (visitor != null) {
visitor.run();
}
}
/**
* Invalidates given values and their upward transitive closure in the graph if necessary, using
* the provided {@link ForkJoinPool}.
*/
public static void invalidate(
QueryableGraph graph,
Iterable<SkyKey> diff,
DirtyTrackingProgressReceiver progressReceiver,
InvalidationState state,
ForkJoinPool forkJoinPool,
boolean supportInterruptions)
throws InterruptedException {
DirtyingNodeVisitor visitor =
createInvalidatingVisitorIfNeeded(
graph,
diff,
progressReceiver,
state,
forkJoinPool,
supportInterruptions,
ErrorHandler.NullHandler.INSTANCE);
if (visitor != null) {
visitor.run();
}
}
/** Invalidates given values and their upward transitive closure in the graph. */
public static void invalidate(
QueryableGraph graph,
Iterable<SkyKey> diff,
DirtyTrackingProgressReceiver progressReceiver,
InvalidationState state)
throws InterruptedException {
invalidate(graph, diff, progressReceiver, state, AbstractQueueVisitor.EXECUTOR_FACTORY);
}
}
|
