forked from OSchip/llvm-project
59 lines
1.9 KiB
LLVM
59 lines
1.9 KiB
LLVM
; RUN: opt %loadPolly -pass-remarks-analysis="polly-scops" -polly-scops -disable-output < %s 2>&1 | FileCheck %s
|
|
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s --check-prefix=SCOP
|
|
;
|
|
; CHECK: remark: <unknown>:0:0: SCoP begins here.
|
|
; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: { : }
|
|
; CHECK-NEXT: remark: <unknown>:0:0: SCoP ends here.
|
|
|
|
; SCOP: Context:
|
|
; SCOP-NEXT: [N, M] -> { : -2147483648 <= N <= 2147483647 and -2147483648 <= M <= 2147483647 }
|
|
; SCOP: Assumed Context:
|
|
; SCOP-NEXT: [N, M] -> { : }
|
|
; SCOP: Invalid Context:
|
|
; SCOP-NEXT: [N, M] -> { : 1 = 0 }
|
|
;
|
|
;
|
|
; This test checks that assumptions over parameters not used in the Scop are
|
|
; not modeled. There is no benefit in knowing about parameters that are
|
|
; unused in the scop, and adding them will increase the complexity of our
|
|
; model.
|
|
;
|
|
; int f(int *A, int N, int M) {
|
|
; __builtin_assume(M > 0);
|
|
; for (int i = 0; i < N; i++)
|
|
; A[i]++;
|
|
; return M;
|
|
; }
|
|
;
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
|
|
define i32 @f(i32* %A, i32 %N, i32 %M) {
|
|
entry:
|
|
%cmp = icmp sgt i32 %M, 0
|
|
call void @llvm.assume(i1 %cmp)
|
|
%tmp = sext i32 %N to i64
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.inc, %entry
|
|
%indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %entry ]
|
|
%cmp1 = icmp slt i64 %indvars.iv, %tmp
|
|
br i1 %cmp1, label %for.body, label %for.end
|
|
|
|
for.body: ; preds = %for.cond
|
|
%arrayidx = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
|
|
%tmp1 = load i32, i32* %arrayidx, align 4
|
|
%inc = add nsw i32 %tmp1, 1
|
|
store i32 %inc, i32* %arrayidx, align 4
|
|
br label %for.inc
|
|
|
|
for.inc: ; preds = %for.body
|
|
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
|
|
br label %for.cond
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret i32 %M
|
|
}
|
|
|
|
declare void @llvm.assume(i1) #1
|
|
|