blob: 3e608ca8f679000ceb737775a1757f94ace6ddbd [file] [log] [blame]
Jia Liub22310f2012-02-18 12:03:15 +00001//===-- PPCBranchSelector.cpp - Emit long conditional branches ------------===//
Misha Brukmanb4402432005-04-21 23:30:14 +00002//
Misha Brukmanef8cf022004-07-27 18:33:06 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattnerf3ebc3f2007-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 Brukmanb4402432005-04-21 23:30:14 +00007//
Misha Brukmanef8cf022004-07-27 18:33:06 +00008//===----------------------------------------------------------------------===//
9//
Misha Brukmanb4402432005-04-21 23:30:14 +000010// This file contains a pass that scans a machine function to determine which
Misha Brukmanef8cf022004-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
Gabor Greif21fed662010-08-23 20:30:51 +000013// positions pass, and a branch pseudo op to machine branch opcode pass. This
Misha Brukmanef8cf022004-07-27 18:33:06 +000014// pass should be run last, just before the assembly printer.
15//
16//===----------------------------------------------------------------------===//
17
Chris Lattner1ef9cd42006-12-19 22:59:26 +000018#define DEBUG_TYPE "ppc-branch-select"
Chris Lattnerbfca1ab2005-10-14 23:51:18 +000019#include "PPC.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000020#include "MCTargetDesc/PPCPredicates.h"
Chris Lattnere80bf1b2005-10-14 23:45:43 +000021#include "PPCInstrBuilder.h"
Chris Lattner6f3b9542005-10-14 23:59:06 +000022#include "PPCInstrInfo.h"
Chris Lattner96d73862006-11-16 18:13:49 +000023#include "llvm/ADT/Statistic.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000024#include "llvm/CodeGen/MachineFunctionPass.h"
Chris Lattner542dfd52006-11-18 00:32:03 +000025#include "llvm/Support/MathExtras.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000026#include "llvm/Target/TargetMachine.h"
Misha Brukmanef8cf022004-07-27 18:33:06 +000027using namespace llvm;
28
Chris Lattner1ef9cd42006-12-19 22:59:26 +000029STATISTIC(NumExpanded, "Number of branches expanded to long format");
Chris Lattner96d73862006-11-16 18:13:49 +000030
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +000031namespace llvm {
32 void initializePPCBSelPass(PassRegistry&);
33}
34
Misha Brukmanef8cf022004-07-27 18:33:06 +000035namespace {
Nick Lewycky02d5f772009-10-25 06:33:48 +000036 struct PPCBSel : public MachineFunctionPass {
Devang Patel8c78a0b2007-05-03 01:11:54 +000037 static char ID;
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +000038 PPCBSel() : MachineFunctionPass(ID) {
39 initializePPCBSelPass(*PassRegistry::getPassRegistry());
40 }
Devang Patel09f162c2007-05-01 21:15:47 +000041
Chris Lattner542dfd52006-11-18 00:32:03 +000042 /// BlockSizes - The sizes of the basic blocks in the function.
43 std::vector<unsigned> BlockSizes;
Misha Brukmanef8cf022004-07-27 18:33:06 +000044
Chris Lattner26e385a2006-02-08 19:33:26 +000045 virtual bool runOnMachineFunction(MachineFunction &Fn);
Misha Brukmanef8cf022004-07-27 18:33:06 +000046
47 virtual const char *getPassName() const {
Chris Lattner542dfd52006-11-18 00:32:03 +000048 return "PowerPC Branch Selector";
Misha Brukmanef8cf022004-07-27 18:33:06 +000049 }
50 };
Devang Patel8c78a0b2007-05-03 01:11:54 +000051 char PPCBSel::ID = 0;
Misha Brukmanef8cf022004-07-27 18:33:06 +000052}
53
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +000054INITIALIZE_PASS(PPCBSel, "ppc-branch-select", "PowerPC Branch Selector",
55 false, false)
56
Misha Brukmanef8cf022004-07-27 18:33:06 +000057/// createPPCBranchSelectionPass - returns an instance of the Branch Selection
58/// Pass
59///
60FunctionPass *llvm::createPPCBranchSelectionPass() {
Chris Lattner26e385a2006-02-08 19:33:26 +000061 return new PPCBSel();
Misha Brukmanef8cf022004-07-27 18:33:06 +000062}
Chris Lattner26e385a2006-02-08 19:33:26 +000063
Chris Lattner26e385a2006-02-08 19:33:26 +000064bool PPCBSel::runOnMachineFunction(MachineFunction &Fn) {
Gabor Greif4ad727172010-07-23 13:28:47 +000065 const PPCInstrInfo *TII =
66 static_cast<const PPCInstrInfo*>(Fn.getTarget().getInstrInfo());
Chris Lattner542dfd52006-11-18 00:32:03 +000067 // Give the blocks of the function a dense, in-order, numbering.
68 Fn.RenumberBlocks();
69 BlockSizes.resize(Fn.getNumBlockIDs());
70
71 // Measure each MBB and compute a size for the entire function.
72 unsigned FuncSize = 0;
Chris Lattner26e385a2006-02-08 19:33:26 +000073 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
74 ++MFI) {
75 MachineBasicBlock *MBB = MFI;
Chris Lattner542dfd52006-11-18 00:32:03 +000076
77 unsigned BlockSize = 0;
Chris Lattner26e385a2006-02-08 19:33:26 +000078 for (MachineBasicBlock::iterator MBBI = MBB->begin(), EE = MBB->end();
79 MBBI != EE; ++MBBI)
Nicolas Geoffrayae84bbd2008-04-16 20:10:13 +000080 BlockSize += TII->GetInstSizeInBytes(MBBI);
Chris Lattner26e385a2006-02-08 19:33:26 +000081
Chris Lattner542dfd52006-11-18 00:32:03 +000082 BlockSizes[MBB->getNumber()] = BlockSize;
83 FuncSize += BlockSize;
Chris Lattner26e385a2006-02-08 19:33:26 +000084 }
85
Chris Lattner542dfd52006-11-18 00:32:03 +000086 // If the entire function is smaller than the displacement of a branch field,
87 // we know we don't need to shrink any branches in this function. This is a
88 // common case.
89 if (FuncSize < (1 << 15)) {
90 BlockSizes.clear();
91 return false;
92 }
93
94 // For each conditional branch, if the offset to its destination is larger
95 // than the offset field allows, transform it into a long branch sequence
96 // like this:
97 // short branch:
98 // bCC MBB
99 // long branch:
100 // b!CC $PC+8
101 // b MBB
102 //
103 bool MadeChange = true;
104 bool EverMadeChange = false;
105 while (MadeChange) {
106 // Iteratively expand branches until we reach a fixed point.
107 MadeChange = false;
108
109 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
110 ++MFI) {
111 MachineBasicBlock &MBB = *MFI;
112 unsigned MBBStartOffset = 0;
113 for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end();
114 I != E; ++I) {
Hal Finkelc5211292013-05-21 14:21:09 +0000115 MachineBasicBlock *Dest = 0;
116 if (I->getOpcode() == PPC::BCC && !I->getOperand(2).isImm())
117 Dest = I->getOperand(2).getMBB();
118 else if ((I->getOpcode() == PPC::BDNZ8 || I->getOpcode() == PPC::BDNZ ||
119 I->getOpcode() == PPC::BDZ8 || I->getOpcode() == PPC::BDZ) &&
120 !I->getOperand(0).isImm())
121 Dest = I->getOperand(0).getMBB();
122
123 if (!Dest) {
Nicolas Geoffrayae84bbd2008-04-16 20:10:13 +0000124 MBBStartOffset += TII->GetInstSizeInBytes(I);
Chris Lattner542dfd52006-11-18 00:32:03 +0000125 continue;
126 }
127
128 // Determine the offset from the current branch to the destination
129 // block.
Chris Lattner542dfd52006-11-18 00:32:03 +0000130 int BranchSize;
131 if (Dest->getNumber() <= MBB.getNumber()) {
132 // If this is a backwards branch, the delta is the offset from the
133 // start of this block to this branch, plus the sizes of all blocks
134 // from this block to the dest.
135 BranchSize = MBBStartOffset;
136
137 for (unsigned i = Dest->getNumber(), e = MBB.getNumber(); i != e; ++i)
138 BranchSize += BlockSizes[i];
139 } else {
140 // Otherwise, add the size of the blocks between this block and the
141 // dest to the number of bytes left in this block.
142 BranchSize = -MBBStartOffset;
143
144 for (unsigned i = MBB.getNumber(), e = Dest->getNumber(); i != e; ++i)
145 BranchSize += BlockSizes[i];
146 }
147
148 // If this branch is in range, ignore it.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000149 if (isInt<16>(BranchSize)) {
Chris Lattner542dfd52006-11-18 00:32:03 +0000150 MBBStartOffset += 4;
151 continue;
152 }
Hal Finkel96c2d4d2012-06-08 15:38:21 +0000153
Chris Lattner542dfd52006-11-18 00:32:03 +0000154 // Otherwise, we have to expand it to a long branch.
Chris Lattner542dfd52006-11-18 00:32:03 +0000155 MachineInstr *OldBranch = I;
Dale Johannesene9f623e2009-02-13 02:27:39 +0000156 DebugLoc dl = OldBranch->getDebugLoc();
Hal Finkel96c2d4d2012-06-08 15:38:21 +0000157
158 if (I->getOpcode() == PPC::BCC) {
159 // The BCC operands are:
160 // 0. PPC branch predicate
161 // 1. CR register
162 // 2. Target MBB
163 PPC::Predicate Pred = (PPC::Predicate)I->getOperand(0).getImm();
164 unsigned CRReg = I->getOperand(1).getReg();
165
166 // Jump over the uncond branch inst (i.e. $PC+8) on opposite condition.
167 BuildMI(MBB, I, dl, TII->get(PPC::BCC))
168 .addImm(PPC::InvertPredicate(Pred)).addReg(CRReg).addImm(2);
169 } else if (I->getOpcode() == PPC::BDNZ) {
170 BuildMI(MBB, I, dl, TII->get(PPC::BDZ)).addImm(2);
171 } else if (I->getOpcode() == PPC::BDNZ8) {
172 BuildMI(MBB, I, dl, TII->get(PPC::BDZ8)).addImm(2);
173 } else if (I->getOpcode() == PPC::BDZ) {
174 BuildMI(MBB, I, dl, TII->get(PPC::BDNZ)).addImm(2);
175 } else if (I->getOpcode() == PPC::BDZ8) {
176 BuildMI(MBB, I, dl, TII->get(PPC::BDNZ8)).addImm(2);
177 } else {
178 llvm_unreachable("Unhandled branch type!");
179 }
Chris Lattner542dfd52006-11-18 00:32:03 +0000180
181 // Uncond branch to the real destination.
Dale Johannesene9f623e2009-02-13 02:27:39 +0000182 I = BuildMI(MBB, I, dl, TII->get(PPC::B)).addMBB(Dest);
Chris Lattner542dfd52006-11-18 00:32:03 +0000183
184 // Remove the old branch from the function.
185 OldBranch->eraseFromParent();
186
187 // Remember that this instruction is 8-bytes, increase the size of the
188 // block by 4, remember to iterate.
189 BlockSizes[MBB.getNumber()] += 4;
190 MBBStartOffset += 8;
191 ++NumExpanded;
192 MadeChange = true;
193 }
194 }
195 EverMadeChange |= MadeChange;
196 }
197
198 BlockSizes.clear();
Chris Lattner26e385a2006-02-08 19:33:26 +0000199 return true;
200}
201