Lines Matching refs:loop
43 ; complicated CFG. Here the FSM is represented as a nested loop, with
46 ; CHECK: < loop.3 case2 > [ 3, loop.3 ]
47 ; CHECK-NEXT: < loop.3 case2 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
48 ; CHECK-NEXT: < loop.3 case2 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 4, loop.1.backedge ]
49 ; CHECK-NEXT: < loop.3 case3 loop.2.backedge loop.2 > [ 0, loop.2.backedge ]
50 ; CHECK-NEXT: < loop.3 case3 case4 loop.2.backedge loop.2 > [ 3, loop.2.backedge ]
51 ; CHECK-NEXT: < loop.3 case3 case4 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
52 ; CHECK-NEXT: < loop.3 case3 case4 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 2, loop.1.back…
53 ; CHECK-NEXT: < loop.3 case4 loop.2.backedge loop.2 > [ 3, loop.2.backedge ]
54 ; CHECK-NEXT: < loop.3 case4 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
55 ; CHECK-NEXT: < loop.3 case4 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 2, loop.1.backedge ]
59 br label %loop.1
61 loop.1:
62 %state.1 = phi i32 [ %sel, %entry ], [ %state.1.be2, %loop.1.backedge ]
63 br label %loop.2
65 loop.2:
66 %state.2 = phi i32 [ %state.1, %loop.1 ], [ %state.2.be, %loop.2.backedge ]
67 br label %loop.3
69 loop.3:
70 %state = phi i32 [ %state.2, %loop.2 ], [ 3, %case2 ]
80 br i1 %cmp, label %loop.3, label %loop.1.backedge
83 br i1 %cmp, label %loop.2.backedge, label %case4
86 br i1 %cmp, label %loop.2.backedge, label %loop.1.backedge
88 loop.1.backedge:
91 br label %loop.1
93 loop.2.backedge:
95 br label %loop.2
116 ; defines the state for the next iteration of the loop, rather than for the
190 ; CHECK: < loop.3 case2 > [ 3, loop.3 ]
191 ; CHECK-NEXT: < loop.3 case2 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
192 ; CHECK-NEXT: < loop.3 case2 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 4, loop.1.backedge ]
193 ; CHECK-NEXT: < loop.3 case3 loop.2.backedge loop.2 > [ 0, loop.2.backedge ]
194 ; CHECK-NEXT: < loop.3 case3 case4 loop.2.backedge loop.2 > [ 3, loop.2.backedge ]
195 ; CHECK-NEXT: < loop.3 case3 case4 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
196 ; CHECK-NEXT: < loop.3 case3 case4 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 2, loop.1.back…
197 ; CHECK-NEXT: < loop.3 case4 loop.2.backedge loop.2 > [ 3, loop.2.backedge ]
198 ; CHECK-NEXT: < loop.3 case4 loop.1.backedge loop.1 loop.2 > [ 1, loop.1 ]
199 ; CHECK-NEXT: < loop.3 case4 loop.1.backedge si.unfold.false loop.1 loop.2 > [ 2, loop.1.backedge ]
202 br label %loop.1
204 loop.1:
205 %state.1 = phi i32 [ %init, %entry ], [ %state.1.be2, %loop.1.backedge ]
206 br label %loop.2
208 loop.2:
209 %state.2 = phi i32 [ %state.1, %loop.1 ], [ %state.2.be, %loop.2.backedge ]
210 br label %loop.3
212 loop.3:
213 %state = phi i32 [ %state.2, %loop.2 ], [ 3, %case2 ]
223 br i1 %cmp, label %loop.3, label %loop.1.backedge
226 br i1 %cmp, label %loop.2.backedge, label %case4
229 br i1 %cmp, label %loop.2.backedge, label %loop.1.backedge
231 loop.1.backedge:
234 br label %loop.1
236 loop.2.backedge:
238 br label %loop.2