aboutsummaryrefslogtreecommitdiffhomepage
path: root/src/main/java/com/google/devtools/build/skyframe/ParallelEvaluator.java
diff options
context:
space:
mode:
authorGravatar Nathan Harmata <nharmata@google.com>2015-02-10 02:13:05 +0000
committerGravatar Han-Wen Nienhuys <hanwen@google.com>2015-02-10 02:13:05 +0000
commitb408f9e718f0f27af081e2cf878f9654f1e43e00 (patch)
tree94065f7b21054d050f57bc8f91fa5ba0e54dab2d /src/main/java/com/google/devtools/build/skyframe/ParallelEvaluator.java
parent802c8861ac309e9cdb5ad357ff79a366e5890d96 (diff)
Refactor NodeEntry to be an interface.
-- MOS_MIGRATED_REVID=85946859
Diffstat (limited to 'src/main/java/com/google/devtools/build/skyframe/ParallelEvaluator.java')
-rw-r--r--src/main/java/com/google/devtools/build/skyframe/ParallelEvaluator.java3
1 files changed, 1 insertions, 2 deletions
diff --git a/src/main/java/com/google/devtools/build/skyframe/ParallelEvaluator.java b/src/main/java/com/google/devtools/build/skyframe/ParallelEvaluator.java
index 39f11d79ab..a99105847b 100644
--- a/src/main/java/com/google/devtools/build/skyframe/ParallelEvaluator.java
+++ b/src/main/java/com/google/devtools/build/skyframe/ParallelEvaluator.java
@@ -40,7 +40,6 @@ import com.google.devtools.build.lib.events.StoredEventHandler;
import com.google.devtools.build.lib.profiler.Profiler;
import com.google.devtools.build.lib.profiler.ProfilerTask;
import com.google.devtools.build.lib.util.GroupedList.GroupedListHelper;
-import com.google.devtools.build.skyframe.BuildingState.DirtyState;
import com.google.devtools.build.skyframe.EvaluationProgressReceiver.EvaluationState;
import com.google.devtools.build.skyframe.NodeEntry.DependencyState;
import com.google.devtools.build.skyframe.Scheduler.SchedulerException;
@@ -1580,7 +1579,7 @@ public final class ParallelEvaluator implements Evaluator {
cyclesFound++;
Iterable<SkyKey> cycle = graphPath.subList(cycleStart, graphPath.size());
// Put this node into a consistent state for building if it is dirty.
- if (entry.isDirty() && entry.getDirtyState() == DirtyState.CHECK_DEPENDENCIES) {
+ if (entry.isDirty() && entry.getDirtyState() == NodeEntry.DirtyState.CHECK_DEPENDENCIES) {
// In the check deps state, entry has exactly one child not done yet. Note that this node
// must be part of the path to the cycle we have found (since done nodes cannot be in
// cycles, and this is the only missing one). Thus, it will not be removed below in