-
Notifications
You must be signed in to change notification settings - Fork 10.9k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[LAA] Tests with different strides where BTC can rule out dependence.
Tests to add support for different strides with isSafeDependenceDistance as follow-up to #88039.
- Loading branch information
Showing
1 changed file
with
156 additions
and
0 deletions.
There are no files selected for viewing
156 changes: 156 additions & 0 deletions
156
...est/Analysis/LoopAccessAnalysis/different-strides-safe-dep-due-to-backedge-taken-count.ll
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,156 @@ | ||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 4 | ||
; RUN: opt -passes='print<access-info>' -disable-output %s 2>&1 | FileCheck %s | ||
|
||
target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128" | ||
|
||
define void @forward_dep_known_safe_due_to_backedge_taken_count(ptr %A) { | ||
; CHECK-LABEL: 'forward_dep_known_safe_due_to_backedge_taken_count' | ||
; 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.mul.2, align 4 -> | ||
; CHECK-NEXT: store i32 %add, 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: | ||
%A.511= getelementptr inbounds i32, ptr %A, i64 511 | ||
br label %loop | ||
|
||
loop: | ||
%iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ] | ||
%iv.mul.2 = shl nuw nsw i64 %iv, 1 | ||
%gep.mul.2 = getelementptr inbounds i32, ptr %A.511, i64 %iv.mul.2 | ||
%l = load i32, ptr %gep.mul.2, align 4 | ||
%add = add nsw i32 %l, 5 | ||
%gep = getelementptr inbounds i32, ptr %A, i64 %iv | ||
store i32 %add, ptr %gep, align 4 | ||
%iv.next = add nuw nsw i64 %iv, 1 | ||
%exitcond.not = icmp eq i64 %iv.next, 256 | ||
br i1 %exitcond.not, label %exit, label %loop | ||
|
||
exit: | ||
ret void | ||
} | ||
|
||
define void @forward_dep_not_known_safe_due_to_backedge_taken_count(ptr %A) { | ||
; CHECK-LABEL: 'forward_dep_not_known_safe_due_to_backedge_taken_count' | ||
; 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.mul.2, align 4 -> | ||
; CHECK-NEXT: store i32 %add, 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: | ||
%A.510 = getelementptr inbounds i32, ptr %A, i64 510 | ||
br label %loop | ||
|
||
loop: | ||
%iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ] | ||
%iv.mul.2 = shl nuw nsw i64 %iv, 1 | ||
%gep.mul.2 = getelementptr inbounds i32, ptr %A.510, i64 %iv.mul.2 | ||
%l = load i32, ptr %gep.mul.2, align 4 | ||
%add = add nsw i32 %l, 5 | ||
%gep = getelementptr inbounds i32, ptr %A, i64 %iv | ||
store i32 %add, ptr %gep, align 4 | ||
%iv.next = add nuw nsw i64 %iv, 1 | ||
%exitcond.not = icmp eq i64 %iv.next, 256 | ||
br i1 %exitcond.not, label %exit, label %loop | ||
|
||
exit: | ||
ret void | ||
} | ||
|
||
define void @unknown_dep_known_safe_due_to_backedge_taken_count(ptr %A) { | ||
; CHECK-LABEL: 'unknown_dep_known_safe_due_to_backedge_taken_count' | ||
; 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, align 4 -> | ||
; CHECK-NEXT: store i32 %add, ptr %gep.mul.2, 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: | ||
%A.511 = getelementptr inbounds i32, ptr %A, i64 511 | ||
br label %loop | ||
|
||
loop: | ||
%iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ] | ||
%iv.mul.2 = shl nuw nsw i64 %iv, 1 | ||
%gep = getelementptr inbounds i32, ptr %A, i64 %iv | ||
%l = load i32, ptr %gep, align 4 | ||
%add = add nsw i32 %l, 5 | ||
%gep.mul.2 = getelementptr inbounds i32, ptr %A.511, i64 %iv.mul.2 | ||
store i32 %add, ptr %gep.mul.2, align 4 | ||
%iv.next = add nuw nsw i64 %iv, 1 | ||
%exitcond.not = icmp eq i64 %iv.next, 256 | ||
br i1 %exitcond.not, label %exit, label %loop | ||
|
||
exit: | ||
ret void | ||
} | ||
|
||
define void @unknown_dep_not_known_safe_due_to_backedge_taken_count(ptr %A) { | ||
; CHECK-LABEL: 'unknown_dep_not_known_safe_due_to_backedge_taken_count' | ||
; 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, align 4 -> | ||
; CHECK-NEXT: store i32 %add, ptr %gep.mul.2, 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: | ||
%A.510 = getelementptr inbounds i32, ptr %A, i64 510 | ||
br label %loop | ||
|
||
loop: | ||
%iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ] | ||
%iv.mul.2 = shl nuw nsw i64 %iv, 1 | ||
%gep = getelementptr inbounds i32, ptr %A, i64 %iv | ||
%l = load i32, ptr %gep, align 4 | ||
%add = add nsw i32 %l, 5 | ||
%gep.mul.2 = getelementptr inbounds i32, ptr %A.510, i64 %iv.mul.2 | ||
store i32 %add, ptr %gep.mul.2, align 4 | ||
%iv.next = add nuw nsw i64 %iv, 1 | ||
%exitcond.not = icmp eq i64 %iv.next, 256 | ||
br i1 %exitcond.not, label %exit, label %loop | ||
|
||
exit: | ||
ret void | ||
} |