maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/DependenceInfo/reduction_multiple_loops_ar...

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

79 lines
2.6 KiB
LLVM
Raw Normal View History

[BasicAA] Replace -basicaa with -basic-aa in polly Follow up to https://reviews.llvm.org/D82607.
2020-07-01 06:40:24 +08:00
; RUN: opt %loadPolly -polly-dependences -analyze -basic-aa < %s | FileCheck %s
Allow multiple reductions per statement Iterate over all store memory accesses and check for valid binary reduction candidate loads by following the operands of the stored value. For each candidate pair we check if they have the same base address and there are no other accesses which may overlap with them. This ensures that no intermediate value can escape into other memory locations or is overwritten at some point. + 17 test cases for reduction detection and reduction dependency modeling llvm-svn: 211957
2014-06-28 04:31:28 +08:00
;
Prepare unit tests for update to ISL 0.16 ISL 0.16 will change how sets are printed which breaks 117 unit tests that text-compare printed sets. This patch re-formats most of these unit tests using a script and small manual editing on top of that. When actually updating ISL, most work is done by just re-running the script to adapt to the changed output. Some tests that compare IR and tests with single CHECK-lines that can be easily updated manually are not included here. The re-format script will also be committed afterwards. The per-test formatter invocation command lines options will not be added in the near future because it is ad hoc and would overwrite the manual edits. Ideally it also shouldn't be required anymore because ISL's set printing has become more stable in 0.16. Differential Revision: http://reviews.llvm.org/D16095 llvm-svn: 257851
2016-01-15 08:48:42 +08:00
; CHECK: RAW dependences:
; CHECK-NEXT: { }
; CHECK-NEXT: WAR dependences:
; CHECK-NEXT: { }
; CHECK-NEXT: WAW dependences:
; CHECK-NEXT: { }
; CHECK-NEXT: Reduction dependences:
Update to ISL 0.16.1 llvm-svn: 257898
2016-01-15 23:54:45 +08:00
; CHECK-NEXT: { Stmt_for_body3[i0, i1] -> Stmt_for_body3[i0, 1 + i1] : 0 <= i0 <= 99 and 0 <= i1 <= 98; Stmt_for_body3[i0, 99] -> Stmt_for_body3[1 + i0, 0] : 0 <= i0 <= 98 }
Allow multiple reductions per statement Iterate over all store memory accesses and check for valid binary reduction candidate loads by following the operands of the stored value. For each candidate pair we check if they have the same base address and there are no other accesses which may overlap with them. This ensures that no intermediate value can escape into other memory locations or is overwritten at some point. + 17 test cases for reduction detection and reduction dependency modeling llvm-svn: 211957
2014-06-28 04:31:28 +08:00
;
; int f(int * restrict A, int * restrict sum) {
; int i, j, k;
; for (i = 0; i < 100; i++) {
; for (j = 0; j < 100; j++) {
; sum += A[i+j];
; for (k = 0; k< 100; k++) {}
; }
; }
; return sum;
; }
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
define void @f(i32* noalias %A, i32* noalias %sum) {
entry:
br label %for.cond
for.cond: ; preds = %for.inc11, %entry
%i.0 = phi i32 [ 0, %entry ], [ %inc12, %for.inc11 ]
%exitcond2 = icmp ne i32 %i.0, 100
br i1 %exitcond2, label %for.body, label %for.end13
for.body: ; preds = %for.cond
br label %for.cond1
for.cond1: ; preds = %for.inc8, %for.body
%j.0 = phi i32 [ 0, %for.body ], [ %inc9, %for.inc8 ]
%exitcond1 = icmp ne i32 %j.0, 100
br i1 %exitcond1, label %for.body3, label %for.end10
for.body3: ; preds = %for.cond1
%add = add nsw i32 %i.0, %j.0
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx = getelementptr inbounds i32, i32* %A, i32 %add
Update Polly tests to handle explicitly typed load changes in LLVM. llvm-svn: 230796
2015-02-28 05:22:50 +08:00
%tmp3 = load i32, i32* %arrayidx, align 4
%tmp4 = load i32, i32* %sum, align 4
Allow multiple reductions per statement Iterate over all store memory accesses and check for valid binary reduction candidate loads by following the operands of the stored value. For each candidate pair we check if they have the same base address and there are no other accesses which may overlap with them. This ensures that no intermediate value can escape into other memory locations or is overwritten at some point. + 17 test cases for reduction detection and reduction dependency modeling llvm-svn: 211957
2014-06-28 04:31:28 +08:00
%add4 = add nsw i32 %tmp4, %tmp3
store i32 %add4, i32* %sum, align 4
br label %for.cond5
for.cond5: ; preds = %for.inc, %for.body3
%k.0 = phi i32 [ 0, %for.body3 ], [ %inc, %for.inc ]
%exitcond = icmp ne i32 %k.0, 100
br i1 %exitcond, label %for.body7, label %for.end
for.body7: ; preds = %for.cond5
br label %for.inc
for.inc: ; preds = %for.body7
%inc = add nsw i32 %k.0, 1
br label %for.cond5
for.end: ; preds = %for.cond5
br label %for.inc8
for.inc8: ; preds = %for.end
%inc9 = add nsw i32 %j.0, 1
br label %for.cond1
for.end10: ; preds = %for.cond1
br label %for.inc11
for.inc11: ; preds = %for.end10
%inc12 = add nsw i32 %i.0, 1
br label %for.cond
for.end13: ; preds = %for.cond
ret void
}