1 //===-- HexagonInstrInfo.cpp - Hexagon Instruction Information ------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains the Hexagon implementation of the TargetInstrInfo class.
12 //===----------------------------------------------------------------------===//
14 #include "HexagonInstrInfo.h"
16 #include "HexagonRegisterInfo.h"
17 #include "HexagonSubtarget.h"
18 #include "llvm/ADT/STLExtras.h"
19 #include "llvm/ADT/SmallVector.h"
20 #include "llvm/CodeGen/DFAPacketizer.h"
21 #include "llvm/CodeGen/MachineFrameInfo.h"
22 #include "llvm/CodeGen/MachineInstrBuilder.h"
23 #include "llvm/CodeGen/MachineMemOperand.h"
24 #include "llvm/CodeGen/MachineRegisterInfo.h"
25 #include "llvm/CodeGen/PseudoSourceValue.h"
26 #include "llvm/Support/Debug.h"
27 #include "llvm/Support/MathExtras.h"
28 #include "llvm/Support/raw_ostream.h"
32 #define DEBUG_TYPE "hexagon-instrinfo"
34 #define GET_INSTRINFO_CTOR_DTOR
35 #define GET_INSTRMAP_INFO
36 #include "HexagonGenInstrInfo.inc"
37 #include "HexagonGenDFAPacketizer.inc"
40 /// Constants for Hexagon instructions.
42 const int Hexagon_MEMW_OFFSET_MAX = 4095;
43 const int Hexagon_MEMW_OFFSET_MIN = -4096;
44 const int Hexagon_MEMD_OFFSET_MAX = 8191;
45 const int Hexagon_MEMD_OFFSET_MIN = -8192;
46 const int Hexagon_MEMH_OFFSET_MAX = 2047;
47 const int Hexagon_MEMH_OFFSET_MIN = -2048;
48 const int Hexagon_MEMB_OFFSET_MAX = 1023;
49 const int Hexagon_MEMB_OFFSET_MIN = -1024;
50 const int Hexagon_ADDI_OFFSET_MAX = 32767;
51 const int Hexagon_ADDI_OFFSET_MIN = -32768;
52 const int Hexagon_MEMD_AUTOINC_MAX = 56;
53 const int Hexagon_MEMD_AUTOINC_MIN = -64;
54 const int Hexagon_MEMW_AUTOINC_MAX = 28;
55 const int Hexagon_MEMW_AUTOINC_MIN = -32;
56 const int Hexagon_MEMH_AUTOINC_MAX = 14;
57 const int Hexagon_MEMH_AUTOINC_MIN = -16;
58 const int Hexagon_MEMB_AUTOINC_MAX = 7;
59 const int Hexagon_MEMB_AUTOINC_MIN = -8;
61 // Pin the vtable to this file.
62 void HexagonInstrInfo::anchor() {}
64 HexagonInstrInfo::HexagonInstrInfo(HexagonSubtarget &ST)
65 : HexagonGenInstrInfo(Hexagon::ADJCALLSTACKDOWN, Hexagon::ADJCALLSTACKUP),
66 RI(), Subtarget(ST) {}
68 /// isLoadFromStackSlot - If the specified machine instruction is a direct
69 /// load from a stack slot, return the virtual or physical register number of
70 /// the destination along with the FrameIndex of the loaded stack slot. If
71 /// not, return 0. This predicate must return 0 if the instruction has
72 /// any side effects other than loading from the stack slot.
73 unsigned HexagonInstrInfo::isLoadFromStackSlot(const MachineInstr *MI,
74 int &FrameIndex) const {
77 switch (MI->getOpcode()) {
79 case Hexagon::L2_loadri_io:
80 case Hexagon::L2_loadrd_io:
81 case Hexagon::L2_loadrh_io:
82 case Hexagon::L2_loadrb_io:
83 case Hexagon::L2_loadrub_io:
84 if (MI->getOperand(2).isFI() &&
85 MI->getOperand(1).isImm() && (MI->getOperand(1).getImm() == 0)) {
86 FrameIndex = MI->getOperand(2).getIndex();
87 return MI->getOperand(0).getReg();
95 /// isStoreToStackSlot - If the specified machine instruction is a direct
96 /// store to a stack slot, return the virtual or physical register number of
97 /// the source reg along with the FrameIndex of the loaded stack slot. If
98 /// not, return 0. This predicate must return 0 if the instruction has
99 /// any side effects other than storing to the stack slot.
100 unsigned HexagonInstrInfo::isStoreToStackSlot(const MachineInstr *MI,
101 int &FrameIndex) const {
102 switch (MI->getOpcode()) {
104 case Hexagon::S2_storeri_io:
105 case Hexagon::S2_storerd_io:
106 case Hexagon::S2_storerh_io:
107 case Hexagon::S2_storerb_io:
108 if (MI->getOperand(2).isFI() &&
109 MI->getOperand(1).isImm() && (MI->getOperand(1).getImm() == 0)) {
110 FrameIndex = MI->getOperand(0).getIndex();
111 return MI->getOperand(2).getReg();
120 HexagonInstrInfo::InsertBranch(MachineBasicBlock &MBB,MachineBasicBlock *TBB,
121 MachineBasicBlock *FBB,
122 const SmallVectorImpl<MachineOperand> &Cond,
125 int BOpc = Hexagon::J2_jump;
126 int BccOpc = Hexagon::J2_jumpt;
128 assert(TBB && "InsertBranch must not be told to insert a fallthrough");
131 // Check if ReverseBranchCondition has asked to reverse this branch
132 // If we want to reverse the branch an odd number of times, we want
134 if (!Cond.empty() && Cond[0].isImm() && Cond[0].getImm() == 0) {
135 BccOpc = Hexagon::J2_jumpf;
141 // Due to a bug in TailMerging/CFG Optimization, we need to add a
142 // special case handling of a predicated jump followed by an
143 // unconditional jump. If not, Tail Merging and CFG Optimization go
144 // into an infinite loop.
145 MachineBasicBlock *NewTBB, *NewFBB;
146 SmallVector<MachineOperand, 4> Cond;
147 MachineInstr *Term = MBB.getFirstTerminator();
148 if (isPredicated(Term) && !AnalyzeBranch(MBB, NewTBB, NewFBB, Cond,
150 MachineBasicBlock *NextBB =
151 std::next(MachineFunction::iterator(&MBB));
152 if (NewTBB == NextBB) {
153 ReverseBranchCondition(Cond);
155 return InsertBranch(MBB, TBB, nullptr, Cond, DL);
158 BuildMI(&MBB, DL, get(BOpc)).addMBB(TBB);
161 get(BccOpc)).addReg(Cond[regPos].getReg()).addMBB(TBB);
166 BuildMI(&MBB, DL, get(BccOpc)).addReg(Cond[regPos].getReg()).addMBB(TBB);
167 BuildMI(&MBB, DL, get(BOpc)).addMBB(FBB);
173 bool HexagonInstrInfo::AnalyzeBranch(MachineBasicBlock &MBB,
174 MachineBasicBlock *&TBB,
175 MachineBasicBlock *&FBB,
176 SmallVectorImpl<MachineOperand> &Cond,
177 bool AllowModify) const {
181 // If the block has no terminators, it just falls into the block after it.
182 MachineBasicBlock::instr_iterator I = MBB.instr_end();
183 if (I == MBB.instr_begin())
186 // A basic block may looks like this:
196 // It has two succs but does not have a terminator
197 // Don't know how to handle it.
202 } while (I != MBB.instr_begin());
207 while (I->isDebugValue()) {
208 if (I == MBB.instr_begin())
213 bool JumpToBlock = I->getOpcode() == Hexagon::J2_jump &&
214 I->getOperand(0).isMBB();
215 // Delete the JMP if it's equivalent to a fall-through.
216 if (AllowModify && JumpToBlock &&
217 MBB.isLayoutSuccessor(I->getOperand(0).getMBB())) {
218 DEBUG(dbgs()<< "\nErasing the jump to successor block\n";);
219 I->eraseFromParent();
221 if (I == MBB.instr_begin())
225 if (!isUnpredicatedTerminator(I))
228 // Get the last instruction in the block.
229 MachineInstr *LastInst = I;
230 MachineInstr *SecondLastInst = nullptr;
231 // Find one more terminator if present.
233 if (&*I != LastInst && !I->isBundle() && isUnpredicatedTerminator(I)) {
237 // This is a third branch.
240 if (I == MBB.instr_begin())
245 int LastOpcode = LastInst->getOpcode();
246 int SecLastOpcode = SecondLastInst ? SecondLastInst->getOpcode() : 0;
247 // If the branch target is not a basic block, it could be a tail call.
248 // (It is, if the target is a function.)
249 if (LastOpcode == Hexagon::J2_jump && !LastInst->getOperand(0).isMBB())
251 if (SecLastOpcode == Hexagon::J2_jump &&
252 !SecondLastInst->getOperand(0).isMBB())
255 bool LastOpcodeHasJMP_c = PredOpcodeHasJMP_c(LastOpcode);
256 bool LastOpcodeHasNot = PredOpcodeHasNot(LastOpcode);
258 // If there is only one terminator instruction, process it.
259 if (LastInst && !SecondLastInst) {
260 if (LastOpcode == Hexagon::J2_jump) {
261 TBB = LastInst->getOperand(0).getMBB();
264 if (LastOpcode == Hexagon::ENDLOOP0) {
265 TBB = LastInst->getOperand(0).getMBB();
266 Cond.push_back(LastInst->getOperand(0));
269 if (LastOpcodeHasJMP_c) {
270 TBB = LastInst->getOperand(1).getMBB();
271 if (LastOpcodeHasNot) {
272 Cond.push_back(MachineOperand::CreateImm(0));
274 Cond.push_back(LastInst->getOperand(0));
277 // Otherwise, don't know what this is.
281 bool SecLastOpcodeHasJMP_c = PredOpcodeHasJMP_c(SecLastOpcode);
282 bool SecLastOpcodeHasNot = PredOpcodeHasNot(SecLastOpcode);
283 if (SecLastOpcodeHasJMP_c && (LastOpcode == Hexagon::J2_jump)) {
284 TBB = SecondLastInst->getOperand(1).getMBB();
285 if (SecLastOpcodeHasNot)
286 Cond.push_back(MachineOperand::CreateImm(0));
287 Cond.push_back(SecondLastInst->getOperand(0));
288 FBB = LastInst->getOperand(0).getMBB();
292 // If the block ends with two Hexagon:JMPs, handle it. The second one is not
293 // executed, so remove it.
294 if (SecLastOpcode == Hexagon::J2_jump && LastOpcode == Hexagon::J2_jump) {
295 TBB = SecondLastInst->getOperand(0).getMBB();
298 I->eraseFromParent();
302 // If the block ends with an ENDLOOP, and JMP, handle it.
303 if (SecLastOpcode == Hexagon::ENDLOOP0 &&
304 LastOpcode == Hexagon::J2_jump) {
305 TBB = SecondLastInst->getOperand(0).getMBB();
306 Cond.push_back(SecondLastInst->getOperand(0));
307 FBB = LastInst->getOperand(0).getMBB();
311 // Otherwise, can't handle this.
316 unsigned HexagonInstrInfo::RemoveBranch(MachineBasicBlock &MBB) const {
317 int BOpc = Hexagon::J2_jump;
318 int BccOpc = Hexagon::J2_jumpt;
319 int BccOpcNot = Hexagon::J2_jumpf;
321 MachineBasicBlock::iterator I = MBB.end();
322 if (I == MBB.begin()) return 0;
324 if (I->getOpcode() != BOpc && I->getOpcode() != BccOpc &&
325 I->getOpcode() != BccOpcNot)
328 // Remove the branch.
329 I->eraseFromParent();
333 if (I == MBB.begin()) return 1;
335 if (I->getOpcode() != BccOpc && I->getOpcode() != BccOpcNot)
338 // Remove the branch.
339 I->eraseFromParent();
344 /// \brief For a comparison instruction, return the source registers in
345 /// \p SrcReg and \p SrcReg2 if having two register operands, and the value it
346 /// compares against in CmpValue. Return true if the comparison instruction
348 bool HexagonInstrInfo::analyzeCompare(const MachineInstr *MI,
349 unsigned &SrcReg, unsigned &SrcReg2,
350 int &Mask, int &Value) const {
351 unsigned Opc = MI->getOpcode();
353 // Set mask and the first source register.
355 case Hexagon::C2_cmpeqp:
356 case Hexagon::C2_cmpeqi:
357 case Hexagon::C2_cmpeq:
358 case Hexagon::C2_cmpgtp:
359 case Hexagon::C2_cmpgtup:
360 case Hexagon::C2_cmpgtui:
361 case Hexagon::C2_cmpgtu:
362 case Hexagon::C2_cmpgti:
363 case Hexagon::C2_cmpgt:
364 SrcReg = MI->getOperand(1).getReg();
367 case Hexagon::A4_cmpbeqi:
368 case Hexagon::A4_cmpbeq:
369 case Hexagon::A4_cmpbgtui:
370 case Hexagon::A4_cmpbgtu:
371 case Hexagon::A4_cmpbgt:
372 SrcReg = MI->getOperand(1).getReg();
375 case Hexagon::A4_cmpheqi:
376 case Hexagon::A4_cmpheq:
377 case Hexagon::A4_cmphgtui:
378 case Hexagon::A4_cmphgtu:
379 case Hexagon::A4_cmphgt:
380 SrcReg = MI->getOperand(1).getReg();
385 // Set the value/second source register.
387 case Hexagon::C2_cmpeqp:
388 case Hexagon::C2_cmpeq:
389 case Hexagon::C2_cmpgtp:
390 case Hexagon::C2_cmpgtup:
391 case Hexagon::C2_cmpgtu:
392 case Hexagon::C2_cmpgt:
393 case Hexagon::A4_cmpbeq:
394 case Hexagon::A4_cmpbgtu:
395 case Hexagon::A4_cmpbgt:
396 case Hexagon::A4_cmpheq:
397 case Hexagon::A4_cmphgtu:
398 case Hexagon::A4_cmphgt:
399 SrcReg2 = MI->getOperand(2).getReg();
402 case Hexagon::C2_cmpeqi:
403 case Hexagon::C2_cmpgtui:
404 case Hexagon::C2_cmpgti:
405 case Hexagon::A4_cmpbeqi:
406 case Hexagon::A4_cmpbgtui:
407 case Hexagon::A4_cmpheqi:
408 case Hexagon::A4_cmphgtui:
410 Value = MI->getOperand(2).getImm();
418 void HexagonInstrInfo::copyPhysReg(MachineBasicBlock &MBB,
419 MachineBasicBlock::iterator I, DebugLoc DL,
420 unsigned DestReg, unsigned SrcReg,
421 bool KillSrc) const {
422 if (Hexagon::IntRegsRegClass.contains(SrcReg, DestReg)) {
423 BuildMI(MBB, I, DL, get(Hexagon::A2_tfr), DestReg).addReg(SrcReg);
426 if (Hexagon::DoubleRegsRegClass.contains(SrcReg, DestReg)) {
427 BuildMI(MBB, I, DL, get(Hexagon::A2_tfrp), DestReg).addReg(SrcReg);
430 if (Hexagon::PredRegsRegClass.contains(SrcReg, DestReg)) {
431 // Map Pd = Ps to Pd = or(Ps, Ps).
432 BuildMI(MBB, I, DL, get(Hexagon::C2_or),
433 DestReg).addReg(SrcReg).addReg(SrcReg);
436 if (Hexagon::DoubleRegsRegClass.contains(DestReg) &&
437 Hexagon::IntRegsRegClass.contains(SrcReg)) {
438 // We can have an overlap between single and double reg: r1:0 = r0.
439 if(SrcReg == RI.getSubReg(DestReg, Hexagon::subreg_loreg)) {
441 BuildMI(MBB, I, DL, get(Hexagon::A2_tfrsi), (RI.getSubReg(DestReg,
442 Hexagon::subreg_hireg))).addImm(0);
444 // r1:0 = r1 or no overlap.
445 BuildMI(MBB, I, DL, get(Hexagon::A2_tfr), (RI.getSubReg(DestReg,
446 Hexagon::subreg_loreg))).addReg(SrcReg);
447 BuildMI(MBB, I, DL, get(Hexagon::A2_tfrsi), (RI.getSubReg(DestReg,
448 Hexagon::subreg_hireg))).addImm(0);
452 if (Hexagon::CtrRegsRegClass.contains(DestReg) &&
453 Hexagon::IntRegsRegClass.contains(SrcReg)) {
454 BuildMI(MBB, I, DL, get(Hexagon::A2_tfrrcr), DestReg).addReg(SrcReg);
457 if (Hexagon::PredRegsRegClass.contains(SrcReg) &&
458 Hexagon::IntRegsRegClass.contains(DestReg)) {
459 BuildMI(MBB, I, DL, get(Hexagon::C2_tfrpr), DestReg).
460 addReg(SrcReg, getKillRegState(KillSrc));
463 if (Hexagon::IntRegsRegClass.contains(SrcReg) &&
464 Hexagon::PredRegsRegClass.contains(DestReg)) {
465 BuildMI(MBB, I, DL, get(Hexagon::C2_tfrrp), DestReg).
466 addReg(SrcReg, getKillRegState(KillSrc));
470 llvm_unreachable("Unimplemented");
474 void HexagonInstrInfo::
475 storeRegToStackSlot(MachineBasicBlock &MBB, MachineBasicBlock::iterator I,
476 unsigned SrcReg, bool isKill, int FI,
477 const TargetRegisterClass *RC,
478 const TargetRegisterInfo *TRI) const {
480 DebugLoc DL = MBB.findDebugLoc(I);
481 MachineFunction &MF = *MBB.getParent();
482 MachineFrameInfo &MFI = *MF.getFrameInfo();
483 unsigned Align = MFI.getObjectAlignment(FI);
485 MachineMemOperand *MMO =
486 MF.getMachineMemOperand(
487 MachinePointerInfo(PseudoSourceValue::getFixedStack(FI)),
488 MachineMemOperand::MOStore,
489 MFI.getObjectSize(FI),
492 if (Hexagon::IntRegsRegClass.hasSubClassEq(RC)) {
493 BuildMI(MBB, I, DL, get(Hexagon::S2_storeri_io))
494 .addFrameIndex(FI).addImm(0)
495 .addReg(SrcReg, getKillRegState(isKill)).addMemOperand(MMO);
496 } else if (Hexagon::DoubleRegsRegClass.hasSubClassEq(RC)) {
497 BuildMI(MBB, I, DL, get(Hexagon::S2_storerd_io))
498 .addFrameIndex(FI).addImm(0)
499 .addReg(SrcReg, getKillRegState(isKill)).addMemOperand(MMO);
500 } else if (Hexagon::PredRegsRegClass.hasSubClassEq(RC)) {
501 BuildMI(MBB, I, DL, get(Hexagon::STriw_pred))
502 .addFrameIndex(FI).addImm(0)
503 .addReg(SrcReg, getKillRegState(isKill)).addMemOperand(MMO);
505 llvm_unreachable("Unimplemented");
510 void HexagonInstrInfo::storeRegToAddr(
511 MachineFunction &MF, unsigned SrcReg,
513 SmallVectorImpl<MachineOperand> &Addr,
514 const TargetRegisterClass *RC,
515 SmallVectorImpl<MachineInstr*> &NewMIs) const
517 llvm_unreachable("Unimplemented");
521 void HexagonInstrInfo::
522 loadRegFromStackSlot(MachineBasicBlock &MBB, MachineBasicBlock::iterator I,
523 unsigned DestReg, int FI,
524 const TargetRegisterClass *RC,
525 const TargetRegisterInfo *TRI) const {
526 DebugLoc DL = MBB.findDebugLoc(I);
527 MachineFunction &MF = *MBB.getParent();
528 MachineFrameInfo &MFI = *MF.getFrameInfo();
529 unsigned Align = MFI.getObjectAlignment(FI);
531 MachineMemOperand *MMO =
532 MF.getMachineMemOperand(
533 MachinePointerInfo(PseudoSourceValue::getFixedStack(FI)),
534 MachineMemOperand::MOLoad,
535 MFI.getObjectSize(FI),
537 if (RC == &Hexagon::IntRegsRegClass) {
538 BuildMI(MBB, I, DL, get(Hexagon::L2_loadri_io), DestReg)
539 .addFrameIndex(FI).addImm(0).addMemOperand(MMO);
540 } else if (RC == &Hexagon::DoubleRegsRegClass) {
541 BuildMI(MBB, I, DL, get(Hexagon::L2_loadrd_io), DestReg)
542 .addFrameIndex(FI).addImm(0).addMemOperand(MMO);
543 } else if (RC == &Hexagon::PredRegsRegClass) {
544 BuildMI(MBB, I, DL, get(Hexagon::LDriw_pred), DestReg)
545 .addFrameIndex(FI).addImm(0).addMemOperand(MMO);
547 llvm_unreachable("Can't store this register to stack slot");
552 void HexagonInstrInfo::loadRegFromAddr(MachineFunction &MF, unsigned DestReg,
553 SmallVectorImpl<MachineOperand> &Addr,
554 const TargetRegisterClass *RC,
555 SmallVectorImpl<MachineInstr*> &NewMIs) const {
556 llvm_unreachable("Unimplemented");
559 HexagonInstrInfo::expandPostRAPseudo(MachineBasicBlock::iterator MI) const {
560 unsigned Opc = MI->getOpcode();
563 case Hexagon::TCRETURNi:
564 MI->setDesc(get(Hexagon::J2_jump));
566 case Hexagon::TCRETURNr:
567 MI->setDesc(get(Hexagon::J2_jumpr));
574 MachineInstr *HexagonInstrInfo::foldMemoryOperandImpl(MachineFunction &MF,
576 ArrayRef<unsigned> Ops,
578 // Hexagon_TODO: Implement.
582 unsigned HexagonInstrInfo::createVR(MachineFunction* MF, MVT VT) const {
584 MachineRegisterInfo &RegInfo = MF->getRegInfo();
585 const TargetRegisterClass *TRC;
587 TRC = &Hexagon::PredRegsRegClass;
588 } else if (VT == MVT::i32 || VT == MVT::f32) {
589 TRC = &Hexagon::IntRegsRegClass;
590 } else if (VT == MVT::i64 || VT == MVT::f64) {
591 TRC = &Hexagon::DoubleRegsRegClass;
593 llvm_unreachable("Cannot handle this register class");
596 unsigned NewReg = RegInfo.createVirtualRegister(TRC);
600 bool HexagonInstrInfo::isExtendable(const MachineInstr *MI) const {
601 const MCInstrDesc &MID = MI->getDesc();
602 const uint64_t F = MID.TSFlags;
603 if ((F >> HexagonII::ExtendablePos) & HexagonII::ExtendableMask)
606 // TODO: This is largely obsolete now. Will need to be removed
607 // in consecutive patches.
608 switch(MI->getOpcode()) {
609 // TFR_FI Remains a special case.
610 case Hexagon::TFR_FI:
618 // This returns true in two cases:
619 // - The OP code itself indicates that this is an extended instruction.
620 // - One of MOs has been marked with HMOTF_ConstExtended flag.
621 bool HexagonInstrInfo::isExtended(const MachineInstr *MI) const {
622 // First check if this is permanently extended op code.
623 const uint64_t F = MI->getDesc().TSFlags;
624 if ((F >> HexagonII::ExtendedPos) & HexagonII::ExtendedMask)
626 // Use MO operand flags to determine if one of MI's operands
627 // has HMOTF_ConstExtended flag set.
628 for (MachineInstr::const_mop_iterator I = MI->operands_begin(),
629 E = MI->operands_end(); I != E; ++I) {
630 if (I->getTargetFlags() && HexagonII::HMOTF_ConstExtended)
636 bool HexagonInstrInfo::isBranch (const MachineInstr *MI) const {
637 return MI->getDesc().isBranch();
640 bool HexagonInstrInfo::isNewValueInst(const MachineInstr *MI) const {
641 if (isNewValueJump(MI))
644 if (isNewValueStore(MI))
650 bool HexagonInstrInfo::isSaveCalleeSavedRegsCall(const MachineInstr *MI) const {
651 return MI->getOpcode() == Hexagon::SAVE_REGISTERS_CALL_V4;
654 bool HexagonInstrInfo::isPredicable(MachineInstr *MI) const {
655 bool isPred = MI->getDesc().isPredicable();
660 const int Opc = MI->getOpcode();
663 case Hexagon::A2_tfrsi:
664 return (isOperandExtended(MI, 1) && isConstExtended(MI)) || isInt<12>(MI->getOperand(1).getImm());
666 case Hexagon::S2_storerd_io:
667 return isShiftedUInt<6,3>(MI->getOperand(1).getImm());
669 case Hexagon::S2_storeri_io:
670 case Hexagon::S2_storerinew_io:
671 return isShiftedUInt<6,2>(MI->getOperand(1).getImm());
673 case Hexagon::S2_storerh_io:
674 case Hexagon::S2_storerhnew_io:
675 return isShiftedUInt<6,1>(MI->getOperand(1).getImm());
677 case Hexagon::S2_storerb_io:
678 case Hexagon::S2_storerbnew_io:
679 return isUInt<6>(MI->getOperand(1).getImm());
681 case Hexagon::L2_loadrd_io:
682 return isShiftedUInt<6,3>(MI->getOperand(2).getImm());
684 case Hexagon::L2_loadri_io:
685 return isShiftedUInt<6,2>(MI->getOperand(2).getImm());
687 case Hexagon::L2_loadrh_io:
688 case Hexagon::L2_loadruh_io:
689 return isShiftedUInt<6,1>(MI->getOperand(2).getImm());
691 case Hexagon::L2_loadrb_io:
692 case Hexagon::L2_loadrub_io:
693 return isUInt<6>(MI->getOperand(2).getImm());
695 case Hexagon::L2_loadrd_pi:
696 return isShiftedInt<4,3>(MI->getOperand(3).getImm());
698 case Hexagon::L2_loadri_pi:
699 return isShiftedInt<4,2>(MI->getOperand(3).getImm());
701 case Hexagon::L2_loadrh_pi:
702 case Hexagon::L2_loadruh_pi:
703 return isShiftedInt<4,1>(MI->getOperand(3).getImm());
705 case Hexagon::L2_loadrb_pi:
706 case Hexagon::L2_loadrub_pi:
707 return isInt<4>(MI->getOperand(3).getImm());
709 case Hexagon::S4_storeirb_io:
710 case Hexagon::S4_storeirh_io:
711 case Hexagon::S4_storeiri_io:
712 return (isUInt<6>(MI->getOperand(1).getImm()) &&
713 isInt<6>(MI->getOperand(2).getImm()));
715 case Hexagon::A2_addi:
716 return isInt<8>(MI->getOperand(2).getImm());
718 case Hexagon::A2_aslh:
719 case Hexagon::A2_asrh:
720 case Hexagon::A2_sxtb:
721 case Hexagon::A2_sxth:
722 case Hexagon::A2_zxtb:
723 case Hexagon::A2_zxth:
730 // This function performs the following inversiones:
735 unsigned HexagonInstrInfo::getInvertedPredicatedOpcode(const int Opc) const {
737 InvPredOpcode = isPredicatedTrue(Opc) ? Hexagon::getFalsePredOpcode(Opc)
738 : Hexagon::getTruePredOpcode(Opc);
739 if (InvPredOpcode >= 0) // Valid instruction with the inverted predicate.
740 return InvPredOpcode;
743 default: llvm_unreachable("Unexpected predicated instruction");
744 case Hexagon::C2_ccombinewt:
745 return Hexagon::C2_ccombinewf;
746 case Hexagon::C2_ccombinewf:
747 return Hexagon::C2_ccombinewt;
750 case Hexagon::L4_return_t:
751 return Hexagon::L4_return_f;
752 case Hexagon::L4_return_f:
753 return Hexagon::L4_return_t;
757 // New Value Store instructions.
758 bool HexagonInstrInfo::isNewValueStore(const MachineInstr *MI) const {
759 const uint64_t F = MI->getDesc().TSFlags;
761 return ((F >> HexagonII::NVStorePos) & HexagonII::NVStoreMask);
764 bool HexagonInstrInfo::isNewValueStore(unsigned Opcode) const {
765 const uint64_t F = get(Opcode).TSFlags;
767 return ((F >> HexagonII::NVStorePos) & HexagonII::NVStoreMask);
770 int HexagonInstrInfo::
771 getMatchingCondBranchOpcode(int Opc, bool invertPredicate) const {
772 enum Hexagon::PredSense inPredSense;
773 inPredSense = invertPredicate ? Hexagon::PredSense_false :
774 Hexagon::PredSense_true;
775 int CondOpcode = Hexagon::getPredOpcode(Opc, inPredSense);
776 if (CondOpcode >= 0) // Valid Conditional opcode/instruction
779 // This switch case will be removed once all the instructions have been
780 // modified to use relation maps.
782 case Hexagon::TFRI_f:
783 return !invertPredicate ? Hexagon::TFRI_cPt_f :
784 Hexagon::TFRI_cNotPt_f;
785 case Hexagon::A2_combinew:
786 return !invertPredicate ? Hexagon::C2_ccombinewt :
787 Hexagon::C2_ccombinewf;
790 case Hexagon::L4_return:
791 return !invertPredicate ? Hexagon::L4_return_t:
792 Hexagon::L4_return_f;
794 llvm_unreachable("Unexpected predicable instruction");
798 bool HexagonInstrInfo::
799 PredicateInstruction(MachineInstr *MI,
800 const SmallVectorImpl<MachineOperand> &Cond) const {
801 int Opc = MI->getOpcode();
802 assert (isPredicable(MI) && "Expected predicable instruction");
803 bool invertJump = (!Cond.empty() && Cond[0].isImm() &&
804 (Cond[0].getImm() == 0));
806 // This will change MI's opcode to its predicate version.
807 // However, its operand list is still the old one, i.e. the
808 // non-predicate one.
809 MI->setDesc(get(getMatchingCondBranchOpcode(Opc, invertJump)));
812 unsigned int GAIdx = 0;
814 // Indicates whether the current MI has a GlobalAddress operand
815 bool hasGAOpnd = false;
816 std::vector<MachineOperand> tmpOpnds;
818 // Indicates whether we need to shift operands to right.
819 bool needShift = true;
821 // The predicate is ALWAYS the FIRST input operand !!!
822 if (MI->getNumOperands() == 0) {
823 // The non-predicate version of MI does not take any operands,
824 // i.e. no outs and no ins. In this condition, the predicate
825 // operand will be directly placed at Operands[0]. No operand
831 else if ( MI->getOperand(MI->getNumOperands()-1).isReg()
832 && MI->getOperand(MI->getNumOperands()-1).isDef()
833 && !MI->getOperand(MI->getNumOperands()-1).isImplicit()) {
834 // The non-predicate version of MI does not have any input operands.
835 // In this condition, we extend the length of Operands[] by one and
836 // copy the original last operand to the newly allocated slot.
837 // At this moment, it is just a place holder. Later, we will put
838 // predicate operand directly into it. No operand shift is needed.
839 // Example: r0=BARRIER (this is a faked insn used here for illustration)
840 MI->addOperand(MI->getOperand(MI->getNumOperands()-1));
842 oper = MI->getNumOperands() - 2;
845 // We need to right shift all input operands by one. Duplicate the
846 // last operand into the newly allocated slot.
847 MI->addOperand(MI->getOperand(MI->getNumOperands()-1));
852 // Operands[ MI->getNumOperands() - 2 ] has been copied into
853 // Operands[ MI->getNumOperands() - 1 ], so we start from
854 // Operands[ MI->getNumOperands() - 3 ].
855 // oper is a signed int.
856 // It is ok if "MI->getNumOperands()-3" is -3, -2, or -1.
857 for (oper = MI->getNumOperands() - 3; oper >= 0; --oper)
859 MachineOperand &MO = MI->getOperand(oper);
861 // Opnd[0] Opnd[1] Opnd[2] Opnd[3] Opnd[4] Opnd[5] Opnd[6] Opnd[7]
862 // <Def0> <Def1> <Use0> <Use1> <ImpDef0> <ImpDef1> <ImpUse0> <ImpUse1>
866 // Predicate Operand here
867 if (MO.isReg() && !MO.isUse() && !MO.isImplicit()) {
871 MI->getOperand(oper+1).ChangeToRegister(MO.getReg(), MO.isDef(),
872 MO.isImplicit(), MO.isKill(),
873 MO.isDead(), MO.isUndef(),
876 else if (MO.isImm()) {
877 MI->getOperand(oper+1).ChangeToImmediate(MO.getImm());
879 else if (MO.isGlobal()) {
880 // MI can not have more than one GlobalAddress operand.
881 assert(hasGAOpnd == false && "MI can only have one GlobalAddress opnd");
883 // There is no member function called "ChangeToGlobalAddress" in the
884 // MachineOperand class (not like "ChangeToRegister" and
885 // "ChangeToImmediate"). So we have to remove them from Operands[] list
886 // first, and then add them back after we have inserted the predicate
887 // operand. tmpOpnds[] is to remember these operands before we remove
889 tmpOpnds.push_back(MO);
891 // Operands[oper] is a GlobalAddress operand;
892 // Operands[oper+1] has been copied into Operands[oper+2];
898 llvm_unreachable("Unexpected operand type");
903 int regPos = invertJump ? 1 : 0;
904 MachineOperand PredMO = Cond[regPos];
906 // [oper] now points to the last explicit Def. Predicate operand must be
907 // located at [oper+1]. See diagram above.
908 // This assumes that the predicate is always the first operand,
909 // i.e. Operands[0+numResults], in the set of inputs
910 // It is better to have an assert here to check this. But I don't know how
911 // to write this assert because findFirstPredOperandIdx() would return -1
912 if (oper < -1) oper = -1;
914 MI->getOperand(oper+1).ChangeToRegister(PredMO.getReg(), PredMO.isDef(),
915 PredMO.isImplicit(), false,
916 PredMO.isDead(), PredMO.isUndef(),
919 MachineRegisterInfo &RegInfo = MI->getParent()->getParent()->getRegInfo();
920 RegInfo.clearKillFlags(PredMO.getReg());
926 // Operands[GAIdx] is the original GlobalAddress operand, which is
927 // already copied into tmpOpnds[0].
928 // Operands[GAIdx] now stores a copy of Operands[GAIdx-1]
929 // Operands[GAIdx+1] has already been copied into Operands[GAIdx+2],
930 // so we start from [GAIdx+2]
931 for (i = GAIdx + 2; i < MI->getNumOperands(); ++i)
932 tmpOpnds.push_back(MI->getOperand(i));
934 // Remove all operands in range [ (GAIdx+1) ... (MI->getNumOperands()-1) ]
935 // It is very important that we always remove from the end of Operands[]
936 // MI->getNumOperands() is at least 2 if program goes to here.
937 for (i = MI->getNumOperands() - 1; i > GAIdx; --i)
938 MI->RemoveOperand(i);
940 for (i = 0; i < tmpOpnds.size(); ++i)
941 MI->addOperand(tmpOpnds[i]);
950 isProfitableToIfCvt(MachineBasicBlock &MBB,
952 unsigned ExtraPredCycles,
953 const BranchProbability &Probability) const {
960 isProfitableToIfCvt(MachineBasicBlock &TMBB,
962 unsigned ExtraTCycles,
963 MachineBasicBlock &FMBB,
965 unsigned ExtraFCycles,
966 const BranchProbability &Probability) const {
970 // Returns true if an instruction is predicated irrespective of the predicate
971 // sense. For example, all of the following will return true.
972 // if (p0) R1 = add(R2, R3)
973 // if (!p0) R1 = add(R2, R3)
974 // if (p0.new) R1 = add(R2, R3)
975 // if (!p0.new) R1 = add(R2, R3)
976 bool HexagonInstrInfo::isPredicated(const MachineInstr *MI) const {
977 const uint64_t F = MI->getDesc().TSFlags;
979 return ((F >> HexagonII::PredicatedPos) & HexagonII::PredicatedMask);
982 bool HexagonInstrInfo::isPredicated(unsigned Opcode) const {
983 const uint64_t F = get(Opcode).TSFlags;
985 return ((F >> HexagonII::PredicatedPos) & HexagonII::PredicatedMask);
988 bool HexagonInstrInfo::isPredicatedTrue(const MachineInstr *MI) const {
989 const uint64_t F = MI->getDesc().TSFlags;
991 assert(isPredicated(MI));
992 return (!((F >> HexagonII::PredicatedFalsePos) &
993 HexagonII::PredicatedFalseMask));
996 bool HexagonInstrInfo::isPredicatedTrue(unsigned Opcode) const {
997 const uint64_t F = get(Opcode).TSFlags;
999 // Make sure that the instruction is predicated.
1000 assert((F>> HexagonII::PredicatedPos) & HexagonII::PredicatedMask);
1001 return (!((F >> HexagonII::PredicatedFalsePos) &
1002 HexagonII::PredicatedFalseMask));
1005 bool HexagonInstrInfo::isPredicatedNew(const MachineInstr *MI) const {
1006 const uint64_t F = MI->getDesc().TSFlags;
1008 assert(isPredicated(MI));
1009 return ((F >> HexagonII::PredicatedNewPos) & HexagonII::PredicatedNewMask);
1012 bool HexagonInstrInfo::isPredicatedNew(unsigned Opcode) const {
1013 const uint64_t F = get(Opcode).TSFlags;
1015 assert(isPredicated(Opcode));
1016 return ((F >> HexagonII::PredicatedNewPos) & HexagonII::PredicatedNewMask);
1019 // Returns true, if a ST insn can be promoted to a new-value store.
1020 bool HexagonInstrInfo::mayBeNewStore(const MachineInstr *MI) const {
1021 const uint64_t F = MI->getDesc().TSFlags;
1023 return ((F >> HexagonII::mayNVStorePos) &
1024 HexagonII::mayNVStoreMask);
1028 HexagonInstrInfo::DefinesPredicate(MachineInstr *MI,
1029 std::vector<MachineOperand> &Pred) const {
1030 for (unsigned oper = 0; oper < MI->getNumOperands(); ++oper) {
1031 MachineOperand MO = MI->getOperand(oper);
1032 if (MO.isReg() && MO.isDef()) {
1033 const TargetRegisterClass* RC = RI.getMinimalPhysRegClass(MO.getReg());
1034 if (RC == &Hexagon::PredRegsRegClass) {
1046 SubsumesPredicate(const SmallVectorImpl<MachineOperand> &Pred1,
1047 const SmallVectorImpl<MachineOperand> &Pred2) const {
1054 // We indicate that we want to reverse the branch by
1055 // inserting a 0 at the beginning of the Cond vector.
1057 bool HexagonInstrInfo::
1058 ReverseBranchCondition(SmallVectorImpl<MachineOperand> &Cond) const {
1059 if (!Cond.empty() && Cond[0].isImm() && Cond[0].getImm() == 0) {
1060 Cond.erase(Cond.begin());
1062 Cond.insert(Cond.begin(), MachineOperand::CreateImm(0));
1068 bool HexagonInstrInfo::
1069 isProfitableToDupForIfCvt(MachineBasicBlock &MBB,unsigned NumInstrs,
1070 const BranchProbability &Probability) const {
1071 return (NumInstrs <= 4);
1074 bool HexagonInstrInfo::isDeallocRet(const MachineInstr *MI) const {
1075 switch (MI->getOpcode()) {
1076 default: return false;
1077 case Hexagon::L4_return:
1078 case Hexagon::L4_return_t:
1079 case Hexagon::L4_return_f:
1080 case Hexagon::L4_return_tnew_pnt:
1081 case Hexagon::L4_return_fnew_pnt:
1082 case Hexagon::L4_return_tnew_pt:
1083 case Hexagon::L4_return_fnew_pt:
1089 bool HexagonInstrInfo::
1090 isValidOffset(const int Opcode, const int Offset) const {
1091 // This function is to check whether the "Offset" is in the correct range of
1092 // the given "Opcode". If "Offset" is not in the correct range, "ADD_ri" is
1093 // inserted to calculate the final address. Due to this reason, the function
1094 // assumes that the "Offset" has correct alignment.
1095 // We used to assert if the offset was not properly aligned, however,
1096 // there are cases where a misaligned pointer recast can cause this
1097 // problem, and we need to allow for it. The front end warns of such
1098 // misaligns with respect to load size.
1102 case Hexagon::L2_loadri_io:
1103 case Hexagon::S2_storeri_io:
1104 return (Offset >= Hexagon_MEMW_OFFSET_MIN) &&
1105 (Offset <= Hexagon_MEMW_OFFSET_MAX);
1107 case Hexagon::L2_loadrd_io:
1108 case Hexagon::S2_storerd_io:
1109 return (Offset >= Hexagon_MEMD_OFFSET_MIN) &&
1110 (Offset <= Hexagon_MEMD_OFFSET_MAX);
1112 case Hexagon::L2_loadrh_io:
1113 case Hexagon::L2_loadruh_io:
1114 case Hexagon::S2_storerh_io:
1115 return (Offset >= Hexagon_MEMH_OFFSET_MIN) &&
1116 (Offset <= Hexagon_MEMH_OFFSET_MAX);
1118 case Hexagon::L2_loadrb_io:
1119 case Hexagon::S2_storerb_io:
1120 case Hexagon::L2_loadrub_io:
1121 return (Offset >= Hexagon_MEMB_OFFSET_MIN) &&
1122 (Offset <= Hexagon_MEMB_OFFSET_MAX);
1124 case Hexagon::A2_addi:
1125 case Hexagon::TFR_FI:
1126 return (Offset >= Hexagon_ADDI_OFFSET_MIN) &&
1127 (Offset <= Hexagon_ADDI_OFFSET_MAX);
1129 case Hexagon::L4_iadd_memopw_io:
1130 case Hexagon::L4_isub_memopw_io:
1131 case Hexagon::L4_add_memopw_io:
1132 case Hexagon::L4_sub_memopw_io:
1133 case Hexagon::L4_and_memopw_io:
1134 case Hexagon::L4_or_memopw_io:
1135 return (0 <= Offset && Offset <= 255);
1137 case Hexagon::L4_iadd_memoph_io:
1138 case Hexagon::L4_isub_memoph_io:
1139 case Hexagon::L4_add_memoph_io:
1140 case Hexagon::L4_sub_memoph_io:
1141 case Hexagon::L4_and_memoph_io:
1142 case Hexagon::L4_or_memoph_io:
1143 return (0 <= Offset && Offset <= 127);
1145 case Hexagon::L4_iadd_memopb_io:
1146 case Hexagon::L4_isub_memopb_io:
1147 case Hexagon::L4_add_memopb_io:
1148 case Hexagon::L4_sub_memopb_io:
1149 case Hexagon::L4_and_memopb_io:
1150 case Hexagon::L4_or_memopb_io:
1151 return (0 <= Offset && Offset <= 63);
1153 // LDri_pred and STriw_pred are pseudo operations, so it has to take offset of
1154 // any size. Later pass knows how to handle it.
1155 case Hexagon::STriw_pred:
1156 case Hexagon::LDriw_pred:
1159 case Hexagon::J2_loop0i:
1160 return isUInt<10>(Offset);
1162 // INLINEASM is very special.
1163 case Hexagon::INLINEASM:
1167 llvm_unreachable("No offset range is defined for this opcode. "
1168 "Please define it in the above switch statement!");
1173 // Check if the Offset is a valid auto-inc imm by Load/Store Type.
1175 bool HexagonInstrInfo::
1176 isValidAutoIncImm(const EVT VT, const int Offset) const {
1178 if (VT == MVT::i64) {
1179 return (Offset >= Hexagon_MEMD_AUTOINC_MIN &&
1180 Offset <= Hexagon_MEMD_AUTOINC_MAX &&
1181 (Offset & 0x7) == 0);
1183 if (VT == MVT::i32) {
1184 return (Offset >= Hexagon_MEMW_AUTOINC_MIN &&
1185 Offset <= Hexagon_MEMW_AUTOINC_MAX &&
1186 (Offset & 0x3) == 0);
1188 if (VT == MVT::i16) {
1189 return (Offset >= Hexagon_MEMH_AUTOINC_MIN &&
1190 Offset <= Hexagon_MEMH_AUTOINC_MAX &&
1191 (Offset & 0x1) == 0);
1193 if (VT == MVT::i8) {
1194 return (Offset >= Hexagon_MEMB_AUTOINC_MIN &&
1195 Offset <= Hexagon_MEMB_AUTOINC_MAX);
1197 llvm_unreachable("Not an auto-inc opc!");
1201 bool HexagonInstrInfo::
1202 isMemOp(const MachineInstr *MI) const {
1203 // return MI->getDesc().mayLoad() && MI->getDesc().mayStore();
1205 switch (MI->getOpcode())
1207 default: return false;
1208 case Hexagon::L4_iadd_memopw_io:
1209 case Hexagon::L4_isub_memopw_io:
1210 case Hexagon::L4_add_memopw_io:
1211 case Hexagon::L4_sub_memopw_io:
1212 case Hexagon::L4_and_memopw_io:
1213 case Hexagon::L4_or_memopw_io:
1214 case Hexagon::L4_iadd_memoph_io:
1215 case Hexagon::L4_isub_memoph_io:
1216 case Hexagon::L4_add_memoph_io:
1217 case Hexagon::L4_sub_memoph_io:
1218 case Hexagon::L4_and_memoph_io:
1219 case Hexagon::L4_or_memoph_io:
1220 case Hexagon::L4_iadd_memopb_io:
1221 case Hexagon::L4_isub_memopb_io:
1222 case Hexagon::L4_add_memopb_io:
1223 case Hexagon::L4_sub_memopb_io:
1224 case Hexagon::L4_and_memopb_io:
1225 case Hexagon::L4_or_memopb_io:
1226 case Hexagon::L4_ior_memopb_io:
1227 case Hexagon::L4_ior_memoph_io:
1228 case Hexagon::L4_ior_memopw_io:
1229 case Hexagon::L4_iand_memopb_io:
1230 case Hexagon::L4_iand_memoph_io:
1231 case Hexagon::L4_iand_memopw_io:
1238 bool HexagonInstrInfo::
1239 isSpillPredRegOp(const MachineInstr *MI) const {
1240 switch (MI->getOpcode()) {
1241 default: return false;
1242 case Hexagon::STriw_pred :
1243 case Hexagon::LDriw_pred :
1248 bool HexagonInstrInfo::isNewValueJumpCandidate(const MachineInstr *MI) const {
1249 switch (MI->getOpcode()) {
1250 default: return false;
1251 case Hexagon::C2_cmpeq:
1252 case Hexagon::C2_cmpeqi:
1253 case Hexagon::C2_cmpgt:
1254 case Hexagon::C2_cmpgti:
1255 case Hexagon::C2_cmpgtu:
1256 case Hexagon::C2_cmpgtui:
1261 bool HexagonInstrInfo::
1262 isConditionalTransfer (const MachineInstr *MI) const {
1263 switch (MI->getOpcode()) {
1264 default: return false;
1265 case Hexagon::A2_tfrt:
1266 case Hexagon::A2_tfrf:
1267 case Hexagon::C2_cmoveit:
1268 case Hexagon::C2_cmoveif:
1269 case Hexagon::A2_tfrtnew:
1270 case Hexagon::A2_tfrfnew:
1271 case Hexagon::C2_cmovenewit:
1272 case Hexagon::C2_cmovenewif:
1277 bool HexagonInstrInfo::isConditionalALU32 (const MachineInstr* MI) const {
1278 switch (MI->getOpcode())
1280 default: return false;
1281 case Hexagon::A2_paddf:
1282 case Hexagon::A2_paddfnew:
1283 case Hexagon::A2_paddt:
1284 case Hexagon::A2_paddtnew:
1285 case Hexagon::A2_pandf:
1286 case Hexagon::A2_pandfnew:
1287 case Hexagon::A2_pandt:
1288 case Hexagon::A2_pandtnew:
1289 case Hexagon::A4_paslhf:
1290 case Hexagon::A4_paslhfnew:
1291 case Hexagon::A4_paslht:
1292 case Hexagon::A4_paslhtnew:
1293 case Hexagon::A4_pasrhf:
1294 case Hexagon::A4_pasrhfnew:
1295 case Hexagon::A4_pasrht:
1296 case Hexagon::A4_pasrhtnew:
1297 case Hexagon::A2_porf:
1298 case Hexagon::A2_porfnew:
1299 case Hexagon::A2_port:
1300 case Hexagon::A2_portnew:
1301 case Hexagon::A2_psubf:
1302 case Hexagon::A2_psubfnew:
1303 case Hexagon::A2_psubt:
1304 case Hexagon::A2_psubtnew:
1305 case Hexagon::A2_pxorf:
1306 case Hexagon::A2_pxorfnew:
1307 case Hexagon::A2_pxort:
1308 case Hexagon::A2_pxortnew:
1309 case Hexagon::A4_psxthf:
1310 case Hexagon::A4_psxthfnew:
1311 case Hexagon::A4_psxtht:
1312 case Hexagon::A4_psxthtnew:
1313 case Hexagon::A4_psxtbf:
1314 case Hexagon::A4_psxtbfnew:
1315 case Hexagon::A4_psxtbt:
1316 case Hexagon::A4_psxtbtnew:
1317 case Hexagon::A4_pzxtbf:
1318 case Hexagon::A4_pzxtbfnew:
1319 case Hexagon::A4_pzxtbt:
1320 case Hexagon::A4_pzxtbtnew:
1321 case Hexagon::A4_pzxthf:
1322 case Hexagon::A4_pzxthfnew:
1323 case Hexagon::A4_pzxtht:
1324 case Hexagon::A4_pzxthtnew:
1325 case Hexagon::A2_paddit:
1326 case Hexagon::A2_paddif:
1327 case Hexagon::C2_ccombinewt:
1328 case Hexagon::C2_ccombinewf:
1333 bool HexagonInstrInfo::
1334 isConditionalLoad (const MachineInstr* MI) const {
1335 switch (MI->getOpcode())
1337 default: return false;
1338 case Hexagon::L2_ploadrdt_io :
1339 case Hexagon::L2_ploadrdf_io:
1340 case Hexagon::L2_ploadrit_io:
1341 case Hexagon::L2_ploadrif_io:
1342 case Hexagon::L2_ploadrht_io:
1343 case Hexagon::L2_ploadrhf_io:
1344 case Hexagon::L2_ploadrbt_io:
1345 case Hexagon::L2_ploadrbf_io:
1346 case Hexagon::L2_ploadruht_io:
1347 case Hexagon::L2_ploadruhf_io:
1348 case Hexagon::L2_ploadrubt_io:
1349 case Hexagon::L2_ploadrubf_io:
1350 case Hexagon::L2_ploadrdt_pi:
1351 case Hexagon::L2_ploadrdf_pi:
1352 case Hexagon::L2_ploadrit_pi:
1353 case Hexagon::L2_ploadrif_pi:
1354 case Hexagon::L2_ploadrht_pi:
1355 case Hexagon::L2_ploadrhf_pi:
1356 case Hexagon::L2_ploadrbt_pi:
1357 case Hexagon::L2_ploadrbf_pi:
1358 case Hexagon::L2_ploadruht_pi:
1359 case Hexagon::L2_ploadruhf_pi:
1360 case Hexagon::L2_ploadrubt_pi:
1361 case Hexagon::L2_ploadrubf_pi:
1362 case Hexagon::L4_ploadrdt_rr:
1363 case Hexagon::L4_ploadrdf_rr:
1364 case Hexagon::L4_ploadrbt_rr:
1365 case Hexagon::L4_ploadrbf_rr:
1366 case Hexagon::L4_ploadrubt_rr:
1367 case Hexagon::L4_ploadrubf_rr:
1368 case Hexagon::L4_ploadrht_rr:
1369 case Hexagon::L4_ploadrhf_rr:
1370 case Hexagon::L4_ploadruht_rr:
1371 case Hexagon::L4_ploadruhf_rr:
1372 case Hexagon::L4_ploadrit_rr:
1373 case Hexagon::L4_ploadrif_rr:
1378 // Returns true if an instruction is a conditional store.
1380 // Note: It doesn't include conditional new-value stores as they can't be
1381 // converted to .new predicate.
1383 // p.new NV store [ if(p0.new)memw(R0+#0)=R2.new ]
1385 // / \ (not OK. it will cause new-value store to be
1386 // / X conditional on p0.new while R2 producer is
1389 // p.new store p.old NV store
1390 // [if(p0.new)memw(R0+#0)=R2] [if(p0)memw(R0+#0)=R2.new]
1396 // [if (p0)memw(R0+#0)=R2]
1398 // The above diagram shows the steps involoved in the conversion of a predicated
1399 // store instruction to its .new predicated new-value form.
1401 // The following set of instructions further explains the scenario where
1402 // conditional new-value store becomes invalid when promoted to .new predicate
1405 // { 1) if (p0) r0 = add(r1, r2)
1406 // 2) p0 = cmp.eq(r3, #0) }
1408 // 3) if (p0) memb(r1+#0) = r0 --> this instruction can't be grouped with
1409 // the first two instructions because in instr 1, r0 is conditional on old value
1410 // of p0 but its use in instr 3 is conditional on p0 modified by instr 2 which
1411 // is not valid for new-value stores.
1412 bool HexagonInstrInfo::
1413 isConditionalStore (const MachineInstr* MI) const {
1414 switch (MI->getOpcode())
1416 default: return false;
1417 case Hexagon::S4_storeirbt_io:
1418 case Hexagon::S4_storeirbf_io:
1419 case Hexagon::S4_pstorerbt_rr:
1420 case Hexagon::S4_pstorerbf_rr:
1421 case Hexagon::S2_pstorerbt_io:
1422 case Hexagon::S2_pstorerbf_io:
1423 case Hexagon::S2_pstorerbt_pi:
1424 case Hexagon::S2_pstorerbf_pi:
1425 case Hexagon::S2_pstorerdt_io:
1426 case Hexagon::S2_pstorerdf_io:
1427 case Hexagon::S4_pstorerdt_rr:
1428 case Hexagon::S4_pstorerdf_rr:
1429 case Hexagon::S2_pstorerdt_pi:
1430 case Hexagon::S2_pstorerdf_pi:
1431 case Hexagon::S2_pstorerht_io:
1432 case Hexagon::S2_pstorerhf_io:
1433 case Hexagon::S4_storeirht_io:
1434 case Hexagon::S4_storeirhf_io:
1435 case Hexagon::S4_pstorerht_rr:
1436 case Hexagon::S4_pstorerhf_rr:
1437 case Hexagon::S2_pstorerht_pi:
1438 case Hexagon::S2_pstorerhf_pi:
1439 case Hexagon::S2_pstorerit_io:
1440 case Hexagon::S2_pstorerif_io:
1441 case Hexagon::S4_storeirit_io:
1442 case Hexagon::S4_storeirif_io:
1443 case Hexagon::S4_pstorerit_rr:
1444 case Hexagon::S4_pstorerif_rr:
1445 case Hexagon::S2_pstorerit_pi:
1446 case Hexagon::S2_pstorerif_pi:
1448 // V4 global address store before promoting to dot new.
1449 case Hexagon::S4_pstorerdt_abs:
1450 case Hexagon::S4_pstorerdf_abs:
1451 case Hexagon::S4_pstorerbt_abs:
1452 case Hexagon::S4_pstorerbf_abs:
1453 case Hexagon::S4_pstorerht_abs:
1454 case Hexagon::S4_pstorerhf_abs:
1455 case Hexagon::S4_pstorerit_abs:
1456 case Hexagon::S4_pstorerif_abs:
1459 // Predicated new value stores (i.e. if (p0) memw(..)=r0.new) are excluded
1460 // from the "Conditional Store" list. Because a predicated new value store
1461 // would NOT be promoted to a double dot new store. See diagram below:
1462 // This function returns yes for those stores that are predicated but not
1463 // yet promoted to predicate dot new instructions.
1465 // +---------------------+
1466 // /-----| if (p0) memw(..)=r0 |---------\~
1467 // || +---------------------+ ||
1468 // promote || /\ /\ || promote
1470 // \||/ demote || \||/
1472 // +-------------------------+ || +-------------------------+
1473 // | if (p0.new) memw(..)=r0 | || | if (p0) memw(..)=r0.new |
1474 // +-------------------------+ || +-------------------------+
1477 // promote || \/ NOT possible
1481 // +-----------------------------+
1482 // | if (p0.new) memw(..)=r0.new |
1483 // +-----------------------------+
1484 // Double Dot New Store
1490 bool HexagonInstrInfo::isNewValueJump(const MachineInstr *MI) const {
1491 if (isNewValue(MI) && isBranch(MI))
1496 bool HexagonInstrInfo::isPostIncrement (const MachineInstr* MI) const {
1497 return (getAddrMode(MI) == HexagonII::PostInc);
1500 bool HexagonInstrInfo::isNewValue(const MachineInstr* MI) const {
1501 const uint64_t F = MI->getDesc().TSFlags;
1502 return ((F >> HexagonII::NewValuePos) & HexagonII::NewValueMask);
1505 // Returns true, if any one of the operands is a dot new
1506 // insn, whether it is predicated dot new or register dot new.
1507 bool HexagonInstrInfo::isDotNewInst (const MachineInstr* MI) const {
1508 return (isNewValueInst(MI) ||
1509 (isPredicated(MI) && isPredicatedNew(MI)));
1512 // Returns the most basic instruction for the .new predicated instructions and
1513 // new-value stores.
1514 // For example, all of the following instructions will be converted back to the
1515 // same instruction:
1516 // 1) if (p0.new) memw(R0+#0) = R1.new --->
1517 // 2) if (p0) memw(R0+#0)= R1.new -------> if (p0) memw(R0+#0) = R1
1518 // 3) if (p0.new) memw(R0+#0) = R1 --->
1521 int HexagonInstrInfo::GetDotOldOp(const int opc) const {
1523 if (isPredicated(NewOp) && isPredicatedNew(NewOp)) { // Get predicate old form
1524 NewOp = Hexagon::getPredOldOpcode(NewOp);
1525 assert(NewOp >= 0 &&
1526 "Couldn't change predicate new instruction to its old form.");
1529 if (isNewValueStore(NewOp)) { // Convert into non-new-value format
1530 NewOp = Hexagon::getNonNVStore(NewOp);
1531 assert(NewOp >= 0 && "Couldn't change new-value store to its old form.");
1536 // Return the new value instruction for a given store.
1537 int HexagonInstrInfo::GetDotNewOp(const MachineInstr* MI) const {
1538 int NVOpcode = Hexagon::getNewValueOpcode(MI->getOpcode());
1539 if (NVOpcode >= 0) // Valid new-value store instruction.
1542 switch (MI->getOpcode()) {
1543 default: llvm_unreachable("Unknown .new type");
1544 // store new value byte
1545 case Hexagon::S4_storerb_ur:
1546 return Hexagon::S4_storerbnew_ur;
1548 case Hexagon::S4_storerh_ur:
1549 return Hexagon::S4_storerhnew_ur;
1551 case Hexagon::S4_storeri_ur:
1552 return Hexagon::S4_storerinew_ur;
1558 // Return .new predicate version for an instruction.
1559 int HexagonInstrInfo::GetDotNewPredOp(MachineInstr *MI,
1560 const MachineBranchProbabilityInfo
1563 int NewOpcode = Hexagon::getPredNewOpcode(MI->getOpcode());
1564 if (NewOpcode >= 0) // Valid predicate new instruction
1567 switch (MI->getOpcode()) {
1568 default: llvm_unreachable("Unknown .new type");
1570 case Hexagon::J2_jumpt:
1571 case Hexagon::J2_jumpf:
1572 return getDotNewPredJumpOp(MI, MBPI);
1574 case Hexagon::J2_jumprt:
1575 return Hexagon::J2_jumptnewpt;
1577 case Hexagon::J2_jumprf:
1578 return Hexagon::J2_jumprfnewpt;
1580 case Hexagon::JMPrett:
1581 return Hexagon::J2_jumprtnewpt;
1583 case Hexagon::JMPretf:
1584 return Hexagon::J2_jumprfnewpt;
1587 // Conditional combine
1588 case Hexagon::C2_ccombinewt:
1589 return Hexagon::C2_ccombinewnewt;
1590 case Hexagon::C2_ccombinewf:
1591 return Hexagon::C2_ccombinewnewf;
1596 unsigned HexagonInstrInfo::getAddrMode(const MachineInstr* MI) const {
1597 const uint64_t F = MI->getDesc().TSFlags;
1599 return((F >> HexagonII::AddrModePos) & HexagonII::AddrModeMask);
1602 /// immediateExtend - Changes the instruction in place to one using an immediate
1604 void HexagonInstrInfo::immediateExtend(MachineInstr *MI) const {
1605 assert((isExtendable(MI)||isConstExtended(MI)) &&
1606 "Instruction must be extendable");
1607 // Find which operand is extendable.
1608 short ExtOpNum = getCExtOpNum(MI);
1609 MachineOperand &MO = MI->getOperand(ExtOpNum);
1610 // This needs to be something we understand.
1611 assert((MO.isMBB() || MO.isImm()) &&
1612 "Branch with unknown extendable field type");
1613 // Mark given operand as extended.
1614 MO.addTargetFlag(HexagonII::HMOTF_ConstExtended);
1617 DFAPacketizer *HexagonInstrInfo::CreateTargetScheduleState(
1618 const TargetSubtargetInfo &STI) const {
1619 const InstrItineraryData *II = STI.getInstrItineraryData();
1620 return static_cast<const HexagonSubtarget &>(STI).createDFAPacketizer(II);
1623 bool HexagonInstrInfo::isSchedulingBoundary(const MachineInstr *MI,
1624 const MachineBasicBlock *MBB,
1625 const MachineFunction &MF) const {
1626 // Debug info is never a scheduling boundary. It's necessary to be explicit
1627 // due to the special treatment of IT instructions below, otherwise a
1628 // dbg_value followed by an IT will result in the IT instruction being
1629 // considered a scheduling hazard, which is wrong. It should be the actual
1630 // instruction preceding the dbg_value instruction(s), just like it is
1631 // when debug info is not present.
1632 if (MI->isDebugValue())
1635 // Terminators and labels can't be scheduled around.
1636 if (MI->getDesc().isTerminator() || MI->isPosition() || MI->isInlineAsm())
1642 bool HexagonInstrInfo::isConstExtended(MachineInstr *MI) const {
1643 const uint64_t F = MI->getDesc().TSFlags;
1644 unsigned isExtended = (F >> HexagonII::ExtendedPos) & HexagonII::ExtendedMask;
1645 if (isExtended) // Instruction must be extended.
1648 unsigned isExtendable = (F >> HexagonII::ExtendablePos)
1649 & HexagonII::ExtendableMask;
1653 short ExtOpNum = getCExtOpNum(MI);
1654 const MachineOperand &MO = MI->getOperand(ExtOpNum);
1655 // Use MO operand flags to determine if MO
1656 // has the HMOTF_ConstExtended flag set.
1657 if (MO.getTargetFlags() && HexagonII::HMOTF_ConstExtended)
1659 // If this is a Machine BB address we are talking about, and it is
1660 // not marked as extended, say so.
1664 // We could be using an instruction with an extendable immediate and shoehorn
1665 // a global address into it. If it is a global address it will be constant
1666 // extended. We do this for COMBINE.
1667 // We currently only handle isGlobal() because it is the only kind of
1668 // object we are going to end up with here for now.
1669 // In the future we probably should add isSymbol(), etc.
1670 if (MO.isGlobal() || MO.isSymbol() || MO.isBlockAddress())
1673 // If the extendable operand is not 'Immediate' type, the instruction should
1674 // have 'isExtended' flag set.
1675 assert(MO.isImm() && "Extendable operand must be Immediate type");
1677 int MinValue = getMinValue(MI);
1678 int MaxValue = getMaxValue(MI);
1679 int ImmValue = MO.getImm();
1681 return (ImmValue < MinValue || ImmValue > MaxValue);
1684 // Returns the opcode to use when converting MI, which is a conditional jump,
1685 // into a conditional instruction which uses the .new value of the predicate.
1686 // We also use branch probabilities to add a hint to the jump.
1688 HexagonInstrInfo::getDotNewPredJumpOp(MachineInstr *MI,
1690 MachineBranchProbabilityInfo *MBPI) const {
1692 // We assume that block can have at most two successors.
1694 MachineBasicBlock *Src = MI->getParent();
1695 MachineOperand *BrTarget = &MI->getOperand(1);
1696 MachineBasicBlock *Dst = BrTarget->getMBB();
1698 const BranchProbability Prediction = MBPI->getEdgeProbability(Src, Dst);
1699 if (Prediction >= BranchProbability(1,2))
1702 switch (MI->getOpcode()) {
1703 case Hexagon::J2_jumpt:
1704 return taken ? Hexagon::J2_jumptnewpt : Hexagon::J2_jumptnew;
1705 case Hexagon::J2_jumpf:
1706 return taken ? Hexagon::J2_jumpfnewpt : Hexagon::J2_jumpfnew;
1709 llvm_unreachable("Unexpected jump instruction.");
1712 // Returns true if a particular operand is extendable for an instruction.
1713 bool HexagonInstrInfo::isOperandExtended(const MachineInstr *MI,
1714 unsigned short OperandNum) const {
1715 const uint64_t F = MI->getDesc().TSFlags;
1717 return ((F >> HexagonII::ExtendableOpPos) & HexagonII::ExtendableOpMask)
1721 // Returns Operand Index for the constant extended instruction.
1722 unsigned short HexagonInstrInfo::getCExtOpNum(const MachineInstr *MI) const {
1723 const uint64_t F = MI->getDesc().TSFlags;
1724 return ((F >> HexagonII::ExtendableOpPos) & HexagonII::ExtendableOpMask);
1727 // Returns the min value that doesn't need to be extended.
1728 int HexagonInstrInfo::getMinValue(const MachineInstr *MI) const {
1729 const uint64_t F = MI->getDesc().TSFlags;
1730 unsigned isSigned = (F >> HexagonII::ExtentSignedPos)
1731 & HexagonII::ExtentSignedMask;
1732 unsigned bits = (F >> HexagonII::ExtentBitsPos)
1733 & HexagonII::ExtentBitsMask;
1735 if (isSigned) // if value is signed
1736 return -1U << (bits - 1);
1741 // Returns the max value that doesn't need to be extended.
1742 int HexagonInstrInfo::getMaxValue(const MachineInstr *MI) const {
1743 const uint64_t F = MI->getDesc().TSFlags;
1744 unsigned isSigned = (F >> HexagonII::ExtentSignedPos)
1745 & HexagonII::ExtentSignedMask;
1746 unsigned bits = (F >> HexagonII::ExtentBitsPos)
1747 & HexagonII::ExtentBitsMask;
1749 if (isSigned) // if value is signed
1750 return ~(-1U << (bits - 1));
1752 return ~(-1U << bits);
1755 // Returns true if an instruction can be converted into a non-extended
1756 // equivalent instruction.
1757 bool HexagonInstrInfo::NonExtEquivalentExists (const MachineInstr *MI) const {
1760 // Check if the instruction has a register form that uses register in place
1761 // of the extended operand, if so return that as the non-extended form.
1762 if (Hexagon::getRegForm(MI->getOpcode()) >= 0)
1765 if (MI->getDesc().mayLoad() || MI->getDesc().mayStore()) {
1766 // Check addressing mode and retrieve non-ext equivalent instruction.
1768 switch (getAddrMode(MI)) {
1769 case HexagonII::Absolute :
1770 // Load/store with absolute addressing mode can be converted into
1771 // base+offset mode.
1772 NonExtOpcode = Hexagon::getBasedWithImmOffset(MI->getOpcode());
1774 case HexagonII::BaseImmOffset :
1775 // Load/store with base+offset addressing mode can be converted into
1776 // base+register offset addressing mode. However left shift operand should
1778 NonExtOpcode = Hexagon::getBaseWithRegOffset(MI->getOpcode());
1783 if (NonExtOpcode < 0)
1790 // Returns opcode of the non-extended equivalent instruction.
1791 short HexagonInstrInfo::getNonExtOpcode (const MachineInstr *MI) const {
1793 // Check if the instruction has a register form that uses register in place
1794 // of the extended operand, if so return that as the non-extended form.
1795 short NonExtOpcode = Hexagon::getRegForm(MI->getOpcode());
1796 if (NonExtOpcode >= 0)
1797 return NonExtOpcode;
1799 if (MI->getDesc().mayLoad() || MI->getDesc().mayStore()) {
1800 // Check addressing mode and retrieve non-ext equivalent instruction.
1801 switch (getAddrMode(MI)) {
1802 case HexagonII::Absolute :
1803 return Hexagon::getBasedWithImmOffset(MI->getOpcode());
1804 case HexagonII::BaseImmOffset :
1805 return Hexagon::getBaseWithRegOffset(MI->getOpcode());
1813 bool HexagonInstrInfo::PredOpcodeHasJMP_c(Opcode_t Opcode) const {
1814 return (Opcode == Hexagon::J2_jumpt) ||
1815 (Opcode == Hexagon::J2_jumpf) ||
1816 (Opcode == Hexagon::J2_jumptnewpt) ||
1817 (Opcode == Hexagon::J2_jumpfnewpt) ||
1818 (Opcode == Hexagon::J2_jumpt) ||
1819 (Opcode == Hexagon::J2_jumpf);
1822 bool HexagonInstrInfo::PredOpcodeHasNot(Opcode_t Opcode) const {
1823 return (Opcode == Hexagon::J2_jumpf) ||
1824 (Opcode == Hexagon::J2_jumpfnewpt) ||
1825 (Opcode == Hexagon::J2_jumpfnew);