blob: ce2bb799c813a0efc2407f634f83c04e327999bd [file] [log] [blame]
Duncan Sands8fb2c382011-01-20 13:21:55 +00001; RUN: opt < %s -instsimplify -S | FileCheck %s
2target datalayout = "p:32:32"
3
4define i1 @ptrtoint() {
5; CHECK: @ptrtoint
6 %a = alloca i8
7 %tmp = ptrtoint i8* %a to i32
8 %r = icmp eq i32 %tmp, 0
9 ret i1 %r
10; CHECK: ret i1 false
11}
12
Benjamin Kramerea51f622012-02-16 13:49:39 +000013define i1 @bitcast() {
14; CHECK: @bitcast
15 %a = alloca i32
16 %b = alloca i64
17 %x = bitcast i32* %a to i8*
18 %y = bitcast i64* %b to i8*
19 %cmp = icmp eq i8* %x, %y
20 ret i1 %cmp
21; CHECK-NEXT: ret i1 false
22}
23
24define i1 @gep() {
25; CHECK: @gep
26 %a = alloca [3 x i8], align 8
27 %x = getelementptr inbounds [3 x i8]* %a, i32 0, i32 0
28 %cmp = icmp eq i8* %x, null
29 ret i1 %cmp
30; CHECK-NEXT: ret i1 false
31}
32
Eli Friedman952d1f92012-02-18 03:29:25 +000033define i1 @gep2() {
34; CHECK: @gep2
35 %a = alloca [3 x i8], align 8
36 %x = getelementptr inbounds [3 x i8]* %a, i32 0, i32 0
37 %y = getelementptr inbounds [3 x i8]* %a, i32 0, i32 0
38 %cmp = icmp eq i8* %x, %y
39 ret i1 %cmp
40; CHECK-NEXT: ret i1 true
41}
42
Nick Lewycky3db143e2012-02-26 02:09:49 +000043; PR11238
44%gept = type { i32, i32 }
45@gepy = global %gept zeroinitializer, align 8
46@gepz = extern_weak global %gept
47
48define i1 @gep3() {
49; CHECK: @gep3
50 %x = alloca %gept, align 8
51 %a = getelementptr %gept* %x, i64 0, i32 0
52 %b = getelementptr %gept* %x, i64 0, i32 1
53 %equal = icmp eq i32* %a, %b
54 ret i1 %equal
55; CHECK-NEXT: ret i1 false
56}
57
58define i1 @gep4() {
59; CHECK: @gep4
60 %x = alloca %gept, align 8
61 %a = getelementptr %gept* @gepy, i64 0, i32 0
62 %b = getelementptr %gept* @gepy, i64 0, i32 1
63 %equal = icmp eq i32* %a, %b
64 ret i1 %equal
65; CHECK-NEXT: ret i1 false
66}
67
68define i1 @gep5() {
69; CHECK: @gep5
70 %x = alloca %gept, align 8
71 %a = getelementptr inbounds %gept* %x, i64 0, i32 1
72 %b = getelementptr %gept* @gepy, i64 0, i32 0
73 %equal = icmp eq i32* %a, %b
74 ret i1 %equal
75; CHECK-NEXT: ret i1 false
76}
77
78define i1 @gep6(%gept* %x) {
79; Same as @gep3 but potentially null.
80; CHECK: @gep6
81 %a = getelementptr %gept* %x, i64 0, i32 0
82 %b = getelementptr %gept* %x, i64 0, i32 1
83 %equal = icmp eq i32* %a, %b
84 ret i1 %equal
85; CHECK-NEXT: ret i1 false
86}
87
88define i1 @gep7(%gept* %x) {
89; CHECK: @gep7
90 %a = getelementptr %gept* %x, i64 0, i32 0
91 %b = getelementptr %gept* @gepz, i64 0, i32 0
92 %equal = icmp eq i32* %a, %b
93 ret i1 %equal
94; CHECK: ret i1 %equal
95}
96
97define i1 @gep8(%gept* %x) {
98; CHECK: @gep8
99 %a = getelementptr %gept* %x, i32 1
100 %b = getelementptr %gept* %x, i32 -1
101 %equal = icmp ugt %gept* %a, %b
102 ret i1 %equal
103; CHECK: ret i1 %equal
104}
105
Chandler Carruth8059c842012-03-25 21:28:14 +0000106define i1 @gep9(i8* %ptr) {
107; CHECK: @gep9
108; CHECK-NOT: ret
109; CHECK: ret i1 true
110
111entry:
112 %first1 = getelementptr inbounds i8* %ptr, i32 0
113 %first2 = getelementptr inbounds i8* %first1, i32 1
114 %first3 = getelementptr inbounds i8* %first2, i32 2
115 %first4 = getelementptr inbounds i8* %first3, i32 4
116 %last1 = getelementptr inbounds i8* %first2, i32 48
117 %last2 = getelementptr inbounds i8* %last1, i32 8
118 %last3 = getelementptr inbounds i8* %last2, i32 -4
119 %last4 = getelementptr inbounds i8* %last3, i32 -4
120 %first.int = ptrtoint i8* %first4 to i32
121 %last.int = ptrtoint i8* %last4 to i32
122 %cmp = icmp ne i32 %last.int, %first.int
123 ret i1 %cmp
124}
125
126define i1 @gep10(i8* %ptr) {
127; CHECK: @gep10
128; CHECK-NOT: ret
129; CHECK: ret i1 true
130
131entry:
132 %first1 = getelementptr inbounds i8* %ptr, i32 -2
133 %first2 = getelementptr inbounds i8* %first1, i32 44
134 %last1 = getelementptr inbounds i8* %ptr, i32 48
135 %last2 = getelementptr inbounds i8* %last1, i32 -6
136 %first.int = ptrtoint i8* %first2 to i32
137 %last.int = ptrtoint i8* %last2 to i32
138 %cmp = icmp eq i32 %last.int, %first.int
139 ret i1 %cmp
140}
141
142define i1 @gep11(i8* %ptr) {
143; CHECK: @gep11
144; CHECK-NOT: ret
145; CHECK: ret i1 true
146
147entry:
148 %first1 = getelementptr inbounds i8* %ptr, i32 -2
149 %last1 = getelementptr inbounds i8* %ptr, i32 48
150 %last2 = getelementptr inbounds i8* %last1, i32 -6
151 %cmp = icmp ult i8* %first1, %last2
152 ret i1 %cmp
153}
154
155define i1 @gep12(i8* %ptr) {
156; CHECK: @gep12
157; CHECK-NOT: ret
158; CHECK: ret i1 %cmp
159
160entry:
161 %first1 = getelementptr inbounds i8* %ptr, i32 -2
162 %last1 = getelementptr inbounds i8* %ptr, i32 48
163 %last2 = getelementptr inbounds i8* %last1, i32 -6
164 %cmp = icmp slt i8* %first1, %last2
165 ret i1 %cmp
166}
167
Duncan Sands8fb2c382011-01-20 13:21:55 +0000168define i1 @zext(i32 %x) {
169; CHECK: @zext
170 %e1 = zext i32 %x to i64
171 %e2 = zext i32 %x to i64
172 %r = icmp eq i64 %e1, %e2
173 ret i1 %r
174; CHECK: ret i1 true
175}
176
177define i1 @zext2(i1 %x) {
178; CHECK: @zext2
179 %e = zext i1 %x to i32
180 %c = icmp ne i32 %e, 0
181 ret i1 %c
182; CHECK: ret i1 %x
183}
184
Duncan Sandsd3951082011-01-25 09:38:29 +0000185define i1 @zext3() {
186; CHECK: @zext3
187 %e = zext i1 1 to i32
188 %c = icmp ne i32 %e, 0
189 ret i1 %c
190; CHECK: ret i1 true
191}
192
Duncan Sands8fb2c382011-01-20 13:21:55 +0000193define i1 @sext(i32 %x) {
194; CHECK: @sext
195 %e1 = sext i32 %x to i64
196 %e2 = sext i32 %x to i64
197 %r = icmp eq i64 %e1, %e2
198 ret i1 %r
199; CHECK: ret i1 true
200}
201
202define i1 @sext2(i1 %x) {
203; CHECK: @sext2
204 %e = sext i1 %x to i32
205 %c = icmp ne i32 %e, 0
206 ret i1 %c
207; CHECK: ret i1 %x
208}
Duncan Sandsd3951082011-01-25 09:38:29 +0000209
210define i1 @sext3() {
211; CHECK: @sext3
212 %e = sext i1 1 to i32
213 %c = icmp ne i32 %e, 0
214 ret i1 %c
215; CHECK: ret i1 true
216}
217
218define i1 @add(i32 %x, i32 %y) {
Duncan Sands9e9d5b22011-01-25 15:14:15 +0000219; CHECK: @add
Duncan Sandsd3951082011-01-25 09:38:29 +0000220 %l = lshr i32 %x, 1
Duncan Sands9e9d5b22011-01-25 15:14:15 +0000221 %q = lshr i32 %y, 1
222 %r = or i32 %q, 1
Duncan Sandsd3951082011-01-25 09:38:29 +0000223 %s = add i32 %l, %r
224 %c = icmp eq i32 %s, 0
225 ret i1 %c
Duncan Sands9e9d5b22011-01-25 15:14:15 +0000226; CHECK: ret i1 false
Duncan Sandsd3951082011-01-25 09:38:29 +0000227}
228
229define i1 @add2(i8 %x, i8 %y) {
230; CHECK: @add2
231 %l = or i8 %x, 128
232 %r = or i8 %y, 129
233 %s = add i8 %l, %r
234 %c = icmp eq i8 %s, 0
235 ret i1 %c
236; CHECK: ret i1 false
237}
238
Duncan Sands9e9d5b22011-01-25 15:14:15 +0000239define i1 @add3(i8 %x, i8 %y) {
240; CHECK: @add3
241 %l = zext i8 %x to i32
242 %r = zext i8 %y to i32
243 %s = add i32 %l, %r
244 %c = icmp eq i32 %s, 0
245 ret i1 %c
246; CHECK: ret i1 %c
247}
248
Duncan Sandsd114ab32011-02-13 17:15:40 +0000249define i1 @add4(i32 %x, i32 %y) {
250; CHECK: @add4
251 %z = add nsw i32 %y, 1
252 %s1 = add nsw i32 %x, %y
253 %s2 = add nsw i32 %x, %z
254 %c = icmp slt i32 %s1, %s2
255 ret i1 %c
256; CHECK: ret i1 true
257}
258
259define i1 @add5(i32 %x, i32 %y) {
260; CHECK: @add5
261 %z = add nuw i32 %y, 1
262 %s1 = add nuw i32 %x, %z
263 %s2 = add nuw i32 %x, %y
264 %c = icmp ugt i32 %s1, %s2
265 ret i1 %c
266; CHECK: ret i1 true
267}
268
Duncan Sandsc41076c2012-11-16 19:41:26 +0000269define i1 @add6(i64 %A, i64 %B) {
270; CHECK: @add6
271 %s1 = add i64 %A, %B
272 %s2 = add i64 %B, %A
273 %cmp = icmp eq i64 %s1, %s2
274 ret i1 %cmp
275; CHECK: ret i1 true
276}
277
Duncan Sandsd3951082011-01-25 09:38:29 +0000278define i1 @addpowtwo(i32 %x, i32 %y) {
279; CHECK: @addpowtwo
280 %l = lshr i32 %x, 1
281 %r = shl i32 1, %y
282 %s = add i32 %l, %r
283 %c = icmp eq i32 %s, 0
284 ret i1 %c
285; CHECK: ret i1 false
286}
287
288define i1 @or(i32 %x) {
289; CHECK: @or
290 %o = or i32 %x, 1
291 %c = icmp eq i32 %o, 0
292 ret i1 %c
293; CHECK: ret i1 false
294}
Duncan Sands2e9e4f12011-01-29 13:27:00 +0000295
296define i1 @shl(i32 %x) {
297; CHECK: @shl
298 %s = shl i32 1, %x
299 %c = icmp eq i32 %s, 0
300 ret i1 %c
301; CHECK: ret i1 false
302}
303
Nick Lewycky3cec6f52011-03-04 07:00:57 +0000304define i1 @lshr1(i32 %x) {
305; CHECK: @lshr1
Duncan Sands2e9e4f12011-01-29 13:27:00 +0000306 %s = lshr i32 -1, %x
307 %c = icmp eq i32 %s, 0
308 ret i1 %c
309; CHECK: ret i1 false
310}
311
Nick Lewycky3cec6f52011-03-04 07:00:57 +0000312define i1 @lshr2(i32 %x) {
313; CHECK: @lshr2
314 %s = lshr i32 %x, 30
315 %c = icmp ugt i32 %s, 8
316 ret i1 %c
317; CHECK: ret i1 false
318}
319
320define i1 @ashr1(i32 %x) {
321; CHECK: @ashr1
Duncan Sands2e9e4f12011-01-29 13:27:00 +0000322 %s = ashr i32 -1, %x
323 %c = icmp eq i32 %s, 0
324 ret i1 %c
325; CHECK: ret i1 false
326}
Duncan Sands06504022011-02-03 09:37:39 +0000327
Nick Lewycky3cec6f52011-03-04 07:00:57 +0000328define i1 @ashr2(i32 %x) {
329; CHECK: @ashr2
330 %s = ashr i32 %x, 30
331 %c = icmp slt i32 %s, -5
332 ret i1 %c
333; CHECK: ret i1 false
334}
335
Duncan Sands06504022011-02-03 09:37:39 +0000336define i1 @select1(i1 %cond) {
337; CHECK: @select1
338 %s = select i1 %cond, i32 1, i32 0
339 %c = icmp eq i32 %s, 1
340 ret i1 %c
341; CHECK: ret i1 %cond
342}
343
344define i1 @select2(i1 %cond) {
345; CHECK: @select2
346 %x = zext i1 %cond to i32
347 %s = select i1 %cond, i32 %x, i32 0
348 %c = icmp ne i32 %s, 0
349 ret i1 %c
350; CHECK: ret i1 %cond
351}
352
353define i1 @select3(i1 %cond) {
354; CHECK: @select3
355 %x = zext i1 %cond to i32
356 %s = select i1 %cond, i32 1, i32 %x
357 %c = icmp ne i32 %s, 0
358 ret i1 %c
359; CHECK: ret i1 %cond
360}
361
362define i1 @select4(i1 %cond) {
363; CHECK: @select4
364 %invert = xor i1 %cond, 1
365 %s = select i1 %invert, i32 0, i32 1
366 %c = icmp ne i32 %s, 0
367 ret i1 %c
368; CHECK: ret i1 %cond
369}
Nick Lewyckyc9d20062011-03-01 08:15:50 +0000370
Duncan Sands3d5692a2011-10-30 19:56:36 +0000371define i1 @select5(i32 %x) {
372; CHECK: @select5
373 %c = icmp eq i32 %x, 0
374 %s = select i1 %c, i32 1, i32 %x
375 %c2 = icmp eq i32 %s, 0
376 ret i1 %c2
377; CHECK: ret i1 false
378}
379
380define i1 @select6(i32 %x) {
381; CHECK: @select6
382 %c = icmp sgt i32 %x, 0
383 %s = select i1 %c, i32 %x, i32 4
384 %c2 = icmp eq i32 %s, 0
385 ret i1 %c2
386; CHECK: ret i1 %c2
387}
388
Nick Lewyckyc9d20062011-03-01 08:15:50 +0000389define i1 @urem1(i32 %X, i32 %Y) {
390; CHECK: @urem1
391 %A = urem i32 %X, %Y
392 %B = icmp ult i32 %A, %Y
393 ret i1 %B
394; CHECK: ret i1 true
395}
396
397define i1 @urem2(i32 %X, i32 %Y) {
398; CHECK: @urem2
399 %A = urem i32 %X, %Y
400 %B = icmp eq i32 %A, %Y
401 ret i1 %B
Benjamin Kramer1885d212011-03-09 22:07:31 +0000402; CHECK: ret i1 false
Nick Lewyckyc9d20062011-03-01 08:15:50 +0000403}
Nick Lewycky3cec6f52011-03-04 07:00:57 +0000404
405define i1 @urem3(i32 %X) {
406; CHECK: @urem3
407 %A = urem i32 %X, 10
408 %B = icmp ult i32 %A, 15
409 ret i1 %B
410; CHECK: ret i1 true
411}
412
413define i1 @urem4(i32 %X) {
414; CHECK: @urem4
415 %A = urem i32 %X, 15
416 %B = icmp ult i32 %A, 10
417 ret i1 %B
418; CHECK: ret i1 %B
419}
420
Nick Lewycky8e3a79d2011-03-04 10:06:52 +0000421define i1 @urem5(i16 %X, i32 %Y) {
422; CHECK: @urem5
423 %A = zext i16 %X to i32
424 %B = urem i32 %A, %Y
425 %C = icmp slt i32 %B, %Y
426 ret i1 %C
427; CHECK: ret i1 true
428}
429
Nick Lewycky980104d2011-03-09 06:26:03 +0000430define i1 @urem6(i32 %X, i32 %Y) {
431; CHECK: @urem6
432 %A = urem i32 %X, %Y
433 %B = icmp ugt i32 %Y, %A
434 ret i1 %B
435; CHECK: ret i1 true
436}
437
Nick Lewycky3cec6f52011-03-04 07:00:57 +0000438define i1 @srem1(i32 %X) {
439; CHECK: @srem1
440 %A = srem i32 %X, -5
441 %B = icmp sgt i32 %A, 5
442 ret i1 %B
443; CHECK: ret i1 false
444}
445
Nick Lewyckycc799732011-03-11 09:00:19 +0000446; PR9343 #15
447; CHECK: @srem2
448; CHECK: ret i1 false
449define i1 @srem2(i16 %X, i32 %Y) {
450 %A = zext i16 %X to i32
451 %B = add nsw i32 %A, 1
452 %C = srem i32 %B, %Y
453 %D = icmp slt i32 %C, 0
454 ret i1 %D
455}
Benjamin Kramer5acc7512011-03-12 17:18:11 +0000456
457; CHECK: @srem3
458; CHECK-NEXT: ret i1 false
459define i1 @srem3(i16 %X, i32 %Y) {
460 %A = zext i16 %X to i32
461 %B = or i32 2147483648, %A
462 %C = sub nsw i32 1, %B
463 %D = srem i32 %C, %Y
464 %E = icmp slt i32 %D, 0
465 ret i1 %E
466}
467
Nick Lewycky3cec6f52011-03-04 07:00:57 +0000468define i1 @udiv1(i32 %X) {
469; CHECK: @udiv1
470 %A = udiv i32 %X, 1000000
471 %B = icmp ult i32 %A, 5000
472 ret i1 %B
473; CHECK: ret i1 true
474}
475
Nick Lewycky9719a712011-03-05 05:19:11 +0000476define i1 @udiv2(i32 %X, i32 %Y, i32 %Z) {
477; CHECK: @udiv2
478 %A = udiv exact i32 10, %Z
479 %B = udiv exact i32 20, %Z
480 %C = icmp ult i32 %A, %B
481 ret i1 %C
482; CHECK: ret i1 true
483}
484
Duncan Sands92af0a82011-10-28 18:17:44 +0000485define i1 @udiv3(i32 %X, i32 %Y) {
486; CHECK: @udiv3
487 %A = udiv i32 %X, %Y
488 %C = icmp ugt i32 %A, %X
489 ret i1 %C
490; CHECK: ret i1 false
491}
492
493define i1 @udiv4(i32 %X, i32 %Y) {
494; CHECK: @udiv4
495 %A = udiv i32 %X, %Y
496 %C = icmp ule i32 %A, %X
497 ret i1 %C
498; CHECK: ret i1 true
499}
500
501define i1 @udiv5(i32 %X) {
502; CHECK: @udiv5
503 %A = udiv i32 123, %X
504 %C = icmp ugt i32 %A, 124
505 ret i1 %C
506; CHECK: ret i1 false
507}
508
Eli Friedman0bae8b22011-11-08 21:08:02 +0000509; PR11340
510define i1 @udiv6(i32 %X) nounwind {
511; CHECK: @udiv6
512 %A = udiv i32 1, %X
513 %C = icmp eq i32 %A, 0
514 ret i1 %C
515; CHECK: ret i1 %C
516}
517
518
Nick Lewycky3cec6f52011-03-04 07:00:57 +0000519define i1 @sdiv1(i32 %X) {
520; CHECK: @sdiv1
521 %A = sdiv i32 %X, 1000000
522 %B = icmp slt i32 %A, 3000
523 ret i1 %B
524; CHECK: ret i1 true
525}
526
527define i1 @or1(i32 %X) {
528; CHECK: @or1
529 %A = or i32 %X, 62
530 %B = icmp ult i32 %A, 50
531 ret i1 %B
532; CHECK: ret i1 false
533}
534
535define i1 @and1(i32 %X) {
536; CHECK: @and1
537 %A = and i32 %X, 62
538 %B = icmp ugt i32 %A, 70
539 ret i1 %B
540; CHECK: ret i1 false
541}
Duncan Sands7cb61e52011-10-27 19:16:21 +0000542
543define i1 @mul1(i32 %X) {
544; CHECK: @mul1
545; Square of a non-zero number is non-zero if there is no overflow.
546 %Y = or i32 %X, 1
547 %M = mul nuw i32 %Y, %Y
548 %C = icmp eq i32 %M, 0
549 ret i1 %C
550; CHECK: ret i1 false
551}
552
553define i1 @mul2(i32 %X) {
554; CHECK: @mul2
555; Square of a non-zero number is positive if there is no signed overflow.
556 %Y = or i32 %X, 1
557 %M = mul nsw i32 %Y, %Y
558 %C = icmp sgt i32 %M, 0
559 ret i1 %C
560; CHECK: ret i1 true
561}
562
563define i1 @mul3(i32 %X, i32 %Y) {
564; CHECK: @mul3
565; Product of non-negative numbers is non-negative if there is no signed overflow.
566 %XX = mul nsw i32 %X, %X
567 %YY = mul nsw i32 %Y, %Y
568 %M = mul nsw i32 %XX, %YY
569 %C = icmp sge i32 %M, 0
570 ret i1 %C
571; CHECK: ret i1 true
572}
Duncan Sandsbf48ac62012-02-10 14:26:42 +0000573
574define <2 x i1> @vectorselect1(<2 x i1> %cond) {
575; CHECK: @vectorselect1
576 %invert = xor <2 x i1> %cond, <i1 1, i1 1>
577 %s = select <2 x i1> %invert, <2 x i32> <i32 0, i32 0>, <2 x i32> <i32 1, i32 1>
578 %c = icmp ne <2 x i32> %s, <i32 0, i32 0>
579 ret <2 x i1> %c
580; CHECK: ret <2 x i1> %cond
581}
Duncan Sands26641d72012-02-10 14:31:24 +0000582
Chris Lattner445d8c62012-02-20 00:42:49 +0000583; PR11948
584define <2 x i1> @vectorselectcrash(i32 %arg1) {
Duncan Sands26641d72012-02-10 14:31:24 +0000585 %tobool40 = icmp ne i32 %arg1, 0
586 %cond43 = select i1 %tobool40, <2 x i16> <i16 -5, i16 66>, <2 x i16> <i16 46, i16 1>
587 %cmp45 = icmp ugt <2 x i16> %cond43, <i16 73, i16 21>
588 ret <2 x i1> %cmp45
589}
Chris Lattner445d8c62012-02-20 00:42:49 +0000590
591; PR12013
592define i1 @alloca_compare(i64 %idx) {
593 %sv = alloca { i32, i32, [124 x i32] }
594 %1 = getelementptr inbounds { i32, i32, [124 x i32] }* %sv, i32 0, i32 2, i64 %idx
595 %2 = icmp eq i32* %1, null
596 ret i1 %2
597 ; CHECK: alloca_compare
598 ; CHECK: ret i1 false
599}
Chris Lattner01990f02012-02-24 19:01:58 +0000600
601; PR12075
602define i1 @infinite_gep() {
603 ret i1 1
604
605unreachableblock:
606 %X = getelementptr i32 *%X, i32 1
607 %Y = icmp eq i32* %X, null
608 ret i1 %Y
609}