Lines Matching refs:NodeNum

47     return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max();  in isScheduled()
52     NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max();  in setIsScheduled()
57     assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max());  in getNumPreds()
58     return NumPreds[SU->NodeNum];  in getNumPreds()
63     assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max());  in decNumPreds()
64     return --NumPreds[SU->NodeNum];  in decNumPreds()
155       LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready "  in pickCandidate()
166       LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res  in pickCandidate()
177     Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; });  in pickCandidate()
208   LLVM_DEBUG(dbgs() << "Make the predecessors of SU(" << SchedSU->NodeNum  in bumpPredsPriority()
215       LLVM_DEBUG(dbgs() << " SU(" << C.SU->NodeNum << ')');  in bumpPredsPriority()
254                << ' ' << C.SU->NodeNum << "(P" << C.Priority << ')';  in schedule()