| /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/llvm-project/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-project/llvm/test/Transforms/IRCE/ |
| D | wide_indvar.ll | 11 ; CHECK: br i1 true, label %backedge, label %check_failed
17 %iv = phi i64 [ 0, %entry ], [ %iv.next, %backedge ]
19 br i1 %rc, label %backedge, label %check_failed
21 backedge:
40 ; CHECK: br i1 true, label %backedge, label %check_failed
41 ; CHECK: backedge
50 %iv = phi i64 [ 0, %entry ], [ %iv.next, %backedge ]
52 br i1 %rc, label %backedge, label %check_failed
54 backedge:
73 ; CHECK: br i1 true, label %backedge, label %check_failed
[all …]
|
| /external/llvm-project/llvm/test/Analysis/ScalarEvolution/ |
| D | trip-count-andor.ll | 11 ; CHECK-NEXT: Loop %loop: backedge-taken count is %n
12 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
13 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
34 ; CHECK-NEXT: Loop %loop: backedge-taken count is %n
35 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
36 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
57 ; CHECK-NEXT: Loop %loop: backedge-taken count is false
58 ; CHECK-NEXT: Loop %loop: max backedge-taken count is false
59 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
80 ; CHECK-NEXT: Loop %loop: backedge-taken count is false
[all …]
|
| D | trip-count9.ll | 16 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + %n)
17 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 6
18 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %n)
37 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
38 ; CHECK-NEXT: Loop %loop: Unpredictable max backedge-taken count.
39 ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
56 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-2 + (2 smax %n))<nsw>
57 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 5
58 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax %n))<nsw>
77 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
[all …]
|
| D | pr48225.ll | 10 ; - Therefore, their AND is false on first two iterations, and the backedge is taken twice.
11 ; 'max backedge-taken count is 1' is a bug caused by wrong treatment of AND
18 ; CHECK-NEXT: %iv = phi i32 [ 0, %entry ], [ %inc, %backedge ]
25 ; CHECK-NEXT: Loop %loop: <multiple exits> Unpredictable backedge-taken count.
27 ; CHECK-NEXT: exit count for backedge: ***COULDNOTCOMPUTE***
28 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
29 ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
36 %iv = phi i32 [ 0, %entry ], [ %inc, %backedge ]
38 br i1 %cmp, label %backedge, label %for.end
40 backedge:
[all …]
|
| D | exact_iter_count.ll | 4 ; One side exit dominating the latch, exact backedge taken count is known.
8 ; CHECK-NEXT: Loop %loop: <multiple exits> backedge-taken count is 50
14 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
16 br i1 %side.cond, label %backedge, label %side.exit
18 backedge:
33 ; CHECK-NEXT: Loop %loop: <multiple exits> backedge-taken count is 50
39 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
50 br i1 %side.cond, label %backedge, label %side.exit
52 backedge:
|
| D | trip-count10.ll | 10 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
11 ; CHECK-NEXT: Loop %loop: Unpredictable max backedge-taken count.
12 ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
30 ; CHECK-NEXT: Loop %loop: backedge-taken count is false
31 ; CHECK-NEXT: Loop %loop: max backedge-taken count is false
32 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
52 ; CHECK-NEXT: Loop %loop: backedge-taken count is false
53 ; CHECK-NEXT: Loop %loop: max backedge-taken count is false
54 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
74 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
[all …]
|
| D | trip-count13.ll | 5 ; E.g.: %rhs = 255, %start = 99, backedge taken 156 times
17 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) umax %rhs))
18 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -100, actual taken count either this or zero.
26 ; E.g.: %start = 99, %rhs = 255, backedge taken 156 times
37 ; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 * %start) + ((-100 + %start) umax %start))
38 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -100, actual taken count either this or zero.
46 ; E.g.: %rhs = 127, %start = -29, backedge taken 156 times
57 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) smax %rhs))
58 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -100, actual taken count either this or zero.
66 ; E.g.: start = -29, %rhs = 127, %backedge taken 156 times
[all …]
|
| D | max-backedge-taken-count-limit-by-wrapping.ll | 9 ; CHECK-NEXT: Loop %loop: backedge-taken count is (%N /u 4)
10 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 63
11 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%N /u 4)
30 ; CHECK-NEXT: Loop %loop: backedge-taken count is (%N /u 4)
31 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 63
32 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%N /u 4)
51 ; CHECK-NEXT: Loop %loop: backedge-taken count is ((-64 + %N) /u 4)
52 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 63
53 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-64 + %N) /u 4)
72 ; CHECK-NEXT: Loop %loop: backedge-taken count is ((-64 + %N) /u 4)
[all …]
|
| D | trip-count-pow2.ll | 17 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (96 * %n)) /u 32)
18 ; CHECK: Loop %loop: max backedge-taken count is 134217727
35 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (32 * (%n /u 32))<nuw>) /u 32)
36 ; CHECK: Loop %loop: max backedge-taken count is 134217727
52 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (32 * %n)) /u 32)
53 ; CHECK: Loop %loop: max backedge-taken count is 134217727
69 ; CHECK: Loop %loop: backedge-taken count is ((-4 + (-1431655764 * %n)) /u 4)
70 ; CHECK: Loop %loop: max backedge-taken count is 1073741823
86 ; CHECK: Loop %loop: backedge-taken count is ((-4 + (4 * %n)) /u 4)
87 ; CHECK: Loop %loop: max backedge-taken count is 1073741823
|
| D | no-wrap-symbolic-becount.ll | 10 ; CHECK-NEXT: %indvars.iv = phi i64 [ %indvars.iv.next, %backedge ], [ %0, %entry ]
12 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %backedge ]
27 ; CHECK-NEXT: Loop %loop: <multiple exits> Unpredictable backedge-taken count.
29 ; CHECK-NEXT: exit count for backedge: ***COULDNOTCOMPUTE***
30 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 4294967295
31 ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
37 loop: ; preds = %backedge, %entry
38 %indvars.iv = phi i64 [ %indvars.iv.next, %backedge ], [ %0, %entry ]
39 %iv = phi i32 [ %start, %entry ], [ %iv.next, %backedge ]
41 br i1 %cond, label %exit, label %backedge
[all …]
|
| /external/llvm-project/llvm/test/DebugInfo/MIR/X86/ |
| D | mlicm-sink.mir | 18 br label %.backedge
20 .backedge: ; preds = %.backedge.backedge, %0
21 %lsr.iv = phi i8* [ %scevgep1, %.backedge.backedge ], [ %scevgep, %0 ]
23 switch i8 %6, label %.backedge.backedge [
32 7: ; preds = %.backedge
35 br label %.backedge.backedge
37 9: ; preds = %.backedge
39 br label %.backedge.backedge
41 .backedge.backedge: ; preds = %13, %12, %11, %10, %9, %7, %.backedge
43 br label %.backedge
[all …]
|
| /external/llvm-project/llvm/test/Analysis/MustExecute/ |
| D | infinite_loops.ll | 5 ; Make sure that the backedge is mustexec.
17 ; CHECK: backedge:
25 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
26 br i1 %cond, label %maybe_taken, label %backedge
30 br label %backedge
32 backedge:
37 ; Unlike the test before, we can say that backedge is mustexec, which is the
49 ; CHECK: backedge:
59 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
60 br i1 %cond, label %maybe_taken, label %backedge
[all …]
|
| /external/llvm-project/llvm/test/Transforms/LoopSimplify/ |
| D | preserve-scev.ll | 16 ; CHECK: Loop %for.body18: Unpredictable backedge-taken count.
17 ; CHECK: Loop %for.body18: max backedge-taken count is 2147483646
18 ; CHECK: Loop %for.body18: Unpredictable predicated backedge-taken count.
19 ; CHECK: Loop %for.cond: <multiple exits> Unpredictable backedge-taken count.
20 ; CHECK: Loop %for.cond: Unpredictable max backedge-taken count.
21 ; CHECK: Loop %for.cond: Unpredictable predicated backedge-taken count.
28 ; CHECK: Loop %for.body18: Unpredictable backedge-taken count.
29 ; CHECK: Loop %for.body18: max backedge-taken count is 2147483646
30 ; CHECK: Loop %for.body18: Unpredictable predicated backedge-taken count.
31 ; CHECK: Loop %for.cond: <multiple exits> Unpredictable backedge-taken count.
[all …]
|
| /external/llvm-project/llvm/test/Analysis/LazyValueAnalysis/ |
| D | lvi-after-jumpthreading.ll | 7 ; loop and backedge basic blocks are merged into one.
8 ; basic block (named backedge) with the branch being:
10 ; br i1 %cont, label %backedge, label %exit
19 ; CHECK-LABEL: backedge:
22 … LatticeVal for: ' %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]' in BB: '%backedge' is: c…
23 ; CHECK-NEXT: ; LatticeVal for: ' %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]' in BB:…
24 ; CHECK-NEXT: %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
25 ; CHECK-NEXT: ; LatticeVal for: ' %iv.next = add nsw i32 %iv, 1' in BB: '%backedge' is: consta…
28 ; CHECK-NEXT: ; LatticeVal for: ' %cont = icmp slt i32 %iv.next, 400' in BB: '%backedge' is: o…
33 %iv = phi i32 [0, %entry], [%iv.next, %backedge]
[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 …]
|
| /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/llvm-project/llvm/test/Transforms/IndVarSimplify/ |
| D | monotonic_checks.ll | 16 ; CHECK: backedge:
29 %iv = phi i32 [%len, %entry], [%iv.next, %backedge]
32 br i1 %rc, label %backedge, label %fail
34 backedge:
56 ; CHECK: backedge:
69 %iv = phi i32 [%len, %entry], [%iv.next, %backedge]
72 br i1 %rc, label %backedge, label %fail
74 backedge:
96 ; CHECK: backedge:
109 %iv = phi i32 [%len, %entry], [%iv.next, %backedge]
[all …]
|
| /external/llvm-project/llvm/test/Transforms/LICM/ |
| D | infinite_loops.ll | 17 ; CHECK: backedge:
27 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
28 br i1 false, label %never_taken, label %backedge
33 br i1 true, label %backedge, label %exit
35 backedge:
65 ; CHECK: backedge:
75 %iv = phi i32 [ 0, %entry ], [ %iv.next, %backedge ]
77 br i1 false, label %never_taken, label %backedge
82 br i1 true, label %backedge, label %exit
84 backedge:
[all …]
|
| /external/llvm-project/llvm/test/Transforms/LoopUnswitch/ |
| D | preserve-analyses.ll | 25 switch i32 %ineq.0.ph, label %bb8.backedge [
30 bb8.backedge: ; preds = %bb6, %bb5, %bb2
38 br i1 %6, label %bb6, label %bb8.backedge
42 br i1 %5, label %bb7, label %bb8.backedge
46 br label %bb8.outer.backedge
48 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7
55 br label %bb8.outer.backedge
57 bb8.outer: ; preds = %bb8.outer.backedge, %entry
58 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3]
59 %p_addr.0.ph = phi i8* [ %p, %entry ], [ %.lcssa2, %bb8.outer.backedge ] ; <i8*> [#uses=1]
[all …]
|
| /external/llvm-project/llvm/test/Transforms/SimpleLoopUnswitch/ |
| D | preserve-analyses.ll | 25 switch i32 %ineq.0.ph, label %bb8.backedge [
30 bb8.backedge: ; preds = %bb6, %bb5, %bb2
38 br i1 %6, label %bb6, label %bb8.backedge
42 br i1 %5, label %bb7, label %bb8.backedge
46 br label %bb8.outer.backedge
48 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7
55 br label %bb8.outer.backedge
57 bb8.outer: ; preds = %bb8.outer.backedge, %entry
58 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3]
59 %p_addr.0.ph = phi i8* [ %p, %entry ], [ %.lcssa2, %bb8.outer.backedge ] ; <i8*> [#uses=1]
[all …]
|
| /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/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 …]
|