Lines Matching refs:loop
11 ; CHECK-NEXT: %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
12 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,128) S: [0,128) Exits: 127 LoopDispositions: { …
13 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
14 … --> {%start,+,%step}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((127 * %step)<nsw> + %start) Lo…
16 …tep + %start),+,%step}<nw><%loop> U: [-256,256) S: [-256,256) Exits: ((128 * %step)<nsw> + %start)…
17 ; CHECK-NEXT: %loop.iv.inc = add i32 %loop.iv, 1
18 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,129) S: [1,129) Exits: 128 LoopDispositions: { …
19 ; CHECK-NEXT: Determining loop execution counts for: @f0
20 ; CHECK-NEXT: Loop %loop: backedge-taken count is i32 127
21 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 127
22 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i32 127
23 ; CHECK-NEXT: Loop %loop: Trip multiple is 128
28 br label %loop
30 loop:
31 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
32 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
34 %loop.iv.inc = add i32 %loop.iv, 1
35 %be.cond = icmp ne i32 %loop.iv.inc, 128
36 br i1 %be.cond, label %loop, label %leave
49 ; CHECK-NEXT: %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
50 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,16) S: [0,16) Exits: 15 LoopDispositions: { %lo…
51 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
52 …: --> {%start,+,%step}<nsw><%loop> U: [0,121) S: [0,121) Exits: ((15 * %step)<nsw> + %start) Lo…
54 …art)<nuw><nsw>,+,%step}<nsw><%loop> U: [1,122) S: [1,122) Exits: (1 + (15 * %step)<nsw> + %start) …
56 …art)<nuw><nsw>,+,%step}<nsw><%loop> U: [2,123) S: [2,123) Exits: (2 + (15 * %step)<nsw> + %start) …
58 …art)<nuw><nsw>,+,%step}<nsw><%loop> U: [3,124) S: [3,124) Exits: (3 + (15 * %step)<nsw> + %start) …
60 …art)<nuw><nsw>,+,%step}<nsw><%loop> U: [4,125) S: [4,125) Exits: (4 + (15 * %step)<nsw> + %start) …
62 …art)<nuw><nsw>,+,%step}<nsw><%loop> U: [5,126) S: [5,126) Exits: (5 + (15 * %step)<nsw> + %start) …
64 …art)<nuw><nsw>,+,%step}<nsw><%loop> U: [6,127) S: [6,127) Exits: (6 + (15 * %step)<nsw> + %start) …
66 …art)<nuw><nsw>,+,%step}<nsw><%loop> U: [7,128) S: [7,128) Exits: (7 + (15 * %step)<nsw> + %start) …
68 …%start)<nsw>,+,%step}<nsw><%loop> U: [-1,120) S: [-1,120) Exits: (-1 + (15 * %step)<nsw> + %start)…
70 … %start)<nsw>,+,%step}<nsw><%loop> U: [0,-1) S: [-2,119) Exits: (-2 + (15 * %step)<nsw> + %start) …
72 …%start)<nsw>,+,%step}<nsw><%loop> U: [-3,118) S: [-3,118) Exits: (-3 + (15 * %step)<nsw> + %start)…
74 … %start)<nsw>,+,%step}<nsw><%loop> U: [0,-3) S: [-4,117) Exits: (-4 + (15 * %step)<nsw> + %start) …
76 …%start)<nsw>,+,%step}<nsw><%loop> U: [-5,116) S: [-5,116) Exits: (-5 + (15 * %step)<nsw> + %start)…
78 … %start)<nsw>,+,%step}<nsw><%loop> U: [0,-1) S: [-6,115) Exits: (-6 + (15 * %step)<nsw> + %start) …
80 …%start)<nsw>,+,%step}<nsw><%loop> U: [-7,114) S: [-7,114) Exits: (-7 + (15 * %step)<nsw> + %start)…
82 …(%step + %start),+,%step}<nw><%loop> U: [0,-7) S: [-256,361) Exits: ((16 * %step)<nsw> + %start) L…
83 ; CHECK-NEXT: %loop.iv.inc = add i32 %loop.iv, 1
84 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,17) S: [1,17) Exits: 16 LoopDispositions: { %lo…
85 ; CHECK-NEXT: Determining loop execution counts for: @f1
86 ; CHECK-NEXT: Loop %loop: backedge-taken count is i32 15
87 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 15
88 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i32 15
89 ; CHECK-NEXT: Loop %loop: Trip multiple is 16
94 br label %loop
96 loop:
97 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
98 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
119 %loop.iv.inc = add i32 %loop.iv, 1
120 %be.cond = icmp sgt i32 %loop.iv, 14
121 br i1 %be.cond, label %leave, label %loop
134 ; CHECK-NEXT: %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
135 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,128) S: [0,128) Exits: 127 LoopDispositions: { …
136 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
137 … --> {%start,+,%step}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((127 * %step)<nsw> + %start) Lo…
139 … i64)}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((zext i32 %start to i64) + (127 * (sext i32 %step…
141 …tep + %start),+,%step}<nw><%loop> U: [-256,256) S: [-256,256) Exits: ((128 * %step)<nsw> + %start)…
142 ; CHECK-NEXT: %loop.iv.inc = add i32 %loop.iv, 1
143 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,129) S: [1,129) Exits: 128 LoopDispositions: { …
144 ; CHECK-NEXT: Determining loop execution counts for: @f2
145 ; CHECK-NEXT: Loop %loop: backedge-taken count is i32 127
146 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 127
147 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i32 127
148 ; CHECK-NEXT: Loop %loop: Trip multiple is 128
153 br label %loop
155 loop:
156 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
157 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
160 %loop.iv.inc = add i32 %loop.iv, 1
161 %be.cond = icmp ne i32 %loop.iv.inc, 128
162 br i1 %be.cond, label %loop, label %leave
175 ; CHECK-NEXT: %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
176 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,128) S: [0,128) Exits: 127 LoopDispositions: { …
177 ; CHECK-NEXT: %iv = phi i16 [ %start, %entry ], [ %iv.next, %loop ]
178 … --> {%start,+,%step}<nuw><%loop> U: [0,-892) S: [0,-892) Exits: ((127 * %step)<nuw> + %start) L…
180 …)}<nuw><%loop> U: [0,64644) S: [0,64644) Exits: ((zext i16 %start to i64) + (127 * (zext i16 %step…
182 …%step + %start),+,%step}<nw><%loop> U: full-set S: full-set Exits: ((128 * %step)<nuw> + %start) L…
183 ; CHECK-NEXT: %loop.iv.inc = add i16 %loop.iv, 1
184 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,129) S: [1,129) Exits: 128 LoopDispositions: { …
185 ; CHECK-NEXT: Determining loop execution counts for: @f3
186 ; CHECK-NEXT: Loop %loop: backedge-taken count is i16 127
187 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i16 127
188 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i16 127
189 ; CHECK-NEXT: Loop %loop: Trip multiple is 128
201 br label %loop
203 loop:
204 %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
205 %iv = phi i16 [ %start, %entry ], [ %iv.next, %loop ]
208 %loop.iv.inc = add i16 %loop.iv, 1
209 %be.cond = icmp ne i16 %loop.iv.inc, 128
210 br i1 %be.cond, label %loop, label %leave
223 ; CHECK-NEXT: %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
224 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,128) S: [0,128) Exits: 127 LoopDispositions: { …
225 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
226 … --> {%start,+,%step}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((127 * %step)<nsw> + %start) Lo…
228 …p to i16)}<%loop> U: [0,128) S: [0,128) Exits: ((trunc i32 %start to i16) + (127 * (trunc i32 %ste…
230 …tep + %start),+,%step}<nw><%loop> U: [-256,256) S: [-256,256) Exits: ((128 * %step)<nsw> + %start)…
231 ; CHECK-NEXT: %loop.iv.inc = add i32 %loop.iv, 1
232 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,129) S: [1,129) Exits: 128 LoopDispositions: { …
233 ; CHECK-NEXT: Determining loop execution counts for: @f4
234 ; CHECK-NEXT: Loop %loop: backedge-taken count is i32 127
235 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 127
236 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i32 127
237 ; CHECK-NEXT: Loop %loop: Trip multiple is 128
243 br label %loop
245 loop:
246 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
247 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
250 %loop.iv.inc = add i32 %loop.iv, 1
251 %be.cond = icmp ne i32 %loop.iv.inc, 128
252 br i1 %be.cond, label %loop, label %leave
265 ; CHECK-NEXT: %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
266 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,128) S: [0,128) Exits: 127 LoopDispositions: { …
267 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
268 … --> {%start,+,%step}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((127 * %step)<nsw> + %start) Lo…
270 …p to i16)}<%loop> U: [0,128) S: [0,128) Exits: ((trunc i32 %start to i16) + (127 * (trunc i32 %ste…
272 …tep + %start),+,%step}<nw><%loop> U: [-256,256) S: [-256,256) Exits: ((128 * %step)<nsw> + %start)…
273 ; CHECK-NEXT: %loop.iv.inc = add i16 %loop.iv, 1
274 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,129) S: [1,129) Exits: 128 LoopDispositions: { …
275 ; CHECK-NEXT: Determining loop execution counts for: @f5
276 ; CHECK-NEXT: Loop %loop: backedge-taken count is i16 127
277 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i16 127
278 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i16 127
279 ; CHECK-NEXT: Loop %loop: Trip multiple is 128
284 br label %loop
286 loop:
287 %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
288 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
292 %loop.iv.inc = add i16 %loop.iv, 1
293 %be.cond = icmp ne i16 %loop.iv.inc, 128
294 br i1 %be.cond, label %loop, label %leave
307 ; CHECK-NEXT: %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
308 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,128) S: [0,128) Exits: 127 LoopDispositions: { …
309 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
310 …1 + %step)<nuw><nsw>}<nsw><%loop> U: [0,128) S: [0,128) Exits: (127 + (127 * %step)<nsw> + %start)…
312 …p)<nuw><nsw> U: [1,0) S: [-1,3) Exits: (1 + %step)<nuw><nsw> LoopDispositions: { %loop: Invariant }
314 …+ %step)<nuw><nsw>}<nw><%loop> U: [-128,384) S: [-128,384) Exits: (128 + (128 * %step)<nsw> + %sta…
316 …w>}<nsw><%loop> U: [0,128) S: [0,128) Exits: (127 + (zext i32 %start to i64) + (127 * (sext i32 %s…
317 ; CHECK-NEXT: %loop.iv.inc = add i16 %loop.iv, 1
318 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,129) S: [1,129) Exits: 128 LoopDispositions: { …
319 ; CHECK-NEXT: Determining loop execution counts for: @f6
320 ; CHECK-NEXT: Loop %loop: backedge-taken count is i16 127
321 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i16 127
322 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i16 127
323 ; CHECK-NEXT: Loop %loop: Trip multiple is 128
328 br label %loop
330 loop:
331 %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
332 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
337 %loop.iv.inc = add i16 %loop.iv, 1
338 %be.cond = icmp ne i16 %loop.iv.inc, 128
339 br i1 %be.cond, label %loop, label %leave
352 ; CHECK-NEXT: %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
353 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,128) S: [0,128) Exits: 127 LoopDispositions: { …
354 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
355 … --> {%start,+,%step}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((127 * %step)<nsw> + %start) Lo…
357 …p to i16)}<%loop> U: [0,128) S: [0,128) Exits: ((trunc i32 %start to i16) + (127 * (trunc i32 %ste…
359 …tep + %start),+,%step}<nw><%loop> U: [-256,256) S: [-256,256) Exits: ((128 * %step)<nsw> + %start)…
361 …to i16)}<%loop> U: [1,129) S: [1,129) Exits: (1 + (trunc i32 %start to i16) + (127 * (trunc i32 %s…
363 …to i16)}<%loop> U: [2,130) S: [2,130) Exits: (2 + (trunc i32 %start to i16) + (127 * (trunc i32 %s…
364 ; CHECK-NEXT: %loop.iv.inc = add i16 %loop.iv, 1
365 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,129) S: [1,129) Exits: 128 LoopDispositions: { …
366 ; CHECK-NEXT: Determining loop execution counts for: @f7
367 ; CHECK-NEXT: Loop %loop: backedge-taken count is i16 127
368 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i16 127
369 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i16 127
370 ; CHECK-NEXT: Loop %loop: Trip multiple is 128
375 br label %loop
377 loop:
378 %loop.iv = phi i16 [ 0, %entry ], [ %loop.iv.inc, %loop ]
379 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
387 %loop.iv.inc = add i16 %loop.iv, 1
388 %be.cond = icmp ne i16 %loop.iv.inc, 128
389 br i1 %be.cond, label %loop, label %leave