mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 02:52:53 +02:00
c9c586dde1
Without this test, you can just remove the code fixing the switch to the first constant in ResolvedUndefs in and everything pass. This test, instead, fails with an assertion if the code is removed. Found while refactoring SCCP to integrate undef in the solver. llvm-svn: 287731
28 lines
564 B
LLVM
28 lines
564 B
LLVM
; RUN: opt -S -ipsccp < %s | FileCheck %s
|
|
|
|
declare void @foo()
|
|
declare void @goo()
|
|
declare void @patatino()
|
|
|
|
define void @test1(i32 %t) {
|
|
%choice = icmp eq i32 undef, -1
|
|
switch i1 %choice, label %first [i1 0, label %second
|
|
i1 1, label %third]
|
|
first:
|
|
call void @foo()
|
|
ret void
|
|
second:
|
|
call void @goo()
|
|
ret void
|
|
third:
|
|
call void @patatino()
|
|
ret void
|
|
}
|
|
|
|
; CHECK: define void @test1(i32 %t) {
|
|
; CHECK-NEXT: br label %second
|
|
; CHECK: second:
|
|
; CHECK-NEXT: call void @goo()
|
|
; CHECK-NEXT: ret void
|
|
; CHECK-NEXT: }
|