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

71 lines
2.3 KiB
LLVM
Raw Normal View History

ScopDetection: Only detect scops that have at least one read and one write Scops that only read seem generally uninteresting and scops that only write are most likely initializations where there is also little to optimize. To not waste compile time we bail early. Differential Revision: http://reviews.llvm.org/D7735 llvm-svn: 229820
2015-02-19 13:31:07 +08:00
; RUN: opt %loadPolly -polly-detect-unprofitable -analyze -polly-scops -polly-model-phi-nodes < %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 {
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-LABEL: Stmt_bb6
; 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]
; CHECK: [N, c] -> { Stmt_bb6[i0] -> MemRef_tmp_0[] };
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_bb7
; 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]
; CHECK: [N, c] -> { Stmt_bb7[i0] -> MemRef_tmp_0[] };
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]
; CHECK: [N, c] -> { Stmt_bb8[i0] -> MemRef_tmp_0[] };
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
}