blob: 6740ae66aef12ca7cde7bca6b24ba6a976e897bb [file] [log] [blame]
Sanjay Pateleb504762016-07-16 18:08:22 +00001; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
2; RUN: opt < %s -instcombine -S | FileCheck %s
3
4; Tests for Integer BitWidth <= 64 && BitWidth % 8 != 0.
5
6;; Flip sign bit then add INT_MIN -> nop.
7define i1 @test1(i1 %x) {
8; CHECK-LABEL: @test1(
9; CHECK-NEXT: ret i1 %x
10;
11 %tmp.2 = xor i1 %x, 1
12 %tmp.4 = add i1 %tmp.2, 1
13 ret i1 %tmp.4
14}
15
16;; Flip sign bit then add INT_MIN -> nop.
17define i47 @test2(i47 %x) {
18; CHECK-LABEL: @test2(
19; CHECK-NEXT: ret i47 %x
20;
21 %tmp.2 = xor i47 %x, 70368744177664
22 %tmp.4 = add i47 %tmp.2, 70368744177664
23 ret i47 %tmp.4
24}
25
26;; Flip sign bit then add INT_MIN -> nop.
27define i15 @test3(i15 %x) {
28; CHECK-LABEL: @test3(
29; CHECK-NEXT: ret i15 %x
30;
31 %tmp.2 = xor i15 %x, 16384
32 %tmp.4 = add i15 %tmp.2, 16384
33 ret i15 %tmp.4
34}
35
Sanjay Patel040bd162016-07-16 18:24:18 +000036; X + signbit --> X ^ signbit
37define <2 x i5> @test3vec(<2 x i5> %x) {
38; CHECK-LABEL: @test3vec(
Sanjay Patel79acd2a2016-07-16 18:29:26 +000039; CHECK-NEXT: [[Y:%.*]] = xor <2 x i5> %x, <i5 -16, i5 -16>
Sanjay Patel040bd162016-07-16 18:24:18 +000040; CHECK-NEXT: ret <2 x i5> [[Y]]
41;
42 %y = add <2 x i5> %x, <i5 16, i5 16>
43 ret <2 x i5> %y
44}
45
Sanjay Pateleb504762016-07-16 18:08:22 +000046;; (x & 0b1111..0) + 1 -> x | 1
47define i49 @test4(i49 %x) {
48; CHECK-LABEL: @test4(
49; CHECK-NEXT: [[TMP_4:%.*]] = or i49 %x, 1
50; CHECK-NEXT: ret i49 [[TMP_4]]
51;
52 %tmp.2 = and i49 %x, 562949953421310
53 %tmp.4 = add i49 %tmp.2, 1
54 ret i49 %tmp.4
55}
56
57; Tests for Integer BitWidth > 64 && BitWidth <= 1024.
58
59;; Flip sign bit then add INT_MIN -> nop.
60define i111 @test5(i111 %x) {
61; CHECK-LABEL: @test5(
62; CHECK-NEXT: ret i111 %x
63;
64 %tmp.2 = shl i111 1, 110
65 %tmp.4 = xor i111 %x, %tmp.2
66 %tmp.6 = add i111 %tmp.4, %tmp.2
67 ret i111 %tmp.6
68}
69
70;; Flip sign bit then add INT_MIN -> nop.
71define i65 @test6(i65 %x) {
72; CHECK-LABEL: @test6(
73; CHECK-NEXT: ret i65 %x
74;
75 %tmp.0 = shl i65 1, 64
76 %tmp.2 = xor i65 %x, %tmp.0
77 %tmp.4 = add i65 %tmp.2, %tmp.0
78 ret i65 %tmp.4
79}
80
81;; Flip sign bit then add INT_MIN -> nop.
82define i1024 @test7(i1024 %x) {
83; CHECK-LABEL: @test7(
84; CHECK-NEXT: ret i1024 %x
85;
86 %tmp.0 = shl i1024 1, 1023
87 %tmp.2 = xor i1024 %x, %tmp.0
88 %tmp.4 = add i1024 %tmp.2, %tmp.0
89 ret i1024 %tmp.4
90}
91
92;; If we have add(xor(X, 0xF..F80..), 0x80..), it's an xor.
93define i128 @test8(i128 %x) {
94; CHECK-LABEL: @test8(
95; CHECK-NEXT: [[TMP_4:%.*]] = xor i128 %x, 170141183460469231731687303715884105600
96; CHECK-NEXT: ret i128 [[TMP_4]]
97;
98 %tmp.5 = shl i128 1, 127
99 %tmp.1 = ashr i128 %tmp.5, 120
100 %tmp.2 = xor i128 %x, %tmp.1
101 %tmp.4 = add i128 %tmp.2, %tmp.5
102 ret i128 %tmp.4
103}
104
105;; (x & 254)+1 -> (x & 254)|1
106define i77 @test9(i77 %x) {
107; CHECK-LABEL: @test9(
108; CHECK-NEXT: [[TMP_2:%.*]] = and i77 %x, 562949953421310
109; CHECK-NEXT: [[TMP_4:%.*]] = or i77 [[TMP_2]], 1
110; CHECK-NEXT: ret i77 [[TMP_4]]
111;
112 %tmp.2 = and i77 %x, 562949953421310
113 %tmp.4 = add i77 %tmp.2, 1
114 ret i77 %tmp.4
115}
116