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