73 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 52; RUN: opt -passes='print<scalar-evolution>' -disable-output %s 2>&1 | FileCheck %s3 4declare void @foo()5 6; Tests with multiple guards for the same value and different values.7 8define void @test_guard_order_b_then_c_and_d(ptr %a, ptr %b, ptr %c, ptr %d) {9; CHECK-LABEL: 'test_guard_order_b_then_c_and_d'10; CHECK-NEXT: Classifying expressions for: @test_guard_order_b_then_c_and_d11; CHECK-NEXT: %iv = phi ptr [ %a, %entry ], [ %iv.next, %loop ]12; CHECK-NEXT: --> {%a,+,1}<%loop> U: full-set S: full-set Exits: (-1 + (-1 * (ptrtoint ptr %a to i64)) + (ptrtoint ptr %b to i64) + %a) LoopDispositions: { %loop: Computable }13; CHECK-NEXT: %iv.next = getelementptr i8, ptr %iv, i64 114; CHECK-NEXT: --> {(1 + %a),+,1}<%loop> U: full-set S: full-set Exits: ((-1 * (ptrtoint ptr %a to i64)) + (ptrtoint ptr %b to i64) + %a) LoopDispositions: { %loop: Computable }15; CHECK-NEXT: Determining loop execution counts for: @test_guard_order_b_then_c_and_d16; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (-1 * (ptrtoint ptr %a to i64)) + (ptrtoint ptr %b to i64))17; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i64 -218; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * (ptrtoint ptr %a to i64)) + (ptrtoint ptr %b to i64))19; CHECK-NEXT: Loop %loop: Trip multiple is 120;21entry:22 %cmp.eq.b = icmp ne ptr %a, %b23 %cmp.eq.c = icmp ne ptr %a, %c24 %cmp.eq.d = icmp ne ptr %b, %d25 call void @llvm.assume(i1 %cmp.eq.b)26 call void @llvm.assume(i1 %cmp.eq.c)27 call void @llvm.assume(i1 %cmp.eq.d)28 br label %loop29 30loop:31 %iv = phi ptr [ %a, %entry ], [ %iv.next, %loop ]32 %iv.next = getelementptr i8, ptr %iv, i64 133 call void @foo()34 %ec = icmp eq ptr %iv.next, %b35 br i1 %ec, label %exit, label %loop36 37exit:38 ret void39}40 41define void @test_guard_order_d_then_c_and_b(ptr %a, ptr %b, ptr %c, ptr %d) {42; CHECK-LABEL: 'test_guard_order_d_then_c_and_b'43; CHECK-NEXT: Classifying expressions for: @test_guard_order_d_then_c_and_b44; CHECK-NEXT: %iv = phi ptr [ %a, %entry ], [ %iv.next, %loop ]45; CHECK-NEXT: --> {%a,+,1}<%loop> U: full-set S: full-set Exits: (-1 + (-1 * (ptrtoint ptr %a to i64)) + (ptrtoint ptr %b to i64) + %a) LoopDispositions: { %loop: Computable }46; CHECK-NEXT: %iv.next = getelementptr i8, ptr %iv, i64 147; CHECK-NEXT: --> {(1 + %a),+,1}<%loop> U: full-set S: full-set Exits: ((-1 * (ptrtoint ptr %a to i64)) + (ptrtoint ptr %b to i64) + %a) LoopDispositions: { %loop: Computable }48; CHECK-NEXT: Determining loop execution counts for: @test_guard_order_d_then_c_and_b49; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (-1 * (ptrtoint ptr %a to i64)) + (ptrtoint ptr %b to i64))50; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i64 -251; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * (ptrtoint ptr %a to i64)) + (ptrtoint ptr %b to i64))52; CHECK-NEXT: Loop %loop: Trip multiple is 153;54entry:55 %cmp.eq.b = icmp ne ptr %a, %b56 %cmp.eq.c = icmp ne ptr %a, %c57 %cmp.eq.d = icmp ne ptr %b, %d58 call void @llvm.assume(i1 %cmp.eq.d)59 call void @llvm.assume(i1 %cmp.eq.c)60 call void @llvm.assume(i1 %cmp.eq.b)61 br label %loop62 63loop:64 %iv = phi ptr [ %a, %entry ], [ %iv.next, %loop ]65 %iv.next = getelementptr i8, ptr %iv, i64 166 call void @foo()67 %ec = icmp eq ptr %iv.next, %b68 br i1 %ec, label %exit, label %loop69 70exit:71 ret void72}73