| /external/llvm/test/Analysis/ScalarEvolution/ |
| max-trip-count-address-space.ll | 67 ; CHECK-NEXT: backedge-taken count is
68 ; CHECK-NEXT: max backedge-taken count is -1
|
| 2008-12-08-FiniteSGE.ll | 3 ; CHECK: backedge-taken count is 255
|
| nsw-offset-assume.ll | 81 ; backedge-taken count expression:
82 ; CHECK: Loop %bb: backedge-taken count is ((-1 + (2 * (%no /u 2))) /u 2)
83 ; CHECK: Loop %bb: max backedge-taken count is 1073741822
|
| /external/llvm/test/Transforms/LCSSA/ |
| 2006-10-31-UnreachableBlock.ll | 40 loopentry.0.i: ; preds = %loopentry.0.i.backedge, %skb_bond.exit.i
71 br label %loopentry.0.i.backedge
73 br label %loopentry.0.i.backedge
74 loopentry.0.i.backedge: ; preds = %endif.1.i, %endif.2.i
78 loopentry.1.i: ; preds = %loopentry.1.i.backedge, %loopexit.0.i
115 br label %loopentry.1.i.backedge
117 br label %loopentry.1.i.backedge
118 loopentry.1.i.backedge: ; preds = %endif.4.i, %endif.5.i
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| tripcount-overflow.ll | 6 ; when the backedge-count is -1.
8 ; If %N, the backedge-taken count, is -1 then %0 unsigned-overflows
|
| unloop.ll | 25 br i1 true, label %outer.backedge, label %tail
30 outer.backedge:
49 ; Now it is the outer loop backedge.
93 br i1 %cmp.i, label %while.cond2.backedge.i, label %while.end.i
95 while.cond2.backedge.i:
110 br label %while.cond2.backedge.i
148 ; CHECKFIXME: while.cond.outer.outer.backedge:
235 br i1 %cmp5.i, label %while.cond.outer.outer.backedge, label %for.cond8.preheader.i8.thread
238 br label %while.cond.outer.outer.backedge
240 while.cond.outer.outer.backedge
[all...] |
| /external/swiftshader/third_party/LLVM/test/Transforms/LCSSA/ |
| 2006-10-31-UnreachableBlock.ll | 39 loopentry.0.i: ; preds = %loopentry.0.i.backedge, %skb_bond.exit.i
70 br label %loopentry.0.i.backedge
72 br label %loopentry.0.i.backedge
73 loopentry.0.i.backedge: ; preds = %endif.1.i, %endif.2.i
77 loopentry.1.i: ; preds = %loopentry.1.i.backedge, %loopexit.0.i
114 br label %loopentry.1.i.backedge
116 br label %loopentry.1.i.backedge
117 loopentry.1.i.backedge: ; preds = %endif.4.i, %endif.5.i
|
| /external/llvm/test/CodeGen/Thumb2/ |
| 2009-08-01-WrongLDRBOpc.ll | 28 bb.i: ; preds = %bb4.backedge.i, %bb.i.preheader
29 br i1 undef, label %bb3.i, label %bb4.backedge.i
80 bb4.backedge.i: ; preds = %bb.i
83 tbl.exit: ; preds = %bb4.backedge.i, %bb4.preheader.i
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| lftr-extend-const.ll | 26 ; Check that post-incrementing the backedge taken count does not overflow.
|
| /external/llvm/test/Transforms/LoopVectorize/AArch64/ |
| backedge-overflow.ll | 3 ; The following tests contain loops for which SCEV cannot determine the backedge
4 ; taken count. This is because the backedge taken condition is produced by an
7 ; using SCEV predicates. This allows us to compute a 'guarded' backedge count.
9 ; backedge count and vectorize more loops.
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| ScalarEvolution.h | 288 /// BackedgeTakenInfo - Information about the backedge-taken count
296 /// Max - An expression indicating the least maximum backedge-taken
315 /// getExact - Return an expression indicating the exact backedge-taken
327 /// getMax - Get the max backedge taken count for the loop.
334 /// BackedgeTakenCounts - Cache the backedge-taken count of the loops for
415 /// rounding up, to get the number of times the backedge is executed. Return
431 /// ComputeExitLimit - Compute the number of times the backedge of the
435 /// ComputeExitLimitFromCond - Compute the number of times the backedge of
443 /// ComputeExitLimitFromICmp - Compute the number of times the backedge of
453 /// backedge-taken count
[all...] |
| /external/swiftshader/third_party/LLVM/test/Analysis/ScalarEvolution/ |
| 2008-11-18-Stride1.ll | 2 ; RUN: | grep {Loop %bb: Unpredictable backedge-taken count\\.}
|
| 2008-12-08-FiniteSGE.ll | 1 ; RUN: opt < %s -analyze -scalar-evolution | grep {backedge-taken count is 255}
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/Thumb2/ |
| 2009-08-01-WrongLDRBOpc.ll | 28 bb.i: ; preds = %bb4.backedge.i, %bb.i.preheader
29 br i1 undef, label %bb3.i, label %bb4.backedge.i
80 bb4.backedge.i: ; preds = %bb.i
83 tbl.exit: ; preds = %bb4.backedge.i, %bb4.preheader.i
|
| /external/v8/src/compiler/ |
| bytecode-loop-analysis.h | 52 // Map from the offset of a backedge jump to the offset of the corresponding
|
| control-equivalence.cc | 83 TRACE("CEQ: Backedge from #%d:%s to #%d:%s\n", from->id(),
86 // Push backedge onto the bracket list [line:25].
111 // Found backedge if input is on stack.
141 // Found backedge if use is on stack.
|
| /external/llvm/test/CodeGen/Generic/ |
| 2006-09-06-SwitchLowering.ll | 46 i32 103, label %bb874.i.backedge
47 i32 114, label %bb874.i.backedge
50 bb874.i.backedge: ; preds = %bb874.i, %bb874.i
|
| /external/llvm/test/CodeGen/X86/ |
| 2010-01-11-ExtraPHIArg.ll | 49 i32 103, label %bb874.i.backedge
50 i32 114, label %bb874.i.backedge
53 bb874.i.backedge: ; preds = %bb874.i, %bb874.i
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/Generic/ |
| 2006-09-06-SwitchLowering.ll | 46 i32 103, label %bb874.i.backedge
47 i32 114, label %bb874.i.backedge
50 bb874.i.backedge: ; preds = %bb874.i, %bb874.i
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/X86/ |
| 2010-01-11-ExtraPHIArg.ll | 49 i32 103, label %bb874.i.backedge
50 i32 114, label %bb874.i.backedge
53 bb874.i.backedge: ; preds = %bb874.i, %bb874.i
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 24 // This pass also guarantees that loops will have exactly one backedge.
241 // common backedge instead.
526 /// loop. PHI nodes with unchanging values on one backedge correspond to values
627 /// has more than one backedge in it. If this occurs, revector all of these
629 /// header. This ensures that loops have exactly one backedge.
633 assert(L->getNumBackEdges() > 1 && "Must have > 1 backedge!");
639 // Unique backedge insertion currently depends on having a preheader.
655 // Create and insert the new backedge block...
657 Header->getName()+".backedge", F);
660 DEBUG(dbgs() << "LoopSimplify: Inserting unique backedge block
[all...] |
| /external/llvm/test/Transforms/GVN/ |
| crash.ll | 19 while.body: ; preds = %while.body.backedge, %while.body.preheader
20 %o.addr.0 = phi i32* [ undef, %while.body.preheader ], [ %o.addr.0.be, %while.body.backedge ] ; <i32*> [#uses=2]
42 br label %while.body.backedge
48 br label %while.body.backedge
50 while.body.backedge: ; preds = %if.then62, %if.then50
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 113 BasicBlock *Incoming = nullptr, *Backedge = nullptr;
116 "Loop must have at least one backedge!");
117 Backedge = *PI++;
123 if (contains(Backedge))
125 std::swap(Incoming, Backedge);
126 } else if (!contains(Backedge))
136 dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))
186 // Normal-form loops have a preheader, a single backedge, and all of their
411 // Flag the presence of an irreducible backedge whose destination is a block
551 // irreducible backedge
[all...] |
| /external/llvm/test/Transforms/RewriteStatepointsForGC/ |
| relocation.ll | 47 loop: ; preds = %loop.backedge, %entry
49 ; CHECK-DAG: [ %obj_init.relocated.casted, %loop.backedge ]
51 ; CHECK-DAG: [ %obj.relocated.casted, %loop.backedge ]
54 %index = phi i32 [ 0, %entry ], [ %index.inc, %loop.backedge ]
62 br label %loop.backedge
64 loop.backedge: ; preds = %loop_y, %loop_x
69 br label %loop.backedge
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| LoopInfo.cpp | 135 BasicBlock *Incoming = 0, *Backedge = 0;
138 "Loop must have at least one backedge!");
139 Backedge = *PI++;
145 if (contains(Backedge))
147 std::swap(Incoming, Backedge);
148 } else if (!contains(Backedge))
158 dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))
169 /// times the loop will be executed. Note that this means that the backedge
295 // Normal-form loops have a preheader, a single backedge, and all of their
408 // Flag the presence of an irreducible backedge whose destination is a bloc
[all...] |
