/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineLICM.cpp | 147 isExitBlock(MachineLoop * CurLoop,const MachineBasicBlock * MBB) isExitBlock() argument 386 MachineLoop *CurLoop = Worklist.pop_back_val(); INITIALIZE_PASS_DEPENDENCY() local 485 ProcessMI(MachineInstr * MI,BitVector & RUDefs,BitVector & RUClobbers,SmallDenseSet<int> & StoredFIs,SmallVectorImpl<CandidateInfo> & Candidates,MachineLoop * CurLoop) ProcessMI() argument 576 HoistRegionPostRA(MachineLoop * CurLoop,MachineBasicBlock * CurPreheader) HoistRegionPostRA() argument 678 AddToLiveIns(MCRegister Reg,MachineLoop * CurLoop) AddToLiveIns() argument 696 HoistPostRA(MachineInstr * MI,unsigned Def,MachineLoop * CurLoop,MachineBasicBlock * CurPreheader) HoistPostRA() argument 728 IsGuaranteedToExecute(MachineBasicBlock * BB,MachineLoop * CurLoop) IsGuaranteedToExecute() argument 800 HoistOutOfLoop(MachineDomTreeNode * HeaderN,MachineLoop * CurLoop,MachineBasicBlock * CurPreheader) HoistOutOfLoop() argument 1075 IsLICMCandidate(MachineInstr & I,MachineLoop * CurLoop) IsLICMCandidate() argument 1111 IsLoopInvariantInst(MachineInstr & I,MachineLoop * CurLoop) IsLoopInvariantInst() argument 1122 HasLoopPHIUse(const MachineInstr * MI,MachineLoop * CurLoop) HasLoopPHIUse() argument 1253 IsProfitableToHoist(MachineInstr & MI,MachineLoop * CurLoop) IsProfitableToHoist() argument 1379 ExtractHoistableLoad(MachineInstr * MI,MachineLoop * CurLoop) ExtractHoistableLoad() argument 1595 Hoist(MachineInstr * MI,MachineBasicBlock * Preheader,MachineLoop * CurLoop) Hoist() argument 1689 getCurPreheader(MachineLoop * CurLoop,MachineBasicBlock * CurPreheader) getCurPreheader() argument [all...] |
H A D | PHIElimination.cpp | 710 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : nullptr; SplitPHIEdges() local [all...] |
H A D | MachineTraceMetrics.cpp | 343 const MachineLoop *CurLoop = getLoopFor(MBB); pickTracePred() local 371 const MachineLoop *CurLoop = getLoopFor(MBB); pickTraceSucc() local
|
/llvm-project/llvm/lib/Analysis/ |
H A D | MustExecute.cpp | 51 BasicBlock *Header = CurLoop->getHeader(); in computeLoopSafetyInfo() argument 79 computeLoopSafetyInfo(const Loop * CurLoop) computeLoopSafetyInfo() argument 104 computeBlockColors(const Loop * CurLoop) computeBlockColors() argument 119 CanProveNotTakenFirstIteration(const BasicBlock * ExitBlock,const DominatorTree * DT,const Loop * CurLoop) CanProveNotTakenFirstIteration() argument 161 collectTransitivePredecessors(const Loop * CurLoop,const BasicBlock * BB,SmallPtrSetImpl<const BasicBlock * > & Predecessors) collectTransitivePredecessors() argument 190 allLoopPathsLeadToBlock(const Loop * CurLoop,const BasicBlock * BB,const DominatorTree * DT) const allLoopPathsLeadToBlock() argument [all...] |
H A D | DependenceAnalysis.cpp | 441 setPoint(const SCEV * X,const SCEV * Y,const Loop * CurLoop) setPoint() argument 449 setLine(const SCEV * AA,const SCEV * BB,const SCEV * CC,const Loop * CurLoop) setLine() argument 458 setDistance(const SCEV * D,const Loop * CurLoop) setDistance() argument 1231 strongSIVtest(const SCEV * Coeff,const SCEV * SrcConst,const SCEV * DstConst,const Loop * CurLoop,unsigned Level,FullDependence & Result,Constraint & NewConstraint) const strongSIVtest() argument 1368 weakCrossingSIVtest(const SCEV * Coeff,const SCEV * SrcConst,const SCEV * DstConst,const Loop * CurLoop,unsigned Level,FullDependence & Result,Constraint & NewConstraint,const SCEV * & SplitIter) const weakCrossingSIVtest() argument 1568 exactSIVtest(const SCEV * SrcCoeff,const SCEV * DstCoeff,const SCEV * SrcConst,const SCEV * DstConst,const Loop * CurLoop,unsigned Level,FullDependence & Result,Constraint & NewConstraint) const exactSIVtest() argument 1762 weakZeroSrcSIVtest(const SCEV * DstCoeff,const SCEV * SrcConst,const SCEV * DstConst,const Loop * CurLoop,unsigned Level,FullDependence & Result,Constraint & NewConstraint) const weakZeroSrcSIVtest() argument 1872 weakZeroDstSIVtest(const SCEV * SrcCoeff,const SCEV * SrcConst,const SCEV * DstConst,const Loop * CurLoop,unsigned Level,FullDependence & Result,Constraint & NewConstraint) const weakZeroDstSIVtest() argument 2238 const Loop *CurLoop = SrcAddRec->getLoop(); testSIV() local 2260 const Loop *CurLoop = SrcAddRec->getLoop(); testSIV() local 2270 const Loop *CurLoop = DstAddRec->getLoop(); testSIV() local 2506 const Loop *CurLoop = AddRec->getLoop(); gcdMIVtest() local 3180 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); propagateDistance() local 3206 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); propagateLine() local 3280 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); propagatePoint() local [all...] |
/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 555 sinkRegion(DomTreeNode * N,AAResults * AA,LoopInfo * LI,DominatorTree * DT,TargetLibraryInfo * TLI,TargetTransformInfo * TTI,Loop * CurLoop,MemorySSAUpdater & MSSAU,ICFLoopSafetyInfo * SafetyInfo,SinkAndHoistLICMFlags & Flags,OptimizationRemarkEmitter * ORE,Loop * OutermostLoop) sinkRegion() argument 623 sinkRegionForLoopNest(DomTreeNode * N,AAResults * AA,LoopInfo * LI,DominatorTree * DT,TargetLibraryInfo * TLI,TargetTransformInfo * TTI,Loop * CurLoop,MemorySSAUpdater & MSSAU,ICFLoopSafetyInfo * SafetyInfo,SinkAndHoistLICMFlags & Flags,OptimizationRemarkEmitter * ORE) sinkRegionForLoopNest() argument 654 Loop *CurLoop; global() member in __anon8361c48b0511::ControlFlowHoister 666 ControlFlowHoister(LoopInfo * LI,DominatorTree * DT,Loop * CurLoop,MemorySSAUpdater & MSSAU) ControlFlowHoister() argument 876 hoistRegion(DomTreeNode * N,AAResults * AA,LoopInfo * LI,DominatorTree * DT,AssumptionCache * AC,TargetLibraryInfo * TLI,Loop * CurLoop,MemorySSAUpdater & MSSAU,ScalarEvolution * SE,ICFLoopSafetyInfo * SafetyInfo,SinkAndHoistLICMFlags & Flags,OptimizationRemarkEmitter * ORE,bool LoopNestMode,bool AllowSpeculation) hoistRegion() argument 1053 isLoadInvariantInLoop(LoadInst * LI,DominatorTree * DT,Loop * CurLoop) isLoadInvariantInLoop() argument 1161 canSinkOrHoistInst(Instruction & I,AAResults * AA,DominatorTree * DT,Loop * CurLoop,MemorySSAUpdater & MSSAU,bool TargetExecutesOncePerLoop,SinkAndHoistLICMFlags & Flags,OptimizationRemarkEmitter * ORE) canSinkOrHoistInst() argument 1354 isFoldableInLoop(const Instruction & I,const Loop * CurLoop,const TargetTransformInfo * TTI) isFoldableInLoop() argument 1384 isNotUsedOrFoldableInLoop(const Instruction & I,const Loop * CurLoop,const LoopSafetyInfo * SafetyInfo,TargetTransformInfo * TTI,bool & FoldableInLoop,bool LoopNestMode) isNotUsedOrFoldableInLoop() argument 1525 sinkThroughTriviallyReplaceablePHI(PHINode * TPN,Instruction * I,LoopInfo * LI,SmallDenseMap<BasicBlock *,Instruction *,32> & SunkCopies,const LoopSafetyInfo * SafetyInfo,const Loop * CurLoop,MemorySSAUpdater & MSSAU) sinkThroughTriviallyReplaceablePHI() argument 1558 splitPredecessorsOfLoopExit(PHINode * PN,DominatorTree * DT,LoopInfo * LI,const Loop * CurLoop,LoopSafetyInfo * SafetyInfo,MemorySSAUpdater * MSSAU) splitPredecessorsOfLoopExit() argument 1630 sink(Instruction & I,LoopInfo * LI,DominatorTree * DT,const Loop * CurLoop,ICFLoopSafetyInfo * SafetyInfo,MemorySSAUpdater & MSSAU,OptimizationRemarkEmitter * ORE) sink() argument 1736 hoist(Instruction & I,const DominatorTree * DT,const Loop * CurLoop,BasicBlock * Dest,ICFLoopSafetyInfo * SafetyInfo,MemorySSAUpdater & MSSAU,ScalarEvolution * SE,OptimizationRemarkEmitter * ORE) hoist() argument 1784 isSafeToExecuteUnconditionally(Instruction & Inst,const DominatorTree * DT,const TargetLibraryInfo * TLI,const Loop * CurLoop,const LoopSafetyInfo * SafetyInfo,OptimizationRemarkEmitter * ORE,const Instruction * CtxI,AssumptionCache * AC,bool AllowSpeculation) isSafeToExecuteUnconditionally() argument 1970 promoteLoopAccessesToScalars(const SmallSetVector<Value *,8> & PointerMustAliases,SmallVectorImpl<BasicBlock * > & ExitBlocks,SmallVectorImpl<BasicBlock::iterator> & InsertPts,SmallVectorImpl<MemoryAccess * > & MSSAInsertPts,PredIteratorCache & PIC,LoopInfo * LI,DominatorTree * DT,AssumptionCache * AC,const TargetLibraryInfo * TLI,TargetTransformInfo * TTI,Loop * CurLoop,MemorySSAUpdater & MSSAU,ICFLoopSafetyInfo * SafetyInfo,OptimizationRemarkEmitter * ORE,bool AllowSpeculation,bool HasReadsOutsideSet) promoteLoopAccessesToScalars() argument 2347 pointerInvalidatedByLoop(MemorySSA * MSSA,MemoryUse * MU,Loop * CurLoop,Instruction & I,SinkAndHoistLICMFlags & Flags,bool InvariantGroup) pointerInvalidatedByLoop() argument 2825 inSubLoop(BasicBlock * BB,Loop * CurLoop,LoopInfo * LI) inSubLoop() argument [all...] |
H A D | LoopIdiomRecognize.cpp | 139 Loop *CurLoop = nullptr; global() member in __anon16f8c4f80111::LoopIdiomRecognize 987 getNumBytes(const SCEV * BECount,Type * IntPtr,const SCEV * StoreSizeSCEV,Loop * CurLoop,const DataLayout * DL,ScalarEvolution * SE) getNumBytes() argument 1555 detectPopcountIdiom(Loop * CurLoop,BasicBlock * PreCondBB,Instruction * & CntInst,PHINode * & CntPhi,Value * & Var) detectPopcountIdiom() argument 1688 detectShiftUntilZeroIdiom(Loop * CurLoop,const DataLayout & DL,Intrinsic::ID & IntrinID,Value * & InitX,Instruction * & CntInst,PHINode * & CntPhi,Instruction * & DefX) detectShiftUntilZeroIdiom() argument 2201 detectShiftUntilBitTestIdiom(Loop * CurLoop,Value * & BaseX,Value * & BitMask,Value * & BitPos,Value * & CurrX,Instruction * & NextX) detectShiftUntilBitTestIdiom() argument 2555 detectShiftUntilZeroIdiom(Loop * CurLoop,ScalarEvolution * SE,Instruction * & ValShiftedIsZero,Intrinsic::ID & IntrinID,Instruction * & IV,Value * & Start,Value * & Val,const SCEV * & ExtraOffsetExpr,bool & InvertedCond) detectShiftUntilZeroIdiom() argument [all...] |
H A D | LoopVersioningLICM.cpp | 144 Loop *CurLoop; global() member [all...] |
H A D | SeparateConstOffsetFromGEP.cpp | 1300 GetElementPtrInst *FirstGEP, GetElementPtrInst *SecondGEP, Loop *CurLoop) { in isLegalToSwapOperand() argument
|
H A D | SimpleLoopUnswitch.cpp | 3627 auto *CurLoop = Worklist.pop_back_val(); unswitchLoop() local
|
/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericLoopInfo.h | 85 for (const LoopT *CurLoop = ParentLoop; CurLoop; in getLoopDepth() local 355 const LoopT *CurLoop = static_cast<const LoopT *>(this); getLoopsInPreorder() local 362 LoopT *CurLoop = static_cast<LoopT *>(this); getLoopsInPreorder() local [all...] |
/llvm-project/llvm/lib/TableGen/ |
H A D | TGParser.h | 101 ForeachLoop *CurLoop = nullptr; variable
|
/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 632 Loop *CurLoop; member in __anon5ed319890511::PolynomialMultiplyRecognize 1922 isLegalStore(Loop * CurLoop,StoreInst * SI) isLegalStore() argument 2006 collectStores(Loop * CurLoop,BasicBlock * BB,SmallVectorImpl<StoreInst * > & Stores) collectStores() argument 2015 processCopyingStore(Loop * CurLoop,StoreInst * SI,const SCEV * BECount) processCopyingStore() argument 2355 runOnLoopBlock(Loop * CurLoop,BasicBlock * BB,const SCEV * BECount,SmallVectorImpl<BasicBlock * > & ExitBlocks) runOnLoopBlock() argument [all...] |
H A D | HexagonVectorLoopCarriedReuse.cpp | 196 Loop *CurLoop; global() member in __anon464004470111::HexagonVectorLoopCarriedReuse [all...] |
/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CloneFunction.cpp | 1024 Loop *CurLoop = LI->getLoopFor(BB); cloneLoopWithPreheader() local 1043 Loop *CurLoop = LI->getLoopFor(BB); cloneLoopWithPreheader() local
|
H A D | LoopUnrollAndJam.cpp | 774 Loop *CurLoop = LI.getLoopFor((*Blocks.begin())->front().getParent()); checkDependencies() local
|
H A D | ScalarEvolutionExpander.cpp | 520 const Loop *CurLoop = I->first; visitAddExpr() local
|
H A D | LoopUtils.cpp | 450 collectChildrenInLoop(DomTreeNode * N,const Loop * CurLoop) collectChildrenInLoop() argument
|
/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoopIdiomVectorize.cpp | 90 Loop *CurLoop = nullptr; member in __anon161cb1f20111::LoopIdiomVectorize [all...] |
/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | InstrProfiling.cpp | 451 PGOCounterPromoter(DenseMap<Loop *,SmallVector<LoadStorePair,8>> & LoopToCands,Loop & CurLoop,LoopInfo & LI,BlockFrequencyInfo * BFI) PGOCounterPromoter() argument
|