Lines Matching refs:Schedule
68 BB = Schedule.getLoop()->getTopBlock(); in expand()
75 for (MachineInstr *MI : Schedule.getInstructions()) { in expand()
76 int DefStage = Schedule.getStage(MI); in expand()
86 int UseStage = Schedule.getStage(UseMI); in expand()
112 unsigned MaxStageCount = Schedule.getNumStages() - 1; in generatePipelinedLoop()
129 for (MachineInstr *CI : Schedule.getInstructions()) { in generatePipelinedLoop()
132 unsigned StageNum = Schedule.getStage(CI); in generatePipelinedLoop()
211 if (Schedule.getStage(&*BBI) == StageNum) { in generateProlog()
287 if ((unsigned)Schedule.getStage(In) == StageNum) { in generateEpilog()
390 int StageScheduled = Schedule.getStage(&*BBI); in generateExistingPhis()
391 int LoopValStage = Schedule.getStage(MRI.getVRegDef(LoopVal)); in generateExistingPhis()
445 int PhiStage = Schedule.getStage(InstOp1); in generateExistingPhis()
451 int PhiOpStage = Schedule.getStage(InstOp1); in generateExistingPhis()
621 int StageScheduled = Schedule.getStage(&*BBI); in generatePhis()
997 if (Schedule.getStage(LoopDef) > (signed)InstStageNum) in cloneAndChangeInstr()
1027 int DefStageNum = Schedule.getStage(Def); in updateInstruction()
1102 unsigned PhiStage = (unsigned)Schedule.getStage(MRI.getVRegDef(PhiDef)); in rewritePhiValues()
1103 unsigned LoopStage = (unsigned)Schedule.getStage(MRI.getVRegDef(LoopVal)); in rewritePhiValues()
1125 bool InProlog = (CurStageNum < (unsigned)Schedule.getNumStages() - 1); in rewriteScheduledInstr()
1126 int StagePhi = Schedule.getStage(Phi) + PhiNum; in rewriteScheduledInstr()
1143 int StageSched = Schedule.getStage(OrigMI); in rewriteScheduledInstr()
1144 int CycleSched = Schedule.getCycle(OrigMI); in rewriteScheduledInstr()
1148 int CyclePhi = Schedule.getCycle(Phi); in rewriteScheduledInstr()
1184 int DefCycle = Schedule.getCycle(&Phi); in isLoopCarried()
1185 int DefStage = Schedule.getStage(&Phi); in isLoopCarried()
1193 int LoopCycle = Schedule.getCycle(Use); in isLoopCarried()
1194 int LoopStage = Schedule.getStage(Use); in isLoopCarried()
1723 BitVector LS(Schedule.getNumStages(), true); in peelPrologAndEpilogs()
1724 BitVector AS(Schedule.getNumStages(), true); in peelPrologAndEpilogs()
1730 for (int I = 0; I < Schedule.getNumStages() - 1; ++I) { in peelPrologAndEpilogs()
1761 for (int I = 1; I <= Schedule.getNumStages() - 1; ++I) { in peelPrologAndEpilogs()
1764 filterInstructions(B, Schedule.getNumStages() - I); in peelPrologAndEpilogs()
1769 PhiNodeLoopIteration[&Phi] = Schedule.getNumStages() - I; in peelPrologAndEpilogs()
1775 unsigned Stage = Schedule.getNumStages() - 1 + I - J; in peelPrologAndEpilogs()
1936 int TC = Schedule.getNumStages() - 1; in fixupBranches()
1973 LoopInfo->adjustTripCount(-(Schedule.getNumStages() - 1)); in fixupBranches()
1981 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in rewriteKernel()
1986 BB = Schedule.getLoop()->getTopBlock(); in expand()
1987 Preheader = Schedule.getLoop()->getLoopPreheader(); in expand()
1988 LLVM_DEBUG(Schedule.dump()); in expand()
1998 BB = Schedule.getLoop()->getTopBlock(); in validateAgainstModuloScheduleExpander()
1999 Preheader = Schedule.getLoop()->getLoopPreheader(); in validateAgainstModuloScheduleExpander()
2005 Schedule.print(OS); in validateAgainstModuloScheduleExpander()
2011 ModuloScheduleExpander MSE(MF, Schedule, *LIS, in validateAgainstModuloScheduleExpander()
2024 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in validateAgainstModuloScheduleExpander()