lib/CodeGen/ScheduleDAGInstrs.cpp

1255   /// Returns true if this node been visited by the DFS traversal.
1364   /// Joins the predecessor subtree with the successor that is its DFS parent.
1464     SchedDAGReverseDFS DFS;
1466     DFS.follow(&SU);
1469       while (DFS.getPred() != DFS.getPredEnd()) {
1470         const SDep &PredDep = *DFS.getPred();
1471         DFS.advance();
1479           Impl.visitCrossEdge(PredDep, DFS.getCurr());
1483         DFS.follow(PredDep.getSUnit());
1486       const SUnit *Child = DFS.getCurr();
1487       const SDep *PredDep = DFS.backtrack();
1490         Impl.visitPostorderEdge(*PredDep, DFS.getCurr());
1491       if (DFS.isComplete())