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...

74 lines
2.4 KiB
LLVM
Raw Normal View History

tests: Drop -polly-detect-unprofitable and -polly-no-early-exit These flags are now always passed to all tests and need to be disabled if not needed. Disabling these flags, rather than passing them to almost all tests, significantly simplfies our RUN: lines. llvm-svn: 249422
2015-10-06 23:36:44 +08:00
; RUN: opt %loadPolly -polly-dependences -analyze -basicaa < %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
;
; CHECK: Reduction dependences:
; CHECK: { Stmt_for_inc[i0, i1] -> Stmt_for_inc[i0, 1 + i1] : i0 <= 99 and i0 >= 0 and i1 <= 98 and i1 >= 0 }
;
; int f(int * __restrict__ A) {
; int i, j, sum = 0;
; for (k = 0; k < 37; k = g(k)) {
; for (i = 0; i < 100; i++) {
; sum *= 2;
; for (j = 0; j < 100; j++) {
; sum += A[i+j];
; }
; }
; }
; return sum;
; }
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
declare i64 @g(i64)
define i32 @f(i32* noalias %A) {
entry:
%sum.04.reg2mem = alloca i32
%sum.12.reg2mem = alloca i32
br label %entry.split
entry.split: ; preds = %entry
store i32 0, i32* %sum.04.reg2mem
br label %for.body_outer_split
for.body_outer_split: ; preds = %entry.split, %for.inc5
%indvars.ivK = phi i64 [ 0, %entry.split ], [ %incK, %for.bos2 ]
br label %for.body_outer
for.body_outer: ; preds = %for.body_outer_split
%incK = call i64 @g(i64 %indvars.ivK)
%exitcondK = icmp eq i64 %incK, 100
br i1 %exitcondK, label %for.end7, label %for.body
for.body: ; preds = %for.inc5, %for.body_outer
%indvars.iv23 = phi i64 [ 0, %for.body_outer ], [ %3, %for.inc5 ]
Update Polly tests to handle explicitly typed load changes in LLVM. llvm-svn: 230796
2015-02-28 05:22:50 +08:00
%sum.04.reload = load i32, i32* %sum.04.reg2mem
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
%mul = shl nsw i32 %sum.04.reload, 1
store i32 %mul, i32* %sum.12.reg2mem
br label %for.inc
for.inc: ; preds = %for.inc, %for.body
%indvars.iv1 = phi i64 [ 0, %for.body ], [ %1, %for.inc ]
Update Polly tests to handle explicitly typed load changes in LLVM. llvm-svn: 230796
2015-02-28 05:22:50 +08:00
%sum.12.reload = load i32, i32* %sum.12.reg2mem
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
%0 = add i64 %indvars.iv23, %indvars.iv1
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx = getelementptr i32, i32* %A, i64 %0
Update Polly tests to handle explicitly typed load changes in LLVM. llvm-svn: 230796
2015-02-28 05:22:50 +08:00
%tmp5 = load i32, i32* %arrayidx, 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 %tmp5, %sum.12.reload
%1 = add nuw nsw i64 %indvars.iv1, 1
%exitcond1 = icmp eq i64 %1, 100
store i32 %add4, i32* %sum.12.reg2mem
br i1 %exitcond1, label %for.inc5, label %for.inc
for.inc5: ; preds = %for.inc
Update Polly tests to handle explicitly typed load changes in LLVM. llvm-svn: 230796
2015-02-28 05:22:50 +08:00
%2 = load i32, i32* %sum.12.reg2mem
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
%3 = add nuw nsw i64 %indvars.iv23, 1
%exitcond2 = icmp eq i64 %3, 100
store i32 %2, i32* %sum.04.reg2mem
br i1 %exitcond2, label %for.bos2, label %for.body
for.bos2:
br label %for.body_outer_split
for.end7: ; preds = %for.inc5
Update Polly tests to handle explicitly typed load changes in LLVM. llvm-svn: 230796
2015-02-28 05:22:50 +08:00
%4 = load i32, i32* %sum.04.reg2mem
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
ret i32 %4
}