forked from OSchip/llvm-project
ARM: don't rely on push/pop reglists being in order when folding SP adjust.
It would be a very nice invariant to rely on, but unfortunately it doesn't necessarily hold (and the causes of mis-sorted reglists appear to be quite varied) so to be robust the frame lowering code can't assume that the first register in the list is also the first one that actually gets pushed. Should fix an issue where we were turning something like: push {r8, r4, r7, lr} sub sp, #24 into nonsense like: push {r2, r3, r4, r5, r6, r7, r8, r4, r7, lr} llvm-svn: 285232
This commit is contained in:
parent
275853e777
commit
a9cc385664
|
@ -2077,29 +2077,40 @@ bool llvm::tryFoldSPUpdateIntoPushPop(const ARMSubtarget &Subtarget,
|
||||||
int RegListIdx = IsT1PushPop ? 2 : 4;
|
int RegListIdx = IsT1PushPop ? 2 : 4;
|
||||||
|
|
||||||
// Calculate the space we'll need in terms of registers.
|
// Calculate the space we'll need in terms of registers.
|
||||||
unsigned FirstReg = MI->getOperand(RegListIdx).getReg();
|
unsigned RegsNeeded;
|
||||||
unsigned RD0Reg, RegsNeeded;
|
const TargetRegisterClass *RegClass;
|
||||||
if (IsVFPPushPop) {
|
if (IsVFPPushPop) {
|
||||||
RD0Reg = ARM::D0;
|
|
||||||
RegsNeeded = NumBytes / 8;
|
RegsNeeded = NumBytes / 8;
|
||||||
|
RegClass = &ARM::DPRRegClass;
|
||||||
} else {
|
} else {
|
||||||
RD0Reg = ARM::R0;
|
|
||||||
RegsNeeded = NumBytes / 4;
|
RegsNeeded = NumBytes / 4;
|
||||||
|
RegClass = &ARM::GPRRegClass;
|
||||||
}
|
}
|
||||||
|
|
||||||
// We're going to have to strip all list operands off before
|
// We're going to have to strip all list operands off before
|
||||||
// re-adding them since the order matters, so save the existing ones
|
// re-adding them since the order matters, so save the existing ones
|
||||||
// for later.
|
// for later.
|
||||||
SmallVector<MachineOperand, 4> RegList;
|
SmallVector<MachineOperand, 4> RegList;
|
||||||
for (int i = MI->getNumOperands() - 1; i >= RegListIdx; --i)
|
|
||||||
RegList.push_back(MI->getOperand(i));
|
// We're also going to need the first register transferred by this
|
||||||
|
// instruction, which won't necessarily be the first register in the list.
|
||||||
|
unsigned FirstRegEnc = -1;
|
||||||
|
|
||||||
const TargetRegisterInfo *TRI = MF.getRegInfo().getTargetRegisterInfo();
|
const TargetRegisterInfo *TRI = MF.getRegInfo().getTargetRegisterInfo();
|
||||||
|
for (int i = MI->getNumOperands() - 1; i >= RegListIdx; --i) {
|
||||||
|
MachineOperand &MO = MI->getOperand(i);
|
||||||
|
RegList.push_back(MO);
|
||||||
|
|
||||||
|
if (MO.isReg() && TRI->getEncodingValue(MO.getReg()) < FirstRegEnc)
|
||||||
|
FirstRegEnc = TRI->getEncodingValue(MO.getReg());
|
||||||
|
}
|
||||||
|
|
||||||
const MCPhysReg *CSRegs = TRI->getCalleeSavedRegs(&MF);
|
const MCPhysReg *CSRegs = TRI->getCalleeSavedRegs(&MF);
|
||||||
|
|
||||||
// Now try to find enough space in the reglist to allocate NumBytes.
|
// Now try to find enough space in the reglist to allocate NumBytes.
|
||||||
for (unsigned CurReg = FirstReg - 1; CurReg >= RD0Reg && RegsNeeded;
|
for (int CurRegEnc = FirstRegEnc - 1; CurRegEnc >= 0 && RegsNeeded;
|
||||||
--CurReg) {
|
--CurRegEnc) {
|
||||||
|
unsigned CurReg = RegClass->getRegister(CurRegEnc);
|
||||||
if (!IsPop) {
|
if (!IsPop) {
|
||||||
// Pushing any register is completely harmless, mark the
|
// Pushing any register is completely harmless, mark the
|
||||||
// register involved as undef since we don't care about it in
|
// register involved as undef since we don't care about it in
|
||||||
|
|
|
@ -218,4 +218,18 @@ exit: ; preds = %if.then, %entry
|
||||||
ret float %call1
|
ret float %call1
|
||||||
}
|
}
|
||||||
|
|
||||||
|
declare void @use_arr(i32*)
|
||||||
|
define void @test_fold_reuse() minsize {
|
||||||
|
; CHECK-LABEL: test_fold_reuse:
|
||||||
|
; CHECK: push.w {r4, r7, r8, lr}
|
||||||
|
; CHECK: sub sp, #24
|
||||||
|
; [...]
|
||||||
|
; CHECK: add sp, #24
|
||||||
|
; CHECK: pop.w {r4, r7, r8, pc}
|
||||||
|
%arr = alloca i8, i32 24
|
||||||
|
call void asm sideeffect "", "~{r8},~{r4}"()
|
||||||
|
call void @bar(i8* %arr)
|
||||||
|
ret void
|
||||||
|
}
|
||||||
|
|
||||||
declare void @llvm.va_start(i8*) nounwind
|
declare void @llvm.va_start(i8*) nounwind
|
||||||
|
|
Loading…
Reference in New Issue