blob: 02bc3f77d949410aa1e299e8821818a876df60c3 [file] [log] [blame]
Jia Liu9f610112012-02-17 08:55:11 +00001//===-- MipsInstrInfo.cpp - Mips Instruction Information ------------------===//
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +00002//
3// 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.
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +00007//
Akira Hatanakae2489122011-04-15 21:51:11 +00008//===----------------------------------------------------------------------===//
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +00009//
10// This file contains the Mips implementation of the TargetInstrInfo class.
11//
Akira Hatanakae2489122011-04-15 21:51:11 +000012//===----------------------------------------------------------------------===//
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +000013
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +000014#include "MipsInstrInfo.h"
Akira Hatanaka9c6028f2011-07-07 23:56:50 +000015#include "InstPrinter/MipsInstPrinter.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000016#include "MipsMachineFunction.h"
Eric Christopherd8abc3a2015-01-08 18:18:54 +000017#include "MipsSubtarget.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000018#include "llvm/ADT/STLExtras.h"
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +000019#include "llvm/CodeGen/MachineInstrBuilder.h"
Dan Gohmand5ca70642009-06-03 20:30:14 +000020#include "llvm/CodeGen/MachineRegisterInfo.h"
Torok Edwin56d06592009-07-11 20:10:48 +000021#include "llvm/Support/ErrorHandling.h"
Evan Cheng2bb40352011-08-24 18:08:43 +000022#include "llvm/Support/TargetRegistry.h"
Evan Cheng1e210d02011-06-28 20:07:07 +000023
Chandler Carruthd174b722014-04-22 02:03:14 +000024using namespace llvm;
25
Juergen Ributzkad12ccbd2013-11-19 00:57:56 +000026#define GET_INSTRINFO_CTOR_DTOR
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +000027#include "MipsGenInstrInfo.inc"
28
Juergen Ributzkad12ccbd2013-11-19 00:57:56 +000029// Pin the vtable to this file.
30void MipsInstrInfo::anchor() {}
31
Eric Christopher675cb4d2014-07-18 23:25:00 +000032MipsInstrInfo::MipsInstrInfo(const MipsSubtarget &STI, unsigned UncondBr)
33 : MipsGenInstrInfo(Mips::ADJCALLSTACKDOWN, Mips::ADJCALLSTACKUP),
34 Subtarget(STI), UncondBrOpc(UncondBr) {}
Akira Hatanaka9c6028f2011-07-07 23:56:50 +000035
Eric Christopher675cb4d2014-07-18 23:25:00 +000036const MipsInstrInfo *MipsInstrInfo::create(MipsSubtarget &STI) {
37 if (STI.inMips16Mode())
38 return llvm::createMips16InstrInfo(STI);
Akira Hatanakafab89292012-08-02 18:21:47 +000039
Eric Christopher675cb4d2014-07-18 23:25:00 +000040 return llvm::createMipsSEInstrInfo(STI);
Akira Hatanakafab89292012-08-02 18:21:47 +000041}
42
Akira Hatanakab7fa3c92012-07-31 21:49:49 +000043bool MipsInstrInfo::isZeroImm(const MachineOperand &op) const {
Dan Gohman0d1e9a82008-10-03 15:45:36 +000044 return op.isImm() && op.getImm() == 0;
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +000045}
46
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +000047/// insertNoop - If data hazard condition is found insert the target nop
48/// instruction.
Simon Dardis9a3f32c2016-03-29 13:02:19 +000049// FIXME: This appears to be dead code.
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +000050void MipsInstrInfo::
Bruno Cardoso Lopesed874ef2011-03-04 17:51:39 +000051insertNoop(MachineBasicBlock &MBB, MachineBasicBlock::iterator MI) const
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +000052{
Chris Lattner6f306d72010-04-02 20:16:16 +000053 DebugLoc DL;
Bill Wendlingf6d609a2009-02-12 00:02:55 +000054 BuildMI(MBB, MI, DL, get(Mips::NOP));
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +000055}
56
Akira Hatanakab7fa3c92012-07-31 21:49:49 +000057MachineMemOperand *MipsInstrInfo::GetMemOperand(MachineBasicBlock &MBB, int FI,
58 unsigned Flag) const {
Akira Hatanaka1cf75762011-12-24 03:11:18 +000059 MachineFunction &MF = *MBB.getParent();
60 MachineFrameInfo &MFI = *MF.getFrameInfo();
61 unsigned Align = MFI.getObjectAlignment(FI);
Jia Liuf54f60f2012-02-28 07:46:26 +000062
Alex Lorenze40c8a22015-08-11 23:09:45 +000063 return MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, FI),
64 Flag, MFI.getObjectSize(FI), Align);
Akira Hatanaka1cf75762011-12-24 03:11:18 +000065}
66
Akira Hatanakae2489122011-04-15 21:51:11 +000067//===----------------------------------------------------------------------===//
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +000068// Branch Analysis
Akira Hatanakae2489122011-04-15 21:51:11 +000069//===----------------------------------------------------------------------===//
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +000070
Akira Hatanakab7fa3c92012-07-31 21:49:49 +000071void MipsInstrInfo::AnalyzeCondBr(const MachineInstr *Inst, unsigned Opc,
72 MachineBasicBlock *&BB,
73 SmallVectorImpl<MachineOperand> &Cond) const {
Akira Hatanaka067d8152013-05-13 17:43:19 +000074 assert(getAnalyzableBrOpc(Opc) && "Not an analyzable branch");
Akira Hatanaka93f898f2011-04-01 17:39:08 +000075 int NumOp = Inst->getNumExplicitOperands();
Jia Liuf54f60f2012-02-28 07:46:26 +000076
Akira Hatanaka93f898f2011-04-01 17:39:08 +000077 // for both int and fp branches, the last explicit operand is the
78 // MBB.
79 BB = Inst->getOperand(NumOp-1).getMBB();
80 Cond.push_back(MachineOperand::CreateImm(Opc));
Bruno Cardoso Lopesbcaf6e52008-07-28 19:11:24 +000081
Akira Hatanaka93f898f2011-04-01 17:39:08 +000082 for (int i=0; i<NumOp-1; i++)
83 Cond.push_back(Inst->getOperand(i));
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +000084}
85
Bruno Cardoso Lopesed874ef2011-03-04 17:51:39 +000086bool MipsInstrInfo::AnalyzeBranch(MachineBasicBlock &MBB,
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +000087 MachineBasicBlock *&TBB,
88 MachineBasicBlock *&FBB,
Evan Cheng64dfcac2009-02-09 07:14:22 +000089 SmallVectorImpl<MachineOperand> &Cond,
Akira Hatanaka7320b232013-03-01 01:10:17 +000090 bool AllowModify) const {
91 SmallVector<MachineInstr*, 2> BranchInstrs;
92 BranchType BT = AnalyzeBranch(MBB, TBB, FBB, Cond, AllowModify, BranchInstrs);
Akira Hatanakafcdd9b12012-09-13 17:12:37 +000093
Akira Hatanaka7320b232013-03-01 01:10:17 +000094 return (BT == BT_None) || (BT == BT_Indirect);
Jia Liuf54f60f2012-02-28 07:46:26 +000095}
96
Eric Christopher754d54f2014-07-18 20:35:49 +000097void
98MipsInstrInfo::BuildCondBr(MachineBasicBlock &MBB, MachineBasicBlock *TBB,
Ahmed Bougachac88bf542015-06-11 19:30:37 +000099 DebugLoc DL, ArrayRef<MachineOperand> Cond) const {
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000100 unsigned Opc = Cond[0].getImm();
Evan Cheng6cc775f2011-06-28 19:10:37 +0000101 const MCInstrDesc &MCID = get(Opc);
102 MachineInstrBuilder MIB = BuildMI(&MBB, DL, MCID);
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000103
Akira Hatanakafcdd9b12012-09-13 17:12:37 +0000104 for (unsigned i = 1; i < Cond.size(); ++i) {
105 if (Cond[i].isReg())
106 MIB.addReg(Cond[i].getReg());
107 else if (Cond[i].isImm())
108 MIB.addImm(Cond[i].getImm());
109 else
Craig Topperbeb77bd2016-04-24 04:38:29 +0000110 assert(false && "Cannot copy operand");
Akira Hatanakafcdd9b12012-09-13 17:12:37 +0000111 }
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000112 MIB.addMBB(TBB);
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000113}
114
Eric Christopher754d54f2014-07-18 20:35:49 +0000115unsigned MipsInstrInfo::InsertBranch(
116 MachineBasicBlock &MBB, MachineBasicBlock *TBB, MachineBasicBlock *FBB,
Ahmed Bougachac88bf542015-06-11 19:30:37 +0000117 ArrayRef<MachineOperand> Cond, DebugLoc DL) const {
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000118 // Shouldn't be a fall through.
119 assert(TBB && "InsertBranch must not be told to insert a fallthrough");
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000120
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000121 // # of condition operands:
122 // Unconditional branches: 0
123 // Floating point branches: 1 (opc)
124 // Int BranchZero: 2 (opc, reg)
125 // Int Branch: 3 (opc, reg0, reg1)
126 assert((Cond.size() <= 3) &&
127 "# of Mips branch conditions must be <= 3!");
Bruno Cardoso Lopesed874ef2011-03-04 17:51:39 +0000128
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000129 // Two-way Conditional branch.
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000130 if (FBB) {
131 BuildCondBr(MBB, TBB, DL, Cond);
Akira Hatanaka5d5e0d82011-12-12 22:39:35 +0000132 BuildMI(&MBB, DL, get(UncondBrOpc)).addMBB(FBB);
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000133 return 2;
134 }
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000135
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000136 // One way branch.
137 // Unconditional branch.
138 if (Cond.empty())
Akira Hatanaka5d5e0d82011-12-12 22:39:35 +0000139 BuildMI(&MBB, DL, get(UncondBrOpc)).addMBB(TBB);
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000140 else // Conditional branch.
141 BuildCondBr(MBB, TBB, DL, Cond);
142 return 1;
Bruno Cardoso Lopes35e43c42007-06-06 07:42:06 +0000143}
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000144
Eric Christopher754d54f2014-07-18 20:35:49 +0000145unsigned MipsInstrInfo::RemoveBranch(MachineBasicBlock &MBB) const {
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000146 MachineBasicBlock::reverse_iterator I = MBB.rbegin(), REnd = MBB.rend();
147 MachineBasicBlock::reverse_iterator FirstBr;
148 unsigned removed;
Bruno Cardoso Lopesed874ef2011-03-04 17:51:39 +0000149
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000150 // Skip all the debug instructions.
151 while (I != REnd && I->isDebugValue())
152 ++I;
Bruno Cardoso Lopesed874ef2011-03-04 17:51:39 +0000153
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000154 FirstBr = I;
Bruno Cardoso Lopesed874ef2011-03-04 17:51:39 +0000155
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000156 // Up to 2 branches are removed.
157 // Note that indirect branches are not removed.
Eric Christopher675cb4d2014-07-18 23:25:00 +0000158 for (removed = 0; I != REnd && removed < 2; ++I, ++removed)
Akira Hatanaka067d8152013-05-13 17:43:19 +0000159 if (!getAnalyzableBrOpc(I->getOpcode()))
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000160 break;
Bruno Cardoso Lopesed874ef2011-03-04 17:51:39 +0000161
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000162 MBB.erase(I.base(), FirstBr.base());
163
164 return removed;
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000165}
166
Bruno Cardoso Lopesed874ef2011-03-04 17:51:39 +0000167/// ReverseBranchCondition - Return the inverse opcode of the
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000168/// specified Branch instruction.
Eric Christopher754d54f2014-07-18 20:35:49 +0000169bool MipsInstrInfo::ReverseBranchCondition(
170 SmallVectorImpl<MachineOperand> &Cond) const {
Akira Hatanaka93f898f2011-04-01 17:39:08 +0000171 assert( (Cond.size() && Cond.size() <= 3) &&
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000172 "Invalid Mips branch condition!");
Akira Hatanaka067d8152013-05-13 17:43:19 +0000173 Cond[0].setImm(getOppositeBranchOpc(Cond[0].getImm()));
Bruno Cardoso Lopes7b616f52007-08-18 01:56:48 +0000174 return false;
175}
Dan Gohmand5ca70642009-06-03 20:30:14 +0000176
Eric Christopher754d54f2014-07-18 20:35:49 +0000177MipsInstrInfo::BranchType MipsInstrInfo::AnalyzeBranch(
178 MachineBasicBlock &MBB, MachineBasicBlock *&TBB, MachineBasicBlock *&FBB,
179 SmallVectorImpl<MachineOperand> &Cond, bool AllowModify,
180 SmallVectorImpl<MachineInstr *> &BranchInstrs) const {
Akira Hatanaka7320b232013-03-01 01:10:17 +0000181
182 MachineBasicBlock::reverse_iterator I = MBB.rbegin(), REnd = MBB.rend();
183
184 // Skip all the debug instructions.
185 while (I != REnd && I->isDebugValue())
186 ++I;
187
Duncan P. N. Exon Smith6307eb52016-02-23 02:46:52 +0000188 if (I == REnd || !isUnpredicatedTerminator(*I)) {
Akira Hatanaka7320b232013-03-01 01:10:17 +0000189 // This block ends with no branches (it just falls through to its succ).
190 // Leave TBB/FBB null.
Craig Topper062a2ba2014-04-25 05:30:21 +0000191 TBB = FBB = nullptr;
Akira Hatanaka7320b232013-03-01 01:10:17 +0000192 return BT_NoBranch;
193 }
194
195 MachineInstr *LastInst = &*I;
196 unsigned LastOpc = LastInst->getOpcode();
197 BranchInstrs.push_back(LastInst);
198
199 // Not an analyzable branch (e.g., indirect jump).
Akira Hatanaka067d8152013-05-13 17:43:19 +0000200 if (!getAnalyzableBrOpc(LastOpc))
Akira Hatanaka7320b232013-03-01 01:10:17 +0000201 return LastInst->isIndirectBranch() ? BT_Indirect : BT_None;
202
203 // Get the second to last instruction in the block.
204 unsigned SecondLastOpc = 0;
Craig Topper062a2ba2014-04-25 05:30:21 +0000205 MachineInstr *SecondLastInst = nullptr;
Akira Hatanaka7320b232013-03-01 01:10:17 +0000206
207 if (++I != REnd) {
208 SecondLastInst = &*I;
Akira Hatanaka067d8152013-05-13 17:43:19 +0000209 SecondLastOpc = getAnalyzableBrOpc(SecondLastInst->getOpcode());
Akira Hatanaka7320b232013-03-01 01:10:17 +0000210
211 // Not an analyzable branch (must be an indirect jump).
Duncan P. N. Exon Smith6307eb52016-02-23 02:46:52 +0000212 if (isUnpredicatedTerminator(*SecondLastInst) && !SecondLastOpc)
Akira Hatanaka7320b232013-03-01 01:10:17 +0000213 return BT_None;
214 }
215
Akira Hatanaka7320b232013-03-01 01:10:17 +0000216 // If there is only one terminator instruction, process it.
217 if (!SecondLastOpc) {
Matheus Almeida6de62d32013-10-01 12:53:00 +0000218 // Unconditional branch.
Daniel Sandersf9d8b8c2016-05-06 13:23:51 +0000219 if (LastInst->isUnconditionalBranch()) {
Akira Hatanaka7320b232013-03-01 01:10:17 +0000220 TBB = LastInst->getOperand(0).getMBB();
221 return BT_Uncond;
222 }
223
224 // Conditional branch
225 AnalyzeCondBr(LastInst, LastOpc, TBB, Cond);
226 return BT_Cond;
227 }
228
229 // If we reached here, there are two branches.
230 // If there are three terminators, we don't know what sort of block this is.
Duncan P. N. Exon Smith6307eb52016-02-23 02:46:52 +0000231 if (++I != REnd && isUnpredicatedTerminator(*I))
Akira Hatanaka7320b232013-03-01 01:10:17 +0000232 return BT_None;
233
Akira Hatanaka28dc83c2013-03-01 01:22:26 +0000234 BranchInstrs.insert(BranchInstrs.begin(), SecondLastInst);
235
Akira Hatanaka7320b232013-03-01 01:10:17 +0000236 // If second to last instruction is an unconditional branch,
237 // analyze it and remove the last instruction.
Daniel Sandersf9d8b8c2016-05-06 13:23:51 +0000238 if (SecondLastInst->isUnconditionalBranch()) {
Akira Hatanaka7320b232013-03-01 01:10:17 +0000239 // Return if the last instruction cannot be removed.
240 if (!AllowModify)
241 return BT_None;
242
243 TBB = SecondLastInst->getOperand(0).getMBB();
244 LastInst->eraseFromParent();
245 BranchInstrs.pop_back();
246 return BT_Uncond;
247 }
248
249 // Conditional branch followed by an unconditional branch.
250 // The last one must be unconditional.
Daniel Sandersf9d8b8c2016-05-06 13:23:51 +0000251 if (!LastInst->isUnconditionalBranch())
Akira Hatanaka7320b232013-03-01 01:10:17 +0000252 return BT_None;
253
254 AnalyzeCondBr(SecondLastInst, SecondLastOpc, TBB, Cond);
255 FBB = LastInst->getOperand(0).getMBB();
256
257 return BT_CondUncond;
258}
259
Daniel Sanderse8efff32016-03-14 16:24:05 +0000260/// Return the corresponding compact (no delay slot) form of a branch.
261unsigned MipsInstrInfo::getEquivalentCompactForm(
262 const MachineBasicBlock::iterator I) const {
263 unsigned Opcode = I->getOpcode();
Simon Dardisd9d41f52016-04-05 12:50:29 +0000264 bool canUseShortMicroMipsCTI = false;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000265
Simon Dardisd9d41f52016-04-05 12:50:29 +0000266 if (Subtarget.inMicroMipsMode()) {
267 switch (Opcode) {
268 case Mips::BNE:
269 case Mips::BEQ:
270 // microMIPS has NE,EQ branches that do not have delay slots provided one
271 // of the operands is zero.
272 if (I->getOperand(1).getReg() == Subtarget.getABI().GetZeroReg())
273 canUseShortMicroMipsCTI = true;
274 break;
275 // For microMIPS the PseudoReturn and PseudoIndirectBranch are always
276 // expanded to JR_MM, so they can be replaced with JRC16_MM.
277 case Mips::JR:
278 case Mips::PseudoReturn:
279 case Mips::PseudoIndirectBranch:
280 canUseShortMicroMipsCTI = true;
281 break;
282 }
283 }
284
Simon Dardis669d8dd2016-05-18 10:38:01 +0000285 // MIPSR6 forbids both operands being the zero register.
286 if (Subtarget.hasMips32r6() && (I->getNumOperands() > 1) &&
287 (I->getOperand(0).isReg() &&
288 (I->getOperand(0).getReg() == Mips::ZERO ||
289 I->getOperand(0).getReg() == Mips::ZERO_64)) &&
290 (I->getOperand(1).isReg() &&
291 (I->getOperand(1).getReg() == Mips::ZERO ||
292 I->getOperand(1).getReg() == Mips::ZERO_64)))
293 return 0;
294
Simon Dardisd9d41f52016-04-05 12:50:29 +0000295 if (Subtarget.hasMips32r6() || canUseShortMicroMipsCTI) {
Daniel Sanderse8efff32016-03-14 16:24:05 +0000296 switch (Opcode) {
297 case Mips::B:
298 return Mips::BC;
299 case Mips::BAL:
300 return Mips::BALC;
301 case Mips::BEQ:
Simon Dardisd9d41f52016-04-05 12:50:29 +0000302 if (canUseShortMicroMipsCTI)
Daniel Sanderse8efff32016-03-14 16:24:05 +0000303 return Mips::BEQZC_MM;
Simon Dardis03676dc2016-05-31 09:54:55 +0000304 else if (I->getOperand(0).getReg() == I->getOperand(1).getReg())
305 return 0;
306 return Mips::BEQC;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000307 case Mips::BNE:
Simon Dardisd9d41f52016-04-05 12:50:29 +0000308 if (canUseShortMicroMipsCTI)
Daniel Sanderse8efff32016-03-14 16:24:05 +0000309 return Mips::BNEZC_MM;
Simon Dardis03676dc2016-05-31 09:54:55 +0000310 else if (I->getOperand(0).getReg() == I->getOperand(1).getReg())
311 return 0;
312 return Mips::BNEC;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000313 case Mips::BGE:
Simon Dardis669d8dd2016-05-18 10:38:01 +0000314 if (I->getOperand(0).getReg() == I->getOperand(1).getReg())
315 return 0;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000316 return Mips::BGEC;
317 case Mips::BGEU:
Simon Dardis669d8dd2016-05-18 10:38:01 +0000318 if (I->getOperand(0).getReg() == I->getOperand(1).getReg())
319 return 0;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000320 return Mips::BGEUC;
321 case Mips::BGEZ:
322 return Mips::BGEZC;
323 case Mips::BGTZ:
324 return Mips::BGTZC;
325 case Mips::BLEZ:
326 return Mips::BLEZC;
327 case Mips::BLT:
Simon Dardis669d8dd2016-05-18 10:38:01 +0000328 if (I->getOperand(0).getReg() == I->getOperand(1).getReg())
329 return 0;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000330 return Mips::BLTC;
331 case Mips::BLTU:
Simon Dardis669d8dd2016-05-18 10:38:01 +0000332 if (I->getOperand(0).getReg() == I->getOperand(1).getReg())
333 return 0;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000334 return Mips::BLTUC;
335 case Mips::BLTZ:
336 return Mips::BLTZC;
Simon Dardisd9d41f52016-04-05 12:50:29 +0000337 // For MIPSR6, the instruction 'jic' can be used for these cases. Some
338 // tools will accept 'jrc reg' as an alias for 'jic 0, $reg'.
339 case Mips::JR:
340 case Mips::PseudoReturn:
341 case Mips::PseudoIndirectBranch:
342 if (canUseShortMicroMipsCTI)
343 return Mips::JRC16_MM;
344 return Mips::JIC;
345 case Mips::JALRPseudo:
346 return Mips::JIALC;
347 case Mips::JR64:
348 case Mips::PseudoReturn64:
349 case Mips::PseudoIndirectBranch64:
350 return Mips::JIC64;
351 case Mips::JALR64Pseudo:
352 return Mips::JIALC64;
Simon Dardis669d8dd2016-05-18 10:38:01 +0000353 default:
Daniel Sanderse8efff32016-03-14 16:24:05 +0000354 return 0;
355 }
356 }
357
358 return 0;
359}
360
361/// Predicate for distingushing between control transfer instructions and all
362/// other instructions for handling forbidden slots. Consider inline assembly
363/// as unsafe as well.
364bool MipsInstrInfo::SafeInForbiddenSlot(const MachineInstr &MI) const {
365 if (MI.isInlineAsm())
366 return false;
367
368 return (MI.getDesc().TSFlags & MipsII::IsCTI) == 0;
369
370}
371
372/// Predicate for distingushing instructions that have forbidden slots.
373bool MipsInstrInfo::HasForbiddenSlot(const MachineInstr &MI) const {
374 return (MI.getDesc().TSFlags & MipsII::HasForbiddenSlot) != 0;
375}
376
Akira Hatanakaacd1a7d2012-06-14 01:16:45 +0000377/// Return the number of bytes of code the specified instruction may be.
378unsigned MipsInstrInfo::GetInstSizeInBytes(const MachineInstr *MI) const {
379 switch (MI->getOpcode()) {
380 default:
381 return MI->getDesc().getSize();
382 case TargetOpcode::INLINEASM: { // Inline Asm: Variable size.
383 const MachineFunction *MF = MI->getParent()->getParent();
384 const char *AsmStr = MI->getOperand(0).getSymbolName();
385 return getInlineAsmLength(AsmStr, *MF->getTarget().getMCAsmInfo());
386 }
Reed Kotler91ae9822013-10-27 21:57:36 +0000387 case Mips::CONSTPOOL_ENTRY:
388 // If this machine instr is a constant pool entry, its size is recorded as
389 // operand #2.
390 return MI->getOperand(2).getImm();
Akira Hatanakaacd1a7d2012-06-14 01:16:45 +0000391 }
392}
Akira Hatanaka310e26a2013-05-13 17:57:42 +0000393
394MachineInstrBuilder
395MipsInstrInfo::genInstrWithNewOpc(unsigned NewOpc,
396 MachineBasicBlock::iterator I) const {
397 MachineInstrBuilder MIB;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000398
399 // Certain branches have two forms: e.g beq $1, $zero, dst vs beqz $1, dest
400 // Pick the zero form of the branch for readable assembly and for greater
401 // branch distance in non-microMIPS mode.
Simon Dardisd9d41f52016-04-05 12:50:29 +0000402 // FIXME: Certain atomic sequences on mips64 generate 32bit references to
403 // Mips::ZERO, which is incorrect. This test should be updated to use
404 // Subtarget.getABI().GetZeroReg() when those atomic sequences and others
405 // are fixed.
406 bool BranchWithZeroOperand =
407 (I->isBranch() && !I->isPseudo() && I->getOperand(1).isReg() &&
408 (I->getOperand(1).getReg() == Mips::ZERO ||
409 I->getOperand(1).getReg() == Mips::ZERO_64));
410
411 if (BranchWithZeroOperand) {
Daniel Sanderse8efff32016-03-14 16:24:05 +0000412 switch (NewOpc) {
413 case Mips::BEQC:
414 NewOpc = Mips::BEQZC;
415 break;
416 case Mips::BNEC:
417 NewOpc = Mips::BNEZC;
418 break;
419 case Mips::BGEC:
420 NewOpc = Mips::BGEZC;
421 break;
422 case Mips::BLTC:
423 NewOpc = Mips::BLTZC;
424 break;
Daniel Sanderse8efff32016-03-14 16:24:05 +0000425 }
426 }
427
Akira Hatanaka310e26a2013-05-13 17:57:42 +0000428 MIB = BuildMI(*I->getParent(), I, I->getDebugLoc(), get(NewOpc));
429
Simon Dardisd9d41f52016-04-05 12:50:29 +0000430 // For MIPSR6 JI*C requires an immediate 0 as an operand, JIALC(64) an
431 // immediate 0 as an operand and requires the removal of it's %RA<imp-def>
432 // implicit operand as copying the implicit operations of the instructio we're
433 // looking at will give us the correct flags.
434 if (NewOpc == Mips::JIC || NewOpc == Mips::JIALC || NewOpc == Mips::JIC64 ||
435 NewOpc == Mips::JIALC64) {
436
437 if (NewOpc == Mips::JIALC || NewOpc == Mips::JIALC64)
438 MIB->RemoveOperand(0);
439
440 for (unsigned J = 0, E = I->getDesc().getNumOperands(); J < E; ++J) {
Daniel Sanderse8efff32016-03-14 16:24:05 +0000441 MIB.addOperand(I->getOperand(J));
Simon Dardisd9d41f52016-04-05 12:50:29 +0000442 }
443
444 MIB.addImm(0);
445
446 } else if (BranchWithZeroOperand) {
447 // For MIPSR6 and microMIPS branches with an explicit zero operand, copy
448 // everything after the zero.
449 MIB.addOperand(I->getOperand(0));
450
451 for (unsigned J = 2, E = I->getDesc().getNumOperands(); J < E; ++J) {
452 MIB.addOperand(I->getOperand(J));
453 }
454 } else {
455 // All other cases copy all other operands.
456 for (unsigned J = 0, E = I->getDesc().getNumOperands(); J < E; ++J) {
457 MIB.addOperand(I->getOperand(J));
458 }
459 }
460
461 MIB.copyImplicitOps(*I);
Akira Hatanaka310e26a2013-05-13 17:57:42 +0000462
463 MIB.setMemRefs(I->memoperands_begin(), I->memoperands_end());
464 return MIB;
465}