llvm-project/llvm/test/Linker/2008-06-26-AddressSpace.ll

; Test linking two functions with different prototypes and two globals 
; in different modules.
; RUN: llvm-as %s -o %t.foo1.bc
; RUN: echo | llvm-as -o %t.foo2.bc
; RUN: llvm-link %t.foo2.bc %t.foo1.bc -S | grep "addrspace(2)"
; RUN: llvm-link %t.foo1.bc %t.foo2.bc -S | grep "addrspace(2)"
; rdar://6038021

@G = addrspace(2) global i32 256
when linking globals, make sure to preserve the address space of the global. llvm-svn: 52810 2008-06-27 11:10:24 +08:00			`; Test linking two functions with different prototypes and two globals`
			`; in different modules.`
Remove obsolete -f flags. llvm-svn: 79992 2009-08-25 23:38:29 +08:00			`; RUN: llvm-as %s -o %t.foo1.bc`
			`; RUN: echo \| llvm-as -o %t.foo2.bc`
Convert all tests using TCL-style quoting to use shell-style quoting. This was done through the aid of a terrible Perl creation. I will not paste any of the horrors here. Suffice to say, it require multiple staged rounds of replacements, state carried between, and a few nested-construct-parsing hacks that I'm not proud of. It happens, by luck, to be able to deal with all the TCL-quoting patterns in evidence in the LLVM test suite. If anyone is maintaining large out-of-tree test trees, feel free to poke me and I'll send you the steps I used to convert things, as well as answer any painful questions etc. IRC works best for this type of thing I find. Once converted, switch the LLVM lit config to use ShTests the same as Clang. In addition to being able to delete large amounts of Python code from 'lit', this will also simplify the entire test suite and some of lit's architecture. Finally, the test suite runs 33% faster on Linux now. ;] For my 16-hardware-thread (2x 4-core xeon e5520): 36s -> 24s llvm-svn: 159525 2012-07-02 20:47:22 +08:00			`; RUN: llvm-link %t.foo2.bc %t.foo1.bc -S \| grep "addrspace(2)"`
			`; RUN: llvm-link %t.foo1.bc %t.foo2.bc -S \| grep "addrspace(2)"`
when linking globals, make sure to preserve the address space of the global. llvm-svn: 52810 2008-06-27 11:10:24 +08:00			`; rdar://6038021`

Reimplement the old and horrible bison parser for .ll files with a nice 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. llvm-svn: 61558 2009-01-02 15:01:27 +08:00			`@G = addrspace(2) global i32 256`