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

  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 110 assert(N->NumSuccsLeft < UINT_MAX && "NumSuccsLeft will overflow!");
111 ++N->NumSuccsLeft;
157 assert(N->NumSuccsLeft > 0 && "NumSuccsLeft will underflow!");
158 --N->NumSuccsLeft;
299 dbgs() << " # succs left : " << NumSuccsLeft << "\n";
379 if (SUnits[i].NumSuccsLeft != 0) {
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 250 unsigned NumSuccsLeft; // # of succs not scheduled.
282 NumSuccsLeft(0), NumRegDefsLeft(0), Latency(0),
296 NumSuccsLeft(0), NumRegDefsLeft(0), Latency(0),
309 NumSuccsLeft(0), NumRegDefsLeft(0), Latency(0),
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 132 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to
138 if (PredSU->NumSuccsLeft == 0) {
145 --PredSU->NumSuccsLeft;
149 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
339 if (NewSU->NumSuccsLeft == 0) {
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) {
666 assert(PredSU->NumSuccsLeft < UINT_MAX && "NumSuccsLeft will overflow!");
667 ++PredSU->NumSuccsLeft;
927 if (NewSU->NumSuccsLeft == 0) {
    [all...]

Completed in 621 milliseconds