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>
10 … test_07: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
11 … test_08: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
12 … test_09: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
23 ; CHECK-NEXT: %idx = phi i32 [ %idx.next, %in.bounds ], [ 0, %loop.preheader ]
26 ; CHECK-NEXT: br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
29 …: %idx.postloop = phi i32 [ %idx.copy, %postloop ], [ %idx.next.postloop, %in.bounds.postloop ]
32 ; CHECK-NEXT: br i1 %abc.postloop, label %in.bounds.postloop, label %out.of.bounds.loopexit
39 %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
42 br i1 %abc, label %in.bounds, label %out.of.bounds
44 in.bounds:
50 out.of.bounds:
70 ; CHECK-NEXT: %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
73 ; CHECK-NEXT: br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
76 ; CHECK-NEXT: %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ 100, %loop.pr…
79 ; CHECK-NEXT: br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
86 %idx = phi i32 [ 100, %entry ], [ %idx.next, %in.bounds ]
89 br i1 %abc, label %in.bounds, label %out.of.bounds
91 in.bounds:
97 out.of.bounds:
113 ; CHECK-NEXT: %idx = phi i32 [ %idx.next, %in.bounds ], [ 0, %loop.preheader ]
116 ; CHECK-NEXT: br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
119 …: %idx.postloop = phi i32 [ %idx.copy, %postloop ], [ %idx.next.postloop, %in.bounds.postloop ]
122 ; CHECK-NEXT: br i1 %abc.postloop, label %in.bounds.postloop, label %out.of.bounds.loopexit
129 %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
132 br i1 %abc, label %in.bounds, label %out.of.bounds
134 in.bounds:
140 out.of.bounds:
156 ; CHECK-NEXT: %idx = phi i32 [ %idx.next, %in.bounds ], [ 0, %loop.preheader ]
159 ; CHECK-NEXT: br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
162 …: %idx.postloop = phi i32 [ %idx.copy, %postloop ], [ %idx.next.postloop, %in.bounds.postloop ]
165 ; CHECK-NEXT: br i1 %abc.postloop, label %in.bounds.postloop, label %out.of.bounds.loopexit
172 %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
175 br i1 %abc, label %in.bounds, label %out.of.bounds
177 in.bounds:
183 out.of.bounds:
202 ; CHECK-NEXT: %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
205 ; CHECK-NEXT: br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
208 ; CHECK-NEXT: %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ -2147483648, …
211 ; CHECK-NEXT: br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
218 %idx = phi i32 [ 2147483648, %entry ], [ %idx.next, %in.bounds ]
221 br i1 %abc, label %in.bounds, label %out.of.bounds
223 in.bounds:
229 out.of.bounds:
245 ; CHECK-NEXT: %idx = phi i32 [ %idx.next, %in.bounds ], [ 0, %loop.preheader ]
248 ; CHECK-NEXT: br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
251 …: %idx.postloop = phi i32 [ %idx.copy, %postloop ], [ %idx.next.postloop, %in.bounds.postloop ]
254 ; CHECK-NEXT: br i1 %abc.postloop, label %in.bounds.postloop, label %out.of.bounds.loopexit
261 %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
264 br i1 %abc, label %in.bounds, label %out.of.bounds
266 in.bounds:
272 out.of.bounds:
291 %idx = phi i32 [ 4294967295, %entry ], [ %idx.next, %in.bounds ]
294 br i1 %abc, label %in.bounds, label %out.of.bounds
296 in.bounds:
302 out.of.bounds:
321 ; CHECK-NEXT: %idx = phi i32 [ %idx.next, %in.bounds ], [ 0, %loop.preheader ]
324 ; CHECK-NEXT: br i1 true, label %in.bounds, label %out.of.bounds.loopexit1
327 …: %idx.postloop = phi i32 [ %idx.copy, %postloop ], [ %idx.next.postloop, %in.bounds.postloop ]
330 ; CHECK-NEXT: br i1 %abc.postloop, label %in.bounds.postloop, label %out.of.bounds.loopexit
337 %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
340 br i1 %abc, label %in.bounds, label %out.of.bounds
342 in.bounds:
348 out.of.bounds:
371 %idx = phi i32 [ -100, %entry ], [ %idx.next, %in.bounds ]
374 br i1 %abc, label %in.bounds, label %out.of.bounds
376 in.bounds:
382 out.of.bounds: