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

  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGVLIW.cpp 88 void scheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
153 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
154 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
158 assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");
159 SU->setDepthToAtLeast(CurCycle);
169 unsigned CurCycle = 0;
191 if (PendingQueue[i]->getDepth() == CurCycle) {
199 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?");
208 ++CurCycle;
239 scheduleNodeTopDown(FoundSUnit, CurCycle);
    [all...]
ScheduleDAGFast.cpp 99 void ReleasePredecessors(SUnit *SU, unsigned CurCycle);
160 void ScheduleDAGFast::ReleasePredecessors(SUnit *SU, unsigned CurCycle) {
173 LiveRegCycles[I->getReg()] = CurCycle;
182 void ScheduleDAGFast::ScheduleNodeBottomUp(SUnit *SU, unsigned CurCycle) {
183 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
186 assert(CurCycle >= SU->getHeight() && "Node scheduled below its height!");
187 SU->setHeightToAtLeast(CurCycle);
190 ReleasePredecessors(SU, CurCycle);
527 unsigned CurCycle = 0;
530 ReleasePredecessors(&ExitSU, CurCycle);
    [all...]
ScheduleDAGRRList.cpp 129 /// CurCycle - The current scheduler state corresponds to this cycle.
130 unsigned CurCycle;
165 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
324 CurCycle = 0;
600 if (NextCycle <= CurCycle)
607 CurCycle = NextCycle;
610 for (; CurCycle != NextCycle; ++CurCycle) {
634 // Bump CurCycle to account for latency. We assume the latency of other
658 AdvanceToCycle(CurCycle + Stalls)
    [all...]
  /external/llvm/lib/CodeGen/
PostRASchedulerList.cpp 176 void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
608 void SchedulePostRATDList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
609 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
613 assert(CurCycle >= SU->getDepth() &&
615 SU->setDepthToAtLeast(CurCycle);
625 unsigned CurCycle = 0;
658 if (PendingQueue[i]->getDepth() <= CurCycle) {
697 ScheduleNodeTopDown(FoundSUnit, CurCycle);
701 DEBUG(dbgs() << "*** Max instructions per cycle " << CurCycle << '\n');
703 ++CurCycle;
    [all...]
ScoreboardHazardRecognizer.cpp 53 unsigned CurCycle = 0;
56 unsigned StageDepth = CurCycle + IS->getCycles();
58 CurCycle += IS->getNextCycles();
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 483 unsigned CurCycle;
487 CurCycle(0), HasReadyFilter(rf) {}
530 CurCycle = Cycle;
534 return CurCycle;

Completed in 80 milliseconds