mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-30 23:42:52 +01:00
2ac40ae0d3
First, taking advantage of the fact that the virtual base registers are allocated in order of the local frame offsets, remove the quadratic register-searching behavior. Because of the ordering, we only need to check the last virtual base register created. Second, store the frame index in the FrameRef structure, and get the frame index and the local offset from this structure at the top of the loop iteration. This allows us to de-nest the loops in insertFrameReferenceRegisters (and I think makes the code cleaner). I also moved the needsFrameBaseReg check into the first loop over instructions so that we don't bother pushing FrameRefs for instructions that don't want a virtual base register anyway. Lastly, and this is the only functionality change, avoid the creation of single-use virtual base registers. These are currently not useful because, in general, they end up replacing what would be one r+r instruction with an add and a r+i instruction. Committing this removes the XFAIL in CodeGen/PowerPC/2007-09-07-LoadStoreIdxForms.ll Jim has okayed this off-list. llvm-svn: 180799
21 lines
677 B
LLVM
21 lines
677 B
LLVM
; RUN: llc < %s -march=ppc64 | FileCheck %s
|
|
|
|
%struct.__db_region = type { %struct.__mutex_t, [4 x i8], %struct.anon, i32, [1 x i32] }
|
|
%struct.__mutex_t = type { i32 }
|
|
%struct.anon = type { i64, i64 }
|
|
|
|
define void @foo() {
|
|
entry:
|
|
%ttype = alloca i32, align 4 ; <i32*> [#uses=1]
|
|
%regs = alloca [1024 x %struct.__db_region], align 16 ; <[1024 x %struct.__db_region]*> [#uses=0]
|
|
%tmp = load i32* %ttype, align 4 ; <i32> [#uses=1]
|
|
%tmp1 = call i32 (...)* @bork( i32 %tmp ) ; <i32> [#uses=0]
|
|
ret void
|
|
|
|
; CHECK: @foo
|
|
; CHECK: lwzx
|
|
; CHECK: blr
|
|
}
|
|
|
|
declare i32 @bork(...)
|