mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-30 08:24:12 +00:00
1afcace3a3
patch brings numerous advantages to LLVM. One way to look at it is through diffstat: 109 files changed, 3005 insertions(+), 5906 deletions(-) Removing almost 3K lines of code is a good thing. Other advantages include: 1. Value::getType() is a simple load that can be CSE'd, not a mutating union-find operation. 2. Types a uniqued and never move once created, defining away PATypeHolder. 3. Structs can be "named" now, and their name is part of the identity that uniques them. This means that the compiler doesn't merge them structurally which makes the IR much less confusing. 4. Now that there is no way to get a cycle in a type graph without a named struct type, "upreferences" go away. 5. Type refinement is completely gone, which should make LTO much MUCH faster in some common cases with C++ code. 6. Types are now generally immutable, so we can use "Type *" instead "const Type *" everywhere. Downsides of this patch are that it removes some functions from the C API, so people using those will have to upgrade to (not yet added) new API. "LLVM 3.0" is the right time to do this. There are still some cleanups pending after this, this patch is large enough as-is. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
67 lines
1.5 KiB
LLVM
67 lines
1.5 KiB
LLVM
; RUN: llc < %s -march=x86 | grep fldz
|
|
; RUN: llc < %s -march=x86-64 | grep fld1
|
|
|
|
%0 = type { x86_fp80, x86_fp80 }
|
|
|
|
; This is basically this code on x86-64:
|
|
; _Complex long double test() { return 1.0; }
|
|
define %0 @test() {
|
|
%A = fpext double 1.0 to x86_fp80
|
|
%B = fpext double 0.0 to x86_fp80
|
|
%mrv = insertvalue %0 undef, x86_fp80 %A, 0
|
|
%mrv1 = insertvalue %0 %mrv, x86_fp80 %B, 1
|
|
ret %0 %mrv1
|
|
}
|
|
|
|
|
|
;_test2:
|
|
; fld1
|
|
; fld %st(0)
|
|
; ret
|
|
define %0 @test2() {
|
|
%A = fpext double 1.0 to x86_fp80
|
|
%mrv = insertvalue %0 undef, x86_fp80 %A, 0
|
|
%mrv1 = insertvalue %0 %mrv, x86_fp80 %A, 1
|
|
ret %0 %mrv1
|
|
}
|
|
|
|
; Uses both values.
|
|
define void @call1(x86_fp80 *%P1, x86_fp80 *%P2) {
|
|
%a = call %0 @test()
|
|
%b = extractvalue %0 %a, 0
|
|
store x86_fp80 %b, x86_fp80* %P1
|
|
|
|
%c = extractvalue %0 %a, 1
|
|
store x86_fp80 %c, x86_fp80* %P2
|
|
ret void
|
|
}
|
|
|
|
; Uses both values, requires fxch
|
|
define void @call2(x86_fp80 *%P1, x86_fp80 *%P2) {
|
|
%a = call %0 @test()
|
|
%b = extractvalue %0 %a, 1
|
|
store x86_fp80 %b, x86_fp80* %P1
|
|
|
|
%c = extractvalue %0 %a, 0
|
|
store x86_fp80 %c, x86_fp80* %P2
|
|
ret void
|
|
}
|
|
|
|
; Uses ST(0), ST(1) is dead but must be popped.
|
|
define void @call3(x86_fp80 *%P1, x86_fp80 *%P2) {
|
|
%a = call %0 @test()
|
|
%b = extractvalue %0 %a, 0
|
|
store x86_fp80 %b, x86_fp80* %P1
|
|
ret void
|
|
}
|
|
|
|
; Uses ST(1), ST(0) is dead and must be popped.
|
|
define void @call4(x86_fp80 *%P1, x86_fp80 *%P2) {
|
|
%a = call %0 @test()
|
|
|
|
%c = extractvalue %0 %a, 1
|
|
store x86_fp80 %c, x86_fp80* %P2
|
|
ret void
|
|
}
|
|
|