maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/Isl/CodeGen/non-affine-update.ll

71 lines
2.5 KiB
LLVM
Raw Normal View History

ScopInfo: Allocate globally unique memory access identifiers Before this commit memory reference identifiers have only been unique per basic block, but not per (non-affine) ScopStmt. This commit now uses the MemoryAccess base pointer to uniquely identify each Memory access. llvm-svn: 252200
2015-11-06 04:15:37 +08:00
; RUN: opt %loadPolly -polly-import-jscop -polly-import-jscop-dir=%S \
; RUN: -polly-codegen -S < %s | FileCheck %s
;
; void non-affine-update(double A[], double C[], double B[]) {
; for (int i = 0; i < 10; i++) {
; if (A[i] >= 6)
; B[i] += 42;
; else
; C[i] += 3;
; }
; }
; Verify that all changed memory access functions are corectly code generated.
; At some point this did not work due to memory access identifiers not being
; unique within non-affine scop statements.
; CHECK: polly.stmt.bb2:
Use minimal types for generated expressions We now use the minimal necessary bit width for the generated code. If operations might overflow (add/sub/mul) we will try to adjust the types in order to ensure a non-wrapping computation. If the type adjustment is not possible, thus the necessary type is bigger than the type value of --polly-max-expr-bit-width, we will use assumptions to verify the computation will not wrap. However, for run-time checks we cannot build assumptions but instead utilize overflow tracking intrinsics. llvm-svn: 271878
2016-06-06 17:57:41 +08:00
; CHECK: %[[R:[0-9]*]] = zext i5 %polly.indvar to i64
; CHECK: %scevgep = getelementptr double, double* %A, i64 %[[R]]
ScopInfo: Allocate globally unique memory access identifiers Before this commit memory reference identifiers have only been unique per basic block, but not per (non-affine) ScopStmt. This commit now uses the MemoryAccess base pointer to uniquely identify each Memory access. llvm-svn: 252200
2015-11-06 04:15:37 +08:00
; CHECK: polly.stmt.bb9:
Use minimal types for generated expressions We now use the minimal necessary bit width for the generated code. If operations might overflow (add/sub/mul) we will try to adjust the types in order to ensure a non-wrapping computation. If the type adjustment is not possible, thus the necessary type is bigger than the type value of --polly-max-expr-bit-width, we will use assumptions to verify the computation will not wrap. However, for run-time checks we cannot build assumptions but instead utilize overflow tracking intrinsics. llvm-svn: 271878
2016-06-06 17:57:41 +08:00
; CHECK: %polly.access.C{{.*}} = getelementptr double, double* %C, i7 42
; CHECK: %polly.access.C{{.*}} = getelementptr double, double* %C, i7 42
ScopInfo: Allocate globally unique memory access identifiers Before this commit memory reference identifiers have only been unique per basic block, but not per (non-affine) ScopStmt. This commit now uses the MemoryAccess base pointer to uniquely identify each Memory access. llvm-svn: 252200
2015-11-06 04:15:37 +08:00
; CHECK: polly.stmt.bb5:
Use minimal types for generated expressions We now use the minimal necessary bit width for the generated code. If operations might overflow (add/sub/mul) we will try to adjust the types in order to ensure a non-wrapping computation. If the type adjustment is not possible, thus the necessary type is bigger than the type value of --polly-max-expr-bit-width, we will use assumptions to verify the computation will not wrap. However, for run-time checks we cannot build assumptions but instead utilize overflow tracking intrinsics. llvm-svn: 271878
2016-06-06 17:57:41 +08:00
; CHECK: %polly.access.B{{.*}} = getelementptr double, double* %B, i8 113
; CHECK: %polly.access.B{{.*}} = getelementptr double, double* %B, i8 113
ScopInfo: Allocate globally unique memory access identifiers Before this commit memory reference identifiers have only been unique per basic block, but not per (non-affine) ScopStmt. This commit now uses the MemoryAccess base pointer to uniquely identify each Memory access. llvm-svn: 252200
2015-11-06 04:15:37 +08:00
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @non-affine-update(double* %A, double* %C, double* %B) {
bb:
br label %bb1
bb1: ; preds = %bb14, %bb
%indvars.iv = phi i64 [ %indvars.iv.next, %bb14 ], [ 0, %bb ]
%exitcond = icmp ne i64 %indvars.iv, 10
br i1 %exitcond, label %bb2, label %bb15
bb2: ; preds = %bb1
%tmp = getelementptr inbounds double, double* %A, i64 %indvars.iv
%tmp3 = load double, double* %tmp, align 8
%tmp4 = fcmp ult double %tmp3, 6.000000e+00
br i1 %tmp4, label %bb9, label %bb5
bb5: ; preds = %bb2
%tmp6 = getelementptr inbounds double, double* %B, i64 %indvars.iv
%tmp7 = load double, double* %tmp6, align 8
%tmp8 = fadd double %tmp7, 4.200000e+01
store double %tmp8, double* %tmp6, align 8
br label %bb13
bb9: ; preds = %bb2
%tmp10 = getelementptr inbounds double, double* %C, i64 %indvars.iv
%tmp11 = load double, double* %tmp10, align 8
%tmp12 = fadd double %tmp11, 3.000000e+00
store double %tmp12, double* %tmp10, align 8
br label %bb13
bb13: ; preds = %bb9, %bb5
br label %bb14
bb14: ; preds = %bb13
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
br label %bb1
bb15: ; preds = %bb1
ret void
}