Lines Matching refs:loop
9 ; CHECK-NEXT: %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
10 ; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,3) S: [0,3) Exits: (2 umin %n) LoopDispositions: { %loop:…
12 ; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4) S: [1,4) Exits: (1 + (2 umin %n))<nuw><nsw> LoopDispos…
14 … umin_seq %cond_i2) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
15 ; CHECK-NEXT: Determining loop execution counts for: @logical_and_m_const
16 ; CHECK-NEXT: Loop %loop: backedge-taken count is (2 umin %n)
17 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
18 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (2 umin %n)
20 ; CHECK: Loop %loop: Trip multiple is 1
23 br label %loop
24 loop:
25 %i = phi i32 [0, %entry], [%i.next, %loop]
30 br i1 %cond, label %loop, label %exit
40 ; CHECK-NEXT: %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
41 ; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,3) S: [0,3) Exits: (2 umin %m) LoopDispositions: { %loop:…
43 ; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4) S: [1,4) Exits: (1 + (2 umin %m))<nuw><nsw> LoopDispos…
45 … umin_seq %cond_i2) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
46 ; CHECK-NEXT: Determining loop execution counts for: @logical_and_nonzero
47 ; CHECK-NEXT: Loop %loop: backedge-taken count is (2 umin %m)
48 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
49 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (2 umin %m)
51 ; CHECK: Loop %loop: Trip multiple is 1
54 br label %loop
55 loop:
56 %i = phi i32 [0, %entry], [%i.next, %loop]
61 br i1 %cond, label %loop, label %exit
72 ; CHECK-NEXT: %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
73 ; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,1) S: [0,1) Exits: 0 LoopDispositions: { %loop: Computabl…
75 ; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,2) S: [1,2) Exits: 1 LoopDispositions: { %loop: Computabl…
77 …cond_i umin_seq %cond_i2) U: full-set S: full-set Exits: false LoopDispositions: { %loop: Variant }
78 ; CHECK-NEXT: Determining loop execution counts for: @logical_and_zero
79 ; CHECK-NEXT: Loop %loop: backedge-taken count is 0
80 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 0
81 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 0
83 ; CHECK: Loop %loop: Trip multiple is 1
86 br label %loop
87 loop:
88 %i = phi i32 [0, %entry], [%i.next, %loop]
93 br i1 %cond, label %loop, label %exit
105 ; CHECK-NEXT: %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
106 ; CHECK-NEXT: --> {0,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { …
108 ; CHECK-NEXT: --> {1,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { …
110 … umin_seq %cond_i2) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
111 ; CHECK-NEXT: Determining loop execution counts for: @logical_and_inversed
112 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
113 ; CHECK-NEXT: Loop %loop: Unpredictable max backedge-taken count.
114 ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
117 br label %loop
118 loop:
119 %i = phi i32 [0, %entry], [%i.next, %loop]
124 br i1 %cond, label %exit, label %loop
134 ; CHECK-NEXT: %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
135 ; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,3) S: [0,3) Exits: (2 umin %n) LoopDispositions: { %loop:…
137 ; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4) S: [1,4) Exits: (1 + (2 umin %n))<nuw><nsw> LoopDispos…
139 …(true + %cond_i2))) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
140 ; CHECK-NEXT: Determining loop execution counts for: @logical_or_m_const
141 ; CHECK-NEXT: Loop %loop: backedge-taken count is (2 umin %n)
142 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
143 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (2 umin %n)
145 ; CHECK: Loop %loop: Trip multiple is 1
148 br label %loop
149 loop:
150 %i = phi i32 [0, %entry], [%i.next, %loop]
155 br i1 %cond, label %exit, label %loop
165 ; CHECK-NEXT: %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
166 ; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,3) S: [0,3) Exits: (2 umin %m) LoopDispositions: { %loop:…
168 ; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4) S: [1,4) Exits: (1 + (2 umin %m))<nuw><nsw> LoopDispos…
170 …(true + %cond_i2))) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
171 ; CHECK-NEXT: Determining loop execution counts for: @logical_or_nonzero
172 ; CHECK-NEXT: Loop %loop: backedge-taken count is (2 umin %m)
173 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
174 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (2 umin %m)
176 ; CHECK: Loop %loop: Trip multiple is 1
179 br label %loop
180 loop:
181 %i = phi i32 [0, %entry], [%i.next, %loop]
186 br i1 %cond, label %exit, label %loop
197 ; CHECK-NEXT: %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
198 ; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,1) S: [0,1) Exits: 0 LoopDispositions: { %loop: Computabl…
200 ; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,2) S: [1,2) Exits: 1 LoopDispositions: { %loop: Computabl…
202 …in_seq (true + %cond_i2))) U: full-set S: full-set Exits: true LoopDispositions: { %loop: Variant }
203 ; CHECK-NEXT: Determining loop execution counts for: @logical_or_zero
204 ; CHECK-NEXT: Loop %loop: backedge-taken count is 0
205 ; CHECK-NEXT: Loop %loop: max backedge-taken count is 0
206 ; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 0
208 ; CHECK: Loop %loop: Trip multiple is 1
211 br label %loop
212 loop:
213 %i = phi i32 [0, %entry], [%i.next, %loop]
218 br i1 %cond, label %exit, label %loop
230 ; CHECK-NEXT: %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
231 ; CHECK-NEXT: --> {0,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { …
233 ; CHECK-NEXT: --> {1,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { …
235 …(true + %cond_i2))) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
236 ; CHECK-NEXT: Determining loop execution counts for: @logical_or_inversed
237 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
238 ; CHECK-NEXT: Loop %loop: Unpredictable max backedge-taken count.
239 ; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
242 br label %loop
243 loop:
244 %i = phi i32 [0, %entry], [%i.next, %loop]
249 br i1 %cond, label %loop, label %exit