Lines Matching defs:DFS

1269   /// Returns true if this node been visited by the DFS traversal.
1378   /// Joins the predecessor subtree with the successor that is its DFS parent.
1478     SchedDAGReverseDFS DFS;
1480     DFS.follow(&SU);
1483       while (DFS.getPred() != DFS.getPredEnd()) {
1484         const SDep &PredDep = *DFS.getPred();
1485         DFS.advance();
1493           Impl.visitCrossEdge(PredDep, DFS.getCurr());
1497         DFS.follow(PredDep.getSUnit());
1500       const SUnit *Child = DFS.getCurr();
1501       const SDep *PredDep = DFS.backtrack();
1504         Impl.visitPostorderEdge(*PredDep, DFS.getCurr());
1505       if (DFS.isComplete())