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/phi_condition_modeling_1.ll

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

71 lines
2.2 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 -analyze -polly-scops < %s | FileCheck %s
Model PHI nodes without demoting them This allows us to model PHI nodes in the polyhedral description without demoting them. The modeling however will result in the same accesses as the demotion would have introduced. Differential Revision: http://reviews.llvm.org/D7415 llvm-svn: 228433
2015-02-07 04:13:15 +08:00
;
; 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: Statements {
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-LABEL: Stmt_bb6
Tighten the PHI modeling test cases While looking through the test cases I realized we did not have a CHECK line for a duplicate memory access which we may want to eliminate later. To ensure we do not have (or later introduce) unnecessary memory accesses, we now tighten the test cases to look for such a pattern (and add the CHECK: line that shows the redundant memory access). llvm-svn: 238227
2015-05-27 02:05:45 +08:00
; CHECK-NOT: Access
Model PHI nodes without demoting them This allows us to model PHI nodes in the polyhedral description without demoting them. The modeling however will result in the same accesses as the demotion would have introduced. Differential Revision: http://reviews.llvm.org/D7415 llvm-svn: 228433
2015-02-07 04:13:15 +08:00
; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 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: [N, c] -> { Stmt_bb6[i0] -> MemRef_tmp_0__phi[] };
Tighten the PHI modeling test cases While looking through the test cases I realized we did not have a CHECK line for a duplicate memory access which we may want to eliminate later. To ensure we do not have (or later introduce) unnecessary memory accesses, we now tighten the test cases to look for such a pattern (and add the CHECK: line that shows the redundant memory access). llvm-svn: 238227
2015-05-27 02:05:45 +08:00
; CHECK-NOT: Access
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-LABEL: Stmt_bb7
Tighten the PHI modeling test cases While looking through the test cases I realized we did not have a CHECK line for a duplicate memory access which we may want to eliminate later. To ensure we do not have (or later introduce) unnecessary memory accesses, we now tighten the test cases to look for such a pattern (and add the CHECK: line that shows the redundant memory access). llvm-svn: 238227
2015-05-27 02:05:45 +08:00
; CHECK-NOT: Access
Model PHI nodes without demoting them This allows us to model PHI nodes in the polyhedral description without demoting them. The modeling however will result in the same accesses as the demotion would have introduced. Differential Revision: http://reviews.llvm.org/D7415 llvm-svn: 228433
2015-02-07 04:13:15 +08:00
; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 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: [N, c] -> { Stmt_bb7[i0] -> MemRef_tmp_0__phi[] };
Tighten the PHI modeling test cases While looking through the test cases I realized we did not have a CHECK line for a duplicate memory access which we may want to eliminate later. To ensure we do not have (or later introduce) unnecessary memory accesses, we now tighten the test cases to look for such a pattern (and add the CHECK: line that shows the redundant memory access). llvm-svn: 238227
2015-05-27 02:05:45 +08:00
; CHECK-NOT: Access
; CHECK-LABEL: Stmt_bb8
; CHECK-NOT: Access
Model PHI nodes without demoting them This allows us to model PHI nodes in the polyhedral description without demoting them. The modeling however will result in the same accesses as the demotion would have introduced. Differential Revision: http://reviews.llvm.org/D7415 llvm-svn: 228433
2015-02-07 04:13:15 +08:00
; 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: [N, c] -> { Stmt_bb8[i0] -> MemRef_tmp_0__phi[] };
Tighten the PHI modeling test cases While looking through the test cases I realized we did not have a CHECK line for a duplicate memory access which we may want to eliminate later. To ensure we do not have (or later introduce) unnecessary memory accesses, we now tighten the test cases to look for such a pattern (and add the CHECK: line that shows the redundant memory access). llvm-svn: 238227
2015-05-27 02:05:45 +08:00
; CHECK-NOT: Access
Model PHI nodes without demoting them This allows us to model PHI nodes in the polyhedral description without demoting them. The modeling however will result in the same accesses as the demotion would have introduced. Differential Revision: http://reviews.llvm.org/D7415 llvm-svn: 228433
2015-02-07 04:13:15 +08:00
; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK: [N, c] -> { Stmt_bb8[i0] -> MemRef_A[i0] };
Tighten the PHI modeling test cases While looking through the test cases I realized we did not have a CHECK line for a duplicate memory access which we may want to eliminate later. To ensure we do not have (or later introduce) unnecessary memory accesses, we now tighten the test cases to look for such a pattern (and add the CHECK: line that shows the redundant memory access). llvm-svn: 238227
2015-05-27 02:05:45 +08:00
; CHECK-NOT: Access
Model PHI nodes without demoting them This allows us to model PHI nodes in the polyhedral description without demoting them. The modeling however will result in the same accesses as the demotion would have introduced. Differential Revision: http://reviews.llvm.org/D7415 llvm-svn: 228433
2015-02-07 04:13:15 +08:00
; CHECK: }
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 ]
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%tmp9 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
Model PHI nodes without demoting them This allows us to model PHI nodes in the polyhedral description without demoting them. The modeling however will result in the same accesses as the demotion would have introduced. Differential Revision: http://reviews.llvm.org/D7415 llvm-svn: 228433
2015-02-07 04:13:15 +08:00
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
}