4556c9b8fe
Summary: We do not keep domain constraints on access functions when building the scop. Hence, for consistency reasons, it makes also sense to not include them when storing a new access function. This change results in simpler access functions that make output easier to read. This patch also helps to make DeLICMed memory accesses to be understood by our matrix multiplication pattern matching pass. Further changes to the matrix multiplication pattern matching are needed for this to work, so the corresponding test case will be added in a future commit. Reviewers: Meinersbur, bollu, gareevroman, efriedma, huihuiz, sebpop, simbuerg Subscribers: pollydev, llvm-commits Tags: #polly Differential Revision: https://reviews.llvm.org/D35237 llvm-svn: 308215
131 lines
4.5 KiB
LLVM
131 lines
4.5 KiB
LLVM
; RUN: opt %loadPolly -polly-flatten-schedule -polly-delicm -analyze < %s | FileCheck %s
|
|
;
|
|
; void func(double *A) {
|
|
; for (int j = 0; j < 2; j += 1) { /* outer */
|
|
; double phi = 0.0;
|
|
; for (int i = 0; i < 4; i += 1) /* reduction */
|
|
; phi += 4.2;
|
|
; A[j] = phi;
|
|
; }
|
|
; }
|
|
;
|
|
define void @func(double* noalias nonnull %A) {
|
|
entry:
|
|
br label %outer.preheader
|
|
|
|
outer.preheader:
|
|
br label %outer.for
|
|
|
|
outer.for:
|
|
%j = phi i32 [0, %outer.preheader], [%j.inc, %outer.inc]
|
|
%j.cmp = icmp slt i32 %j, 2
|
|
br i1 %j.cmp, label %reduction.preheader, label %outer.exit
|
|
|
|
|
|
reduction.preheader:
|
|
br label %reduction.for
|
|
|
|
reduction.for:
|
|
%i = phi i32 [0, %reduction.preheader], [%i.inc, %reduction.inc]
|
|
%phi = phi double [0.0, %reduction.preheader], [%add, %reduction.inc]
|
|
%i.cmp = icmp slt i32 %i, 4
|
|
br i1 %i.cmp, label %body, label %reduction.exit
|
|
|
|
|
|
|
|
body:
|
|
%add = fadd double %phi, 4.2
|
|
br label %reduction.inc
|
|
|
|
|
|
|
|
reduction.inc:
|
|
%i.inc = add nuw nsw i32 %i, 1
|
|
br label %reduction.for
|
|
|
|
reduction.exit:
|
|
%A_idx = getelementptr inbounds double, double* %A, i32 %j
|
|
store double %phi, double* %A_idx
|
|
br label %outer.inc
|
|
|
|
|
|
|
|
outer.inc:
|
|
%j.inc = add nuw nsw i32 %j, 1
|
|
br label %outer.for
|
|
|
|
outer.exit:
|
|
br label %return
|
|
|
|
return:
|
|
ret void
|
|
}
|
|
|
|
|
|
; Unrolled flattened schedule:
|
|
; [0] Stmt_reduction_preheader[0]
|
|
; [1] Stmt_reduction_for[0, 0]
|
|
; [2] Stmt_body[0, 0]
|
|
; [3] Stmt_reduction_inc[0, 0]
|
|
; [4] Stmt_reduction_for[0, 1]
|
|
; [5] Stmt_body[0, 1]
|
|
; [6] Stmt_reduction_inc[0, 1]
|
|
; [7] Stmt_reduction_for[0, 2]
|
|
; [8] Stmt_body[0, 2]
|
|
; [9] Stmt_reduction_inc[0, 2]
|
|
; [10] Stmt_reduction_for[0, 3]
|
|
; [11] Stmt_body[0, 3]
|
|
; [12] Stmt_reduction_inc[0, 3]
|
|
; [13] Stmt_reduction_for[0, 4]
|
|
; [14] Stmt_reduction_exit[0]
|
|
; [15] Stmt_reduction_preheader[0]
|
|
; [16] Stmt_reduction_for[1, 0]
|
|
; [17] Stmt_body[1, 0]
|
|
; [18] Stmt_reduction_inc[1, 0]
|
|
; [19] Stmt_reduction_for[1, 1]
|
|
; [20] Stmt_body[1, 1]
|
|
; [21] Stmt_reduction_inc[1, 1]
|
|
; [22] Stmt_reduction_for[1, 2]
|
|
; [23] Stmt_body[1, 2]
|
|
; [24] Stmt_reduction_inc[1, 2]
|
|
; [25] Stmt_reduction_for[1, 3]
|
|
; [26] Stmt_body[1, 3]
|
|
; [27] Stmt_reduction_inc[1, 3]
|
|
; [28] Stmt_reduction_for[1, 4]
|
|
; [29] Stmt_reduction_exit[1]
|
|
|
|
; CHECK: After accesses {
|
|
; CHECK-NEXT: Stmt_reduction_preheader
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: { Stmt_reduction_preheader[i0] -> MemRef_phi__phi[] };
|
|
; CHECK-NEXT: new: { Stmt_reduction_preheader[i0] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: Stmt_reduction_for
|
|
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: { Stmt_reduction_for[i0, i1] -> MemRef_phi__phi[] };
|
|
; CHECK-NEXT: new: { Stmt_reduction_for[i0, i1] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: { Stmt_reduction_for[i0, i1] -> MemRef_phi[] };
|
|
; CHECK-NEXT: new: { Stmt_reduction_for[i0, i1] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: Stmt_body
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: { Stmt_body[i0, i1] -> MemRef_add[] };
|
|
; CHECK-NEXT: new: { Stmt_body[i0, i1] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: { Stmt_body[i0, i1] -> MemRef_phi[] };
|
|
; CHECK-NEXT: new: { Stmt_body[i0, i1] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: Stmt_reduction_inc
|
|
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: { Stmt_reduction_inc[i0, i1] -> MemRef_add[] };
|
|
; CHECK-NEXT: new: { Stmt_reduction_inc[i0, i1] -> MemRef_A[i0] : i1 <= 7 - 5i0; Stmt_reduction_inc[1, 3] -> MemRef_A[1] };
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: { Stmt_reduction_inc[i0, i1] -> MemRef_phi__phi[] };
|
|
; CHECK-NEXT: new: { Stmt_reduction_inc[i0, i1] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: Stmt_reduction_exit
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
|
|
; CHECK-NEXT: { Stmt_reduction_exit[i0] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: { Stmt_reduction_exit[i0] -> MemRef_phi[] };
|
|
; CHECK-NEXT: new: { Stmt_reduction_exit[i0] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: }
|
|
|