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

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

34 lines
1.3 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 -polly-scops -analyze < %s | FileCheck %s
Drop explicit -polly-delinearize parameter Delinearization is now enabled by default and does not need to explicitly need to be enabled in our tests. llvm-svn: 264154
2016-03-23 21:21:02 +08:00
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polly-scops -polly-allow-nonaffine -analyze < %s | FileCheck %s -check-prefix=NONAFFINE
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 -polly-scops -polly-allow-nonaffine -analyze < %s | FileCheck %s -check-prefix=NONAFFINE
Improve test coverage for non-affine access functions We now verify that such functions are correctly detected even in combination with delinearization. This change is added to ensure we have good test coverage for the subsequent delinearization fix. We also remove unnecessary instructions from the test case. llvm-svn: 217664
2014-09-12 17:07:56 +08:00
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
; void foo(long *A) {
; for (i = 0; i < 1024; i++)
; A[i * i] = i;
;
define void @foo(i64 *%A) nounwind uwtable ssp {
entry:
br label %entry.split
entry.split: ; preds = %entry
br label %for.body
for.body: ; preds = %entry.split, %for.body
%indvar = phi i64 [ 0, %entry.split ], [ %indvar.next, %for.body ]
%mul = mul nsw i64 %indvar, %indvar
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 i64, i64* %A, i64 %mul
Improve test coverage for non-affine access functions We now verify that such functions are correctly detected even in combination with delinearization. This change is added to ensure we have good test coverage for the subsequent delinearization fix. We also remove unnecessary instructions from the test case. llvm-svn: 217664
2014-09-12 17:07:56 +08:00
store i64 %indvar, i64* %arrayidx, align 4
%indvar.next = add nsw i64 %indvar, 1
%exitcond = icmp ne i64 %indvar.next, 1024
br i1 %exitcond, label %for.body, label %for.end
for.end: ; preds = %for.body
ret void
}
; CHECK-NOT: Stmt_for_body
Do not use wrapping ranges to bound non-affine accesses When deriving the range of valid values of a scalar evolution expression might be a range [12, 8), where the upper bound is smaller than the lower bound and where the range is expected to possibly wrap around. We theoretically could model such a range as a union of two non-wrapping ranges, but do not do this as of yet. Instead, we just do not derive any bounds. Before this change, we could have obtained bounds where the maximal possible value is strictly smaller than the minimal possible value, which is incorrect and also caused assertions during scop modeling. llvm-svn: 294891
2017-02-12 16:11:12 +08:00
; NONAFFINE: { Stmt_for_body[i0] -> MemRef_A[o0] };