forked from OSchip/llvm-project
54 lines
1.8 KiB
LLVM
54 lines
1.8 KiB
LLVM
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
|
|
;
|
|
; CHECK: Assumed Context:
|
|
; CHECK-NEXT: [N] -> { : }
|
|
; CHECK-NEXT: Invalid Context:
|
|
; CHECK-NEXT: [N] -> { : N >= 4294967297 }
|
|
; CHECK-NEXT: p0: %N
|
|
; CHECK: Statements {
|
|
; CHECK-NEXT: Stmt_for_body
|
|
; CHECK-NEXT: Domain :=
|
|
; CHECK-NEXT: [N] -> { Stmt_for_body[i0] : 0 <= i0 < N };
|
|
; CHECK-NEXT: Schedule :=
|
|
; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> [i0] };
|
|
; CHECK-NEXT: ReadAccess := [Reduction Type: +] [Scalar: 0]
|
|
; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: +] [Scalar: 0]
|
|
; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[i0] };
|
|
; CHECK-NEXT: }
|
|
;
|
|
; void f(long *A, long N) {
|
|
; long K = /* 2^32 */ 4294967296;
|
|
; for (long i = 0; i < N; i++) {
|
|
; A[i % K]++;
|
|
; }
|
|
; }
|
|
;
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
|
|
define void @f(i64* %A, i64 %N) {
|
|
entry:
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.inc, %entry
|
|
%i.0 = phi i64 [ 0, %entry ], [ %inc1, %for.inc ]
|
|
%cmp = icmp slt i64 %i.0, %N
|
|
br i1 %cmp, label %for.body, label %for.end
|
|
|
|
for.body: ; preds = %for.cond
|
|
%i.t = trunc i64 %i.0 to i33
|
|
%rem = zext i33 %i.t to i64
|
|
%arrayidx = getelementptr inbounds i64, i64* %A, i64 %rem
|
|
%tmp = load i64, i64* %arrayidx, align 4
|
|
%inc = add nsw i64 %tmp, 1
|
|
store i64 %inc, i64* %arrayidx, align 4
|
|
br label %for.inc
|
|
|
|
for.inc: ; preds = %for.body
|
|
%inc1 = add nuw nsw i64 %i.0, 1
|
|
br label %for.cond
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret void
|
|
}
|