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/user_provided_non_dominatin...

75 lines
2.9 KiB
LLVM
Raw Normal View History

Prepare unit tests for update to ISL 0.16 ISL 0.16 will change how sets are printed which breaks 117 unit tests that text-compare printed sets. This patch re-formats most of these unit tests using a script and small manual editing on top of that. When actually updating ISL, most work is done by just re-running the script to adapt to the changed output. Some tests that compare IR and tests with single CHECK-lines that can be easily updated manually are not included here. The re-format script will also be committed afterwards. The per-test formatter invocation command lines options will not be added in the near future because it is ad hoc and would overwrite the manual edits. Ideally it also shouldn't be required anymore because ISL's set printing has become more stable in 0.16. Differential Revision: http://reviews.llvm.org/D16095 llvm-svn: 257851
2016-01-15 08:48:42 +08:00
; RUN: opt %loadPolly -pass-remarks-analysis="polly-scops" -polly-scops -disable-output < %s 2>&1 | FileCheck %s
Use parameter constraints provided via llvm.assume If an llvm.assume dominates the SCoP entry block and the assumed condition can be expressed as an affine inequality we will now add it to the context. Differential Revision: http://reviews.llvm.org/D14413 llvm-svn: 252851
2015-11-12 11:25:01 +08:00
;
; CHECK: remark: <unknown>:0:0: SCoP begins here.
Prepare unit tests for update to ISL 0.16 ISL 0.16 will change how sets are printed which breaks 117 unit tests that text-compare printed sets. This patch re-formats most of these unit tests using a script and small manual editing on top of that. When actually updating ISL, most work is done by just re-running the script to adapt to the changed output. Some tests that compare IR and tests with single CHECK-lines that can be easily updated manually are not included here. The re-format script will also be committed afterwards. The per-test formatter invocation command lines options will not be added in the near future because it is ad hoc and would overwrite the manual edits. Ideally it also shouldn't be required anymore because ISL's set printing has become more stable in 0.16. Differential Revision: http://reviews.llvm.org/D16095 llvm-svn: 257851
2016-01-15 08:48:42 +08:00
; CHECK-NEXT: remark: <unknown>:0:0: Inbounds assumption: [i, N, p_2] -> { : N <= i or (N >= 1 + i and p_2 <= 100) }
; CHECK-NEXT: remark: <unknown>:0:0: Inbounds assumption: [i, N, p_2, M] -> { : N <= i or (N >= 1 + i and p_2 <= 0) or (N >= 1 + i and p_2 >= 1 and M >= p_2) }
Use parameter constraints provided via llvm.assume If an llvm.assume dominates the SCoP entry block and the assumed condition can be expressed as an affine inequality we will now add it to the context. Differential Revision: http://reviews.llvm.org/D14413 llvm-svn: 252851
2015-11-12 11:25:01 +08:00
; CHECK-NEXT: remark: <unknown>:0:0: SCoP ends here.
;
; void f(int *restrict A, int *restrict B, int i, int N, int M, int C[100][100]) {
; for (; i < N; i++) {
; __builtin_assume(N >= 0);
; for (int j = 0; j != M; j++) {
; __builtin_assume(N >= 0);
; C[i][j] += A[i * M + j] + B[i + j];
; }
; }
; }
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @f(i32* noalias %A, i32* noalias %B, i32 %i, i32 %N, i32 %M, [100 x i32]* %C) {
entry:
%tmp = zext i32 %M to i64
%tmp6 = sext i32 %i to i64
%tmp7 = sext i32 %N to i64
%tmp8 = sext i32 %M to i64
br label %for.cond
for.cond: ; preds = %for.inc.15, %entry
%indvars.iv3 = phi i64 [ %indvars.iv.next4, %for.inc.15 ], [ %tmp6, %entry ]
%cmp = icmp slt i64 %indvars.iv3, %tmp7
br i1 %cmp, label %for.body, label %for.end.17
for.body: ; preds = %for.cond
%cmp1 = icmp sgt i32 %N, -1
call void @llvm.assume(i1 %cmp1)
br label %for.cond.2
for.cond.2: ; preds = %for.inc, %for.body
%indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %for.body ]
%cmp3 = icmp eq i64 %indvars.iv, %tmp
br i1 %cmp3, label %for.end, label %for.body.4
for.body.4: ; preds = %for.cond.2
%tmp9 = mul nsw i64 %indvars.iv3, %tmp8
%tmp10 = add nsw i64 %tmp9, %indvars.iv
%arrayidx = getelementptr inbounds i32, i32* %A, i64 %tmp10
%tmp11 = load i32, i32* %arrayidx, align 4
%tmp12 = add nsw i64 %indvars.iv3, %indvars.iv
%arrayidx8 = getelementptr inbounds i32, i32* %B, i64 %tmp12
%tmp13 = load i32, i32* %arrayidx8, align 4
%add9 = add nsw i32 %tmp11, %tmp13
%arrayidx13 = getelementptr inbounds [100 x i32], [100 x i32]* %C, i64 %indvars.iv3, i64 %indvars.iv
%tmp14 = load i32, i32* %arrayidx13, align 4
%add14 = add nsw i32 %tmp14, %add9
store i32 %add14, i32* %arrayidx13, align 4
br label %for.inc
for.inc: ; preds = %for.body.4
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
br label %for.cond.2
for.end: ; preds = %for.cond.2
br label %for.inc.15
for.inc.15: ; preds = %for.end
%indvars.iv.next4 = add nsw i64 %indvars.iv3, 1
br label %for.cond
for.end.17: ; preds = %for.cond
ret void
}
declare void @llvm.assume(i1) #1