blob: 6977093923af62c9813b83d4b9ed2cf189fc89b5 [file] [log] [blame]
Nate Begeman21e463b2005-10-16 05:39:50 +00001//===-- PPCBranchSelector.cpp - Emit long conditional branches-----*- C++ -*-=//
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002//
Misha Brukman999d9cf2004-07-27 18:33:06 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattner4ee451d2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00007//
Misha Brukman999d9cf2004-07-27 18:33:06 +00008//===----------------------------------------------------------------------===//
9//
Misha Brukmanb5f662f2005-04-21 23:30:14 +000010// This file contains a pass that scans a machine function to determine which
Misha Brukman999d9cf2004-07-27 18:33:06 +000011// conditional branches need more than 16 bits of displacement to reach their
12// target basic block. It does this in two passes; a calculation of basic block
13// positions pass, and a branch psuedo op to machine branch opcode pass. This
14// pass should be run last, just before the assembly printer.
15//
16//===----------------------------------------------------------------------===//
17
Chris Lattner95b2c7d2006-12-19 22:59:26 +000018#define DEBUG_TYPE "ppc-branch-select"
Chris Lattner26689592005-10-14 23:51:18 +000019#include "PPC.h"
Chris Lattner26bd0d42005-10-14 23:45:43 +000020#include "PPCInstrBuilder.h"
Chris Lattner16e71f22005-10-14 23:59:06 +000021#include "PPCInstrInfo.h"
Chris Lattnerdf4ed632006-11-17 22:10:59 +000022#include "PPCPredicates.h"
Misha Brukman999d9cf2004-07-27 18:33:06 +000023#include "llvm/CodeGen/MachineFunctionPass.h"
Chris Lattnereea52d32006-10-13 17:56:02 +000024#include "llvm/Target/TargetMachine.h"
25#include "llvm/Target/TargetAsmInfo.h"
Chris Lattnercb535952006-11-16 18:13:49 +000026#include "llvm/ADT/Statistic.h"
27#include "llvm/Support/Compiler.h"
Chris Lattner54e853b2006-11-18 00:32:03 +000028#include "llvm/Support/MathExtras.h"
Misha Brukman999d9cf2004-07-27 18:33:06 +000029using namespace llvm;
30
Chris Lattner95b2c7d2006-12-19 22:59:26 +000031STATISTIC(NumExpanded, "Number of branches expanded to long format");
Chris Lattnercb535952006-11-16 18:13:49 +000032
Misha Brukman999d9cf2004-07-27 18:33:06 +000033namespace {
Chris Lattner95255282006-06-28 23:17:24 +000034 struct VISIBILITY_HIDDEN PPCBSel : public MachineFunctionPass {
Devang Patel19974732007-05-03 01:11:54 +000035 static char ID;
Devang Patel794fd752007-05-01 21:15:47 +000036 PPCBSel() : MachineFunctionPass((intptr_t)&ID) {}
37
Chris Lattner54e853b2006-11-18 00:32:03 +000038 /// BlockSizes - The sizes of the basic blocks in the function.
39 std::vector<unsigned> BlockSizes;
Misha Brukman999d9cf2004-07-27 18:33:06 +000040
Chris Lattner6f4a0722006-02-08 19:33:26 +000041 virtual bool runOnMachineFunction(MachineFunction &Fn);
Misha Brukman999d9cf2004-07-27 18:33:06 +000042
43 virtual const char *getPassName() const {
Chris Lattner54e853b2006-11-18 00:32:03 +000044 return "PowerPC Branch Selector";
Misha Brukman999d9cf2004-07-27 18:33:06 +000045 }
46 };
Devang Patel19974732007-05-03 01:11:54 +000047 char PPCBSel::ID = 0;
Misha Brukman999d9cf2004-07-27 18:33:06 +000048}
49
50/// createPPCBranchSelectionPass - returns an instance of the Branch Selection
51/// Pass
52///
53FunctionPass *llvm::createPPCBranchSelectionPass() {
Chris Lattner6f4a0722006-02-08 19:33:26 +000054 return new PPCBSel();
Misha Brukman999d9cf2004-07-27 18:33:06 +000055}
Chris Lattner6f4a0722006-02-08 19:33:26 +000056
57/// getNumBytesForInstruction - Return the number of bytes of code the specified
58/// instruction may be. This returns the maximum number of bytes.
59///
60static unsigned getNumBytesForInstruction(MachineInstr *MI) {
61 switch (MI->getOpcode()) {
Chris Lattnereea52d32006-10-13 17:56:02 +000062 case PPC::INLINEASM: { // Inline Asm: Variable size.
63 MachineFunction *MF = MI->getParent()->getParent();
64 const char *AsmStr = MI->getOperand(0).getSymbolName();
65 return MF->getTarget().getTargetAsmInfo()->getInlineAsmLength(AsmStr);
66 }
Jim Laskey1ee29252007-01-26 14:34:52 +000067 case PPC::LABEL: {
68 return 0;
69 }
Chris Lattner6f4a0722006-02-08 19:33:26 +000070 default:
71 return 4; // PowerPC instructions are all 4 bytes
72 }
73}
74
75
76bool PPCBSel::runOnMachineFunction(MachineFunction &Fn) {
Evan Chengc0f64ff2006-11-27 23:37:22 +000077 const TargetInstrInfo *TII = Fn.getTarget().getInstrInfo();
Chris Lattner54e853b2006-11-18 00:32:03 +000078 // Give the blocks of the function a dense, in-order, numbering.
79 Fn.RenumberBlocks();
80 BlockSizes.resize(Fn.getNumBlockIDs());
81
82 // Measure each MBB and compute a size for the entire function.
83 unsigned FuncSize = 0;
Chris Lattner6f4a0722006-02-08 19:33:26 +000084 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
85 ++MFI) {
86 MachineBasicBlock *MBB = MFI;
Chris Lattner54e853b2006-11-18 00:32:03 +000087
88 unsigned BlockSize = 0;
Chris Lattner6f4a0722006-02-08 19:33:26 +000089 for (MachineBasicBlock::iterator MBBI = MBB->begin(), EE = MBB->end();
90 MBBI != EE; ++MBBI)
Chris Lattner54e853b2006-11-18 00:32:03 +000091 BlockSize += getNumBytesForInstruction(MBBI);
Chris Lattner6f4a0722006-02-08 19:33:26 +000092
Chris Lattner54e853b2006-11-18 00:32:03 +000093 BlockSizes[MBB->getNumber()] = BlockSize;
94 FuncSize += BlockSize;
Chris Lattner6f4a0722006-02-08 19:33:26 +000095 }
96
Chris Lattner54e853b2006-11-18 00:32:03 +000097 // If the entire function is smaller than the displacement of a branch field,
98 // we know we don't need to shrink any branches in this function. This is a
99 // common case.
100 if (FuncSize < (1 << 15)) {
101 BlockSizes.clear();
102 return false;
103 }
104
105 // For each conditional branch, if the offset to its destination is larger
106 // than the offset field allows, transform it into a long branch sequence
107 // like this:
108 // short branch:
109 // bCC MBB
110 // long branch:
111 // b!CC $PC+8
112 // b MBB
113 //
114 bool MadeChange = true;
115 bool EverMadeChange = false;
116 while (MadeChange) {
117 // Iteratively expand branches until we reach a fixed point.
118 MadeChange = false;
119
120 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
121 ++MFI) {
122 MachineBasicBlock &MBB = *MFI;
123 unsigned MBBStartOffset = 0;
124 for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end();
125 I != E; ++I) {
Dan Gohman92dfe202007-09-14 20:33:02 +0000126 if (I->getOpcode() != PPC::BCC || I->getOperand(2).isImmediate()) {
Chris Lattner54e853b2006-11-18 00:32:03 +0000127 MBBStartOffset += getNumBytesForInstruction(I);
128 continue;
129 }
130
131 // Determine the offset from the current branch to the destination
132 // block.
Chris Lattner8aa797a2007-12-30 23:10:15 +0000133 MachineBasicBlock *Dest = I->getOperand(2).getMBB();
Chris Lattner54e853b2006-11-18 00:32:03 +0000134
135 int BranchSize;
136 if (Dest->getNumber() <= MBB.getNumber()) {
137 // If this is a backwards branch, the delta is the offset from the
138 // start of this block to this branch, plus the sizes of all blocks
139 // from this block to the dest.
140 BranchSize = MBBStartOffset;
141
142 for (unsigned i = Dest->getNumber(), e = MBB.getNumber(); i != e; ++i)
143 BranchSize += BlockSizes[i];
144 } else {
145 // Otherwise, add the size of the blocks between this block and the
146 // dest to the number of bytes left in this block.
147 BranchSize = -MBBStartOffset;
148
149 for (unsigned i = MBB.getNumber(), e = Dest->getNumber(); i != e; ++i)
150 BranchSize += BlockSizes[i];
151 }
152
153 // If this branch is in range, ignore it.
154 if (isInt16(BranchSize)) {
155 MBBStartOffset += 4;
156 continue;
157 }
158
159 // Otherwise, we have to expand it to a long branch.
160 // The BCC operands are:
161 // 0. PPC branch predicate
162 // 1. CR register
163 // 2. Target MBB
164 PPC::Predicate Pred = (PPC::Predicate)I->getOperand(0).getImm();
165 unsigned CRReg = I->getOperand(1).getReg();
166
167 MachineInstr *OldBranch = I;
168
169 // Jump over the uncond branch inst (i.e. $PC+8) on opposite condition.
Evan Chengc0f64ff2006-11-27 23:37:22 +0000170 BuildMI(MBB, I, TII->get(PPC::BCC))
Chris Lattner54e853b2006-11-18 00:32:03 +0000171 .addImm(PPC::InvertPredicate(Pred)).addReg(CRReg).addImm(2);
172
173 // Uncond branch to the real destination.
Evan Chengc0f64ff2006-11-27 23:37:22 +0000174 I = BuildMI(MBB, I, TII->get(PPC::B)).addMBB(Dest);
Chris Lattner54e853b2006-11-18 00:32:03 +0000175
176 // Remove the old branch from the function.
177 OldBranch->eraseFromParent();
178
179 // Remember that this instruction is 8-bytes, increase the size of the
180 // block by 4, remember to iterate.
181 BlockSizes[MBB.getNumber()] += 4;
182 MBBStartOffset += 8;
183 ++NumExpanded;
184 MadeChange = true;
185 }
186 }
187 EverMadeChange |= MadeChange;
188 }
189
190 BlockSizes.clear();
Chris Lattner6f4a0722006-02-08 19:33:26 +0000191 return true;
192}
193