Home | History | Annotate | Download | only in CodeGen

Lines Matching refs:PredDep

1465   void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) {
1467       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;
1468     joinPredSubtree(PredDep, Succ);
1472   void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) {
1473     ConnectionPairs.push_back(std::make_pair(PredDep.getSUnit(), Succ));
1518   bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ,
1520     assert(PredDep.getKind() == SDep::Data && "Subtrees are for data edges");
1523     const SUnit *PredSU = PredDep.getSUnit();
1622         const SDep &PredDep = *DFS.getPred();
1625         if (PredDep.getKind() != SDep::Data
1626             || PredDep.getSUnit()->isBoundaryNode()) {
1630         if (Impl.isVisited(PredDep.getSUnit())) {
1631           Impl.visitCrossEdge(PredDep, DFS.getCurr());
1634         Impl.visitPreorder(PredDep.getSUnit());
1635         DFS.follow(PredDep.getSUnit());
1639       const SDep *PredDep = DFS.backtrack();
1641       if (PredDep)
1642         Impl.visitPostorderEdge(*PredDep, DFS.getCurr());