ecff11dcfb
To reduce compile time and to allow more and better quality SCoPs in
the long run we introduced scalar dependences and PHI-modeling. This
patch will now allow us to generate code if one or both of those
options are set. While the principle of demoting scalars as well as
PHIs to memory in order to communicate their value stays the same,
this allows to delay the demotion till the very end (the actual code
generation). Consequently:
- We __almost__ do not modify the code if we do not generate code
for an optimized SCoP in the end. Thus, the early exit as well as
the unprofitable option will now actually preven us from
introducing regressions in case we will probably not get better
code.
- Polly can be used as a "pure" analyzer tool as long as the code
generator is set to none.
- The original SCoP is almost not touched when the optimized version
is placed next to it. Runtime regressions if the runtime checks
chooses the original are not to be expected and later
optimizations do not need to revert the demotion for that part.
- We will generate direct accesses to the demoted values, thus there
are no "trivial GEPs" that select the first element of a scalar we
demoted and treated as an array.
Differential Revision: http://reviews.llvm.org/D7513
llvm-svn: 238070
67 lines
2.1 KiB
LLVM
67 lines
2.1 KiB
LLVM
; RUN: opt %loadPolly -S -polly-no-early-exit -polly-detect-unprofitable -polly-model-phi-nodes -disable-polly-intra-scop-scalar-to-array -polly-codegen < %s | FileCheck %s
|
|
;
|
|
; void f(int *A, int c, int N) {
|
|
; int tmp;
|
|
; for (int i = 0; i < N; i++) {
|
|
; if (i > c)
|
|
; tmp = 3;
|
|
; else
|
|
; tmp = 5;
|
|
; A[i] = tmp;
|
|
; }
|
|
; }
|
|
;
|
|
; CHECK-LABEL: bb:
|
|
; CHECK-DAG: %tmp.0.s2a = alloca i32
|
|
; CHECK-DAG: %tmp.0.phiops = alloca i32
|
|
; CHECK-LABEL: polly.stmt.bb8:
|
|
; CHECK: %tmp.0.phiops.reload = load i32, i32* %tmp.0.phiops
|
|
; CHECK: store i32 %tmp.0.phiops.reload, i32* %tmp.0.s2a
|
|
; CHECK-LABEL: polly.stmt.bb8b:
|
|
; CHECK: %tmp.0.s2a.reload = load i32, i32* %tmp.0.s2a
|
|
; CHECK: store i32 %tmp.0.s2a.reload,
|
|
; CHECK-LABEL: polly.stmt.bb6:
|
|
; CHECK: store i32 3, i32* %tmp.0.phiops
|
|
; CHECK-LABEL: polly.stmt.bb7:
|
|
; CHECK: store i32 5, i32* %tmp.0.phiops
|
|
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
|
|
define void @f(i32* %A, i32 %c, i32 %N) {
|
|
bb:
|
|
%tmp = sext i32 %N to i64
|
|
%tmp1 = sext i32 %c to i64
|
|
br label %bb2
|
|
|
|
bb2: ; preds = %bb10, %bb
|
|
%indvars.iv = phi i64 [ %indvars.iv.next, %bb10 ], [ 0, %bb ]
|
|
%tmp3 = icmp slt i64 %indvars.iv, %tmp
|
|
br i1 %tmp3, label %bb4, label %bb11
|
|
|
|
bb4: ; preds = %bb2
|
|
%tmp5 = icmp sgt i64 %indvars.iv, %tmp1
|
|
br i1 %tmp5, label %bb6, label %bb7
|
|
|
|
bb6: ; preds = %bb4
|
|
br label %bb8
|
|
|
|
bb7: ; preds = %bb4
|
|
br label %bb8
|
|
|
|
bb8: ; preds = %bb7, %bb6
|
|
%tmp.0 = phi i32 [ 3, %bb6 ], [ 5, %bb7 ]
|
|
br label %bb8b
|
|
|
|
bb8b:
|
|
%tmp9 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
|
|
store i32 %tmp.0, i32* %tmp9, align 4
|
|
br label %bb10
|
|
|
|
bb10: ; preds = %bb8
|
|
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
|
|
br label %bb2
|
|
|
|
bb11: ; preds = %bb2
|
|
ret void
|
|
}
|