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

  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGList.cpp 83 void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
143 void ScheduleDAGList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
144 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
148 assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");
149 SU->setDepthToAtLeast(CurCycle);
159 unsigned CurCycle = 0;
181 if (PendingQueue[i]->getDepth() == CurCycle) {
188 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?");
195 ++CurCycle;
226 ScheduleNodeTopDown(FoundSUnit, CurCycle);
    [all...]
ScheduleDAGFast.cpp 94 void ReleasePredecessors(SUnit *SU, unsigned CurCycle);
155 void ScheduleDAGFast::ReleasePredecessors(SUnit *SU, unsigned CurCycle) {
168 LiveRegCycles[I->getReg()] = CurCycle;
177 void ScheduleDAGFast::ScheduleNodeBottomUp(SUnit *SU, unsigned CurCycle) {
178 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
181 assert(CurCycle >= SU->getHeight() && "Node scheduled below its height!");
182 SU->setHeightToAtLeast(CurCycle);
185 ReleasePredecessors(SU, CurCycle);
522 unsigned CurCycle = 0;
525 ReleasePredecessors(&ExitSU, CurCycle);
    [all...]
ScheduleDAGRRList.cpp 144 /// CurCycle - The current scheduler state corresponds to this cycle.
145 unsigned CurCycle;
170 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
328 CurCycle = 0;
479 if (NextCycle <= CurCycle)
486 CurCycle = NextCycle;
489 for (; CurCycle != NextCycle; ++CurCycle) {
516 // Bump CurCycle to account for latency. We assume the latency of other
540 AdvanceToCycle(CurCycle + Stalls)
    [all...]
  /external/llvm/lib/CodeGen/
PostRASchedulerList.cpp 172 void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
577 void SchedulePostRATDList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
578 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
582 assert(CurCycle >= SU->getDepth() &&
584 SU->setDepthToAtLeast(CurCycle);
594 unsigned CurCycle = 0;
628 if (PendingQueue[i]->getDepth() <= CurCycle) {
667 ScheduleNodeTopDown(FoundSUnit, CurCycle);
671 DEBUG(dbgs() << "*** Max instructions per cycle " << CurCycle << '\n');
673 ++CurCycle;
    [all...]
ScoreboardHazardRecognizer.cpp 55 unsigned CurCycle = 0;
58 unsigned StageDepth = CurCycle + IS->getCycles();
60 CurCycle += IS->getNextCycles();
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 430 unsigned CurCycle;
434 CurCycle(0), HasReadyFilter(rf) {}
477 CurCycle = Cycle;
481 return CurCycle;

Completed in 763 milliseconds