2015-01-11 01:36:20 +00:00
|
|
|
; RUN: llc < %s -mtriple=i686-windows | FileCheck %s -check-prefix=NORMAL
|
2015-02-01 16:56:04 +00:00
|
|
|
; RUN: llc < %s -mtriple=x86_64-windows | FileCheck %s -check-prefix=X64
|
2015-01-11 01:36:20 +00:00
|
|
|
; RUN: llc < %s -mtriple=i686-windows -force-align-stack -stack-alignment=32 | FileCheck %s -check-prefix=ALIGNED
|
2015-02-01 16:56:04 +00:00
|
|
|
|
2015-01-11 01:36:20 +00:00
|
|
|
declare void @good(i32 %a, i32 %b, i32 %c, i32 %d)
|
|
|
|
|
declare void @inreg(i32 %a, i32 inreg %b, i32 %c, i32 %d)
|
2015-02-12 08:36:35 +00:00
|
|
|
declare void @oneparam(i32 %a)
|
|
|
|
|
declare void @eightparams(i32 %a, i32 %b, i32 %c, i32 %d, i32 %e, i32 %f, i32 %g, i32 %h)
|
|
|
|
|
|
2015-01-11 01:36:20 +00:00
|
|
|
|
|
|
|
|
; Here, we should have a reserved frame, so we don't expect pushes
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-LABEL: test1:
|
2015-01-11 01:36:20 +00:00
|
|
|
; NORMAL: subl $16, %esp
|
|
|
|
|
; NORMAL-NEXT: movl $4, 12(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $3, 8(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $2, 4(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $1, (%esp)
|
|
|
|
|
; NORMAL-NEXT: call
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
2015-01-11 01:36:20 +00:00
|
|
|
define void @test1() {
|
|
|
|
|
entry:
|
|
|
|
|
call void @good(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-01 16:56:04 +00:00
|
|
|
; We're optimizing for code size, so we should get pushes for x86,
|
|
|
|
|
; even though there is a reserved call frame.
|
|
|
|
|
; Make sure we don't touch x86-64
|
|
|
|
|
; NORMAL-LABEL: test1b:
|
|
|
|
|
; NORMAL-NOT: subl {{.*}} %esp
|
|
|
|
|
; NORMAL: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl $3
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl $1
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
; X64-LABEL: test1b:
|
|
|
|
|
; X64: movl $1, %ecx
|
|
|
|
|
; X64-NEXT: movl $2, %edx
|
|
|
|
|
; X64-NEXT: movl $3, %r8d
|
|
|
|
|
; X64-NEXT: movl $4, %r9d
|
|
|
|
|
; X64-NEXT: callq good
|
|
|
|
|
define void @test1b() optsize {
|
|
|
|
|
entry:
|
|
|
|
|
call void @good(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Same as above, but for minsize
|
|
|
|
|
; NORMAL-LABEL: test1c:
|
|
|
|
|
; NORMAL-NOT: subl {{.*}} %esp
|
|
|
|
|
; NORMAL: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl $3
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl $1
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
define void @test1c() minsize {
|
|
|
|
|
entry:
|
|
|
|
|
call void @good(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; If we have a reserved frame, we should have pushes
|
|
|
|
|
; NORMAL-LABEL: test2:
|
2015-01-11 01:36:20 +00:00
|
|
|
; NORMAL-NOT: subl {{.*}} %esp
|
|
|
|
|
; NORMAL: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl $3
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl $1
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
define void @test2(i32 %k) {
|
|
|
|
|
entry:
|
|
|
|
|
%a = alloca i32, i32 %k
|
|
|
|
|
call void @good(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Again, we expect a sequence of 4 immediate pushes
|
|
|
|
|
; Checks that we generate the right pushes for >8bit immediates
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-LABEL: test2b:
|
2015-01-11 01:36:20 +00:00
|
|
|
; NORMAL-NOT: subl {{.*}} %esp
|
|
|
|
|
; NORMAL: pushl $4096
|
|
|
|
|
; NORMAL-NEXT: pushl $3072
|
|
|
|
|
; NORMAL-NEXT: pushl $2048
|
|
|
|
|
; NORMAL-NEXT: pushl $1024
|
|
|
|
|
; NORMAL-NEXT: call
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
define void @test2b() optsize {
|
2015-01-11 01:36:20 +00:00
|
|
|
entry:
|
|
|
|
|
call void @good(i32 1024, i32 2048, i32 3072, i32 4096)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; The first push should push a register
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-LABEL: test3:
|
2015-01-11 01:36:20 +00:00
|
|
|
; NORMAL-NOT: subl {{.*}} %esp
|
|
|
|
|
; NORMAL: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl $3
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl %e{{..}}
|
|
|
|
|
; NORMAL-NEXT: call
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
define void @test3(i32 %k) optsize {
|
2015-01-11 01:36:20 +00:00
|
|
|
entry:
|
2015-02-12 14:17:35 +00:00
|
|
|
%f = add i32 %k, 1
|
|
|
|
|
call void @good(i32 %f, i32 2, i32 3, i32 4)
|
2015-01-11 01:36:20 +00:00
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; We don't support weird calling conventions
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-LABEL: test4:
|
2015-01-11 01:36:20 +00:00
|
|
|
; NORMAL: subl $12, %esp
|
|
|
|
|
; NORMAL-NEXT: movl $4, 8(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $3, 4(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $1, (%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $2, %eax
|
|
|
|
|
; NORMAL-NEXT: call
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-NEXT: addl $12, %esp
|
|
|
|
|
define void @test4() optsize {
|
2015-01-11 01:36:20 +00:00
|
|
|
entry:
|
|
|
|
|
call void @inreg(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-01 16:56:04 +00:00
|
|
|
; When there is no reserved call frame, check that additional alignment
|
|
|
|
|
; is added when the pushes don't add up to the required alignment.
|
|
|
|
|
; ALIGNED-LABEL: test5:
|
2015-01-11 01:36:20 +00:00
|
|
|
; ALIGNED: subl $16, %esp
|
|
|
|
|
; ALIGNED-NEXT: pushl $4
|
|
|
|
|
; ALIGNED-NEXT: pushl $3
|
|
|
|
|
; ALIGNED-NEXT: pushl $2
|
|
|
|
|
; ALIGNED-NEXT: pushl $1
|
|
|
|
|
; ALIGNED-NEXT: call
|
|
|
|
|
define void @test5(i32 %k) {
|
|
|
|
|
entry:
|
|
|
|
|
%a = alloca i32, i32 %k
|
|
|
|
|
call void @good(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-12 08:36:35 +00:00
|
|
|
; When the alignment adds up, do the transformation
|
|
|
|
|
; ALIGNED-LABEL: test5b:
|
|
|
|
|
; ALIGNED: pushl $8
|
|
|
|
|
; ALIGNED-NEXT: pushl $7
|
|
|
|
|
; ALIGNED-NEXT: pushl $6
|
|
|
|
|
; ALIGNED-NEXT: pushl $5
|
|
|
|
|
; ALIGNED-NEXT: pushl $4
|
|
|
|
|
; ALIGNED-NEXT: pushl $3
|
|
|
|
|
; ALIGNED-NEXT: pushl $2
|
|
|
|
|
; ALIGNED-NEXT: pushl $1
|
|
|
|
|
; ALIGNED-NEXT: call
|
|
|
|
|
define void @test5b() optsize {
|
|
|
|
|
entry:
|
|
|
|
|
call void @eightparams(i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7, i32 8)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; When having to compensate for the alignment isn't worth it,
|
|
|
|
|
; don't use pushes.
|
|
|
|
|
; ALIGNED-LABEL: test5c:
|
|
|
|
|
; ALIGNED: movl $1, (%esp)
|
|
|
|
|
; ALIGNED-NEXT: call
|
|
|
|
|
define void @test5c() optsize {
|
|
|
|
|
entry:
|
|
|
|
|
call void @oneparam(i32 1)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2015-01-11 01:36:20 +00:00
|
|
|
; Check that pushing the addresses of globals (Or generally, things that
|
|
|
|
|
; aren't exactly immediates) isn't broken.
|
|
|
|
|
; Fixes PR21878.
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-LABEL: test6:
|
2015-01-11 01:36:20 +00:00
|
|
|
; NORMAL: pushl $_ext
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
declare void @f(i8*)
|
|
|
|
|
@ext = external constant i8
|
|
|
|
|
|
|
|
|
|
define void @test6() {
|
|
|
|
|
call void @f(i8* @ext)
|
|
|
|
|
br label %bb
|
|
|
|
|
bb:
|
|
|
|
|
alloca i32
|
|
|
|
|
ret void
|
|
|
|
|
}
|
2015-02-01 16:56:04 +00:00
|
|
|
|
|
|
|
|
; Check that we fold simple cases into the push
|
|
|
|
|
; NORMAL-LABEL: test7:
|
|
|
|
|
; NORMAL-NOT: subl {{.*}} %esp
|
|
|
|
|
; NORMAL: movl 4(%esp), [[EAX:%e..]]
|
|
|
|
|
; NORMAL-NEXT: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl ([[EAX]])
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl $1
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
define void @test7(i32* %ptr) optsize {
|
|
|
|
|
entry:
|
2015-02-27 21:17:42 +00:00
|
|
|
%val = load i32, i32* %ptr
|
2015-02-01 16:56:04 +00:00
|
|
|
call void @good(i32 1, i32 2, i32 %val, i32 4)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-12 14:17:35 +00:00
|
|
|
; Fold stack-relative loads into the push, with correct offset
|
|
|
|
|
; In particular, at the second push, %b was at 12(%esp) and
|
|
|
|
|
; %a wast at 8(%esp), but the second push bumped %esp, so %a
|
|
|
|
|
; is now it at 12(%esp)
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-LABEL: test8:
|
2015-02-12 14:17:35 +00:00
|
|
|
; NORMAL: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl 12(%esp)
|
|
|
|
|
; NORMAL-NEXT: pushl 12(%esp)
|
2015-02-01 16:56:04 +00:00
|
|
|
; NORMAL-NEXT: pushl $1
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
2015-02-12 14:17:35 +00:00
|
|
|
define void @test8(i32 %a, i32 %b) optsize {
|
2015-02-01 16:56:04 +00:00
|
|
|
entry:
|
2015-02-12 14:17:35 +00:00
|
|
|
call void @good(i32 1, i32 %a, i32 %b, i32 4)
|
2015-02-01 16:56:04 +00:00
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; If one function is using push instructions, and the other isn't
|
|
|
|
|
; (because it has frame-index references), then we must resolve
|
|
|
|
|
; these references correctly.
|
|
|
|
|
; NORMAL-LABEL: test9:
|
|
|
|
|
; NORMAL-NOT: leal (%esp),
|
|
|
|
|
; NORMAL: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl $3
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl $1
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
; NORMAL-NEXT: subl $16, %esp
|
|
|
|
|
; NORMAL-NEXT: leal 16(%esp), [[EAX:%e..]]
|
|
|
|
|
; NORMAL-NEXT: movl [[EAX]], 12(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $7, 8(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $6, 4(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $5, (%esp)
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
define void @test9() optsize {
|
|
|
|
|
entry:
|
|
|
|
|
%p = alloca i32, align 4
|
|
|
|
|
call void @good(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
%0 = ptrtoint i32* %p to i32
|
|
|
|
|
call void @good(i32 5, i32 6, i32 7, i32 %0)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; We can end up with an indirect call which gets reloaded on the spot.
|
|
|
|
|
; Make sure we reference the correct stack slot - we spill into (%esp)
|
|
|
|
|
; and reload from 16(%esp) due to the pushes.
|
|
|
|
|
; NORMAL-LABEL: test10:
|
|
|
|
|
; NORMAL: movl $_good, [[ALLOC:.*]]
|
|
|
|
|
; NORMAL-NEXT: movl [[ALLOC]], [[EAX:%e..]]
|
|
|
|
|
; NORMAL-NEXT: movl [[EAX]], (%esp) # 4-byte Spill
|
|
|
|
|
; NORMAL: nop
|
|
|
|
|
; NORMAL: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl $3
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl $1
|
|
|
|
|
; NORMAL-NEXT: calll *16(%esp)
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
define void @test10() optsize {
|
|
|
|
|
%stack_fptr = alloca void (i32, i32, i32, i32)*
|
|
|
|
|
store void (i32, i32, i32, i32)* @good, void (i32, i32, i32, i32)** %stack_fptr
|
2015-02-27 21:17:42 +00:00
|
|
|
%good_ptr = load volatile void (i32, i32, i32, i32)*, void (i32, i32, i32, i32)** %stack_fptr
|
2015-02-01 16:56:04 +00:00
|
|
|
call void asm sideeffect "nop", "~{ax},~{bx},~{cx},~{dx},~{bp},~{si},~{di}"()
|
[opaque pointer type] Add textual IR support for explicit type parameter to the call instruction
See r230786 and r230794 for similar changes to gep and load
respectively.
Call is a bit different because it often doesn't have a single explicit
type - usually the type is deduced from the arguments, and just the
return type is explicit. In those cases there's no need to change the
IR.
When that's not the case, the IR usually contains the pointer type of
the first operand - but since typed pointers are going away, that
representation is insufficient so I'm just stripping the "pointerness"
of the explicit type away.
This does make the IR a bit weird - it /sort of/ reads like the type of
the first operand: "call void () %x(" but %x is actually of type "void
()*" and will eventually be just of type "ptr". But this seems not too
bad and I don't think it would benefit from repeating the type
("void (), void () * %x(" and then eventually "void (), ptr %x(") as has
been done with gep and load.
This also has a side benefit: since the explicit type is no longer a
pointer, there's no ambiguity between an explicit type and a function
that returns a function pointer. Previously this case needed an explicit
type (eg: a function returning a void() function was written as
"call void () () * @x(" rather than "call void () * @x(" because of the
ambiguity between a function returning a pointer to a void() function
and a function returning void).
No ambiguity means even function pointer return types can just be
written alone, without writing the whole function's type.
This leaves /only/ the varargs case where the explicit type is required.
Given the special type syntax in call instructions, the regex-fu used
for migration was a bit more involved in its own unique way (as every
one of these is) so here it is. Use it in conjunction with the apply.sh
script and associated find/xargs commands I've provided in rr230786 to
migrate your out of tree tests. Do let me know if any of this doesn't
cover your cases & we can iterate on a more general script/regexes to
help others with out of tree tests.
About 9 test cases couldn't be automatically migrated - half of those
were functions returning function pointers, where I just had to manually
delete the function argument types now that we didn't need an explicit
function type there. The other half were typedefs of function types used
in calls - just had to manually drop the * from those.
import fileinput
import sys
import re
pat = re.compile(r'((?:=|:|^|\s)call\s(?:[^@]*?))(\s*$|\s*(?:(?:\[\[[a-zA-Z0-9_]+\]\]|[@%](?:(")?[\\\?@a-zA-Z0-9_.]*?(?(3)"|)|{{.*}}))(?:\(|$)|undef|inttoptr|bitcast|null|asm).*$)')
addrspace_end = re.compile(r"addrspace\(\d+\)\s*\*$")
func_end = re.compile("(?:void.*|\)\s*)\*$")
def conv(match, line):
if not match or re.search(addrspace_end, match.group(1)) or not re.search(func_end, match.group(1)):
return line
return line[:match.start()] + match.group(1)[:match.group(1).rfind('*')].rstrip() + match.group(2) + line[match.end():]
for line in sys.stdin:
sys.stdout.write(conv(re.search(pat, line), line))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@235145 91177308-0d34-0410-b5e6-96231b3b80d8
2015-04-16 23:24:18 +00:00
|
|
|
call void (i32, i32, i32, i32) %good_ptr(i32 1, i32 2, i32 3, i32 4)
|
2015-02-01 16:56:04 +00:00
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; We can't fold the load from the global into the push because of
|
|
|
|
|
; interference from the store
|
|
|
|
|
; NORMAL-LABEL: test11:
|
|
|
|
|
; NORMAL: movl _the_global, [[EAX:%e..]]
|
|
|
|
|
; NORMAL-NEXT: movl $42, _the_global
|
|
|
|
|
; NORMAL-NEXT: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl $3
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl [[EAX]]
|
|
|
|
|
; NORMAL-NEXT: call
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
@the_global = external global i32
|
|
|
|
|
define void @test11() optsize {
|
2015-02-27 21:17:42 +00:00
|
|
|
%myload = load i32, i32* @the_global
|
2015-02-01 16:56:04 +00:00
|
|
|
store i32 42, i32* @the_global
|
|
|
|
|
call void @good(i32 %myload, i32 2, i32 3, i32 4)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
2015-02-12 08:36:35 +00:00
|
|
|
|
|
|
|
|
; Converting one mov into a push isn't worth it when
|
|
|
|
|
; doing so forces too much overhead for other calls.
|
|
|
|
|
; NORMAL-LABEL: test12:
|
|
|
|
|
; NORMAL: subl $16, %esp
|
|
|
|
|
; NORMAL-NEXT: movl $4, 8(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $3, 4(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $1, (%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $2, %eax
|
|
|
|
|
; NORMAL-NEXT: calll _inreg
|
|
|
|
|
; NORMAL-NEXT: movl $8, 12(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $7, 8(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $6, 4(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $5, (%esp)
|
|
|
|
|
; NORMAL-NEXT: calll _good
|
|
|
|
|
; NORMAL-NEXT: movl $12, 8(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $11, 4(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $9, (%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $10, %eax
|
|
|
|
|
; NORMAL-NEXT: calll _inreg
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
define void @test12() optsize {
|
|
|
|
|
entry:
|
|
|
|
|
call void @inreg(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
call void @good(i32 5, i32 6, i32 7, i32 8)
|
|
|
|
|
call void @inreg(i32 9, i32 10, i32 11, i32 12)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; But if the gains outweigh the overhead, we should do it
|
|
|
|
|
; NORMAL-LABEL: test12b:
|
|
|
|
|
; NORMAL: pushl $4
|
|
|
|
|
; NORMAL-NEXT: pushl $3
|
|
|
|
|
; NORMAL-NEXT: pushl $2
|
|
|
|
|
; NORMAL-NEXT: pushl $1
|
|
|
|
|
; NORMAL-NEXT: calll _good
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
; NORMAL-NEXT: subl $12, %esp
|
|
|
|
|
; NORMAL-NEXT: movl $8, 8(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $7, 4(%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $5, (%esp)
|
|
|
|
|
; NORMAL-NEXT: movl $6, %eax
|
|
|
|
|
; NORMAL-NEXT: calll _inreg
|
|
|
|
|
; NORMAL-NEXT: addl $12, %esp
|
|
|
|
|
; NORMAL-NEXT: pushl $12
|
|
|
|
|
; NORMAL-NEXT: pushl $11
|
|
|
|
|
; NORMAL-NEXT: pushl $10
|
|
|
|
|
; NORMAL-NEXT: pushl $9
|
|
|
|
|
; NORMAL-NEXT: calll _good
|
|
|
|
|
; NORMAL-NEXT: addl $16, %esp
|
|
|
|
|
define void @test12b() optsize {
|
|
|
|
|
entry:
|
|
|
|
|
call void @good(i32 1, i32 2, i32 3, i32 4)
|
|
|
|
|
call void @inreg(i32 5, i32 6, i32 7, i32 8)
|
|
|
|
|
call void @good(i32 9, i32 10, i32 11, i32 12)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
