mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 12:02:58 +02:00
0558b04f57
This reverts commit r262370. It turns out there is code out there that does sequences of allocas greater than 4K: http://crbug.com/591404 The goal of this change was to improve the code size of inalloca call sequences, but we got tangled up in the mess of dynamic allocas. Instead, we should come back later with a separate MI pass that uses dominance to optimize the full sequence. This should also be able to remove the often unneeded stacksave/stackrestore pairs around the call. llvm-svn: 262505
28 lines
697 B
LLVM
28 lines
697 B
LLVM
; RUN: llc < %s -mtriple=i686-pc-win32 | FileCheck %s
|
|
|
|
%Foo = type { i32, i32 }
|
|
|
|
declare x86_stdcallcc void @f(%Foo* inalloca %a)
|
|
declare x86_stdcallcc void @i(i32 %a)
|
|
|
|
define void @g() {
|
|
; CHECK-LABEL: _g:
|
|
%b = alloca inalloca %Foo
|
|
; CHECK: movl $8, %eax
|
|
; CHECK: calll __chkstk
|
|
%f1 = getelementptr %Foo, %Foo* %b, i32 0, i32 0
|
|
%f2 = getelementptr %Foo, %Foo* %b, i32 0, i32 1
|
|
store i32 13, i32* %f1
|
|
store i32 42, i32* %f2
|
|
; CHECK: movl %esp, %eax
|
|
; CHECK: movl $13, (%eax)
|
|
; CHECK: movl $42, 4(%eax)
|
|
call x86_stdcallcc void @f(%Foo* inalloca %b)
|
|
; CHECK: calll _f@8
|
|
; CHECK-NOT: %esp
|
|
; CHECK: pushl
|
|
; CHECK: calll _i@4
|
|
call x86_stdcallcc void @i(i32 0)
|
|
ret void
|
|
}
|