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
|
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; Vary legal integer types in data layout.
; RUN: opt < %s -instcombine -S -data-layout=n32 | FileCheck %s --check-prefix=ALL --check-prefix=CHECK32
; RUN: opt < %s -instcombine -S -data-layout=n32:64 | FileCheck %s --check-prefix=ALL --check-prefix=CHECK64
; In all cases, the data-layout is irrelevant. We should shrink as much as possible in InstCombine
; and allow the backend to expand as much as needed to ensure optimal codegen for any target.
define i32 @positive1(i64 %a) {
; ALL-LABEL: @positive1(
; ALL: switch i32
; ALL-NEXT: i32 10, label %return
; ALL-NEXT: i32 100, label %sw.bb1
; ALL-NEXT: i32 1001, label %sw.bb2
; ALL-NEXT: ]
;
entry:
%and = and i64 %a, 4294967295
switch i64 %and, label %sw.default [
i64 10, label %return
i64 100, label %sw.bb1
i64 1001, label %sw.bb2
]
sw.bb1:
br label %return
sw.bb2:
br label %return
sw.default:
br label %return
return:
%retval.0 = phi i32 [ 24, %sw.default ], [ 123, %sw.bb2 ], [ 213, %sw.bb1 ], [ 231, %entry ]
ret i32 %retval.0
}
define i32 @negative1(i64 %a) {
; ALL-LABEL: @negative1(
; ALL: switch i32
; ALL-NEXT: i32 -10, label %return
; ALL-NEXT: i32 -100, label %sw.bb1
; ALL-NEXT: i32 -1001, label %sw.bb2
; ALL-NEXT: ]
;
entry:
%or = or i64 %a, -4294967296
switch i64 %or, label %sw.default [
i64 -10, label %return
i64 -100, label %sw.bb1
i64 -1001, label %sw.bb2
]
sw.bb1:
br label %return
sw.bb2:
br label %return
sw.default:
br label %return
return:
%retval.0 = phi i32 [ 24, %sw.default ], [ 123, %sw.bb2 ], [ 213, %sw.bb1 ], [ 231, %entry ]
ret i32 %retval.0
}
; Make sure truncating a constant int larger than 64-bit doesn't trigger an
; assertion.
define i32 @trunc72to68(i72 %a) {
; ALL-LABEL: @trunc72to68(
; ALL: switch i68
; ALL-NEXT: i68 10, label %return
; ALL-NEXT: i68 100, label %sw.bb1
; ALL-NEXT: i68 1001, label %sw.bb2
; ALL-NEXT: ]
;
entry:
%and = and i72 %a, 295147905179352825855
switch i72 %and, label %sw.default [
i72 10, label %return
i72 100, label %sw.bb1
i72 1001, label %sw.bb2
]
sw.bb1:
br label %return
sw.bb2:
br label %return
sw.default:
br label %return
return:
%retval.0 = phi i32 [ 24, %sw.default ], [ 123, %sw.bb2 ], [ 213, %sw.bb1 ], [ 231, %entry ]
ret i32 %retval.0
}
; Make sure to avoid assertion crashes and use the type before
; truncation to generate the sub constant expressions that leads
; to the recomputed condition.
define void @trunc64to59(i64 %a) {
; ALL-LABEL: @trunc64to59(
; ALL: switch i59
; ALL-NEXT: i59 0, label %sw.bb1
; ALL-NEXT: i59 18717182647723699, label %sw.bb2
; ALL-NEXT: ]
;
entry:
%tmp0 = and i64 %a, 15
%tmp1 = mul i64 %tmp0, -6425668444178048401
%tmp2 = add i64 %tmp1, 5170979678563097242
%tmp3 = mul i64 %tmp2, 1627972535142754813
switch i64 %tmp3, label %sw.default [
i64 847514119312061490, label %sw.bb1
i64 866231301959785189, label %sw.bb2
]
sw.bb1:
br label %sw.default
sw.bb2:
br label %sw.default
sw.default:
ret void
}
; https://llvm.org/bugs/show_bug.cgi?id=31260
define i8 @PR31260(i8 %x) {
; ALL-LABEL: @PR31260(
; ALL-NEXT: entry:
; ALL-NEXT: [[TMP0:%.*]] = trunc i8 %x to i2
; ALL-NEXT: [[TRUNC:%.*]] = and i2 [[TMP0]], -2
; ALL-NEXT: switch i2 [[TRUNC]], label %exit [
; ALL-NEXT: i2 0, label %case126
; ALL-NEXT: i2 -2, label %case124
; ALL-NEXT: ]
; ALL: exit:
; ALL-NEXT: ret i8 1
; ALL: case126:
; ALL-NEXT: ret i8 3
; ALL: case124:
; ALL-NEXT: ret i8 5
;
entry:
%t4 = and i8 %x, 2
%t5 = add nsw i8 %t4, -126
switch i8 %t5, label %exit [
i8 -126, label %case126
i8 -124, label %case124
]
exit:
ret i8 1
case126:
ret i8 3
case124:
ret i8 5
}
; Make sure the arithmetic evaluation of the switch
; condition is evaluated on the original type
define i32 @trunc32to16(i32 %a0) #0 {
; ALL-LABEL: @trunc32to16(
; ALL: switch i16
; ALL-NEXT: i16 63, label %sw.bb
; ALL-NEXT: i16 1, label %sw.bb1
; ALL-NEXT: i16 100, label %sw.bb2
; ALL-NEXT: ]
;
entry:
%retval = alloca i32, align 4
%xor = xor i32 %a0, 1034460917
%shr = lshr i32 %xor, 16
%add = add i32 %shr, -917677090
switch i32 %add, label %sw.epilog [
i32 -917677027, label %sw.bb
i32 -917677089, label %sw.bb1
i32 -917676990, label %sw.bb2
]
sw.bb: ; preds = %entry
store i32 90, i32* %retval, align 4
br label %return
sw.bb1: ; preds = %entry
store i32 91, i32* %retval, align 4
br label %return
sw.bb2: ; preds = %entry
store i32 92, i32* %retval, align 4
br label %return
sw.epilog: ; preds = %entry
store i32 113, i32* %retval, align 4
br label %return
return: ; preds = %sw.epilog, %sw.bb2,
%rval = load i32, i32* %retval, align 4
ret i32 %rval
}
|
