Home
last modified time | relevance | path

Searched refs:getCycle (Results 1 – 9 of 9) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericUniformityImpl.h616 auto const *DivTermCycle = CI.getCycle(&DivTermBlock); in computeJoinPoints()
697 const auto *BlockCycle = CI.getCycle(Block); in computeJoinPoints()
719 for (const auto *Cycle = CI.getCycle(&DivTermBlock); Cycle; in computeJoinPoints()
875 auto *ExitLevelCycle = CI.getCycle(&DivExit); in propagateCycleExitDivergence()
1054 for (const CycleT *Cycle = CI.getCycle(DefBlock); in isTemporalDivergent()
1081 const auto *Cycle = CI.getCycle(JoinBlock); in analyzeControlDivergence()
1113 const auto *BranchCycle = CI.getCycle(DivTermBlock); in analyzeControlDivergence()
1311 auto *NestedCycle = CI.getCycle(NextBB); in computeStackPO()
H A DGenericCycleImpl.h517 CycleT *Cycle = getSmallestCommonCycle(getCycle(Pred), getCycle(Succ)); in splitCriticalEdge()
530 auto GenericCycleInfo<ContextT>::getCycle(const BlockT *Block) const
570 CycleT *Cycle = getCycle(Block); in getCycleDepth()
H A DGenericCycleInfo.h299 CycleT *getCycle(const BlockT *Block) const;
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineSink.cpp1110 MachineCycle *FromCycle = CI->getCycle(FromBB); in isLegalToBreakCriticalEdge()
1111 MachineCycle *ToCycle = CI->getCycle(ToBB); in isLegalToBreakCriticalEdge()
1298 MachineCycle *MCycle = CI->getCycle(MBB); in isProfitableToSinkTo()
1334 MachineCycle *Cycle = CI->getCycle(DefMI->getParent()); in isProfitableToSinkTo()
1906 if (!TryBreak && CI->getCycle(SuccToSinkTo) && in SinkInstruction()
1907 (!CI->getCycle(SuccToSinkTo)->isReducible() || in SinkInstruction()
1908 CI->getCycle(SuccToSinkTo)->getHeader() == SuccToSinkTo)) { in SinkInstruction()
H A DModuloSchedule.cpp31 OS << "[stage " << getStage(MI) << " @" << getCycle(MI) << "c] " << *MI; in print()
1185 int CycleSched = Schedule.getCycle(OrigMI); in rewriteScheduledInstr()
1189 int CyclePhi = Schedule.getCycle(Phi); in rewriteScheduledInstr()
1226 int DefCycle = Schedule.getCycle(&Phi); in isLoopCarried()
1235 int LoopCycle = Schedule.getCycle(Use); in isLoopCarried()
1433 int LoopProducerCycle = S.getCycle(LoopProducer); in remapUse()
1434 int ConsumerCycle = S.getCycle(&MI); in remapUse()
2883 OS << "Stage-" << S.getStage(MI) << "_Cycle-" << S.getCycle(MI); in annotate()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DGenericConvergenceVerifierImpl.h156 auto *BBCycle = CI.getCycle(BB); in verify()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DModuloSchedule.h141 int getCycle(MachineInstr *MI) { in getCycle() function
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIInstrInfo.cpp211 MachineCycle *FromCycle = CI->getCycle(SgprDef->getParent()); in isSafeToSink()
215 MachineCycle *ToCycle = CI->getCycle(SuccToSinkTo); in isSafeToSink()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DAttributorAttributes.cpp220 auto *C = CI->getCycle(BB); in mayBeInCycle()