Home
last modified time | relevance | path

Searched refs:Loop (Results 1 – 25 of 234) sorted by relevance

12345678910

/minix3/external/bsd/llvm/dist/llvm/test/Transforms/IndVarSimplify/
H A Dexit_value_tests.ll10 br label %Loop
12 Loop: ; preds = %Loop, %0
13 %A1 = phi i32 [ 0, %0 ], [ %A2, %Loop ] ; <i32> [#uses=3]
14 %B1 = phi i32 [ 0, %0 ], [ %B2, %Loop ] ; <i32> [#uses=1]
18 br i1 %C, label %Out, label %Loop
20 Out: ; preds = %Loop
26 br label %Loop
28 Loop: ; preds = %Loop, %0
29 %X = phi i32 [ 0, %0 ], [ %X2, %Loop ] ; <i32> [#uses=4]
32 br i1 %c, label %Out, label %Loop
[all …]
H A D2003-09-23-NotAtTop.ll8 br label %Loop
10 Loop: ; preds = %Loop, %0
11 ; CHECK: Loop:
13 %NonIndvar = phi i32 [ 200, %0 ], [ %NonIndvarNext, %Loop ] ; <i32> [#uses=1]
14 %Canonical = phi i32 [ 0, %0 ], [ %CanonicalNext, %Loop ] ; <i32> [#uses=2]
18 br label %Loop
/minix3/external/bsd/llvm/dist/llvm/include/llvm/Analysis/
H A DLoopPass.h40 virtual bool runOnLoop(Loop *L, LPPassManager &LPM) = 0;
46 virtual bool doInitialization(Loop *L, LPPassManager &LPM) { in doInitialization()
80 virtual void cloneBasicBlockAnalysis(BasicBlock *F, BasicBlock *T, Loop *L) {} in cloneBasicBlockAnalysis()
83 virtual void deleteAnalysisValue(Value *V, Loop *L) {} in deleteAnalysisValue()
88 virtual void deleteAnalysisLoop(Loop *L) {} in deleteAnalysisLoop()
93 bool skipOptnoneFunction(const Loop *L) const;
131 void deleteLoopFromQueue(Loop *L);
135 void insertLoop(Loop *L, Loop *ParentLoop);
138 void insertLoopIntoQueue(Loop *L);
143 void redoLoop(Loop *L);
[all …]
H A DDependenceAnalysis.h49 class Loop; variable
391 const Loop *AssociatedLoop;
435 const Loop *getAssociatedLoop() const;
438 void setPoint(const SCEV *X, const SCEV *Y, const Loop *CurrentLoop);
442 const SCEV *C, const Loop *CurrentLoop);
445 void setDistance(const SCEV *D, const Loop *CurrentLoop);
516 unsigned mapSrcLoop(const Loop *SrcLoop) const;
520 unsigned mapDstLoop(const Loop *DstLoop) const;
524 bool isLoopInvariant(const SCEV *Expression, const Loop *LoopNest) const;
541 const Loop *LoopNest,
[all …]
H A DScalarEvolution.h47 class Loop; variable
358 DenseMap<const Loop*, BackedgeTakenInfo> BackedgeTakenCounts;
371 SmallVector<std::pair<const Loop *, const SCEV *>, 2> > ValuesAtScopes;
375 SmallVector<std::pair<const Loop *, LoopDisposition>, 2> > LoopDispositions;
378 LoopDisposition computeLoopDisposition(const SCEV *S, const Loop *L);
428 const SCEV *computeSCEVAtScope(const SCEV *S, const Loop *L);
439 const BackedgeTakenInfo &getBackedgeTakenInfo(const Loop *L);
443 BackedgeTakenInfo ComputeBackedgeTakenCount(const Loop *L);
447 ExitLimit ComputeExitLimit(const Loop *L, BasicBlock *ExitingBlock);
452 ExitLimit ComputeExitLimitFromCond(const Loop *L,
[all …]
H A DBlockFrequencyInfoImpl.h39 class Loop; variable
238 LoopData *Loop; ///< The loop this block is inside.
241 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
243 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
245 return isLoopHeader() && Loop->Parent && Loop->Parent->isIrreducible() &&
246 Loop->Parent->isHeader(Node);
251 return Loop;
253 return Loop->Parent;
254 return Loop->Parent->Parent;
275 if (!Loop || !Loop->IsPackaged)
[all …]
/minix3/external/bsd/llvm/dist/llvm/test/Analysis/BasicAA/
H A Dstore-promote.ll14 br label %Loop
16 Loop: ; preds = %Loop, %0
19 br i1 %c, label %Out, label %Loop
21 Out: ; preds = %Loop
25 ; The Loop block should be empty after the load/store are promoted.
28 ; CHECK: Loop:
29 ; CHECK-NEXT: br i1 %c, label %Out, label %Loop
35 br label %Loop
37 Loop: ; preds = %Loop, %0
44 br i1 %c, label %Out, label %Loop
[all …]
/minix3/external/bsd/llvm/dist/llvm/lib/Analysis/
H A DLoopInfo.cpp35 template class llvm::LoopBase<BasicBlock, Loop>;
36 template class llvm::LoopInfoBase<BasicBlock, Loop>;
62 bool Loop::isLoopInvariant(Value *V) const { in isLoopInvariant()
70 bool Loop::hasLoopInvariantOperands(Instruction *I) const { in hasLoopInvariantOperands()
87 bool Loop::makeLoopInvariant(Value *V, bool &Changed, in makeLoopInvariant()
103 bool Loop::makeLoopInvariant(Instruction *I, bool &Changed, in makeLoopInvariant()
142 PHINode *Loop::getCanonicalInductionVariable() const { in getCanonicalInductionVariable()
179 bool Loop::isLCSSAForm(DominatorTree &DT) const { in isLCSSAForm()
206 bool Loop::isLoopSimplifyForm() const { in isLoopSimplifyForm()
214 bool Loop::isSafeToClone() const { in isSafeToClone()
[all …]
H A DBlockFrequencyInfoImpl.cpp323 const LoopData *OuterLoop, LoopData &Loop, Distribution &Dist) { in addLoopSuccessorsToDist() argument
325 for (const auto &I : Loop.Exits) in addLoopSuccessorsToDist()
326 if (!addToDist(Dist, OuterLoop, Loop.getHeader(), I.first, in addLoopSuccessorsToDist()
341 void BlockFrequencyInfoImplBase::computeLoopScale(LoopData &Loop) { in computeLoopScale() argument
343 DEBUG(dbgs() << "compute-loop-scale: " << getLoopName(Loop) << "\n"); in computeLoopScale()
347 BlockMass ExitMass = BlockMass::getFull() - Loop.BackedgeMass; in computeLoopScale()
350 Loop.Scale = ExitMass.toScaled().inverse(); in computeLoopScale()
353 << " - " << Loop.BackedgeMass << ")\n" in computeLoopScale()
354 << " - scale = " << Loop.Scale << "\n"); in computeLoopScale()
356 if (Loop.Scale > getMaxLoopScale()) { in computeLoopScale()
[all …]
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/LoopSimplify/
H A Dhardertest.ll6 br label %Loop
8 br label %Loop
9 Loop: ; preds = %L2, %Loop, %F, %T
10 %Val = phi i32 [ 0, %T ], [ 1, %F ], [ 2, %Loop ], [ 3, %L2 ] ; <i32> [#uses=0]
11 br i1 %C, label %Loop, label %L2
12 L2: ; preds = %Loop
13 br label %Loop
H A Dsingle-backedge.ll6 ; CHECK: Loop.backedge:
8 ; CHECK: br label %Loop
12 br label %Loop
13 Loop: ; preds = %BE2, %BE1, %0
18 BE1: ; preds = %Loop
19 br label %Loop
20 BE2: ; preds = %Loop
21 br label %Loop
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/LoopStrengthReduce/
H A Ddont_insert_redundant_ops.ll12 br label %Loop
13 Loop: ; preds = %Loop, %0
14 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
21 br i1 %cond, label %Loop, label %Out
22 Out: ; preds = %Loop
28 br label %Loop
29 Loop: ; preds = %Loop, %0
30 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
37 br i1 %cond, label %Loop, label %Out
38 Out: ; preds = %Loop
H A Dremove_indvar.ll8 br label %Loop
9 Loop: ; preds = %Loop, %0
10 %i = phi i32 [ 0, %0 ], [ %i.next, %Loop ]
11 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=2]
17 br i1 %cond, label %Loop, label %Out
18 Out: ; preds = %Loop
/minix3/external/bsd/llvm/dist/llvm/test/ExecutionEngine/MCJIT/
H A D2003-01-04-PhiTest.ll5 br label %Loop
6 Loop: ; preds = %Loop, %0
7 %X = phi i32 [ 0, %0 ], [ 1, %Loop ] ; <i32> [#uses=1]
8 br i1 true, label %Out, label %Loop
9 Out: ; preds = %Loop
H A Dtest-loop.ll5 br label %Loop
6 Loop: ; preds = %Loop, %0
7 %I = phi i32 [ 0, %0 ], [ %i2, %Loop ] ; <i32> [#uses=1]
10 br i1 %C, label %Out, label %Loop
11 Out: ; preds = %Loop
/minix3/external/bsd/llvm/dist/llvm/test/ExecutionEngine/
H A D2003-01-04-PhiTest.ll5 br label %Loop
6 Loop: ; preds = %Loop, %0
7 %X = phi i32 [ 0, %0 ], [ 1, %Loop ] ; <i32> [#uses=1]
8 br i1 true, label %Out, label %Loop
9 Out: ; preds = %Loop
H A Dtest-loop.ll5 br label %Loop
6 Loop: ; preds = %Loop, %0
7 %I = phi i32 [ 0, %0 ], [ %i2, %Loop ] ; <i32> [#uses=1]
10 br i1 %C, label %Out, label %Loop
11 Out: ; preds = %Loop
/minix3/external/bsd/llvm/dist/llvm/test/Assembler/
H A D2002-08-22-DominanceProblem.ll9 ret i32 7 ; Loop is unreachable
11 Loop: ; preds = %L2, %Loop
12 %B = phi i32 [ %B, %L2 ], [ %B, %Loop ] ;PHI has same value always.
13 br i1 %b, label %L2, label %Loop
15 L2: ; preds = %Loop
16 br label %Loop
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/LICM/
H A Dsinking.ll9 br label %Loop
11 Loop: ; preds = %Loop, %0
13 br i1 false, label %Loop, label %Out
15 Out: ; preds = %Loop
27 br label %Loop
29 Loop: ; preds = %Loop, %0
32 br i1 true, label %Loop, label %Out
34 Out: ; preds = %Loop
46 br i1 false, label %Loop, label %Exit
47 Loop:
[all …]
H A D2003-02-27-StoreSinkPHIs.ll7 br i1 %c, label %Loop, label %Out
8 Loop: ; preds = %Loop, %0
10 br i1 %c, label %Loop, label %Out
11 Out: ; preds = %Loop, %0
12 %X = phi i1 [ %c, %0 ], [ true, %Loop ] ; <i1> [#uses=1]
H A Dbasictest.ll5 br label %Loop
6 Loop: ; preds = %Loop, %0
7 %j = phi i32 [ 0, %0 ], [ %Next, %Loop ] ; <i32> [#uses=1]
11 br i1 %cond, label %Out, label %Loop
12 Out: ; preds = %Loop
H A Dscalar_promote.ll8 br label %Loop
12 ; CHECK-NEXT: br label %Loop
15 Loop: ; preds = %Loop, %0
16 %j = phi i32 [ 0, %Entry ], [ %Next, %Loop ] ; <i32> [#uses=1]
22 br i1 %cond, label %Out, label %Loop
35 br label %Loop
39 ; CHECK-NEXT: br label %Loop
41 Loop: ; preds = %Loop, %0
47 br i1 false, label %Loop, label %Exit
49 Exit: ; preds = %Loop
[all …]
H A D2003-12-11-SinkingToPHI.ll5 br label %Loop
6 Loop: ; preds = %LoopCont, %entry
8 LoopCont: ; preds = %Loop
10 br i1 true, label %Out, label %Loop
11 Out: ; preds = %LoopCont, %Loop
12 %V = phi i32 [ 2, %Loop ], [ %X, %LoopCont ] ; <i32> [#uses=1]
H A Dno-preheader-test.ll7 br label %Loop
9 br label %Loop
10 Loop: ; preds = %Loop, %Else, %Then
11 %j = phi i32 [ 0, %Then ], [ 12, %Else ], [ %Next, %Loop ] ; <i32> [#uses=1]
16 br i1 %cond, label %Out, label %Loop
17 Out: ; preds = %Loop
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/SCCP/
H A Dcalltest.ll10 br label %Loop
11 Loop: ; preds = %Loop, %entry
12 %I2 = phi i32 [ 0, %entry ], [ %I3, %Loop ] ; <i32> [#uses=1]
13 %V = phi double [ 1.000000e+00, %entry ], [ %V2, %Loop ] ; <double> [#uses=2]
17 br i1 %tmp.7, label %Loop, label %Exit
18 Exit: ; preds = %Loop

12345678910