; 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: }

Add a test for switches on undef.
[SCCP] Add a test for switches on undef.

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.

git-svn-id: 0ff597fd157e6f4fc38580e8d64ab130330d2411@287731 91177308-0d34-0410-b5e6-96231b3b80d8
