@@ -239,17 +239,17 @@ namespace driver {
239
239
// /
240
240
// / Dependency graphs for deciding which jobs are dirty (need running)
241
241
// / or clean (can be skipped).
242
- using DependencyGraph = DependencyGraph <const Job *>;
243
- DependencyGraph StandardDepGraph ;
244
- DependencyGraph StandardDepGraphForRanges ;
242
+ using CoarseGrainedDependencyGraph = CoarseGrainedDependencyGraph <const Job *>;
243
+ CoarseGrainedDependencyGraph CoarseGrainedDepGraph ;
244
+ CoarseGrainedDependencyGraph CoarseGrainedDepGraphForRanges ;
245
245
246
246
fine_grained_dependencies::ModuleDepGraph ExpDepGraph;
247
247
fine_grained_dependencies::ModuleDepGraph ExpDepGraphForRanges;
248
248
249
249
private:
250
250
// / Helper for tracing the propagation of marks in the graph.
251
- DependencyGraph ::MarkTracer ActualIncrementalTracer;
252
- DependencyGraph ::MarkTracer *IncrementalTracer = nullptr ;
251
+ CoarseGrainedDependencyGraph ::MarkTracer ActualIncrementalTracer;
252
+ CoarseGrainedDependencyGraph ::MarkTracer *IncrementalTracer = nullptr ;
253
253
254
254
// / TaskQueue for execution.
255
255
std::unique_ptr<TaskQueue> TQ;
@@ -1063,7 +1063,7 @@ namespace driver {
1063
1063
// start nodes in the "Always" condition from the start instead of
1064
1064
// using markIntransitive and having later functions call
1065
1065
// markTransitive. That way markIntransitive would be an
1066
- // implementation detail of DependencyGraph .
1066
+ // implementation detail of CoarseGrainedDependencyGraph .
1067
1067
markIntransitiveInDepGraph (Cmd, forRanges);
1068
1068
}
1069
1069
LLVM_FALLTHROUGH;
@@ -1586,7 +1586,7 @@ namespace driver {
1586
1586
: getDepGraph (forRanges).markIntransitive (Cmd);
1587
1587
}
1588
1588
1589
- DependencyGraph ::LoadResult loadDepGraphFromPath (const Job *Cmd,
1589
+ CoarseGrainedDependencyGraph ::LoadResult loadDepGraphFromPath (const Job *Cmd,
1590
1590
StringRef path,
1591
1591
DiagnosticEngine &diags,
1592
1592
const bool forRanges) {
@@ -1599,7 +1599,7 @@ namespace driver {
1599
1599
void
1600
1600
markTransitiveInDepGraph (SmallVector<const Job *, N> &visited,
1601
1601
const Job *Cmd, const bool forRanges,
1602
- DependencyGraph ::MarkTracer *tracer = nullptr ) {
1602
+ CoarseGrainedDependencyGraph ::MarkTracer *tracer = nullptr ) {
1603
1603
if (Comp.getEnableFineGrainedDependencies ())
1604
1604
getExpDepGraph (forRanges).markTransitive (visited, Cmd, tracer);
1605
1605
else
@@ -1617,15 +1617,15 @@ namespace driver {
1617
1617
getExpDepGraph (const bool forRanges) {
1618
1618
return forRanges ? ExpDepGraphForRanges : ExpDepGraph;
1619
1619
}
1620
- DependencyGraph &getDepGraph (const bool forRanges) {
1621
- return forRanges ? StandardDepGraphForRanges : StandardDepGraph ;
1620
+ CoarseGrainedDependencyGraph &getDepGraph (const bool forRanges) {
1621
+ return forRanges ? CoarseGrainedDepGraphForRanges : CoarseGrainedDepGraph ;
1622
1622
}
1623
1623
const fine_grained_dependencies::ModuleDepGraph &
1624
1624
getExpDepGraph (const bool forRanges) const {
1625
1625
return forRanges ? ExpDepGraphForRanges : ExpDepGraph;
1626
1626
}
1627
- const DependencyGraph &getDepGraph (const bool forRanges) const {
1628
- return forRanges ? StandardDepGraphForRanges : StandardDepGraph ;
1627
+ const CoarseGrainedDependencyGraph &getDepGraph (const bool forRanges) const {
1628
+ return forRanges ? CoarseGrainedDepGraphForRanges : CoarseGrainedDepGraph ;
1629
1629
}
1630
1630
};
1631
1631
} // namespace driver
0 commit comments