//===-- MipsFrameLowering.cpp - Mips Frame Information --------------------===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // // This file contains the Mips implementation of TargetFrameLowering class. // //===----------------------------------------------------------------------===// #include "MipsFrameLowering.h" #include "MCTargetDesc/MipsBaseInfo.h" #include "MipsInstrInfo.h" #include "MipsMachineFunction.h" #include "MipsTargetMachine.h" #include "llvm/CodeGen/MachineFrameInfo.h" #include "llvm/CodeGen/MachineFunction.h" #include "llvm/CodeGen/MachineInstrBuilder.h" #include "llvm/CodeGen/MachineModuleInfo.h" #include "llvm/CodeGen/MachineRegisterInfo.h" #include "llvm/IR/DataLayout.h" #include "llvm/IR/Function.h" #include "llvm/Target/TargetOptions.h" usingnamespacellvm; //===----------------------------------------------------------------------===// // // Stack Frame Processing methods // +----------------------------+ // // The stack is allocated decrementing the stack pointer on // the first instruction of a function prologue. Once decremented, // all stack references are done thought a positive offset // from the stack/frame pointer, so the stack is considering // to grow up! Otherwise terrible hacks would have to be made // to get this stack ABI compliant :) // // The stack frame required by the ABI (after call): // Offset // // 0 ---------- // 4 Args to pass // . saved $GP (used in PIC) // . Alloca allocations // . Local Area // . CPU "Callee Saved" Registers // . saved FP // . saved RA // . FPU "Callee Saved" Registers // StackSize ----------- // // Offset - offset from sp after stack allocation on function prologue // // The sp is the stack pointer subtracted/added from the stack size // at the Prologue/Epilogue // // References to the previous stack (to obtain arguments) are done // with offsets that exceeds the stack size: (stacksize+(4*(num_arg-1)) // // Examples: // - reference to the actual stack frame // for any local area var there is smt like : FI >= 0, StackOffset: 4 // sw REGX, 4(SP) // // - reference to previous stack frame // suppose there's a load to the 5th arguments : FI < 0, StackOffset: 16. // The emitted instruction will be something like: // lw REGX, 16+StackSize(SP) // // Since the total stack size is unknown on LowerFormalArguments, all // stack references (ObjectOffset) created to reference the function // arguments, are negative numbers. This way, on eliminateFrameIndex it's // possible to detect those references and the offsets are adjusted to // their real location. // //===----------------------------------------------------------------------===// const MipsFrameLowering *MipsFrameLowering::create(const MipsSubtarget &ST) { … } // hasFP - Return true if the specified function should have a dedicated frame // pointer register. This is true if the function has variable sized allocas, // if it needs dynamic stack realignment, if frame pointer elimination is // disabled, or if the frame address is taken. bool MipsFrameLowering::hasFP(const MachineFunction &MF) const { … } bool MipsFrameLowering::hasBP(const MachineFunction &MF) const { … } // Estimate the size of the stack, including the incoming arguments. We need to // account for register spills, local objects, reserved call frame and incoming // arguments. This is required to determine the largest possible positive offset // from $sp so that it can be determined if an emergency spill slot for stack // addresses is required. uint64_t MipsFrameLowering::estimateStackSize(const MachineFunction &MF) const { … } // Eliminate ADJCALLSTACKDOWN, ADJCALLSTACKUP pseudo instructions MachineBasicBlock::iterator MipsFrameLowering:: eliminateCallFramePseudoInstr(MachineFunction &MF, MachineBasicBlock &MBB, MachineBasicBlock::iterator I) const { … }