Lines Matching refs:bounds

4 … test_01: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
5 … test_02: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
6 … test_03: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
7 … test_04: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
8 … test_05: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
9 … test_06: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
20 ; CHECK-NEXT:     %idx = phi i32 [ %idx.next, %in.bounds ], [ 0, %loop.preheader ]
23 ; CHECK-NEXT:     br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
26 …:     %idx.postloop = phi i32 [ %idx.copy, %postloop ], [ %idx.next.postloop, %in.bounds.postloop ]
29 ; CHECK-NEXT:     br i1 %abc.postloop, label %in.bounds.postloop, label %out.of.bounds.loopexit
36   %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
39   br i1 %abc, label %in.bounds, label %out.of.bounds
41 in.bounds:
47 out.of.bounds:
67 ; CHECK-NEXT:     %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
70 ; CHECK-NEXT:     br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
73 ; CHECK-NEXT:     %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ 100, %loop.pr…
76 ; CHECK-NEXT:     br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
83   %idx = phi i32 [ 100, %entry ], [ %idx.next, %in.bounds ]
86   br i1 %abc, label %in.bounds, label %out.of.bounds
88 in.bounds:
94 out.of.bounds:
110 ; CHECK-NEXT:     %idx = phi i32 [ %idx.next, %in.bounds ], [ 0, %loop.preheader ]
113 ; CHECK-NEXT:     br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
116 …:     %idx.postloop = phi i32 [ %idx.copy, %postloop ], [ %idx.next.postloop, %in.bounds.postloop ]
119 ; CHECK-NEXT:     br i1 %abc.postloop, label %in.bounds.postloop, label %out.of.bounds.loopexit
126   %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
129   br i1 %abc, label %in.bounds, label %out.of.bounds
131 in.bounds:
137 out.of.bounds:
157 ; CHECK-NEXT:     %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
160 ; CHECK-NEXT:     br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
163 ; CHECK-NEXT:     %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ -2147483648, …
166 ; CHECK-NEXT:     br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
173   %idx = phi i32 [ 2147483648, %entry ], [ %idx.next, %in.bounds ]
176   br i1 %abc, label %in.bounds, label %out.of.bounds
178 in.bounds:
184 out.of.bounds:
203   %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
206   br i1 %abc, label %in.bounds, label %out.of.bounds
208 in.bounds:
214 out.of.bounds:
228 ; CHECK-NEXT:     %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
231 ; CHECK-NEXT:     br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
234 ; CHECK-NEXT:     %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ -1, %loop.pre…
237 ; CHECK-NEXT:     br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
244   %idx = phi i32 [ 4294967295, %entry ], [ %idx.next, %in.bounds ]
247   br i1 %abc, label %in.bounds, label %out.of.bounds
249 in.bounds:
255 out.of.bounds: