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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt -indvars -S < %s | FileCheck %s
; RUN: opt -passes=indvars -S < %s | FileCheck %s
; Monotonic decrementing iv. we should be able to prove that %iv.next <s len
; basing on its nsw and the fact that its starting value <s len.
define i32 @test_01(i32* %p) {
; CHECK-LABEL: @test_01(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[LEN:%.*]] = load i32, i32* [[P:%.*]], align 4, [[RNG0:!range !.*]]
; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop:
; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[LEN]], [[ENTRY:%.*]] ], [ [[IV_NEXT:%.*]], [[BACKEDGE:%.*]] ]
; CHECK-NEXT: [[IV_NEXT]] = add nsw i32 [[IV]], -1
; CHECK-NEXT: br i1 true, label [[BACKEDGE]], label [[FAIL:%.*]]
; CHECK: backedge:
; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ne i32 [[IV]], 0
; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[EXIT:%.*]]
; CHECK: fail:
; CHECK-NEXT: ret i32 -1
; CHECK: exit:
; CHECK-NEXT: ret i32 0
;
entry:
%len = load i32, i32* %p, !range !0
br label %loop
loop:
%iv = phi i32 [%len, %entry], [%iv.next, %backedge]
%iv.next = add i32 %iv, -1
%rc = icmp slt i32 %iv.next, %len
br i1 %rc, label %backedge, label %fail
backedge:
%loop.cond = icmp ne i32 %iv, 0
br i1 %loop.cond, label %loop, label %exit
fail:
ret i32 -1
exit:
ret i32 0
}
; We should not remove this range check because signed overflow is possible here (start at len = 0).
define i32 @test_01_neg(i32* %p) {
; CHECK-LABEL: @test_01_neg(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[LEN:%.*]] = load i32, i32* [[P:%.*]], align 4, [[RNG0]]
; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop:
; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[LEN]], [[ENTRY:%.*]] ], [ [[IV_NEXT:%.*]], [[BACKEDGE:%.*]] ]
; CHECK-NEXT: [[IV_NEXT]] = add i32 [[IV]], -1
; CHECK-NEXT: [[RC:%.*]] = icmp slt i32 [[IV_NEXT]], [[LEN]]
; CHECK-NEXT: br i1 [[RC]], label [[BACKEDGE]], label [[FAIL:%.*]]
; CHECK: backedge:
; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ne i32 [[IV]], 1
; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[EXIT:%.*]]
; CHECK: fail:
; CHECK-NEXT: ret i32 -1
; CHECK: exit:
; CHECK-NEXT: ret i32 0
;
entry:
%len = load i32, i32* %p, !range !0
br label %loop
loop:
%iv = phi i32 [%len, %entry], [%iv.next, %backedge]
%iv.next = add i32 %iv, -1
%rc = icmp slt i32 %iv.next, %len
br i1 %rc, label %backedge, label %fail
backedge:
%loop.cond = icmp ne i32 %iv, 1
br i1 %loop.cond, label %loop, label %exit
fail:
ret i32 -1
exit:
ret i32 0
}
; Monotonic incrementing iv. we should be able to prove that %iv.next >s len
; basing on its nsw and the fact that its starting value >s len.
define i32 @test_02(i32* %p) {
; CHECK-LABEL: @test_02(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[LEN:%.*]] = load i32, i32* [[P:%.*]], align 4, [[RNG1:!range !.*]]
; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop:
; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[LEN]], [[ENTRY:%.*]] ], [ [[IV_NEXT:%.*]], [[BACKEDGE:%.*]] ]
; CHECK-NEXT: [[IV_NEXT]] = add i32 [[IV]], 1
; CHECK-NEXT: br i1 true, label [[BACKEDGE]], label [[FAIL:%.*]]
; CHECK: backedge:
; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ne i32 [[IV]], 0
; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[EXIT:%.*]]
; CHECK: fail:
; CHECK-NEXT: ret i32 -1
; CHECK: exit:
; CHECK-NEXT: ret i32 0
;
entry:
%len = load i32, i32* %p, !range !1
br label %loop
loop:
%iv = phi i32 [%len, %entry], [%iv.next, %backedge]
%iv.next = add i32 %iv, 1
%rc = icmp sgt i32 %iv.next, %len
br i1 %rc, label %backedge, label %fail
backedge:
%loop.cond = icmp ne i32 %iv, 0
br i1 %loop.cond, label %loop, label %exit
fail:
ret i32 -1
exit:
ret i32 0
}
; We should not remove this range check because signed overflow is possible here (start at len = -1).
define i32 @test_02_neg(i32* %p) {
; CHECK-LABEL: @test_02_neg(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[LEN:%.*]] = load i32, i32* [[P:%.*]], align 4, [[RNG1]]
; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop:
; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[LEN]], [[ENTRY:%.*]] ], [ [[IV_NEXT:%.*]], [[BACKEDGE:%.*]] ]
; CHECK-NEXT: [[IV_NEXT]] = add i32 [[IV]], 1
; CHECK-NEXT: [[RC:%.*]] = icmp sgt i32 [[IV_NEXT]], [[LEN]]
; CHECK-NEXT: br i1 [[RC]], label [[BACKEDGE]], label [[FAIL:%.*]]
; CHECK: backedge:
; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ne i32 [[IV]], -2
; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[EXIT:%.*]]
; CHECK: fail:
; CHECK-NEXT: ret i32 -1
; CHECK: exit:
; CHECK-NEXT: ret i32 0
;
entry:
%len = load i32, i32* %p, !range !1
br label %loop
loop:
%iv = phi i32 [%len, %entry], [%iv.next, %backedge]
%iv.next = add i32 %iv, 1
%rc = icmp sgt i32 %iv.next, %len
br i1 %rc, label %backedge, label %fail
backedge:
%loop.cond = icmp ne i32 %iv, -2
br i1 %loop.cond, label %loop, label %exit
fail:
ret i32 -1
exit:
ret i32 0
}
define i32 @test_03(i32* %p) {
; CHECK-LABEL: @test_03(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[LEN:%.*]] = load i32, i32* [[P:%.*]], align 4, [[RNG2:!range !.*]]
; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop:
; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[LEN]], [[ENTRY:%.*]] ], [ [[IV_NEXT:%.*]], [[BACKEDGE:%.*]] ]
; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1
; CHECK-NEXT: br i1 true, label [[BACKEDGE]], label [[FAIL:%.*]]
; CHECK: backedge:
; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ne i32 [[IV]], 1000
; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[EXIT:%.*]]
; CHECK: fail:
; CHECK-NEXT: ret i32 -1
; CHECK: exit:
; CHECK-NEXT: ret i32 0
;
entry:
%len = load i32, i32* %p, !range !2
br label %loop
loop:
%iv = phi i32 [%len, %entry], [%iv.next, %backedge]
%iv.next = add i32 %iv, 1
%rc = icmp sgt i32 %iv.next, %len
br i1 %rc, label %backedge, label %fail
backedge:
%loop.cond = icmp ne i32 %iv, 1000
br i1 %loop.cond, label %loop, label %exit
fail:
ret i32 -1
exit:
ret i32 0
}
define i32 @test_04(i32* %p) {
; CHECK-LABEL: @test_04(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[LEN:%.*]] = load i32, i32* [[P:%.*]], align 4, [[RNG2]]
; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop:
; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[LEN]], [[ENTRY:%.*]] ], [ [[IV_NEXT:%.*]], [[BACKEDGE:%.*]] ]
; CHECK-NEXT: [[IV_NEXT]] = add nsw i32 [[IV]], -1
; CHECK-NEXT: br i1 true, label [[BACKEDGE]], label [[FAIL:%.*]]
; CHECK: backedge:
; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ne i32 [[IV]], 0
; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[EXIT:%.*]]
; CHECK: fail:
; CHECK-NEXT: ret i32 -1
; CHECK: exit:
; CHECK-NEXT: ret i32 0
;
entry:
%len = load i32, i32* %p, !range !2
br label %loop
loop:
%iv = phi i32 [%len, %entry], [%iv.next, %backedge]
%iv.next = add i32 %iv, -1
%rc = icmp slt i32 %iv.next, %len
br i1 %rc, label %backedge, label %fail
backedge:
%loop.cond = icmp ne i32 %iv, 0
br i1 %loop.cond, label %loop, label %exit
fail:
ret i32 -1
exit:
ret i32 0
}
!0 = !{i32 0, i32 2147483647}
!1 = !{i32 -2147483648, i32 0}
!2 = !{i32 0, i32 1000}
|
