Searched refs:CurCycle (Results 1 - 6 of 6) sorted by relevance
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGVLIW.cpp | 90 void scheduleNodeTopDown(SUnit *SU, unsigned CurCycle); 155 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned CurCycle) { argument 156 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: "); 160 assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!"); 161 SU->setDepthToAtLeast(CurCycle); 171 unsigned CurCycle = 0; local 193 if (PendingQueue[i]->getDepth() == CurCycle) { 201 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?"); 210 ++CurCycle; 241 scheduleNodeTopDown(FoundSUnit, CurCycle); [all...] |
H A D | ScheduleDAGFast.cpp | 100 void ReleasePredecessors(SUnit *SU, unsigned CurCycle); 161 void ScheduleDAGFast::ReleasePredecessors(SUnit *SU, unsigned CurCycle) { argument 174 LiveRegCycles[I->getReg()] = CurCycle; 183 void ScheduleDAGFast::ScheduleNodeBottomUp(SUnit *SU, unsigned CurCycle) { argument 184 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: "); 187 assert(CurCycle >= SU->getHeight() && "Node scheduled below its height!"); 188 SU->setHeightToAtLeast(CurCycle); 191 ReleasePredecessors(SU, CurCycle); 528 unsigned CurCycle = 0; local 531 ReleasePredecessors(&ExitSU, CurCycle); [all...] |
H A D | ScheduleDAGRRList.cpp | 130 /// CurCycle - The current scheduler state corresponds to this cycle. 131 unsigned CurCycle; member in class:__anon24974::ScheduleDAGRRList 166 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0), 326 CurCycle = 0; 602 if (NextCycle <= CurCycle) 609 CurCycle = NextCycle; 612 for (; CurCycle != NextCycle; ++CurCycle) { 636 // Bump CurCycle to account for latency. We assume the latency of other 660 AdvanceToCycle(CurCycle [all...] |
/external/llvm/lib/CodeGen/ |
H A D | PostRASchedulerList.cpp | 177 void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle); 181 void emitNoop(unsigned CurCycle); 466 void SchedulePostRATDList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) { argument 467 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: "); 471 assert(CurCycle >= SU->getDepth() && 473 SU->setDepthToAtLeast(CurCycle); 481 void SchedulePostRATDList::emitNoop(unsigned CurCycle) { argument 482 DEBUG(dbgs() << "*** Emitting noop in cycle " << CurCycle << '\n'); 491 unsigned CurCycle = 0; local 524 if (PendingQueue[i]->getDepth() <= CurCycle) { [all...] |
H A D | ScoreboardHazardRecognizer.cpp | 54 unsigned CurCycle = 0; local 57 unsigned StageDepth = CurCycle + IS->getCycles(); 59 CurCycle += IS->getNextCycles();
|
/external/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 497 unsigned CurCycle; member in class:llvm::SUnit::SchedulingPriorityQueue 501 CurCycle(0), HasReadyFilter(rf) {} 544 CurCycle = Cycle; 548 return CurCycle;
|
Completed in 288 milliseconds