Lines Matching refs:NodeNum

594     dbgs() << SU->NodeNum << " ";  in dump()
1132 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") " in updatePressureDiffs()
1167 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " in updatePressureDiffs()
1380 LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" in computeCyclicCriticalPath()
1381 << SU->NodeNum << ") = " << CyclicLatency << "c\n"); in computeCyclicCriticalPath()
1498 return std::make_tuple(BaseOp->getReg(), Offset, SU->NodeNum) < in operator <()
1500 RHS.SU->NodeNum); in operator <()
1516 return SU->NodeNum < RHS.SU->NodeNum; in operator <()
1593 LLVM_DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU(" in clusterNeighboringMemOps()
1594 << SUb->NodeNum << ")\n"); in clusterNeighboringMemOps()
1602 LLVM_DEBUG(dbgs() << " Copy Succ SU(" << Succ.getSUnit()->NodeNum in clusterNeighboringMemOps()
1628 ChainPredID = Pred.getSUnit()->NodeNum; in apply()
1812 LLVM_DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n"); in constrainLocalCopy()
1816 LLVM_DEBUG(dbgs() << " Local use SU(" << (*I)->NodeNum << ") -> SU(" in constrainLocalCopy()
1817 << GlobalSU->NodeNum << ")\n"); in constrainLocalCopy()
1822 LLVM_DEBUG(dbgs() << " Global use SU(" << (*I)->NodeNum << ") -> SU(" in constrainLocalCopy()
1823 << FirstLocalSU->NodeNum << ")\n"); in constrainLocalCopy()
1981 LLVM_DEBUG(dbgs() << " SU(" << SU->NodeNum << ") uops=" in checkHazard()
1989 LLVM_DEBUG(dbgs() << " hazard: SU(" << SU->NodeNum << ") must " in checkHazard()
2006 LLVM_DEBUG(dbgs() << " SU(" << SU->NodeNum << ") " in checkHazard()
2030 << LateSU->NodeNum << ") " << RemLatency << "c\n"); in findMaxLatency()
2270 << SU->NodeNum << ") " << TopLatency << "c\n"); in bumpNode()
2275 << SU->NodeNum << ") " << BotLatency << "c\n"); in bumpNode()
2599 dbgs() << " Cand SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
2952 << " Try SU(" << Cand.SU->NodeNum << ") " in initCandidate()
3063 if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum) in tryCandidate()
3064 || (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) { in tryCandidate()
3220 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " in pickNode()
3366 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) in tryCandidate()
3412 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " in pickNode()
3503 << "SU(" << SU->NodeNum << ") " in pickNode()
3560 return A->NodeNum > B->NodeNum; in operator ()()
3562 return A->NodeNum < B->NodeNum; in operator ()()
3688 SS << "SU:" << SU->NodeNum; in getNodeLabel()