maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/ScopInfo/non_affine_region_2.ll

119 lines
4.3 KiB
LLVM
Raw Normal View History

tests: Drop -polly-detect-unprofitable and -polly-no-early-exit These flags are now always passed to all tests and need to be disabled if not needed. Disabling these flags, rather than passing them to almost all tests, significantly simplfies our RUN: lines. llvm-svn: 249422
2015-10-06 23:36:44 +08:00
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
Do not model scalar accesses in non-affine subregions If a scalar was defined and used only in a non-affine subregion we do not need to model the accesses. However, if the scalar was defined inside the region and escapes the region we have to model the access. The same is true if the scalar was defined outside and used inside the region. llvm-svn: 230960
2015-03-02 22:06:01 +08:00
;
; Verify the scalar x defined in a non-affine subregion is written as it
; escapes the region. In this test the two conditionals inside the region
; are expressed as two PHI nodes with two incoming values each.
;
; void f(int *A, int b) {
; for (int i = 0; i < 1024; i++) {
; int x = 0;
; if (A[i]) {
; if (b > i)
; x = 0;
; else if (b < 2 * i)
; x = i;
; else
; x = b;
; }
; A[i] = x;
; }
; }
;
; CHECK: Region: %bb2---%bb21
Make non-affine statement names isl compatible Named isl sets can generally have any name if they remain within Polly, but only certain strings can be parsed by isl. The new names we create ensure that we can always copy-past isl strings from Polly to other isl tools, e.g. for debugging. llvm-svn: 241787
2015-07-09 15:31:45 +08:00
; CHECK: Stmt_bb3__TO__bb18
Do not model scalar accesses in non-affine subregions If a scalar was defined and used only in a non-affine subregion we do not need to model the accesses. However, if the scalar was defined inside the region and escapes the region we have to model the access. The same is true if the scalar was defined outside and used inside the region. llvm-svn: 230960
2015-03-02 22:06:01 +08:00
; CHECK: Domain :=
Traverse the SCoP to compute non-loop-carried domain conditions In order to compute domain conditions for conditionals we will now traverse the region in the ScopInfo once and build the domains for each block in the region. The SCoP statements can then use these constraints when they build their domain. The reason behind this change is twofold: 1) This removes a big chunk of preprocessing logic from the TempScopInfo, namely the Conditionals we used to build there. Additionally to moving this logic it is also simplified. Instead of walking the dominance tree up for each basic block in the region (as we did before), we now traverse the region only once in order to collect the domain conditions. 2) This is the first step towards the isl based domain creation. The second step will traverse the region similar to this step, however it will propagate back edge conditions. Once both are in place this conditional handling will allow multiple exit loops additional logic. Reviewers: grosser Differential Revision: http://reviews.llvm.org/D12428 llvm-svn: 246398
2015-08-31 05:13:53 +08:00
; CHECK: { Stmt_bb3__TO__bb18[i0] :
; CHECK-DAG: i0 >= 0
; CHECK-DAG: and
; CHECK-DAG: i0 <= 1023
; CHECK: };
Rename 'scattering' to 'schedule' In Polly we used both the term 'scattering' and the term 'schedule' to describe the execution order of a statement without actually distinguishing between them. We now uniformly use the term 'schedule' for the execution order. This corresponds to the terminology of isl. History: CLooG introduced the term scattering as the generated code can be used as a sequential execution order (schedule) or as a parallel dimension enumerating different threads of execution (placement). In Polly and/or isl the term placement was never used, but we uniformly refer to an execution order as a schedule and only later introduce parallelism. When doing so we do not talk about about specific placement dimensions. llvm-svn: 235380
2015-04-21 19:37:25 +08:00
; CHECK: Schedule :=
Make non-affine statement names isl compatible Named isl sets can generally have any name if they remain within Polly, but only certain strings can be parsed by isl. The new names we create ensure that we can always copy-past isl strings from Polly to other isl tools, e.g. for debugging. llvm-svn: 241787
2015-07-09 15:31:45 +08:00
; CHECK: { Stmt_bb3__TO__bb18[i0] -> [i0, 0] };
; CHECK-NOT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_0[] };
; CHECK-NOT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_1[] };
Do not model scalar accesses in non-affine subregions If a scalar was defined and used only in a non-affine subregion we do not need to model the accesses. However, if the scalar was defined inside the region and escapes the region we have to model the access. The same is true if the scalar was defined outside and used inside the region. llvm-svn: 230960
2015-03-02 22:06:01 +08:00
; CHECK: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
Make non-affine statement names isl compatible Named isl sets can generally have any name if they remain within Polly, but only certain strings can be parsed by isl. The new names we create ensure that we can always copy-past isl strings from Polly to other isl tools, e.g. for debugging. llvm-svn: 241787
2015-07-09 15:31:45 +08:00
; CHECK-NEXT: { Stmt_bb3__TO__bb18[i0] -> MemRef_A[i0] };
; CHECK-NOT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_0[] };
; CHECK-NOT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_1[] };
Revert "Always treat scalar writes as MUST_WRITEs" This reverts commit r255471. Johannes raised in the post-commit review of r255471 the concern that PHI writes in non-affine regions with two exiting blocks are not really MUST_WRITE, but we just know that at least one out of the set of all possible PHI writes will be executed. Modeling all PHI nodes as MUST_WRITEs is probably save, but adding the needed documentation for such a special case is probably not worth the effort. Michael will be proposing a new patch that ensures only a single PHI_WRITE is created for non-affine regions, which - besides other benefits - should also allow us to use a single well-defined MUST_WRITE for such PHI writes. (This is not a full revert, but the condition and documentation have been slightly extended) llvm-svn: 255503
2015-12-14 23:05:37 +08:00
; CHECK: MayWriteAccess := [Reduction Type: NONE] [Scalar: 1]
Keep track of ScopArrayInfo objects that model PHI node storage Summary: When translating PHI nodes into memory dependences during code generation we require two kinds of memory. 'Normal memory' as for all scalar dependences and 'PHI node memory' to store the incoming values of the PHI node. With this patch we now mark and track these two kinds of memories, which we previously incorrectly marked as a single memory object. Being aware of PHI node storage makes code generation easier, as we do not need to guess what kind of storage a scalar reference requires. This simplifies the code nicely. Reviewers: jdoerfert Subscribers: pollydev, llvm-commits Differential Revision: http://reviews.llvm.org/D11554 llvm-svn: 243420
2015-07-28 22:53:44 +08:00
; CHECK-NEXT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_2__phi[] };
Make non-affine statement names isl compatible Named isl sets can generally have any name if they remain within Polly, but only certain strings can be parsed by isl. The new names we create ensure that we can always copy-past isl strings from Polly to other isl tools, e.g. for debugging. llvm-svn: 241787
2015-07-09 15:31:45 +08:00
; CHECK-NOT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_0[] };
; CHECK-NOT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_1[] };
Earlier creation of ScopStmt objects This moves the construction of ScopStmt to the beginning of the ScopInfo pass. The late creation was a result of the earlier separation of ScopInfo and TempScopInfo. This will avoid introducing more ScopStmt-like maps in future commits. The AccFuncMap will also be removed in some future commit. DomainMap might also be included into ScopStmt. The order in which ScopStmt are created changes and initially creates empty statements that are removed in a simplification. Differential Revision: http://reviews.llvm.org/D13341 llvm-svn: 249132
2015-10-02 21:53:07 +08:00
; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
Keep track of ScopArrayInfo objects that model PHI node storage Summary: When translating PHI nodes into memory dependences during code generation we require two kinds of memory. 'Normal memory' as for all scalar dependences and 'PHI node memory' to store the incoming values of the PHI node. With this patch we now mark and track these two kinds of memories, which we previously incorrectly marked as a single memory object. Being aware of PHI node storage makes code generation easier, as we do not need to guess what kind of storage a scalar reference requires. This simplifies the code nicely. Reviewers: jdoerfert Subscribers: pollydev, llvm-commits Differential Revision: http://reviews.llvm.org/D11554 llvm-svn: 243420
2015-07-28 22:53:44 +08:00
; CHECK-NEXT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_2__phi[] };
Make non-affine statement names isl compatible Named isl sets can generally have any name if they remain within Polly, but only certain strings can be parsed by isl. The new names we create ensure that we can always copy-past isl strings from Polly to other isl tools, e.g. for debugging. llvm-svn: 241787
2015-07-09 15:31:45 +08:00
; CHECK-NOT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_0[] };
; CHECK-NOT: { Stmt_bb3__TO__bb18[i0] -> MemRef_x_1[] };
Do not model scalar accesses in non-affine subregions If a scalar was defined and used only in a non-affine subregion we do not need to model the accesses. However, if the scalar was defined inside the region and escapes the region we have to model the access. The same is true if the scalar was defined outside and used inside the region. llvm-svn: 230960
2015-03-02 22:06:01 +08:00
; CHECK: Stmt_bb18
; CHECK: Domain :=
Traverse the SCoP to compute non-loop-carried domain conditions In order to compute domain conditions for conditionals we will now traverse the region in the ScopInfo once and build the domains for each block in the region. The SCoP statements can then use these constraints when they build their domain. The reason behind this change is twofold: 1) This removes a big chunk of preprocessing logic from the TempScopInfo, namely the Conditionals we used to build there. Additionally to moving this logic it is also simplified. Instead of walking the dominance tree up for each basic block in the region (as we did before), we now traverse the region only once in order to collect the domain conditions. 2) This is the first step towards the isl based domain creation. The second step will traverse the region similar to this step, however it will propagate back edge conditions. Once both are in place this conditional handling will allow multiple exit loops additional logic. Reviewers: grosser Differential Revision: http://reviews.llvm.org/D12428 llvm-svn: 246398
2015-08-31 05:13:53 +08:00
; CHECK: { Stmt_bb18[i0] :
; CHECK-DAG: i0 >= 0
; CHECK-DAG: and
; CHECK-DAG: i0 <= 1023
; CHECK: };
Rename 'scattering' to 'schedule' In Polly we used both the term 'scattering' and the term 'schedule' to describe the execution order of a statement without actually distinguishing between them. We now uniformly use the term 'schedule' for the execution order. This corresponds to the terminology of isl. History: CLooG introduced the term scattering as the generated code can be used as a sequential execution order (schedule) or as a parallel dimension enumerating different threads of execution (placement). In Polly and/or isl the term placement was never used, but we uniformly refer to an execution order as a schedule and only later introduce parallelism. When doing so we do not talk about about specific placement dimensions. llvm-svn: 235380
2015-04-21 19:37:25 +08:00
; CHECK: Schedule :=
Do not model scalar accesses in non-affine subregions If a scalar was defined and used only in a non-affine subregion we do not need to model the accesses. However, if the scalar was defined inside the region and escapes the region we have to model the access. The same is true if the scalar was defined outside and used inside the region. llvm-svn: 230960
2015-03-02 22:06:01 +08:00
; CHECK: { Stmt_bb18[i0] -> [i0, 1] };
; CHECK: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
Keep track of ScopArrayInfo objects that model PHI node storage Summary: When translating PHI nodes into memory dependences during code generation we require two kinds of memory. 'Normal memory' as for all scalar dependences and 'PHI node memory' to store the incoming values of the PHI node. With this patch we now mark and track these two kinds of memories, which we previously incorrectly marked as a single memory object. Being aware of PHI node storage makes code generation easier, as we do not need to guess what kind of storage a scalar reference requires. This simplifies the code nicely. Reviewers: jdoerfert Subscribers: pollydev, llvm-commits Differential Revision: http://reviews.llvm.org/D11554 llvm-svn: 243420
2015-07-28 22:53:44 +08:00
; CHECK: { Stmt_bb18[i0] -> MemRef_x_2__phi[] };
Do not model scalar accesses in non-affine subregions If a scalar was defined and used only in a non-affine subregion we do not need to model the accesses. However, if the scalar was defined inside the region and escapes the region we have to model the access. The same is true if the scalar was defined outside and used inside the region. llvm-svn: 230960
2015-03-02 22:06:01 +08:00
; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK: { Stmt_bb18[i0] -> MemRef_A[i0] };
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @f(i32* %A, i32 %b) {
bb:
%tmp = sext i32 %b to i64
%tmp1 = sext i32 %b to i64
br label %bb2
bb2: ; preds = %bb20, %bb
%indvars.iv = phi i64 [ %indvars.iv.next, %bb20 ], [ 0, %bb ]
%exitcond = icmp ne i64 %indvars.iv, 1024
br i1 %exitcond, label %bb3, label %bb21
bb3: ; preds = %bb2
%tmp4 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
%tmp5 = load i32, i32* %tmp4, align 4
%tmp6 = icmp eq i32 %tmp5, 0
br i1 %tmp6, label %bb18, label %bb7
bb7: ; preds = %bb3
%tmp8 = icmp slt i64 %indvars.iv, %tmp
br i1 %tmp8, label %bb9, label %bb10
bb9: ; preds = %bb7
br label %bb17
bb10: ; preds = %bb7
%tmp11 = shl nsw i64 %indvars.iv, 1
%tmp12 = icmp sgt i64 %tmp11, %tmp1
br i1 %tmp12, label %bb13, label %bb15
bb13: ; preds = %bb10
%tmp14 = trunc i64 %indvars.iv to i32
br label %bb16
bb15: ; preds = %bb10
br label %bb16
bb16: ; preds = %bb15, %bb13
%x.0 = phi i32 [ %tmp14, %bb13 ], [ %b, %bb15 ]
br label %bb17
bb17: ; preds = %bb16, %bb9
%x.1 = phi i32 [ 0, %bb9 ], [ %x.0, %bb16 ]
br label %bb18
bb18: ; preds = %bb3, %bb17
%x.2 = phi i32 [ %x.1, %bb17 ], [ 0, %bb3 ]
%tmp19 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
store i32 %x.2, i32* %tmp19, align 4
br label %bb20
bb20: ; preds = %bb18
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
br label %bb2
bb21: ; preds = %bb2
ret void
}