forked from OSchip/llvm-project
47 lines
1.3 KiB
LLVM
47 lines
1.3 KiB
LLVM
; RUN: opt %loadPolly -polly-detect-unprofitable -polly-scops -analyze -polly-allow-unsigned < %s | FileCheck %s
|
|
|
|
; void f(int a[], int N, unsigned P) {
|
|
; int i;
|
|
; for (i = 0; i < N; ++i)
|
|
; if (P > 42)
|
|
; a[i] = 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"
|
|
|
|
define void @f(i64* nocapture %a, i64 %N, i64 %P) nounwind {
|
|
entry:
|
|
br label %bb
|
|
|
|
bb:
|
|
%i = phi i64 [ 0, %entry ], [ %i.inc, %bb.backedge ]
|
|
%brcond = icmp uge i64 %P, 42
|
|
br i1 %brcond, label %store, label %bb.backedge
|
|
|
|
store:
|
|
%scevgep = getelementptr i64, i64* %a, i64 %i
|
|
store i64 %i, i64* %scevgep
|
|
br label %bb.backedge
|
|
|
|
bb.backedge:
|
|
%i.inc = add nsw i64 %i, 1
|
|
%exitcond = icmp eq i64 %i.inc, %N
|
|
br i1 %exitcond, label %return, label %bb
|
|
|
|
return:
|
|
ret void
|
|
}
|
|
|
|
; CHECK: Assumed Context:
|
|
; CHECK: { : }
|
|
|
|
; CHECK: Stmt_store
|
|
; CHECK: Domain :=
|
|
; CHECK: [N, P] -> { Stmt_store[i0] :
|
|
; CHECK: i0 >= 0 and i0 <= -1 + N and P >= 42
|
|
; CHECK: };
|
|
; CHECK: Schedule :=
|
|
; CHECK: [N, P] -> { Stmt_store[i0] -> [i0] };
|
|
; CHECK: MustWriteAccess := [Reduction Type: NONE]
|
|
; CHECK: [N, P] -> { Stmt_store[i0] -> MemRef_a[i0] };
|