For scalar accesses, change the access target to an array element that is known to contain the same value. This may become an alternative to forwardKnownLoad which creates new loads (and therefore closer to forwarding speculatives). Reloading does not require the known value originating from a load, but can be a store as well. Differential Revision: https://reviews.llvm.org/D39325 llvm-svn: 316766
74 lines
2.0 KiB
LLVM
74 lines
2.0 KiB
LLVM
; RUN: opt %loadPolly -polly-optree -analyze < %s | FileCheck %s -match-full-lines
|
|
;
|
|
; Rematerialize a load.
|
|
;
|
|
; for (int j = 0; j < n; j += 1) {
|
|
; bodyA:
|
|
; double val = B[j];
|
|
;
|
|
; bodyB:
|
|
; A[j] = val;
|
|
; }
|
|
;
|
|
|
|
declare double @f() #0
|
|
|
|
define void @func(i32 %n, double* noalias nonnull %A, double* noalias nonnull %B) {
|
|
entry:
|
|
br label %for
|
|
|
|
for:
|
|
%j = phi i32 [0, %entry], [%j.inc, %inc]
|
|
%j.cmp = icmp slt i32 %j, %n
|
|
br i1 %j.cmp, label %bodyA, label %exit
|
|
|
|
bodyA:
|
|
%val = call double @f()
|
|
%A_idx = getelementptr inbounds double, double* %A, i32 %j
|
|
store double %val, double* %A_idx
|
|
br label %bodyB
|
|
|
|
bodyB:
|
|
%B_idx = getelementptr inbounds double, double* %B, i32 %j
|
|
store double %val, double* %B_idx
|
|
br label %inc
|
|
|
|
inc:
|
|
%j.inc = add nuw nsw i32 %j, 1
|
|
br label %for
|
|
|
|
exit:
|
|
br label %return
|
|
|
|
return:
|
|
ret void
|
|
}
|
|
|
|
attributes #0 = { nounwind readnone }
|
|
|
|
|
|
; CHECK: Statistics {
|
|
; CHECK: Reloads: 1
|
|
; CHECK: }
|
|
|
|
; CHECK: After statements {
|
|
; CHECK-NEXT: Stmt_bodyA
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
|
|
; CHECK-NEXT: [n] -> { Stmt_bodyA[i0] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: [n] -> { Stmt_bodyA[i0] -> MemRef_val[] };
|
|
; CHECK-NEXT: Instructions {
|
|
; CHECK-NEXT: %val = call double @f()
|
|
; CHECK-NEXT: store double %val, double* %A_idx
|
|
; CHECK-NEXT: }
|
|
; CHECK-NEXT: Stmt_bodyB
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
|
|
; CHECK-NEXT: [n] -> { Stmt_bodyB[i0] -> MemRef_B[i0] };
|
|
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: [n] -> { Stmt_bodyB[i0] -> MemRef_val[] };
|
|
; CHECK-NEXT: new: [n] -> { Stmt_bodyB[i0] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: Instructions {
|
|
; CHECK-NEXT: store double %val, double* %B_idx
|
|
; CHECK-NEXT: }
|
|
; CHECK-NEXT: }
|