Lines Matching refs:loop
4 ; loops. If the trip count of the loop is computable, then we will know what
5 ; the exit value of the loop will be for some value, allowing us to substitute
6 ; it directly into users outside of the loop, making the loop dead.
13 br label %loop
15 loop: ; preds = %loop, %entry
16 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
19 br i1 %c, label %loop, label %loopexit
21 loopexit: ; preds = %loop
30 br label %loop
32 loop: ; preds = %loop, %entry
33 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
36 br i1 %c, label %loop, label %loopexit
38 loopexit: ; preds = %loop
47 br label %loop
49 loop: ; preds = %loop, %entry
50 %i = phi i32 [ 1024, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
53 br i1 %c, label %loop, label %loopexit
55 loopexit: ; preds = %loop
64 br label %loop
66 loop: ; preds = %loop, %entry
67 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
70 br i1 %c, label %loop, label %loopexit
72 loopexit: ; preds = %loop
81 br label %loop
83 loop: ; preds = %loop, %entry
84 %i = phi i32 [ 7, %entry ], [ %i.next, %loop ] ; <i32> [#uses=4]
88 br i1 %c, label %loop, label %loopexit
90 loopexit: ; preds = %loop
99 br label %loop
101 loop: ; preds = %loop, %entry
102 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
105 br i1 %c, label %loop, label %loopexit
107 loopexit: ; preds = %loop
125 br label %loop
127 loop: ; preds = %loop, %entry
128 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
131 br i1 %c, label %loop, label %loopexit
133 loopexit: ; preds = %loop
142 loopexit2: ; preds = %loop
167 ; CHECK-LABEL: loop:
174 br label %loop
176 loop: ; preds = %body, %"function top level"
181 fail: ; preds = %loop
185 body: ; preds = %loop
188 br i1 %3, label %loop, label %out