blob: 7ace3c10d43c3a8e059671ad57cf5c9c714ce597 [file] [log] [blame]
Misha Brukman999d9cf2004-07-27 18:33:06 +00001//===-- PowerPCBranchSelector.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//
5// This file was developed by Nate Baegeman and is distributed under the
6// University of Illinois Open Source 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
18#define DEBUG_TYPE "bsel"
19#include "PowerPC.h"
20#include "PowerPCInstrBuilder.h"
21#include "PowerPCInstrInfo.h"
Misha Brukman363dd072004-08-17 04:58:50 +000022#include "PPC32InstrInfo.h"
Misha Brukman999d9cf2004-07-27 18:33:06 +000023#include "llvm/CodeGen/MachineFunctionPass.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000024#include "llvm/Support/Debug.h"
Misha Brukman999d9cf2004-07-27 18:33:06 +000025#include <map>
26using namespace llvm;
27
28namespace {
29 struct BSel : public MachineFunctionPass {
30 // OffsetMap - Mapping between BB and byte offset from start of function
31 std::map<MachineBasicBlock*, unsigned> OffsetMap;
32
Misha Brukmanb5f662f2005-04-21 23:30:14 +000033 /// bytesForOpcode - A convenience function for totalling up the number of
Misha Brukman999d9cf2004-07-27 18:33:06 +000034 /// bytes in a basic block.
35 ///
36 static unsigned bytesForOpcode(unsigned opcode) {
37 switch (opcode) {
Misha Brukman5b570812004-08-10 22:47:03 +000038 case PPC::COND_BRANCH:
Misha Brukman999d9cf2004-07-27 18:33:06 +000039 // while this will be 4 most of the time, if we emit 12 it is just a
Misha Brukmanb5f662f2005-04-21 23:30:14 +000040 // minor pessimization that saves us from having to worry about
Misha Brukman999d9cf2004-07-27 18:33:06 +000041 // keeping the offsets up to date later when we emit long branch glue.
42 return 12;
Misha Brukman5b570812004-08-10 22:47:03 +000043 case PPC::IMPLICIT_DEF: // no asm emitted
Misha Brukman999d9cf2004-07-27 18:33:06 +000044 return 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +000045 default:
Misha Brukman999d9cf2004-07-27 18:33:06 +000046 return 4; // PowerPC instructions are all 4 bytes
Misha Brukman999d9cf2004-07-27 18:33:06 +000047 }
48 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +000049
Misha Brukman999d9cf2004-07-27 18:33:06 +000050 virtual bool runOnMachineFunction(MachineFunction &Fn) {
51 // Running total of instructions encountered since beginning of function
52 unsigned ByteCount = 0;
53
54 // For each MBB, add its offset to the offset map, and count up its
55 // instructions
Misha Brukmanb5f662f2005-04-21 23:30:14 +000056 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
Misha Brukman999d9cf2004-07-27 18:33:06 +000057 ++MFI) {
58 MachineBasicBlock *MBB = MFI;
59 OffsetMap[MBB] = ByteCount;
60
61 for (MachineBasicBlock::iterator MBBI = MBB->begin(), EE = MBB->end();
62 MBBI != EE; ++MBBI)
63 ByteCount += bytesForOpcode(MBBI->getOpcode());
64 }
65
66 // We're about to run over the MBB's again, so reset the ByteCount
67 ByteCount = 0;
68
69 // For each MBB, find the conditional branch pseudo instructions, and
70 // calculate the difference between the target MBB and the current ICount
71 // to decide whether or not to emit a short or long branch.
72 //
73 // short branch:
74 // bCC .L_TARGET_MBB
75 //
76 // long branch:
77 // bInverseCC $PC+8
78 // b .L_TARGET_MBB
79 // b .L_FALLTHROUGH_MBB
80
Misha Brukmanb5f662f2005-04-21 23:30:14 +000081 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
Misha Brukman999d9cf2004-07-27 18:33:06 +000082 ++MFI) {
83 MachineBasicBlock *MBB = MFI;
Misha Brukmanb5f662f2005-04-21 23:30:14 +000084
Misha Brukman999d9cf2004-07-27 18:33:06 +000085 for (MachineBasicBlock::iterator MBBI = MBB->begin(), EE = MBB->end();
86 MBBI != EE; ++MBBI) {
Nate Begemanac609dd2005-06-12 23:50:33 +000087 // We may end up deleting the MachineInstr that MBBI points to, so
88 // remember its opcode now so we can refer to it after calling erase()
89 unsigned OpcodeToReplace = MBBI->getOpcode();
90
91 if (OpcodeToReplace == PPC::COND_BRANCH) {
92 MachineBasicBlock::iterator MBBJ = MBBI;
93 ++MBBJ;
94
Misha Brukman999d9cf2004-07-27 18:33:06 +000095 // condbranch operands:
96 // 0. CR0 register
97 // 1. bc opcode
98 // 2. target MBB
99 // 3. fallthrough MBB
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000100 MachineBasicBlock *trueMBB =
Misha Brukman999d9cf2004-07-27 18:33:06 +0000101 MBBI->getOperand(2).getMachineBasicBlock();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000102 MachineBasicBlock *falseMBB =
Misha Brukman999d9cf2004-07-27 18:33:06 +0000103 MBBI->getOperand(3).getMachineBasicBlock();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000104
Misha Brukman999d9cf2004-07-27 18:33:06 +0000105 int Displacement = OffsetMap[trueMBB] - ByteCount;
106 unsigned Opcode = MBBI->getOperand(1).getImmedValue();
Misha Brukman363dd072004-08-17 04:58:50 +0000107 unsigned Inverted = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Misha Brukman999d9cf2004-07-27 18:33:06 +0000108
Misha Brukman999d9cf2004-07-27 18:33:06 +0000109 if (Displacement >= -32768 && Displacement <= 32767) {
Nate Begemanac609dd2005-06-12 23:50:33 +0000110 BuildMI(*MBB, MBBJ, Opcode, 2).addReg(PPC::CR0).addMBB(trueMBB);
Misha Brukman999d9cf2004-07-27 18:33:06 +0000111 } else {
Nate Begemanac609dd2005-06-12 23:50:33 +0000112 BuildMI(*MBB, MBBJ, Inverted, 2).addReg(PPC::CR0).addSImm(8);
113 BuildMI(*MBB, MBBJ, PPC::B, 1).addMBB(trueMBB);
114 BuildMI(*MBB, MBBJ, PPC::B, 1).addMBB(falseMBB);
Misha Brukman999d9cf2004-07-27 18:33:06 +0000115 }
Nate Begemanac609dd2005-06-12 23:50:33 +0000116
117 // Erase the psuedo COND_BRANCH instruction, and then back up the
118 // iterator so that when the for loop increments it, we end up in
119 // the correct place rather than iterating off the end.
120 MBB->erase(MBBI);
121 MBBI = --MBBJ;
Misha Brukman999d9cf2004-07-27 18:33:06 +0000122 }
Nate Begemanac609dd2005-06-12 23:50:33 +0000123 ByteCount += bytesForOpcode(OpcodeToReplace);
Misha Brukman999d9cf2004-07-27 18:33:06 +0000124 }
125 }
126
127 OffsetMap.clear();
128 return true;
129 }
130
131 virtual const char *getPassName() const {
132 return "PowerPC Branch Selection";
133 }
134 };
135}
136
137/// createPPCBranchSelectionPass - returns an instance of the Branch Selection
138/// Pass
139///
140FunctionPass *llvm::createPPCBranchSelectionPass() {
141 return new BSel();
142}