maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/Isl/CodeGen/run-time-condition-with-sce...

28 lines
931 B
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-codegen -S -polly-delinearize < %s | FileCheck %s
Derive run-time conditions for delinearization As our delinearization works optimistically, we need in some cases run-time checks that verify our optimistic assumptions. A simple example is the following code: void foo(long n, long m, long o, double A[n][m][o]) { for (long i = 0; i < 100; i++) for (long j = 0; j < 150; j++) for (long k = 0; k < 200; k++) A[i][j][k] = 1.0; } After clang linearized the access to A and we delinearized it again to A[i][j][k] we need to ensure that we do not access the delinearized array out of bounds (this information is not available in LLVM-IR). Hence, we need to verify the following constraints at run-time: CHECK: Assumed Context: CHECK: [o, m] -> { : m >= 150 and o >= 200 } llvm-svn: 212198
2014-07-03 01:47:48 +08:00
Use isl_ast_expr_call to create run-time checks isl recently introduced a new interface to create run-time checks from constraint sets. Use this interface to simplify our run-time check generation. llvm-svn: 230640
2015-02-26 23:21:10 +08:00
; CHECK: polly.split_new_and_old:
Code generate parameters and run-time checks after branching new code region When creating parameters the SCEVexpander may introduce new induction variables, that possibly create scalar dependences in the original scop, before we code generate the scop. The resulting scalar dependences may then inhibit correct code generation of the scop. To prevent this, we first version the code without a run-time check and only then introduce new parameters and the run-time condition. The if-condition that guards the original scop from being modified by the SCEVexpander. This change causes some test case changes as the run-time conditions are now introduced in the split basic block rather than in the entry basic block. This fixes http://llvm.org/PR22069 Test case reduced by: Karthik Senthil llvm-svn: 233477
2015-03-28 17:34:40 +08:00
; CHECK-NEXT: %1 = zext i32 %n to i64
; CHECK-NEXT: %2 = icmp sge i64 %1, 1
Use isl_ast_expr_call to create run-time checks isl recently introduced a new interface to create run-time checks from constraint sets. Use this interface to simplify our run-time check generation. llvm-svn: 230640
2015-02-26 23:21:10 +08:00
; CHECK-NEXT: br i1 %2, label %polly.start, label %for.body4
Derive run-time conditions for delinearization As our delinearization works optimistically, we need in some cases run-time checks that verify our optimistic assumptions. A simple example is the following code: void foo(long n, long m, long o, double A[n][m][o]) { for (long i = 0; i < 100; i++) for (long j = 0; j < 150; j++) for (long k = 0; k < 200; k++) A[i][j][k] = 1.0; } After clang linearized the access to A and we delinearized it again to A[i][j][k] we need to ensure that we do not access the delinearized array out of bounds (this information is not available in LLVM-IR). Hence, we need to verify the following constraints at run-time: CHECK: Assumed Context: CHECK: [o, m] -> { : m >= 150 and o >= 200 } llvm-svn: 212198
2014-07-03 01:47:48 +08:00
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @init_array(i32 %n, double* %data) {
entry:
%0 = zext i32 %n to i64
br label %for.body4
for.body4: ; preds = %for.body4, %entry
%indvar1 = phi i64 [ %indvar.next2, %for.body4 ], [ 0, %entry ]
%.moved.to.for.body4 = mul i64 %0, %indvar1
%1 = add i64 %.moved.to.for.body4, 0
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx7 = getelementptr double, double* %data, i64 %1
Derive run-time conditions for delinearization As our delinearization works optimistically, we need in some cases run-time checks that verify our optimistic assumptions. A simple example is the following code: void foo(long n, long m, long o, double A[n][m][o]) { for (long i = 0; i < 100; i++) for (long j = 0; j < 150; j++) for (long k = 0; k < 200; k++) A[i][j][k] = 1.0; } After clang linearized the access to A and we delinearized it again to A[i][j][k] we need to ensure that we do not access the delinearized array out of bounds (this information is not available in LLVM-IR). Hence, we need to verify the following constraints at run-time: CHECK: Assumed Context: CHECK: [o, m] -> { : m >= 150 and o >= 200 } llvm-svn: 212198
2014-07-03 01:47:48 +08:00
store double undef, double* %arrayidx7, align 8
%indvar.next2 = add i64 %indvar1, 1
br i1 false, label %for.body4, label %for.end10
for.end10: ; preds = %for.body4
ret void
}