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

64 lines
2.9 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
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
;void f(long a[][128], long N, long M) {
; long i, j;
; for (j = 0; j < (4*N + 7*M +3); ++j)
; for (i = j; i < (5*N + 2); ++i)
; ...
;}
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([128 x i64]* nocapture %a, i64 %N, i64 %M) nounwind {
entry:
%0 = shl i64 %N, 2 ; <i64> [#uses=2]
%1 = mul i64 %M, 7 ; <i64> [#uses=2]
%2 = or i64 %0, 3 ; <i64> [#uses=1]
%3 = add nsw i64 %2, %1 ; <i64> [#uses=1]
%4 = icmp sgt i64 %3, 0 ; <i1> [#uses=1]
br i1 %4, label %bb.nph8, label %return
bb1: ; preds = %bb2.preheader, %bb1
%indvar = phi i64 [ 0, %bb2.preheader ], [ %indvar.next, %bb1 ] ; <i64> [#uses=2]
%scevgep = getelementptr [128 x i64]* %a, i64 %indvar, i64 %tmp10 ; <i64*> [#uses=1]
store i64 0, i64* %scevgep, align 8
%indvar.next = add i64 %indvar, 1 ; <i64> [#uses=2]
%exitcond = icmp eq i64 %indvar.next, %tmp9 ; <i1> [#uses=1]
br i1 %exitcond, label %bb3, label %bb1
bb3: ; preds = %bb2.preheader, %bb1
%5 = add i64 %8, 1 ; <i64> [#uses=2]
%exitcond14 = icmp eq i64 %5, %tmp13 ; <i1> [#uses=1]
br i1 %exitcond14, label %return, label %bb2.preheader
bb.nph8: ; preds = %entry
%6 = mul i64 %N, 5 ; <i64> [#uses=1]
%7 = add nsw i64 %6, 2 ; <i64> [#uses=2]
%tmp12 = add i64 %1, %0 ; <i64> [#uses=1]
%tmp13 = add i64 %tmp12, 3 ; <i64> [#uses=1]
br label %bb2.preheader
bb2.preheader: ; preds = %bb.nph8, %bb3
%8 = phi i64 [ 0, %bb.nph8 ], [ %5, %bb3 ] ; <i64> [#uses=4]
%tmp10 = mul i64 %8, 129 ; <i64> [#uses=1]
%tmp9 = sub i64 %7, %8 ; <i64> [#uses=1]
%9 = icmp sgt i64 %7, %8 ; <i1> [#uses=1]
br i1 %9, label %bb1, label %bb3
return: ; preds = %bb3, %entry
ret void
}
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: p0: %N
; CHECK: p1: %M
; CHECK: Statements {
; CHECK: Stmt_bb1
; CHECK: Domain :=
; CHECK: [N, M] -> { Stmt_bb1[i0, i1] : i0 >= 0 and i0 <= 2 + 4N + 7M and i1 >= 0 and i1 <= 1 + 5N - i0 and i0 <= 1 + 5N };
; CHECK: Scattering :=
; CHECK: [N, M] -> { Stmt_bb1[i0, i1] -> scattering[0, i0, 0, i1, 0] };
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, M] -> { Stmt_bb1[i0, i1] -> MemRef_a[129i0 + 128i1] };
; CHECK: }