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: …
27 ; CHECK-NEXT:  Loop %outer: <multiple exits> Unpredictable backedge-taken count.
29 ; CHECK-NEXT:    exit count for outer.backedge: ***COULDNOTCOMPUTE***
30 ; CHECK-NEXT:  Loop %outer: Unpredictable constant max backedge-taken count.
31 ; CHECK-NEXT:  Loop %outer: Unpredictable symbolic max backedge-taken count.
33 ; CHECK-NEXT:    symbolic max exit count for outer.backedge: ***COULDNOTCOMPUTE***
37   br i1 %b_is_non_negative, label %outer, label %failure
39 outer:
40   %outer.iv = phi i32 [0, %entry], [%iv.next, %outer.backedge]
44   %iv = phi i32 [0, %outer], [%iv.next, %inner.backedge]
51   br i1 %inner.loop.cond, label %inner, label %outer.backedge
53 outer.backedge:
54   %outer.loop.cond = call i1 @cond()
55   br i1 %outer.loop.cond, label %outer, label %exit
67 ; FIXME: both outer.iv and iv here can be proved non-negative.
71 ; CHECK-NEXT:    %outer.iv = phi i32 [ 0, %entry ], [ %iv.next, %outer.backedge ]
72 ; CHECK-NEXT:    --> %outer.iv U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %oute…
73 ; CHECK-NEXT:    %iv = phi i32 [ %outer.iv, %outer ], [ %iv.next, %inner.backedge ]
74 …-NEXT:    --> {%outer.iv,+,1}<nuw><nsw><%inner> U: full-set S: full-set Exits: <<Unknown>> LoopDis…
76 …XT:    --> {(1 + %outer.iv),+,1}<nw><%inner> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
78 …d U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner: Variant, %outer: Variant }
79 ; CHECK-NEXT:    %outer.loop.cond = call i1 @cond()
80 ; CHECK-NEXT:    --> %outer.loop.cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: …
83 ; CHECK-NEXT:    exit count for inner: ((-1 * %outer.iv) + (%b smax %outer.iv))
86 …K-NEXT:  Loop %inner: symbolic max backedge-taken count is ((-1 * %outer.iv) + (%b smax %outer.iv))
87 ; CHECK-NEXT:    symbolic max exit count for inner: ((-1 * %outer.iv) + (%b smax %outer.iv))
89 ; CHECK-NEXT:  Loop %outer: <multiple exits> Unpredictable backedge-taken count.
91 ; CHECK-NEXT:    exit count for outer.backedge: ***COULDNOTCOMPUTE***
92 ; CHECK-NEXT:  Loop %outer: Unpredictable constant max backedge-taken count.
93 ; CHECK-NEXT:  Loop %outer: Unpredictable symbolic max backedge-taken count.
95 ; CHECK-NEXT:    symbolic max exit count for outer.backedge: ***COULDNOTCOMPUTE***
99   br i1 %b_is_non_negative, label %outer, label %failure
101 outer:
102   %outer.iv = phi i32 [0, %entry], [%iv.next, %outer.backedge]
106   %iv = phi i32 [%outer.iv, %outer], [%iv.next, %inner.backedge]
113   br i1 %inner.loop.cond, label %inner, label %outer.backedge
115 outer.backedge:
116   %outer.loop.cond = call i1 @cond()
117   br i1 %outer.loop.cond, label %outer, label %exit