Lines Matching defs:DFS
1250 /// Return true if this node been visited by the DFS traversal.
1363 /// Join the predecessor subtree with the successor that is its DFS
1463 SchedDAGReverseDFS DFS;
1465 DFS.follow(SU);
1468 while (DFS.getPred() != DFS.getPredEnd()) {
1469 const SDep &PredDep = *DFS.getPred();
1470 DFS.advance();
1478 Impl.visitCrossEdge(PredDep, DFS.getCurr());
1482 DFS.follow(PredDep.getSUnit());
1485 const SUnit *Child = DFS.getCurr();
1486 const SDep *PredDep = DFS.backtrack();
1489 Impl.visitPostorderEdge(*PredDep, DFS.getCurr());
1490 if (DFS.isComplete())
