Nate Begeman | 21e463b | 2005-10-16 05:39:50 +0000 | [diff] [blame] | 1 | //===- PPCInstrInfo.cpp - PowerPC32 Instruction Information -----*- C++ -*-===// |
Misha Brukman | b5f662f | 2005-04-21 23:30:14 +0000 | [diff] [blame] | 2 | // |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
Misha Brukman | b5f662f | 2005-04-21 23:30:14 +0000 | [diff] [blame] | 7 | // |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file contains the PowerPC implementation of the TargetInstrInfo class. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
Chris Lattner | 16e71f2 | 2005-10-14 23:59:06 +0000 | [diff] [blame] | 14 | #include "PPCInstrInfo.h" |
Chris Lattner | df4ed63 | 2006-11-17 22:10:59 +0000 | [diff] [blame] | 15 | #include "PPCPredicates.h" |
Chris Lattner | 4c7b43b | 2005-10-14 23:37:35 +0000 | [diff] [blame] | 16 | #include "PPCGenInstrInfo.inc" |
Chris Lattner | b1d26f6 | 2006-06-17 00:01:04 +0000 | [diff] [blame] | 17 | #include "PPCTargetMachine.h" |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 18 | #include "llvm/CodeGen/MachineInstrBuilder.h" |
| 19 | #include <iostream> |
| 20 | using namespace llvm; |
| 21 | |
Chris Lattner | b1d26f6 | 2006-06-17 00:01:04 +0000 | [diff] [blame] | 22 | PPCInstrInfo::PPCInstrInfo(PPCTargetMachine &tm) |
Chris Lattner | 804e067 | 2006-07-11 00:48:23 +0000 | [diff] [blame] | 23 | : TargetInstrInfo(PPCInsts, sizeof(PPCInsts)/sizeof(PPCInsts[0])), TM(tm), |
Evan Cheng | 7ce4578 | 2006-11-13 23:36:35 +0000 | [diff] [blame] | 24 | RI(*TM.getSubtargetImpl(), *this) {} |
Chris Lattner | b1d26f6 | 2006-06-17 00:01:04 +0000 | [diff] [blame] | 25 | |
| 26 | /// getPointerRegClass - Return the register class to use to hold pointers. |
| 27 | /// This is used for addressing modes. |
| 28 | const TargetRegisterClass *PPCInstrInfo::getPointerRegClass() const { |
| 29 | if (TM.getSubtargetImpl()->isPPC64()) |
| 30 | return &PPC::G8RCRegClass; |
| 31 | else |
| 32 | return &PPC::GPRCRegClass; |
| 33 | } |
| 34 | |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 35 | |
Nate Begeman | 21e463b | 2005-10-16 05:39:50 +0000 | [diff] [blame] | 36 | bool PPCInstrInfo::isMoveInstr(const MachineInstr& MI, |
| 37 | unsigned& sourceReg, |
| 38 | unsigned& destReg) const { |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 39 | MachineOpCode oc = MI.getOpcode(); |
Chris Lattner | b410dc9 | 2006-06-20 23:18:58 +0000 | [diff] [blame] | 40 | if (oc == PPC::OR || oc == PPC::OR8 || oc == PPC::VOR || |
Chris Lattner | 14c09b8 | 2005-10-19 01:50:36 +0000 | [diff] [blame] | 41 | oc == PPC::OR4To8 || oc == PPC::OR8To4) { // or r1, r2, r2 |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 42 | assert(MI.getNumOperands() == 3 && |
| 43 | MI.getOperand(0).isRegister() && |
| 44 | MI.getOperand(1).isRegister() && |
| 45 | MI.getOperand(2).isRegister() && |
| 46 | "invalid PPC OR instruction!"); |
| 47 | if (MI.getOperand(1).getReg() == MI.getOperand(2).getReg()) { |
| 48 | sourceReg = MI.getOperand(1).getReg(); |
| 49 | destReg = MI.getOperand(0).getReg(); |
| 50 | return true; |
| 51 | } |
| 52 | } else if (oc == PPC::ADDI) { // addi r1, r2, 0 |
| 53 | assert(MI.getNumOperands() == 3 && |
| 54 | MI.getOperand(0).isRegister() && |
| 55 | MI.getOperand(2).isImmediate() && |
| 56 | "invalid PPC ADDI instruction!"); |
| 57 | if (MI.getOperand(1).isRegister() && MI.getOperand(2).getImmedValue()==0) { |
| 58 | sourceReg = MI.getOperand(1).getReg(); |
| 59 | destReg = MI.getOperand(0).getReg(); |
| 60 | return true; |
| 61 | } |
Nate Begeman | cb90de3 | 2004-10-07 22:26:12 +0000 | [diff] [blame] | 62 | } else if (oc == PPC::ORI) { // ori r1, r2, 0 |
| 63 | assert(MI.getNumOperands() == 3 && |
| 64 | MI.getOperand(0).isRegister() && |
| 65 | MI.getOperand(1).isRegister() && |
| 66 | MI.getOperand(2).isImmediate() && |
| 67 | "invalid PPC ORI instruction!"); |
| 68 | if (MI.getOperand(2).getImmedValue()==0) { |
| 69 | sourceReg = MI.getOperand(1).getReg(); |
| 70 | destReg = MI.getOperand(0).getReg(); |
| 71 | return true; |
| 72 | } |
Chris Lattner | eb5d47d | 2005-10-07 05:00:52 +0000 | [diff] [blame] | 73 | } else if (oc == PPC::FMRS || oc == PPC::FMRD || |
| 74 | oc == PPC::FMRSD) { // fmr r1, r2 |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 75 | assert(MI.getNumOperands() == 2 && |
| 76 | MI.getOperand(0).isRegister() && |
| 77 | MI.getOperand(1).isRegister() && |
| 78 | "invalid PPC FMR instruction"); |
| 79 | sourceReg = MI.getOperand(1).getReg(); |
| 80 | destReg = MI.getOperand(0).getReg(); |
| 81 | return true; |
Nate Begeman | 7af0248 | 2005-04-12 07:04:16 +0000 | [diff] [blame] | 82 | } else if (oc == PPC::MCRF) { // mcrf cr1, cr2 |
| 83 | assert(MI.getNumOperands() == 2 && |
| 84 | MI.getOperand(0).isRegister() && |
| 85 | MI.getOperand(1).isRegister() && |
| 86 | "invalid PPC MCRF instruction"); |
| 87 | sourceReg = MI.getOperand(1).getReg(); |
| 88 | destReg = MI.getOperand(0).getReg(); |
| 89 | return true; |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 90 | } |
| 91 | return false; |
| 92 | } |
Chris Lattner | 043870d | 2005-09-09 18:17:41 +0000 | [diff] [blame] | 93 | |
Chris Lattner | 4083960 | 2006-02-02 20:12:32 +0000 | [diff] [blame] | 94 | unsigned PPCInstrInfo::isLoadFromStackSlot(MachineInstr *MI, |
Chris Lattner | 9c09c9e | 2006-03-16 22:24:02 +0000 | [diff] [blame] | 95 | int &FrameIndex) const { |
Chris Lattner | 4083960 | 2006-02-02 20:12:32 +0000 | [diff] [blame] | 96 | switch (MI->getOpcode()) { |
| 97 | default: break; |
| 98 | case PPC::LD: |
| 99 | case PPC::LWZ: |
| 100 | case PPC::LFS: |
| 101 | case PPC::LFD: |
| 102 | if (MI->getOperand(1).isImmediate() && !MI->getOperand(1).getImmedValue() && |
| 103 | MI->getOperand(2).isFrameIndex()) { |
| 104 | FrameIndex = MI->getOperand(2).getFrameIndex(); |
| 105 | return MI->getOperand(0).getReg(); |
| 106 | } |
| 107 | break; |
| 108 | } |
| 109 | return 0; |
Chris Lattner | 6524287 | 2006-02-02 20:16:12 +0000 | [diff] [blame] | 110 | } |
Chris Lattner | 4083960 | 2006-02-02 20:12:32 +0000 | [diff] [blame] | 111 | |
Chris Lattner | 6524287 | 2006-02-02 20:16:12 +0000 | [diff] [blame] | 112 | unsigned PPCInstrInfo::isStoreToStackSlot(MachineInstr *MI, |
| 113 | int &FrameIndex) const { |
| 114 | switch (MI->getOpcode()) { |
| 115 | default: break; |
Nate Begeman | 3b478b3 | 2006-02-02 21:07:50 +0000 | [diff] [blame] | 116 | case PPC::STD: |
Chris Lattner | 6524287 | 2006-02-02 20:16:12 +0000 | [diff] [blame] | 117 | case PPC::STW: |
| 118 | case PPC::STFS: |
| 119 | case PPC::STFD: |
| 120 | if (MI->getOperand(1).isImmediate() && !MI->getOperand(1).getImmedValue() && |
| 121 | MI->getOperand(2).isFrameIndex()) { |
| 122 | FrameIndex = MI->getOperand(2).getFrameIndex(); |
| 123 | return MI->getOperand(0).getReg(); |
| 124 | } |
| 125 | break; |
| 126 | } |
| 127 | return 0; |
| 128 | } |
Chris Lattner | 4083960 | 2006-02-02 20:12:32 +0000 | [diff] [blame] | 129 | |
Chris Lattner | 043870d | 2005-09-09 18:17:41 +0000 | [diff] [blame] | 130 | // commuteInstruction - We can commute rlwimi instructions, but only if the |
| 131 | // rotate amt is zero. We also have to munge the immediates a bit. |
Nate Begeman | 21e463b | 2005-10-16 05:39:50 +0000 | [diff] [blame] | 132 | MachineInstr *PPCInstrInfo::commuteInstruction(MachineInstr *MI) const { |
Chris Lattner | 043870d | 2005-09-09 18:17:41 +0000 | [diff] [blame] | 133 | // Normal instructions can be commuted the obvious way. |
| 134 | if (MI->getOpcode() != PPC::RLWIMI) |
| 135 | return TargetInstrInfo::commuteInstruction(MI); |
| 136 | |
| 137 | // Cannot commute if it has a non-zero rotate count. |
| 138 | if (MI->getOperand(3).getImmedValue() != 0) |
| 139 | return 0; |
| 140 | |
| 141 | // If we have a zero rotate count, we have: |
| 142 | // M = mask(MB,ME) |
| 143 | // Op0 = (Op1 & ~M) | (Op2 & M) |
| 144 | // Change this to: |
| 145 | // M = mask((ME+1)&31, (MB-1)&31) |
| 146 | // Op0 = (Op2 & ~M) | (Op1 & M) |
| 147 | |
| 148 | // Swap op1/op2 |
| 149 | unsigned Reg1 = MI->getOperand(1).getReg(); |
| 150 | unsigned Reg2 = MI->getOperand(2).getReg(); |
Evan Cheng | 6ce7dc2 | 2006-11-15 20:58:11 +0000 | [diff] [blame] | 151 | bool Reg1IsKill = MI->getOperand(1).isKill(); |
| 152 | bool Reg2IsKill = MI->getOperand(2).isKill(); |
Chris Lattner | e53f4a0 | 2006-05-04 17:52:23 +0000 | [diff] [blame] | 153 | MI->getOperand(2).setReg(Reg1); |
| 154 | MI->getOperand(1).setReg(Reg2); |
Evan Cheng | 6ce7dc2 | 2006-11-15 20:58:11 +0000 | [diff] [blame] | 155 | if (Reg1IsKill) |
| 156 | MI->getOperand(2).setIsKill(); |
| 157 | else |
| 158 | MI->getOperand(2).unsetIsKill(); |
| 159 | if (Reg2IsKill) |
| 160 | MI->getOperand(1).setIsKill(); |
| 161 | else |
| 162 | MI->getOperand(1).unsetIsKill(); |
Chris Lattner | 043870d | 2005-09-09 18:17:41 +0000 | [diff] [blame] | 163 | |
| 164 | // Swap the mask around. |
| 165 | unsigned MB = MI->getOperand(4).getImmedValue(); |
| 166 | unsigned ME = MI->getOperand(5).getImmedValue(); |
| 167 | MI->getOperand(4).setImmedValue((ME+1) & 31); |
| 168 | MI->getOperand(5).setImmedValue((MB-1) & 31); |
| 169 | return MI; |
| 170 | } |
Chris Lattner | bbf1c72 | 2006-03-05 23:49:55 +0000 | [diff] [blame] | 171 | |
| 172 | void PPCInstrInfo::insertNoop(MachineBasicBlock &MBB, |
| 173 | MachineBasicBlock::iterator MI) const { |
| 174 | BuildMI(MBB, MI, PPC::NOP, 0); |
| 175 | } |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 176 | |
| 177 | |
| 178 | // Branch analysis. |
| 179 | bool PPCInstrInfo::AnalyzeBranch(MachineBasicBlock &MBB,MachineBasicBlock *&TBB, |
| 180 | MachineBasicBlock *&FBB, |
| 181 | std::vector<MachineOperand> &Cond) const { |
| 182 | // If the block has no terminators, it just falls into the block after it. |
| 183 | MachineBasicBlock::iterator I = MBB.end(); |
| 184 | if (I == MBB.begin() || !isTerminatorInstr((--I)->getOpcode())) |
| 185 | return false; |
| 186 | |
| 187 | // Get the last instruction in the block. |
| 188 | MachineInstr *LastInst = I; |
| 189 | |
| 190 | // If there is only one terminator instruction, process it. |
| 191 | if (I == MBB.begin() || !isTerminatorInstr((--I)->getOpcode())) { |
| 192 | if (LastInst->getOpcode() == PPC::B) { |
| 193 | TBB = LastInst->getOperand(0).getMachineBasicBlock(); |
| 194 | return false; |
Chris Lattner | 289c2d5 | 2006-11-17 22:14:47 +0000 | [diff] [blame] | 195 | } else if (LastInst->getOpcode() == PPC::BCC) { |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 196 | // Block ends with fall-through condbranch. |
| 197 | TBB = LastInst->getOperand(2).getMachineBasicBlock(); |
| 198 | Cond.push_back(LastInst->getOperand(0)); |
| 199 | Cond.push_back(LastInst->getOperand(1)); |
Chris Lattner | 7c4fe25 | 2006-10-21 06:03:11 +0000 | [diff] [blame] | 200 | return false; |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 201 | } |
| 202 | // Otherwise, don't know what this is. |
| 203 | return true; |
| 204 | } |
| 205 | |
| 206 | // Get the instruction before it if it's a terminator. |
| 207 | MachineInstr *SecondLastInst = I; |
| 208 | |
| 209 | // If there are three terminators, we don't know what sort of block this is. |
| 210 | if (SecondLastInst && I != MBB.begin() && |
| 211 | isTerminatorInstr((--I)->getOpcode())) |
| 212 | return true; |
| 213 | |
Chris Lattner | 289c2d5 | 2006-11-17 22:14:47 +0000 | [diff] [blame] | 214 | // If the block ends with PPC::B and PPC:BCC, handle it. |
| 215 | if (SecondLastInst->getOpcode() == PPC::BCC && |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 216 | LastInst->getOpcode() == PPC::B) { |
| 217 | TBB = SecondLastInst->getOperand(2).getMachineBasicBlock(); |
| 218 | Cond.push_back(SecondLastInst->getOperand(0)); |
| 219 | Cond.push_back(SecondLastInst->getOperand(1)); |
| 220 | FBB = LastInst->getOperand(0).getMachineBasicBlock(); |
| 221 | return false; |
| 222 | } |
| 223 | |
| 224 | // Otherwise, can't handle this. |
| 225 | return true; |
| 226 | } |
| 227 | |
| 228 | void PPCInstrInfo::RemoveBranch(MachineBasicBlock &MBB) const { |
| 229 | MachineBasicBlock::iterator I = MBB.end(); |
| 230 | if (I == MBB.begin()) return; |
| 231 | --I; |
Chris Lattner | 289c2d5 | 2006-11-17 22:14:47 +0000 | [diff] [blame] | 232 | if (I->getOpcode() != PPC::B && I->getOpcode() != PPC::BCC) |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 233 | return; |
| 234 | |
| 235 | // Remove the branch. |
| 236 | I->eraseFromParent(); |
| 237 | |
| 238 | I = MBB.end(); |
| 239 | |
| 240 | if (I == MBB.begin()) return; |
| 241 | --I; |
Chris Lattner | 289c2d5 | 2006-11-17 22:14:47 +0000 | [diff] [blame] | 242 | if (I->getOpcode() != PPC::BCC) |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 243 | return; |
| 244 | |
| 245 | // Remove the branch. |
| 246 | I->eraseFromParent(); |
| 247 | } |
| 248 | |
| 249 | void PPCInstrInfo::InsertBranch(MachineBasicBlock &MBB, MachineBasicBlock *TBB, |
| 250 | MachineBasicBlock *FBB, |
| 251 | const std::vector<MachineOperand> &Cond) const { |
Chris Lattner | 2dc7723 | 2006-10-17 18:06:55 +0000 | [diff] [blame] | 252 | // Shouldn't be a fall through. |
| 253 | assert(TBB && "InsertBranch must not be told to insert a fallthrough"); |
Chris Lattner | 5410806 | 2006-10-21 05:36:13 +0000 | [diff] [blame] | 254 | assert((Cond.size() == 2 || Cond.size() == 0) && |
| 255 | "PPC branch conditions have two components!"); |
Chris Lattner | 2dc7723 | 2006-10-17 18:06:55 +0000 | [diff] [blame] | 256 | |
Chris Lattner | 5410806 | 2006-10-21 05:36:13 +0000 | [diff] [blame] | 257 | // One-way branch. |
Chris Lattner | 2dc7723 | 2006-10-17 18:06:55 +0000 | [diff] [blame] | 258 | if (FBB == 0) { |
Chris Lattner | 5410806 | 2006-10-21 05:36:13 +0000 | [diff] [blame] | 259 | if (Cond.empty()) // Unconditional branch |
| 260 | BuildMI(&MBB, PPC::B, 1).addMBB(TBB); |
| 261 | else // Conditional branch |
Chris Lattner | 289c2d5 | 2006-11-17 22:14:47 +0000 | [diff] [blame] | 262 | BuildMI(&MBB, PPC::BCC, 3) |
Chris Lattner | 18258c6 | 2006-11-17 22:37:34 +0000 | [diff] [blame^] | 263 | .addImm(Cond[0].getImm()).addReg(Cond[1].getReg()).addMBB(TBB); |
Chris Lattner | 2dc7723 | 2006-10-17 18:06:55 +0000 | [diff] [blame] | 264 | return; |
| 265 | } |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 266 | |
Chris Lattner | 879d09c | 2006-10-21 05:42:09 +0000 | [diff] [blame] | 267 | // Two-way Conditional Branch. |
Chris Lattner | 289c2d5 | 2006-11-17 22:14:47 +0000 | [diff] [blame] | 268 | BuildMI(&MBB, PPC::BCC, 3) |
Chris Lattner | 18258c6 | 2006-11-17 22:37:34 +0000 | [diff] [blame^] | 269 | .addImm(Cond[0].getImm()).addReg(Cond[1].getReg()).addMBB(TBB); |
Chris Lattner | 879d09c | 2006-10-21 05:42:09 +0000 | [diff] [blame] | 270 | BuildMI(&MBB, PPC::B, 1).addMBB(FBB); |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 271 | } |
| 272 | |
Chris Lattner | ef13982 | 2006-10-28 17:35:02 +0000 | [diff] [blame] | 273 | bool PPCInstrInfo::BlockHasNoFallThrough(MachineBasicBlock &MBB) const { |
| 274 | if (MBB.empty()) return false; |
| 275 | |
| 276 | switch (MBB.back().getOpcode()) { |
| 277 | case PPC::B: // Uncond branch. |
| 278 | case PPC::BCTR: // Indirect branch. |
| 279 | return true; |
| 280 | default: return false; |
| 281 | } |
| 282 | } |
| 283 | |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 284 | bool PPCInstrInfo:: |
| 285 | ReverseBranchCondition(std::vector<MachineOperand> &Cond) const { |
Chris Lattner | 7c4fe25 | 2006-10-21 06:03:11 +0000 | [diff] [blame] | 286 | assert(Cond.size() == 2 && "Invalid PPC branch opcode!"); |
| 287 | // Leave the CR# the same, but invert the condition. |
Chris Lattner | 18258c6 | 2006-11-17 22:37:34 +0000 | [diff] [blame^] | 288 | Cond[0].setImm(PPC::InvertPredicate((PPC::Predicate)Cond[0].getImm())); |
Chris Lattner | 7c4fe25 | 2006-10-21 06:03:11 +0000 | [diff] [blame] | 289 | return false; |
Chris Lattner | c50e2bc | 2006-10-13 21:21:17 +0000 | [diff] [blame] | 290 | } |