| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | exit_value_tests.ll | 10 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 …]
|
| D | 2003-09-23-NotAtTop.ll | 8 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
|
| /external/llvm/test/Transforms/LICM/ |
| D | sinking.ll | 9 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 …]
|
| D | scalar_promote.ll | 8 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
34 br label %Loop
38 ; CHECK-NEXT: br label %Loop
40 Loop: ; preds = %Loop, %0
46 br i1 false, label %Loop, label %Exit
48 Exit: ; preds = %Loop
[all …]
|
| D | hoisting.ll | 12 br label %Loop
13 Loop: ; preds = %LoopTail, %0
17 IfUnEqual: ; preds = %Loop
23 LoopTail: ; preds = %IfUnEqual, %Loop
24 %B = phi i32 [ 0, %Loop ], [ %B1, %IfUnEqual ] ; <i32> [#uses=1]
25 br i1 %c, label %Loop, label %Out
41 br label %Loop
42 Loop:
46 br i1 %c, label %Loop, label %Out
47 Out: ; preds = %Loop
[all …]
|
| D | no-preheader-test.ll | 7 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
|
| D | 2003-02-27-StoreSinkPHIs.ll | 7 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]
|
| D | basictest.ll | 5 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
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 34 template class llvm::LoopBase<BasicBlock, Loop>;
35 template class llvm::LoopInfoBase<BasicBlock, Loop>;
58 bool Loop::isLoopInvariant(Value *V) const { in INITIALIZE_PASS_DEPENDENCY()
66 bool Loop::hasLoopInvariantOperands(Instruction *I) const { in hasLoopInvariantOperands()
83 bool Loop::makeLoopInvariant(Value *V, bool &Changed, in makeLoopInvariant()
99 bool Loop::makeLoopInvariant(Instruction *I, bool &Changed, in makeLoopInvariant()
138 PHINode *Loop::getCanonicalInductionVariable() const { in getCanonicalInductionVariable()
175 bool Loop::isLCSSAForm(DominatorTree &DT) const { in isLCSSAForm()
207 bool Loop::isLoopSimplifyForm() const { in isLoopSimplifyForm()
215 bool Loop::isSafeToClone() const { in isSafeToClone()
[all …]
|
| D | LoopPass.cpp | 40 bool runOnLoop(Loop *L, LPPassManager &) { in runOnLoop()
42 for (Loop::block_iterator b = L->block_begin(), be = L->block_end(); in runOnLoop()
69 void LPPassManager::deleteLoopFromQueue(Loop *L) { in deleteLoopFromQueue()
84 for (std::deque<Loop *>::iterator I = LQ.begin(), in deleteLoopFromQueue()
94 void LPPassManager::insertLoop(Loop *L, Loop *ParentLoop) { in insertLoop()
107 void LPPassManager::insertLoopIntoQueue(Loop *L) { in insertLoopIntoQueue()
116 for (std::deque<Loop *>::iterator I = LQ.begin(), in insertLoopIntoQueue()
131 void LPPassManager::redoLoop(Loop *L) { in redoLoop()
139 BasicBlock *To, Loop *L) { in cloneBasicBlockSimpleAnalysis()
147 void LPPassManager::deleteSimpleAnalysisValue(Value *V, Loop *L) { in deleteSimpleAnalysisValue()
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopPass.h | 40 virtual bool runOnLoop(Loop *L, LPPassManager &LPM) = 0;
43 virtual bool doInitialization(Loop *L, LPPassManager &LPM) { in doInitialization()
78 virtual void cloneBasicBlockAnalysis(BasicBlock *F, BasicBlock *T, Loop *L) {} in cloneBasicBlockAnalysis()
81 virtual void deleteAnalysisValue(Value *V, Loop *L) {} in deleteAnalysisValue()
119 void deleteLoopFromQueue(Loop *L);
123 void insertLoop(Loop *L, Loop *ParentLoop);
126 void insertLoopIntoQueue(Loop *L);
131 void redoLoop(Loop *L);
142 void cloneBasicBlockSimpleAnalysis(BasicBlock *From, BasicBlock *To, Loop *L);
146 void deleteSimpleAnalysisValue(Value *V, Loop *L);
[all …]
|
| D | LoopInfo.h | 57 class Loop; variable
318 raw_ostream& operator<<(raw_ostream &OS, const LoopBase<BlockT, LoopT> &Loop) {
319 Loop.print(OS);
325 __extension__ extern template class LoopBase<BasicBlock, Loop>;
328 class Loop : public LoopBase<BasicBlock, Loop> {
330 Loop() {} in Loop() function
402 friend class LoopInfoBase<BasicBlock, Loop>;
403 explicit Loop(BasicBlock *BB) : LoopBase<BasicBlock, Loop>(BB) {} in Loop() function
546 __extension__ extern template class LoopInfoBase<BasicBlock, Loop>;
550 LoopInfoBase<BasicBlock, Loop> LI;
[all …]
|
| D | ScalarEvolution.h | 46 class Loop; variable
348 DenseMap<const Loop*, BackedgeTakenInfo> BackedgeTakenCounts;
361 std::map<const Loop *, const SCEV *> > ValuesAtScopes;
365 std::map<const Loop *, LoopDisposition> > LoopDispositions;
368 LoopDisposition computeLoopDisposition(const SCEV *S, const Loop *L);
418 const SCEV *computeSCEVAtScope(const SCEV *S, const Loop *L);
437 const BackedgeTakenInfo &getBackedgeTakenInfo(const Loop *L);
441 BackedgeTakenInfo ComputeBackedgeTakenCount(const Loop *L);
445 ExitLimit ComputeExitLimit(const Loop *L, BasicBlock *ExitingBlock);
450 ExitLimit ComputeExitLimitFromCond(const Loop *L,
[all …]
|
| /external/llvm/test/Analysis/BasicAA/ |
| D | store-promote.ll | 14 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 …]
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| D | dont_insert_redundant_ops.ll | 8 br label %Loop
9 Loop: ; preds = %Loop, %0
10 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
17 br i1 %cond, label %Loop, label %Out
18 Out: ; preds = %Loop
24 br label %Loop
25 Loop: ; preds = %Loop, %0
26 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
33 br i1 %cond, label %Loop, label %Out
34 Out: ; preds = %Loop
|
| D | remove_indvar.ll | 8 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
|
| /external/llvm/test/Transforms/LoopSimplify/ |
| D | hardertest.ll | 6 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
|
| D | single-backedge.ll | 6 ; 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
|
| /external/llvm/test/Assembler/ |
| D | 2002-08-22-DominanceProblem.ll | 8 ret i32 7 ; Loop is unreachable
10 Loop: ; preds = %L2, %Loop
11 %B = phi i32 [ %B, %L2 ], [ %B, %Loop ] ;PHI has same value always.
12 br i1 %b, label %L2, label %Loop
14 L2: ; preds = %Loop
15 br label %Loop
|
| /external/llvm/test/ExecutionEngine/ |
| D | 2003-01-04-PhiTest.ll | 5 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
|
| D | test-loop.ll | 5 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
|
| /external/llvm/test/ExecutionEngine/MCJIT/ |
| D | 2003-01-04-PhiTest.ll | 5 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
|
| D | test-loop.ll | 5 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
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | trip-count9.ll | 12 ; CHECK: Loop %loop: backedge-taken count is (-1 + %n)
13 ; CHECK: Loop %loop: max backedge-taken count is 6
28 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
29 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
44 ; CHECK: Loop %loop: backedge-taken count is (-2 + (2 smax %n))
45 ; CHECK: Loop %loop: max backedge-taken count is 5
60 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
61 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
76 ; CHECK: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
77 ; CHECK: Loop %loop: max backedge-taken count is -1
[all …]
|
| /external/llvm/test/Transforms/SCCP/ |
| D | calltest.ll | 10 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
|