Lines Matching refs:NodeNum
40 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max(); in isScheduled()
45 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max(); in setIsScheduled()
50 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in getNumPreds()
51 return NumPreds[SU->NodeNum]; in getNumPreds()
56 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in decNumPreds()
57 return --NumPreds[SU->NodeNum]; in decNumPreds()
148 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready " in pickCandidate()
159 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res in pickCandidate()
170 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
201 LLVM_DEBUG(dbgs() << "Make the predecessors of SU(" << SchedSU->NodeNum in bumpPredsPriority()
207 LLVM_DEBUG(dbgs() << " SU(" << C.SU->NodeNum << ')'); in bumpPredsPriority()
246 << ' ' << C.SU->NodeNum << "(P" << C.Priority << ')'; in schedule()