blob: ced74bd4be9bac42fec7a240f33e7aaadd9854bf [file] [log] [blame]
Duncan Sands9d32f602011-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 Kramerfd8779a2012-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 Friedman2c3acb02012-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 Lewyckyf7087ea2012-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 Carruth58725a62012-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 Sands9d32f602011-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 Sandsd70d1a52011-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 Sands9d32f602011-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 Sandsd70d1a52011-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 Sands227fba12011-01-25 15:14:15 +0000219; CHECK: @add
Duncan Sandsd70d1a52011-01-25 09:38:29 +0000220 %l = lshr i32 %x, 1
Duncan Sands227fba12011-01-25 15:14:15 +0000221 %q = lshr i32 %y, 1
222 %r = or i32 %q, 1
Duncan Sandsd70d1a52011-01-25 09:38:29 +0000223 %s = add i32 %l, %r
224 %c = icmp eq i32 %s, 0
225 ret i1 %c
Duncan Sands227fba12011-01-25 15:14:15 +0000226; CHECK: ret i1 false
Duncan Sandsd70d1a52011-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 Sands227fba12011-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 Sands52fb8462011-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 Sandsd70d1a52011-01-25 09:38:29 +0000269define i1 @addpowtwo(i32 %x, i32 %y) {
270; CHECK: @addpowtwo
271 %l = lshr i32 %x, 1
272 %r = shl i32 1, %y
273 %s = add i32 %l, %r
274 %c = icmp eq i32 %s, 0
275 ret i1 %c
276; CHECK: ret i1 false
277}
278
279define i1 @or(i32 %x) {
280; CHECK: @or
281 %o = or i32 %x, 1
282 %c = icmp eq i32 %o, 0
283 ret i1 %c
284; CHECK: ret i1 false
285}
Duncan Sands91367822011-01-29 13:27:00 +0000286
287define i1 @shl(i32 %x) {
288; CHECK: @shl
289 %s = shl i32 1, %x
290 %c = icmp eq i32 %s, 0
291 ret i1 %c
292; CHECK: ret i1 false
293}
294
Nick Lewycky3a73e342011-03-04 07:00:57 +0000295define i1 @lshr1(i32 %x) {
296; CHECK: @lshr1
Duncan Sands91367822011-01-29 13:27:00 +0000297 %s = lshr i32 -1, %x
298 %c = icmp eq i32 %s, 0
299 ret i1 %c
300; CHECK: ret i1 false
301}
302
Nick Lewycky3a73e342011-03-04 07:00:57 +0000303define i1 @lshr2(i32 %x) {
304; CHECK: @lshr2
305 %s = lshr i32 %x, 30
306 %c = icmp ugt i32 %s, 8
307 ret i1 %c
308; CHECK: ret i1 false
309}
310
311define i1 @ashr1(i32 %x) {
312; CHECK: @ashr1
Duncan Sands91367822011-01-29 13:27:00 +0000313 %s = ashr i32 -1, %x
314 %c = icmp eq i32 %s, 0
315 ret i1 %c
316; CHECK: ret i1 false
317}
Duncan Sands50ca4d32011-02-03 09:37:39 +0000318
Nick Lewycky3a73e342011-03-04 07:00:57 +0000319define i1 @ashr2(i32 %x) {
320; CHECK: @ashr2
321 %s = ashr i32 %x, 30
322 %c = icmp slt i32 %s, -5
323 ret i1 %c
324; CHECK: ret i1 false
325}
326
Duncan Sands50ca4d32011-02-03 09:37:39 +0000327define i1 @select1(i1 %cond) {
328; CHECK: @select1
329 %s = select i1 %cond, i32 1, i32 0
330 %c = icmp eq i32 %s, 1
331 ret i1 %c
332; CHECK: ret i1 %cond
333}
334
335define i1 @select2(i1 %cond) {
336; CHECK: @select2
337 %x = zext i1 %cond to i32
338 %s = select i1 %cond, i32 %x, i32 0
339 %c = icmp ne i32 %s, 0
340 ret i1 %c
341; CHECK: ret i1 %cond
342}
343
344define i1 @select3(i1 %cond) {
345; CHECK: @select3
346 %x = zext i1 %cond to i32
347 %s = select i1 %cond, i32 1, i32 %x
348 %c = icmp ne i32 %s, 0
349 ret i1 %c
350; CHECK: ret i1 %cond
351}
352
353define i1 @select4(i1 %cond) {
354; CHECK: @select4
355 %invert = xor i1 %cond, 1
356 %s = select i1 %invert, i32 0, i32 1
357 %c = icmp ne i32 %s, 0
358 ret i1 %c
359; CHECK: ret i1 %cond
360}
Nick Lewycky88cd0aa2011-03-01 08:15:50 +0000361
Duncan Sands6dc9e2b2011-10-30 19:56:36 +0000362define i1 @select5(i32 %x) {
363; CHECK: @select5
364 %c = icmp eq i32 %x, 0
365 %s = select i1 %c, i32 1, i32 %x
366 %c2 = icmp eq i32 %s, 0
367 ret i1 %c2
368; CHECK: ret i1 false
369}
370
371define i1 @select6(i32 %x) {
372; CHECK: @select6
373 %c = icmp sgt i32 %x, 0
374 %s = select i1 %c, i32 %x, i32 4
375 %c2 = icmp eq i32 %s, 0
376 ret i1 %c2
377; CHECK: ret i1 %c2
378}
379
Nick Lewycky88cd0aa2011-03-01 08:15:50 +0000380define i1 @urem1(i32 %X, i32 %Y) {
381; CHECK: @urem1
382 %A = urem i32 %X, %Y
383 %B = icmp ult i32 %A, %Y
384 ret i1 %B
385; CHECK: ret i1 true
386}
387
388define i1 @urem2(i32 %X, i32 %Y) {
389; CHECK: @urem2
390 %A = urem i32 %X, %Y
391 %B = icmp eq i32 %A, %Y
392 ret i1 %B
Benjamin Kramer7bff3e72011-03-09 22:07:31 +0000393; CHECK: ret i1 false
Nick Lewycky88cd0aa2011-03-01 08:15:50 +0000394}
Nick Lewycky3a73e342011-03-04 07:00:57 +0000395
396define i1 @urem3(i32 %X) {
397; CHECK: @urem3
398 %A = urem i32 %X, 10
399 %B = icmp ult i32 %A, 15
400 ret i1 %B
401; CHECK: ret i1 true
402}
403
404define i1 @urem4(i32 %X) {
405; CHECK: @urem4
406 %A = urem i32 %X, 15
407 %B = icmp ult i32 %A, 10
408 ret i1 %B
409; CHECK: ret i1 %B
410}
411
Nick Lewycky78679272011-03-04 10:06:52 +0000412define i1 @urem5(i16 %X, i32 %Y) {
413; CHECK: @urem5
414 %A = zext i16 %X to i32
415 %B = urem i32 %A, %Y
416 %C = icmp slt i32 %B, %Y
417 ret i1 %C
418; CHECK: ret i1 true
419}
420
Nick Lewycky84dd4fa2011-03-09 06:26:03 +0000421define i1 @urem6(i32 %X, i32 %Y) {
422; CHECK: @urem6
423 %A = urem i32 %X, %Y
424 %B = icmp ugt i32 %Y, %A
425 ret i1 %B
426; CHECK: ret i1 true
427}
428
Nick Lewycky3a73e342011-03-04 07:00:57 +0000429define i1 @srem1(i32 %X) {
430; CHECK: @srem1
431 %A = srem i32 %X, -5
432 %B = icmp sgt i32 %A, 5
433 ret i1 %B
434; CHECK: ret i1 false
435}
436
Nick Lewyckyb69050a2011-03-11 09:00:19 +0000437; PR9343 #15
438; CHECK: @srem2
439; CHECK: ret i1 false
440define i1 @srem2(i16 %X, i32 %Y) {
441 %A = zext i16 %X to i32
442 %B = add nsw i32 %A, 1
443 %C = srem i32 %B, %Y
444 %D = icmp slt i32 %C, 0
445 ret i1 %D
446}
Benjamin Kramer14b2a592011-03-12 17:18:11 +0000447
448; CHECK: @srem3
449; CHECK-NEXT: ret i1 false
450define i1 @srem3(i16 %X, i32 %Y) {
451 %A = zext i16 %X to i32
452 %B = or i32 2147483648, %A
453 %C = sub nsw i32 1, %B
454 %D = srem i32 %C, %Y
455 %E = icmp slt i32 %D, 0
456 ret i1 %E
457}
458
Nick Lewycky3a73e342011-03-04 07:00:57 +0000459define i1 @udiv1(i32 %X) {
460; CHECK: @udiv1
461 %A = udiv i32 %X, 1000000
462 %B = icmp ult i32 %A, 5000
463 ret i1 %B
464; CHECK: ret i1 true
465}
466
Nick Lewycky58bfcdb2011-03-05 05:19:11 +0000467define i1 @udiv2(i32 %X, i32 %Y, i32 %Z) {
468; CHECK: @udiv2
469 %A = udiv exact i32 10, %Z
470 %B = udiv exact i32 20, %Z
471 %C = icmp ult i32 %A, %B
472 ret i1 %C
473; CHECK: ret i1 true
474}
475
Duncan Sandsc65c7472011-10-28 18:17:44 +0000476define i1 @udiv3(i32 %X, i32 %Y) {
477; CHECK: @udiv3
478 %A = udiv i32 %X, %Y
479 %C = icmp ugt i32 %A, %X
480 ret i1 %C
481; CHECK: ret i1 false
482}
483
484define i1 @udiv4(i32 %X, i32 %Y) {
485; CHECK: @udiv4
486 %A = udiv i32 %X, %Y
487 %C = icmp ule i32 %A, %X
488 ret i1 %C
489; CHECK: ret i1 true
490}
491
492define i1 @udiv5(i32 %X) {
493; CHECK: @udiv5
494 %A = udiv i32 123, %X
495 %C = icmp ugt i32 %A, 124
496 ret i1 %C
497; CHECK: ret i1 false
498}
499
Eli Friedman7781ae52011-11-08 21:08:02 +0000500; PR11340
501define i1 @udiv6(i32 %X) nounwind {
502; CHECK: @udiv6
503 %A = udiv i32 1, %X
504 %C = icmp eq i32 %A, 0
505 ret i1 %C
506; CHECK: ret i1 %C
507}
508
509
Nick Lewycky3a73e342011-03-04 07:00:57 +0000510define i1 @sdiv1(i32 %X) {
511; CHECK: @sdiv1
512 %A = sdiv i32 %X, 1000000
513 %B = icmp slt i32 %A, 3000
514 ret i1 %B
515; CHECK: ret i1 true
516}
517
518define i1 @or1(i32 %X) {
519; CHECK: @or1
520 %A = or i32 %X, 62
521 %B = icmp ult i32 %A, 50
522 ret i1 %B
523; CHECK: ret i1 false
524}
525
526define i1 @and1(i32 %X) {
527; CHECK: @and1
528 %A = and i32 %X, 62
529 %B = icmp ugt i32 %A, 70
530 ret i1 %B
531; CHECK: ret i1 false
532}
Duncan Sands32a43cc2011-10-27 19:16:21 +0000533
534define i1 @mul1(i32 %X) {
535; CHECK: @mul1
536; Square of a non-zero number is non-zero if there is no overflow.
537 %Y = or i32 %X, 1
538 %M = mul nuw i32 %Y, %Y
539 %C = icmp eq i32 %M, 0
540 ret i1 %C
541; CHECK: ret i1 false
542}
543
544define i1 @mul2(i32 %X) {
545; CHECK: @mul2
546; Square of a non-zero number is positive if there is no signed overflow.
547 %Y = or i32 %X, 1
548 %M = mul nsw i32 %Y, %Y
549 %C = icmp sgt i32 %M, 0
550 ret i1 %C
551; CHECK: ret i1 true
552}
553
554define i1 @mul3(i32 %X, i32 %Y) {
555; CHECK: @mul3
556; Product of non-negative numbers is non-negative if there is no signed overflow.
557 %XX = mul nsw i32 %X, %X
558 %YY = mul nsw i32 %Y, %Y
559 %M = mul nsw i32 %XX, %YY
560 %C = icmp sge i32 %M, 0
561 ret i1 %C
562; CHECK: ret i1 true
563}
Duncan Sandsedfb9312012-02-10 14:26:42 +0000564
565define <2 x i1> @vectorselect1(<2 x i1> %cond) {
566; CHECK: @vectorselect1
567 %invert = xor <2 x i1> %cond, <i1 1, i1 1>
568 %s = select <2 x i1> %invert, <2 x i32> <i32 0, i32 0>, <2 x i32> <i32 1, i32 1>
569 %c = icmp ne <2 x i32> %s, <i32 0, i32 0>
570 ret <2 x i1> %c
571; CHECK: ret <2 x i1> %cond
572}
Duncan Sandsaa97bb52012-02-10 14:31:24 +0000573
Chris Lattnerb053fc12012-02-20 00:42:49 +0000574; PR11948
575define <2 x i1> @vectorselectcrash(i32 %arg1) {
Duncan Sandsaa97bb52012-02-10 14:31:24 +0000576 %tobool40 = icmp ne i32 %arg1, 0
577 %cond43 = select i1 %tobool40, <2 x i16> <i16 -5, i16 66>, <2 x i16> <i16 46, i16 1>
578 %cmp45 = icmp ugt <2 x i16> %cond43, <i16 73, i16 21>
579 ret <2 x i1> %cmp45
580}
Chris Lattnerb053fc12012-02-20 00:42:49 +0000581
582; PR12013
583define i1 @alloca_compare(i64 %idx) {
584 %sv = alloca { i32, i32, [124 x i32] }
585 %1 = getelementptr inbounds { i32, i32, [124 x i32] }* %sv, i32 0, i32 2, i64 %idx
586 %2 = icmp eq i32* %1, null
587 ret i1 %2
588 ; CHECK: alloca_compare
589 ; CHECK: ret i1 false
590}
Chris Lattner009e2652012-02-24 19:01:58 +0000591
592; PR12075
593define i1 @infinite_gep() {
594 ret i1 1
595
596unreachableblock:
597 %X = getelementptr i32 *%X, i32 1
598 %Y = icmp eq i32* %X, null
599 ret i1 %Y
600}