blob: fec0917b05b10beb64aac19c626910bfe51d7b43 [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 Lattnerbfca1ab2005-10-14 23:51:18 +000018#include "PPC.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000019#include "MCTargetDesc/PPCPredicates.h"
Chris Lattnere80bf1b2005-10-14 23:45:43 +000020#include "PPCInstrBuilder.h"
Chris Lattner6f3b9542005-10-14 23:59:06 +000021#include "PPCInstrInfo.h"
Chris Lattner96d73862006-11-16 18:13:49 +000022#include "llvm/ADT/Statistic.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000023#include "llvm/CodeGen/MachineFunctionPass.h"
Chris Lattner542dfd52006-11-18 00:32:03 +000024#include "llvm/Support/MathExtras.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000025#include "llvm/Target/TargetMachine.h"
Eric Christopherd9134482014-08-04 21:25:23 +000026#include "llvm/Target/TargetSubtargetInfo.h"
Misha Brukmanef8cf022004-07-27 18:33:06 +000027using namespace llvm;
28
Chandler Carruth84e68b22014-04-22 02:41:26 +000029#define DEBUG_TYPE "ppc-branch-select"
30
Chris Lattner1ef9cd42006-12-19 22:59:26 +000031STATISTIC(NumExpanded, "Number of branches expanded to long format");
Chris Lattner96d73862006-11-16 18:13:49 +000032
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +000033namespace llvm {
34 void initializePPCBSelPass(PassRegistry&);
35}
36
Misha Brukmanef8cf022004-07-27 18:33:06 +000037namespace {
Nick Lewycky02d5f772009-10-25 06:33:48 +000038 struct PPCBSel : public MachineFunctionPass {
Devang Patel8c78a0b2007-05-03 01:11:54 +000039 static char ID;
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +000040 PPCBSel() : MachineFunctionPass(ID) {
41 initializePPCBSelPass(*PassRegistry::getPassRegistry());
42 }
Devang Patel09f162c2007-05-01 21:15:47 +000043
Chris Lattner542dfd52006-11-18 00:32:03 +000044 /// BlockSizes - The sizes of the basic blocks in the function.
45 std::vector<unsigned> BlockSizes;
Misha Brukmanef8cf022004-07-27 18:33:06 +000046
Craig Topper0d3fa922014-04-29 07:57:37 +000047 bool runOnMachineFunction(MachineFunction &Fn) override;
Misha Brukmanef8cf022004-07-27 18:33:06 +000048
Derek Schuff1dbf7a52016-04-04 17:09:25 +000049 MachineFunctionProperties getRequiredProperties() const override {
50 return MachineFunctionProperties().set(
Matthias Braun1eb47362016-08-25 01:27:13 +000051 MachineFunctionProperties::Property::NoVRegs);
Derek Schuff1dbf7a52016-04-04 17:09:25 +000052 }
53
Craig Topper0d3fa922014-04-29 07:57:37 +000054 const char *getPassName() const override {
Chris Lattner542dfd52006-11-18 00:32:03 +000055 return "PowerPC Branch Selector";
Misha Brukmanef8cf022004-07-27 18:33:06 +000056 }
57 };
Devang Patel8c78a0b2007-05-03 01:11:54 +000058 char PPCBSel::ID = 0;
Alexander Kornienkof00654e2015-06-23 09:49:53 +000059}
Misha Brukmanef8cf022004-07-27 18:33:06 +000060
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +000061INITIALIZE_PASS(PPCBSel, "ppc-branch-select", "PowerPC Branch Selector",
62 false, false)
63
Misha Brukmanef8cf022004-07-27 18:33:06 +000064/// createPPCBranchSelectionPass - returns an instance of the Branch Selection
65/// Pass
66///
67FunctionPass *llvm::createPPCBranchSelectionPass() {
Chris Lattner26e385a2006-02-08 19:33:26 +000068 return new PPCBSel();
Misha Brukmanef8cf022004-07-27 18:33:06 +000069}
Chris Lattner26e385a2006-02-08 19:33:26 +000070
Chris Lattner26e385a2006-02-08 19:33:26 +000071bool PPCBSel::runOnMachineFunction(MachineFunction &Fn) {
Eric Christopherfc6de422014-08-05 02:39:49 +000072 const PPCInstrInfo *TII =
73 static_cast<const PPCInstrInfo *>(Fn.getSubtarget().getInstrInfo());
Chris Lattner542dfd52006-11-18 00:32:03 +000074 // Give the blocks of the function a dense, in-order, numbering.
75 Fn.RenumberBlocks();
76 BlockSizes.resize(Fn.getNumBlockIDs());
77
Hal Finkeld73bfba2015-01-03 14:58:25 +000078 auto GetAlignmentAdjustment =
79 [TII](MachineBasicBlock &MBB, unsigned Offset) -> unsigned {
80 unsigned Align = MBB.getAlignment();
81 if (!Align)
82 return 0;
83
84 unsigned AlignAmt = 1 << Align;
85 unsigned ParentAlign = MBB.getParent()->getAlignment();
86
87 if (Align <= ParentAlign)
88 return OffsetToAlignment(Offset, AlignAmt);
89
90 // The alignment of this MBB is larger than the function's alignment, so we
91 // can't tell whether or not it will insert nops. Assume that it will.
92 return AlignAmt + OffsetToAlignment(Offset, AlignAmt);
93 };
94
Chris Lattner542dfd52006-11-18 00:32:03 +000095 // Measure each MBB and compute a size for the entire function.
96 unsigned FuncSize = 0;
Chris Lattner26e385a2006-02-08 19:33:26 +000097 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
98 ++MFI) {
Duncan P. N. Exon Smithac65b4c2015-10-20 01:07:37 +000099 MachineBasicBlock *MBB = &*MFI;
Chris Lattner542dfd52006-11-18 00:32:03 +0000100
Hal Finkeld73bfba2015-01-03 14:58:25 +0000101 // The end of the previous block may have extra nops if this block has an
102 // alignment requirement.
103 if (MBB->getNumber() > 0) {
104 unsigned AlignExtra = GetAlignmentAdjustment(*MBB, FuncSize);
105 BlockSizes[MBB->getNumber()-1] += AlignExtra;
106 FuncSize += AlignExtra;
107 }
108
Chris Lattner542dfd52006-11-18 00:32:03 +0000109 unsigned BlockSize = 0;
Duncan P. N. Exon Smith9cfc75c2016-06-30 00:01:54 +0000110 for (MachineInstr &MI : *MBB)
Sjoerd Meijer89217f82016-07-28 16:32:22 +0000111 BlockSize += TII->getInstSizeInBytes(MI);
Duncan P. N. Exon Smith9cfc75c2016-06-30 00:01:54 +0000112
Chris Lattner542dfd52006-11-18 00:32:03 +0000113 BlockSizes[MBB->getNumber()] = BlockSize;
114 FuncSize += BlockSize;
Chris Lattner26e385a2006-02-08 19:33:26 +0000115 }
116
Chris Lattner542dfd52006-11-18 00:32:03 +0000117 // If the entire function is smaller than the displacement of a branch field,
118 // we know we don't need to shrink any branches in this function. This is a
119 // common case.
120 if (FuncSize < (1 << 15)) {
121 BlockSizes.clear();
122 return false;
123 }
124
125 // For each conditional branch, if the offset to its destination is larger
126 // than the offset field allows, transform it into a long branch sequence
127 // like this:
128 // short branch:
129 // bCC MBB
130 // long branch:
131 // b!CC $PC+8
132 // b MBB
133 //
134 bool MadeChange = true;
135 bool EverMadeChange = false;
136 while (MadeChange) {
137 // Iteratively expand branches until we reach a fixed point.
138 MadeChange = false;
139
140 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
141 ++MFI) {
142 MachineBasicBlock &MBB = *MFI;
143 unsigned MBBStartOffset = 0;
144 for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end();
145 I != E; ++I) {
Craig Topper062a2ba2014-04-25 05:30:21 +0000146 MachineBasicBlock *Dest = nullptr;
Hal Finkelc5211292013-05-21 14:21:09 +0000147 if (I->getOpcode() == PPC::BCC && !I->getOperand(2).isImm())
148 Dest = I->getOperand(2).getMBB();
Hal Finkel940ab932014-02-28 00:27:01 +0000149 else if ((I->getOpcode() == PPC::BC || I->getOpcode() == PPC::BCn) &&
150 !I->getOperand(1).isImm())
151 Dest = I->getOperand(1).getMBB();
Hal Finkelc5211292013-05-21 14:21:09 +0000152 else if ((I->getOpcode() == PPC::BDNZ8 || I->getOpcode() == PPC::BDNZ ||
153 I->getOpcode() == PPC::BDZ8 || I->getOpcode() == PPC::BDZ) &&
154 !I->getOperand(0).isImm())
155 Dest = I->getOperand(0).getMBB();
156
157 if (!Dest) {
Sjoerd Meijer89217f82016-07-28 16:32:22 +0000158 MBBStartOffset += TII->getInstSizeInBytes(*I);
Chris Lattner542dfd52006-11-18 00:32:03 +0000159 continue;
160 }
161
162 // Determine the offset from the current branch to the destination
163 // block.
Chris Lattner542dfd52006-11-18 00:32:03 +0000164 int BranchSize;
165 if (Dest->getNumber() <= MBB.getNumber()) {
166 // If this is a backwards branch, the delta is the offset from the
167 // start of this block to this branch, plus the sizes of all blocks
168 // from this block to the dest.
169 BranchSize = MBBStartOffset;
170
171 for (unsigned i = Dest->getNumber(), e = MBB.getNumber(); i != e; ++i)
172 BranchSize += BlockSizes[i];
173 } else {
174 // Otherwise, add the size of the blocks between this block and the
175 // dest to the number of bytes left in this block.
176 BranchSize = -MBBStartOffset;
177
178 for (unsigned i = MBB.getNumber(), e = Dest->getNumber(); i != e; ++i)
179 BranchSize += BlockSizes[i];
180 }
181
182 // If this branch is in range, ignore it.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000183 if (isInt<16>(BranchSize)) {
Chris Lattner542dfd52006-11-18 00:32:03 +0000184 MBBStartOffset += 4;
185 continue;
186 }
Hal Finkel96c2d4d2012-06-08 15:38:21 +0000187
Chris Lattner542dfd52006-11-18 00:32:03 +0000188 // Otherwise, we have to expand it to a long branch.
Duncan P. N. Exon Smithe5a22f42016-07-27 13:24:16 +0000189 MachineInstr &OldBranch = *I;
190 DebugLoc dl = OldBranch.getDebugLoc();
191
Hal Finkel96c2d4d2012-06-08 15:38:21 +0000192 if (I->getOpcode() == PPC::BCC) {
193 // The BCC operands are:
194 // 0. PPC branch predicate
195 // 1. CR register
196 // 2. Target MBB
197 PPC::Predicate Pred = (PPC::Predicate)I->getOperand(0).getImm();
198 unsigned CRReg = I->getOperand(1).getReg();
199
200 // Jump over the uncond branch inst (i.e. $PC+8) on opposite condition.
201 BuildMI(MBB, I, dl, TII->get(PPC::BCC))
202 .addImm(PPC::InvertPredicate(Pred)).addReg(CRReg).addImm(2);
Hal Finkel940ab932014-02-28 00:27:01 +0000203 } else if (I->getOpcode() == PPC::BC) {
204 unsigned CRBit = I->getOperand(0).getReg();
205 BuildMI(MBB, I, dl, TII->get(PPC::BCn)).addReg(CRBit).addImm(2);
206 } else if (I->getOpcode() == PPC::BCn) {
207 unsigned CRBit = I->getOperand(0).getReg();
208 BuildMI(MBB, I, dl, TII->get(PPC::BC)).addReg(CRBit).addImm(2);
Hal Finkel96c2d4d2012-06-08 15:38:21 +0000209 } else if (I->getOpcode() == PPC::BDNZ) {
210 BuildMI(MBB, I, dl, TII->get(PPC::BDZ)).addImm(2);
211 } else if (I->getOpcode() == PPC::BDNZ8) {
212 BuildMI(MBB, I, dl, TII->get(PPC::BDZ8)).addImm(2);
213 } else if (I->getOpcode() == PPC::BDZ) {
214 BuildMI(MBB, I, dl, TII->get(PPC::BDNZ)).addImm(2);
215 } else if (I->getOpcode() == PPC::BDZ8) {
216 BuildMI(MBB, I, dl, TII->get(PPC::BDNZ8)).addImm(2);
217 } else {
218 llvm_unreachable("Unhandled branch type!");
219 }
Chris Lattner542dfd52006-11-18 00:32:03 +0000220
221 // Uncond branch to the real destination.
Dale Johannesene9f623e2009-02-13 02:27:39 +0000222 I = BuildMI(MBB, I, dl, TII->get(PPC::B)).addMBB(Dest);
Chris Lattner542dfd52006-11-18 00:32:03 +0000223
224 // Remove the old branch from the function.
Duncan P. N. Exon Smithe5a22f42016-07-27 13:24:16 +0000225 OldBranch.eraseFromParent();
226
Chris Lattner542dfd52006-11-18 00:32:03 +0000227 // Remember that this instruction is 8-bytes, increase the size of the
228 // block by 4, remember to iterate.
229 BlockSizes[MBB.getNumber()] += 4;
230 MBBStartOffset += 8;
231 ++NumExpanded;
232 MadeChange = true;
233 }
234 }
235 EverMadeChange |= MadeChange;
236 }
237
238 BlockSizes.clear();
Chris Lattner26e385a2006-02-08 19:33:26 +0000239 return true;
240}