| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
| D | sink-cheap-instructions.ll | 19 br label %.backedge
21 .backedge:
22 %.0 = phi i8* [ %input, %0 ], [ %7, %.backedge.backedge ]
25 switch i8 %8, label %.backedge.backedge [
36 br label %.backedge.backedge
40 br label %.backedge.backedge
42 .backedge.backedge:
43 br label %.backedge
47 br label %.backedge.backedge
51 br label %.backedge.backedge
[all …]
|
| /external/llvm/test/CodeGen/X86/ |
| D | sink-cheap-instructions.ll | 19 br label %.backedge
21 .backedge:
22 %.0 = phi i8* [ %input, %0 ], [ %7, %.backedge.backedge ]
25 switch i8 %8, label %.backedge.backedge [
36 br label %.backedge.backedge
40 br label %.backedge.backedge
42 .backedge.backedge:
43 br label %.backedge
47 br label %.backedge.backedge
51 br label %.backedge.backedge
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopSimplify/ |
| D | preserve-scev.ll | 15 ; CHECK: Loop %for.body18: Unpredictable backedge-taken count.
16 ; CHECK: Loop %for.body18: max backedge-taken count is 2147483646
17 ; CHECK: Loop %for.body18: Unpredictable predicated backedge-taken count.
18 ; CHECK: Loop %for.cond: <multiple exits> Unpredictable backedge-taken count.
19 ; CHECK: Loop %for.cond: Unpredictable max backedge-taken count.
20 ; CHECK: Loop %for.cond: Unpredictable predicated backedge-taken count.
27 ; CHECK: Loop %for.body18: Unpredictable backedge-taken count.
28 ; CHECK: Loop %for.body18: max backedge-taken count is 2147483646
29 ; CHECK: Loop %for.body18: Unpredictable predicated backedge-taken count.
30 ; CHECK: Loop %for.cond: <multiple exits> Unpredictable backedge-taken count.
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Analysis/LazyValueAnalysis/ |
| D | lvi-after-jumpthreading.ll | 6 ; loop and backedge basic blocks are merged into one.
7 ; basic block (named backedge) with the branch being:
9 ; br i1 %cont, label %backedge, label %exit
18 ; CHECK-LABEL: backedge:
21 … LatticeVal for: ' %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]' in BB: '%backedge' is: c…
22 ; CHECK-NEXT: ; LatticeVal for: ' %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]' in BB:…
23 ; CHECK-NEXT: %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
24 ; CHECK-NEXT: ; LatticeVal for: ' %iv.next = add nsw i32 %iv, 1' in BB: '%backedge' is: consta…
27 ; CHECK-NEXT: ; LatticeVal for: ' %cont = icmp slt i32 %iv.next, 400' in BB: '%backedge' is: o…
32 %iv = phi i32 [0, %entry], [%iv.next, %backedge]
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/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 …]
|
| D | exact_iter_count.ll | 3 ; One side exit dominating the latch, exact backedge taken count is known.
7 ; CHECK-NEXT: Loop %loop: <multiple exits> backedge-taken count is 50
13 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
15 br i1 %side.cond, label %backedge, label %side.exit
17 backedge:
32 ; CHECK-NEXT: Loop %loop: <multiple exits> backedge-taken count is 50
38 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
49 br i1 %side.cond, label %backedge, label %side.exit
51 backedge:
|
| D | trip-count13.ll | 4 ; E.g.: %rhs = 255, %start = 99, backedge taken 156 times
16 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) umax %rhs))
17 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -100, actual taken count either this or zero.
25 ; E.g.: %start = 99, %rhs = 255, backedge taken 156 times
36 ; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 * %start) + ((-100 + %start) umax %start))
37 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -100, actual taken count either this or zero.
45 ; E.g.: %rhs = 127, %start = -29, backedge taken 156 times
56 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) smax %rhs))
57 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -100, actual taken count either this or zero.
65 ; E.g.: start = -29, %rhs = 127, %backedge taken 156 times
[all …]
|
| D | trip-count-pow2.ll | 16 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (96 * %n)) /u 32)
17 ; CHECK: Loop %loop: max backedge-taken count is 134217727
34 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (32 * (%n /u 32))<nuw>) /u 32)
35 ; CHECK: Loop %loop: max backedge-taken count is 134217727
51 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (32 * %n)) /u 32)
52 ; CHECK: Loop %loop: max backedge-taken count is 134217727
68 ; CHECK: Loop %loop: backedge-taken count is ((-4 + (-1431655764 * %n)) /u 4)
69 ; CHECK: Loop %loop: max backedge-taken count is 1073741823
85 ; CHECK: Loop %loop: backedge-taken count is ((-4 + (4 * %n)) /u 4)
86 ; CHECK: Loop %loop: max backedge-taken count is 1073741823
|
| D | trip-count10.ll | 6 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
7 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
10 ; CHECK: Loop %loop: backedge-taken count is false
11 ; CHECK: Loop %loop: max backedge-taken count is false
14 ; CHECK: Loop %loop: backedge-taken count is false
15 ; CHECK: Loop %loop: max backedge-taken count is false
18 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
19 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
84 ; CHECK-NEXT: Loop %loophead: Unpredictable backedge-taken count
85 ; CHECK-NEXT: Loop %loophead: Unpredictable max backedge-taken count
[all …]
|
| /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 …]
|
| D | trip-count13.ll | 4 ; E.g.: %rhs = 255, %start = 99, backedge taken 156 times
16 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) umax %rhs))
17 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
25 ; E.g.: %start = 99, %rhs = 255, backedge taken 156 times
36 ; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 * %start) + ((-100 + %start) umax %start))
37 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
45 ; E.g.: %rhs = 127, %start = -29, backedge taken 156 times
56 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) smax %rhs))
57 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
65 ; E.g.: start = -29, %rhs = 127, %backedge taken 156 times
[all …]
|
| D | trip-count10.ll | 6 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
7 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
10 ; CHECK: Loop %loop: backedge-taken count is false
11 ; CHECK: Loop %loop: max backedge-taken count is false
14 ; CHECK: Loop %loop: backedge-taken count is false
15 ; CHECK: Loop %loop: max backedge-taken count is false
18 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
19 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
84 ; CHECK-NEXT: Loop %loophead: Unpredictable backedge-taken count
85 ; CHECK-NEXT: Loop %loophead: Unpredictable max backedge-taken count
[all …]
|
| D | predicated-trip-count.ll | 8 ; that the resulting backedge expression will be valid for:
18 ; backedge taken count is correct.
23 ; CHECK: Loop %bb3: Unpredictable backedge-taken count.
24 ; CHECK-NEXT: Loop %bb3: Unpredictable max backedge-taken count.
25 ; CHECK-NEXT: Loop %bb3: Predicated backedge-taken count is (1 + (-1 smax %M))
51 ; The predicated backedge taken count is:
57 ; The predicated backedge taken count is 0.
65 ; The predicated backedge taken count is 1 + (zext i16 %Start to i32) - %M
67 ; If %M >= MIN_INT + 1, this predicated backedge taken count would be correct (even
81 ; CHECK: Loop %bb3: Unpredictable backedge-taken count.
[all …]
|
| /external/swiftshader/third_party/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 …]
|
| D | trip-count10.ll | 6 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
7 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
10 ; CHECK: Loop %loop: backedge-taken count is false
11 ; CHECK: Loop %loop: max backedge-taken count is false
14 ; CHECK: Loop %loop: backedge-taken count is false
15 ; CHECK: Loop %loop: max backedge-taken count is false
18 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
19 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
84 ; CHECK-NEXT: Loop %loophead: Unpredictable backedge-taken count
85 ; CHECK-NEXT: Loop %loophead: Unpredictable max backedge-taken count
[all …]
|
| /external/llvm/test/Transforms/LoopUnswitch/ |
| D | preserve-analyses.ll | 24 switch i32 %ineq.0.ph, label %bb8.backedge [
29 bb8.backedge: ; preds = %bb6, %bb5, %bb2
37 br i1 %6, label %bb6, label %bb8.backedge
41 br i1 %5, label %bb7, label %bb8.backedge
45 br label %bb8.outer.backedge
47 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7
54 br label %bb8.outer.backedge
56 bb8.outer: ; preds = %bb8.outer.backedge, %entry
57 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3]
58 %p_addr.0.ph = phi i8* [ %p, %entry ], [ %.lcssa2, %bb8.outer.backedge ] ; <i8*> [#uses=1]
[all …]
|
| /external/swiftshader/third_party/LLVM/test/Transforms/LoopUnswitch/ |
| D | preserve-analyses.ll | 24 switch i32 %ineq.0.ph, label %bb8.backedge [
29 bb8.backedge: ; preds = %bb6, %bb5, %bb2
37 br i1 %6, label %bb6, label %bb8.backedge
41 br i1 %5, label %bb7, label %bb8.backedge
45 br label %bb8.outer.backedge
47 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7
54 br label %bb8.outer.backedge
56 bb8.outer: ; preds = %bb8.outer.backedge, %entry
57 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3]
58 %p_addr.0.ph = phi i8* [ %p, %entry ], [ %.lcssa2, %bb8.outer.backedge ] ; <i8*> [#uses=1]
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/SimpleLoopUnswitch/ |
| D | preserve-analyses.ll | 24 switch i32 %ineq.0.ph, label %bb8.backedge [
29 bb8.backedge: ; preds = %bb6, %bb5, %bb2
37 br i1 %6, label %bb6, label %bb8.backedge
41 br i1 %5, label %bb7, label %bb8.backedge
45 br label %bb8.outer.backedge
47 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7
54 br label %bb8.outer.backedge
56 bb8.outer: ; preds = %bb8.outer.backedge, %entry
57 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3]
58 %p_addr.0.ph = phi i8* [ %p, %entry ], [ %.lcssa2, %bb8.outer.backedge ] ; <i8*> [#uses=1]
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopUnswitch/ |
| D | preserve-analyses.ll | 24 switch i32 %ineq.0.ph, label %bb8.backedge [
29 bb8.backedge: ; preds = %bb6, %bb5, %bb2
37 br i1 %6, label %bb6, label %bb8.backedge
41 br i1 %5, label %bb7, label %bb8.backedge
45 br label %bb8.outer.backedge
47 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7
54 br label %bb8.outer.backedge
56 bb8.outer: ; preds = %bb8.outer.backedge, %entry
57 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3]
58 %p_addr.0.ph = phi i8* [ %p, %entry ], [ %.lcssa2, %bb8.outer.backedge ] ; <i8*> [#uses=1]
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/IndVarSimplify/ |
| D | loop-invariant-conditions.ll | 37 ; As long as the test dominates the backedge, we're good
44 %indvars.iv = phi i64 [ %start, %entry ], [ %indvars.iv.next, %backedge ]
47 br i1 %cmp, label %backedge, label %for.end
49 backedge:
66 %indvars.iv = phi i64 [ %start, %entry ], [ %indvars.iv.next, %backedge ]
69 br i1 %cmp, label %backedge, label %for.end
71 backedge:
88 %indvars.iv = phi i64 [ %start, %entry ], [ %indvars.iv.next, %backedge ]
91 br i1 %cmp, label %backedge, label %for.end
93 backedge:
[all …]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | loop-invariant-conditions.ll | 37 ; As long as the test dominates the backedge, we're good
44 %indvars.iv = phi i64 [ %start, %entry ], [ %indvars.iv.next, %backedge ]
47 br i1 %cmp, label %backedge, label %for.end
49 backedge:
66 %indvars.iv = phi i64 [ %start, %entry ], [ %indvars.iv.next, %backedge ]
69 br i1 %cmp, label %backedge, label %for.end
71 backedge:
88 %indvars.iv = phi i64 [ %start, %entry ], [ %indvars.iv.next, %backedge ]
91 br i1 %cmp, label %backedge, label %for.end
93 backedge:
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/JumpThreading/ |
| D | induction.ll | 6 ; CHECK: br label %backedge
10 ; CHECK-LABEL: backedge:
12 ; CHECK: br i1 %cont, label %backedge, label %exit
13 %iv = phi i32 [0, %entry], [%iv.next, %backedge]
16 br i1 %cnd, label %backedge, label %exit
18 backedge:
|
| /external/llvm/test/Transforms/JumpThreading/ |
| D | induction.ll | 6 ; CHECK: br label %backedge
10 ; CHECK-LABEL: backedge:
12 ; CHECK: br i1 %cont, label %backedge, label %exit
13 %iv = phi i32 [0, %entry], [%iv.next, %backedge]
16 br i1 %cnd, label %backedge, label %exit
18 backedge:
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/IRCE/ |
| D | non_known_positive_end.ll | 16 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
21 br i1 %rc, label %backedge, label %out_of_bounds
24 backedge:
50 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
55 br i1 %rc, label %backedge, label %out_of_bounds
58 backedge:
83 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
88 br i1 %rc, label %backedge, label %out_of_bounds
91 backedge:
116 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/GVN/PRE/ |
| D | lpre-call-wrap.ll | 3 ; Make sure the load in bb3.backedge is removed and moved into bb1 after the
31 bb: ; preds = %bb3.backedge, %bb.nph
32 %.rle = phi i32 [ %1, %bb.nph ], [ %7, %bb3.backedge ] ; <i32> [#uses=1]
37 br i1 %6, label %bb1, label %bb3.backedge
41 br label %bb3.backedge
43 bb3.backedge: ; preds = %bb, %bb1
44 ; CHECK: bb3.backedge:
51 return: ; preds = %bb3.backedge, %entry
|