lowerswitch.ll
8.2 KB
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
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
; RUN: opt -lowerswitch -S < %s | FileCheck %s
; Test that we don't crash and have a different basic block for each incoming edge.
define void @test0(i32 %mode) {
; CHECK-LABEL: @test0
;
; CHECK: icmp eq i32 %mode, 4
; CHECK-NEXT: label %BB3, label %NewDefault
;
; CHECK: icmp eq i32 %mode, 2
; CHECK-NEXT: label %BB3, label %NewDefault
;
; CHECK: icmp eq i32 %mode, 0
; CHECK-NEXT: label %BB3, label %NewDefault
;
; CHECK: %merge = phi i64 [ 1, %BB3 ], [ 0, %NewDefault ]
BB1:
switch i32 %mode, label %BB2 [
i32 3, label %BB2
i32 5, label %BB2
i32 0, label %BB3
i32 2, label %BB3
i32 4, label %BB3
]
BB2:
%merge = phi i64 [ 1, %BB3 ], [ 0, %BB1 ], [ 0, %BB1 ], [ 0, %BB1 ]
ret void
BB3:
br label %BB2
}
; Test switch cases that are merged into a single case during lowerswitch
; (take 84 and 85 below) - check that the number of incoming phi values match
; the number of branches.
define void @test1(i32 %mode) {
; CHECK-LABEL: @test1
entry:
br label %bb1
bb1:
switch i32 %mode, label %bb1 [
i32 84, label %bb3
i32 85, label %bb3
i32 86, label %bb2
i32 78, label %exit
i32 99, label %bb3
]
bb2:
br label %bb3
bb3:
; CHECK-LABEL: bb3
; CHECK: %tmp = phi i32 [ 1, %NodeBlock ], [ 0, %bb2 ], [ 1, %LeafBlock3 ]
%tmp = phi i32 [ 1, %bb1 ], [ 0, %bb2 ], [ 1, %bb1 ], [ 1, %bb1 ]
; CHECK-NEXT: %tmp2 = phi i32 [ 2, %NodeBlock ], [ 5, %bb2 ], [ 2, %LeafBlock3 ]
%tmp2 = phi i32 [ 2, %bb1 ], [ 2, %bb1 ], [ 5, %bb2 ], [ 2, %bb1 ]
br label %exit
exit:
ret void
}
; Test that we don't crash.
define void @test2(i32 %mode) {
; CHECK-LABEL: @test2
br i1 undef, label %1, label %._crit_edge
; <label>:1 ; preds = %0
switch i32 %mode, label %33 [
i32 2, label %2
i32 3, label %3
i32 4, label %4
i32 5, label %5
i32 6, label %6
i32 7, label %7
i32 8, label %8
i32 9, label %9
i32 10, label %10
i32 11, label %14
i32 12, label %18
i32 13, label %22
i32 14, label %26
i32 15, label %27
i32 16, label %34
i32 17, label %34
i32 18, label %34
i32 19, label %34
i32 22, label %34
i32 20, label %31
i32 21, label %32
]
; <label>:2 ; preds = %1
br label %34
; <label>:3 ; preds = %1
br label %34
; <label>:4 ; preds = %1
br label %34
; <label>:5 ; preds = %1
br label %34
; <label>:6 ; preds = %1
br label %34
; <label>:7 ; preds = %1
br label %34
; <label>:8 ; preds = %1
br label %34
; <label>:9 ; preds = %1
br label %34
; <label>:10 ; preds = %1
br i1 undef, label %11, label %12
; <label>:11 ; preds = %10
br label %13
; <label>:12 ; preds = %10
br label %13
; <label>:13 ; preds = %12, %11
br label %34
; <label>:14 ; preds = %1
br i1 undef, label %15, label %16
; <label>:15 ; preds = %14
br label %17
; <label>:16 ; preds = %14
br label %17
; <label>:17 ; preds = %16, %15
br label %34
; <label>:18 ; preds = %1
br i1 undef, label %19, label %20
; <label>:19 ; preds = %18
br label %21
; <label>:20 ; preds = %18
br label %21
; <label>:21 ; preds = %20, %19
br label %34
; <label>:22 ; preds = %1
br i1 undef, label %23, label %24
; <label>:23 ; preds = %22
br label %25
; <label>:24 ; preds = %22
br label %25
; <label>:25 ; preds = %24, %23
br label %34
; <label>:26 ; preds = %1
br label %34
; <label>:27 ; preds = %1
br i1 undef, label %28, label %29
; <label>:28 ; preds = %27
br label %30
; <label>:29 ; preds = %27
br label %30
; <label>:30 ; preds = %29, %28
br label %34
; <label>:31 ; preds = %1
br label %34
; <label>:32 ; preds = %1
br label %34
; <label>:33 ; preds = %1
br label %34
; <label>:34 ; preds = %33, %32, %31, %30, %26, %25, %21, %17, %13, %9, %8, %7, %6, %5, %4, %3, %2, %1, %1, %1, %1, %1
%o.0 = phi float [ undef, %33 ], [ undef, %32 ], [ undef, %31 ], [ undef, %30 ], [ undef, %26 ], [ undef, %25 ], [ undef, %21 ], [ undef, %17 ], [ undef, %13 ], [ undef, %9 ], [ undef, %8 ], [ undef, %7 ], [ undef, %6 ], [ undef, %5 ], [ undef, %4 ], [ undef, %3 ], [ undef, %2 ], [ undef, %1 ], [ undef, %1 ], [ undef, %1 ], [ undef, %1 ], [ undef, %1 ]
br label %._crit_edge
._crit_edge: ; preds = %34, %0
ret void
}
; Test that the PHI node in for.cond should have one entry for each predecessor
; of its parent basic block after lowerswitch merged several cases into a new
; default block.
define void @test3(i32 %mode) {
; CHECK-LABEL: @test3
entry:
br label %lbl1
lbl1: ; preds = %cleanup, %entry
br label %lbl2
lbl2: ; preds = %cleanup, %lbl1
br label %for.cond
for.cond: ; preds = %cleanup, %cleanup, %lbl2
; CHECK: for.cond:
; CHECK: phi i16 [ undef, %lbl2 ], [ %b.3, %NewDefault ]{{$}}
; CHECK: for.cond1:
%b.2 = phi i16 [ undef, %lbl2 ], [ %b.3, %cleanup ], [ %b.3, %cleanup ]
br label %for.cond1
for.cond1: ; preds = %for.inc, %for.cond
%b.3 = phi i16 [ %b.2, %for.cond ], [ undef, %for.inc ]
%tobool = icmp ne i16 %b.3, 0
br i1 %tobool, label %for.body, label %for.end
for.body: ; preds = %for.cond1
br i1 undef, label %if.then, label %for.inc
if.then: ; preds = %for.body
br label %cleanup
for.inc: ; preds = %for.body
br label %for.cond1
for.end: ; preds = %for.cond1
br i1 undef, label %if.then4, label %for.body7
if.then4: ; preds = %for.end
br label %cleanup
for.body7: ; preds = %for.end
br label %cleanup
cleanup: ; preds = %for.body7, %if.then4, %if.then
switch i32 %mode, label %unreachable [
i32 0, label %for.cond
i32 2, label %lbl1
i32 5, label %for.cond
i32 3, label %lbl2
]
unreachable: ; preds = %cleanup
unreachable
}
; Test that the PHI node in cleanup17 is removed as the switch default block is
; not reachable.
define void @test4(i32 %mode) {
; CHECK-LABEL: @test4
entry:
switch i32 %mode, label %cleanup17 [
i32 0, label %return
i32 9, label %return
]
cleanup17:
; CHECK: cleanup17:
; CHECK-NOT: phi i16 [ undef, %entry ]
; CHECK: return:
%retval.4 = phi i16 [ undef, %entry ]
unreachable
return:
ret void
}
; Test that the PHI node in for.inc is updated correctly as the switch is
; replaced with a single branch to for.inc
define void @test5(i32 %mode) {
; CHECK-LABEL: @test5
entry:
br i1 undef, label %cleanup10, label %cleanup10.thread
cleanup10.thread:
br label %for.inc
cleanup10:
switch i32 %mode, label %unreachable [
i32 0, label %for.inc
i32 4, label %for.inc
]
for.inc:
; CHECK: for.inc:
; CHECK-NEXT: phi i16 [ 0, %cleanup10.thread ], [ undef, %cleanup10 ]
%0 = phi i16 [ undef, %cleanup10 ], [ 0, %cleanup10.thread ], [ undef, %cleanup10 ]
unreachable
unreachable:
unreachable
}