/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
H A D | LoopUnroll.cpp | 1 //===-- UnrollLoop.cpp - Loop unrolling utilities -------------------------===// 112 static bool needToInsertPhisForLCSSA(Loop *L, 121 Loop *DefLoop = LI->getLoopFor(Def->getParent()); 137 const Loop* llvm::addClonedBlockToLoopInfo(BasicBlock *OriginalBB, 141 const Loop *OldLoop = LI->getLoopFor(OriginalBB); 144 Loop *&NewLoop = NewLoops[OldLoop]; 151 Loop *NewLoopParent = NewLoops.lookup(OldLoop->getParentLoop()); 191 static bool isEpilogProfitable(Loop *L) { 205 void llvm::simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI, 282 LoopUnrollResult llvm::UnrollLoop(Loop * [all...] |
H A D | LCSSA.cpp | 90 // Cache the Loop ExitBlocks across this loop. We expect to get a lot of 93 SmallDenseMap<Loop*, SmallVector<BasicBlock *,1>> LoopExitBlocks; 101 Loop *L = LI.getLoopFor(InstBB); 192 // exit for Loop L1 is the header of a disjoint Loop L2. Thus, when we 295 Loop &L, const DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, 336 bool llvm::formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, 342 for (Loop *SubLoop: L) 403 bool llvm::formLCSSARecursively(Loop &L, const DominatorTree &DT, 408 for (Loop *SubLoo [all...] |
H A D | LoopVersioning.cpp | 40 ArrayRef<RuntimePointerCheck> Checks, Loop *L, 53 "Loop is not in loop-simplify form"); 260 bool runImpl(LoopInfo *LI, function_ref<const LoopAccessInfo &(Loop &)> GetLAA, 265 SmallVector<Loop *, 8> Worklist; 267 for (Loop *TopLevelLoop : *LI) 268 for (Loop *L : depth_first(TopLevelLoop)) 275 for (Loop *L : Worklist) { 305 auto GetLAA = [&](Loop &L) -> const LoopAccessInfo & { 332 static const char LVer_name[] = "Loop Versioning"; 362 auto GetLAA = [&](Loop [all...] |
H A D | LoopRotationUtils.cpp | 84 bool processLoop(Loop *L); 87 bool rotateLoop(Loop *L, bool SimplifiedLatch); 88 bool simplifyLoopLatch(Loop *L); 194 static bool profitableToRotateLoopExitingLatch(Loop *L) { 219 static bool canRotateDeoptimizingLatchExit(Loop *L) { 270 bool LoopRotate::rotateLoop(Loop *L, bool SimplifiedLatch) { 359 // Find new Loop header. NewHeader is a Header's one and only successor 628 Loop *PredLoop = LI->getLoopFor(ExitPred); 697 BasicBlock::iterator End, Loop *L) { 769 bool LoopRotate::simplifyLoopLatch(Loop * [all...] |
H A D | LoopPeel.cpp | 9 // Loop Peeling Utilities. 89 bool llvm::canPeel(Loop *L) { 143 PHINode *Phi, Loop *L, BasicBlock *BackEdge, 189 static unsigned countToEliminateCompares(Loop &L, unsigned MaxPeelCount, 191 assert(L.isLoopSimplifyForm() && "Loop needs to be in loop simplify form"); 293 void llvm::computePeelCount(Loop *L, unsigned LoopSize, 347 assert(BackEdge && "Loop is not in simplified form?"); 506 Loop *L, unsigned IterNumber, BasicBlock *InsertTop, BasicBlock *InsertBot, 518 Loop *ParentLoop = L->getParentLoop(); 555 // Recursively create the new Loop object [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
H A D | LoopLoadElimination.cpp | 1 //===- LoopLoadElimination.cpp - Loop Load Elimination Pass ---------------===// 81 cl::desc("The maximum number of SCEV checks allowed for Loop " 99 Loop *L) const { 147 static bool doesStoreDominatesAllLatches(BasicBlock *StoreBlock, Loop *L, 157 static bool isLoadConditional(LoadInst *Load, Loop *L) { 166 LoadEliminationForLoop(Loop *L, LoopInfo *LI, const LoopAccessInfo &LAI, 540 LLVM_DEBUG(dbgs() << "Loop is not is loop-simplify form"); 593 Loop *L; 614 function_ref<const LoopAccessInfo &(Loop &)> GetLAI) { 620 SmallVector<Loop *, [all...] |
H A D | LoopUnrollPass.cpp | 1 //===- LoopUnroll.cpp - Loop unroller pass --------------------------------===// 186 Loop *L, ScalarEvolution &SE, const TargetTransformInfo &TTI, 337 const Loop *L, unsigned TripCount, DominatorTree &DT, ScalarEvolution &SE, 419 assert(Cost.IsFree && "Loop PHIs shouldn't be evaluated as they " 655 const Loop *L, unsigned &NumCalls, bool &NotDuplicatable, bool &Convergent, 681 static MDNode *getUnrollMetadataForLoop(const Loop *L, StringRef Name) { 688 static bool hasUnrollFullPragma(const Loop *L) { 694 static bool hasUnrollEnablePragma(const Loop *L) { 699 static bool hasRuntimeUnrollDisablePragma(const Loop *L) { 705 static unsigned unrollCountPragmaValue(const Loop * [all...] |
H A D | LICM.cpp | 1 //===-- LICM.cpp - Loop Invariant Code Motion Pass ------------------------===// 151 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI); 152 static bool isNotUsedOrFreeInLoop(const Instruction &I, const Loop *CurLoop, 155 static void hoist(Instruction &I, const DominatorTree *DT, const Loop *CurLoop, 160 BlockFrequencyInfo *BFI, const Loop *CurLoop, 166 const Loop *CurLoop, 171 AliasSetTracker *CurAST, Loop *CurLoop, 174 Loop *CurLoop, Instruction &I, 189 static void foreachMemoryAccess(MemorySSA *MSSA, Loop *L, 192 collectPromotionCandidates(MemorySSA *MSSA, AliasAnalysis *AA, Loop * [all...] |
H A D | LoopSink.cpp | 1 //===-- LoopSink.cpp - Loop Sink Pass -------------------------------------===// 132 findBBsToSinkInto(const Loop &L, const SmallPtrSetImpl<BasicBlock *> &UseBBs, 187 Loop &L, Instruction &I, const SmallVectorImpl<BasicBlock *> &ColdLoopBBs, 279 static bool sinkLoopInvariantInstructions(Loop &L, AAResults &AA, LoopInfo &LI, 344 static void computeAliasSet(Loop &L, BasicBlock &Preheader, 370 SmallVector<Loop *, 4> PreorderLoops = LI.getLoopsInPreorder(); 374 Loop &L = *PreorderLoops.pop_back_val(); 422 bool runOnLoop(Loop *L, LPPassManager &LPM) override { 471 INITIALIZE_PASS_BEGIN(LegacyLoopSinkPass, "loop-sink", "Loop Sink", false, 476 INITIALIZE_PASS_END(LegacyLoopSinkPass, "loop-sink", "Loop Sin [all...] |
H A D | PlaceSafepoints.cpp | 123 bool runOnLoop(Loop *); 124 void runOnLoopAndSubLoops(Loop *L) { 126 for (Loop *I : *L) 136 for (Loop *I : *LI) { 200 static bool containsUnconditionalCallSafepoint(Loop *L, BasicBlock *Header, 242 static bool mustBeFiniteCountedLoop(Loop *L, ScalarEvolution *SE, 308 bool PlaceBackedgeSafepointsImpl::runOnLoop(Loop *L) { 309 // Loop through all loop latches (branches controlling backedges). We need
|
H A D | IndVarSimplify.cpp | 154 bool handleFloatingPointIV(Loop *L, PHINode *PH); 155 bool rewriteNonIntegerIVs(Loop *L); 157 bool simplifyAndExtend(Loop *L, SCEVExpander &Rewriter, LoopInfo *LI); 159 bool optimizeLoopExits(Loop *L, SCEVExpander &Rewriter); 162 bool predicateLoopExits(Loop *L, SCEVExpander &Rewriter); 164 bool rewriteFirstIterationLoopExitValues(Loop *L); 166 bool linearFunctionTestReplace(Loop *L, BasicBlock *ExitingBB, 170 bool sinkUnusedInvariants(Loop *L); 182 bool run(Loop *L); 212 bool IndVarSimplify::handleFloatingPointIV(Loop * [all...] |
H A D | LoopRerollPass.cpp | 1 //===- LoopReroll.cpp - Loop rerolling pass -------------------------------===// 173 bool runOnLoop(Loop *L, LPPassManager &LPM) override; 187 bool runOnLoop(Loop *L); 211 SimpleLoopReduction(Instruction *P, Loop *L) : Instructions(1, P) { 263 void add(Loop *L); 389 DAGRootTracker(LoopReroll *Parent, Loop *L, Instruction *IV, 443 Loop *L; 454 // Loop step amount. 457 // Loop reroll count; if Inc == 1, this records the scaling applied 487 bool isLoopControlIV(Loop * [all...] |
/netbsd-current/crypto/external/bsd/openssl.old/lib/libcrypto/arch/powerpc/ |
H A D | poly1305-ppc.S | 92 b .Loop 95 .Loop: 213 bc 16,0,.Loop
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.h | 35 class Loop; 112 getPreferredAddressingMode(const Loop *L, ScalarEvolution *SE) const; 271 bool isHardwareLoopProfitable(Loop *L, ScalarEvolution &SE, 275 bool preferPredicateOverEpilogue(Loop *L, LoopInfo *LI, 281 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 286 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | Loads.h | 26 class Loop; 83 bool isDereferenceableAndAlignedInLoop(LoadInst *LI, Loop *L,
|
H A D | SyncDependenceAnalysis.h | 30 class Loop;
|
H A D | DDGPrinter.h | 29 PreservedAnalyses run(Loop &L, LoopAnalysisManager &AM,
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Passes/ |
H A D | StandardInstrumentations.cpp | 216 if (any_isa<const Loop *>(IR)) { 217 const Loop *L = any_cast<const Loop *>(IR); 253 void printIR(raw_ostream &OS, const Loop *L) { 257 printLoop(const_cast<Loop &>(*L), OS); 274 if (any_isa<const Loop *>(IR)) { 275 const Loop *L = any_cast<const Loop *>(IR); 317 if (any_isa<const Loop *>(IR)) { 318 const Loop * [all...] |
/netbsd-current/usr.sbin/mopd/moptrace/ |
H A D | moptrace.c | 105 Loop();
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyTargetTransformInfo.h | 51 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
H A D | HexagonTargetTransformInfo.h | 28 class Loop; 63 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 66 void getPeelingPreferences(Loop *L, ScalarEvolution &SE, 71 getPreferredAddressingMode(const Loop *L, ScalarEvolution *SE) const;
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.h | 66 bool isHardwareLoopProfitable(Loop *L, ScalarEvolution &SE, 70 bool canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI, 74 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 76 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
H A D | SIAnnotateControlFlow.cpp | 54 Function *Loop; member in class:__anon2253::SIAnnotateControlFlow 83 handleLoopCondition(Value *Cond, PHINode *Broken, llvm::Loop *L, 141 Loop = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_loop, { IntMask }); 224 Value *Cond, PHINode *Broken, llvm::Loop *L, BranchInst *Term) { 256 llvm::Loop *L = LI->getLoopFor(BB); 279 Term->setCondition(CallInst::Create(Loop, Arg, "", Term)); 286 llvm::Loop *L = LI->getLoopFor(BB);
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
H A D | ModuloSchedule.h | 81 MachineLoop *Loop; member in class:llvm::ModuloSchedule 105 ModuloSchedule(MachineFunction &MF, MachineLoop *Loop, argument 109 : Loop(Loop), ScheduledInstrs(ScheduledInstrs), Cycle(std::move(Cycle)), 118 MachineLoop *getLoop() const { return Loop; }
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/TableGen/ |
H A D | TGParser.h | 43 std::unique_ptr<ForeachLoop> Loop; member in struct:llvm::RecordsEntry 50 RecordsEntry(std::unique_ptr<ForeachLoop> Loop) argument 51 : Loop(std::move(Loop)) {} 209 bool resolve(const ForeachLoop &Loop, SubstStack &Stack, bool Final,
|