7a0f7dbf2d
Reapply of a22d1c2225543aa9ae7882f6b1a97ee7b2c95574. Using this PR for pre-merge CI. Instead of relying on any pass manager to schedule Polly's passes, add Polly's own pipeline manager which is seen as a monolithic pass in LLVM's pass manager. Polly's former passes are now phases of the new PhaseManager component. Relying on LLVM's pass manager (the legacy as well as the New Pass Manager) to manage Polly's phases never was a good fit that the PhaseManager resolves: * Polly passes were modifying analysis results, in particular RegionInfo and ScopInfo. This means that there was not just one unique and "definite" analysis result, the actual result depended on which analyses ran prior, and the pass manager was not allowed to throw away cached analyses or prior SCoP optimizations would have been forgotten. The LLVM pass manger's persistance of analysis results is not contractual but designed for caching. * Polly depends on a particular execution order of passes and regions (e.g. regression tests, invalidation of consecutive SCoPs). LLVM's pass manager does not guarantee any excecution order. * Polly does not completely preserve DominatorTree, RegionInfo, LoopInfo, or ScalarEvolution, but only as-needed for Polly's own uses. Because the ScopDetection object stores references to those analyses, it still had to lie to the pass manager that they would be preserved, or the pass manager would have released and recomputed the invalidated analysis objects that ScopDetection/ScopInfo was still referencing. To ensure that no non-Polly pass would see these not-completely-preserved analyses, all analyses still had to be thrown away after the ScopPassManager, respectively with a BarrierNoopPass in case of the LPM. * The NPM's PassInstrumentation wraps the IR unit into an `llvm::Any` object, but implementations such as PrintIRInstrumentation call llvm_unreachable on encountering an unknown IR unit, such as SCoPs, with no extension points to add support. Hence LLVM crashes when dumping IR between SCoP passes (such as `-print-before-changed` with Polly being active). The new PhaseManager uses some command line options that previously belonged to Polly's legacy passes, such as `-polly-print-detect` (so the option will continue to work). Hence the LPM support is incompatible with the new approach and support for it is removed.
87 lines
3.3 KiB
LLVM
87 lines
3.3 KiB
LLVM
; RUN: opt %loadNPMPolly '-passes=polly-custom<import-jscop;codegen>' -S < %s | FileCheck %s
|
|
; RUN: opt %loadNPMPolly '-passes=polly-custom<import-jscop;codegen>' -polly-import-jscop-postfix=pow2 -S < %s | FileCheck %s -check-prefix=POW2
|
|
;
|
|
; void exprModDiv(float *A, float *B, float *C, long N, long p) {
|
|
; for (long i = 0; i < N; i++)
|
|
; C[i] += A[i] + B[i] + A[i] + B[i + p];
|
|
; }
|
|
;
|
|
;
|
|
; This test case changes the access functions such that the resulting index
|
|
; expressions are modulo or division operations. We test that the code we
|
|
; generate takes advantage of knowledge about unsigned numerators. This is
|
|
; useful as LLVM will translate urem and udiv operations with power-of-two
|
|
; denominators to fast bitwise and or shift operations.
|
|
|
|
; A[i % 127]
|
|
; CHECK: %pexp.pdiv_r = urem i64 %polly.indvar, 127
|
|
; CHECK: %polly.access.A9 = getelementptr float, ptr %A, i64 %pexp.pdiv_r
|
|
|
|
; A[floor(i / 127)]
|
|
;
|
|
; Note: without the floor, we would create a map i -> i/127, which only contains
|
|
; values of i that are divisible by 127. All other values of i would not
|
|
; be mapped to any value. However, to generate correct code we require
|
|
; each value of i to indeed be mapped to a value.
|
|
;
|
|
; CHECK: %pexp.p_div_q = udiv i64 %polly.indvar, 127
|
|
; CHECK: %polly.access.B10 = getelementptr float, ptr %B, i64 %pexp.p_div_q
|
|
|
|
; A[p % 128]
|
|
|
|
; A[p / 127]
|
|
; CHECK: %pexp.div = sdiv exact i64 %p, 127
|
|
; CHECK: %polly.access.B12 = getelementptr float, ptr %B, i64 %pexp.div
|
|
|
|
; A[i % 128]
|
|
; POW2: %pexp.pdiv_r = urem i64 %polly.indvar, 128
|
|
; POW2: %polly.access.A9 = getelementptr float, ptr %A, i64 %pexp.pdiv_r
|
|
|
|
; A[floor(i / 128)]
|
|
; POW2: %pexp.p_div_q = udiv i64 %polly.indvar, 128
|
|
; POW2: %polly.access.B10 = getelementptr float, ptr %B, i64 %pexp.p_div_q
|
|
|
|
; A[p % 128]
|
|
|
|
; A[p / 128]
|
|
; POW2: %pexp.div = sdiv exact i64 %p, 128
|
|
; POW2: %polly.access.B12 = getelementptr float, ptr %B, i64 %pexp.div
|
|
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
|
|
define void @exprModDiv(ptr %A, ptr %B, ptr %C, i64 %N, i64 %p) {
|
|
entry:
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.inc, %entry
|
|
%i.0 = phi i64 [ 0, %entry ], [ %inc, %for.inc ]
|
|
%cmp = icmp slt i64 %i.0, %N
|
|
br i1 %cmp, label %for.body, label %for.end
|
|
|
|
for.body: ; preds = %for.cond
|
|
%arrayidx = getelementptr inbounds float, ptr %A, i64 %i.0
|
|
%tmp = load float, ptr %arrayidx, align 4
|
|
%arrayidx1 = getelementptr inbounds float, ptr %B, i64 %i.0
|
|
%tmp1 = load float, ptr %arrayidx1, align 4
|
|
%add = fadd float %tmp, %tmp1
|
|
%arrayidx2 = getelementptr inbounds float, ptr %A, i64 %i.0
|
|
%tmp2 = load float, ptr %arrayidx2, align 4
|
|
%add3 = fadd float %add, %tmp2
|
|
%padd = add nsw i64 %p, %i.0
|
|
%arrayidx4 = getelementptr inbounds float, ptr %B, i64 %padd
|
|
%tmp3 = load float, ptr %arrayidx4, align 4
|
|
%add5 = fadd float %add3, %tmp3
|
|
%arrayidx6 = getelementptr inbounds float, ptr %C, i64 %i.0
|
|
%tmp4 = load float, ptr %arrayidx6, align 4
|
|
%add7 = fadd float %tmp4, %add5
|
|
store float %add7, ptr %arrayidx6, align 4
|
|
br label %for.inc
|
|
|
|
for.inc: ; preds = %for.body
|
|
%inc = add nuw nsw i64 %i.0, 1
|
|
br label %for.cond
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret void
|
|
}
|