| /llvm-project/llvm/test/Transforms/LoopDeletion/ |
| H A D | loops-with-irreducible-subloops.ll | 6 ; loop1 contains an irreducible cycle, which may loop infinitely. Do not remove
12 ; CHECK: loop1:
14 ; CHECK: loop1.bb1:
20 ; CHECK: loop1.latch:
26 br label %loop1
28 loop1:
29 br i1 %c1, label %loop1.bb1, label %irr.bb1
31 loop1.bb1:
35 br i1 %c2, label %loop1.latch, label %irr.bb2
38 br i1 %c3, label %loop1.latch, label %irr.bb1
[all …]
|
| H A D | noop-loops-with-subloops.ll | 162 ; CHECK: loop1:
168 ; CHECK: loop1.latch.loopexit:
170 ; CHECK: loop1.latch:
175 br label %loop1
177 loop1:
178 br i1 %c1, label %loop1.latch, label %loop2
181 br i1 %c2, label %loop1.latch, label %loop2
183 loop1.latch:
184 br i1 false, label %loop1, label %exit
198 br label %loop1
[all …]
|
| /llvm-project/llvm/test/Analysis/ScalarEvolution/ |
| H A D | different-loops-recs.ll | 13 ; CHECK-NEXT: %phi1 = phi i32 [ 10, %entry ], [ %phi1.inc, %loop1 ]
14 ; CHECK-NEXT: --> {10,+,1}<nuw><nsw><%loop1> U: [10,175) S: [10,175) Exits: 174 LoopDispositions: { %loop1: Computable }
15 ; CHECK-NEXT: %phi2 = phi i32 [ 4, %entry ], [ %phi2.inc, %loop1 ]
16 ; CHECK-NEXT: --> {4,+,2}<nuw><nsw><%loop1> U: [4,333) S: [4,333) Exits: 332 LoopDispositions: { %loop1: Computable }
17 ; CHECK-NEXT: %phi3 = phi i32 [ 6, %entry ], [ %phi3.inc, %loop1 ]
18 ; CHECK-NEXT: --> {6,+,3}<nuw><nsw><%loop1> U: [6,499) S: [6,499) Exits: 498 LoopDispositions: { %loop1: Computable }
20 ; CHECK-NEXT: --> {11,+,1}<nuw><nsw><%loop1>
[all...] |
| H A D | values-at-scopes-consistency.ll | 9 br label %loop1
11 loop1:
15 %i = phi i64 [ 0, %loop1 ], [ %i.next, %loop2.latch ]
23 br i1 false, label %loop2, label %loop1.latch
25 loop1.latch:
26 br label %loop1
|
| /llvm-project/llvm/test/CodeGen/X86/ |
| H A D | misched-fusion.ll | 13 %var = phi ptr [ null, %entry ], [ %next.load, %loop1 ], [ %var, %loop2 ]
14 %next.ptr = phi ptr [ null, %entry ], [ %next.ptr, %loop1 ], [ %gep, %loop2 ]
15 br label %loop1
17 loop1:
22 loop2: ; preds = %loop1
30 ; CHECK: %loop1
38 %var = phi i32 [ 0, %entry ], [ %next.var, %loop1 ], [ %var2, %loop2 ]
39 %next.ptr = phi ptr [ null, %entry ], [ %next.ptr, %loop1 ], [ %gep, %loop2 ]
40 br label %loop1
42 loop1:
[all …]
|
| /llvm-project/llvm/test/Transforms/LoopVectorize/ |
| H A D | vector-no-scevcheck.ll | 12 br label %loop1.header
14 loop1.header: ; preds = %loop1.latch, %entry
15 %i = phi i64 [ %i.next, %loop1.latch ], [ 0, %entry ]
21 loop2.header: ; preds = %loop1.header, %loop2.header
22 %j = phi i64 [ 0, %loop1.header ], [ %j.next, %loop2.header ]
32 br i1 %cmp, label %loop2.header, label %loop1.latch
34 loop1.latch: ; preds = %loop2.header
37 br i1 %exitcond, label %exit, label %loop1.header
39 exit: ; preds = %loop1.latch
51 br label %loop1.header
[all …]
|
| H A D | pr30806.ll | 24 br i1 %cmp1, label %exit, label %loop1.preheader
26 ; Verify that a 'udiv' does not appear between the 'loop1.preheader' label, and
28 loop1.preheader:
29 ; CHECK-LABEL: loop1.preheader:
32 br label %loop1
34 loop1:
35 %outer_i = phi i32 [ %inc1, %loop2.exit ], [ 0, %loop1.preheader ]
61 br i1 %exitcond, label %exit, label %loop1
|
| /llvm-project/llvm/test/Transforms/IndVarSimplify/ |
| H A D | pr39673.ll | 8 ; CHECK: loop1:
27 br label %loop1
29 loop1: ; preds = %entry, %loop1
30 %k1 = phi i16 [ 180, %entry ], [ %k1.add, %loop1 ]
31 %l1 = phi i16 [ 0, %entry ], [ %l1.add, %loop1 ]
35 br i1 %cmp1, label %loop1, label %loop2.preheader
37 loop2.preheader: ; preds = %loop1
38 %k1.add.lcssa = phi i16 [ %k1.add, %loop1 ]
59 ; CHECK: loop1:
79 br label %loop1
[all …]
|
| H A D | lcssa-preservation.ll | 57 ; CHECK: loop1:
62 ; CHECK: loop1.latch:
70 br label %loop1
72 loop1:
73 %iv1 = phi i64 [ 0, %entry ], [ 1, %loop1.latch ]
77 %iv2 = phi i64 [ 0, %loop1 ], [ 1, %loop2 ]
79 br i1 true, label %loop2, label %loop1.latch
81 loop1.latch:
83 br i1 false, label %loop1, label %exit
86 %res.lcssa2 = phi i64 [ %res.lcssa, %loop1
[all...] |
| /llvm-project/llvm/test/Analysis/PhiValues/ |
| H A D | basic.ll | 165 br i1 %arg, label %loop1, label %loop2
167 loop1:
174 %phi1 = phi i32 [ 0, %entry ], [ %phi2, %loop1.then ], [ %phi3, %loop2.if ]
175 br i1 %arg, label %loop1.if, label %loop1.else
177 loop1.if:
178 br i1 %arg, label %loop1.then, label %loop2
180 loop1.else:
181 br label %loop1.then
183 loop1
[all...] |
| /llvm-project/llvm/test/Transforms/LoopUnroll/ |
| H A D | opt-levels.ll | 10 ; O3: loop1.preheader
11 ; O2-NOT: loop1.preheader
12 ; Os-NOT: loop1.preheader
13 ; Oz-NOT: loop1.preheader
17 br label %loop1
19 loop1:
20 %iv1 = phi i32 [ 0, %entry ], [ %inc1, %loop1.latch ]
38 br label %loop1.latch
40 loop1.latch:
43 br i1 %exitcnd1, label %exit, label %loop1
|
| H A D | gh-issue77118-broken-lcssa-form.ll | 14 ; CHECK-NEXT: Loop Unroll: F[test] Loop %loop1
16 ; CHECK-NEXT: PEELING loop %loop1 with iteration count 2!
18 br label %loop1
20 loop1:
21 %phi = phi i32 [ 1, %entry ], [ 0, %loop1.latch ]
25 %phi3 = phi i64 [ 0, %loop1 ], [ %sext, %loop2.latch ]
48 br i1 false, label %loop1.latch, label %loop4
50 loop1.latch:
51 br label %loop1
|
| H A D | runtime-loop4.ll | 9 ; EPILOG: loop1:
16 ; PROLOG: loop1:
22 br label %loop1
24 loop1:
25 %iv1 = phi i32 [ 0, %entry ], [ %inc1, %loop1.latch ]
43 br label %loop1.latch
45 loop1.latch:
48 br i1 %exitcnd1, label %exit, label %loop1
|
| H A D | scev-invalidation-lcssa.ll | 9 ; CHECK: loop1.peel.begin:
11 ; CHECK: loop1.peel:
14 ; CHECK: loop1.peel.next:
16 ; CHECK: loop1.peel.next1:
20 ; CHECK: loop1:
67 br label %loop1
69 loop1:
71 br i1 %cond1, label %loop1, label %exit1, !prof !1
|
| /llvm-project/llvm/test/Transforms/LoopInterchange/ |
| H A D | pr56275.ll | 25 ; CHECK: loop1.header.preheader:
27 ; CHECK: loop1.header:
55 ; CHECK: loop1.latch:
63 br label %loop1.header
65 loop1.header:
66 %i2 = phi i64 [ 1, %entry ], [ %i2.inc, %loop1.latch ]
72 %i1 = phi i64 [ 1, %loop1.header ], [ %i1.inc, %loop2.header ]
85 br i1 %loop2.exitcond.not, label %loop1.latch, label %loop2.header
87 loop1.latch:
89 %loop1.exitcond.not = icmp eq i64 %i2.inc, 63
[all …]
|
| /llvm-project/llvm/test/Transforms/LoopVectorize/X86/ |
| H A D | pr54413-select-interleave-count-loop-with-cost-zero.ll | 13 ; CHECK: loop1:
23 ; CHECK: loop1.latch:
27 br label %loop1
29 loop1:
30 br i1 true, label %loop1.latch, label %loop2.preheader
45 br label %loop1.latch
47 loop1.latch:
48 br label %loop1
|
| /llvm-project/llvm/test/Transforms/LoopUnroll/AArch64/ |
| H A D | partial.ll | 24 br label %loop1
26 loop1:
27 %iv1 = phi i32 [ 0, %entry ], [ %inc1, %loop1.latch ]
40 br label %loop1.latch
42 loop1.latch:
45 br i1 %exitcnd2, label %exit, label %loop1
|
| /llvm-project/llvm/test/Transforms/IndVarSimplify/X86/ |
| H A D | pr35406.ll | 10 ; CHECK: loop1:
32 br label %loop1
34 loop1: ; preds = %loop2.exit, %entry
42 general_case24: ; preds = %loop1
63 br i1 %i10, label %exit, label %loop1
65 exit: ; preds = %loop2.exit, %loop1
73 ; CHECK: loop1:
95 br label %loop1
97 loop1: ; preds = %loop2.exit, %entry
105 general_case24: ; preds = %loop1
[all …]
|
| /llvm-project/llvm/test/Transforms/LoopSimplify/ |
| H A D | pr28272.ll | 16 br label %loop1
18 loop1:
19 br i1 true, label %loop1, label %bb43
22 %a = phi i32 [ undef, %loop1 ], [ 0, %bb45 ], [ %a, %bb54 ]
23 %b = phi i32 [ 0, %loop1 ], [ 1, %bb54 ], [ %c, %bb45 ]
48 br label %loop1
50 loop1:
51 br i1 true, label %loop1, label %loop2.preheader
54 %a.ph = phi i32 [ undef, %loop1 ]
55 %b.ph = phi i32 [ 0, %loop1 ]
[all...] |
| /llvm-project/llvm/test/Transforms/LoopStrengthReduce/ |
| H A D | hoist-parent-preheader.ll | 6 br i1 %arg, label %loop1, label %return
8 loop1: ; preds = %bb13.loopexit, %entry
14 loop2: ; preds = %loop1, %loop2.backedge
15 %indvar414 = phi i64 [ %indvar.next415, %loop2.backedge ], [ 0, %loop1 ]
28 br i1 %arg, label %loop1, label %return
|
| H A D | uglygep.ll | 79 ; CHECK: loop1:
96 ; CHECK: loop1.bb6_crit_edge:
113 br label %loop1
115 loop1: ; preds = %bb5, %bb0
120 bb2: ; preds = %loop1
125 br i1 true, label %bb6, label %loop1
127 bb6: ; preds = %bb5, %bb2, %loop1
128 %p8 = phi i32 [ %t0, %bb5 ], [ undef, %loop1 ], [ undef, %bb2 ] ; <i32> [#uses=0]
129 %p9 = phi i32 [ undef, %bb5 ], [ %i1, %loop1 ], [ %i1, %bb2 ] ; <i32> [#uses=0]
|
| /llvm-project/llvm/test/Analysis/MemorySSA/ |
| H A D | pr40749.ll | 16 br label %loop1
18 loop1:
23 %indvars.iv = phi i64 [ 0, %loop1 ], [ %indvars.iv.next, %loop6 ]
24 %phi18 = phi i32 [ %tmp0, %loop1 ], [ 0, %loop6 ]
25 %phi87 = phi i32 [ 0, %loop1 ], [ %tmp7, %loop6 ]
53 br label %loop1
|
| /llvm-project/polly/test/CodeGen/MemAccess/ |
| H A D | update_access_functions.ll | 5 ; CHECK-LABEL: polly.stmt.loop1:
26 br label %loop1
28 loop1:
29 %indvar = phi i64 [ %indvar.next, %loop1 ], [ 1, %bb3 ]
34 br i1 %cmp, label %loop1, label %loop2
37 %indvar.2 = phi i64 [ %indvar.2.next, %loop2 ], [ 1, %loop1 ]
|
| /llvm-project/llvm/test/CodeGen/AArch64/ |
| H A D | falkor-hwpf.ll | 44 br label %loop1
46 loop1:
47 %iv1 = phi i32 [ 0, %entry ], [ %inc1, %loop1.latch ]
48 %outer.sum = phi i32 [ 0, %entry ], [ %sum, %loop1.latch ]
67 br label %loop1.latch
69 loop1.latch:
72 br i1 %exitcnd2, label %exit, label %loop1
|
| /llvm-project/llvm/test/Transforms/FunctionSpecialization/ |
| H A D | recursive-penalty.ll | 17 br i1 %arg.cmp, label %loop1, label %ret.block
19 loop1:
48 br i1 %exit_cond3, label %loop2, label %loop1.end
50 loop1.end:
52 br i1 %exit_cond4, label %loop1, label %ret.block
|