Lines Matching refs: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: max backedge-taken count is 2147483647
24 ; CHECK-NEXT: Loop %inner: Unpredictable predicated backedge-taken count.
26 ; CHECK-NEXT: exit count for inner: ***COULDNOTCOMPUTE***
37 br label %inner
39 inner:
40 %iv = phi i32 [0, %outer], [%iv.next, %inner.backedge]
42 br i1 %signed_cond, label %inner.backedge, label %side.exit
44 inner.backedge:
46 %inner.loop.cond = call i1 @cond()
47 br i1 %inner.loop.cond, label %inner, label %outer.backedge
68 …U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer: Variant, %inner: Invariant }
69 ; CHECK-NEXT: %iv = phi i32 [ %outer.iv, %outer ], [ %iv.next, %inner.backedge ]
70 …XT: --> {%outer.iv,+,1}<nuw><nsw><%inner> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
72 …XT: --> {(1 + %outer.iv),+,1}<nw><%inner> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
73 ; CHECK-NEXT: %inner.loop.cond = call i1 @cond()
74 ; CHECK-NEXT: --> %inner.loop.cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: …
76 …U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer: Variant, %inner: Invariant }
78 ; CHECK-NEXT: Loop %inner: <multiple exits> Unpredictable backedge-taken count.
79 ; CHECK-NEXT: exit count for inner: ((-1 * %outer.iv) + (%b smax %outer.iv))
80 ; CHECK-NEXT: exit count for inner.backedge: ***COULDNOTCOMPUTE***
81 ; CHECK-NEXT: Loop %inner: max backedge-taken count is -1
82 ; CHECK-NEXT: Loop %inner: Unpredictable predicated backedge-taken count.
84 ; CHECK-NEXT: exit count for inner: ***COULDNOTCOMPUTE***
95 br label %inner
97 inner:
98 %iv = phi i32 [%outer.iv, %outer], [%iv.next, %inner.backedge]
100 br i1 %signed_cond, label %inner.backedge, label %side.exit
102 inner.backedge:
104 %inner.loop.cond = call i1 @cond()
105 br i1 %inner.loop.cond, label %inner, label %outer.backedge