Searched refs:CurSU (Results 1 – 4 of 4) sorted by relevance
543 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp() local544 while (CurSU) { in ListScheduleBottomUp()546 if (!DelayForLiveRegsBottomUp(CurSU, LRegs)) in ListScheduleBottomUp()549 LRegsMap.insert(std::make_pair(CurSU, LRegs)); in ListScheduleBottomUp()551 CurSU->isPending = true; // This SU is not in AvailableQueue right now. in ListScheduleBottomUp()552 NotReady.push_back(CurSU); in ListScheduleBottomUp()553 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()559 if (Delayed && !CurSU) { in ListScheduleBottomUp()560 if (!CurSU) { in ListScheduleBottomUp()607 CurSU = NewDef; in ListScheduleBottomUp()[all …]
1129 SUnit *CurSU = AvailableQueue->pop(); in PickNodeToScheduleBottomUp() local1130 while (CurSU) { in PickNodeToScheduleBottomUp()1132 if (!DelayForLiveRegsBottomUp(CurSU, LRegs)) in PickNodeToScheduleBottomUp()1134 LRegsMap.insert(std::make_pair(CurSU, LRegs)); in PickNodeToScheduleBottomUp()1136 CurSU->isPending = true; // This SU is not in AvailableQueue right now. in PickNodeToScheduleBottomUp()1137 Interferences.push_back(CurSU); in PickNodeToScheduleBottomUp()1138 CurSU = AvailableQueue->pop(); in PickNodeToScheduleBottomUp()1140 if (CurSU) { in PickNodeToScheduleBottomUp()1147 return CurSU; in PickNodeToScheduleBottomUp()1186 CurSU = AvailableQueue->pop(); in PickNodeToScheduleBottomUp()[all …]
554 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp() local555 while (CurSU) { in ListScheduleBottomUp()557 if (!DelayForLiveRegsBottomUp(CurSU, LRegs)) in ListScheduleBottomUp()560 LRegsMap.insert(std::make_pair(CurSU, LRegs)); in ListScheduleBottomUp()562 CurSU->isPending = true; // This SU is not in AvailableQueue right now. in ListScheduleBottomUp()563 NotReady.push_back(CurSU); in ListScheduleBottomUp()564 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()570 if (Delayed && !CurSU) { in ListScheduleBottomUp()571 if (!CurSU) { in ListScheduleBottomUp()614 CurSU = NewDef; in ListScheduleBottomUp()[all …]
1365 SUnit *CurSU = AvailableQueue->empty() ? nullptr : AvailableQueue->pop(); in PickNodeToScheduleBottomUp() local1366 while (CurSU) { in PickNodeToScheduleBottomUp()1368 if (!DelayForLiveRegsBottomUp(CurSU, LRegs)) in PickNodeToScheduleBottomUp()1373 << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()1375 LRegsMap.insert(std::make_pair(CurSU, LRegs)); in PickNodeToScheduleBottomUp()1377 CurSU->isPending = true; // This SU is not in AvailableQueue right now. in PickNodeToScheduleBottomUp()1378 Interferences.push_back(CurSU); in PickNodeToScheduleBottomUp()1381 assert(CurSU->isPending && "Interferences are pending"); in PickNodeToScheduleBottomUp()1385 CurSU = AvailableQueue->pop(); in PickNodeToScheduleBottomUp()1387 if (CurSU) in PickNodeToScheduleBottomUp()[all …]