Add an interesting test that we already get right. NFC.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@222720 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Rafael Espindola 2014-11-25 03:47:57 +00:00
parent 044b644f54
commit e5aa5ce5b2
3 changed files with 45 additions and 0 deletions

View File

@ -0,0 +1,7 @@
%t = type { i8* }
declare %t @g()
define %t @g2() {
%x = call %t @g()
ret %t %x
}

View File

@ -0,0 +1,7 @@
%t = type { i8* }
declare %t @f()
define %t @g() {
%x = call %t @f()
ret %t %x
}

View File

@ -0,0 +1,31 @@
; RUN: llvm-link -S %s %p/Inputs/type-unique-unrelated2.ll %p/Inputs/type-unique-unrelated3.ll | FileCheck %s
; CHECK: %t = type { i8* }
; CHECK: define %t @f2() {
; CHECK-NEXT: %x = call %t @f2()
; CHECK-NEXT: ret %t %x
; CHECK-NEXT: }
; CHECK: define %t @g2() {
; CHECK-NEXT: %x = call %t @g()
; CHECK-NEXT: ret %t %x
; CHECK-NEXT: }
; CHECK: define %t @g() {
; CHECK-NEXT: %x = call %t @f()
; CHECK-NEXT: ret %t %x
; CHECK-NEXT: }
; The idea of this test is that the %t in this file and the one in
; type-unique-unrelated2.ll look unrelated until type-unique-unrelated3.ll
; is merged in.
%t = type { i8* }
declare %t @f()
define %t @f2() {
%x = call %t @f2()
ret %t %x
}