Lines Matching refs:outer
13 ; CHECK-NEXT: %o_idx = phi i32 [ 0, %entry ], [ %o_idx.inc, %outer.be ]
14 …-NEXT: --> {0,+,1}<nuw><nsw><%outer> U: [0,-2147483648) S: [0,-2147483648) Exits: %outer_l Loop…
16 ; CHECK-NEXT: --> {1,+,1}<nuw><%outer> U: [1,0) S: [1,0) Exits: (1 + %outer_l) LoopDispositions:…
17 ; CHECK-NEXT: %i_idx = phi i32 [ 0, %outer ], [ %i_idx.inc, %inner ]
18 …83648) S: [0,-2147483648) Exits: %inner_l LoopDispositions: { %inner: Computable, %outer: Variant }
20 …> U: [1,0) S: [1,0) Exits: (1 + %inner_l) LoopDispositions: { %inner: Computable, %outer: Variant }
22 …1}<nw><%outer>,+,1}<nsw><%inner> U: full-set S: full-set Exits: {(-1 + %inner_l),+,-1}<nw><%outer>…
24 …}<nw><%outer>,+,1}<nsw><%inner>) U: [0,2) S: [0,2) Exits: (1 /u {(-1 + %inner_l),+,-1}<nw><%outer>…
30 ; CHECK-NEXT: Loop %outer: backedge-taken count is %outer_l
31 ; CHECK-NEXT: Loop %outer: constant max backedge-taken count is i32 -1
32 ; CHECK-NEXT: Loop %outer: symbolic max backedge-taken count is %outer_l
33 ; CHECK-NEXT: Loop %outer: Trip multiple is 1
36 br label %outer
38 outer:
39 %o_idx = phi i32 [ 0, %entry ], [ %o_idx.inc, %outer.be ]
42 br i1 %cond, label %inner, label %outer.be
45 %i_idx = phi i32 [ 0, %outer ], [ %i_idx.inc, %inner ]
50 br i1 %cond2, label %outer.be, label %inner
52 outer.be:
54 br i1 %cond3, label %exit, label %outer