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

38 lines
1.1 KiB
LLVM
Raw Normal View History

Clean up XFAILed test cases We had a set of test cases that have been incomplete and XFAILED. This patch completes a couple of the interesting ones and removes the ones which seem redundant or not sufficiently reduced to be useful. llvm-svn: 211670
2014-06-25 14:31:19 +08:00
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
; void f(int a[], int N) {
; int i;
; for (i = 0; i < N; ++i)
; a[i] = i;
; }
Add initial version of Polly This version is equivalent to commit ba26ebece8f5be84e9bd6315611d412af797147e in the old git repository. llvm-svn: 130476
2011-04-29 14:27:02 +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"
target triple = "x86_64-unknown-linux-gnu"
define void @f(i64* nocapture %a, i64 %N) nounwind {
entry:
Clean up XFAILed test cases We had a set of test cases that have been incomplete and XFAILED. This patch completes a couple of the interesting ones and removes the ones which seem redundant or not sufficiently reduced to be useful. llvm-svn: 211670
2014-06-25 14:31:19 +08:00
br label %bb
Add initial version of Polly This version is equivalent to commit ba26ebece8f5be84e9bd6315611d412af797147e in the old git repository. llvm-svn: 130476
2011-04-29 14:27:02 +08:00
bb: ; preds = %bb, %entry
Clean up XFAILed test cases We had a set of test cases that have been incomplete and XFAILED. This patch completes a couple of the interesting ones and removes the ones which seem redundant or not sufficiently reduced to be useful. llvm-svn: 211670
2014-06-25 14:31:19 +08:00
%i = phi i64 [ 0, %entry ], [ %i.inc, %bb ]
%scevgep = getelementptr i64* %a, i64 %i
store i64 %i, i64* %scevgep
%i.inc = add nsw i64 %i, 1
%exitcond = icmp eq i64 %i.inc, %N
Add initial version of Polly This version is equivalent to commit ba26ebece8f5be84e9bd6315611d412af797147e in the old git repository. llvm-svn: 130476
2011-04-29 14:27:02 +08:00
br i1 %exitcond, label %return, label %bb
return: ; preds = %bb, %entry
ret void
}
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
; CHECK: Assumed Context:
; CHECK: { : }
Clean up XFAILed test cases We had a set of test cases that have been incomplete and XFAILED. This patch completes a couple of the interesting ones and removes the ones which seem redundant or not sufficiently reduced to be useful. llvm-svn: 211670
2014-06-25 14:31:19 +08:00
; CHECK: Stmt_bb
; CHECK: Domain :=
; CHECK: [N] -> { Stmt_bb[i0] : i0 >= 0 and i0 <= -1 + N };
; CHECK: Scattering :=
[NFC] Drop the "scattering" tuple name llvm-svn: 227801
2015-02-02 21:45:54 +08:00
; CHECK: [N] -> { Stmt_bb[i0] -> [i0] };
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: MustWriteAccess := [Reduction Type: NONE]
Clean up XFAILed test cases We had a set of test cases that have been incomplete and XFAILED. This patch completes a couple of the interesting ones and removes the ones which seem redundant or not sufficiently reduced to be useful. llvm-svn: 211670
2014-06-25 14:31:19 +08:00
; CHECK: [N] -> { Stmt_bb[i0] -> MemRef_a[i0] };