Lines Matching defs:DFS
1403 /// Return true if this node been visited by the DFS traversal.
1516 /// Join the predecessor subtree with the successor that is its DFS
1616 SchedDAGReverseDFS DFS;
1618 DFS.follow(SU);
1621 while (DFS.getPred() != DFS.getPredEnd()) {
1622 const SDep &PredDep = *DFS.getPred();
1623 DFS.advance();
1631 Impl.visitCrossEdge(PredDep, DFS.getCurr());
1635 DFS.follow(PredDep.getSUnit());
1638 const SUnit *Child = DFS.getCurr();
1639 const SDep *PredDep = DFS.backtrack();
1642 Impl.visitPostorderEdge(*PredDep, DFS.getCurr());
1643 if (DFS.isComplete())
