1 //===-- MipsLongBranch.cpp - Emit long branches ---------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass expands a branch or jump instruction into a long branch if its
11 // offset is too large to fit into its immediate field.
13 // FIXME: Fix pc-region jump instructions which cross 256MB segment boundaries.
14 //===----------------------------------------------------------------------===//
17 #include "MCTargetDesc/MipsBaseInfo.h"
18 #include "MCTargetDesc/MipsMCNaCl.h"
19 #include "MipsMachineFunction.h"
20 #include "MipsTargetMachine.h"
21 #include "llvm/ADT/Statistic.h"
22 #include "llvm/CodeGen/MachineFunctionPass.h"
23 #include "llvm/CodeGen/MachineInstrBuilder.h"
24 #include "llvm/IR/Function.h"
25 #include "llvm/Support/CommandLine.h"
26 #include "llvm/Support/MathExtras.h"
27 #include "llvm/Target/TargetInstrInfo.h"
28 #include "llvm/Target/TargetMachine.h"
29 #include "llvm/Target/TargetRegisterInfo.h"
33 #define DEBUG_TYPE "mips-long-branch"
35 STATISTIC(LongBranches, "Number of long branches.");
37 static cl::opt<bool> SkipLongBranch(
38 "skip-mips-long-branch",
40 cl::desc("MIPS: Skip long branch pass."),
43 static cl::opt<bool> ForceLongBranch(
44 "force-mips-long-branch",
46 cl::desc("MIPS: Expand all branches to long format."),
50 typedef MachineBasicBlock::iterator Iter;
51 typedef MachineBasicBlock::reverse_iterator ReverseIter;
54 uint64_t Size, Address;
58 MBBInfo() : Size(0), HasLongBranch(false), Br(nullptr) {}
61 class MipsLongBranch : public MachineFunctionPass {
65 MipsLongBranch(TargetMachine &tm)
66 : MachineFunctionPass(ID), TM(tm),
67 IsPIC(TM.getRelocationModel() == Reloc::PIC_),
68 ABI(TM.getSubtarget<MipsSubtarget>().getTargetABI()),
69 LongBranchSeqSize(!IsPIC ? 2 : (ABI == MipsSubtarget::N64 ? 10 :
70 (!TM.getSubtarget<MipsSubtarget>().isTargetNaCl() ? 9 : 10))) {}
72 const char *getPassName() const override {
73 return "Mips Long Branch";
76 bool runOnMachineFunction(MachineFunction &F) override;
79 void splitMBB(MachineBasicBlock *MBB);
81 int64_t computeOffset(const MachineInstr *Br);
82 void replaceBranch(MachineBasicBlock &MBB, Iter Br, DebugLoc DL,
83 MachineBasicBlock *MBBOpnd);
84 void expandToLongBranch(MBBInfo &Info);
86 const TargetMachine &TM;
88 SmallVector<MBBInfo, 16> MBBInfos;
91 unsigned LongBranchSeqSize;
94 char MipsLongBranch::ID = 0;
95 } // end of anonymous namespace
97 /// createMipsLongBranchPass - Returns a pass that converts branches to long
99 FunctionPass *llvm::createMipsLongBranchPass(MipsTargetMachine &tm) {
100 return new MipsLongBranch(tm);
103 /// Iterate over list of Br's operands and search for a MachineBasicBlock
105 static MachineBasicBlock *getTargetMBB(const MachineInstr &Br) {
106 for (unsigned I = 0, E = Br.getDesc().getNumOperands(); I < E; ++I) {
107 const MachineOperand &MO = Br.getOperand(I);
113 assert(false && "This instruction does not have an MBB operand.");
117 // Traverse the list of instructions backwards until a non-debug instruction is
118 // found or it reaches E.
119 static ReverseIter getNonDebugInstr(ReverseIter B, ReverseIter E) {
121 if (!B->isDebugValue())
127 // Split MBB if it has two direct jumps/branches.
128 void MipsLongBranch::splitMBB(MachineBasicBlock *MBB) {
129 ReverseIter End = MBB->rend();
130 ReverseIter LastBr = getNonDebugInstr(MBB->rbegin(), End);
132 // Return if MBB has no branch instructions.
133 if ((LastBr == End) ||
134 (!LastBr->isConditionalBranch() && !LastBr->isUnconditionalBranch()))
137 ReverseIter FirstBr = getNonDebugInstr(std::next(LastBr), End);
139 // MBB has only one branch instruction if FirstBr is not a branch
141 if ((FirstBr == End) ||
142 (!FirstBr->isConditionalBranch() && !FirstBr->isUnconditionalBranch()))
145 assert(!FirstBr->isIndirectBranch() && "Unexpected indirect branch found.");
147 // Create a new MBB. Move instructions in MBB to the newly created MBB.
148 MachineBasicBlock *NewMBB =
149 MF->CreateMachineBasicBlock(MBB->getBasicBlock());
151 // Insert NewMBB and fix control flow.
152 MachineBasicBlock *Tgt = getTargetMBB(*FirstBr);
153 NewMBB->transferSuccessors(MBB);
154 NewMBB->removeSuccessor(Tgt);
155 MBB->addSuccessor(NewMBB);
156 MBB->addSuccessor(Tgt);
157 MF->insert(std::next(MachineFunction::iterator(MBB)), NewMBB);
159 NewMBB->splice(NewMBB->end(), MBB, (++LastBr).base(), MBB->end());
163 void MipsLongBranch::initMBBInfo() {
164 // Split the MBBs if they have two branches. Each basic block should have at
165 // most one branch after this loop is executed.
166 for (MachineFunction::iterator I = MF->begin(), E = MF->end(); I != E;)
169 MF->RenumberBlocks();
171 MBBInfos.resize(MF->size());
173 const MipsInstrInfo *TII =
174 static_cast<const MipsInstrInfo *>(TM.getSubtargetImpl()->getInstrInfo());
175 for (unsigned I = 0, E = MBBInfos.size(); I < E; ++I) {
176 MachineBasicBlock *MBB = MF->getBlockNumbered(I);
178 // Compute size of MBB.
179 for (MachineBasicBlock::instr_iterator MI = MBB->instr_begin();
180 MI != MBB->instr_end(); ++MI)
181 MBBInfos[I].Size += TII->GetInstSizeInBytes(&*MI);
183 // Search for MBB's branch instruction.
184 ReverseIter End = MBB->rend();
185 ReverseIter Br = getNonDebugInstr(MBB->rbegin(), End);
187 if ((Br != End) && !Br->isIndirectBranch() &&
188 (Br->isConditionalBranch() ||
189 (Br->isUnconditionalBranch() &&
190 TM.getRelocationModel() == Reloc::PIC_)))
191 MBBInfos[I].Br = (++Br).base();
195 // Compute offset of branch in number of bytes.
196 int64_t MipsLongBranch::computeOffset(const MachineInstr *Br) {
198 int ThisMBB = Br->getParent()->getNumber();
199 int TargetMBB = getTargetMBB(*Br)->getNumber();
201 // Compute offset of a forward branch.
202 if (ThisMBB < TargetMBB) {
203 for (int N = ThisMBB + 1; N < TargetMBB; ++N)
204 Offset += MBBInfos[N].Size;
209 // Compute offset of a backward branch.
210 for (int N = ThisMBB; N >= TargetMBB; --N)
211 Offset += MBBInfos[N].Size;
216 // Replace Br with a branch which has the opposite condition code and a
217 // MachineBasicBlock operand MBBOpnd.
218 void MipsLongBranch::replaceBranch(MachineBasicBlock &MBB, Iter Br,
219 DebugLoc DL, MachineBasicBlock *MBBOpnd) {
220 const MipsInstrInfo *TII =
221 static_cast<const MipsInstrInfo *>(TM.getSubtargetImpl()->getInstrInfo());
222 unsigned NewOpc = TII->getOppositeBranchOpc(Br->getOpcode());
223 const MCInstrDesc &NewDesc = TII->get(NewOpc);
225 MachineInstrBuilder MIB = BuildMI(MBB, Br, DL, NewDesc);
227 for (unsigned I = 0, E = Br->getDesc().getNumOperands(); I < E; ++I) {
228 MachineOperand &MO = Br->getOperand(I);
231 assert(MO.isMBB() && "MBB operand expected.");
235 MIB.addReg(MO.getReg());
240 // Bundle the instruction in the delay slot to the newly created branch
241 // and erase the original branch.
242 assert(Br->isBundledWithSucc());
243 MachineBasicBlock::instr_iterator II(Br);
244 MIBundleBuilder(&*MIB).append((++II)->removeFromBundle());
245 Br->eraseFromParent();
248 // Expand branch instructions to long branches.
249 void MipsLongBranch::expandToLongBranch(MBBInfo &I) {
250 MachineBasicBlock::iterator Pos;
251 MachineBasicBlock *MBB = I.Br->getParent(), *TgtMBB = getTargetMBB(*I.Br);
252 DebugLoc DL = I.Br->getDebugLoc();
253 const BasicBlock *BB = MBB->getBasicBlock();
254 MachineFunction::iterator FallThroughMBB = ++MachineFunction::iterator(MBB);
255 MachineBasicBlock *LongBrMBB = MF->CreateMachineBasicBlock(BB);
257 const MipsInstrInfo *TII =
258 static_cast<const MipsInstrInfo *>(TM.getSubtargetImpl()->getInstrInfo());
260 MF->insert(FallThroughMBB, LongBrMBB);
261 MBB->removeSuccessor(TgtMBB);
262 MBB->addSuccessor(LongBrMBB);
265 MachineBasicBlock *BalTgtMBB = MF->CreateMachineBasicBlock(BB);
266 MF->insert(FallThroughMBB, BalTgtMBB);
267 LongBrMBB->addSuccessor(BalTgtMBB);
268 BalTgtMBB->addSuccessor(TgtMBB);
270 // We must select between the MIPS32r6/MIPS64r6 BAL (which is a normal
271 // instruction) and the pre-MIPS32r6/MIPS64r6 definition (which is an
272 // pseudo-instruction wrapping BGEZAL).
274 const MipsSubtarget &Subtarget = TM.getSubtarget<MipsSubtarget>();
275 unsigned BalOp = Subtarget.hasMips32r6() ? Mips::BAL : Mips::BAL_BR;
277 if (ABI != MipsSubtarget::N64) {
279 // addiu $sp, $sp, -8
281 // lui $at, %hi($tgt - $baltgt)
283 // addiu $at, $at, %lo($tgt - $baltgt)
285 // addu $at, $ra, $at
292 Pos = LongBrMBB->begin();
294 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::ADDiu), Mips::SP)
295 .addReg(Mips::SP).addImm(-8);
296 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::SW)).addReg(Mips::RA)
297 .addReg(Mips::SP).addImm(0);
299 // LUi and ADDiu instructions create 32-bit offset of the target basic
300 // block from the target of BAL instruction. We cannot use immediate
301 // value for this offset because it cannot be determined accurately when
302 // the program has inline assembly statements. We therefore use the
303 // relocation expressions %hi($tgt-$baltgt) and %lo($tgt-$baltgt) which
304 // are resolved during the fixup, so the values will always be correct.
306 // Since we cannot create %hi($tgt-$baltgt) and %lo($tgt-$baltgt)
307 // expressions at this point (it is possible only at the MC layer),
308 // we replace LUi and ADDiu with pseudo instructions
309 // LONG_BRANCH_LUi and LONG_BRANCH_ADDiu, and add both basic
310 // blocks as operands to these instructions. When lowering these pseudo
311 // instructions to LUi and ADDiu in the MC layer, we will create
312 // %hi($tgt-$baltgt) and %lo($tgt-$baltgt) expressions and add them as
313 // operands to lowered instructions.
315 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::LONG_BRANCH_LUi), Mips::AT)
316 .addMBB(TgtMBB).addMBB(BalTgtMBB);
317 MIBundleBuilder(*LongBrMBB, Pos)
318 .append(BuildMI(*MF, DL, TII->get(BalOp)).addMBB(BalTgtMBB))
319 .append(BuildMI(*MF, DL, TII->get(Mips::LONG_BRANCH_ADDiu), Mips::AT)
324 Pos = BalTgtMBB->begin();
326 BuildMI(*BalTgtMBB, Pos, DL, TII->get(Mips::ADDu), Mips::AT)
327 .addReg(Mips::RA).addReg(Mips::AT);
328 BuildMI(*BalTgtMBB, Pos, DL, TII->get(Mips::LW), Mips::RA)
329 .addReg(Mips::SP).addImm(0);
331 if (!TM.getSubtarget<MipsSubtarget>().isTargetNaCl()) {
332 MIBundleBuilder(*BalTgtMBB, Pos)
333 .append(BuildMI(*MF, DL, TII->get(Mips::JR)).addReg(Mips::AT))
334 .append(BuildMI(*MF, DL, TII->get(Mips::ADDiu), Mips::SP)
335 .addReg(Mips::SP).addImm(8));
337 // In NaCl, modifying the sp is not allowed in branch delay slot.
338 BuildMI(*BalTgtMBB, Pos, DL, TII->get(Mips::ADDiu), Mips::SP)
339 .addReg(Mips::SP).addImm(8);
341 MIBundleBuilder(*BalTgtMBB, Pos)
342 .append(BuildMI(*MF, DL, TII->get(Mips::JR)).addReg(Mips::AT))
343 .append(BuildMI(*MF, DL, TII->get(Mips::NOP)));
345 // Bundle-align the target of indirect branch JR.
346 TgtMBB->setAlignment(MIPS_NACL_BUNDLE_ALIGN);
350 // daddiu $sp, $sp, -16
352 // daddiu $at, $zero, %hi($tgt - $baltgt)
355 // daddiu $at, $at, %lo($tgt - $baltgt)
357 // daddu $at, $ra, $at
360 // daddiu $sp, $sp, 16
364 // We assume the branch is within-function, and that offset is within
365 // +/- 2GB. High 32 bits will therefore always be zero.
367 // Note that this will work even if the offset is negative, because
368 // of the +1 modification that's added in that case. For example, if the
369 // offset is -1MB (0xFFFFFFFFFFF00000), the computation for %higher is
371 // 0xFFFFFFFFFFF00000 + 0x80008000 = 0x000000007FF08000
373 // and the bits [47:32] are zero. For %highest
375 // 0xFFFFFFFFFFF00000 + 0x800080008000 = 0x000080007FF08000
377 // and the bits [63:48] are zero.
379 Pos = LongBrMBB->begin();
381 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::DADDiu), Mips::SP_64)
382 .addReg(Mips::SP_64).addImm(-16);
383 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::SD)).addReg(Mips::RA_64)
384 .addReg(Mips::SP_64).addImm(0);
385 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::LONG_BRANCH_DADDiu),
386 Mips::AT_64).addReg(Mips::ZERO_64)
387 .addMBB(TgtMBB, MipsII::MO_ABS_HI).addMBB(BalTgtMBB);
388 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::DSLL), Mips::AT_64)
389 .addReg(Mips::AT_64).addImm(16);
391 MIBundleBuilder(*LongBrMBB, Pos)
392 .append(BuildMI(*MF, DL, TII->get(BalOp)).addMBB(BalTgtMBB))
394 BuildMI(*MF, DL, TII->get(Mips::LONG_BRANCH_DADDiu), Mips::AT_64)
396 .addMBB(TgtMBB, MipsII::MO_ABS_LO)
399 Pos = BalTgtMBB->begin();
401 BuildMI(*BalTgtMBB, Pos, DL, TII->get(Mips::DADDu), Mips::AT_64)
402 .addReg(Mips::RA_64).addReg(Mips::AT_64);
403 BuildMI(*BalTgtMBB, Pos, DL, TII->get(Mips::LD), Mips::RA_64)
404 .addReg(Mips::SP_64).addImm(0);
406 MIBundleBuilder(*BalTgtMBB, Pos)
407 .append(BuildMI(*MF, DL, TII->get(Mips::JR64)).addReg(Mips::AT_64))
408 .append(BuildMI(*MF, DL, TII->get(Mips::DADDiu), Mips::SP_64)
409 .addReg(Mips::SP_64).addImm(16));
412 assert(LongBrMBB->size() + BalTgtMBB->size() == LongBranchSeqSize);
419 Pos = LongBrMBB->begin();
420 LongBrMBB->addSuccessor(TgtMBB);
421 MIBundleBuilder(*LongBrMBB, Pos)
422 .append(BuildMI(*MF, DL, TII->get(Mips::J)).addMBB(TgtMBB))
423 .append(BuildMI(*MF, DL, TII->get(Mips::NOP)));
425 assert(LongBrMBB->size() == LongBranchSeqSize);
428 if (I.Br->isUnconditionalBranch()) {
429 // Change branch destination.
430 assert(I.Br->getDesc().getNumOperands() == 1);
431 I.Br->RemoveOperand(0);
432 I.Br->addOperand(MachineOperand::CreateMBB(LongBrMBB));
434 // Change branch destination and reverse condition.
435 replaceBranch(*MBB, I.Br, DL, FallThroughMBB);
438 static void emitGPDisp(MachineFunction &F, const MipsInstrInfo *TII) {
439 MachineBasicBlock &MBB = F.front();
440 MachineBasicBlock::iterator I = MBB.begin();
441 DebugLoc DL = MBB.findDebugLoc(MBB.begin());
442 BuildMI(MBB, I, DL, TII->get(Mips::LUi), Mips::V0)
443 .addExternalSymbol("_gp_disp", MipsII::MO_ABS_HI);
444 BuildMI(MBB, I, DL, TII->get(Mips::ADDiu), Mips::V0)
445 .addReg(Mips::V0).addExternalSymbol("_gp_disp", MipsII::MO_ABS_LO);
446 MBB.removeLiveIn(Mips::V0);
449 bool MipsLongBranch::runOnMachineFunction(MachineFunction &F) {
450 const MipsInstrInfo *TII =
451 static_cast<const MipsInstrInfo *>(TM.getSubtargetImpl()->getInstrInfo());
453 const MipsSubtarget &STI = TM.getSubtarget<MipsSubtarget>();
454 if (STI.inMips16Mode() || !STI.enableLongBranchPass())
456 if ((TM.getRelocationModel() == Reloc::PIC_) &&
457 TM.getSubtarget<MipsSubtarget>().isABI_O32() &&
458 F.getInfo<MipsFunctionInfo>()->globalBaseRegSet())
467 SmallVectorImpl<MBBInfo>::iterator I, E = MBBInfos.end();
468 bool EverMadeChange = false, MadeChange = true;
473 for (I = MBBInfos.begin(); I != E; ++I) {
474 // Skip if this MBB doesn't have a branch or the branch has already been
475 // converted to a long branch.
476 if (!I->Br || I->HasLongBranch)
479 int ShVal = TM.getSubtarget<MipsSubtarget>().inMicroMipsMode() ? 2 : 4;
480 int64_t Offset = computeOffset(I->Br) / ShVal;
482 if (TM.getSubtarget<MipsSubtarget>().isTargetNaCl()) {
483 // The offset calculation does not include sandboxing instructions
484 // that will be added later in the MC layer. Since at this point we
485 // don't know the exact amount of code that "sandboxing" will add, we
486 // conservatively estimate that code will not grow more than 100%.
490 // Check if offset fits into 16-bit immediate field of branches.
491 if (!ForceLongBranch && isInt<16>(Offset))
494 I->HasLongBranch = true;
495 I->Size += LongBranchSeqSize * 4;
497 EverMadeChange = MadeChange = true;
504 // Compute basic block addresses.
505 if (TM.getRelocationModel() == Reloc::PIC_) {
506 uint64_t Address = 0;
508 for (I = MBBInfos.begin(); I != E; Address += I->Size, ++I)
509 I->Address = Address;
513 for (I = MBBInfos.begin(); I != E; ++I)
514 if (I->HasLongBranch)
515 expandToLongBranch(*I);
517 MF->RenumberBlocks();