1 //===-- RISCVInstrInfo.cpp - RISCV Instruction Information ------*- C++ -*-===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file contains the RISCV implementation of the TargetInstrInfo class.
11 //
12 //===----------------------------------------------------------------------===//
13
14 #include "RISCVInstrInfo.h"
15 #include "RISCV.h"
16 #include "RISCVSubtarget.h"
17 #include "RISCVTargetMachine.h"
18 #include "llvm/ADT/STLExtras.h"
19 #include "llvm/ADT/SmallVector.h"
20 #include "llvm/CodeGen/MachineFunctionPass.h"
21 #include "llvm/CodeGen/MachineInstrBuilder.h"
22 #include "llvm/CodeGen/MachineRegisterInfo.h"
23 #include "llvm/CodeGen/RegisterScavenging.h"
24 #include "llvm/Support/ErrorHandling.h"
25 #include "llvm/Support/TargetRegistry.h"
26
27 #define GET_INSTRINFO_CTOR_DTOR
28 #include "RISCVGenInstrInfo.inc"
29
30 using namespace llvm;
31
RISCVInstrInfo()32 RISCVInstrInfo::RISCVInstrInfo()
33 : RISCVGenInstrInfo(RISCV::ADJCALLSTACKDOWN, RISCV::ADJCALLSTACKUP) {}
34
isLoadFromStackSlot(const MachineInstr & MI,int & FrameIndex) const35 unsigned RISCVInstrInfo::isLoadFromStackSlot(const MachineInstr &MI,
36 int &FrameIndex) const {
37 switch (MI.getOpcode()) {
38 default:
39 return 0;
40 case RISCV::LB:
41 case RISCV::LBU:
42 case RISCV::LH:
43 case RISCV::LHU:
44 case RISCV::LW:
45 case RISCV::FLW:
46 case RISCV::LWU:
47 case RISCV::LD:
48 case RISCV::FLD:
49 break;
50 }
51
52 if (MI.getOperand(1).isFI() && MI.getOperand(2).isImm() &&
53 MI.getOperand(2).getImm() == 0) {
54 FrameIndex = MI.getOperand(1).getIndex();
55 return MI.getOperand(0).getReg();
56 }
57
58 return 0;
59 }
60
isStoreToStackSlot(const MachineInstr & MI,int & FrameIndex) const61 unsigned RISCVInstrInfo::isStoreToStackSlot(const MachineInstr &MI,
62 int &FrameIndex) const {
63 switch (MI.getOpcode()) {
64 default:
65 return 0;
66 case RISCV::SB:
67 case RISCV::SH:
68 case RISCV::SW:
69 case RISCV::FSW:
70 case RISCV::SD:
71 case RISCV::FSD:
72 break;
73 }
74
75 if (MI.getOperand(0).isFI() && MI.getOperand(1).isImm() &&
76 MI.getOperand(1).getImm() == 0) {
77 FrameIndex = MI.getOperand(0).getIndex();
78 return MI.getOperand(2).getReg();
79 }
80
81 return 0;
82 }
83
copyPhysReg(MachineBasicBlock & MBB,MachineBasicBlock::iterator MBBI,const DebugLoc & DL,unsigned DstReg,unsigned SrcReg,bool KillSrc) const84 void RISCVInstrInfo::copyPhysReg(MachineBasicBlock &MBB,
85 MachineBasicBlock::iterator MBBI,
86 const DebugLoc &DL, unsigned DstReg,
87 unsigned SrcReg, bool KillSrc) const {
88 if (RISCV::GPRRegClass.contains(DstReg, SrcReg)) {
89 BuildMI(MBB, MBBI, DL, get(RISCV::ADDI), DstReg)
90 .addReg(SrcReg, getKillRegState(KillSrc))
91 .addImm(0);
92 return;
93 }
94
95 // FPR->FPR copies
96 unsigned Opc;
97 if (RISCV::FPR32RegClass.contains(DstReg, SrcReg))
98 Opc = RISCV::FSGNJ_S;
99 else if (RISCV::FPR64RegClass.contains(DstReg, SrcReg))
100 Opc = RISCV::FSGNJ_D;
101 else
102 llvm_unreachable("Impossible reg-to-reg copy");
103
104 BuildMI(MBB, MBBI, DL, get(Opc), DstReg)
105 .addReg(SrcReg, getKillRegState(KillSrc))
106 .addReg(SrcReg, getKillRegState(KillSrc));
107 }
108
storeRegToStackSlot(MachineBasicBlock & MBB,MachineBasicBlock::iterator I,unsigned SrcReg,bool IsKill,int FI,const TargetRegisterClass * RC,const TargetRegisterInfo * TRI) const109 void RISCVInstrInfo::storeRegToStackSlot(MachineBasicBlock &MBB,
110 MachineBasicBlock::iterator I,
111 unsigned SrcReg, bool IsKill, int FI,
112 const TargetRegisterClass *RC,
113 const TargetRegisterInfo *TRI) const {
114 DebugLoc DL;
115 if (I != MBB.end())
116 DL = I->getDebugLoc();
117
118 unsigned Opcode;
119
120 if (RISCV::GPRRegClass.hasSubClassEq(RC))
121 Opcode = TRI->getRegSizeInBits(RISCV::GPRRegClass) == 32 ?
122 RISCV::SW : RISCV::SD;
123 else if (RISCV::FPR32RegClass.hasSubClassEq(RC))
124 Opcode = RISCV::FSW;
125 else if (RISCV::FPR64RegClass.hasSubClassEq(RC))
126 Opcode = RISCV::FSD;
127 else
128 llvm_unreachable("Can't store this register to stack slot");
129
130 BuildMI(MBB, I, DL, get(Opcode))
131 .addReg(SrcReg, getKillRegState(IsKill))
132 .addFrameIndex(FI)
133 .addImm(0);
134 }
135
loadRegFromStackSlot(MachineBasicBlock & MBB,MachineBasicBlock::iterator I,unsigned DstReg,int FI,const TargetRegisterClass * RC,const TargetRegisterInfo * TRI) const136 void RISCVInstrInfo::loadRegFromStackSlot(MachineBasicBlock &MBB,
137 MachineBasicBlock::iterator I,
138 unsigned DstReg, int FI,
139 const TargetRegisterClass *RC,
140 const TargetRegisterInfo *TRI) const {
141 DebugLoc DL;
142 if (I != MBB.end())
143 DL = I->getDebugLoc();
144
145 unsigned Opcode;
146
147 if (RISCV::GPRRegClass.hasSubClassEq(RC))
148 Opcode = TRI->getRegSizeInBits(RISCV::GPRRegClass) == 32 ?
149 RISCV::LW : RISCV::LD;
150 else if (RISCV::FPR32RegClass.hasSubClassEq(RC))
151 Opcode = RISCV::FLW;
152 else if (RISCV::FPR64RegClass.hasSubClassEq(RC))
153 Opcode = RISCV::FLD;
154 else
155 llvm_unreachable("Can't load this register from stack slot");
156
157 BuildMI(MBB, I, DL, get(Opcode), DstReg).addFrameIndex(FI).addImm(0);
158 }
159
movImm32(MachineBasicBlock & MBB,MachineBasicBlock::iterator MBBI,const DebugLoc & DL,unsigned DstReg,uint64_t Val,MachineInstr::MIFlag Flag) const160 void RISCVInstrInfo::movImm32(MachineBasicBlock &MBB,
161 MachineBasicBlock::iterator MBBI,
162 const DebugLoc &DL, unsigned DstReg, uint64_t Val,
163 MachineInstr::MIFlag Flag) const {
164 assert(isInt<32>(Val) && "Can only materialize 32-bit constants");
165
166 // TODO: If the value can be materialized using only one instruction, only
167 // insert a single instruction.
168
169 uint64_t Hi20 = ((Val + 0x800) >> 12) & 0xfffff;
170 uint64_t Lo12 = SignExtend64<12>(Val);
171 BuildMI(MBB, MBBI, DL, get(RISCV::LUI), DstReg)
172 .addImm(Hi20)
173 .setMIFlag(Flag);
174 BuildMI(MBB, MBBI, DL, get(RISCV::ADDI), DstReg)
175 .addReg(DstReg, RegState::Kill)
176 .addImm(Lo12)
177 .setMIFlag(Flag);
178 }
179
180 // The contents of values added to Cond are not examined outside of
181 // RISCVInstrInfo, giving us flexibility in what to push to it. For RISCV, we
182 // push BranchOpcode, Reg1, Reg2.
parseCondBranch(MachineInstr & LastInst,MachineBasicBlock * & Target,SmallVectorImpl<MachineOperand> & Cond)183 static void parseCondBranch(MachineInstr &LastInst, MachineBasicBlock *&Target,
184 SmallVectorImpl<MachineOperand> &Cond) {
185 // Block ends with fall-through condbranch.
186 assert(LastInst.getDesc().isConditionalBranch() &&
187 "Unknown conditional branch");
188 Target = LastInst.getOperand(2).getMBB();
189 Cond.push_back(MachineOperand::CreateImm(LastInst.getOpcode()));
190 Cond.push_back(LastInst.getOperand(0));
191 Cond.push_back(LastInst.getOperand(1));
192 }
193
getOppositeBranchOpcode(int Opc)194 static unsigned getOppositeBranchOpcode(int Opc) {
195 switch (Opc) {
196 default:
197 llvm_unreachable("Unrecognized conditional branch");
198 case RISCV::BEQ:
199 return RISCV::BNE;
200 case RISCV::BNE:
201 return RISCV::BEQ;
202 case RISCV::BLT:
203 return RISCV::BGE;
204 case RISCV::BGE:
205 return RISCV::BLT;
206 case RISCV::BLTU:
207 return RISCV::BGEU;
208 case RISCV::BGEU:
209 return RISCV::BLTU;
210 }
211 }
212
analyzeBranch(MachineBasicBlock & MBB,MachineBasicBlock * & TBB,MachineBasicBlock * & FBB,SmallVectorImpl<MachineOperand> & Cond,bool AllowModify) const213 bool RISCVInstrInfo::analyzeBranch(MachineBasicBlock &MBB,
214 MachineBasicBlock *&TBB,
215 MachineBasicBlock *&FBB,
216 SmallVectorImpl<MachineOperand> &Cond,
217 bool AllowModify) const {
218 TBB = FBB = nullptr;
219 Cond.clear();
220
221 // If the block has no terminators, it just falls into the block after it.
222 MachineBasicBlock::iterator I = MBB.getLastNonDebugInstr();
223 if (I == MBB.end() || !isUnpredicatedTerminator(*I))
224 return false;
225
226 // Count the number of terminators and find the first unconditional or
227 // indirect branch.
228 MachineBasicBlock::iterator FirstUncondOrIndirectBr = MBB.end();
229 int NumTerminators = 0;
230 for (auto J = I.getReverse(); J != MBB.rend() && isUnpredicatedTerminator(*J);
231 J++) {
232 NumTerminators++;
233 if (J->getDesc().isUnconditionalBranch() ||
234 J->getDesc().isIndirectBranch()) {
235 FirstUncondOrIndirectBr = J.getReverse();
236 }
237 }
238
239 // If AllowModify is true, we can erase any terminators after
240 // FirstUncondOrIndirectBR.
241 if (AllowModify && FirstUncondOrIndirectBr != MBB.end()) {
242 while (std::next(FirstUncondOrIndirectBr) != MBB.end()) {
243 std::next(FirstUncondOrIndirectBr)->eraseFromParent();
244 NumTerminators--;
245 }
246 I = FirstUncondOrIndirectBr;
247 }
248
249 // We can't handle blocks that end in an indirect branch.
250 if (I->getDesc().isIndirectBranch())
251 return true;
252
253 // We can't handle blocks with more than 2 terminators.
254 if (NumTerminators > 2)
255 return true;
256
257 // Handle a single unconditional branch.
258 if (NumTerminators == 1 && I->getDesc().isUnconditionalBranch()) {
259 TBB = I->getOperand(0).getMBB();
260 return false;
261 }
262
263 // Handle a single conditional branch.
264 if (NumTerminators == 1 && I->getDesc().isConditionalBranch()) {
265 parseCondBranch(*I, TBB, Cond);
266 return false;
267 }
268
269 // Handle a conditional branch followed by an unconditional branch.
270 if (NumTerminators == 2 && std::prev(I)->getDesc().isConditionalBranch() &&
271 I->getDesc().isUnconditionalBranch()) {
272 parseCondBranch(*std::prev(I), TBB, Cond);
273 FBB = I->getOperand(0).getMBB();
274 return false;
275 }
276
277 // Otherwise, we can't handle this.
278 return true;
279 }
280
removeBranch(MachineBasicBlock & MBB,int * BytesRemoved) const281 unsigned RISCVInstrInfo::removeBranch(MachineBasicBlock &MBB,
282 int *BytesRemoved) const {
283 if (BytesRemoved)
284 *BytesRemoved = 0;
285 MachineBasicBlock::iterator I = MBB.getLastNonDebugInstr();
286 if (I == MBB.end())
287 return 0;
288
289 if (!I->getDesc().isUnconditionalBranch() &&
290 !I->getDesc().isConditionalBranch())
291 return 0;
292
293 // Remove the branch.
294 I->eraseFromParent();
295 if (BytesRemoved)
296 *BytesRemoved += getInstSizeInBytes(*I);
297
298 I = MBB.end();
299
300 if (I == MBB.begin())
301 return 1;
302 --I;
303 if (!I->getDesc().isConditionalBranch())
304 return 1;
305
306 // Remove the branch.
307 I->eraseFromParent();
308 if (BytesRemoved)
309 *BytesRemoved += getInstSizeInBytes(*I);
310 return 2;
311 }
312
313 // Inserts a branch into the end of the specific MachineBasicBlock, returning
314 // the number of instructions inserted.
insertBranch(MachineBasicBlock & MBB,MachineBasicBlock * TBB,MachineBasicBlock * FBB,ArrayRef<MachineOperand> Cond,const DebugLoc & DL,int * BytesAdded) const315 unsigned RISCVInstrInfo::insertBranch(
316 MachineBasicBlock &MBB, MachineBasicBlock *TBB, MachineBasicBlock *FBB,
317 ArrayRef<MachineOperand> Cond, const DebugLoc &DL, int *BytesAdded) const {
318 if (BytesAdded)
319 *BytesAdded = 0;
320
321 // Shouldn't be a fall through.
322 assert(TBB && "InsertBranch must not be told to insert a fallthrough");
323 assert((Cond.size() == 3 || Cond.size() == 0) &&
324 "RISCV branch conditions have two components!");
325
326 // Unconditional branch.
327 if (Cond.empty()) {
328 MachineInstr &MI = *BuildMI(&MBB, DL, get(RISCV::PseudoBR)).addMBB(TBB);
329 if (BytesAdded)
330 *BytesAdded += getInstSizeInBytes(MI);
331 return 1;
332 }
333
334 // Either a one or two-way conditional branch.
335 unsigned Opc = Cond[0].getImm();
336 MachineInstr &CondMI =
337 *BuildMI(&MBB, DL, get(Opc)).add(Cond[1]).add(Cond[2]).addMBB(TBB);
338 if (BytesAdded)
339 *BytesAdded += getInstSizeInBytes(CondMI);
340
341 // One-way conditional branch.
342 if (!FBB)
343 return 1;
344
345 // Two-way conditional branch.
346 MachineInstr &MI = *BuildMI(&MBB, DL, get(RISCV::PseudoBR)).addMBB(FBB);
347 if (BytesAdded)
348 *BytesAdded += getInstSizeInBytes(MI);
349 return 2;
350 }
351
insertIndirectBranch(MachineBasicBlock & MBB,MachineBasicBlock & DestBB,const DebugLoc & DL,int64_t BrOffset,RegScavenger * RS) const352 unsigned RISCVInstrInfo::insertIndirectBranch(MachineBasicBlock &MBB,
353 MachineBasicBlock &DestBB,
354 const DebugLoc &DL,
355 int64_t BrOffset,
356 RegScavenger *RS) const {
357 assert(RS && "RegScavenger required for long branching");
358 assert(MBB.empty() &&
359 "new block should be inserted for expanding unconditional branch");
360 assert(MBB.pred_size() == 1);
361
362 MachineFunction *MF = MBB.getParent();
363 MachineRegisterInfo &MRI = MF->getRegInfo();
364 const auto &TM = static_cast<const RISCVTargetMachine &>(MF->getTarget());
365 const auto &STI = MF->getSubtarget<RISCVSubtarget>();
366
367 if (TM.isPositionIndependent() || STI.is64Bit())
368 report_fatal_error("Unable to insert indirect branch");
369
370 if (!isInt<32>(BrOffset))
371 report_fatal_error(
372 "Branch offsets outside of the signed 32-bit range not supported");
373
374 // FIXME: A virtual register must be used initially, as the register
375 // scavenger won't work with empty blocks (SIInstrInfo::insertIndirectBranch
376 // uses the same workaround).
377 unsigned ScratchReg = MRI.createVirtualRegister(&RISCV::GPRRegClass);
378 auto II = MBB.end();
379
380 MachineInstr &LuiMI = *BuildMI(MBB, II, DL, get(RISCV::LUI), ScratchReg)
381 .addMBB(&DestBB, RISCVII::MO_HI);
382 BuildMI(MBB, II, DL, get(RISCV::PseudoBRIND))
383 .addReg(ScratchReg, RegState::Kill)
384 .addMBB(&DestBB, RISCVII::MO_LO);
385
386 RS->enterBasicBlockEnd(MBB);
387 unsigned Scav = RS->scavengeRegisterBackwards(
388 RISCV::GPRRegClass, MachineBasicBlock::iterator(LuiMI), false, 0);
389 MRI.replaceRegWith(ScratchReg, Scav);
390 MRI.clearVirtRegs();
391 RS->setRegUsed(Scav);
392 return 8;
393 }
394
reverseBranchCondition(SmallVectorImpl<MachineOperand> & Cond) const395 bool RISCVInstrInfo::reverseBranchCondition(
396 SmallVectorImpl<MachineOperand> &Cond) const {
397 assert((Cond.size() == 3) && "Invalid branch condition!");
398 Cond[0].setImm(getOppositeBranchOpcode(Cond[0].getImm()));
399 return false;
400 }
401
402 MachineBasicBlock *
getBranchDestBlock(const MachineInstr & MI) const403 RISCVInstrInfo::getBranchDestBlock(const MachineInstr &MI) const {
404 assert(MI.getDesc().isBranch() && "Unexpected opcode!");
405 // The branch target is always the last operand.
406 int NumOp = MI.getNumExplicitOperands();
407 return MI.getOperand(NumOp - 1).getMBB();
408 }
409
isBranchOffsetInRange(unsigned BranchOp,int64_t BrOffset) const410 bool RISCVInstrInfo::isBranchOffsetInRange(unsigned BranchOp,
411 int64_t BrOffset) const {
412 // Ideally we could determine the supported branch offset from the
413 // RISCVII::FormMask, but this can't be used for Pseudo instructions like
414 // PseudoBR.
415 switch (BranchOp) {
416 default:
417 llvm_unreachable("Unexpected opcode!");
418 case RISCV::BEQ:
419 case RISCV::BNE:
420 case RISCV::BLT:
421 case RISCV::BGE:
422 case RISCV::BLTU:
423 case RISCV::BGEU:
424 return isIntN(13, BrOffset);
425 case RISCV::JAL:
426 case RISCV::PseudoBR:
427 return isIntN(21, BrOffset);
428 }
429 }
430
getInstSizeInBytes(const MachineInstr & MI) const431 unsigned RISCVInstrInfo::getInstSizeInBytes(const MachineInstr &MI) const {
432 unsigned Opcode = MI.getOpcode();
433
434 switch (Opcode) {
435 default: { return get(Opcode).getSize(); }
436 case TargetOpcode::EH_LABEL:
437 case TargetOpcode::IMPLICIT_DEF:
438 case TargetOpcode::KILL:
439 case TargetOpcode::DBG_VALUE:
440 return 0;
441 case RISCV::PseudoCALL:
442 case RISCV::PseudoTAIL:
443 return 8;
444 case TargetOpcode::INLINEASM: {
445 const MachineFunction &MF = *MI.getParent()->getParent();
446 const auto &TM = static_cast<const RISCVTargetMachine &>(MF.getTarget());
447 return getInlineAsmLength(MI.getOperand(0).getSymbolName(),
448 *TM.getMCAsmInfo());
449 }
450 }
451 }
452