HomeSort by relevance Sort by last modified time
    Searched refs:NumSuccsLeft (Results 1 - 5 of 5) sorted by null

  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 288 unsigned NumSuccsLeft; // # of succs not scheduled.
328 NumPredsLeft(0), NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0),
344 NumPredsLeft(0), NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0),
359 NumPredsLeft(0), NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0),
477 return NumSuccsLeft == 0;
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 117 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) {
MachineScheduler.cpp 574 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. When
575 /// NumSuccsLeft reaches zero, release the predecessor node.
588 if (PredSU->NumSuccsLeft == 0) {
600 --PredSU->NumSuccsLeft;
601 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU)
753 if (!I->NumSuccsLeft)
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
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) {
ScheduleDAGRRList.cpp 363 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to
369 if (PredSU->NumSuccsLeft == 0) {
376 --PredSU->NumSuccsLeft;
386 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
799 assert(PredSU->NumSuccsLeft < UINT_MAX && "NumSuccsLeft will overflow!");
800 ++PredSU->NumSuccsLeft;
    [all...]

Completed in 329 milliseconds