Lines Matching refs:loop
11 ; CHECK: Determining loop execution counts for: @foo
12 ; CHECK: Loop %loop: backedge-taken count is (-1 + %n)
13 ; CHECK: Loop %loop: max backedge-taken count is 6
17 br i1 %s, label %loop, label %exit
18 loop:
19 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
22 br i1 %t, label %loop, label %exit
27 ; CHECK: Determining loop execution counts for: @step2
28 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
29 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
33 br i1 %s, label %loop, label %exit
34 loop:
35 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
38 br i1 %t, label %loop, label %exit
43 ; CHECK: Determining loop execution counts for: @start1
44 ; CHECK: Loop %loop: backedge-taken count is (-2 + (2 smax %n))
45 ; CHECK: Loop %loop: max backedge-taken count is 5
49 br i1 %s, label %loop, label %exit
50 loop:
51 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
54 br i1 %t, label %loop, label %exit
59 ; CHECK: Determining loop execution counts for: @start1_step2
60 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
61 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
65 br i1 %s, label %loop, label %exit
66 loop:
67 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
70 br i1 %t, label %loop, label %exit
75 ; CHECK: Determining loop execution counts for: @startx
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
81 br i1 %s, label %loop, label %exit
82 loop:
83 %i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
86 br i1 %t, label %loop, label %exit
91 ; CHECK: Determining loop execution counts for: @startx_step2
92 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
93 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
97 br i1 %s, label %loop, label %exit
98 loop:
99 %i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
102 br i1 %t, label %loop, label %exit
107 ; CHECK: Determining loop execution counts for: @nsw
108 ; CHECK: Loop %loop: backedge-taken count is (-1 + %n)
109 ; CHECK: Loop %loop: max backedge-taken count is 6
113 br i1 %s, label %loop, label %exit
114 loop:
115 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
118 br i1 %t, label %loop, label %exit
124 ; result is undefined. Therefore, after the loop's second iteration,
125 ; we are free to assume that the loop exits. This is valid because:
132 ; CHECK: Determining loop execution counts for: @nsw_step2
133 ; CHECK: Loop %loop: backedge-taken count is ((-1 + %n) /u 2)
134 ; CHECK: Loop %loop: max backedge-taken count is 2
138 br i1 %s, label %loop, label %exit
139 loop:
140 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
143 br i1 %t, label %loop, label %exit
149 ; CHECK: Determining loop execution counts for: @nsw_start1
150 ; CHECK: Loop %loop: backedge-taken count is (-2 + (2 smax %n))
151 ; CHECK: Loop %loop: max backedge-taken count is 5
155 br i1 %s, label %loop, label %exit
156 loop:
157 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
160 br i1 %t, label %loop, label %exit
165 ; CHECK: Determining loop execution counts for: @nsw_start1_step2
166 ; CHECK: Loop %loop: backedge-taken count is ((-2 + (3 smax %n)) /u 2)
167 ; CHECK: Loop %loop: max backedge-taken count is 2
171 br i1 %s, label %loop, label %exit
172 loop:
173 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
176 br i1 %t, label %loop, label %exit
181 ; CHECK: Determining loop execution counts for: @nsw_startx
182 ; CHECK: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
183 ; CHECK: Loop %loop: max backedge-taken count is -1
187 br i1 %s, label %loop, label %exit
188 loop:
189 %i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
192 br i1 %t, label %loop, label %exit
197 ; CHECK: Determining loop execution counts for: @nsw_startx_step2
198 ; CHECK: Loop %loop: backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax %n)) /u 2)
199 ; CHECK: Loop %loop: max backedge-taken count is 7
203 br i1 %s, label %loop, label %exit
204 loop:
205 %i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
208 br i1 %t, label %loop, label %exit
213 ; CHECK: Determining loop execution counts for: @even
214 ; CHECK: Loop %loop: backedge-taken count is (-1 + (2 * %n))
215 ; CHECK: Loop %loop: max backedge-taken count is 5
220 br i1 %s, label %loop, label %exit
221 loop:
222 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
225 br i1 %t, label %loop, label %exit
230 ; CHECK: Determining loop execution counts for: @even_step2
231 ; CHECK: Loop %loop: backedge-taken count is ((-1 + (2 * %n)) /u 2)
232 ; CHECK: Loop %loop: max backedge-taken count is 2
237 br i1 %s, label %loop, label %exit
238 loop:
239 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
242 br i1 %t, label %loop, label %exit
247 ; CHECK: Determining loop execution counts for: @even_start1
248 ; CHECK: Loop %loop: backedge-taken count is (-2 + (2 smax (2 * %n)))
249 ; CHECK: Loop %loop: max backedge-taken count is 4
254 br i1 %s, label %loop, label %exit
255 loop:
256 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
259 br i1 %t, label %loop, label %exit
264 ; CHECK: Determining loop execution counts for: @even_start1_step2
265 ; CHECK: Loop %loop: backedge-taken count is ((-2 + (3 smax (2 * %n))) /u 2)
266 ; CHECK: Loop %loop: max backedge-taken count is 2
271 br i1 %s, label %loop, label %exit
272 loop:
273 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
276 br i1 %t, label %loop, label %exit
281 ; CHECK: Determining loop execution counts for: @even_startx
282 ; CHECK: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
283 ; CHECK: Loop %loop: max backedge-taken count is -2
288 br i1 %s, label %loop, label %exit
289 loop:
290 %i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
293 br i1 %t, label %loop, label %exit
298 ; CHECK: Determining loop execution counts for: @even_startx_step2
299 ; CHECK: Loop %loop: backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
300 ; CHECK: Loop %loop: max backedge-taken count is 7
305 br i1 %s, label %loop, label %exit
306 loop:
307 %i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
310 br i1 %t, label %loop, label %exit
315 ; CHECK: Determining loop execution counts for: @even_nsw
316 ; CHECK: Loop %loop: backedge-taken count is (-1 + (2 * %n))
317 ; CHECK: Loop %loop: max backedge-taken count is 5
322 br i1 %s, label %loop, label %exit
323 loop:
324 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
327 br i1 %t, label %loop, label %exit
332 ; CHECK: Determining loop execution counts for: @even_nsw_step2
333 ; CHECK: Loop %loop: backedge-taken count is ((-1 + (2 * %n)) /u 2)
334 ; CHECK: Loop %loop: max backedge-taken count is 2
339 br i1 %s, label %loop, label %exit
340 loop:
341 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
344 br i1 %t, label %loop, label %exit
349 ; CHECK: Determining loop execution counts for: @even_nsw_start1
350 ; CHECK: Loop %loop: backedge-taken count is (-2 + (2 smax (2 * %n)))
351 ; CHECK: Loop %loop: max backedge-taken count is 4
356 br i1 %s, label %loop, label %exit
357 loop:
358 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
361 br i1 %t, label %loop, label %exit
366 ; CHECK: Determining loop execution counts for: @even_nsw_start1_step2
367 ; CHECK: Loop %loop: backedge-taken count is ((-2 + (3 smax (2 * %n))) /u 2)
368 ; CHECK: Loop %loop: max backedge-taken count is 2
373 br i1 %s, label %loop, label %exit
374 loop:
375 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
378 br i1 %t, label %loop, label %exit
383 ; CHECK: Determining loop execution counts for: @even_nsw_startx
384 ; CHECK: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
385 ; CHECK: Loop %loop: max backedge-taken count is -2
390 br i1 %s, label %loop, label %exit
391 loop:
392 %i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
395 br i1 %t, label %loop, label %exit
400 ; CHECK: Determining loop execution counts for: @even_nsw_startx_step2
401 ; CHECK: Loop %loop: backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
402 ; CHECK: Loop %loop: max backedge-taken count is 7
407 br i1 %s, label %loop, label %exit
408 loop:
409 %i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
412 br i1 %t, label %loop, label %exit