/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LoopNestAnalysis.cpp | 52 static CmpInst *getOuterLoopLatchCmp(const Loop &OuterLoop) { in getOuterLoopLatchCmp() 103 bool LoopNest::arePerfectlyNested(const Loop &OuterLoop, const Loop &InnerLoop, in arePerfectlyNested() 110 const Loop &OuterLoop, const Loop &InnerLoop, ScalarEvolution &SE) { in analyzeLoopNestForPerfectNest() 182 const Loop &OuterLoop, const Loop &InnerLoop, ScalarEvolution &SE) { in getInterveningInstructions() 315 static bool checkLoopsStructure(const Loop &OuterLoop, const Loop &InnerLoop, in checkLoopsStructure()
|
H A D | BlockFrequencyInfoImpl.cpp | 313 const LoopData *OuterLoop, in addToDist() argument 375 addLoopSuccessorsToDist(const LoopData * OuterLoop,LoopData & Loop,Distribution & Dist) addLoopSuccessorsToDist() argument 448 distributeMass(const BlockNode & Source,LoopData * OuterLoop,Distribution & Dist) distributeMass() argument 652 addNodesInLoop(const BFIBase::LoopData & OuterLoop) addNodesInLoop() argument 674 addEdge(IrrNode & Irr,const BlockNode & Succ,const BFIBase::LoopData * OuterLoop) addEdge() argument 775 createIrreducibleLoop(BlockFrequencyInfoImplBase & BFI,const IrreducibleGraph & G,LoopData * OuterLoop,std::list<LoopData>::iterator Insert,const std::vector<const IrreducibleGraph::IrrNode * > & SCC) createIrreducibleLoop() argument 797 analyzeIrreducible(const IrreducibleGraph & G,LoopData * OuterLoop,std::list<LoopData>::iterator Insert) analyzeIrreducible() argument 816 updateLoopWithIrreducible(LoopData & OuterLoop) updateLoopWithIrreducible() argument [all...] |
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopInterchange.cpp | 281 Loop *OuterLoop; member in __anona8cdc8870211::LoopInterchangeLegality 321 Loop *OuterLoop; member in __anona8cdc8870211::LoopInterchangeProfitability 350 Loop *OuterLoop; member in __anona8cdc8870211::LoopInterchangeTransform 547 tightlyNested(Loop * OuterLoop,Loop * InnerLoop) tightlyNested() argument 884 areOuterLoopExitPHIsSupported(Loop * OuterLoop,Loop * InnerLoop) areOuterLoopExitPHIsSupported() argument 917 areInnerLoopLatchPHIsSupported(Loop * OuterLoop,Loop * InnerLoop) areInnerLoopLatchPHIsSupported() argument 1154 isProfitable(const Loop * InnerLoop,const Loop * OuterLoop,unsigned InnerLoopId,unsigned OuterLoopId,CharMatrix & DepMatrix,const DenseMap<const Loop *,unsigned> & CostMap,std::unique_ptr<CacheCost> & CC) isProfitable() argument 1196 removeChildLoop(Loop * OuterLoop,Loop * InnerLoop) removeChildLoop() argument [all...] |
H A D | LoopFlatten.cpp | 110 Loop *OuterLoop = nullptr; // The loop pair to be flattened. global() member 962 auto *OuterLoop = InnerLoop->getParentLoop(); run() local [all...] |
H A D | LoopSimplifyCFG.cpp | 385 if (Loop *OuterLoop = LI.getLoopFor(Preheader)) { handleDeadExits() local
|
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanHCFGBuilder.cpp | 160 static bool doesContainLoop(const Loop *L, const Loop *OuterLoop) { in doesContainLoop() argument
|
H A D | LoopVectorize.cpp | 1960 Loop *OuterLoop = nullptr; global() member in __anon87314d7f0711::GeneratedRTChecks [all...] |
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopUtils.cpp | 1685 const Loop *OuterLoop = TheLoop->getParentLoop(); expandBounds() local
|