Lines Matching full:inner
10 …647) S: [0,-2147483647) Exits: <<Unknown>> LoopDispositions: { %outer: Variant, %inner: Invariant }
11 ; CHECK-NEXT: %iv = phi i32 [ 0, %outer ], [ %iv.next, %inner.backedge ]
12 …EXT: --> {0,+,1}<nuw><nsw><%inner> U: [0,-2147483648) S: [0,-2147483648) Exits: <<Unknown>> Loo…
14 …ECK-NEXT: --> {1,+,1}<nuw><%inner> U: [1,-2147483647) S: [1,-2147483647) Exits: <<Unknown>> Loo…
15 ; CHECK-NEXT: %inner.loop.cond = call i1 @cond()
16 ; CHECK-NEXT: --> %inner.loop.cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: …
18 …U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer: Variant, %inner: Invariant }
20 ; CHECK-NEXT: Loop %inner: <multiple exits> Unpredictable backedge-taken count.
21 ; CHECK-NEXT: exit count for inner: %b
22 ; CHECK-NEXT: exit count for inner.backedge: ***COULDNOTCOMPUTE***
23 ; CHECK-NEXT: Loop %inner: constant max backedge-taken count is i32 2147483647
24 ; CHECK-NEXT: Loop %inner: symbolic max backedge-taken count is %b
25 ; CHECK-NEXT: symbolic max exit count for inner: %b
26 ; CHECK-NEXT: symbolic max exit count for inner.backedge: ***COULDNOTCOMPUTE***
28 ; CHECK-NEXT: exit count for inner: ***COULDNOTCOMPUTE***
32 ; CHECK-NEXT: symbolic max exit count for inner: ***COULDNOTCOMPUTE***
41 br label %inner
43 inner:
44 %iv = phi i32 [0, %outer], [%iv.next, %inner.backedge]
46 br i1 %signed_cond, label %inner.backedge, label %side.exit
48 inner.backedge:
50 %inner.loop.cond = call i1 @cond()
51 br i1 %inner.loop.cond, label %inner, label %outer.backedge
72 …U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer: Variant, %inner: Invariant }
73 ; CHECK-NEXT: %iv = phi i32 [ %outer.iv, %outer ], [ %iv.next, %inner.backedge ]
74 …XT: --> {%outer.iv,+,1}<nuw><nsw><%inner> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
76 …XT: --> {(1 + %outer.iv),+,1}<nw><%inner> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
77 ; CHECK-NEXT: %inner.loop.cond = call i1 @cond()
78 ; CHECK-NEXT: --> %inner.loop.cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: …
80 …U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer: Variant, %inner: Invariant }
82 ; CHECK-NEXT: Loop %inner: <multiple exits> Unpredictable backedge-taken count.
83 ; CHECK-NEXT: exit count for inner: ((-1 * %outer.iv) + (%b smax %outer.iv))
84 ; CHECK-NEXT: exit count for inner.backedge: ***COULDNOTCOMPUTE***
85 ; CHECK-NEXT: Loop %inner: constant max backedge-taken count is i32 -1
86 ; CHECK-NEXT: Loop %inner: symbolic max backedge-taken count is ((-1 * %outer.iv) + (%b smax %oute…
87 ; CHECK-NEXT: symbolic max exit count for inner: ((-1 * %outer.iv) + (%b smax %outer.iv))
88 ; CHECK-NEXT: symbolic max exit count for inner.backedge: ***COULDNOTCOMPUTE***
90 ; CHECK-NEXT: exit count for inner: ***COULDNOTCOMPUTE***
94 ; CHECK-NEXT: symbolic max exit count for inner: ***COULDNOTCOMPUTE***
103 br label %inner
105 inner:
106 %iv = phi i32 [%outer.iv, %outer], [%iv.next, %inner.backedge]
108 br i1 %signed_cond, label %inner.backedge, label %side.exit
110 inner.backedge:
112 %inner.loop.cond = call i1 @cond()
113 br i1 %inner.loop.cond, label %inner, label %outer.backedge