mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-02 00:16:25 +00:00
ab043ff680
Essentially the same as the GEP change in r230786.
A similar migration script can be used to update test cases, though a few more
test case improvements/changes were required this time around: (r229269-r229278)
import fileinput
import sys
import re
pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)")
for line in sys.stdin:
sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line))
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7649
llvm-svn: 230794
41 lines
943 B
LLVM
41 lines
943 B
LLVM
; RUN: llc < %s -mtriple=i686-apple-darwin8 -mcpu=yonah -march=x86 | FileCheck %s
|
|
|
|
; These testcases shouldn't require loading into an XMM register then storing
|
|
; to memory, then reloading into an FPStack reg.
|
|
|
|
; CHECK: test1
|
|
; CHECK: fldl
|
|
; CHECK-NEXT: ret
|
|
define double @test1(double *%P) {
|
|
%A = load double, double* %P
|
|
ret double %A
|
|
}
|
|
|
|
; fastcc should return a value
|
|
; CHECK: test2
|
|
; CHECK-NOT: xmm
|
|
; CHECK: ret
|
|
define fastcc double @test2(<2 x double> %A) {
|
|
%B = extractelement <2 x double> %A, i32 0
|
|
ret double %B
|
|
}
|
|
|
|
; CHECK: test3
|
|
; CHECK: sub{{.*}}%esp
|
|
; CHECK-NOT: xmm
|
|
define fastcc double @test3(<4 x float> %A) {
|
|
%B = bitcast <4 x float> %A to <2 x double>
|
|
%C = call fastcc double @test2(<2 x double> %B)
|
|
ret double %C
|
|
}
|
|
|
|
; Clear the stack when not using a return value.
|
|
; CHECK: test4
|
|
; CHECK: call
|
|
; CHECK: fstp
|
|
; CHECK: ret
|
|
define void @test4(double *%P) {
|
|
%A = call double @test1(double *%P)
|
|
ret void
|
|
}
|