mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-30 23:42:52 +01:00
8a358b3669
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
34 lines
857 B
LLVM
34 lines
857 B
LLVM
; RUN: llc < %s -march=x86 -relocation-model=static | grep "lea.*X.*esp" | count 2
|
|
|
|
@X = external global [0 x i32]
|
|
|
|
define void @foo() nounwind {
|
|
entry:
|
|
%Y = alloca i32
|
|
call void @frob(i32* %Y) nounwind
|
|
%Y3 = bitcast i32* %Y to i8*
|
|
%ctg2 = getelementptr i8* %Y3, i32 ptrtoint ([0 x i32]* @X to i32)
|
|
%0 = ptrtoint i8* %ctg2 to i32
|
|
call void @borf(i32 %0) nounwind
|
|
ret void
|
|
}
|
|
|
|
define void @bar(i32 %i) nounwind {
|
|
entry:
|
|
%Y = alloca [10 x i32]
|
|
%0 = getelementptr [10 x i32]* %Y, i32 0, i32 0
|
|
call void @frob(i32* %0) nounwind
|
|
%1 = getelementptr [0 x i32]* @X, i32 0, i32 %i
|
|
%2 = getelementptr [10 x i32]* %Y, i32 0, i32 0
|
|
%3 = ptrtoint i32* %2 to i32
|
|
%4 = bitcast i32* %1 to i8*
|
|
%ctg2 = getelementptr i8* %4, i32 %3
|
|
%5 = ptrtoint i8* %ctg2 to i32
|
|
call void @borf(i32 %5) nounwind
|
|
ret void
|
|
}
|
|
|
|
declare void @frob(i32*)
|
|
|
|
declare void @borf(i32)
|