Lines Matching refs:outer
9 ; CHECK-NEXT: %outer.iv = phi i32 [ 0, %entry ], [ %iv.next, %outer.backedge ]
10 ; CHECK-NEXT: --> %outer.iv U: [0,-2147483647) S: [0,-2147483647) Exits: <<Unknown>> LoopDisposi…
11 ; CHECK-NEXT: %iv = phi i32 [ 0, %outer ], [ %iv.next, %inner.backedge ]
12 …48) S: [0,-2147483648) Exits: <<Unknown>> LoopDispositions: { %inner: Computable, %outer: Variant }
14 …47) S: [1,-2147483647) Exits: <<Unknown>> LoopDispositions: { %inner: Computable, %outer: Variant }
16 …d U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner: Variant, %outer: Variant }
17 ; CHECK-NEXT: %outer.loop.cond = call i1 @cond()
18 ; CHECK-NEXT: --> %outer.loop.cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: …
25 ; CHECK-NEXT: Loop %outer: <multiple exits> Unpredictable backedge-taken count.
27 ; CHECK-NEXT: exit count for outer.backedge: ***COULDNOTCOMPUTE***
28 ; CHECK-NEXT: Loop %outer: Unpredictable max backedge-taken count.
29 ; CHECK-NEXT: Loop %outer: Unpredictable predicated backedge-taken count.
33 br i1 %b_is_non_negative, label %outer, label %failure
35 outer:
36 %outer.iv = phi i32 [0, %entry], [%iv.next, %outer.backedge]
40 %iv = phi i32 [0, %outer], [%iv.next, %inner.backedge]
47 br i1 %inner.loop.cond, label %inner, label %outer.backedge
49 outer.backedge:
50 %outer.loop.cond = call i1 @cond()
51 br i1 %outer.loop.cond, label %outer, label %exit
63 ; FIXME: both outer.iv and iv here can be proved non-negative.
67 ; CHECK-NEXT: %outer.iv = phi i32 [ 0, %entry ], [ %iv.next, %outer.backedge ]
68 ; CHECK-NEXT: --> %outer.iv U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %oute…
69 ; CHECK-NEXT: %iv = phi i32 [ %outer.iv, %outer ], [ %iv.next, %inner.backedge ]
70 …-NEXT: --> {%outer.iv,+,1}<nuw><nsw><%inner> U: full-set S: full-set Exits: <<Unknown>> LoopDis…
72 …XT: --> {(1 + %outer.iv),+,1}<nw><%inner> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
74 …d U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner: Variant, %outer: Variant }
75 ; CHECK-NEXT: %outer.loop.cond = call i1 @cond()
76 ; CHECK-NEXT: --> %outer.loop.cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: …
79 ; CHECK-NEXT: exit count for inner: ((-1 * %outer.iv) + (%b smax %outer.iv))
83 ; CHECK-NEXT: Loop %outer: <multiple exits> Unpredictable backedge-taken count.
85 ; CHECK-NEXT: exit count for outer.backedge: ***COULDNOTCOMPUTE***
86 ; CHECK-NEXT: Loop %outer: Unpredictable max backedge-taken count.
87 ; CHECK-NEXT: Loop %outer: Unpredictable predicated backedge-taken count.
91 br i1 %b_is_non_negative, label %outer, label %failure
93 outer:
94 %outer.iv = phi i32 [0, %entry], [%iv.next, %outer.backedge]
98 %iv = phi i32 [%outer.iv, %outer], [%iv.next, %inner.backedge]
105 br i1 %inner.loop.cond, label %inner, label %outer.backedge
107 outer.backedge:
108 %outer.loop.cond = call i1 @cond()
109 br i1 %outer.loop.cond, label %outer, label %exit