exit:
ret void
}
+
+; FIXME: Both inner and outer loop Phis should have the same range [0, 3000).
+define void @test_02(i32* %p, i32* %q) {
+; CHECK-LABEL: 'test_02'
+; CHECK-NEXT: Classifying expressions for: @test_02
+; CHECK-NEXT: %start = load i32, i32* %p, align 4, !range !0
+; CHECK-NEXT: --> %start U: [0,1000) S: [0,1000)
+; CHECK-NEXT: %outer_phi = phi i32 [ %start, %entry ], [ %inner_lcssa, %outer_backedge ]
+; CHECK-NEXT: --> %outer_phi U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
+; CHECK-NEXT: %inner_phi = phi i32 [ %outer_phi, %outer_loop ], [ %inner_load, %inner_loop ]
+; CHECK-NEXT: --> %inner_phi U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
+; CHECK-NEXT: %inner_load = load i32, i32* %q, align 4, !range !1
+; CHECK-NEXT: --> %inner_load U: [2000,3000) S: [2000,3000) Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
+; CHECK-NEXT: %inner_cond = call i1 @cond()
+; CHECK-NEXT: --> %inner_cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
+; CHECK-NEXT: %inner_lcssa = phi i32 [ %inner_phi, %inner_loop ]
+; CHECK-NEXT: --> %inner_lcssa U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
+; CHECK-NEXT: %outer_cond = call i1 @cond()
+; CHECK-NEXT: --> %outer_cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
+; CHECK-NEXT: Determining loop execution counts for: @test_02
+; CHECK-NEXT: Loop %inner_loop: Unpredictable backedge-taken count.
+; CHECK-NEXT: Loop %inner_loop: Unpredictable max backedge-taken count.
+; CHECK-NEXT: Loop %inner_loop: Unpredictable predicated backedge-taken count.
+; CHECK-NEXT: Loop %outer_loop: Unpredictable backedge-taken count.
+; CHECK-NEXT: Loop %outer_loop: Unpredictable max backedge-taken count.
+; CHECK-NEXT: Loop %outer_loop: Unpredictable predicated backedge-taken count.
+;
+entry:
+ %start = load i32, i32* %p, !range !0
+ br label %outer_loop
+
+outer_loop:
+ %outer_phi = phi i32 [ %start, %entry], [%inner_lcssa, %outer_backedge]
+ br label %inner_loop
+
+inner_loop:
+ %inner_phi = phi i32 [%outer_phi, %outer_loop], [%inner_load, %inner_loop]
+ %inner_load = load i32, i32* %q, !range !1
+ %inner_cond = call i1 @cond()
+ br i1 %inner_cond, label %inner_loop, label %outer_backedge
+
+outer_backedge:
+ %inner_lcssa = phi i32 [%inner_phi, %inner_loop]
+ %outer_cond = call i1 @cond()
+ br i1 %outer_cond, label %outer_loop, label %exit
+
+exit:
+ ret void
+}
+
+; FIXME: All phis should have range [0, 3000)
+define void @test_03(i32* %p, i32* %q) {
+; CHECK-LABEL: 'test_03'
+; CHECK-NEXT: Classifying expressions for: @test_03
+; CHECK-NEXT: %start_1 = load i32, i32* %p, align 4, !range !0
+; CHECK-NEXT: --> %start_1 U: [0,1000) S: [0,1000)
+; CHECK-NEXT: %start_2 = load i32, i32* %q, align 4, !range !1
+; CHECK-NEXT: --> %start_2 U: [2000,3000) S: [2000,3000)
+; CHECK-NEXT: %outer_phi = phi i32 [ %start_1, %entry ], [ %inner_lcssa, %outer_backedge ]
+; CHECK-NEXT: --> %outer_phi U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
+; CHECK-NEXT: %inner_phi_1 = phi i32 [ %outer_phi, %outer_loop ], [ %inner_phi_2, %inner_loop ]
+; CHECK-NEXT: --> %inner_phi_1 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
+; CHECK-NEXT: %inner_phi_2 = phi i32 [ %start_2, %outer_loop ], [ %inner_phi_1, %inner_loop ]
+; CHECK-NEXT: --> %inner_phi_2 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
+; CHECK-NEXT: %inner_cond = call i1 @cond()
+; CHECK-NEXT: --> %inner_cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
+; CHECK-NEXT: %inner_lcssa = phi i32 [ %inner_phi_1, %inner_loop ]
+; CHECK-NEXT: --> %inner_lcssa U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
+; CHECK-NEXT: %outer_cond = call i1 @cond()
+; CHECK-NEXT: --> %outer_cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
+; CHECK-NEXT: Determining loop execution counts for: @test_03
+; CHECK-NEXT: Loop %inner_loop: Unpredictable backedge-taken count.
+; CHECK-NEXT: Loop %inner_loop: Unpredictable max backedge-taken count.
+; CHECK-NEXT: Loop %inner_loop: Unpredictable predicated backedge-taken count.
+; CHECK-NEXT: Loop %outer_loop: Unpredictable backedge-taken count.
+; CHECK-NEXT: Loop %outer_loop: Unpredictable max backedge-taken count.
+; CHECK-NEXT: Loop %outer_loop: Unpredictable predicated backedge-taken count.
+;
+entry:
+ %start_1 = load i32, i32* %p, !range !0
+ %start_2 = load i32, i32* %q, !range !1
+ br label %outer_loop
+
+outer_loop:
+ %outer_phi = phi i32 [ %start_1, %entry], [%inner_lcssa, %outer_backedge]
+ br label %inner_loop
+
+inner_loop:
+ %inner_phi_1 = phi i32 [%outer_phi, %outer_loop], [%inner_phi_2, %inner_loop]
+ %inner_phi_2 = phi i32 [%start_2, %outer_loop], [%inner_phi_1, %inner_loop]
+ %inner_cond = call i1 @cond()
+ br i1 %inner_cond, label %inner_loop, label %outer_backedge
+
+outer_backedge:
+ %inner_lcssa = phi i32 [%inner_phi_1, %inner_loop]
+ %outer_cond = call i1 @cond()
+ br i1 %outer_cond, label %outer_loop, label %exit
+
+exit:
+ ret void
+}
+
+!0 = !{i32 0, i32 1000}
+!1 = !{i32 2000, i32 3000}