Lines Matching defs:DFS

1266   /// Returns true if this node been visited by the DFS traversal.
1375   /// Joins the predecessor subtree with the successor that is its DFS parent.
1475     SchedDAGReverseDFS DFS;
1477     DFS.follow(&SU);
1480       while (DFS.getPred() != DFS.getPredEnd()) {
1481         const SDep &PredDep = *DFS.getPred();
1482         DFS.advance();
1490           Impl.visitCrossEdge(PredDep, DFS.getCurr());
1494         DFS.follow(PredDep.getSUnit());
1497       const SUnit *Child = DFS.getCurr();
1498       const SDep *PredDep = DFS.backtrack();
1501         Impl.visitPostorderEdge(*PredDep, DFS.getCurr());
1502       if (DFS.isComplete())