mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-22 12:33:33 +02:00
a384ed2381
The big/small ordering here is based on signed values so SmallValue will be INT_MIN and BigValue 0. This shouldn't be a problem but the code assumed that BigValue always had more bits set than SmallValue. We used to just miss the transformation, but a recent refactoring of mine turned this into an assertion failure. llvm-svn: 239105
42 lines
782 B
LLVM
42 lines
782 B
LLVM
; RUN: llc -march=x86 -asm-verbose=false < %s | FileCheck %s
|
|
|
|
; Check that merging switch cases that differ in one bit works.
|
|
; CHECK-LABEL: test1
|
|
; CHECK: orl $2
|
|
; CHECK-NEXT: cmpl $6
|
|
|
|
define void @test1(i32 %variable) nounwind {
|
|
entry:
|
|
switch i32 %variable, label %if.end [
|
|
i32 4, label %if.then
|
|
i32 6, label %if.then
|
|
]
|
|
|
|
if.then:
|
|
%call = tail call i32 (...) @bar() nounwind
|
|
ret void
|
|
|
|
if.end:
|
|
ret void
|
|
}
|
|
|
|
; CHECK-LABEL: test2
|
|
; CHECK: orl $-2147483648
|
|
; CHECK-NEXT: cmpl $-2147483648
|
|
define void @test2(i32 %variable) nounwind {
|
|
entry:
|
|
switch i32 %variable, label %if.end [
|
|
i32 0, label %if.then
|
|
i32 -2147483648, label %if.then
|
|
]
|
|
|
|
if.then:
|
|
%call = tail call i32 (...) @bar() nounwind
|
|
ret void
|
|
|
|
if.end:
|
|
ret void
|
|
}
|
|
|
|
declare i32 @bar(...) nounwind
|