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

79 lines
2.3 KiB
LLVM
Raw Normal View History

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
; RUN: opt -basicaa %loadPolly -polly-scops -analyze < %s | FileCheck %s
;
; CHECK: Stmt_for_body
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: Reduction Type: MUL
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
; CHECK: MemRef_sum
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: Reduction Type: MUL
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
; CHECK: MemRef_sum
; CHECK: Stmt_for_body3
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: Reduction Type: NONE
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
; CHECK: MemRef_A
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: Reduction Type: ADD
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
; CHECK: MemRef_sum
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: Reduction Type: ADD
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
; CHECK: MemRef_sum
; CHECK: Stmt_for_end
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: Reduction Type: MUL
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
; CHECK: MemRef_sum
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: Reduction Type: MUL
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
; CHECK: MemRef_sum
;
; void f(int *restrict A, int *restrict sum) {
; int i, j;
; for (i = 0; i < 100; i++) {
; *sum *= 7;
; for (j = 0; j < 100; j++) {
; *sum += A[i + j];
; }
; *sum *= 5;
; }
; }
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.inc6, %entry
%i.0 = phi i32 [ 0, %entry ], [ %inc7, %for.inc6 ]
%exitcond1 = icmp ne i32 %i.0, 100
br i1 %exitcond1, label %for.body, label %for.end8
for.body: ; preds = %for.cond
%tmp = load i32* %sum, align 4
%mul = mul nsw i32 %tmp, 7
store i32 %mul, i32* %sum, align 4
br label %for.cond1
for.cond1: ; preds = %for.inc, %for.body
%j.0 = phi i32 [ 0, %for.body ], [ %inc, %for.inc ]
%exitcond = icmp ne i32 %j.0, 100
br i1 %exitcond, label %for.body3, label %for.end
for.body3: ; preds = %for.cond1
%add = add nsw i32 %i.0, %j.0
%arrayidx = getelementptr inbounds i32* %A, i32 %add
%tmp2 = load i32* %arrayidx, align 4
%tmp3 = load i32* %sum, align 4
%add4 = add nsw i32 %tmp3, %tmp2
store i32 %add4, i32* %sum, align 4
br label %for.inc
for.inc: ; preds = %for.body3
%inc = add nsw i32 %j.0, 1
br label %for.cond1
for.end: ; preds = %for.cond1
%tmp4 = load i32* %sum, align 4
%mul5 = mul nsw i32 %tmp4, 5
store i32 %mul5, i32* %sum, align 4
br label %for.inc6
for.inc6: ; preds = %for.end
%inc7 = add nsw i32 %i.0, 1
br label %for.cond
for.end8: ; preds = %for.cond
ret void
}