Searched refs:NumSuccsLeft (Results 1 - 5 of 5) sorted by relevance
/external/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 118 assert(N->NumSuccsLeft < UINT_MAX && "NumSuccsLeft will overflow!"); 119 ++N->NumSuccsLeft; 167 assert(N->NumSuccsLeft > 0 && "NumSuccsLeft will underflow!"); 168 --N->NumSuccsLeft; 326 dbgs() << " # succs left : " << NumSuccsLeft << "\n"; 410 if (SUnits[i].NumSuccsLeft != 0) {
|
H A D | MachineScheduler.cpp | 555 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. When 556 /// NumSuccsLeft reaches zero, release the predecessor node. 569 if (PredSU->NumSuccsLeft == 0) { 581 --PredSU->NumSuccsLeft; 582 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) 734 if (!I->NumSuccsLeft) 2520 bool AtBoundary = isTop ? !SU->NumSuccsLeft : !SU->NumPredsLeft;
|
/external/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 282 unsigned NumSuccsLeft; // # of succs not scheduled. variable 322 NumPredsLeft(0), NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), 338 NumPredsLeft(0), NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), 353 NumPredsLeft(0), NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), 471 return NumSuccsLeft == 0;
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 138 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to 144 if (PredSU->NumSuccsLeft == 0) { 151 --PredSU->NumSuccsLeft; 155 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { 347 if (NewSU->NumSuccsLeft == 0) {
|
H A D | ScheduleDAGRRList.cpp | 364 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to 370 if (PredSU->NumSuccsLeft == 0) { 377 --PredSU->NumSuccsLeft; 387 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) { 800 assert(PredSU->NumSuccsLeft < UINT_MAX && "NumSuccsLeft will overflow!"); 801 ++PredSU->NumSuccsLeft; 1093 if (NewSU->NumSuccsLeft == 0) { 2124 // NumSuccsLeft counts all deps. Don't compare it with NumSuccs which only 2126 if (PredSU->NumSuccsLeft ! [all...] |
Completed in 96 milliseconds