Home
last modified time | relevance | path

Searched refs:OuterLoop (Results 1 – 7 of 7) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp299 const LoopData *OuterLoop, in addToDist() argument
306 auto isLoopHeader = [&OuterLoop](const BlockNode &Node) { in addToDist()
307 return OuterLoop && OuterLoop->isHeader(Node); in addToDist()
331 if (Working[Resolved.Index].getContainingLoop() != OuterLoop) { in addToDist()
340 assert((!OuterLoop || !OuterLoop->isIrreducible()) && in addToDist()
351 assert(OuterLoop && OuterLoop->isIrreducible() && !isLoopHeader(Resolved) && in addToDist()
361 const LoopData *OuterLoop, LoopData &Loop, Distribution &Dist) { in addLoopSuccessorsToDist() argument
364 if (!addToDist(Dist, OuterLoop, Loop.getHeader(), I.first, in addLoopSuccessorsToDist()
434 LoopData *OuterLoop, in distributeMass() argument
452 assert(OuterLoop && "backedge or exit outside of loop"); in distributeMass()
[all …]
H A DLoopNestAnalysis.cpp36 static bool checkLoopsStructure(const Loop &OuterLoop, const Loop &InnerLoop,
53 bool LoopNest::arePerfectlyNested(const Loop &OuterLoop, const Loop &InnerLoop, in arePerfectlyNested() argument
55 assert(!OuterLoop.isInnermost() && "Outer loop should have subloops"); in arePerfectlyNested()
57 LLVM_DEBUG(dbgs() << "Checking whether loop '" << OuterLoop.getName() in arePerfectlyNested()
67 if (!checkLoopsStructure(OuterLoop, InnerLoop, SE)) { in arePerfectlyNested()
73 auto OuterLoopLB = OuterLoop.getBounds(SE); in arePerfectlyNested()
76 << OuterLoop << "\n";); in arePerfectlyNested()
81 const BasicBlock *Latch = OuterLoop.getLoopLatch(); in arePerfectlyNested()
140 const BasicBlock *OuterLoopHeader = OuterLoop.getHeader(); in arePerfectlyNested()
141 const BasicBlock *OuterLoopLatch = OuterLoop.getLoopLatch(); in arePerfectlyNested()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp329 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), ORE(ORE) {} in LoopInterchangeLegality()
357 Loop *OuterLoop; member in __anonc2e4e0200211::LoopInterchangeLegality
376 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), ORE(ORE) {} in LoopInterchangeProfitability()
385 Loop *OuterLoop; member in __anonc2e4e0200211::LoopInterchangeProfitability
401 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), LI(LI), DT(DT), LIL(LIL) {} in LoopInterchangeTransform()
408 void removeChildLoop(Loop *OuterLoop, Loop *InnerLoop);
414 Loop *OuterLoop; member in __anonc2e4e0200211::LoopInterchangeTransform
537 bool processLoop(Loop *InnerLoop, Loop *OuterLoop, unsigned InnerLoopId, in processLoop()
542 LoopInterchangeLegality LIL(OuterLoop, InnerLoop, SE, ORE); in processLoop()
548 LoopInterchangeProfitability LIP(OuterLoop, InnerLoop, SE, ORE); in processLoop()
[all …]
H A DLoopFlatten.cpp75 Loop *OuterLoop = nullptr; member
91 FlattenInfo(Loop *OL, Loop *IL) : OuterLoop(OL), InnerLoop(IL) {}; in FlattenInfo()
235 if (!OuterPHI || OuterPHI->getParent() != FI.OuterLoop->getHeader()) { in checkPHIs()
245 OuterPHI->getIncomingValueForBlock(FI.OuterLoop->getLoopLatch())); in checkPHIs()
266 for (PHINode &OuterPHI : FI.OuterLoop->getHeader()->phis()) { in checkPHIs()
287 for (auto *B : FI.OuterLoop->getBlocks()) { in checkOuterLoopInsts()
434 Function *F = FI.OuterLoop->getHeader()->getParent(); in checkOverflow()
445 FI.OuterLoop->getLoopPreheader()->getTerminator(), DT); in checkOverflow()
478 if (!findLoopComponents(FI.OuterLoop, IterationInstructions, FI.OuterInductionPHI, in CanFlattenLoopPair()
484 if (!FI.OuterLoop->isLoopInvariant(FI.InnerLimit)) { in CanFlattenLoopPair()
[all …]
H A DLoopSimplifyCFG.cpp389 if (Loop *OuterLoop = LI.getLoopFor(Preheader)) { in handleDeadExits() local
398 if (StillReachable != OuterLoop) { in handleDeadExits()
400 removeBlockFromLoops(NewPreheader, OuterLoop, StillReachable); in handleDeadExits()
402 removeBlockFromLoops(BB, OuterLoop, StillReachable); in handleDeadExits()
403 OuterLoop->removeChildLoop(&L); in handleDeadExits()
412 Loop *FixLCSSALoop = OuterLoop; in handleDeadExits()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h439 bool addLoopSuccessorsToDist(const LoopData *OuterLoop, LoopData &Loop,
449 bool addToDist(Distribution &Dist, const LoopData *OuterLoop,
466 analyzeIrreducible(const bfi_detail::IrreducibleGraph &G, LoopData *OuterLoop,
475 void updateLoopWithIrreducible(LoopData &OuterLoop);
483 void distributeMass(const BlockNode &Source, LoopData *OuterLoop,
637 IrreducibleGraph(BFIBase &BFI, const BFIBase::LoopData *OuterLoop,
639 initialize(OuterLoop, addBlockEdges);
643 void initialize(const BFIBase::LoopData *OuterLoop,
645 void addNodesInLoop(const BFIBase::LoopData &OuterLoop);
655 void addEdges(const BlockNode &Node, const BFIBase::LoopData *OuterLoop,
[all …]
H A DLoopNestAnalysis.h49 static bool arePerfectlyNested(const Loop &OuterLoop, const Loop &InnerLoop,