Lines Matching full:i
36 …n with_parent: constrained Loop at depth 2 containing: %loop.i<header><exiting>,%in.bounds.i<latch…
45 %len.i = load i32, i32* %a_len_ptr, !range !0
46 %first.itr.check.i = icmp sgt i32 %n, 0
47 br i1 %first.itr.check.i, label %loop.i, label %exit.i
49 loop.i: ; preds = %in.bounds.i, %loop
50 %idx.i = phi i32 [ 0, %loop ], [ %idx.next.i, %in.bounds.i ]
51 %idx.next.i = add i32 %idx.i, 1
52 %abc.i = icmp slt i32 %idx.i, %len.i
53 br i1 %abc.i, label %in.bounds.i, label %out.of.bounds.i, !prof !1
55 in.bounds.i: ; preds = %loop.i
56 %addr.i = getelementptr i32, i32* %arr, i32 %idx.i
57 store i32 0, i32* %addr.i
58 %next.i = icmp slt i32 %idx.next.i, %n
59 br i1 %next.i, label %loop.i, label %exit.i
61 out.of.bounds.i: ; preds = %loop.i
64 exit.i: ; preds = %in.bounds.i, %loop
67 inner_loop.exit: ; preds = %exit.i, %out.of.bounds.i
76 …grandparent: constrained Loop at depth 3 containing: %loop.i.i<header><exiting>,%in.bounds.i.i<lat…
85 br label %loop.i
87 loop.i: ; preds = %inner_loop.exit.i, %loop
88 %idx.i = phi i32 [ 0, %loop ], [ %idx.next.i, %inner_loop.exit.i ]
89 %idx.next.i = add i32 %idx.i, 1
90 %next.i = icmp ult i32 %idx.next.i, %parent.count
91 %len.i.i = load i32, i32* %a_len_ptr, !range !0
92 %first.itr.check.i.i = icmp sgt i32 %n, 0
93 br i1 %first.itr.check.i.i, label %loop.i.i, label %exit.i.i
95 loop.i.i: ; preds = %in.bounds.i.i, %loop.i
96 %idx.i.i = phi i32 [ 0, %loop.i ], [ %idx.next.i.i, %in.bounds.i.i ]
97 %idx.next.i.i = add i32 %idx.i.i, 1
98 %abc.i.i = icmp slt i32 %idx.i.i, %len.i.i
99 br i1 %abc.i.i, label %in.bounds.i.i, label %out.of.bounds.i.i, !prof !1
101 in.bounds.i.i: ; preds = %loop.i.i
102 %addr.i.i = getelementptr i32, i32* %arr, i32 %idx.i.i
103 store i32 0, i32* %addr.i.i
104 %next.i.i = icmp slt i32 %idx.next.i.i, %n
105 br i1 %next.i.i, label %loop.i.i, label %exit.i.i
107 out.of.bounds.i.i: ; preds = %loop.i.i
108 br label %inner_loop.exit.i
110 exit.i.i: ; preds = %in.bounds.i.i, %loop.i
111 br label %inner_loop.exit.i
113 inner_loop.exit.i: ; preds = %exit.i.i, %out.of.bounds.i.i
114 br i1 %next.i, label %loop.i, label %with_parent.exit
116 with_parent.exit: ; preds = %inner_loop.exit.i
125 … with_sibling: constrained Loop at depth 2 containing: %loop.i<header><exiting>,%in.bounds.i<latch…
135 %len.i = load i32, i32* %a_len_ptr, !range !0
136 %first.itr.check.i = icmp sgt i32 %n, 0
137 br i1 %first.itr.check.i, label %loop.i, label %exit.i
139 loop.i: ; preds = %in.bounds.i, %loop
140 %idx.i = phi i32 [ 0, %loop ], [ %idx.next.i, %in.bounds.i ]
141 %idx.next.i = add i32 %idx.i, 1
142 %abc.i = icmp slt i32 %idx.i, %len.i
143 br i1 %abc.i, label %in.bounds.i, label %out.of.bounds.i, !prof !1
145 in.bounds.i: ; preds = %loop.i
146 %addr.i = getelementptr i32, i32* %arr, i32 %idx.i
147 store i32 0, i32* %addr.i
148 %next.i = icmp slt i32 %idx.next.i, %n
149 br i1 %next.i, label %loop.i, label %exit.i
151 out.of.bounds.i: ; preds = %loop.i
154 exit.i: ; preds = %in.bounds.i, %loop
157 inner_loop.exit: ; preds = %exit.i, %out.of.bounds.i
189 …with_cousin: constrained Loop at depth 3 containing: %loop.i.i<header><exiting>,%in.bounds.i.i<lat…
190 …with_cousin: constrained Loop at depth 3 containing: %loop.i.i10<header><exiting>,%in.bounds.i.i13…
199 br label %loop.i
201 loop.i: ; preds = %inner_loop.exit.i, %loop
202 %idx.i = phi i32 [ 0, %loop ], [ %idx.next.i, %inner_loop.exit.i ]
203 %idx.next.i = add i32 %idx.i, 1
204 %next.i = icmp ult i32 %idx.next.i, %parent.count
205 %len.i.i = load i32, i32* %a_len_ptr, !range !0
206 %first.itr.check.i.i = icmp sgt i32 %n, 0
207 br i1 %first.itr.check.i.i, label %loop.i.i, label %exit.i.i
209 loop.i.i: ; preds = %in.bounds.i.i, %loop.i
210 %idx.i.i = phi i32 [ 0, %loop.i ], [ %idx.next.i.i, %in.bounds.i.i ]
211 %idx.next.i.i = add i32 %idx.i.i, 1
212 %abc.i.i = icmp slt i32 %idx.i.i, %len.i.i
213 br i1 %abc.i.i, label %in.bounds.i.i, label %out.of.bounds.i.i, !prof !1
215 in.bounds.i.i: ; preds = %loop.i.i
216 %addr.i.i = getelementptr i32, i32* %arr, i32 %idx.i.i
217 store i32 0, i32* %addr.i.i
218 %next.i.i = icmp slt i32 %idx.next.i.i, %n
219 br i1 %next.i.i, label %loop.i.i, label %exit.i.i
221 out.of.bounds.i.i: ; preds = %loop.i.i
222 br label %inner_loop.exit.i
224 exit.i.i: ; preds = %in.bounds.i.i, %loop.i
225 br label %inner_loop.exit.i
227 inner_loop.exit.i: ; preds = %exit.i.i, %out.of.bounds.i.i
228 br i1 %next.i, label %loop.i, label %with_parent.exit
230 with_parent.exit: ; preds = %inner_loop.exit.i
237 %len.i.i4 = load i32, i32* %a_len_ptr, !range !0
238 %first.itr.check.i.i5 = icmp sgt i32 %n, 0
239 br i1 %first.itr.check.i.i5, label %loop.i.i10, label %exit.i.i15
241 loop.i.i10: ; preds = %in.bounds.i.i13, %loop.i6
242 %idx.i.i7 = phi i32 [ 0, %loop.i6 ], [ %idx.next.i.i8, %in.bounds.i.i13 ]
243 %idx.next.i.i8 = add i32 %idx.i.i7, 1
244 %abc.i.i9 = icmp slt i32 %idx.i.i7, %len.i.i4
245 br i1 %abc.i.i9, label %in.bounds.i.i13, label %out.of.bounds.i.i14, !prof !1
247 in.bounds.i.i13: ; preds = %loop.i.i10
248 %addr.i.i11 = getelementptr i32, i32* %arr, i32 %idx.i.i7
249 store i32 0, i32* %addr.i.i11
250 %next.i.i12 = icmp slt i32 %idx.next.i.i8, %n
251 br i1 %next.i.i12, label %loop.i.i10, label %exit.i.i15
253 out.of.bounds.i.i14: ; preds = %loop.i.i10
256 exit.i.i15: ; preds = %in.bounds.i.i13, %loop.i6
259 inner_loop.exit.i16: ; preds = %exit.i.i15, %out.of.bounds.i.i14
271 …on with_uncle: constrained Loop at depth 2 containing: %loop.i<header><exiting>,%in.bounds.i<latch…
272 … with_uncle: constrained Loop at depth 3 containing: %loop.i.i<header><exiting>,%in.bounds.i.i<lat…
281 %len.i = load i32, i32* %a_len_ptr, !range !0
282 %first.itr.check.i = icmp sgt i32 %n, 0
283 br i1 %first.itr.check.i, label %loop.i, label %exit.i
285 loop.i: ; preds = %in.bounds.i, %loop
286 %idx.i = phi i32 [ 0, %loop ], [ %idx.next.i, %in.bounds.i ]
287 %idx.next.i = add i32 %idx.i, 1
288 %abc.i = icmp slt i32 %idx.i, %len.i
289 br i1 %abc.i, label %in.bounds.i, label %out.of.bounds.i, !prof !1
291 in.bounds.i: ; preds = %loop.i
292 %addr.i = getelementptr i32, i32* %arr, i32 %idx.i
293 store i32 0, i32* %addr.i
294 %next.i = icmp slt i32 %idx.next.i, %n
295 br i1 %next.i, label %loop.i, label %exit.i
297 out.of.bounds.i: ; preds = %loop.i
300 exit.i: ; preds = %in.bounds.i, %loop
303 inner_loop.exit: ; preds = %exit.i, %out.of.bounds.i
306 loop.i4: ; preds = %inner_loop.exit.i, %inner_loop.exit
307 %idx.i1 = phi i32 [ 0, %inner_loop.exit ], [ %idx.next.i2, %inner_loop.exit.i ]
310 %len.i.i = load i32, i32* %a_len_ptr, !range !0
311 %first.itr.check.i.i = icmp sgt i32 %n, 0
312 br i1 %first.itr.check.i.i, label %loop.i.i, label %exit.i.i
314 loop.i.i: ; preds = %in.bounds.i.i, %loop.i4
315 %idx.i.i = phi i32 [ 0, %loop.i4 ], [ %idx.next.i.i, %in.bounds.i.i ]
316 %idx.next.i.i = add i32 %idx.i.i, 1
317 %abc.i.i = icmp slt i32 %idx.i.i, %len.i.i
318 br i1 %abc.i.i, label %in.bounds.i.i, label %out.of.bounds.i.i, !prof !1
320 in.bounds.i.i: ; preds = %loop.i.i
321 %addr.i.i = getelementptr i32, i32* %arr, i32 %idx.i.i
322 store i32 0, i32* %addr.i.i
323 %next.i.i = icmp slt i32 %idx.next.i.i, %n
324 br i1 %next.i.i, label %loop.i.i, label %exit.i.i
326 out.of.bounds.i.i: ; preds = %loop.i.i
327 br label %inner_loop.exit.i
329 exit.i.i: ; preds = %in.bounds.i.i, %loop.i4
330 br label %inner_loop.exit.i
332 inner_loop.exit.i: ; preds = %exit.i.i, %out.of.bounds.i.i
335 with_parent.exit: ; preds = %inner_loop.exit.i