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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
; RUN: opt < %s -disable-output -passes="print<scalar-evolution>" \
; RUN: -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s
define void @implied1(i32 %n) {
; Prove that (n s> 1) ===> (n - 1 s> 0).
; CHECK-LABEL: 'implied1'
; CHECK-NEXT: Determining loop execution counts for: @implied1
; CHECK-NEXT: Loop %header: backedge-taken count is (-2 + %n)
; CHECK-NEXT: Loop %header: constant max backedge-taken count is i32 2147483645
; CHECK-NEXT: Loop %header: symbolic max backedge-taken count is (-2 + %n)
; CHECK-NEXT: Loop %header: Trip multiple is 1
;
entry:
%cmp1 = icmp sgt i32 %n, 1
%n.minus.1 = sub nsw i32 %n, 1
call void @llvm.assume(i1 %cmp1)
br label %header
header:
%indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ]
%indvar.next = add i32 %indvar, 1
%exitcond = icmp sgt i32 %n.minus.1, %indvar.next
br i1 %exitcond, label %header, label %exit
exit:
ret void
}
define void @implied1_neg(i32 %n) {
; Prove that (n s> 0) =\=> (n - 1 s> 0).
; CHECK-LABEL: 'implied1_neg'
; CHECK-NEXT: Determining loop execution counts for: @implied1_neg
; CHECK-NEXT: Loop %header: backedge-taken count is (-1 + (1 smax (-1 + %n)<nsw>))<nsw>
; CHECK-NEXT: Loop %header: constant max backedge-taken count is i32 2147483645
; CHECK-NEXT: Loop %header: symbolic max backedge-taken count is (-1 + (1 smax (-1 + %n)<nsw>))<nsw>
; CHECK-NEXT: Loop %header: Trip multiple is 1
;
entry:
%cmp1 = icmp sgt i32 %n, 0
%n.minus.1 = sub nsw i32 %n, 1
call void @llvm.assume(i1 %cmp1)
br label %header
header:
%indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ]
%indvar.next = add i32 %indvar, 1
%exitcond = icmp sgt i32 %n.minus.1, %indvar.next
br i1 %exitcond, label %header, label %exit
exit:
ret void
}
define void @implied2(i32 %n) {
; Prove that (n u>= -1) ===> (n + 1 u>= 0).
; CHECK-LABEL: 'implied2'
; CHECK-NEXT: Determining loop execution counts for: @implied2
; CHECK-NEXT: Loop %header: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %header: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %header: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %header: Predicated backedge-taken count is (1 + (zext i32 %n to i64))<nuw><nsw>
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {1,+,1}<%header> Added Flags: <nusw>
; CHECK-NEXT: Loop %header: Predicated constant max backedge-taken count is i64 4294967296
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {1,+,1}<%header> Added Flags: <nusw>
; CHECK-NEXT: Loop %header: Predicated symbolic max backedge-taken count is (1 + (zext i32 %n to i64))<nuw><nsw>
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {1,+,1}<%header> Added Flags: <nusw>
;
entry:
%cmp1 = icmp uge i32 %n, -1
%n.1 = add nuw i32 %n, 1
call void @llvm.assume(i1 %cmp1)
br label %header
header:
%indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ]
%indvar.next = add i32 %indvar, 1
%exitcond = icmp uge i32 %n.1, %indvar.next
br i1 %exitcond, label %header, label %exit
exit:
ret void
}
define void @implied2_neg(i32 %n) {
; Prove that (n u>= -1) =\=> (n - 1 s>= 0).
; CHECK-LABEL: 'implied2_neg'
; CHECK-NEXT: Determining loop execution counts for: @implied2_neg
; CHECK-NEXT: Loop %header: backedge-taken count is (-1 + (1 smax %n))<nsw>
; CHECK-NEXT: Loop %header: constant max backedge-taken count is i32 2147483646
; CHECK-NEXT: Loop %header: symbolic max backedge-taken count is (-1 + (1 smax %n))<nsw>
; CHECK-NEXT: Loop %header: Trip multiple is 1
;
entry:
%cmp1 = icmp uge i32 %n, -1
%n.minus.1 = sub nuw nsw i32 %n, 1
call void @llvm.assume(i1 %cmp1)
br label %header
header:
%indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ]
%indvar.next = add i32 %indvar, 1
%exitcond = icmp sge i32 %n.minus.1, %indvar.next
br i1 %exitcond, label %header, label %exit
exit:
ret void
}
|
