mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-04 09:54:09 +00:00
df98617b23
and clean recursive descent parser. This change has a couple of ramifications: 1. The parser code is about 400 lines shorter (in what we maintain, not including what is autogenerated). 2. The code should be significantly faster than the old code because we don't have to work around bison's poor handling of datatypes with ctors/dtors. This also makes the code much more resistant to memory leaks. 3. We now get caret diagnostics from the .ll parser, woo. 4. The actual diagnostics emited from the parser are completely different so a bunch of testcases had to be updated. 5. I now disallow "%ty = type opaque %ty = type i32". There was no good reason to support this, it was just an accident of the old implementation. I have no reason to think that anyone is actually using this. 6. The syntax for sticking a global variable has changed to make it unambiguous. I don't think anyone is depending on this since only clang supports this and it is not solid yet, so I'm not worried about anything breaking. 7. This gets rid of the last use of bison, and along with it the .cvs files. I'll prune this from the makefiles as a subsequent commit. There are a few minor cleanups that can be done after this commit (suggestions welcome!) but this passes dejagnu testing and is ready for its time in the limelight. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@61558 91177308-0d34-0410-b5e6-96231b3b80d8
56 lines
1.1 KiB
LLVM
56 lines
1.1 KiB
LLVM
; RUN: llvm-as < %s | 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 { i32 }
|
|
%SQ2 = type { %ITy }
|
|
%ITy = type i32
|
|
|
|
|
|
%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 i32
|
|
|
|
; Perform a simple forward reference...
|
|
%ty1 = type { %ty2, i32 }
|
|
%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 * } } } }
|
|
|