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_assumptions.ll

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

124 lines
4.8 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
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s --check-prefix=SCOP
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.
; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [M, N] -> { : N <= 2147483647 - M }
Update to ISL 0.16.1 llvm-svn: 257898
2016-01-15 23:54:45 +08:00
; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [M, N] -> { : -2147483648 - M <= N <= 2147483647 - M }
; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [M, N, Debug] -> { : Debug = 0 and 0 < M <= 100 and -2147483648 - M <= N <= 2147483647 - M }
Handle llvm.assume inside the SCoP The assumption attached to an llvm.assume in the SCoP needs to be combined with the domain of the surrounding statement but can nevertheless be used to refine the context. This fixes the problems mentioned in PR27067. llvm-svn: 269060
2016-05-10 22:00:57 +08:00
; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [M, N, Debug] -> { : Debug = 0 and 0 < M <= 100 and 0 < N <= 2147483647 - M }
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.
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
; SCOP: Context:
Record assumptions first and add them later There are three reasons why we want to record assumptions first before we add them to the assumed/invalid context: 1) If the SCoP is not profitable or otherwise invalid without the assumed/invalid context we do not have to compute it. 2) Information about the context are gathered rather late in the SCoP construction (basically after we know all parameters), thus the user might see overly complicated assumptions to be taken while they would have been simplified later on. 3) Currently we cannot take assumptions at any point but have to wait, e.g., for the domain generation to finish. This makes wrapping assumptions much more complicated as they need to be and it will have a similar effect on "signed-unsigned" assumptions later. llvm-svn: 266068
2016-04-12 21:27:35 +08:00
; SCOP-NEXT: [N, M, Debug] -> { : Debug = 0 and N > 0 and 0 < M <= 2147483647 - N and M <= 100 }
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
; SCOP: Assumed Context:
; SCOP-NEXT: [N, M, Debug] -> { : }
Track assumptions and restrictions separatly In order to speed up compile time and to avoid random timeouts we now separately track assumptions and restrictions. In this context assumptions describe parameter valuations we need and restrictions describe parameter valuations we do not allow. During AST generation we create a runtime check for both, whereas the one for the restrictions is negated before a conjunction is build. Except the In-Bounds assumptions we currently only track restrictions. Differential Revision: http://reviews.llvm.org/D17247 llvm-svn: 262328
2016-03-01 21:06:28 +08:00
; SCOP: Invalid Context:
Update isl to isl-0.18-1047-g4a20ef8 This update: - Removes several deprecated functions (e.g., isl_band). - Improves the pretty-printing of sets by detecting modulos and "false" equalities. - Minor improvements to coalescing and increased robustness of the isl scheduler. This update does not yet include isl commit isl-0.18-90-gd00cb45 (isl_pw_*_alloc: add missing check for compatible spaces, Wed Sep 6 12:18:04 2017 +0200), as this additional check is too tight and unfortunately causes two test case failures in Polly. A patch has been submitted to isl and will be included in the next isl update for Polly. llvm-svn: 325557
2018-02-20 15:26:42 +08:00
; SCOP-NEXT: [N, M, Debug] -> { : false }
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
;
; #include <stdio.h>
;
; void valid(int * restrict A, int * restrict B, int N, int M, int C[100][100], int Debug) {
; __builtin_assume(M <= 2147483647 - N);
; __builtin_assume(M >= -2147483648 - N);
; __builtin_assume(Debug == 0 && M <= 100 && M >= 1 && N >= 1);
; if (N + M == -1)
; C[0][0] = 0;
;
; for (int i = 0; i < N; i++) {
; for (int j = 0; j != M; j++) {
; C[i][j] += A[i * M + j] + B[i + j];
; }
;
; if (Debug)
; printf("Printf!");
; }
; }
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
@.str = private unnamed_addr constant [8 x i8] c"Printf!\00", align 1
define void @valid(i32* noalias %A, i32* noalias %B, i32 %N, i32 %M, [100 x i32]* %C, i32 %Debug) {
entry:
%sub = sub nsw i32 2147483647, %N
%cmp = icmp sge i32 %sub, %M
call void @llvm.assume(i1 %cmp)
%conv = sext i32 %M to i64
%conv1 = sext i32 %N to i64
%sub2 = sub nsw i64 -2147483648, %conv1
%cmp3 = icmp sge i64 %conv, %sub2
call void @llvm.assume(i1 %cmp3)
%cmp5 = icmp eq i32 %Debug, 0
%cmp7 = icmp slt i32 %M, 101
%or.cond = and i1 %cmp5, %cmp7
%cmp10 = icmp sgt i32 %M, 0
%or.cond1 = and i1 %or.cond, %cmp10
%cmp12 = icmp sgt i32 %N, 0
call void @llvm.assume(i1 %or.cond1)
call void @llvm.assume(i1 %cmp12)
%add = add nsw i32 %N, %M
%cmp14 = icmp eq i32 %add, -1
br label %entry.split
entry.split:
br i1 %cmp14, label %if.then, label %if.end
if.then: ; preds = %entry
%arrayidx16 = getelementptr inbounds [100 x i32], [100 x i32]* %C, i64 0, i64 0
store i32 0, i32* %arrayidx16, align 4
br label %if.end
if.end: ; preds = %if.then, %entry
%M64 = sext i32 %M to i64
%N64 = sext i32 %N to i64
br label %for.cond
for.cond: ; preds = %for.inc.36, %if.end
%indvars.iv3 = phi i64 [ %indvars.iv.next4, %for.inc.36 ], [ 0, %if.end ]
%cmp17 = icmp slt i64 %indvars.iv3, %N64
br i1 %cmp17, label %for.cond.19, label %for.end.38
for.cond.19: ; preds = %for.cond, %for.body.22
%indvars.iv = phi i64 [ %indvars.iv.next, %for.body.22 ], [ 0, %for.cond ]
%cmp20 = icmp eq i64 %indvars.iv, %M64
br i1 %cmp20, label %for.end, label %for.body.22
for.body.22: ; preds = %for.cond.19
%tmp9 = mul nsw i64 %indvars.iv3, %M64
%tmp10 = add nsw i64 %tmp9, %indvars.iv
%arrayidx24 = getelementptr inbounds i32, i32* %A, i64 %tmp10
%tmp11 = load i32, i32* %arrayidx24, align 4
%tmp12 = add nuw nsw i64 %indvars.iv3, %indvars.iv
%arrayidx27 = getelementptr inbounds i32, i32* %B, i64 %tmp12
%tmp13 = load i32, i32* %arrayidx27, align 4
%add28 = add nsw i32 %tmp11, %tmp13
%arrayidx32 = getelementptr inbounds [100 x i32], [100 x i32]* %C, i64 %indvars.iv3, i64 %indvars.iv
%tmp14 = load i32, i32* %arrayidx32, align 4
%add33 = add nsw i32 %tmp14, %add28
store i32 %add33, i32* %arrayidx32, align 4
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
br label %for.cond.19
for.end: ; preds = %for.cond.19
%tobool = icmp eq i32 %Debug, 0
br i1 %tobool, label %for.inc.36, label %if.then.34
if.then.34: ; preds = %for.end
%call = call i32 (i8*, ...) @printf(i8* nonnull getelementptr inbounds ([8 x i8], [8 x i8]* @.str, i64 0, i64 0))
br label %for.inc.36
for.inc.36: ; preds = %for.end, %if.then.34
%indvars.iv.next4 = add nuw nsw i64 %indvars.iv3, 1
br label %for.cond
for.end.38: ; preds = %for.cond
ret void
}
; Function Attrs: nounwind
declare void @llvm.assume(i1) #0
declare i32 @printf(i8*, ...)
attributes #0 = { nounwind }