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

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

42 lines
1.3 KiB
LLVM
Raw Normal View History

[polly] Introduce -polly-print-* passes to replace -analyze. The `opt -analyze` option only works with the legacy pass manager and might be removed in the future, as explained in llvm.org/PR53733. This patch introduced -polly-print-* passes that print what the pass would print with the `-analyze` option and replaces all uses of `-analyze` in the regression tests. There are two exceptions: `CodeGen\single_loop_param_less_equal.ll` and `CodeGen\loop_with_condition_nested.ll` use `-analyze on the `-loops` pass which is not part of Polly. Reviewed By: aeubanks Differential Revision: https://reviews.llvm.org/D120782
2022-03-14 21:39:25 +08:00
; RUN: opt %loadPolly -polly-print-scops -disable-output < %s | FileCheck %s
Use ScalarEvolution to create tight bounds on the parameters llvm-svn: 230230
2015-02-24 00:15:51 +08:00
;
[tests] Fix some misspellings [NFC] llvm-svn: 295361
2017-02-17 03:11:29 +08:00
; Check that the constraints on the parameter derived from the
Use ScalarEvolution to create tight bounds on the parameters llvm-svn: 230230
2015-02-24 00:15:51 +08:00
; __wrapping__ range metadata (see bottom of the file) are present:
;
; CHECK: Context:
[ScopInfo] Always derive upper and lower bounds for parameters Commit r230230 introduced the use of range metadata to derive bounds for parameters, instead of just looking at the type of the parameter. As part of this commit support for wrapping ranges was added, where the lower bound of a parameter is larger than the upper bound: { 255 < p || p < 0 } However, at the same time, for wrapping ranges support for adding bounds given by the size of the containing type has acidentally been dropped. As a result, the range of the parameters was not guaranteed to be bounded any more. This change makes sure we always add the bounds given by the size of the type and then additionally add bounds based on signed wrapping, if available. For a parameter p with a type size of 32 bit, the valid range is then: { -2147483648 <= p <= 2147483647 and (255 < p or p < 0) } llvm-svn: 295349
2017-02-17 02:39:14 +08:00
; CHECK: [tmp] -> { : -2147483648 <= tmp <= 2147483647 and (tmp >= 256 or tmp < 0) }
Use ScalarEvolution to create tight bounds on the parameters llvm-svn: 230230
2015-02-24 00:15:51 +08:00
;
; void jd(int *A, int *p /* in [256, 0) */) {
; for (int i = 0; i < 1024; i++)
; A[i + *p] = i;
; }
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @jd(i32* %A, i32* %p) {
entry:
Update Polly tests to handle explicitly typed load changes in LLVM. llvm-svn: 230796
2015-02-28 05:22:50 +08:00
%tmp = load i32, i32* %p, align 4, !range !0
Use ScalarEvolution to create tight bounds on the parameters llvm-svn: 230230
2015-02-24 00:15:51 +08:00
br label %for.cond
for.cond: ; preds = %for.inc, %entry
%i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
%exitcond = icmp ne i32 %i.0, 1024
br i1 %exitcond, label %for.body, label %for.end
for.body: ; preds = %for.cond
%add = add i32 %i.0, %tmp
%idxprom = sext i32 %add to i64
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx = getelementptr inbounds i32, i32* %A, i64 %idxprom
Use ScalarEvolution to create tight bounds on the parameters llvm-svn: 230230
2015-02-24 00:15:51 +08:00
store i32 %i.0, i32* %arrayidx, align 4
br label %for.inc
for.inc: ; preds = %for.body
%inc = add nsw i32 %i.0, 1
br label %for.cond
for.end: ; preds = %for.cond
ret void
}
!0 = !{ i32 256, i32 0 }