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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
; RUN: llvm-as %s -o - | llvm-dis > %t1.ll
; RUN: llvm-as %t1.ll -o - | llvm-dis > %t2.ll
; RUN: diff %t1.ll %t2.ll
; This test case is used to test opaque type processing, forward references,
; and recursive types. Oh my.
;
%SQ1 = type { int }
%ITy = type opaque
%SQ2 = type { %ITy }
%ITy = type int
%CCC = type { \2* }
%BBB = type { \2*, \2 * }
%AAA = type { \2*, {\2*}, [12x{\2*}], {[1x{\2*}]} }
; Test numbered types
type %CCC
type %BBB
%Composite = type { %0, %1 }
; Test simple opaque type resolution...
%intty = type opaque
%intty = type int
; Perform a simple forward reference...
%ty1 = type { %ty2, int }
%ty2 = type float
; Do a recursive type...
%list = type { %list * }
%listp = type { %listp } *
; Do two mutually recursive types...
%TyA = type { %ty2, %TyB * }
%TyB = type { double, %TyA * }
; A complex recursive type...
%Y = type { {%Y*}, %Y* }
%Z = type { { %Z * }, [12x%Z] *, {{{ %Z * }}} }
; More ridiculous test cases...
%A = type [ 123x %A*]
%M = type %M (%M, %M) *
%P = type %P*
; Recursive ptrs
%u = type %v*
%v = type %u*
; Test the parser for unnamed recursive types...
%P1 = type \1 *
%Y1 = type { { \3 * }, \2 * }
%Z1 = type { { \3 * }, [12x\3] *, { { { \5 * } } } }
implementation
|
