blob: 9a29eec55f4e1dabeccc0d13e3d48ef4bd6e062b [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;
Chris Lattner2b544002005-08-24 23:08:16 +000043 case PPC::IMPLICIT_DEF_GPR: // no asm emitted
44 case PPC::IMPLICIT_DEF_FP: // no asm emitted
Misha Brukman999d9cf2004-07-27 18:33:06 +000045 return 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +000046 default:
Reid Spencer4b828e62005-06-18 17:37:34 +000047 break;
Misha Brukman999d9cf2004-07-27 18:33:06 +000048 }
Reid Spencer4b828e62005-06-18 17:37:34 +000049 return 4; // PowerPC instructions are all 4 bytes
Misha Brukman999d9cf2004-07-27 18:33:06 +000050 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +000051
Misha Brukman999d9cf2004-07-27 18:33:06 +000052 virtual bool runOnMachineFunction(MachineFunction &Fn) {
53 // Running total of instructions encountered since beginning of function
54 unsigned ByteCount = 0;
55
56 // For each MBB, add its offset to the offset map, and count up its
57 // instructions
Misha Brukmanb5f662f2005-04-21 23:30:14 +000058 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
Misha Brukman999d9cf2004-07-27 18:33:06 +000059 ++MFI) {
60 MachineBasicBlock *MBB = MFI;
61 OffsetMap[MBB] = ByteCount;
62
63 for (MachineBasicBlock::iterator MBBI = MBB->begin(), EE = MBB->end();
64 MBBI != EE; ++MBBI)
65 ByteCount += bytesForOpcode(MBBI->getOpcode());
66 }
67
68 // We're about to run over the MBB's again, so reset the ByteCount
69 ByteCount = 0;
70
71 // For each MBB, find the conditional branch pseudo instructions, and
72 // calculate the difference between the target MBB and the current ICount
73 // to decide whether or not to emit a short or long branch.
74 //
75 // short branch:
76 // bCC .L_TARGET_MBB
77 //
78 // long branch:
79 // bInverseCC $PC+8
80 // b .L_TARGET_MBB
81 // b .L_FALLTHROUGH_MBB
82
Misha Brukmanb5f662f2005-04-21 23:30:14 +000083 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
Misha Brukman999d9cf2004-07-27 18:33:06 +000084 ++MFI) {
85 MachineBasicBlock *MBB = MFI;
Misha Brukmanb5f662f2005-04-21 23:30:14 +000086
Misha Brukman999d9cf2004-07-27 18:33:06 +000087 for (MachineBasicBlock::iterator MBBI = MBB->begin(), EE = MBB->end();
88 MBBI != EE; ++MBBI) {
Nate Begemanac609dd2005-06-12 23:50:33 +000089 // We may end up deleting the MachineInstr that MBBI points to, so
90 // remember its opcode now so we can refer to it after calling erase()
91 unsigned OpcodeToReplace = MBBI->getOpcode();
92
93 if (OpcodeToReplace == PPC::COND_BRANCH) {
94 MachineBasicBlock::iterator MBBJ = MBBI;
95 ++MBBJ;
Jeff Cohen00b168892005-07-27 06:12:32 +000096
Misha Brukman999d9cf2004-07-27 18:33:06 +000097 // condbranch operands:
98 // 0. CR0 register
99 // 1. bc opcode
100 // 2. target MBB
101 // 3. fallthrough MBB
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000102 MachineBasicBlock *trueMBB =
Misha Brukman999d9cf2004-07-27 18:33:06 +0000103 MBBI->getOperand(2).getMachineBasicBlock();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000104 MachineBasicBlock *falseMBB =
Misha Brukman999d9cf2004-07-27 18:33:06 +0000105 MBBI->getOperand(3).getMachineBasicBlock();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000106
Misha Brukman999d9cf2004-07-27 18:33:06 +0000107 int Displacement = OffsetMap[trueMBB] - ByteCount;
108 unsigned Opcode = MBBI->getOperand(1).getImmedValue();
Misha Brukman363dd072004-08-17 04:58:50 +0000109 unsigned Inverted = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Misha Brukman999d9cf2004-07-27 18:33:06 +0000110
Misha Brukman999d9cf2004-07-27 18:33:06 +0000111 if (Displacement >= -32768 && Displacement <= 32767) {
Nate Begemanac609dd2005-06-12 23:50:33 +0000112 BuildMI(*MBB, MBBJ, Opcode, 2).addReg(PPC::CR0).addMBB(trueMBB);
Misha Brukman999d9cf2004-07-27 18:33:06 +0000113 } else {
Nate Begemanac609dd2005-06-12 23:50:33 +0000114 BuildMI(*MBB, MBBJ, Inverted, 2).addReg(PPC::CR0).addSImm(8);
115 BuildMI(*MBB, MBBJ, PPC::B, 1).addMBB(trueMBB);
116 BuildMI(*MBB, MBBJ, PPC::B, 1).addMBB(falseMBB);
Misha Brukman999d9cf2004-07-27 18:33:06 +0000117 }
Nate Begemanac609dd2005-06-12 23:50:33 +0000118
119 // Erase the psuedo COND_BRANCH instruction, and then back up the
120 // iterator so that when the for loop increments it, we end up in
121 // the correct place rather than iterating off the end.
122 MBB->erase(MBBI);
123 MBBI = --MBBJ;
Misha Brukman999d9cf2004-07-27 18:33:06 +0000124 }
Nate Begemanac609dd2005-06-12 23:50:33 +0000125 ByteCount += bytesForOpcode(OpcodeToReplace);
Misha Brukman999d9cf2004-07-27 18:33:06 +0000126 }
127 }
128
129 OffsetMap.clear();
130 return true;
131 }
132
133 virtual const char *getPassName() const {
134 return "PowerPC Branch Selection";
135 }
136 };
137}
138
139/// createPPCBranchSelectionPass - returns an instance of the Branch Selection
140/// Pass
141///
142FunctionPass *llvm::createPPCBranchSelectionPass() {
143 return new BSel();
144}