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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
|
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
; RUN: llc -mtriple=x86_64-- < %s -jump-table-density=40 -switch-peel-threshold=101 | FileCheck %s
; This switch should use bit tests, and the third bit test case is just
; testing for one possible value, so it doesn't need a bt.
define void @test(ptr %l) nounwind {
; CHECK-LABEL: test:
; CHECK: # %bb.0: # %entry
; CHECK-NEXT: pushq %rax
; CHECK-NEXT: movq %rdi, (%rsp)
; CHECK-NEXT: movsbl (%rdi), %eax
; CHECK-NEXT: addl $-33, %eax
; CHECK-NEXT: cmpl $61, %eax
; CHECK-NEXT: ja .LBB0_7
; CHECK-NEXT: # %bb.1: # %entry
; CHECK-NEXT: movabsq $2305843009482129440, %rcx # imm = 0x2000000010000020
; CHECK-NEXT: btq %rax, %rcx
; CHECK-NEXT: jb .LBB0_6
; CHECK-NEXT: # %bb.2: # %entry
; CHECK-NEXT: movl $671088640, %ecx # imm = 0x28000000
; CHECK-NEXT: btq %rax, %rcx
; CHECK-NEXT: jae .LBB0_3
; CHECK-NEXT: # %bb.5: # %sw.bb
; CHECK-NEXT: xorl %edi, %edi
; CHECK-NEXT: jmp .LBB0_8
; CHECK-NEXT: .LBB0_6: # %sw.bb2
; CHECK-NEXT: movl $1, %edi
; CHECK-NEXT: jmp .LBB0_8
; CHECK-NEXT: .LBB0_3: # %entry
; CHECK-NEXT: testq %rax, %rax
; CHECK-NEXT: jne .LBB0_7
; CHECK-NEXT: # %bb.4: # %sw.bb4
; CHECK-NEXT: movl $3, %edi
; CHECK-NEXT: jmp .LBB0_8
; CHECK-NEXT: .LBB0_7: # %sw.default
; CHECK-NEXT: movl $97, %edi
; CHECK-NEXT: .LBB0_8: # %sw.epilog
; CHECK-NEXT: callq foo@PLT
; CHECK-NEXT: popq %rax
; CHECK-NEXT: retq
entry:
%l.addr = alloca ptr, align 8 ; <ptr> [#uses=2]
store ptr %l, ptr %l.addr
%tmp = load ptr, ptr %l.addr ; <ptr> [#uses=1]
%tmp1 = load i8, ptr %tmp ; <i8> [#uses=1]
%conv = sext i8 %tmp1 to i32 ; <i32> [#uses=1]
switch i32 %conv, label %sw.default [
i32 62, label %sw.bb
i32 60, label %sw.bb
i32 38, label %sw.bb2
i32 94, label %sw.bb2
i32 61, label %sw.bb2
i32 33, label %sw.bb4
]
sw.bb: ; preds = %entry, %entry
call void @foo(i32 0)
br label %sw.epilog
sw.bb2: ; preds = %entry, %entry, %entry
call void @foo(i32 1)
br label %sw.epilog
sw.bb4: ; preds = %entry
call void @foo(i32 3)
br label %sw.epilog
sw.default: ; preds = %entry
call void @foo(i32 97)
br label %sw.epilog
sw.epilog: ; preds = %sw.default, %sw.bb4, %sw.bb2, %sw.bb
ret void
}
declare void @foo(i32)
; Don't zero extend the test operands to pointer type if it can be avoided.
; rdar://8781238
define void @test2(i32 %x) nounwind ssp {
; CHECK-LABEL: test2:
; CHECK: # %bb.0: # %entry
; CHECK-NEXT: cmpl $6, %edi
; CHECK-NEXT: ja .LBB1_2
; CHECK-NEXT: # %bb.1: # %entry
; CHECK-NEXT: movl $91, %eax
; CHECK-NEXT: btl %edi, %eax
; CHECK-NEXT: jb bar@PLT # TAILCALL
; CHECK-NEXT: .LBB1_2: # %if.end
; CHECK-NEXT: retq
entry:
switch i32 %x, label %if.end [
i32 6, label %if.then
i32 4, label %if.then
i32 3, label %if.then
i32 1, label %if.then
i32 0, label %if.then
]
if.then: ; preds = %entry, %entry, %entry, %entry, %entry
tail call void @bar() nounwind
ret void
if.end: ; preds = %entry
ret void
}
declare void @bar()
define void @test3(i32 %x) nounwind {
; CHECK-LABEL: test3:
; CHECK: # %bb.0:
; CHECK-NEXT: cmpl $5, %edi
; CHECK-NEXT: ja .LBB2_2
; CHECK-NEXT: # %bb.1:
; CHECK-NEXT: cmpl $4, %edi
; CHECK-NEXT: jne bar@PLT # TAILCALL
; CHECK-NEXT: .LBB2_2: # %if.end
; CHECK-NEXT: retq
switch i32 %x, label %if.end [
i32 0, label %if.then
i32 1, label %if.then
i32 2, label %if.then
i32 3, label %if.then
i32 5, label %if.then
]
if.then:
tail call void @bar() nounwind
ret void
if.end:
ret void
}
; Ensure that optimizing for jump tables doesn't needlessly deteriorate the
; created binary tree search. See PR22262.
define void @test4(i32 %x, ptr %y) {
; CHECK-LABEL: test4:
; CHECK: # %bb.0: # %entry
; CHECK-NEXT: cmpl $39, %edi
; CHECK-NEXT: jg .LBB3_5
; CHECK-NEXT: # %bb.1: # %entry
; CHECK-NEXT: cmpl $10, %edi
; CHECK-NEXT: je .LBB3_9
; CHECK-NEXT: # %bb.2: # %entry
; CHECK-NEXT: cmpl $20, %edi
; CHECK-NEXT: je .LBB3_10
; CHECK-NEXT: # %bb.3: # %entry
; CHECK-NEXT: cmpl $30, %edi
; CHECK-NEXT: jne .LBB3_13
; CHECK-NEXT: # %bb.4: # %sw.bb2
; CHECK-NEXT: movl $3, (%rsi)
; CHECK-NEXT: retq
; CHECK-NEXT: .LBB3_5: # %entry
; CHECK-NEXT: cmpl $40, %edi
; CHECK-NEXT: je .LBB3_11
; CHECK-NEXT: # %bb.6: # %entry
; CHECK-NEXT: cmpl $50, %edi
; CHECK-NEXT: je .LBB3_12
; CHECK-NEXT: # %bb.7: # %entry
; CHECK-NEXT: cmpl $60, %edi
; CHECK-NEXT: jne .LBB3_13
; CHECK-NEXT: # %bb.8: # %sw.bb5
; CHECK-NEXT: movl $6, (%rsi)
; CHECK-NEXT: retq
; CHECK-NEXT: .LBB3_9: # %sw.bb
; CHECK-NEXT: movl $1, (%rsi)
; CHECK-NEXT: retq
; CHECK-NEXT: .LBB3_10: # %sw.bb1
; CHECK-NEXT: movl $2, (%rsi)
; CHECK-NEXT: retq
; CHECK-NEXT: .LBB3_11: # %sw.bb3
; CHECK-NEXT: movl $4, (%rsi)
; CHECK-NEXT: retq
; CHECK-NEXT: .LBB3_12: # %sw.bb4
; CHECK-NEXT: movl $5, (%rsi)
; CHECK-NEXT: retq
; CHECK-NEXT: .LBB3_13: # %sw.default
; CHECK-NEXT: movl $7, (%rsi)
; CHECK-NEXT: retq
entry:
switch i32 %x, label %sw.default [
i32 10, label %sw.bb
i32 20, label %sw.bb1
i32 30, label %sw.bb2
i32 40, label %sw.bb3
i32 50, label %sw.bb4
i32 60, label %sw.bb5
]
sw.bb:
store i32 1, ptr %y
br label %sw.epilog
sw.bb1:
store i32 2, ptr %y
br label %sw.epilog
sw.bb2:
store i32 3, ptr %y
br label %sw.epilog
sw.bb3:
store i32 4, ptr %y
br label %sw.epilog
sw.bb4:
store i32 5, ptr %y
br label %sw.epilog
sw.bb5:
store i32 6, ptr %y
br label %sw.epilog
sw.default:
store i32 7, ptr %y
br label %sw.epilog
sw.epilog:
ret void
; The balanced binary switch here would start with a comparison against 39, but
; it is currently starting with 29 because of the density-sum heuristic.
}
; Omit the range check when the default case is unreachable, see PR43129.
declare void @g(i32)
define void @test5(i32 %x) {
; CHECK-LABEL: test5:
; CHECK: # %bb.0: # %entry
; CHECK-NEXT: pushq %rax
; CHECK-NEXT: .cfi_def_cfa_offset 16
; CHECK-NEXT: movl $73, %eax
; CHECK-NEXT: btl %edi, %eax
; CHECK-NEXT: jb .LBB4_3
; CHECK-NEXT: # %bb.1: # %entry
; CHECK-NEXT: movl $146, %eax
; CHECK-NEXT: btl %edi, %eax
; CHECK-NEXT: jae .LBB4_2
; CHECK-NEXT: # %bb.4: # %bb1
; CHECK-NEXT: movl $1, %edi
; CHECK-NEXT: callq g@PLT
; CHECK-NEXT: .LBB4_3: # %bb0
; CHECK-NEXT: xorl %edi, %edi
; CHECK-NEXT: callq g@PLT
; CHECK-NEXT: .LBB4_2: # %bb2
; CHECK-NEXT: movl $2, %edi
; CHECK-NEXT: callq g@PLT
entry:
switch i32 %x, label %return [
; 73 = 2^0 + 2^3 + 2^6
i32 0, label %bb0
i32 3, label %bb0
i32 6, label %bb0
; 146 = 2^1 + 2^4 + 2^7
i32 1, label %bb1
i32 4, label %bb1
i32 7, label %bb1
i32 2, label %bb2
i32 5, label %bb2
i32 8, label %bb2
]
bb0: tail call void @g(i32 0) br label %return
bb1: tail call void @g(i32 1) br label %return
bb2: tail call void @g(i32 2) br label %return
return: unreachable
}
|
