File: type-unique-unrelated.ll

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (31 lines) | stat: -rw-r--r-- 695 bytes parent folder | download | duplicates (22)
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
; 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
}