Lines Matching refs:do
7 br label %do.body
9 do.body:
10 %i.0 = phi i32 [ %n, %entry ], [ %inc, %do.body ]
15 br i1 %cmp, label %do.body, label %do.end ; taken either 0 or 1 times
18 ; CHECK-NEXT: Loop %do.body: backedge-taken count is ((-1 * %n) + ((1 + %n) smax %n))
19 ; CHECK-NEXT: Loop %do.body: max backedge-taken count is 1, actual taken count either this or zero.
21 do.end:
28 br label %do.body
30 do.body:
31 %i.0 = phi i32 [ %n, %entry ], [ %inc, %do.body ]
36 br i1 %cmp, label %do.body, label %do.end ; taken either 0 or 2 times
39 ; CHECK-NEXT: Loop %do.body: backedge-taken count is ((-1 * %n) + ((2 + %n) smax %n))
40 ; CHECK-NEXT: Loop %do.body: max backedge-taken count is 2, actual taken count either this or zero.
42 do.end:
49 br label %do.body
51 do.body:
52 %i.0 = phi i32 [ %n, %entry ], [ %inc, %do.body ]
57 br i1 %cmp, label %do.body, label %do.end ; taken either 0 or x times
60 ; CHECK-NEXT: Loop %do.body: backedge-taken count is ((-1 * %n) + ((%n + %x) smax %n))
61 ; CHECK-NEXT: Loop %do.body: max backedge-taken count is -1{{$}}
63 do.end:
70 br label %do.body
72 do.body:
75 br i1 %cmp, label %do.end, label %if.end ; unpredictable
82 br i1 %cmp1, label %do.body, label %do.end ; taken either 0 or 2 times
85 ; CHECK-NEXT: Loop %do.body: <multiple exits> backedge-taken count is (((-1 * %n) + ((2 + %n) smax …
86 ; CHECK-NEXT: exit count for do.body: ((-1 * %n) + %x)
88 ; CHECK-NEXT: Loop %do.body: max backedge-taken count is 2{{$}}
90 do.end:
97 br label %do.body
99 do.body:
100 %i.0 = phi i32 [ %n, %entry ], [ %inc, %do.body ]
105 br i1 %cmp, label %do.body, label %do.end ; taken either 0 or 1 times
108 ; CHECK-NEXT: Loop %do.body: backedge-taken count is ((-1 * %n) + ((1 + %n) umax %n))
109 ; CHECK-NEXT: Loop %do.body: max backedge-taken count is 1, actual taken count either this or zero.
111 do.end:
118 br label %do.body
120 do.body:
121 %i.0 = phi i32 [ %n, %entry ], [ %inc, %do.body ]
126 br i1 %cmp, label %do.body, label %do.end ; taken either 0 or 2 times
129 ; CHECK-NEXT: Loop %do.body: backedge-taken count is ((-1 * %n) + ((2 + %n) umax %n))
130 ; CHECK-NEXT: Loop %do.body: max backedge-taken count is 2, actual taken count either this or zero.
132 do.end:
139 br label %do.body
141 do.body:
142 %i.0 = phi i32 [ %n, %entry ], [ %inc, %do.body ]
147 br i1 %cmp, label %do.body, label %do.end ; taken either 0 or x times
150 ; CHECK-NEXT: Loop %do.body: backedge-taken count is ((-1 * %n) + ((%n + %x) umax %n))
151 ; CHECK-NEXT: Loop %do.body: max backedge-taken count is -1{{$}}
153 do.end:
160 br label %do.body
162 do.body:
165 br i1 %cmp, label %do.end, label %if.end ; unpredictable
172 br i1 %cmp1, label %do.body, label %do.end ; taken either 0 or 2 times
175 ; CHECK-NEXT: Loop %do.body: <multiple exits> backedge-taken count is (((-1 * %n) + ((2 + %n) umax …
176 ; CHECK-NEXT: exit count for do.body: ((-1 * %n) + %x)
178 ; CHECK-NEXT: Loop %do.body: max backedge-taken count is 2{{$}}
180 do.end: