Searched refs:NumSuccsLeft (Results 1 - 5 of 5) sorted by relevance

/external/llvm/lib/CodeGen/
H A DScheduleDAG.cpp117 assert(N->NumSuccsLeft < UINT_MAX && "NumSuccsLeft will overflow!");
118 ++N->NumSuccsLeft;
166 assert(N->NumSuccsLeft > 0 && "NumSuccsLeft will underflow!");
167 --N->NumSuccsLeft;
325 dbgs() << " # succs left : " << NumSuccsLeft << "\n";
409 if (SUnits[i].NumSuccsLeft != 0) {
H A DMachineScheduler.cpp378 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. When
379 /// NumSuccsLeft reaches zero, release the predecessor node.
392 if (PredSU->NumSuccsLeft == 0) {
399 --PredSU->NumSuccsLeft;
400 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU)
634 if (!I->NumSuccsLeft)
2090 bool AtBoundary = isTop ? !SU->NumSuccsLeft : !SU->NumPredsLeft;
/external/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h276 unsigned NumSuccsLeft; // # of succs not scheduled. member in class:llvm::SUnit
314 NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), NumRegDefsLeft(0),
328 NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), NumRegDefsLeft(0),
341 NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), NumRegDefsLeft(0),
457 return NumSuccsLeft == 0;
/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGFast.cpp137 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to
143 if (PredSU->NumSuccsLeft == 0) {
150 --PredSU->NumSuccsLeft;
154 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
346 if (NewSU->NumSuccsLeft == 0) {
H A DScheduleDAGRRList.cpp362 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to
368 if (PredSU->NumSuccsLeft == 0) {
375 --PredSU->NumSuccsLeft;
385 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
798 assert(PredSU->NumSuccsLeft < UINT_MAX && "NumSuccsLeft will overflow!");
799 ++PredSU->NumSuccsLeft;
1091 if (NewSU->NumSuccsLeft == 0) {
2130 // NumSuccsLeft counts all deps. Don't compare it with NumSuccs which only
2132 if (PredSU->NumSuccsLeft !
[all...]

Completed in 151 milliseconds