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 295 unsigned NumSuccsLeft; // # of succs not scheduled.
332 NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), NumRegDefsLeft(0),
346 NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), NumRegDefsLeft(0),
359 NumSuccsLeft(0), WeakPredsLeft(0), WeakSuccsLeft(0), NumRegDefsLeft(0),
475 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 373 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. When
374 /// NumSuccsLeft reaches zero, release the predecessor node.
387 if (PredSU->NumSuccsLeft == 0) {
394 --PredSU->NumSuccsLeft;
395 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU)
610 if (!I->NumSuccsLeft)
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 137 /// 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) {
ScheduleDAGRRList.cpp 362 /// 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;
    [all...]

Completed in 826 milliseconds