Home
last modified time | relevance | path

Searched refs:getNumStages (Results 1 – 2 of 2) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DModuloSchedule.cpp115 unsigned MaxStageCount = Schedule.getNumStages() - 1; in generatePipelinedLoop()
1144 bool InProlog = (CurStageNum < (unsigned)Schedule.getNumStages() - 1); in rewriteScheduledInstr()
1726 BitVector LS(Schedule.getNumStages(), true); in peelPrologAndEpilogs()
1727 BitVector AS(Schedule.getNumStages(), true); in peelPrologAndEpilogs()
1733 for (int I = 0; I < Schedule.getNumStages() - 1; ++I) { in peelPrologAndEpilogs()
1764 for (int I = 1; I <= Schedule.getNumStages() - 1; ++I) { in peelPrologAndEpilogs()
1767 filterInstructions(B, Schedule.getNumStages() - I); in peelPrologAndEpilogs()
1772 PhiNodeLoopIteration[&*Phi] = Schedule.getNumStages() - I; in peelPrologAndEpilogs()
1778 unsigned Stage = Schedule.getNumStages() - 1 + I - J; in peelPrologAndEpilogs()
1939 int TC = Schedule.getNumStages() - 1; in fixupBranches()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DModuloSchedule.h122 int getNumStages() const { return NumStages; } in getNumStages() function
236 if ((int)CurStage > Schedule.getNumStages() - 1 && Stages.first == 0 && in getStagesForReg()