Searched refs:OuterLoop (Results 1 - 6 of 6) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopNestAnalysis.cpp36 static bool checkLoopsStructure(const Loop &OuterLoop, const Loop &InnerLoop,
54 bool LoopNest::arePerfectlyNested(const Loop &OuterLoop, const Loop &InnerLoop, argument
56 assert(!OuterLoop.getSubLoops().empty() && "Outer loop should have subloops");
58 LLVM_DEBUG(dbgs() << "Checking whether loop '" << OuterLoop.getName()
68 if (!checkLoopsStructure(OuterLoop, InnerLoop, SE)) {
74 auto OuterLoopLB = OuterLoop.getBounds(SE);
76 LLVM_DEBUG(dbgs() << "Cannot compute loop bounds of OuterLoop: "
77 << OuterLoop << "\n";);
82 const BasicBlock *Latch = OuterLoop.getLoopLatch();
141 const BasicBlock *OuterLoopHeader = OuterLoop
209 checkLoopsStructure(const Loop &OuterLoop, const Loop &InnerLoop, ScalarEvolution &SE) argument
[all...]
H A DBlockFrequencyInfoImpl.cpp297 const LoopData *OuterLoop,
304 auto isLoopHeader = [&OuterLoop](const BlockNode &Node) {
305 return OuterLoop && OuterLoop->isHeader(Node);
329 if (Working[Resolved.Index].getContainingLoop() != OuterLoop) {
337 // If OuterLoop is an irreducible loop, we can't actually handle this.
338 assert((!OuterLoop || !OuterLoop->isIrreducible()) &&
347 // OuterLoop must be irreducible. These false backedges can come only from
349 assert(OuterLoop
296 addToDist(Distribution &Dist, const LoopData *OuterLoop, const BlockNode &Pred, const BlockNode &Succ, uint64_t Weight) argument
358 addLoopSuccessorsToDist( const LoopData *OuterLoop, LoopData &Loop, Distribution &Dist) argument
431 distributeMass(const BlockNode &Source, LoopData *OuterLoop, Distribution &Dist) argument
645 addNodesInLoop(const BFIBase::LoopData &OuterLoop) argument
666 addEdge(IrrNode &Irr, const BlockNode &Succ, const BFIBase::LoopData *OuterLoop) argument
766 createIrreducibleLoop( BlockFrequencyInfoImplBase &BFI, const IrreducibleGraph &G, LoopData *OuterLoop, std::list<LoopData>::iterator Insert, const std::vector<const IrreducibleGraph::IrrNode *> &SCC) argument
789 analyzeIrreducible( const IrreducibleGraph &G, LoopData *OuterLoop, std::list<LoopData>::iterator Insert) argument
809 updateLoopWithIrreducible(LoopData &OuterLoop) argument
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp330 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), ORE(ORE) {}
358 Loop *OuterLoop; member in class:__anon4657::LoopInterchangeLegality
377 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), ORE(ORE) {}
386 Loop *OuterLoop; member in class:__anon4657::LoopInterchangeProfitability
403 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), LI(LI), DT(DT),
406 /// Interchange OuterLoop and InnerLoop.
411 void removeChildLoop(Loop *OuterLoop, Loop *InnerLoop);
417 Loop *OuterLoop; member in class:__anon4657::LoopInterchangeTransform
556 Loop *OuterLoop = LoopList[OuterLoopId]; local
558 LoopInterchangeLegality LIL(OuterLoop, InnerLoo
[all...]
H A DLoopSimplifyCFG.cpp385 if (Loop *OuterLoop = LI.getLoopFor(Preheader)) {
394 if (StillReachable != OuterLoop) {
396 removeBlockFromLoops(NewPreheader, OuterLoop, StillReachable);
398 removeBlockFromLoops(BB, OuterLoop, StillReachable);
399 OuterLoop->removeChildLoop(&L);
405 // Some values from loops in [OuterLoop, StillReachable) could be used
408 Loop *FixLCSSALoop = OuterLoop;
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h440 bool addLoopSuccessorsToDist(const LoopData *OuterLoop, LoopData &Loop,
450 bool addToDist(Distribution &Dist, const LoopData *OuterLoop,
462 /// OuterLoop (or the top-level function, if \c OuterLoop is \c nullptr).
467 analyzeIrreducible(const bfi_detail::IrreducibleGraph &G, LoopData *OuterLoop,
472 /// Update \c OuterLoop. Before finding irreducible control flow, it was
475 /// up need to be removed from \a OuterLoop::Nodes.
476 void updateLoopWithIrreducible(LoopData &OuterLoop);
484 void distributeMass(const BlockNode &Source, LoopData *OuterLoop,
630 /// Construct an explicit graph of the control flow in \c OuterLoop (o
638 IrreducibleGraph(BFIBase &BFI, const BFIBase::LoopData *OuterLoop, BlockEdgesAdder addBlockEdges) argument
663 initialize(const BFIBase::LoopData *OuterLoop, BlockEdgesAdder addBlockEdges) argument
678 addEdges(const BlockNode &Node, const BFIBase::LoopData *OuterLoop, BlockEdgesAdder addBlockEdges) argument
1330 operator ()(IrreducibleGraph &G, IrreducibleGraph::IrrNode &Irr, const LoopData *OuterLoop) argument
1341 computeIrreducibleMass( LoopData *OuterLoop, std::list<LoopData>::iterator Insert) argument
1370 propagateMassToSuccessors(LoopData *OuterLoop, const BlockNode &Node) argument
[all...]
H A DLoopNestAnalysis.h37 /// Return true if the given loops \p OuterLoop and \p InnerLoop are
48 static bool arePerfectlyNested(const Loop &OuterLoop, const Loop &InnerLoop,

Completed in 114 milliseconds