1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
; RUN: opt %loadNPMPolly -pass-remarks-analysis="polly-scops" '-passes=print<polly-function-scops>' -disable-output < %s 2>&1 | FileCheck %s
; RUN: opt %loadNPMPolly '-passes=print<polly-function-scops>' -disable-output < %s 2>&1 | FileCheck %s --check-prefix=SCOP
;
; CHECK: remark: <unknown>:0:0: SCoP begins here.
; CHECK-NEXT: remark: <unknown>:0:0: Use user assumption: [N] -> { : N >= 2 }
; CHECK-NEXT: remark: <unknown>:0:0: SCoP ends here.
; SCOP: Context:
; SCOP-NEXT: [N, M] -> { : 2 <= N <= 2147483647 and -2147483648 <= M <= 2147483647 }
; SCOP: Assumed Context:
; SCOP-NEXT: [N, M] -> { : }
; SCOP: Invalid Context:
; SCOP-NEXT: [N, M] -> { : false }
;
; int f(int *A, int N, int M) {
; __builtin_assume(M > 0 && N > M);
; 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(ptr %A, i32 %N, i32 %M) {
entry:
%cmp = icmp sgt i32 %M, 0
%cmp1 = icmp sgt i32 %N, %M
%and = and i1 %cmp, %cmp1
call void @llvm.assume(i1 %and)
%tmp1 = sext i32 %N to i64
br label %for.cond
for.cond: ; preds = %for.inc, %land.end
%indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %entry ]
%cmp2 = icmp slt i64 %indvars.iv, %tmp1
br i1 %cmp2, label %for.body, label %for.end
for.body: ; preds = %for.cond
%arrayidx = getelementptr inbounds i32, ptr %A, i64 %indvars.iv
%tmp2 = load i32, ptr %arrayidx, align 4
%inc = add nsw i32 %tmp2, 1
store i32 %inc, ptr %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
|
