1215     for (const SDep &PredDep : SU->Preds) {  in visitPostorderNode()  local
1216       if (PredDep.getKind() != SDep::Data)  in visitPostorderNode()
1218       unsigned PredNum = PredDep.getSUnit()->NodeNum;  in visitPostorderNode()
1220         joinPredSubtree(PredDep, SU, /*CheckLimit=*/false);  in visitPostorderNode()
1244   void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) {  in visitPostorderEdge()  argument
1246       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1247     joinPredSubtree(PredDep, Succ);  in visitPostorderEdge()
1251   void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) {  in visitCrossEdge()  argument
1252     ConnectionPairs.push_back(std::make_pair(PredDep.getSUnit(), Succ));  in visitCrossEdge()
1294   bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ,  in joinPredSubtree()  argument
1296     assert(PredDep.getKind() == SDep::Data && "Subtrees are for data edges");  in joinPredSubtree()
1299     const SUnit *PredSU = PredDep.getSUnit();  in joinPredSubtree()
1398         const SDep &PredDep = *DFS.getPred();  in compute()  local
1401         if (PredDep.getKind() != SDep::Data  in compute()
1402             || PredDep.getSUnit()->isBoundaryNode()) {  in compute()
1406         if (Impl.isVisited(PredDep.getSUnit())) {  in compute()
1407           Impl.visitCrossEdge(PredDep, DFS.getCurr());  in compute()
1410         Impl.visitPreorder(PredDep.getSUnit());  in compute()
1411         DFS.follow(PredDep.getSUnit());  in compute()
1415       const SDep *PredDep = DFS.backtrack();  in compute()  local
1417       if (PredDep)  in compute()
1418         Impl.visitPostorderEdge(*PredDep, DFS.getCurr());  in compute()