; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 3 ; RUN: opt -passes='print' -disable-output %s 2>&1 | FileCheck %s ; Test cases for using the backedge-taken-count to rule out dependencies between ; an invariant and strided accesses. define void @test_distance_greater_than_BTC_100(ptr %a) { ; CHECK-LABEL: 'test_distance_greater_than_BTC_100' ; CHECK-NEXT: loop: ; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop ; CHECK-NEXT: Unknown data dependence. ; CHECK-NEXT: Dependences: ; CHECK-NEXT: Unknown: ; CHECK-NEXT: %l = load i32, ptr %gep.x, align 4 -> ; CHECK-NEXT: store i32 %l, ptr %gep, align 4 ; CHECK-EMPTY: ; CHECK-NEXT: Run-time memory checks: ; CHECK-NEXT: Grouped accesses: ; CHECK-EMPTY: ; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop. ; CHECK-NEXT: SCEV assumptions: ; CHECK-EMPTY: ; CHECK-NEXT: Expressions re-written: ; entry: %gep.x = getelementptr i32, ptr %a, i32 100 br label %loop loop: %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] %gep = getelementptr i32, ptr %a, i32 %iv %l = load i32, ptr %gep.x store i32 %l, ptr %gep %iv.next = add i32 %iv, 1 %ec = icmp eq i32 %iv.next, 100 br i1 %ec, label %exit, label %loop exit: ret void } define void @test_distance_much_greater_than_BTC_100(ptr %a) { ; CHECK-LABEL: 'test_distance_much_greater_than_BTC_100' ; CHECK-NEXT: loop: ; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop ; CHECK-NEXT: Unknown data dependence. ; CHECK-NEXT: Dependences: ; CHECK-NEXT: Unknown: ; CHECK-NEXT: %l = load i32, ptr %gep.x, align 4 -> ; CHECK-NEXT: store i32 %l, ptr %gep, align 4 ; CHECK-EMPTY: ; CHECK-NEXT: Run-time memory checks: ; CHECK-NEXT: Grouped accesses: ; CHECK-EMPTY: ; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop. ; CHECK-NEXT: SCEV assumptions: ; CHECK-EMPTY: ; CHECK-NEXT: Expressions re-written: ; entry: %gep.x = getelementptr i32, ptr %a, i32 200 br label %loop loop: %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] %gep = getelementptr i32, ptr %a, i32 %iv %l = load i32, ptr %gep.x store i32 %l, ptr %gep %iv.next = add i32 %iv, 1 %ec = icmp eq i32 %iv.next, 100 br i1 %ec, label %exit, label %loop exit: ret void } define void @test_distance_equal_BTC_100(ptr %a) { ; CHECK-LABEL: 'test_distance_equal_BTC_100' ; CHECK-NEXT: loop: ; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop ; CHECK-NEXT: Unknown data dependence. ; CHECK-NEXT: Dependences: ; CHECK-NEXT: Unknown: ; CHECK-NEXT: %l = load i32, ptr %gep.x, align 4 -> ; CHECK-NEXT: store i32 %l, ptr %gep, align 4 ; CHECK-EMPTY: ; CHECK-NEXT: Run-time memory checks: ; CHECK-NEXT: Grouped accesses: ; CHECK-EMPTY: ; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop. ; CHECK-NEXT: SCEV assumptions: ; CHECK-EMPTY: ; CHECK-NEXT: Expressions re-written: ; entry: %gep.x = getelementptr i32, ptr %a, i32 99 br label %loop loop: %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] %gep = getelementptr i32, ptr %a, i32 %iv %l = load i32, ptr %gep.x store i32 %l, ptr %gep %iv.next = add i32 %iv, 1 %ec = icmp eq i32 %iv.next, 100 br i1 %ec, label %exit, label %loop exit: ret void } define void @test_distance_greater_than_BTC_10000(ptr %a) { ; CHECK-LABEL: 'test_distance_greater_than_BTC_10000' ; CHECK-NEXT: loop: ; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop ; CHECK-NEXT: Unknown data dependence. ; CHECK-NEXT: Dependences: ; CHECK-NEXT: Unknown: ; CHECK-NEXT: %l = load i32, ptr %gep.x, align 4 -> ; CHECK-NEXT: store i32 %l, ptr %gep, align 4 ; CHECK-EMPTY: ; CHECK-NEXT: Run-time memory checks: ; CHECK-NEXT: Grouped accesses: ; CHECK-EMPTY: ; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop. ; CHECK-NEXT: SCEV assumptions: ; CHECK-EMPTY: ; CHECK-NEXT: Expressions re-written: ; entry: %gep.x = getelementptr i32, ptr %a, i32 10000 br label %loop loop: %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] %gep = getelementptr i32, ptr %a, i32 %iv %l = load i32, ptr %gep.x store i32 %l, ptr %gep %iv.next = add i32 %iv, 1 %ec = icmp eq i32 %iv.next, 10000 br i1 %ec, label %exit, label %loop exit: ret void } define void @test_distance_equal_to_BTC_10000(ptr %a) { ; CHECK-LABEL: 'test_distance_equal_to_BTC_10000' ; CHECK-NEXT: loop: ; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop ; CHECK-NEXT: Unknown data dependence. ; CHECK-NEXT: Dependences: ; CHECK-NEXT: Unknown: ; CHECK-NEXT: %l = load i32, ptr %gep.x, align 4 -> ; CHECK-NEXT: store i32 %l, ptr %gep, align 4 ; CHECK-EMPTY: ; CHECK-NEXT: Run-time memory checks: ; CHECK-NEXT: Grouped accesses: ; CHECK-EMPTY: ; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop. ; CHECK-NEXT: SCEV assumptions: ; CHECK-EMPTY: ; CHECK-NEXT: Expressions re-written: ; entry: %gep.x = getelementptr i32, ptr %a, i32 9999 br label %loop loop: %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] %gep = getelementptr i32, ptr %a, i32 %iv %l = load i32, ptr %gep.x store i32 %l, ptr %gep %iv.next = add i32 %iv, 1 %ec = icmp eq i32 %iv.next, 100000 br i1 %ec, label %exit, label %loop exit: ret void } define void @test_btc_is_unknown_value(ptr %a, i32 %N) { ; CHECK-LABEL: 'test_btc_is_unknown_value' ; CHECK-NEXT: loop: ; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop ; CHECK-NEXT: Unknown data dependence. ; CHECK-NEXT: Dependences: ; CHECK-NEXT: Unknown: ; CHECK-NEXT: %l = load i32, ptr %gep.x, align 4 -> ; CHECK-NEXT: store i32 %l, ptr %gep, align 4 ; CHECK-EMPTY: ; CHECK-NEXT: Run-time memory checks: ; CHECK-NEXT: Grouped accesses: ; CHECK-NEXT: Group [[GRP1:0x[0-9a-f]+]]: ; CHECK-NEXT: (Low: (400 + %a) High: (404 + %a)) ; CHECK-NEXT: Member: (400 + %a) ; CHECK-NEXT: Group [[GRP2:0x[0-9a-f]+]]: ; CHECK-NEXT: (Low: %a High: (4 + (4 * (zext i32 (-1 + %N) to i64)) + %a)) ; CHECK-NEXT: Member: {%a,+,4}<%loop> ; CHECK-EMPTY: ; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop. ; CHECK-NEXT: SCEV assumptions: ; CHECK-NEXT: {0,+,1}<%loop> Added Flags: ; CHECK-EMPTY: ; CHECK-NEXT: Expressions re-written: ; CHECK-NEXT: [PSE] %gep = getelementptr i32, ptr %a, i32 %iv: ; CHECK-NEXT: ((4 * (sext i32 {0,+,1}<%loop> to i64)) + %a) ; CHECK-NEXT: --> {%a,+,4}<%loop> ; entry: %gep.x = getelementptr i32, ptr %a, i32 100 br label %loop loop: %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] %gep = getelementptr i32, ptr %a, i32 %iv %l = load i32, ptr %gep.x store i32 %l, ptr %gep %iv.next = add i32 %iv, 1 %ec = icmp eq i32 %iv.next, %N br i1 %ec, label %exit, label %loop exit: ret void }