Home
last modified time | relevance | path

Searched refs:NextCycle (Results 1 – 4 of 4) sorted by relevance

/external/llvm/lib/CodeGen/
DMachineScheduler.cpp1889 void SchedBoundary::bumpCycle(unsigned NextCycle) { in bumpCycle() argument
1892 if (MinReadyCycle > NextCycle) in bumpCycle()
1893 NextCycle = MinReadyCycle; in bumpCycle()
1896 unsigned DecMOps = SchedModel->getIssueWidth() * (NextCycle - CurrCycle); in bumpCycle()
1900 if ((NextCycle - CurrCycle) > DependentLatency) in bumpCycle()
1903 DependentLatency -= (NextCycle - CurrCycle); in bumpCycle()
1907 CurrCycle = NextCycle; in bumpCycle()
1911 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()
1941 countResource(unsigned PIdx, unsigned Cycles, unsigned NextCycle) { in countResource() argument
1992 unsigned NextCycle = CurrCycle; in bumpNode() local
[all …]
/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp308 unsigned NextCycle = std::max(CurrCycle + 1, MinReadyCycle); in bumpCycle() local
312 CurrCycle = NextCycle; in bumpCycle()
315 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()
/external/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGRRList.cpp221 void AdvanceToCycle(unsigned NextCycle);
600 void ScheduleDAGRRList::AdvanceToCycle(unsigned NextCycle) { in AdvanceToCycle() argument
601 if (NextCycle <= CurCycle) in AdvanceToCycle()
605 AvailableQueue->setCurCycle(NextCycle); in AdvanceToCycle()
608 CurCycle = NextCycle; in AdvanceToCycle()
611 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
/external/llvm/include/llvm/CodeGen/
DMachineScheduler.h727 void bumpCycle(unsigned NextCycle);