1//===- HexagonInstrInfo.cpp - Hexagon Instruction Information -------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file contains the Hexagon implementation of the TargetInstrInfo class.
10//
11//===----------------------------------------------------------------------===//
12
13#include "HexagonInstrInfo.h"
14#include "HexagonFrameLowering.h"
15#include "HexagonHazardRecognizer.h"
16#include "HexagonRegisterInfo.h"
17#include "HexagonSubtarget.h"
18#include "llvm/ADT/ArrayRef.h"
19#include "llvm/ADT/SmallPtrSet.h"
20#include "llvm/ADT/SmallVector.h"
21#include "llvm/ADT/StringExtras.h"
22#include "llvm/ADT/StringRef.h"
23#include "llvm/CodeGen/DFAPacketizer.h"
24#include "llvm/CodeGen/LiveIntervals.h"
25#include "llvm/CodeGen/LivePhysRegs.h"
26#include "llvm/CodeGen/MachineBasicBlock.h"
27#include "llvm/CodeGen/MachineBranchProbabilityInfo.h"
28#include "llvm/CodeGen/MachineFrameInfo.h"
29#include "llvm/CodeGen/MachineFunction.h"
30#include "llvm/CodeGen/MachineInstr.h"
31#include "llvm/CodeGen/MachineInstrBuilder.h"
32#include "llvm/CodeGen/MachineInstrBundle.h"
33#include "llvm/CodeGen/MachineMemOperand.h"
34#include "llvm/CodeGen/MachineOperand.h"
35#include "llvm/CodeGen/MachineRegisterInfo.h"
36#include "llvm/CodeGen/ScheduleDAG.h"
37#include "llvm/CodeGen/TargetInstrInfo.h"
38#include "llvm/CodeGen/TargetOpcodes.h"
39#include "llvm/CodeGen/TargetRegisterInfo.h"
40#include "llvm/CodeGen/TargetSubtargetInfo.h"
41#include "llvm/CodeGenTypes/MachineValueType.h"
42#include "llvm/IR/DebugLoc.h"
43#include "llvm/IR/GlobalVariable.h"
44#include "llvm/MC/MCAsmInfo.h"
45#include "llvm/MC/MCInstBuilder.h"
46#include "llvm/MC/MCInstrDesc.h"
47#include "llvm/MC/MCInstrItineraries.h"
48#include "llvm/Support/BranchProbability.h"
49#include "llvm/Support/CommandLine.h"
50#include "llvm/Support/Debug.h"
51#include "llvm/Support/ErrorHandling.h"
52#include "llvm/Support/MathExtras.h"
53#include "llvm/Support/raw_ostream.h"
54#include "llvm/Target/TargetMachine.h"
55#include <cassert>
56#include <cctype>
57#include <cstdint>
58#include <cstring>
59#include <iterator>
60#include <optional>
61#include <string>
62#include <utility>
63
64using namespace llvm;
65
66#define DEBUG_TYPE "hexagon-instrinfo"
67
68#define GET_INSTRINFO_CTOR_DTOR
69#define GET_INSTRMAP_INFO
70#include "HexagonDepTimingClasses.h"
71#include "HexagonGenDFAPacketizer.inc"
72#include "HexagonGenInstrInfo.inc"
73
74cl::opt<bool> ScheduleInlineAsm("hexagon-sched-inline-asm", cl::Hidden,
75 cl::init(Val: false), cl::desc("Do not consider inline-asm a scheduling/"
76 "packetization boundary."));
77
78static cl::opt<bool> EnableBranchPrediction("hexagon-enable-branch-prediction",
79 cl::Hidden, cl::init(Val: true), cl::desc("Enable branch prediction"));
80
81static cl::opt<bool> DisableNVSchedule(
82 "disable-hexagon-nv-schedule", cl::Hidden,
83 cl::desc("Disable schedule adjustment for new value stores."));
84
85static cl::opt<bool> EnableTimingClassLatency(
86 "enable-timing-class-latency", cl::Hidden, cl::init(Val: false),
87 cl::desc("Enable timing class latency"));
88
89static cl::opt<bool> EnableALUForwarding(
90 "enable-alu-forwarding", cl::Hidden, cl::init(Val: true),
91 cl::desc("Enable vec alu forwarding"));
92
93static cl::opt<bool> EnableACCForwarding(
94 "enable-acc-forwarding", cl::Hidden, cl::init(Val: true),
95 cl::desc("Enable vec acc forwarding"));
96
97static cl::opt<bool> BranchRelaxAsmLarge("branch-relax-asm-large",
98 cl::init(Val: true), cl::Hidden,
99 cl::desc("branch relax asm"));
100
101static cl::opt<bool>
102 UseDFAHazardRec("dfa-hazard-rec", cl::init(Val: true), cl::Hidden,
103 cl::desc("Use the DFA based hazard recognizer."));
104
105/// Constants for Hexagon instructions.
106const int Hexagon_MEMW_OFFSET_MAX = 4095;
107const int Hexagon_MEMW_OFFSET_MIN = -4096;
108const int Hexagon_MEMD_OFFSET_MAX = 8191;
109const int Hexagon_MEMD_OFFSET_MIN = -8192;
110const int Hexagon_MEMH_OFFSET_MAX = 2047;
111const int Hexagon_MEMH_OFFSET_MIN = -2048;
112const int Hexagon_MEMB_OFFSET_MAX = 1023;
113const int Hexagon_MEMB_OFFSET_MIN = -1024;
114const int Hexagon_ADDI_OFFSET_MAX = 32767;
115const int Hexagon_ADDI_OFFSET_MIN = -32768;
116
117// Pin the vtable to this file.
118void HexagonInstrInfo::anchor() {}
119
120HexagonInstrInfo::HexagonInstrInfo(const HexagonSubtarget &ST)
121 : HexagonGenInstrInfo(ST, RegInfo, Hexagon::ADJCALLSTACKDOWN,
122 Hexagon::ADJCALLSTACKUP),
123 RegInfo(ST.getHwMode()), Subtarget(ST) {}
124
125namespace llvm {
126namespace HexagonFUnits {
127 bool isSlot0Only(unsigned units);
128}
129}
130
131static bool isIntRegForSubInst(Register Reg) {
132 return (Reg >= Hexagon::R0 && Reg <= Hexagon::R7) ||
133 (Reg >= Hexagon::R16 && Reg <= Hexagon::R23);
134}
135
136static bool isDblRegForSubInst(Register Reg, const HexagonRegisterInfo &HRI) {
137 return isIntRegForSubInst(Reg: HRI.getSubReg(Reg, Idx: Hexagon::isub_lo)) &&
138 isIntRegForSubInst(Reg: HRI.getSubReg(Reg, Idx: Hexagon::isub_hi));
139}
140
141/// Calculate number of instructions excluding the debug instructions.
142static unsigned nonDbgMICount(MachineBasicBlock::const_instr_iterator MIB,
143 MachineBasicBlock::const_instr_iterator MIE) {
144 unsigned Count = 0;
145 for (; MIB != MIE; ++MIB) {
146 if (!MIB->isDebugInstr())
147 ++Count;
148 }
149 return Count;
150}
151
152// Check if the A2_tfrsi instruction is cheap or not. If the operand has
153// to be constant-extendend it is not cheap since it occupies two slots
154// in a packet.
155bool HexagonInstrInfo::isAsCheapAsAMove(const MachineInstr &MI) const {
156 // Enable the following steps only at Os/Oz
157 if (!(MI.getMF()->getFunction().hasOptSize()))
158 return MI.isAsCheapAsAMove();
159
160 if (MI.getOpcode() == Hexagon::A2_tfrsi) {
161 auto Op = MI.getOperand(i: 1);
162 // If the instruction has a global address as operand, it is not cheap
163 // since the operand will be constant extended.
164 if (Op.isGlobal())
165 return false;
166 // If the instruction has an operand of size > 16bits, its will be
167 // const-extended and hence, it is not cheap.
168 if (Op.isImm()) {
169 int64_t Imm = Op.getImm();
170 if (!isInt<16>(x: Imm))
171 return false;
172 }
173 }
174 return MI.isAsCheapAsAMove();
175}
176
177// Do not sink floating point instructions that updates USR register.
178// Example:
179// feclearexcept
180// F2_conv_w2sf
181// fetestexcept
182// MachineSink sinks F2_conv_w2sf and we are not able to catch exceptions.
183// TODO: On some of these floating point instructions, USR is marked as Use.
184// In reality, these instructions also Def the USR. If USR is marked as Def,
185// some of the assumptions in assembler packetization are broken.
186bool HexagonInstrInfo::shouldSink(const MachineInstr &MI) const {
187 // Assumption: A floating point instruction that reads the USR will write
188 // the USR as well.
189 if (isFloat(MI) && MI.hasRegisterImplicitUseOperand(Reg: Hexagon::USR))
190 return false;
191 return true;
192}
193
194/// Find the hardware loop instruction used to set-up the specified loop.
195/// On Hexagon, we have two instructions used to set-up the hardware loop
196/// (LOOP0, LOOP1) with corresponding endloop (ENDLOOP0, ENDLOOP1) instructions
197/// to indicate the end of a loop.
198MachineInstr *HexagonInstrInfo::findLoopInstr(MachineBasicBlock *BB,
199 unsigned EndLoopOp, MachineBasicBlock *TargetBB,
200 SmallPtrSet<MachineBasicBlock *, 8> &Visited) const {
201 unsigned LOOPi;
202 unsigned LOOPr;
203 if (EndLoopOp == Hexagon::ENDLOOP0) {
204 LOOPi = Hexagon::J2_loop0i;
205 LOOPr = Hexagon::J2_loop0r;
206 } else { // EndLoopOp == Hexagon::EndLOOP1
207 LOOPi = Hexagon::J2_loop1i;
208 LOOPr = Hexagon::J2_loop1r;
209 }
210
211 // The loop set-up instruction will be in a predecessor block
212 for (MachineBasicBlock *PB : BB->predecessors()) {
213 // If this has been visited, already skip it.
214 if (!Visited.insert(Ptr: PB).second)
215 continue;
216 if (PB == BB)
217 continue;
218 for (MachineInstr &I : llvm::reverse(C: PB->instrs())) {
219 unsigned Opc = I.getOpcode();
220 if (Opc == LOOPi || Opc == LOOPr)
221 return &I;
222 // We've reached a different loop, which means the loop01 has been
223 // removed.
224 if (Opc == EndLoopOp && I.getOperand(i: 0).getMBB() != TargetBB)
225 return nullptr;
226 }
227 // Check the predecessors for the LOOP instruction.
228 if (MachineInstr *Loop = findLoopInstr(BB: PB, EndLoopOp, TargetBB, Visited))
229 return Loop;
230 }
231 return nullptr;
232}
233
234/// Gather register def/uses from MI.
235/// This treats possible (predicated) defs as actually happening ones
236/// (conservatively).
237static inline void parseOperands(const MachineInstr &MI,
238 SmallVectorImpl<Register> &Defs, SmallVectorImpl<Register> &Uses) {
239 Defs.clear();
240 Uses.clear();
241
242 for (const MachineOperand &MO : MI.operands()) {
243 if (!MO.isReg())
244 continue;
245
246 Register Reg = MO.getReg();
247 if (!Reg)
248 continue;
249
250 if (MO.isUse())
251 Uses.push_back(Elt: MO.getReg());
252
253 if (MO.isDef())
254 Defs.push_back(Elt: MO.getReg());
255 }
256}
257
258// Position dependent, so check twice for swap.
259static bool isDuplexPairMatch(unsigned Ga, unsigned Gb) {
260 switch (Ga) {
261 case HexagonII::HSIG_None:
262 default:
263 return false;
264 case HexagonII::HSIG_L1:
265 return (Gb == HexagonII::HSIG_L1 || Gb == HexagonII::HSIG_A);
266 case HexagonII::HSIG_L2:
267 return (Gb == HexagonII::HSIG_L1 || Gb == HexagonII::HSIG_L2 ||
268 Gb == HexagonII::HSIG_A);
269 case HexagonII::HSIG_S1:
270 return (Gb == HexagonII::HSIG_L1 || Gb == HexagonII::HSIG_L2 ||
271 Gb == HexagonII::HSIG_S1 || Gb == HexagonII::HSIG_A);
272 case HexagonII::HSIG_S2:
273 return (Gb == HexagonII::HSIG_L1 || Gb == HexagonII::HSIG_L2 ||
274 Gb == HexagonII::HSIG_S1 || Gb == HexagonII::HSIG_S2 ||
275 Gb == HexagonII::HSIG_A);
276 case HexagonII::HSIG_A:
277 return (Gb == HexagonII::HSIG_A);
278 case HexagonII::HSIG_Compound:
279 return (Gb == HexagonII::HSIG_Compound);
280 }
281 return false;
282}
283
284/// isLoadFromStackSlot - If the specified machine instruction is a direct
285/// load from a stack slot, return the virtual or physical register number of
286/// the destination along with the FrameIndex of the loaded stack slot. If
287/// not, return 0. This predicate must return 0 if the instruction has
288/// any side effects other than loading from the stack slot.
289Register HexagonInstrInfo::isLoadFromStackSlot(const MachineInstr &MI,
290 int &FrameIndex) const {
291 switch (MI.getOpcode()) {
292 default:
293 break;
294 case Hexagon::L2_loadri_io:
295 case Hexagon::L2_loadrd_io:
296 case Hexagon::V6_vL32b_ai:
297 case Hexagon::V6_vL32b_nt_ai:
298 case Hexagon::V6_vL32Ub_ai:
299 case Hexagon::LDriw_pred:
300 case Hexagon::LDriw_ctr:
301 case Hexagon::PS_vloadrq_ai:
302 case Hexagon::PS_vloadrw_ai:
303 case Hexagon::PS_vloadrw_nt_ai: {
304 const MachineOperand OpFI = MI.getOperand(i: 1);
305 if (!OpFI.isFI())
306 return 0;
307 const MachineOperand OpOff = MI.getOperand(i: 2);
308 if (!OpOff.isImm() || OpOff.getImm() != 0)
309 return 0;
310 FrameIndex = OpFI.getIndex();
311 return MI.getOperand(i: 0).getReg();
312 }
313
314 case Hexagon::L2_ploadrit_io:
315 case Hexagon::L2_ploadrif_io:
316 case Hexagon::L2_ploadrdt_io:
317 case Hexagon::L2_ploadrdf_io: {
318 const MachineOperand OpFI = MI.getOperand(i: 2);
319 if (!OpFI.isFI())
320 return 0;
321 const MachineOperand OpOff = MI.getOperand(i: 3);
322 if (!OpOff.isImm() || OpOff.getImm() != 0)
323 return 0;
324 FrameIndex = OpFI.getIndex();
325 return MI.getOperand(i: 0).getReg();
326 }
327 }
328
329 return 0;
330}
331
332/// isStoreToStackSlot - If the specified machine instruction is a direct
333/// store to a stack slot, return the virtual or physical register number of
334/// the source reg along with the FrameIndex of the loaded stack slot. If
335/// not, return 0. This predicate must return 0 if the instruction has
336/// any side effects other than storing to the stack slot.
337Register HexagonInstrInfo::isStoreToStackSlot(const MachineInstr &MI,
338 int &FrameIndex) const {
339 switch (MI.getOpcode()) {
340 default:
341 break;
342 case Hexagon::S2_storerb_io:
343 case Hexagon::S2_storerh_io:
344 case Hexagon::S2_storeri_io:
345 case Hexagon::S2_storerd_io:
346 case Hexagon::V6_vS32b_ai:
347 case Hexagon::V6_vS32Ub_ai:
348 case Hexagon::STriw_pred:
349 case Hexagon::STriw_ctr:
350 case Hexagon::PS_vstorerq_ai:
351 case Hexagon::PS_vstorerw_ai: {
352 const MachineOperand &OpFI = MI.getOperand(i: 0);
353 if (!OpFI.isFI())
354 return 0;
355 const MachineOperand &OpOff = MI.getOperand(i: 1);
356 if (!OpOff.isImm() || OpOff.getImm() != 0)
357 return 0;
358 FrameIndex = OpFI.getIndex();
359 return MI.getOperand(i: 2).getReg();
360 }
361
362 case Hexagon::S2_pstorerbt_io:
363 case Hexagon::S2_pstorerbf_io:
364 case Hexagon::S2_pstorerht_io:
365 case Hexagon::S2_pstorerhf_io:
366 case Hexagon::S2_pstorerit_io:
367 case Hexagon::S2_pstorerif_io:
368 case Hexagon::S2_pstorerdt_io:
369 case Hexagon::S2_pstorerdf_io: {
370 const MachineOperand &OpFI = MI.getOperand(i: 1);
371 if (!OpFI.isFI())
372 return 0;
373 const MachineOperand &OpOff = MI.getOperand(i: 2);
374 if (!OpOff.isImm() || OpOff.getImm() != 0)
375 return 0;
376 FrameIndex = OpFI.getIndex();
377 return MI.getOperand(i: 3).getReg();
378 }
379 }
380
381 return 0;
382}
383
384/// This function checks if the instruction or bundle of instructions
385/// has load from stack slot and returns frameindex and machine memory
386/// operand of that instruction if true.
387bool HexagonInstrInfo::hasLoadFromStackSlot(
388 const MachineInstr &MI,
389 SmallVectorImpl<const MachineMemOperand *> &Accesses) const {
390 if (MI.isBundle()) {
391 const MachineBasicBlock *MBB = MI.getParent();
392 MachineBasicBlock::const_instr_iterator MII = MI.getIterator();
393 for (++MII; MII != MBB->instr_end() && MII->isInsideBundle(); ++MII)
394 if (TargetInstrInfo::hasLoadFromStackSlot(MI: *MII, Accesses))
395 return true;
396 return false;
397 }
398
399 return TargetInstrInfo::hasLoadFromStackSlot(MI, Accesses);
400}
401
402/// This function checks if the instruction or bundle of instructions
403/// has store to stack slot and returns frameindex and machine memory
404/// operand of that instruction if true.
405bool HexagonInstrInfo::hasStoreToStackSlot(
406 const MachineInstr &MI,
407 SmallVectorImpl<const MachineMemOperand *> &Accesses) const {
408 if (MI.isBundle()) {
409 const MachineBasicBlock *MBB = MI.getParent();
410 MachineBasicBlock::const_instr_iterator MII = MI.getIterator();
411 for (++MII; MII != MBB->instr_end() && MII->isInsideBundle(); ++MII)
412 if (TargetInstrInfo::hasStoreToStackSlot(MI: *MII, Accesses))
413 return true;
414 return false;
415 }
416
417 return TargetInstrInfo::hasStoreToStackSlot(MI, Accesses);
418}
419
420/// This function can analyze one/two way branching only and should (mostly) be
421/// called by target independent side.
422/// First entry is always the opcode of the branching instruction, except when
423/// the Cond vector is supposed to be empty, e.g., when analyzeBranch fails, a
424/// BB with only unconditional jump. Subsequent entries depend upon the opcode,
425/// e.g. Jump_c p will have
426/// Cond[0] = Jump_c
427/// Cond[1] = p
428/// HW-loop ENDLOOP:
429/// Cond[0] = ENDLOOP
430/// Cond[1] = MBB
431/// New value jump:
432/// Cond[0] = Hexagon::CMPEQri_f_Jumpnv_t_V4 -- specific opcode
433/// Cond[1] = R
434/// Cond[2] = Imm
435bool HexagonInstrInfo::analyzeBranch(MachineBasicBlock &MBB,
436 MachineBasicBlock *&TBB,
437 MachineBasicBlock *&FBB,
438 SmallVectorImpl<MachineOperand> &Cond,
439 bool AllowModify) const {
440 TBB = nullptr;
441 FBB = nullptr;
442 Cond.clear();
443
444 // If the block has no terminators, it just falls into the block after it.
445 MachineBasicBlock::instr_iterator I = MBB.instr_end();
446 if (I == MBB.instr_begin())
447 return false;
448
449 // A basic block may looks like this:
450 //
451 // [ insn
452 // EH_LABEL
453 // insn
454 // insn
455 // insn
456 // EH_LABEL
457 // insn ]
458 //
459 // It has two succs but does not have a terminator
460 // Don't know how to handle it.
461 do {
462 --I;
463 if (I->isEHLabel())
464 // Don't analyze EH branches.
465 return true;
466 } while (I != MBB.instr_begin());
467
468 I = MBB.instr_end();
469 --I;
470
471 while (I->isDebugInstr()) {
472 if (I == MBB.instr_begin())
473 return false;
474 --I;
475 }
476
477 bool JumpToBlock = I->getOpcode() == Hexagon::J2_jump &&
478 I->getOperand(i: 0).isMBB();
479 // Delete the J2_jump if it's equivalent to a fall-through.
480 if (AllowModify && JumpToBlock &&
481 MBB.isLayoutSuccessor(MBB: I->getOperand(i: 0).getMBB())) {
482 LLVM_DEBUG(dbgs() << "\nErasing the jump to successor block\n";);
483 I->eraseFromParent();
484 I = MBB.instr_end();
485 if (I == MBB.instr_begin())
486 return false;
487 --I;
488 }
489 if (!isUnpredicatedTerminator(MI: *I))
490 return false;
491
492 // Get the last instruction in the block.
493 MachineInstr *LastInst = &*I;
494 MachineInstr *SecondLastInst = nullptr;
495 // Find one more terminator if present.
496 while (true) {
497 if (&*I != LastInst && !I->isBundle() && isUnpredicatedTerminator(MI: *I)) {
498 if (!SecondLastInst)
499 SecondLastInst = &*I;
500 else
501 // This is a third branch.
502 return true;
503 }
504 if (I == MBB.instr_begin())
505 break;
506 --I;
507 }
508
509 int LastOpcode = LastInst->getOpcode();
510 int SecLastOpcode = SecondLastInst ? SecondLastInst->getOpcode() : 0;
511 // If the branch target is not a basic block, it could be a tail call.
512 // (It is, if the target is a function.)
513 if (LastOpcode == Hexagon::J2_jump && !LastInst->getOperand(i: 0).isMBB())
514 return true;
515 if (SecLastOpcode == Hexagon::J2_jump &&
516 !SecondLastInst->getOperand(i: 0).isMBB())
517 return true;
518
519 bool LastOpcodeHasJMP_c = PredOpcodeHasJMP_c(Opcode: LastOpcode);
520 bool LastOpcodeHasNVJump = isNewValueJump(MI: *LastInst);
521
522 if (LastOpcodeHasJMP_c && !LastInst->getOperand(i: 1).isMBB())
523 return true;
524
525 // If there is only one terminator instruction, process it.
526 if (LastInst && !SecondLastInst) {
527 if (LastOpcode == Hexagon::J2_jump) {
528 TBB = LastInst->getOperand(i: 0).getMBB();
529 return false;
530 }
531 if (isEndLoopN(Opcode: LastOpcode)) {
532 TBB = LastInst->getOperand(i: 0).getMBB();
533 Cond.push_back(Elt: MachineOperand::CreateImm(Val: LastInst->getOpcode()));
534 Cond.push_back(Elt: LastInst->getOperand(i: 0));
535 return false;
536 }
537 if (LastOpcodeHasJMP_c) {
538 TBB = LastInst->getOperand(i: 1).getMBB();
539 Cond.push_back(Elt: MachineOperand::CreateImm(Val: LastInst->getOpcode()));
540 Cond.push_back(Elt: LastInst->getOperand(i: 0));
541 return false;
542 }
543 // Only supporting rr/ri versions of new-value jumps.
544 if (LastOpcodeHasNVJump && (LastInst->getNumExplicitOperands() == 3)) {
545 TBB = LastInst->getOperand(i: 2).getMBB();
546 Cond.push_back(Elt: MachineOperand::CreateImm(Val: LastInst->getOpcode()));
547 Cond.push_back(Elt: LastInst->getOperand(i: 0));
548 Cond.push_back(Elt: LastInst->getOperand(i: 1));
549 return false;
550 }
551 LLVM_DEBUG(dbgs() << "\nCant analyze " << printMBBReference(MBB)
552 << " with one jump\n";);
553 // Otherwise, don't know what this is.
554 return true;
555 }
556
557 bool SecLastOpcodeHasJMP_c = PredOpcodeHasJMP_c(Opcode: SecLastOpcode);
558 bool SecLastOpcodeHasNVJump = isNewValueJump(MI: *SecondLastInst);
559 if (SecLastOpcodeHasJMP_c && (LastOpcode == Hexagon::J2_jump)) {
560 if (!SecondLastInst->getOperand(i: 1).isMBB())
561 return true;
562 TBB = SecondLastInst->getOperand(i: 1).getMBB();
563 Cond.push_back(Elt: MachineOperand::CreateImm(Val: SecondLastInst->getOpcode()));
564 Cond.push_back(Elt: SecondLastInst->getOperand(i: 0));
565 FBB = LastInst->getOperand(i: 0).getMBB();
566 return false;
567 }
568
569 // Only supporting rr/ri versions of new-value jumps.
570 if (SecLastOpcodeHasNVJump &&
571 (SecondLastInst->getNumExplicitOperands() == 3) &&
572 (LastOpcode == Hexagon::J2_jump)) {
573 TBB = SecondLastInst->getOperand(i: 2).getMBB();
574 Cond.push_back(Elt: MachineOperand::CreateImm(Val: SecondLastInst->getOpcode()));
575 Cond.push_back(Elt: SecondLastInst->getOperand(i: 0));
576 Cond.push_back(Elt: SecondLastInst->getOperand(i: 1));
577 FBB = LastInst->getOperand(i: 0).getMBB();
578 return false;
579 }
580
581 // If the block ends with two Hexagon:JMPs, handle it. The second one is not
582 // executed, so remove it.
583 if (SecLastOpcode == Hexagon::J2_jump && LastOpcode == Hexagon::J2_jump) {
584 TBB = SecondLastInst->getOperand(i: 0).getMBB();
585 I = LastInst->getIterator();
586 if (AllowModify)
587 I->eraseFromParent();
588 return false;
589 }
590
591 // If the block ends with an ENDLOOP, and J2_jump, handle it.
592 if (isEndLoopN(Opcode: SecLastOpcode) && LastOpcode == Hexagon::J2_jump) {
593 TBB = SecondLastInst->getOperand(i: 0).getMBB();
594 Cond.push_back(Elt: MachineOperand::CreateImm(Val: SecondLastInst->getOpcode()));
595 Cond.push_back(Elt: SecondLastInst->getOperand(i: 0));
596 FBB = LastInst->getOperand(i: 0).getMBB();
597 return false;
598 }
599 LLVM_DEBUG(dbgs() << "\nCant analyze " << printMBBReference(MBB)
600 << " with two jumps";);
601 // Otherwise, can't handle this.
602 return true;
603}
604
605unsigned HexagonInstrInfo::removeBranch(MachineBasicBlock &MBB,
606 int *BytesRemoved) const {
607 assert(!BytesRemoved && "code size not handled");
608
609 LLVM_DEBUG(dbgs() << "\nRemoving branches out of " << printMBBReference(MBB));
610 MachineBasicBlock::iterator I = MBB.end();
611 unsigned Count = 0;
612 while (I != MBB.begin()) {
613 --I;
614 if (I->isDebugInstr())
615 continue;
616 // Only removing branches from end of MBB.
617 if (!I->isBranch())
618 return Count;
619 if (Count && (I->getOpcode() == Hexagon::J2_jump))
620 llvm_unreachable("Malformed basic block: unconditional branch not last");
621 MBB.erase(I: &MBB.back());
622 I = MBB.end();
623 ++Count;
624 }
625 return Count;
626}
627
628unsigned HexagonInstrInfo::insertBranch(MachineBasicBlock &MBB,
629 MachineBasicBlock *TBB,
630 MachineBasicBlock *FBB,
631 ArrayRef<MachineOperand> Cond,
632 const DebugLoc &DL,
633 int *BytesAdded) const {
634 unsigned BOpc = Hexagon::J2_jump;
635 unsigned BccOpc = Hexagon::J2_jumpt;
636 assert(validateBranchCond(Cond) && "Invalid branching condition");
637 assert(TBB && "insertBranch must not be told to insert a fallthrough");
638 assert(!BytesAdded && "code size not handled");
639
640 // Check if reverseBranchCondition has asked to reverse this branch
641 // If we want to reverse the branch an odd number of times, we want
642 // J2_jumpf.
643 if (!Cond.empty() && Cond[0].isImm())
644 BccOpc = Cond[0].getImm();
645
646 if (!FBB) {
647 if (Cond.empty()) {
648 // Due to a bug in TailMerging/CFG Optimization, we need to add a
649 // special case handling of a predicated jump followed by an
650 // unconditional jump. If not, Tail Merging and CFG Optimization go
651 // into an infinite loop.
652 MachineBasicBlock *NewTBB, *NewFBB;
653 SmallVector<MachineOperand, 4> Cond;
654 auto Term = MBB.getFirstTerminator();
655 if (Term != MBB.end() && isPredicated(MI: *Term) &&
656 !analyzeBranch(MBB, TBB&: NewTBB, FBB&: NewFBB, Cond, AllowModify: false) &&
657 MachineFunction::iterator(NewTBB) == ++MBB.getIterator()) {
658 reverseBranchCondition(Cond);
659 removeBranch(MBB);
660 return insertBranch(MBB, TBB, FBB: nullptr, Cond, DL);
661 }
662 BuildMI(BB: &MBB, MIMD: DL, MCID: get(Opcode: BOpc)).addMBB(MBB: TBB);
663 } else if (isEndLoopN(Opcode: Cond[0].getImm())) {
664 int EndLoopOp = Cond[0].getImm();
665 assert(Cond[1].isMBB());
666 // Since we're adding an ENDLOOP, there better be a LOOP instruction.
667 // Check for it, and change the BB target if needed.
668 SmallPtrSet<MachineBasicBlock *, 8> VisitedBBs;
669 MachineInstr *Loop = findLoopInstr(BB: TBB, EndLoopOp, TargetBB: Cond[1].getMBB(),
670 Visited&: VisitedBBs);
671 assert(Loop != nullptr && "Inserting an ENDLOOP without a LOOP");
672 Loop->getOperand(i: 0).setMBB(TBB);
673 // Add the ENDLOOP after the finding the LOOP0.
674 BuildMI(BB: &MBB, MIMD: DL, MCID: get(Opcode: EndLoopOp)).addMBB(MBB: TBB);
675 } else if (isNewValueJump(Opcode: Cond[0].getImm())) {
676 assert((Cond.size() == 3) && "Only supporting rr/ri version of nvjump");
677 // New value jump
678 // (ins IntRegs:$src1, IntRegs:$src2, brtarget:$offset)
679 // (ins IntRegs:$src1, u5Imm:$src2, brtarget:$offset)
680 RegState Flags1 = getUndefRegState(B: Cond[1].isUndef());
681 LLVM_DEBUG(dbgs() << "\nInserting NVJump for "
682 << printMBBReference(MBB););
683 if (Cond[2].isReg()) {
684 RegState Flags2 = getUndefRegState(B: Cond[2].isUndef());
685 BuildMI(BB: &MBB, MIMD: DL, MCID: get(Opcode: BccOpc)).addReg(RegNo: Cond[1].getReg(), Flags: Flags1).
686 addReg(RegNo: Cond[2].getReg(), Flags: Flags2).addMBB(MBB: TBB);
687 } else if(Cond[2].isImm()) {
688 BuildMI(BB: &MBB, MIMD: DL, MCID: get(Opcode: BccOpc)).addReg(RegNo: Cond[1].getReg(), Flags: Flags1).
689 addImm(Val: Cond[2].getImm()).addMBB(MBB: TBB);
690 } else
691 llvm_unreachable("Invalid condition for branching");
692 } else {
693 assert((Cond.size() == 2) && "Malformed cond vector");
694 const MachineOperand &RO = Cond[1];
695 RegState Flags = getUndefRegState(B: RO.isUndef());
696 BuildMI(BB: &MBB, MIMD: DL, MCID: get(Opcode: BccOpc)).addReg(RegNo: RO.getReg(), Flags).addMBB(MBB: TBB);
697 }
698 return 1;
699 }
700 assert((!Cond.empty()) &&
701 "Cond. cannot be empty when multiple branchings are required");
702 assert((!isNewValueJump(Cond[0].getImm())) &&
703 "NV-jump cannot be inserted with another branch");
704 // Special case for hardware loops. The condition is a basic block.
705 if (isEndLoopN(Opcode: Cond[0].getImm())) {
706 int EndLoopOp = Cond[0].getImm();
707 assert(Cond[1].isMBB());
708 // Since we're adding an ENDLOOP, there better be a LOOP instruction.
709 // Check for it, and change the BB target if needed.
710 SmallPtrSet<MachineBasicBlock *, 8> VisitedBBs;
711 MachineInstr *Loop = findLoopInstr(BB: TBB, EndLoopOp, TargetBB: Cond[1].getMBB(),
712 Visited&: VisitedBBs);
713 assert(Loop != nullptr && "Inserting an ENDLOOP without a LOOP");
714 Loop->getOperand(i: 0).setMBB(TBB);
715 // Add the ENDLOOP after the finding the LOOP0.
716 BuildMI(BB: &MBB, MIMD: DL, MCID: get(Opcode: EndLoopOp)).addMBB(MBB: TBB);
717 } else {
718 const MachineOperand &RO = Cond[1];
719 RegState Flags = getUndefRegState(B: RO.isUndef());
720 BuildMI(BB: &MBB, MIMD: DL, MCID: get(Opcode: BccOpc)).addReg(RegNo: RO.getReg(), Flags).addMBB(MBB: TBB);
721 }
722 BuildMI(BB: &MBB, MIMD: DL, MCID: get(Opcode: BOpc)).addMBB(MBB: FBB);
723
724 return 2;
725}
726
727namespace {
728class HexagonPipelinerLoopInfo : public TargetInstrInfo::PipelinerLoopInfo {
729 MachineInstr *Loop, *EndLoop;
730 MachineFunction *MF;
731 const HexagonInstrInfo *TII;
732 int64_t TripCount;
733 Register LoopCount;
734 DebugLoc DL;
735
736public:
737 HexagonPipelinerLoopInfo(MachineInstr *Loop, MachineInstr *EndLoop)
738 : Loop(Loop), EndLoop(EndLoop), MF(Loop->getParent()->getParent()),
739 TII(MF->getSubtarget<HexagonSubtarget>().getInstrInfo()),
740 DL(Loop->getDebugLoc()) {
741 // Inspect the Loop instruction up-front, as it may be deleted when we call
742 // createTripCountGreaterCondition.
743 TripCount = Loop->getOpcode() == Hexagon::J2_loop0r
744 ? -1
745 : Loop->getOperand(i: 1).getImm();
746 if (TripCount == -1)
747 LoopCount = Loop->getOperand(i: 1).getReg();
748 }
749
750 bool shouldIgnoreForPipelining(const MachineInstr *MI) const override {
751 // Only ignore the terminator.
752 return MI == EndLoop;
753 }
754
755 std::optional<bool> createTripCountGreaterCondition(
756 int TC, MachineBasicBlock &MBB,
757 SmallVectorImpl<MachineOperand> &Cond) override {
758 if (TripCount == -1) {
759 // Check if we're done with the loop.
760 Register Done = TII->createVR(MF, VT: MVT::i1);
761 MachineInstr *NewCmp = BuildMI(BB: &MBB, MIMD: DL,
762 MCID: TII->get(Opcode: Hexagon::C2_cmpgtui), DestReg: Done)
763 .addReg(RegNo: LoopCount)
764 .addImm(Val: TC);
765 Cond.push_back(Elt: MachineOperand::CreateImm(Val: Hexagon::J2_jumpf));
766 Cond.push_back(Elt: NewCmp->getOperand(i: 0));
767 return {};
768 }
769
770 return TripCount > TC;
771 }
772
773 void setPreheader(MachineBasicBlock *NewPreheader) override {
774 NewPreheader->splice(Where: NewPreheader->getFirstTerminator(), Other: Loop->getParent(),
775 From: Loop);
776 }
777
778 void adjustTripCount(int TripCountAdjust) override {
779 // If the loop trip count is a compile-time value, then just change the
780 // value.
781 if (Loop->getOpcode() == Hexagon::J2_loop0i ||
782 Loop->getOpcode() == Hexagon::J2_loop1i) {
783 int64_t TripCount = Loop->getOperand(i: 1).getImm() + TripCountAdjust;
784 assert(TripCount > 0 && "Can't create an empty or negative loop!");
785 Loop->getOperand(i: 1).setImm(TripCount);
786 return;
787 }
788
789 // The loop trip count is a run-time value. We generate code to subtract
790 // one from the trip count, and update the loop instruction.
791 Register LoopCount = Loop->getOperand(i: 1).getReg();
792 Register NewLoopCount = TII->createVR(MF, VT: MVT::i32);
793 BuildMI(BB&: *Loop->getParent(), I: Loop, MIMD: Loop->getDebugLoc(),
794 MCID: TII->get(Opcode: Hexagon::A2_addi), DestReg: NewLoopCount)
795 .addReg(RegNo: LoopCount)
796 .addImm(Val: TripCountAdjust);
797 Loop->getOperand(i: 1).setReg(NewLoopCount);
798 }
799
800 void disposed(LiveIntervals *LIS) override {
801 if (LIS)
802 LIS->RemoveMachineInstrFromMaps(MI&: *Loop);
803 Loop->eraseFromParent();
804 }
805};
806} // namespace
807
808std::unique_ptr<TargetInstrInfo::PipelinerLoopInfo>
809HexagonInstrInfo::analyzeLoopForPipelining(MachineBasicBlock *LoopBB) const {
810 // We really "analyze" only hardware loops right now.
811 MachineBasicBlock::iterator I = LoopBB->getFirstTerminator();
812
813 if (I != LoopBB->end() && isEndLoopN(Opcode: I->getOpcode())) {
814 SmallPtrSet<MachineBasicBlock *, 8> VisitedBBs;
815 MachineInstr *LoopInst = findLoopInstr(
816 BB: LoopBB, EndLoopOp: I->getOpcode(), TargetBB: I->getOperand(i: 0).getMBB(), Visited&: VisitedBBs);
817 if (LoopInst)
818 return std::make_unique<HexagonPipelinerLoopInfo>(args&: LoopInst, args: &*I);
819 }
820 return nullptr;
821}
822
823bool HexagonInstrInfo::isProfitableToIfCvt(MachineBasicBlock &MBB,
824 unsigned NumCycles, unsigned ExtraPredCycles,
825 BranchProbability Probability) const {
826 return nonDbgBBSize(BB: &MBB) <= 3;
827}
828
829bool HexagonInstrInfo::isProfitableToIfCvt(MachineBasicBlock &TMBB,
830 unsigned NumTCycles, unsigned ExtraTCycles, MachineBasicBlock &FMBB,
831 unsigned NumFCycles, unsigned ExtraFCycles, BranchProbability Probability)
832 const {
833 return nonDbgBBSize(BB: &TMBB) <= 3 && nonDbgBBSize(BB: &FMBB) <= 3;
834}
835
836bool HexagonInstrInfo::isProfitableToDupForIfCvt(MachineBasicBlock &MBB,
837 unsigned NumInstrs, BranchProbability Probability) const {
838 return NumInstrs <= 4;
839}
840
841static void getLiveInRegsAt(LivePhysRegs &Regs, const MachineInstr &MI) {
842 SmallVector<std::pair<MCPhysReg, const MachineOperand*>,2> Clobbers;
843 const MachineBasicBlock &B = *MI.getParent();
844 Regs.addLiveIns(MBB: B);
845 auto E = MachineBasicBlock::const_iterator(MI.getIterator());
846 for (auto I = B.begin(); I != E; ++I) {
847 Clobbers.clear();
848 Regs.stepForward(MI: *I, Clobbers);
849 }
850}
851
852static void getLiveOutRegsAt(LivePhysRegs &Regs, const MachineInstr &MI) {
853 const MachineBasicBlock &B = *MI.getParent();
854 Regs.addLiveOuts(MBB: B);
855 auto E = ++MachineBasicBlock::const_iterator(MI.getIterator()).getReverse();
856 for (auto I = B.rbegin(); I != E; ++I)
857 Regs.stepBackward(MI: *I);
858}
859
860void HexagonInstrInfo::copyPhysReg(MachineBasicBlock &MBB,
861 MachineBasicBlock::iterator I,
862 const DebugLoc &DL, Register DestReg,
863 Register SrcReg, bool KillSrc,
864 bool RenamableDest,
865 bool RenamableSrc) const {
866 const HexagonRegisterInfo &HRI = *Subtarget.getRegisterInfo();
867 RegState KillFlag = getKillRegState(B: KillSrc);
868
869 if (Hexagon::IntRegsRegClass.contains(Reg1: SrcReg, Reg2: DestReg)) {
870 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfr), DestReg)
871 .addReg(RegNo: SrcReg, Flags: KillFlag);
872 return;
873 }
874 if (Hexagon::DoubleRegsRegClass.contains(Reg1: SrcReg, Reg2: DestReg)) {
875 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfrp), DestReg)
876 .addReg(RegNo: SrcReg, Flags: KillFlag);
877 return;
878 }
879 if (Hexagon::PredRegsRegClass.contains(Reg1: SrcReg, Reg2: DestReg)) {
880 // Map Pd = Ps to Pd = or(Ps, Ps).
881 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::C2_or), DestReg)
882 .addReg(RegNo: SrcReg).addReg(RegNo: SrcReg, Flags: KillFlag);
883 return;
884 }
885 if (Hexagon::CtrRegsRegClass.contains(Reg: DestReg) &&
886 Hexagon::IntRegsRegClass.contains(Reg: SrcReg)) {
887 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfrrcr), DestReg)
888 .addReg(RegNo: SrcReg, Flags: KillFlag);
889 return;
890 }
891 if (Hexagon::IntRegsRegClass.contains(Reg: DestReg) &&
892 Hexagon::CtrRegsRegClass.contains(Reg: SrcReg)) {
893 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfrcrr), DestReg)
894 .addReg(RegNo: SrcReg, Flags: KillFlag);
895 return;
896 }
897 if (Hexagon::ModRegsRegClass.contains(Reg: DestReg) &&
898 Hexagon::IntRegsRegClass.contains(Reg: SrcReg)) {
899 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfrrcr), DestReg)
900 .addReg(RegNo: SrcReg, Flags: KillFlag);
901 return;
902 }
903 if (Hexagon::PredRegsRegClass.contains(Reg: SrcReg) &&
904 Hexagon::IntRegsRegClass.contains(Reg: DestReg)) {
905 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::C2_tfrpr), DestReg)
906 .addReg(RegNo: SrcReg, Flags: KillFlag);
907 return;
908 }
909 if (Hexagon::IntRegsRegClass.contains(Reg: SrcReg) &&
910 Hexagon::PredRegsRegClass.contains(Reg: DestReg)) {
911 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::C2_tfrrp), DestReg)
912 .addReg(RegNo: SrcReg, Flags: KillFlag);
913 return;
914 }
915 if (Hexagon::PredRegsRegClass.contains(Reg: SrcReg) &&
916 Hexagon::IntRegsRegClass.contains(Reg: DestReg)) {
917 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::C2_tfrpr), DestReg)
918 .addReg(RegNo: SrcReg, Flags: KillFlag);
919 return;
920 }
921 if (Hexagon::HvxVRRegClass.contains(Reg1: SrcReg, Reg2: DestReg)) {
922 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vassign), DestReg).
923 addReg(RegNo: SrcReg, Flags: KillFlag);
924 return;
925 }
926 if (Hexagon::HvxWRRegClass.contains(Reg1: SrcReg, Reg2: DestReg)) {
927 LivePhysRegs LiveAtMI(HRI);
928 getLiveInRegsAt(Regs&: LiveAtMI, MI: *I);
929 Register SrcLo = HRI.getSubReg(Reg: SrcReg, Idx: Hexagon::vsub_lo);
930 Register SrcHi = HRI.getSubReg(Reg: SrcReg, Idx: Hexagon::vsub_hi);
931 RegState UndefLo = getUndefRegState(B: !LiveAtMI.contains(Reg: SrcLo));
932 RegState UndefHi = getUndefRegState(B: !LiveAtMI.contains(Reg: SrcHi));
933 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vcombine), DestReg)
934 .addReg(RegNo: SrcHi, Flags: KillFlag | UndefHi)
935 .addReg(RegNo: SrcLo, Flags: KillFlag | UndefLo);
936 return;
937 }
938 if (Hexagon::HvxQRRegClass.contains(Reg1: SrcReg, Reg2: DestReg)) {
939 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::V6_pred_and), DestReg)
940 .addReg(RegNo: SrcReg)
941 .addReg(RegNo: SrcReg, Flags: KillFlag);
942 return;
943 }
944 if (Hexagon::HvxQRRegClass.contains(Reg: SrcReg) &&
945 Hexagon::HvxVRRegClass.contains(Reg: DestReg)) {
946 llvm_unreachable("Unimplemented pred to vec");
947 return;
948 }
949 if (Hexagon::HvxQRRegClass.contains(Reg: DestReg) &&
950 Hexagon::HvxVRRegClass.contains(Reg: SrcReg)) {
951 llvm_unreachable("Unimplemented vec to pred");
952 return;
953 }
954
955#ifndef NDEBUG
956 // Show the invalid registers to ease debugging.
957 dbgs() << "Invalid registers for copy in " << printMBBReference(MBB) << ": "
958 << printReg(DestReg, &HRI) << " = " << printReg(SrcReg, &HRI) << '\n';
959#endif
960 llvm_unreachable("Unimplemented");
961}
962
963void HexagonInstrInfo::storeRegToStackSlot(MachineBasicBlock &MBB,
964 MachineBasicBlock::iterator I,
965 Register SrcReg, bool isKill, int FI,
966 const TargetRegisterClass *RC,
967 Register VReg,
968 MachineInstr::MIFlag Flags) const {
969 DebugLoc DL = MBB.findDebugLoc(MBBI: I);
970 MachineFunction &MF = *MBB.getParent();
971 MachineFrameInfo &MFI = MF.getFrameInfo();
972 RegState KillFlag = getKillRegState(B: isKill);
973
974 MachineMemOperand *MMO = MF.getMachineMemOperand(
975 PtrInfo: MachinePointerInfo::getFixedStack(MF, FI), F: MachineMemOperand::MOStore,
976 Size: MFI.getObjectSize(ObjectIdx: FI), BaseAlignment: MFI.getObjectAlign(ObjectIdx: FI));
977
978 if (Hexagon::IntRegsRegClass.hasSubClassEq(RC)) {
979 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::S2_storeri_io))
980 .addFrameIndex(Idx: FI).addImm(Val: 0)
981 .addReg(RegNo: SrcReg, Flags: KillFlag).addMemOperand(MMO);
982 } else if (Hexagon::DoubleRegsRegClass.hasSubClassEq(RC)) {
983 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::S2_storerd_io))
984 .addFrameIndex(Idx: FI).addImm(Val: 0)
985 .addReg(RegNo: SrcReg, Flags: KillFlag).addMemOperand(MMO);
986 } else if (Hexagon::PredRegsRegClass.hasSubClassEq(RC)) {
987 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::STriw_pred))
988 .addFrameIndex(Idx: FI).addImm(Val: 0)
989 .addReg(RegNo: SrcReg, Flags: KillFlag).addMemOperand(MMO);
990 } else if (Hexagon::ModRegsRegClass.hasSubClassEq(RC)) {
991 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::STriw_ctr))
992 .addFrameIndex(Idx: FI).addImm(Val: 0)
993 .addReg(RegNo: SrcReg, Flags: KillFlag).addMemOperand(MMO);
994 } else if (Hexagon::HvxQRRegClass.hasSubClassEq(RC)) {
995 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::PS_vstorerq_ai))
996 .addFrameIndex(Idx: FI).addImm(Val: 0)
997 .addReg(RegNo: SrcReg, Flags: KillFlag).addMemOperand(MMO);
998 } else if (Hexagon::HvxVRRegClass.hasSubClassEq(RC)) {
999 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::PS_vstorerv_ai))
1000 .addFrameIndex(Idx: FI).addImm(Val: 0)
1001 .addReg(RegNo: SrcReg, Flags: KillFlag).addMemOperand(MMO);
1002 } else if (Hexagon::HvxWRRegClass.hasSubClassEq(RC)) {
1003 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::PS_vstorerw_ai))
1004 .addFrameIndex(Idx: FI).addImm(Val: 0)
1005 .addReg(RegNo: SrcReg, Flags: KillFlag).addMemOperand(MMO);
1006 } else {
1007 llvm_unreachable("Unimplemented");
1008 }
1009}
1010
1011void HexagonInstrInfo::loadRegFromStackSlot(MachineBasicBlock &MBB,
1012 MachineBasicBlock::iterator I,
1013 Register DestReg, int FI,
1014 const TargetRegisterClass *RC,
1015 Register VReg, unsigned SubReg,
1016 MachineInstr::MIFlag Flags) const {
1017 DebugLoc DL = MBB.findDebugLoc(MBBI: I);
1018 MachineFunction &MF = *MBB.getParent();
1019 MachineFrameInfo &MFI = MF.getFrameInfo();
1020
1021 MachineMemOperand *MMO = MF.getMachineMemOperand(
1022 PtrInfo: MachinePointerInfo::getFixedStack(MF, FI), F: MachineMemOperand::MOLoad,
1023 Size: MFI.getObjectSize(ObjectIdx: FI), BaseAlignment: MFI.getObjectAlign(ObjectIdx: FI));
1024
1025 if (Hexagon::IntRegsRegClass.hasSubClassEq(RC)) {
1026 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::L2_loadri_io), DestReg)
1027 .addFrameIndex(Idx: FI).addImm(Val: 0).addMemOperand(MMO);
1028 } else if (Hexagon::DoubleRegsRegClass.hasSubClassEq(RC)) {
1029 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::L2_loadrd_io), DestReg)
1030 .addFrameIndex(Idx: FI).addImm(Val: 0).addMemOperand(MMO);
1031 } else if (Hexagon::PredRegsRegClass.hasSubClassEq(RC)) {
1032 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::LDriw_pred), DestReg)
1033 .addFrameIndex(Idx: FI).addImm(Val: 0).addMemOperand(MMO);
1034 } else if (Hexagon::ModRegsRegClass.hasSubClassEq(RC)) {
1035 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::LDriw_ctr), DestReg)
1036 .addFrameIndex(Idx: FI).addImm(Val: 0).addMemOperand(MMO);
1037 } else if (Hexagon::HvxQRRegClass.hasSubClassEq(RC)) {
1038 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::PS_vloadrq_ai), DestReg)
1039 .addFrameIndex(Idx: FI).addImm(Val: 0).addMemOperand(MMO);
1040 } else if (Hexagon::HvxVRRegClass.hasSubClassEq(RC)) {
1041 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::PS_vloadrv_ai), DestReg)
1042 .addFrameIndex(Idx: FI).addImm(Val: 0).addMemOperand(MMO);
1043 } else if (Hexagon::HvxWRRegClass.hasSubClassEq(RC)) {
1044 BuildMI(BB&: MBB, I, MIMD: DL, MCID: get(Opcode: Hexagon::PS_vloadrw_ai), DestReg)
1045 .addFrameIndex(Idx: FI).addImm(Val: 0).addMemOperand(MMO);
1046 } else {
1047 llvm_unreachable("Can't store this register to stack slot");
1048 }
1049}
1050
1051/// expandPostRAPseudo - This function is called for all pseudo instructions
1052/// that remain after register allocation. Many pseudo instructions are
1053/// created to help register allocation. This is the place to convert them
1054/// into real instructions. The target can edit MI in place, or it can insert
1055/// new instructions and erase MI. The function should return true if
1056/// anything was changed.
1057bool HexagonInstrInfo::expandPostRAPseudo(MachineInstr &MI) const {
1058 MachineBasicBlock &MBB = *MI.getParent();
1059 MachineFunction &MF = *MBB.getParent();
1060 MachineRegisterInfo &MRI = MF.getRegInfo();
1061 const HexagonRegisterInfo &HRI = *Subtarget.getRegisterInfo();
1062 LivePhysRegs LiveIn(HRI), LiveOut(HRI);
1063 DebugLoc DL = MI.getDebugLoc();
1064 unsigned Opc = MI.getOpcode();
1065
1066 auto RealCirc = [&](unsigned Opc, bool HasImm, unsigned MxOp) {
1067 Register Mx = MI.getOperand(i: MxOp).getReg();
1068 Register CSx = (Mx == Hexagon::M0 ? Hexagon::CS0 : Hexagon::CS1);
1069 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfrrcr), DestReg: CSx)
1070 .add(MO: MI.getOperand(i: (HasImm ? 5 : 4)));
1071 auto MIB = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Opc)).add(MO: MI.getOperand(i: 0))
1072 .add(MO: MI.getOperand(i: 1)).add(MO: MI.getOperand(i: 2)).add(MO: MI.getOperand(i: 3));
1073 if (HasImm)
1074 MIB.add(MO: MI.getOperand(i: 4));
1075 MIB.addReg(RegNo: CSx, Flags: RegState::Implicit);
1076 MBB.erase(I: MI);
1077 return true;
1078 };
1079
1080 auto UseAligned = [&](const MachineInstr &MI, Align NeedAlign) {
1081 if (MI.memoperands().empty())
1082 return false;
1083 return all_of(Range: MI.memoperands(), P: [NeedAlign](const MachineMemOperand *MMO) {
1084 return MMO->getAlign() >= NeedAlign;
1085 });
1086 };
1087
1088 switch (Opc) {
1089 case Hexagon::PS_call_instrprof_custom: {
1090 auto Op0 = MI.getOperand(i: 0);
1091 assert(Op0.isGlobal() &&
1092 "First operand must be a global containing handler name.");
1093 const GlobalValue *NameVar = Op0.getGlobal();
1094 const GlobalVariable *GV = dyn_cast<GlobalVariable>(Val: NameVar);
1095 auto *Arr = cast<ConstantDataArray>(Val: GV->getInitializer());
1096 StringRef NameStr = Arr->isCString() ? Arr->getAsCString() : Arr->getAsString();
1097
1098 MachineOperand &Op1 = MI.getOperand(i: 1);
1099 // Set R0 with the imm value to be passed to the custom profiling handler.
1100 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfrsi), DestReg: Hexagon::R0)
1101 .addImm(Val: Op1.getImm());
1102 // The call to the custom handler is being treated as a special one as the
1103 // callee is responsible for saving and restoring all the registers
1104 // (including caller saved registers) it needs to modify. This is
1105 // done to reduce the impact of instrumentation on the code being
1106 // instrumented/profiled.
1107 // NOTE: R14, R15 and R28 are reserved for PLT handling. These registers
1108 // are in the Def list of the Hexagon::PS_call_instrprof_custom and
1109 // therefore will be handled appropriately duing register allocation.
1110
1111 // TODO: It may be a good idea to add a separate pseudo instruction for
1112 // static relocation which doesn't need to reserve r14, r15 and r28.
1113
1114 auto MIB = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::J2_call))
1115 .addUse(RegNo: Hexagon::R0, Flags: RegState::Implicit|RegState::InternalRead)
1116 .addDef(RegNo: Hexagon::R29, Flags: RegState::ImplicitDefine)
1117 .addDef(RegNo: Hexagon::R30, Flags: RegState::ImplicitDefine)
1118 .addDef(RegNo: Hexagon::R14, Flags: RegState::ImplicitDefine)
1119 .addDef(RegNo: Hexagon::R15, Flags: RegState::ImplicitDefine)
1120 .addDef(RegNo: Hexagon::R28, Flags: RegState::ImplicitDefine);
1121 const char *cstr = MF.createExternalSymbolName(Name: NameStr);
1122 MIB.addExternalSymbol(FnName: cstr);
1123 MBB.erase(I: MI);
1124 return true;
1125 }
1126 case TargetOpcode::COPY: {
1127 MachineOperand &MD = MI.getOperand(i: 0);
1128 MachineOperand &MS = MI.getOperand(i: 1);
1129 MachineBasicBlock::iterator MBBI = MI.getIterator();
1130 if (MD.getReg() != MS.getReg() && !MS.isUndef()) {
1131 copyPhysReg(MBB, I: MI, DL, DestReg: MD.getReg(), SrcReg: MS.getReg(), KillSrc: MS.isKill());
1132 std::prev(x: MBBI)->copyImplicitOps(MF&: *MBB.getParent(), MI);
1133 }
1134 MBB.erase(I: MBBI);
1135 return true;
1136 }
1137 case Hexagon::PS_aligna:
1138 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::A2_andir), DestReg: MI.getOperand(i: 0).getReg())
1139 .addReg(RegNo: HRI.getFrameRegister())
1140 .addImm(Val: -MI.getOperand(i: 1).getImm());
1141 MBB.erase(I: MI);
1142 return true;
1143 case Hexagon::V6_vassignp: {
1144 Register SrcReg = MI.getOperand(i: 1).getReg();
1145 Register DstReg = MI.getOperand(i: 0).getReg();
1146 Register SrcLo = HRI.getSubReg(Reg: SrcReg, Idx: Hexagon::vsub_lo);
1147 Register SrcHi = HRI.getSubReg(Reg: SrcReg, Idx: Hexagon::vsub_hi);
1148 getLiveInRegsAt(Regs&: LiveIn, MI);
1149 RegState UndefLo = getUndefRegState(B: !LiveIn.contains(Reg: SrcLo));
1150 RegState UndefHi = getUndefRegState(B: !LiveIn.contains(Reg: SrcHi));
1151 RegState Kill = getKillRegState(B: MI.getOperand(i: 1).isKill());
1152 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vcombine), DestReg: DstReg)
1153 .addReg(RegNo: SrcHi, Flags: UndefHi)
1154 .addReg(RegNo: SrcLo, Flags: Kill | UndefLo);
1155 MBB.erase(I: MI);
1156 return true;
1157 }
1158 case Hexagon::V6_lo: {
1159 Register SrcReg = MI.getOperand(i: 1).getReg();
1160 Register DstReg = MI.getOperand(i: 0).getReg();
1161 Register SrcSubLo = HRI.getSubReg(Reg: SrcReg, Idx: Hexagon::vsub_lo);
1162 copyPhysReg(MBB, I: MI, DL, DestReg: DstReg, SrcReg: SrcSubLo, KillSrc: MI.getOperand(i: 1).isKill());
1163 MBB.erase(I: MI);
1164 MRI.clearKillFlags(Reg: SrcSubLo);
1165 return true;
1166 }
1167 case Hexagon::V6_hi: {
1168 Register SrcReg = MI.getOperand(i: 1).getReg();
1169 Register DstReg = MI.getOperand(i: 0).getReg();
1170 Register SrcSubHi = HRI.getSubReg(Reg: SrcReg, Idx: Hexagon::vsub_hi);
1171 copyPhysReg(MBB, I: MI, DL, DestReg: DstReg, SrcReg: SrcSubHi, KillSrc: MI.getOperand(i: 1).isKill());
1172 MBB.erase(I: MI);
1173 MRI.clearKillFlags(Reg: SrcSubHi);
1174 return true;
1175 }
1176 case Hexagon::PS_vloadrv_ai: {
1177 Register DstReg = MI.getOperand(i: 0).getReg();
1178 const MachineOperand &BaseOp = MI.getOperand(i: 1);
1179 assert(BaseOp.getSubReg() == 0);
1180 int Offset = MI.getOperand(i: 2).getImm();
1181 Align NeedAlign = HRI.getSpillAlign(RC: Hexagon::HvxVRRegClass);
1182 unsigned NewOpc = UseAligned(MI, NeedAlign) ? Hexagon::V6_vL32b_ai
1183 : Hexagon::V6_vL32Ub_ai;
1184 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: NewOpc), DestReg: DstReg)
1185 .addReg(RegNo: BaseOp.getReg(), Flags: getRegState(RegOp: BaseOp))
1186 .addImm(Val: Offset)
1187 .cloneMemRefs(OtherMI: MI);
1188 MBB.erase(I: MI);
1189 return true;
1190 }
1191 case Hexagon::PS_vloadrw_ai: {
1192 Register DstReg = MI.getOperand(i: 0).getReg();
1193 const MachineOperand &BaseOp = MI.getOperand(i: 1);
1194 assert(BaseOp.getSubReg() == 0);
1195 int Offset = MI.getOperand(i: 2).getImm();
1196 unsigned VecOffset = HRI.getSpillSize(RC: Hexagon::HvxVRRegClass);
1197 Align NeedAlign = HRI.getSpillAlign(RC: Hexagon::HvxVRRegClass);
1198 unsigned NewOpc = UseAligned(MI, NeedAlign) ? Hexagon::V6_vL32b_ai
1199 : Hexagon::V6_vL32Ub_ai;
1200 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: NewOpc),
1201 DestReg: HRI.getSubReg(Reg: DstReg, Idx: Hexagon::vsub_lo))
1202 .addReg(RegNo: BaseOp.getReg(), Flags: getRegState(RegOp: BaseOp) & ~RegState::Kill)
1203 .addImm(Val: Offset)
1204 .cloneMemRefs(OtherMI: MI);
1205 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: NewOpc),
1206 DestReg: HRI.getSubReg(Reg: DstReg, Idx: Hexagon::vsub_hi))
1207 .addReg(RegNo: BaseOp.getReg(), Flags: getRegState(RegOp: BaseOp))
1208 .addImm(Val: Offset + VecOffset)
1209 .cloneMemRefs(OtherMI: MI);
1210 MBB.erase(I: MI);
1211 return true;
1212 }
1213 case Hexagon::PS_vstorerv_ai: {
1214 const MachineOperand &SrcOp = MI.getOperand(i: 2);
1215 assert(SrcOp.getSubReg() == 0);
1216 const MachineOperand &BaseOp = MI.getOperand(i: 0);
1217 assert(BaseOp.getSubReg() == 0);
1218 int Offset = MI.getOperand(i: 1).getImm();
1219 Align NeedAlign = HRI.getSpillAlign(RC: Hexagon::HvxVRRegClass);
1220 unsigned NewOpc = UseAligned(MI, NeedAlign) ? Hexagon::V6_vS32b_ai
1221 : Hexagon::V6_vS32Ub_ai;
1222 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: NewOpc))
1223 .addReg(RegNo: BaseOp.getReg(), Flags: getRegState(RegOp: BaseOp))
1224 .addImm(Val: Offset)
1225 .addReg(RegNo: SrcOp.getReg(), Flags: getRegState(RegOp: SrcOp))
1226 .cloneMemRefs(OtherMI: MI);
1227 MBB.erase(I: MI);
1228 return true;
1229 }
1230 case Hexagon::PS_vstorerw_ai: {
1231 Register SrcReg = MI.getOperand(i: 2).getReg();
1232 const MachineOperand &BaseOp = MI.getOperand(i: 0);
1233 assert(BaseOp.getSubReg() == 0);
1234 int Offset = MI.getOperand(i: 1).getImm();
1235 unsigned VecOffset = HRI.getSpillSize(RC: Hexagon::HvxVRRegClass);
1236 Align NeedAlign = HRI.getSpillAlign(RC: Hexagon::HvxVRRegClass);
1237 unsigned NewOpc = UseAligned(MI, NeedAlign) ? Hexagon::V6_vS32b_ai
1238 : Hexagon::V6_vS32Ub_ai;
1239 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: NewOpc))
1240 .addReg(RegNo: BaseOp.getReg(), Flags: getRegState(RegOp: BaseOp) & ~RegState::Kill)
1241 .addImm(Val: Offset)
1242 .addReg(RegNo: HRI.getSubReg(Reg: SrcReg, Idx: Hexagon::vsub_lo))
1243 .cloneMemRefs(OtherMI: MI);
1244 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: NewOpc))
1245 .addReg(RegNo: BaseOp.getReg(), Flags: getRegState(RegOp: BaseOp))
1246 .addImm(Val: Offset + VecOffset)
1247 .addReg(RegNo: HRI.getSubReg(Reg: SrcReg, Idx: Hexagon::vsub_hi))
1248 .cloneMemRefs(OtherMI: MI);
1249 MBB.erase(I: MI);
1250 return true;
1251 }
1252 case Hexagon::PS_true: {
1253 Register Reg = MI.getOperand(i: 0).getReg();
1254 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::C2_orn), DestReg: Reg)
1255 .addReg(RegNo: Reg, Flags: RegState::Undef)
1256 .addReg(RegNo: Reg, Flags: RegState::Undef);
1257 MBB.erase(I: MI);
1258 return true;
1259 }
1260 case Hexagon::PS_false: {
1261 Register Reg = MI.getOperand(i: 0).getReg();
1262 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::C2_andn), DestReg: Reg)
1263 .addReg(RegNo: Reg, Flags: RegState::Undef)
1264 .addReg(RegNo: Reg, Flags: RegState::Undef);
1265 MBB.erase(I: MI);
1266 return true;
1267 }
1268 case Hexagon::PS_qtrue: {
1269 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_veqw), DestReg: MI.getOperand(i: 0).getReg())
1270 .addReg(RegNo: Hexagon::V0, Flags: RegState::Undef)
1271 .addReg(RegNo: Hexagon::V0, Flags: RegState::Undef);
1272 MBB.erase(I: MI);
1273 return true;
1274 }
1275 case Hexagon::PS_qfalse: {
1276 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vgtw), DestReg: MI.getOperand(i: 0).getReg())
1277 .addReg(RegNo: Hexagon::V0, Flags: RegState::Undef)
1278 .addReg(RegNo: Hexagon::V0, Flags: RegState::Undef);
1279 MBB.erase(I: MI);
1280 return true;
1281 }
1282 case Hexagon::PS_vdd0: {
1283 Register Vd = MI.getOperand(i: 0).getReg();
1284 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vsubw_dv), DestReg: Vd)
1285 .addReg(RegNo: Vd, Flags: RegState::Undef)
1286 .addReg(RegNo: Vd, Flags: RegState::Undef);
1287 MBB.erase(I: MI);
1288 return true;
1289 }
1290 case Hexagon::PS_vmulw: {
1291 // Expand a 64-bit vector multiply into 2 32-bit scalar multiplies.
1292 Register DstReg = MI.getOperand(i: 0).getReg();
1293 Register Src1Reg = MI.getOperand(i: 1).getReg();
1294 Register Src2Reg = MI.getOperand(i: 2).getReg();
1295 Register Src1SubHi = HRI.getSubReg(Reg: Src1Reg, Idx: Hexagon::isub_hi);
1296 Register Src1SubLo = HRI.getSubReg(Reg: Src1Reg, Idx: Hexagon::isub_lo);
1297 Register Src2SubHi = HRI.getSubReg(Reg: Src2Reg, Idx: Hexagon::isub_hi);
1298 Register Src2SubLo = HRI.getSubReg(Reg: Src2Reg, Idx: Hexagon::isub_lo);
1299 BuildMI(BB&: MBB, I&: MI, MIMD: MI.getDebugLoc(), MCID: get(Opcode: Hexagon::M2_mpyi),
1300 DestReg: HRI.getSubReg(Reg: DstReg, Idx: Hexagon::isub_hi))
1301 .addReg(RegNo: Src1SubHi)
1302 .addReg(RegNo: Src2SubHi);
1303 BuildMI(BB&: MBB, I&: MI, MIMD: MI.getDebugLoc(), MCID: get(Opcode: Hexagon::M2_mpyi),
1304 DestReg: HRI.getSubReg(Reg: DstReg, Idx: Hexagon::isub_lo))
1305 .addReg(RegNo: Src1SubLo)
1306 .addReg(RegNo: Src2SubLo);
1307 MBB.erase(I: MI);
1308 MRI.clearKillFlags(Reg: Src1SubHi);
1309 MRI.clearKillFlags(Reg: Src1SubLo);
1310 MRI.clearKillFlags(Reg: Src2SubHi);
1311 MRI.clearKillFlags(Reg: Src2SubLo);
1312 return true;
1313 }
1314 case Hexagon::PS_vmulw_acc: {
1315 // Expand 64-bit vector multiply with addition into 2 scalar multiplies.
1316 Register DstReg = MI.getOperand(i: 0).getReg();
1317 Register Src1Reg = MI.getOperand(i: 1).getReg();
1318 Register Src2Reg = MI.getOperand(i: 2).getReg();
1319 Register Src3Reg = MI.getOperand(i: 3).getReg();
1320 Register Src1SubHi = HRI.getSubReg(Reg: Src1Reg, Idx: Hexagon::isub_hi);
1321 Register Src1SubLo = HRI.getSubReg(Reg: Src1Reg, Idx: Hexagon::isub_lo);
1322 Register Src2SubHi = HRI.getSubReg(Reg: Src2Reg, Idx: Hexagon::isub_hi);
1323 Register Src2SubLo = HRI.getSubReg(Reg: Src2Reg, Idx: Hexagon::isub_lo);
1324 Register Src3SubHi = HRI.getSubReg(Reg: Src3Reg, Idx: Hexagon::isub_hi);
1325 Register Src3SubLo = HRI.getSubReg(Reg: Src3Reg, Idx: Hexagon::isub_lo);
1326 BuildMI(BB&: MBB, I&: MI, MIMD: MI.getDebugLoc(), MCID: get(Opcode: Hexagon::M2_maci),
1327 DestReg: HRI.getSubReg(Reg: DstReg, Idx: Hexagon::isub_hi))
1328 .addReg(RegNo: Src1SubHi)
1329 .addReg(RegNo: Src2SubHi)
1330 .addReg(RegNo: Src3SubHi);
1331 BuildMI(BB&: MBB, I&: MI, MIMD: MI.getDebugLoc(), MCID: get(Opcode: Hexagon::M2_maci),
1332 DestReg: HRI.getSubReg(Reg: DstReg, Idx: Hexagon::isub_lo))
1333 .addReg(RegNo: Src1SubLo)
1334 .addReg(RegNo: Src2SubLo)
1335 .addReg(RegNo: Src3SubLo);
1336 MBB.erase(I: MI);
1337 MRI.clearKillFlags(Reg: Src1SubHi);
1338 MRI.clearKillFlags(Reg: Src1SubLo);
1339 MRI.clearKillFlags(Reg: Src2SubHi);
1340 MRI.clearKillFlags(Reg: Src2SubLo);
1341 MRI.clearKillFlags(Reg: Src3SubHi);
1342 MRI.clearKillFlags(Reg: Src3SubLo);
1343 return true;
1344 }
1345 case Hexagon::PS_pselect: {
1346 const MachineOperand &Op0 = MI.getOperand(i: 0);
1347 const MachineOperand &Op1 = MI.getOperand(i: 1);
1348 const MachineOperand &Op2 = MI.getOperand(i: 2);
1349 const MachineOperand &Op3 = MI.getOperand(i: 3);
1350 Register Rd = Op0.getReg();
1351 Register Pu = Op1.getReg();
1352 Register Rs = Op2.getReg();
1353 Register Rt = Op3.getReg();
1354 DebugLoc DL = MI.getDebugLoc();
1355 RegState K1 = getKillRegState(B: Op1.isKill());
1356 RegState K2 = getKillRegState(B: Op2.isKill());
1357 RegState K3 = getKillRegState(B: Op3.isKill());
1358 if (Rd != Rs)
1359 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfrpt), DestReg: Rd)
1360 .addReg(RegNo: Pu, Flags: (Rd == Rt) ? K1 : RegState::NoFlags)
1361 .addReg(RegNo: Rs, Flags: K2);
1362 if (Rd != Rt)
1363 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::A2_tfrpf), DestReg: Rd)
1364 .addReg(RegNo: Pu, Flags: K1)
1365 .addReg(RegNo: Rt, Flags: K3);
1366 MBB.erase(I: MI);
1367 return true;
1368 }
1369 case Hexagon::PS_vselect: {
1370 const MachineOperand &Op0 = MI.getOperand(i: 0);
1371 const MachineOperand &Op1 = MI.getOperand(i: 1);
1372 const MachineOperand &Op2 = MI.getOperand(i: 2);
1373 const MachineOperand &Op3 = MI.getOperand(i: 3);
1374 getLiveOutRegsAt(Regs&: LiveOut, MI);
1375 bool IsDestLive = !LiveOut.available(MRI, Reg: Op0.getReg());
1376 Register PReg = Op1.getReg();
1377 assert(Op1.getSubReg() == 0);
1378 RegState PState = getRegState(RegOp: Op1);
1379
1380 if (Op0.getReg() != Op2.getReg()) {
1381 RegState S =
1382 Op0.getReg() != Op3.getReg() ? PState & ~RegState::Kill : PState;
1383 auto T = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vcmov))
1384 .add(MO: Op0)
1385 .addReg(RegNo: PReg, Flags: S)
1386 .add(MO: Op2);
1387 if (IsDestLive)
1388 T.addReg(RegNo: Op0.getReg(), Flags: RegState::Implicit);
1389 IsDestLive = true;
1390 }
1391 if (Op0.getReg() != Op3.getReg()) {
1392 auto T = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vncmov))
1393 .add(MO: Op0)
1394 .addReg(RegNo: PReg, Flags: PState)
1395 .add(MO: Op3);
1396 if (IsDestLive)
1397 T.addReg(RegNo: Op0.getReg(), Flags: RegState::Implicit);
1398 }
1399 MBB.erase(I: MI);
1400 return true;
1401 }
1402 case Hexagon::PS_wselect: {
1403 MachineOperand &Op0 = MI.getOperand(i: 0);
1404 MachineOperand &Op1 = MI.getOperand(i: 1);
1405 MachineOperand &Op2 = MI.getOperand(i: 2);
1406 MachineOperand &Op3 = MI.getOperand(i: 3);
1407 getLiveOutRegsAt(Regs&: LiveOut, MI);
1408 bool IsDestLive = !LiveOut.available(MRI, Reg: Op0.getReg());
1409 Register PReg = Op1.getReg();
1410 assert(Op1.getSubReg() == 0);
1411 RegState PState = getRegState(RegOp: Op1);
1412
1413 if (Op0.getReg() != Op2.getReg()) {
1414 RegState S =
1415 Op0.getReg() != Op3.getReg() ? PState & ~RegState::Kill : PState;
1416 Register SrcLo = HRI.getSubReg(Reg: Op2.getReg(), Idx: Hexagon::vsub_lo);
1417 Register SrcHi = HRI.getSubReg(Reg: Op2.getReg(), Idx: Hexagon::vsub_hi);
1418 auto T = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vccombine))
1419 .add(MO: Op0)
1420 .addReg(RegNo: PReg, Flags: S)
1421 .addReg(RegNo: SrcHi)
1422 .addReg(RegNo: SrcLo);
1423 if (IsDestLive)
1424 T.addReg(RegNo: Op0.getReg(), Flags: RegState::Implicit);
1425 IsDestLive = true;
1426 }
1427 if (Op0.getReg() != Op3.getReg()) {
1428 Register SrcLo = HRI.getSubReg(Reg: Op3.getReg(), Idx: Hexagon::vsub_lo);
1429 Register SrcHi = HRI.getSubReg(Reg: Op3.getReg(), Idx: Hexagon::vsub_hi);
1430 auto T = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vnccombine))
1431 .add(MO: Op0)
1432 .addReg(RegNo: PReg, Flags: PState)
1433 .addReg(RegNo: SrcHi)
1434 .addReg(RegNo: SrcLo);
1435 if (IsDestLive)
1436 T.addReg(RegNo: Op0.getReg(), Flags: RegState::Implicit);
1437 }
1438 MBB.erase(I: MI);
1439 return true;
1440 }
1441
1442 case Hexagon::PS_crash: {
1443 // Generate a misaligned load that is guaranteed to cause a crash.
1444 class CrashPseudoSourceValue : public PseudoSourceValue {
1445 public:
1446 CrashPseudoSourceValue(const TargetMachine &TM)
1447 : PseudoSourceValue(TargetCustom, TM) {}
1448
1449 bool isConstant(const MachineFrameInfo *) const override {
1450 return false;
1451 }
1452 bool isAliased(const MachineFrameInfo *) const override {
1453 return false;
1454 }
1455 bool mayAlias(const MachineFrameInfo *) const override {
1456 return false;
1457 }
1458 void printCustom(raw_ostream &OS) const override {
1459 OS << "MisalignedCrash";
1460 }
1461 };
1462
1463 static const CrashPseudoSourceValue CrashPSV(MF.getTarget());
1464 MachineMemOperand *MMO = MF.getMachineMemOperand(
1465 PtrInfo: MachinePointerInfo(&CrashPSV),
1466 F: MachineMemOperand::MOLoad | MachineMemOperand::MOVolatile, Size: 8,
1467 BaseAlignment: Align(1));
1468 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::PS_loadrdabs), DestReg: Hexagon::D13)
1469 .addImm(Val: 0xBADC0FEE) // Misaligned load.
1470 .addMemOperand(MMO);
1471 MBB.erase(I: MI);
1472 return true;
1473 }
1474
1475 case Hexagon::PS_tailcall_i:
1476 MI.setDesc(get(Opcode: Hexagon::J2_jump));
1477 return true;
1478 case Hexagon::PS_tailcall_r:
1479 case Hexagon::PS_jmpret:
1480 MI.setDesc(get(Opcode: Hexagon::J2_jumpr));
1481 return true;
1482 case Hexagon::PS_jmprett:
1483 MI.setDesc(get(Opcode: Hexagon::J2_jumprt));
1484 return true;
1485 case Hexagon::PS_jmpretf:
1486 MI.setDesc(get(Opcode: Hexagon::J2_jumprf));
1487 return true;
1488 case Hexagon::PS_jmprettnewpt:
1489 MI.setDesc(get(Opcode: Hexagon::J2_jumprtnewpt));
1490 return true;
1491 case Hexagon::PS_jmpretfnewpt:
1492 MI.setDesc(get(Opcode: Hexagon::J2_jumprfnewpt));
1493 return true;
1494 case Hexagon::PS_jmprettnew:
1495 MI.setDesc(get(Opcode: Hexagon::J2_jumprtnew));
1496 return true;
1497 case Hexagon::PS_jmpretfnew:
1498 MI.setDesc(get(Opcode: Hexagon::J2_jumprfnew));
1499 return true;
1500
1501 case Hexagon::PS_loadrub_pci:
1502 return RealCirc(Hexagon::L2_loadrub_pci, /*HasImm*/true, /*MxOp*/4);
1503 case Hexagon::PS_loadrb_pci:
1504 return RealCirc(Hexagon::L2_loadrb_pci, /*HasImm*/true, /*MxOp*/4);
1505 case Hexagon::PS_loadruh_pci:
1506 return RealCirc(Hexagon::L2_loadruh_pci, /*HasImm*/true, /*MxOp*/4);
1507 case Hexagon::PS_loadrh_pci:
1508 return RealCirc(Hexagon::L2_loadrh_pci, /*HasImm*/true, /*MxOp*/4);
1509 case Hexagon::PS_loadri_pci:
1510 return RealCirc(Hexagon::L2_loadri_pci, /*HasImm*/true, /*MxOp*/4);
1511 case Hexagon::PS_loadrd_pci:
1512 return RealCirc(Hexagon::L2_loadrd_pci, /*HasImm*/true, /*MxOp*/4);
1513 case Hexagon::PS_loadrub_pcr:
1514 return RealCirc(Hexagon::L2_loadrub_pcr, /*HasImm*/false, /*MxOp*/3);
1515 case Hexagon::PS_loadrb_pcr:
1516 return RealCirc(Hexagon::L2_loadrb_pcr, /*HasImm*/false, /*MxOp*/3);
1517 case Hexagon::PS_loadruh_pcr:
1518 return RealCirc(Hexagon::L2_loadruh_pcr, /*HasImm*/false, /*MxOp*/3);
1519 case Hexagon::PS_loadrh_pcr:
1520 return RealCirc(Hexagon::L2_loadrh_pcr, /*HasImm*/false, /*MxOp*/3);
1521 case Hexagon::PS_loadri_pcr:
1522 return RealCirc(Hexagon::L2_loadri_pcr, /*HasImm*/false, /*MxOp*/3);
1523 case Hexagon::PS_loadrd_pcr:
1524 return RealCirc(Hexagon::L2_loadrd_pcr, /*HasImm*/false, /*MxOp*/3);
1525 case Hexagon::PS_storerb_pci:
1526 return RealCirc(Hexagon::S2_storerb_pci, /*HasImm*/true, /*MxOp*/3);
1527 case Hexagon::PS_storerh_pci:
1528 return RealCirc(Hexagon::S2_storerh_pci, /*HasImm*/true, /*MxOp*/3);
1529 case Hexagon::PS_storerf_pci:
1530 return RealCirc(Hexagon::S2_storerf_pci, /*HasImm*/true, /*MxOp*/3);
1531 case Hexagon::PS_storeri_pci:
1532 return RealCirc(Hexagon::S2_storeri_pci, /*HasImm*/true, /*MxOp*/3);
1533 case Hexagon::PS_storerd_pci:
1534 return RealCirc(Hexagon::S2_storerd_pci, /*HasImm*/true, /*MxOp*/3);
1535 case Hexagon::PS_storerb_pcr:
1536 return RealCirc(Hexagon::S2_storerb_pcr, /*HasImm*/false, /*MxOp*/2);
1537 case Hexagon::PS_storerh_pcr:
1538 return RealCirc(Hexagon::S2_storerh_pcr, /*HasImm*/false, /*MxOp*/2);
1539 case Hexagon::PS_storerf_pcr:
1540 return RealCirc(Hexagon::S2_storerf_pcr, /*HasImm*/false, /*MxOp*/2);
1541 case Hexagon::PS_storeri_pcr:
1542 return RealCirc(Hexagon::S2_storeri_pcr, /*HasImm*/false, /*MxOp*/2);
1543 case Hexagon::PS_storerd_pcr:
1544 return RealCirc(Hexagon::S2_storerd_pcr, /*HasImm*/false, /*MxOp*/2);
1545 }
1546
1547 return false;
1548}
1549
1550MachineBasicBlock::instr_iterator
1551HexagonInstrInfo::expandVGatherPseudo(MachineInstr &MI) const {
1552 MachineBasicBlock &MBB = *MI.getParent();
1553 const DebugLoc &DL = MI.getDebugLoc();
1554 unsigned Opc = MI.getOpcode();
1555 MachineBasicBlock::iterator First;
1556
1557 switch (Opc) {
1558 case Hexagon::V6_vgather_vscatter_mh_pseudo:
1559 // This is mainly a place holder. It will be extended.
1560 First = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vgathermh))
1561 .add(MO: MI.getOperand(i: 2))
1562 .add(MO: MI.getOperand(i: 3))
1563 .add(MO: MI.getOperand(i: 4));
1564 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vscattermh))
1565 .add(MO: MI.getOperand(i: 2))
1566 .add(MO: MI.getOperand(i: 3))
1567 .add(MO: MI.getOperand(i: 4))
1568 .addReg(RegNo: Hexagon::VTMP);
1569 MBB.erase(I: MI);
1570 return First.getInstrIterator();
1571 case Hexagon::V6_vgathermh_pseudo:
1572 First = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vgathermh))
1573 .add(MO: MI.getOperand(i: 2))
1574 .add(MO: MI.getOperand(i: 3))
1575 .add(MO: MI.getOperand(i: 4));
1576 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vS32b_new_ai))
1577 .add(MO: MI.getOperand(i: 0))
1578 .addImm(Val: MI.getOperand(i: 1).getImm())
1579 .addReg(RegNo: Hexagon::VTMP);
1580 MBB.erase(I: MI);
1581 return First.getInstrIterator();
1582
1583 case Hexagon::V6_vgathermw_pseudo:
1584 First = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vgathermw))
1585 .add(MO: MI.getOperand(i: 2))
1586 .add(MO: MI.getOperand(i: 3))
1587 .add(MO: MI.getOperand(i: 4));
1588 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vS32b_new_ai))
1589 .add(MO: MI.getOperand(i: 0))
1590 .addImm(Val: MI.getOperand(i: 1).getImm())
1591 .addReg(RegNo: Hexagon::VTMP);
1592 MBB.erase(I: MI);
1593 return First.getInstrIterator();
1594
1595 case Hexagon::V6_vgathermhw_pseudo:
1596 First = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vgathermhw))
1597 .add(MO: MI.getOperand(i: 2))
1598 .add(MO: MI.getOperand(i: 3))
1599 .add(MO: MI.getOperand(i: 4));
1600 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vS32b_new_ai))
1601 .add(MO: MI.getOperand(i: 0))
1602 .addImm(Val: MI.getOperand(i: 1).getImm())
1603 .addReg(RegNo: Hexagon::VTMP);
1604 MBB.erase(I: MI);
1605 return First.getInstrIterator();
1606
1607 case Hexagon::V6_vgathermhq_pseudo:
1608 First = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vgathermhq))
1609 .add(MO: MI.getOperand(i: 2))
1610 .add(MO: MI.getOperand(i: 3))
1611 .add(MO: MI.getOperand(i: 4))
1612 .add(MO: MI.getOperand(i: 5));
1613 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vS32b_new_ai))
1614 .add(MO: MI.getOperand(i: 0))
1615 .addImm(Val: MI.getOperand(i: 1).getImm())
1616 .addReg(RegNo: Hexagon::VTMP);
1617 MBB.erase(I: MI);
1618 return First.getInstrIterator();
1619
1620 case Hexagon::V6_vgathermwq_pseudo:
1621 First = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vgathermwq))
1622 .add(MO: MI.getOperand(i: 2))
1623 .add(MO: MI.getOperand(i: 3))
1624 .add(MO: MI.getOperand(i: 4))
1625 .add(MO: MI.getOperand(i: 5));
1626 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vS32b_new_ai))
1627 .add(MO: MI.getOperand(i: 0))
1628 .addImm(Val: MI.getOperand(i: 1).getImm())
1629 .addReg(RegNo: Hexagon::VTMP);
1630 MBB.erase(I: MI);
1631 return First.getInstrIterator();
1632
1633 case Hexagon::V6_vgathermhwq_pseudo:
1634 First = BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vgathermhwq))
1635 .add(MO: MI.getOperand(i: 2))
1636 .add(MO: MI.getOperand(i: 3))
1637 .add(MO: MI.getOperand(i: 4))
1638 .add(MO: MI.getOperand(i: 5));
1639 BuildMI(BB&: MBB, I&: MI, MIMD: DL, MCID: get(Opcode: Hexagon::V6_vS32b_new_ai))
1640 .add(MO: MI.getOperand(i: 0))
1641 .addImm(Val: MI.getOperand(i: 1).getImm())
1642 .addReg(RegNo: Hexagon::VTMP);
1643 MBB.erase(I: MI);
1644 return First.getInstrIterator();
1645 }
1646
1647 return MI.getIterator();
1648}
1649
1650// We indicate that we want to reverse the branch by
1651// inserting the reversed branching opcode.
1652bool HexagonInstrInfo::reverseBranchCondition(
1653 SmallVectorImpl<MachineOperand> &Cond) const {
1654 if (Cond.empty())
1655 return true;
1656 assert(Cond[0].isImm() && "First entry in the cond vector not imm-val");
1657 unsigned opcode = Cond[0].getImm();
1658 //unsigned temp;
1659 assert(get(opcode).isBranch() && "Should be a branching condition.");
1660 if (isEndLoopN(Opcode: opcode))
1661 return true;
1662 unsigned NewOpcode = getInvertedPredicatedOpcode(Opc: opcode);
1663 Cond[0].setImm(NewOpcode);
1664 return false;
1665}
1666
1667void HexagonInstrInfo::insertNoop(MachineBasicBlock &MBB,
1668 MachineBasicBlock::iterator MI) const {
1669 DebugLoc DL;
1670 BuildMI(BB&: MBB, I: MI, MIMD: DL, MCID: get(Opcode: Hexagon::A2_nop));
1671}
1672
1673bool HexagonInstrInfo::isPostIncrement(const MachineInstr &MI) const {
1674 return getAddrMode(MI) == HexagonII::PostInc;
1675}
1676
1677// Returns true if an instruction is predicated irrespective of the predicate
1678// sense. For example, all of the following will return true.
1679// if (p0) R1 = add(R2, R3)
1680// if (!p0) R1 = add(R2, R3)
1681// if (p0.new) R1 = add(R2, R3)
1682// if (!p0.new) R1 = add(R2, R3)
1683// Note: New-value stores are not included here as in the current
1684// implementation, we don't need to check their predicate sense.
1685bool HexagonInstrInfo::isPredicated(const MachineInstr &MI) const {
1686 const uint64_t F = MI.getDesc().TSFlags;
1687 return (F >> HexagonII::PredicatedPos) & HexagonII::PredicatedMask;
1688}
1689
1690bool HexagonInstrInfo::PredicateInstruction(
1691 MachineInstr &MI, ArrayRef<MachineOperand> Cond) const {
1692 if (Cond.empty() || isNewValueJump(Opcode: Cond[0].getImm()) ||
1693 isEndLoopN(Opcode: Cond[0].getImm())) {
1694 LLVM_DEBUG(dbgs() << "\nCannot predicate:"; MI.dump(););
1695 return false;
1696 }
1697 int Opc = MI.getOpcode();
1698 assert (isPredicable(MI) && "Expected predicable instruction");
1699 bool invertJump = predOpcodeHasNot(Cond);
1700
1701 // We have to predicate MI "in place", i.e. after this function returns,
1702 // MI will need to be transformed into a predicated form. To avoid com-
1703 // plicated manipulations with the operands (handling tied operands,
1704 // etc.), build a new temporary instruction, then overwrite MI with it.
1705
1706 MachineBasicBlock &B = *MI.getParent();
1707 DebugLoc DL = MI.getDebugLoc();
1708 unsigned PredOpc = getCondOpcode(Opc, sense: invertJump);
1709 MachineInstrBuilder T = BuildMI(BB&: B, I&: MI, MIMD: DL, MCID: get(Opcode: PredOpc));
1710 unsigned NOp = 0, NumOps = MI.getNumOperands();
1711 while (NOp < NumOps) {
1712 MachineOperand &Op = MI.getOperand(i: NOp);
1713 if (!Op.isReg() || !Op.isDef() || Op.isImplicit())
1714 break;
1715 T.add(MO: Op);
1716 NOp++;
1717 }
1718
1719 Register PredReg;
1720 unsigned PredRegPos;
1721 RegState PredRegFlags = {};
1722 bool GotPredReg = getPredReg(Cond, PredReg, PredRegPos, PredRegFlags);
1723 (void)GotPredReg;
1724 assert(GotPredReg);
1725 T.addReg(RegNo: PredReg, Flags: PredRegFlags);
1726 while (NOp < NumOps)
1727 T.add(MO: MI.getOperand(i: NOp++));
1728
1729 MI.setDesc(get(Opcode: PredOpc));
1730 while (unsigned n = MI.getNumOperands())
1731 MI.removeOperand(OpNo: n-1);
1732 for (unsigned i = 0, n = T->getNumOperands(); i < n; ++i)
1733 MI.addOperand(Op: T->getOperand(i));
1734
1735 MachineBasicBlock::instr_iterator TI = T->getIterator();
1736 B.erase(I: TI);
1737
1738 MachineRegisterInfo &MRI = B.getParent()->getRegInfo();
1739 MRI.clearKillFlags(Reg: PredReg);
1740 return true;
1741}
1742
1743bool HexagonInstrInfo::SubsumesPredicate(ArrayRef<MachineOperand> Pred1,
1744 ArrayRef<MachineOperand> Pred2) const {
1745 // TODO: Fix this
1746 return false;
1747}
1748
1749bool HexagonInstrInfo::ClobbersPredicate(MachineInstr &MI,
1750 std::vector<MachineOperand> &Pred,
1751 bool SkipDead) const {
1752 const HexagonRegisterInfo &HRI = *Subtarget.getRegisterInfo();
1753
1754 for (const MachineOperand &MO : MI.operands()) {
1755 if (MO.isReg()) {
1756 if (!MO.isDef())
1757 continue;
1758 const TargetRegisterClass* RC = HRI.getMinimalPhysRegClass(Reg: MO.getReg());
1759 if (RC == &Hexagon::PredRegsRegClass) {
1760 Pred.push_back(x: MO);
1761 return true;
1762 }
1763 continue;
1764 } else if (MO.isRegMask()) {
1765 for (Register PR : Hexagon::PredRegsRegClass) {
1766 if (!MI.modifiesRegister(Reg: PR, TRI: &HRI))
1767 continue;
1768 Pred.push_back(x: MO);
1769 return true;
1770 }
1771 }
1772 }
1773 return false;
1774}
1775
1776bool HexagonInstrInfo::isPredicable(const MachineInstr &MI) const {
1777 if (!MI.getDesc().isPredicable())
1778 return false;
1779
1780 if (MI.isCall() || isTailCall(MI)) {
1781 if (!Subtarget.usePredicatedCalls())
1782 return false;
1783 }
1784
1785 // HVX loads are not predicable on v60, but are on v62.
1786 if (!Subtarget.hasV62Ops()) {
1787 switch (MI.getOpcode()) {
1788 case Hexagon::V6_vL32b_ai:
1789 case Hexagon::V6_vL32b_pi:
1790 case Hexagon::V6_vL32b_ppu:
1791 case Hexagon::V6_vL32b_cur_ai:
1792 case Hexagon::V6_vL32b_cur_pi:
1793 case Hexagon::V6_vL32b_cur_ppu:
1794 case Hexagon::V6_vL32b_nt_ai:
1795 case Hexagon::V6_vL32b_nt_pi:
1796 case Hexagon::V6_vL32b_nt_ppu:
1797 case Hexagon::V6_vL32b_tmp_ai:
1798 case Hexagon::V6_vL32b_tmp_pi:
1799 case Hexagon::V6_vL32b_tmp_ppu:
1800 case Hexagon::V6_vL32b_nt_cur_ai:
1801 case Hexagon::V6_vL32b_nt_cur_pi:
1802 case Hexagon::V6_vL32b_nt_cur_ppu:
1803 case Hexagon::V6_vL32b_nt_tmp_ai:
1804 case Hexagon::V6_vL32b_nt_tmp_pi:
1805 case Hexagon::V6_vL32b_nt_tmp_ppu:
1806 return false;
1807 }
1808 }
1809 return true;
1810}
1811
1812bool HexagonInstrInfo::isAssociativeAndCommutative(const MachineInstr &Inst,
1813 bool Invert) const {
1814 if (Invert)
1815 return false;
1816
1817 switch (Inst.getOpcode()) {
1818 // TODO: Add more instructions to be handled by MachineCombiner.
1819 case Hexagon::F2_sfadd:
1820 return Inst.getFlag(Flag: MachineInstr::MIFlag::FmReassoc);
1821 default:
1822 return false;
1823 }
1824}
1825
1826bool HexagonInstrInfo::isSchedulingBoundary(const MachineInstr &MI,
1827 const MachineBasicBlock *MBB,
1828 const MachineFunction &MF) const {
1829 // Debug info is never a scheduling boundary. It's necessary to be explicit
1830 // due to the special treatment of IT instructions below, otherwise a
1831 // dbg_value followed by an IT will result in the IT instruction being
1832 // considered a scheduling hazard, which is wrong. It should be the actual
1833 // instruction preceding the dbg_value instruction(s), just like it is
1834 // when debug info is not present.
1835 if (MI.isDebugInstr())
1836 return false;
1837
1838 // Throwing call is a boundary.
1839 if (MI.isCall()) {
1840 // Don't mess around with no return calls.
1841 if (doesNotReturn(CallMI: MI))
1842 return true;
1843 // If any of the block's successors is a landing pad, this could be a
1844 // throwing call.
1845 for (auto *I : MBB->successors())
1846 if (I->isEHPad())
1847 return true;
1848 }
1849
1850 // Terminators and labels can't be scheduled around.
1851 if (MI.getDesc().isTerminator() || MI.isPosition())
1852 return true;
1853
1854 // INLINEASM_BR can jump to another block
1855 if (MI.getOpcode() == TargetOpcode::INLINEASM_BR)
1856 return true;
1857
1858 if (MI.isInlineAsm() && !ScheduleInlineAsm)
1859 return true;
1860
1861 return false;
1862}
1863
1864/// Measure the specified inline asm to determine an approximation of its
1865/// length.
1866/// Comments (which run till the next SeparatorString or newline) do not
1867/// count as an instruction.
1868/// Any other non-whitespace text is considered an instruction, with
1869/// multiple instructions separated by SeparatorString or newlines.
1870/// Variable-length instructions are not handled here; this function
1871/// may be overloaded in the target code to do that.
1872/// Hexagon counts the number of ##'s and adjust for that many
1873/// constant exenders.
1874unsigned HexagonInstrInfo::getInlineAsmLength(const char *Str,
1875 const MCAsmInfo &MAI,
1876 const TargetSubtargetInfo *STI) const {
1877 StringRef AStr(Str);
1878 // Count the number of instructions in the asm.
1879 bool atInsnStart = true;
1880 unsigned Length = 0;
1881 const unsigned MaxInstLength = MAI.getMaxInstLength(STI);
1882 for (; *Str; ++Str) {
1883 if (*Str == '\n' || strncmp(s1: Str, s2: MAI.getSeparatorString(),
1884 n: strlen(s: MAI.getSeparatorString())) == 0)
1885 atInsnStart = true;
1886 if (atInsnStart && !isSpace(C: static_cast<unsigned char>(*Str))) {
1887 Length += MaxInstLength;
1888 atInsnStart = false;
1889 }
1890 if (atInsnStart && strncmp(s1: Str, s2: MAI.getCommentString().data(),
1891 n: MAI.getCommentString().size()) == 0)
1892 atInsnStart = false;
1893 }
1894
1895 // Add to size number of constant extenders seen * 4.
1896 StringRef Occ("##");
1897 Length += AStr.count(Str: Occ)*4;
1898 return Length;
1899}
1900
1901ScheduleHazardRecognizer*
1902HexagonInstrInfo::CreateTargetPostRAHazardRecognizer(
1903 const InstrItineraryData *II, const ScheduleDAG *DAG) const {
1904 if (UseDFAHazardRec)
1905 return new HexagonHazardRecognizer(II, this, Subtarget);
1906 return TargetInstrInfo::CreateTargetPostRAHazardRecognizer(II, DAG);
1907}
1908
1909/// For a comparison instruction, return the source registers in
1910/// \p SrcReg and \p SrcReg2 if having two register operands, and the value it
1911/// compares against in CmpValue. Return true if the comparison instruction
1912/// can be analyzed.
1913bool HexagonInstrInfo::analyzeCompare(const MachineInstr &MI, Register &SrcReg,
1914 Register &SrcReg2, int64_t &Mask,
1915 int64_t &Value) const {
1916 unsigned Opc = MI.getOpcode();
1917
1918 // Set mask and the first source register.
1919 switch (Opc) {
1920 case Hexagon::C2_cmpeq:
1921 case Hexagon::C2_cmpeqp:
1922 case Hexagon::C2_cmpgt:
1923 case Hexagon::C2_cmpgtp:
1924 case Hexagon::C2_cmpgtu:
1925 case Hexagon::C2_cmpgtup:
1926 case Hexagon::C4_cmpneq:
1927 case Hexagon::C4_cmplte:
1928 case Hexagon::C4_cmplteu:
1929 case Hexagon::C2_cmpeqi:
1930 case Hexagon::C2_cmpgti:
1931 case Hexagon::C2_cmpgtui:
1932 case Hexagon::C4_cmpneqi:
1933 case Hexagon::C4_cmplteui:
1934 case Hexagon::C4_cmpltei:
1935 SrcReg = MI.getOperand(i: 1).getReg();
1936 Mask = ~0;
1937 break;
1938 case Hexagon::A4_cmpbeq:
1939 case Hexagon::A4_cmpbgt:
1940 case Hexagon::A4_cmpbgtu:
1941 case Hexagon::A4_cmpbeqi:
1942 case Hexagon::A4_cmpbgti:
1943 case Hexagon::A4_cmpbgtui:
1944 SrcReg = MI.getOperand(i: 1).getReg();
1945 Mask = 0xFF;
1946 break;
1947 case Hexagon::A4_cmpheq:
1948 case Hexagon::A4_cmphgt:
1949 case Hexagon::A4_cmphgtu:
1950 case Hexagon::A4_cmpheqi:
1951 case Hexagon::A4_cmphgti:
1952 case Hexagon::A4_cmphgtui:
1953 SrcReg = MI.getOperand(i: 1).getReg();
1954 Mask = 0xFFFF;
1955 break;
1956 }
1957
1958 // Set the value/second source register.
1959 switch (Opc) {
1960 case Hexagon::C2_cmpeq:
1961 case Hexagon::C2_cmpeqp:
1962 case Hexagon::C2_cmpgt:
1963 case Hexagon::C2_cmpgtp:
1964 case Hexagon::C2_cmpgtu:
1965 case Hexagon::C2_cmpgtup:
1966 case Hexagon::A4_cmpbeq:
1967 case Hexagon::A4_cmpbgt:
1968 case Hexagon::A4_cmpbgtu:
1969 case Hexagon::A4_cmpheq:
1970 case Hexagon::A4_cmphgt:
1971 case Hexagon::A4_cmphgtu:
1972 case Hexagon::C4_cmpneq:
1973 case Hexagon::C4_cmplte:
1974 case Hexagon::C4_cmplteu:
1975 SrcReg2 = MI.getOperand(i: 2).getReg();
1976 Value = 0;
1977 return true;
1978
1979 case Hexagon::C2_cmpeqi:
1980 case Hexagon::C2_cmpgtui:
1981 case Hexagon::C2_cmpgti:
1982 case Hexagon::C4_cmpneqi:
1983 case Hexagon::C4_cmplteui:
1984 case Hexagon::C4_cmpltei:
1985 case Hexagon::A4_cmpbeqi:
1986 case Hexagon::A4_cmpbgti:
1987 case Hexagon::A4_cmpbgtui:
1988 case Hexagon::A4_cmpheqi:
1989 case Hexagon::A4_cmphgti:
1990 case Hexagon::A4_cmphgtui: {
1991 SrcReg2 = 0;
1992 const MachineOperand &Op2 = MI.getOperand(i: 2);
1993 if (!Op2.isImm())
1994 return false;
1995 Value = MI.getOperand(i: 2).getImm();
1996 return true;
1997 }
1998 }
1999
2000 return false;
2001}
2002
2003unsigned HexagonInstrInfo::getInstrLatency(const InstrItineraryData *ItinData,
2004 const MachineInstr &MI,
2005 unsigned *PredCost) const {
2006 return getInstrTimingClassLatency(ItinData, MI);
2007}
2008
2009DFAPacketizer *HexagonInstrInfo::CreateTargetScheduleState(
2010 const TargetSubtargetInfo &STI) const {
2011 const InstrItineraryData *II = STI.getInstrItineraryData();
2012 return static_cast<const HexagonSubtarget&>(STI).createDFAPacketizer(IID: II);
2013}
2014
2015// Inspired by this pair:
2016// %r13 = L2_loadri_io %r29, 136; mem:LD4[FixedStack0]
2017// S2_storeri_io %r29, 132, killed %r1; flags: mem:ST4[FixedStack1]
2018// Currently AA considers the addresses in these instructions to be aliasing.
2019bool HexagonInstrInfo::areMemAccessesTriviallyDisjoint(
2020 const MachineInstr &MIa, const MachineInstr &MIb) const {
2021 if (MIa.hasUnmodeledSideEffects() || MIb.hasUnmodeledSideEffects() ||
2022 MIa.hasOrderedMemoryRef() || MIb.hasOrderedMemoryRef())
2023 return false;
2024
2025 // Instructions that are pure loads, not loads and stores like memops are not
2026 // dependent.
2027 if (MIa.mayLoad() && !isMemOp(MI: MIa) && MIb.mayLoad() && !isMemOp(MI: MIb))
2028 return true;
2029
2030 // Get the base register in MIa.
2031 unsigned BasePosA, OffsetPosA;
2032 if (!getBaseAndOffsetPosition(MI: MIa, BasePos&: BasePosA, OffsetPos&: OffsetPosA))
2033 return false;
2034 const MachineOperand &BaseA = MIa.getOperand(i: BasePosA);
2035 Register BaseRegA = BaseA.getReg();
2036 unsigned BaseSubA = BaseA.getSubReg();
2037
2038 // Get the base register in MIb.
2039 unsigned BasePosB, OffsetPosB;
2040 if (!getBaseAndOffsetPosition(MI: MIb, BasePos&: BasePosB, OffsetPos&: OffsetPosB))
2041 return false;
2042 const MachineOperand &BaseB = MIb.getOperand(i: BasePosB);
2043 Register BaseRegB = BaseB.getReg();
2044 unsigned BaseSubB = BaseB.getSubReg();
2045
2046 if (BaseRegA != BaseRegB || BaseSubA != BaseSubB)
2047 return false;
2048
2049 // Get the access sizes.
2050 unsigned SizeA = getMemAccessSize(MI: MIa);
2051 unsigned SizeB = getMemAccessSize(MI: MIb);
2052
2053 // Get the offsets. Handle immediates only for now.
2054 const MachineOperand &OffA = MIa.getOperand(i: OffsetPosA);
2055 const MachineOperand &OffB = MIb.getOperand(i: OffsetPosB);
2056 if (!MIa.getOperand(i: OffsetPosA).isImm() ||
2057 !MIb.getOperand(i: OffsetPosB).isImm())
2058 return false;
2059 int OffsetA = isPostIncrement(MI: MIa) ? 0 : OffA.getImm();
2060 int OffsetB = isPostIncrement(MI: MIb) ? 0 : OffB.getImm();
2061
2062 // This is a mem access with the same base register and known offsets from it.
2063 // Reason about it.
2064 if (OffsetA > OffsetB) {
2065 uint64_t OffDiff = (uint64_t)((int64_t)OffsetA - (int64_t)OffsetB);
2066 return SizeB <= OffDiff;
2067 }
2068 if (OffsetA < OffsetB) {
2069 uint64_t OffDiff = (uint64_t)((int64_t)OffsetB - (int64_t)OffsetA);
2070 return SizeA <= OffDiff;
2071 }
2072
2073 return false;
2074}
2075
2076/// If the instruction is an increment of a constant value, return the amount.
2077bool HexagonInstrInfo::getIncrementValue(const MachineInstr &MI,
2078 int &Value) const {
2079 if (isPostIncrement(MI)) {
2080 unsigned BasePos = 0, OffsetPos = 0;
2081 if (!getBaseAndOffsetPosition(MI, BasePos, OffsetPos))
2082 return false;
2083 const MachineOperand &OffsetOp = MI.getOperand(i: OffsetPos);
2084 if (OffsetOp.isImm()) {
2085 Value = OffsetOp.getImm();
2086 return true;
2087 }
2088 } else if (MI.getOpcode() == Hexagon::A2_addi) {
2089 const MachineOperand &AddOp = MI.getOperand(i: 2);
2090 if (AddOp.isImm()) {
2091 Value = AddOp.getImm();
2092 return true;
2093 }
2094 }
2095
2096 return false;
2097}
2098
2099std::pair<unsigned, unsigned>
2100HexagonInstrInfo::decomposeMachineOperandsTargetFlags(unsigned TF) const {
2101 return std::make_pair(x: TF & ~HexagonII::MO_Bitmasks,
2102 y: TF & HexagonII::MO_Bitmasks);
2103}
2104
2105ArrayRef<std::pair<unsigned, const char*>>
2106HexagonInstrInfo::getSerializableDirectMachineOperandTargetFlags() const {
2107 using namespace HexagonII;
2108
2109 static const std::pair<unsigned, const char*> Flags[] = {
2110 {MO_PCREL, "hexagon-pcrel"},
2111 {MO_GOT, "hexagon-got"},
2112 {MO_LO16, "hexagon-lo16"},
2113 {MO_HI16, "hexagon-hi16"},
2114 {MO_GPREL, "hexagon-gprel"},
2115 {MO_GDGOT, "hexagon-gdgot"},
2116 {MO_GDPLT, "hexagon-gdplt"},
2117 {MO_IE, "hexagon-ie"},
2118 {MO_IEGOT, "hexagon-iegot"},
2119 {MO_TPREL, "hexagon-tprel"}
2120 };
2121 return ArrayRef(Flags);
2122}
2123
2124ArrayRef<std::pair<unsigned, const char*>>
2125HexagonInstrInfo::getSerializableBitmaskMachineOperandTargetFlags() const {
2126 using namespace HexagonII;
2127
2128 static const std::pair<unsigned, const char*> Flags[] = {
2129 {HMOTF_ConstExtended, "hexagon-ext"}
2130 };
2131 return ArrayRef(Flags);
2132}
2133
2134Register HexagonInstrInfo::createVR(MachineFunction *MF, MVT VT) const {
2135 MachineRegisterInfo &MRI = MF->getRegInfo();
2136 const TargetRegisterClass *TRC;
2137 if (VT == MVT::i1) {
2138 TRC = &Hexagon::PredRegsRegClass;
2139 } else if (VT == MVT::i32 || VT == MVT::f32) {
2140 TRC = &Hexagon::IntRegsRegClass;
2141 } else if (VT == MVT::i64 || VT == MVT::f64) {
2142 TRC = &Hexagon::DoubleRegsRegClass;
2143 } else {
2144 llvm_unreachable("Cannot handle this register class");
2145 }
2146
2147 Register NewReg = MRI.createVirtualRegister(RegClass: TRC);
2148 return NewReg;
2149}
2150
2151bool HexagonInstrInfo::isAbsoluteSet(const MachineInstr &MI) const {
2152 return (getAddrMode(MI) == HexagonII::AbsoluteSet);
2153}
2154
2155bool HexagonInstrInfo::isAccumulator(const MachineInstr &MI) const {
2156 const uint64_t F = MI.getDesc().TSFlags;
2157 return((F >> HexagonII::AccumulatorPos) & HexagonII::AccumulatorMask);
2158}
2159
2160bool HexagonInstrInfo::isBaseImmOffset(const MachineInstr &MI) const {
2161 return getAddrMode(MI) == HexagonII::BaseImmOffset;
2162}
2163
2164bool HexagonInstrInfo::isComplex(const MachineInstr &MI) const {
2165 return !isTC1(MI) && !isTC2Early(MI) && !MI.getDesc().mayLoad() &&
2166 !MI.getDesc().mayStore() &&
2167 MI.getDesc().getOpcode() != Hexagon::S2_allocframe &&
2168 MI.getDesc().getOpcode() != Hexagon::L2_deallocframe &&
2169 !isMemOp(MI) && !MI.isBranch() && !MI.isReturn() && !MI.isCall();
2170}
2171
2172// Return true if the instruction is a compound branch instruction.
2173bool HexagonInstrInfo::isCompoundBranchInstr(const MachineInstr &MI) const {
2174 return getType(MI) == HexagonII::TypeCJ && MI.isBranch();
2175}
2176
2177// TODO: In order to have isExtendable for fpimm/f32Ext, we need to handle
2178// isFPImm and later getFPImm as well.
2179bool HexagonInstrInfo::isConstExtended(const MachineInstr &MI) const {
2180 const uint64_t F = MI.getDesc().TSFlags;
2181 unsigned isExtended = (F >> HexagonII::ExtendedPos) & HexagonII::ExtendedMask;
2182 if (isExtended) // Instruction must be extended.
2183 return true;
2184
2185 unsigned isExtendable =
2186 (F >> HexagonII::ExtendablePos) & HexagonII::ExtendableMask;
2187 if (!isExtendable)
2188 return false;
2189
2190 if (MI.isCall())
2191 return false;
2192
2193 short ExtOpNum = getCExtOpNum(MI);
2194 const MachineOperand &MO = MI.getOperand(i: ExtOpNum);
2195 // Use MO operand flags to determine if MO
2196 // has the HMOTF_ConstExtended flag set.
2197 if (MO.getTargetFlags() & HexagonII::HMOTF_ConstExtended)
2198 return true;
2199 // If this is a Machine BB address we are talking about, and it is
2200 // not marked as extended, say so.
2201 if (MO.isMBB())
2202 return false;
2203
2204 // We could be using an instruction with an extendable immediate and shoehorn
2205 // a global address into it. If it is a global address it will be constant
2206 // extended. We do this for COMBINE.
2207 if (MO.isGlobal() || MO.isSymbol() || MO.isBlockAddress() ||
2208 MO.isJTI() || MO.isCPI() || MO.isFPImm())
2209 return true;
2210
2211 // If the extendable operand is not 'Immediate' type, the instruction should
2212 // have 'isExtended' flag set.
2213 assert(MO.isImm() && "Extendable operand must be Immediate type");
2214
2215 int64_t Value = MO.getImm();
2216 if ((F >> HexagonII::ExtentSignedPos) & HexagonII::ExtentSignedMask) {
2217 int32_t SValue = Value;
2218 int32_t MinValue = getMinValue(MI);
2219 int32_t MaxValue = getMaxValue(MI);
2220 return SValue < MinValue || SValue > MaxValue;
2221 }
2222 uint32_t UValue = Value;
2223 uint32_t MinValue = getMinValue(MI);
2224 uint32_t MaxValue = getMaxValue(MI);
2225 return UValue < MinValue || UValue > MaxValue;
2226}
2227
2228bool HexagonInstrInfo::isDeallocRet(const MachineInstr &MI) const {
2229 switch (MI.getOpcode()) {
2230 case Hexagon::L4_return:
2231 case Hexagon::L4_return_t:
2232 case Hexagon::L4_return_f:
2233 case Hexagon::L4_return_tnew_pnt:
2234 case Hexagon::L4_return_fnew_pnt:
2235 case Hexagon::L4_return_tnew_pt:
2236 case Hexagon::L4_return_fnew_pt:
2237 return true;
2238 }
2239 return false;
2240}
2241
2242// Return true when ConsMI uses a register defined by ProdMI.
2243bool HexagonInstrInfo::isDependent(const MachineInstr &ProdMI,
2244 const MachineInstr &ConsMI) const {
2245 if (!ProdMI.getDesc().getNumDefs())
2246 return false;
2247 const HexagonRegisterInfo &HRI = *Subtarget.getRegisterInfo();
2248
2249 SmallVector<Register, 4> DefsA;
2250 SmallVector<Register, 4> DefsB;
2251 SmallVector<Register, 8> UsesA;
2252 SmallVector<Register, 8> UsesB;
2253
2254 parseOperands(MI: ProdMI, Defs&: DefsA, Uses&: UsesA);
2255 parseOperands(MI: ConsMI, Defs&: DefsB, Uses&: UsesB);
2256
2257 for (auto &RegA : DefsA)
2258 for (auto &RegB : UsesB) {
2259 // True data dependency.
2260 if (RegA == RegB)
2261 return true;
2262
2263 if (RegA.isPhysical() && llvm::is_contained(Range: HRI.subregs(Reg: RegA), Element: RegB))
2264 return true;
2265
2266 if (RegB.isPhysical() && llvm::is_contained(Range: HRI.subregs(Reg: RegB), Element: RegA))
2267 return true;
2268 }
2269
2270 return false;
2271}
2272
2273// Returns true if the instruction is already a .cur.
2274bool HexagonInstrInfo::isDotCurInst(const MachineInstr &MI) const {
2275 switch (MI.getOpcode()) {
2276 case Hexagon::V6_vL32b_cur_pi:
2277 case Hexagon::V6_vL32b_cur_ai:
2278 return true;
2279 }
2280 return false;
2281}
2282
2283// Returns true, if any one of the operands is a dot new
2284// insn, whether it is predicated dot new or register dot new.
2285bool HexagonInstrInfo::isDotNewInst(const MachineInstr &MI) const {
2286 if (isNewValueInst(MI) || (isPredicated(MI) && isPredicatedNew(MI)))
2287 return true;
2288
2289 return false;
2290}
2291
2292/// Symmetrical. See if these two instructions are fit for duplex pair.
2293bool HexagonInstrInfo::isDuplexPair(const MachineInstr &MIa,
2294 const MachineInstr &MIb) const {
2295 HexagonII::SubInstructionGroup MIaG = getDuplexCandidateGroup(MI: MIa);
2296 HexagonII::SubInstructionGroup MIbG = getDuplexCandidateGroup(MI: MIb);
2297 return (isDuplexPairMatch(Ga: MIaG, Gb: MIbG) || isDuplexPairMatch(Ga: MIbG, Gb: MIaG));
2298}
2299
2300bool HexagonInstrInfo::isEndLoopN(unsigned Opcode) const {
2301 return (Opcode == Hexagon::ENDLOOP0 ||
2302 Opcode == Hexagon::ENDLOOP1);
2303}
2304
2305bool HexagonInstrInfo::isExpr(unsigned OpType) const {
2306 switch(OpType) {
2307 case MachineOperand::MO_MachineBasicBlock:
2308 case MachineOperand::MO_GlobalAddress:
2309 case MachineOperand::MO_ExternalSymbol:
2310 case MachineOperand::MO_JumpTableIndex:
2311 case MachineOperand::MO_ConstantPoolIndex:
2312 case MachineOperand::MO_BlockAddress:
2313 return true;
2314 default:
2315 return false;
2316 }
2317}
2318
2319bool HexagonInstrInfo::isExtendable(const MachineInstr &MI) const {
2320 const MCInstrDesc &MID = MI.getDesc();
2321 const uint64_t F = MID.TSFlags;
2322 if ((F >> HexagonII::ExtendablePos) & HexagonII::ExtendableMask)
2323 return true;
2324
2325 // TODO: This is largely obsolete now. Will need to be removed
2326 // in consecutive patches.
2327 switch (MI.getOpcode()) {
2328 // PS_fi and PS_fia remain special cases.
2329 case Hexagon::PS_fi:
2330 case Hexagon::PS_fia:
2331 return true;
2332 default:
2333 return false;
2334 }
2335 return false;
2336}
2337
2338// This returns true in two cases:
2339// - The OP code itself indicates that this is an extended instruction.
2340// - One of MOs has been marked with HMOTF_ConstExtended flag.
2341bool HexagonInstrInfo::isExtended(const MachineInstr &MI) const {
2342 // First check if this is permanently extended op code.
2343 const uint64_t F = MI.getDesc().TSFlags;
2344 if ((F >> HexagonII::ExtendedPos) & HexagonII::ExtendedMask)
2345 return true;
2346 // Use MO operand flags to determine if one of MI's operands
2347 // has HMOTF_ConstExtended flag set.
2348 for (const MachineOperand &MO : MI.operands())
2349 if (MO.getTargetFlags() & HexagonII::HMOTF_ConstExtended)
2350 return true;
2351 return false;
2352}
2353
2354bool HexagonInstrInfo::isFloat(const MachineInstr &MI) const {
2355 unsigned Opcode = MI.getOpcode();
2356 const uint64_t F = get(Opcode).TSFlags;
2357 return (F >> HexagonII::FPPos) & HexagonII::FPMask;
2358}
2359
2360// No V60 HVX VMEM with A_INDIRECT.
2361bool HexagonInstrInfo::isHVXMemWithAIndirect(const MachineInstr &I,
2362 const MachineInstr &J) const {
2363 if (!isHVXVec(MI: I))
2364 return false;
2365 if (!I.mayLoad() && !I.mayStore())
2366 return false;
2367 return J.isIndirectBranch() || isIndirectCall(MI: J) || isIndirectL4Return(MI: J);
2368}
2369
2370bool HexagonInstrInfo::isIndirectCall(const MachineInstr &MI) const {
2371 switch (MI.getOpcode()) {
2372 case Hexagon::J2_callr:
2373 case Hexagon::J2_callrf:
2374 case Hexagon::J2_callrt:
2375 case Hexagon::PS_call_nr:
2376 return true;
2377 }
2378 return false;
2379}
2380
2381bool HexagonInstrInfo::isIndirectL4Return(const MachineInstr &MI) const {
2382 switch (MI.getOpcode()) {
2383 case Hexagon::L4_return:
2384 case Hexagon::L4_return_t:
2385 case Hexagon::L4_return_f:
2386 case Hexagon::L4_return_fnew_pnt:
2387 case Hexagon::L4_return_fnew_pt:
2388 case Hexagon::L4_return_tnew_pnt:
2389 case Hexagon::L4_return_tnew_pt:
2390 return true;
2391 }
2392 return false;
2393}
2394
2395bool HexagonInstrInfo::isJumpR(const MachineInstr &MI) const {
2396 switch (MI.getOpcode()) {
2397 case Hexagon::J2_jumpr:
2398 case Hexagon::J2_jumprt:
2399 case Hexagon::J2_jumprf:
2400 case Hexagon::J2_jumprtnewpt:
2401 case Hexagon::J2_jumprfnewpt:
2402 case Hexagon::J2_jumprtnew:
2403 case Hexagon::J2_jumprfnew:
2404 return true;
2405 }
2406 return false;
2407}
2408
2409// Return true if a given MI can accommodate given offset.
2410// Use abs estimate as oppose to the exact number.
2411// TODO: This will need to be changed to use MC level
2412// definition of instruction extendable field size.
2413bool HexagonInstrInfo::isJumpWithinBranchRange(const MachineInstr &MI,
2414 unsigned offset) const {
2415 // This selection of jump instructions matches to that what
2416 // analyzeBranch can parse, plus NVJ.
2417 if (isNewValueJump(MI)) // r9:2
2418 return isInt<11>(x: offset);
2419
2420 switch (MI.getOpcode()) {
2421 // Still missing Jump to address condition on register value.
2422 default:
2423 return false;
2424 case Hexagon::J2_jump: // bits<24> dst; // r22:2
2425 case Hexagon::J2_call:
2426 case Hexagon::PS_call_nr:
2427 return isInt<24>(x: offset);
2428 case Hexagon::J2_jumpt: //bits<17> dst; // r15:2
2429 case Hexagon::J2_jumpf:
2430 case Hexagon::J2_jumptnew:
2431 case Hexagon::J2_jumptnewpt:
2432 case Hexagon::J2_jumpfnew:
2433 case Hexagon::J2_jumpfnewpt:
2434 case Hexagon::J2_callt:
2435 case Hexagon::J2_callf:
2436 return isInt<17>(x: offset);
2437 case Hexagon::J2_loop0i:
2438 case Hexagon::J2_loop0iext:
2439 case Hexagon::J2_loop0r:
2440 case Hexagon::J2_loop0rext:
2441 case Hexagon::J2_loop1i:
2442 case Hexagon::J2_loop1iext:
2443 case Hexagon::J2_loop1r:
2444 case Hexagon::J2_loop1rext:
2445 return isInt<9>(x: offset);
2446 // TODO: Add all the compound branches here. Can we do this in Relation model?
2447 case Hexagon::J4_cmpeqi_tp0_jump_nt:
2448 case Hexagon::J4_cmpeqi_tp1_jump_nt:
2449 case Hexagon::J4_cmpeqn1_tp0_jump_nt:
2450 case Hexagon::J4_cmpeqn1_tp1_jump_nt:
2451 return isInt<11>(x: offset);
2452 }
2453}
2454
2455bool HexagonInstrInfo::isLateSourceInstr(const MachineInstr &MI) const {
2456 // Instructions with iclass A_CVI_VX and attribute A_CVI_LATE uses a multiply
2457 // resource, but all operands can be received late like an ALU instruction.
2458 return getType(MI) == HexagonII::TypeCVI_VX_LATE;
2459}
2460
2461bool HexagonInstrInfo::isLoopN(const MachineInstr &MI) const {
2462 unsigned Opcode = MI.getOpcode();
2463 return Opcode == Hexagon::J2_loop0i ||
2464 Opcode == Hexagon::J2_loop0r ||
2465 Opcode == Hexagon::J2_loop0iext ||
2466 Opcode == Hexagon::J2_loop0rext ||
2467 Opcode == Hexagon::J2_loop1i ||
2468 Opcode == Hexagon::J2_loop1r ||
2469 Opcode == Hexagon::J2_loop1iext ||
2470 Opcode == Hexagon::J2_loop1rext;
2471}
2472
2473bool HexagonInstrInfo::isMemOp(const MachineInstr &MI) const {
2474 switch (MI.getOpcode()) {
2475 default: return false;
2476 case Hexagon::L4_iadd_memopw_io:
2477 case Hexagon::L4_isub_memopw_io:
2478 case Hexagon::L4_add_memopw_io:
2479 case Hexagon::L4_sub_memopw_io:
2480 case Hexagon::L4_and_memopw_io:
2481 case Hexagon::L4_or_memopw_io:
2482 case Hexagon::L4_iadd_memoph_io:
2483 case Hexagon::L4_isub_memoph_io:
2484 case Hexagon::L4_add_memoph_io:
2485 case Hexagon::L4_sub_memoph_io:
2486 case Hexagon::L4_and_memoph_io:
2487 case Hexagon::L4_or_memoph_io:
2488 case Hexagon::L4_iadd_memopb_io:
2489 case Hexagon::L4_isub_memopb_io:
2490 case Hexagon::L4_add_memopb_io:
2491 case Hexagon::L4_sub_memopb_io:
2492 case Hexagon::L4_and_memopb_io:
2493 case Hexagon::L4_or_memopb_io:
2494 case Hexagon::L4_ior_memopb_io:
2495 case Hexagon::L4_ior_memoph_io:
2496 case Hexagon::L4_ior_memopw_io:
2497 case Hexagon::L4_iand_memopb_io:
2498 case Hexagon::L4_iand_memoph_io:
2499 case Hexagon::L4_iand_memopw_io:
2500 return true;
2501 }
2502 return false;
2503}
2504
2505bool HexagonInstrInfo::isNewValue(const MachineInstr &MI) const {
2506 const uint64_t F = MI.getDesc().TSFlags;
2507 return (F >> HexagonII::NewValuePos) & HexagonII::NewValueMask;
2508}
2509
2510bool HexagonInstrInfo::isNewValue(unsigned Opcode) const {
2511 const uint64_t F = get(Opcode).TSFlags;
2512 return (F >> HexagonII::NewValuePos) & HexagonII::NewValueMask;
2513}
2514
2515bool HexagonInstrInfo::isNewValueInst(const MachineInstr &MI) const {
2516 return isNewValueJump(MI) || isNewValueStore(MI);
2517}
2518
2519bool HexagonInstrInfo::isNewValueJump(const MachineInstr &MI) const {
2520 return isNewValue(MI) && MI.isBranch();
2521}
2522
2523bool HexagonInstrInfo::isNewValueJump(unsigned Opcode) const {
2524 return isNewValue(Opcode) && get(Opcode).isBranch() && isPredicated(Opcode);
2525}
2526
2527bool HexagonInstrInfo::isNewValueStore(const MachineInstr &MI) const {
2528 const uint64_t F = MI.getDesc().TSFlags;
2529 return (F >> HexagonII::NVStorePos) & HexagonII::NVStoreMask;
2530}
2531
2532bool HexagonInstrInfo::isNewValueStore(unsigned Opcode) const {
2533 const uint64_t F = get(Opcode).TSFlags;
2534 return (F >> HexagonII::NVStorePos) & HexagonII::NVStoreMask;
2535}
2536
2537// Returns true if a particular operand is extendable for an instruction.
2538bool HexagonInstrInfo::isOperandExtended(const MachineInstr &MI,
2539 unsigned OperandNum) const {
2540 const uint64_t F = MI.getDesc().TSFlags;
2541 return ((F >> HexagonII::ExtendableOpPos) & HexagonII::ExtendableOpMask)
2542 == OperandNum;
2543}
2544
2545bool HexagonInstrInfo::isPredicatedNew(const MachineInstr &MI) const {
2546 const uint64_t F = MI.getDesc().TSFlags;
2547 assert(isPredicated(MI));
2548 return (F >> HexagonII::PredicatedNewPos) & HexagonII::PredicatedNewMask;
2549}
2550
2551bool HexagonInstrInfo::isPredicatedNew(unsigned Opcode) const {
2552 const uint64_t F = get(Opcode).TSFlags;
2553 assert(isPredicated(Opcode));
2554 return (F >> HexagonII::PredicatedNewPos) & HexagonII::PredicatedNewMask;
2555}
2556
2557bool HexagonInstrInfo::isPredicatedTrue(const MachineInstr &MI) const {
2558 const uint64_t F = MI.getDesc().TSFlags;
2559 return !((F >> HexagonII::PredicatedFalsePos) &
2560 HexagonII::PredicatedFalseMask);
2561}
2562
2563bool HexagonInstrInfo::isPredicatedTrue(unsigned Opcode) const {
2564 const uint64_t F = get(Opcode).TSFlags;
2565 // Make sure that the instruction is predicated.
2566 assert((F>> HexagonII::PredicatedPos) & HexagonII::PredicatedMask);
2567 return !((F >> HexagonII::PredicatedFalsePos) &
2568 HexagonII::PredicatedFalseMask);
2569}
2570
2571bool HexagonInstrInfo::isPredicated(unsigned Opcode) const {
2572 const uint64_t F = get(Opcode).TSFlags;
2573 return (F >> HexagonII::PredicatedPos) & HexagonII::PredicatedMask;
2574}
2575
2576bool HexagonInstrInfo::isPredicateLate(unsigned Opcode) const {
2577 const uint64_t F = get(Opcode).TSFlags;
2578 return (F >> HexagonII::PredicateLatePos) & HexagonII::PredicateLateMask;
2579}
2580
2581bool HexagonInstrInfo::isPredictedTaken(unsigned Opcode) const {
2582 const uint64_t F = get(Opcode).TSFlags;
2583 assert(get(Opcode).isBranch() &&
2584 (isPredicatedNew(Opcode) || isNewValue(Opcode)));
2585 return (F >> HexagonII::TakenPos) & HexagonII::TakenMask;
2586}
2587
2588bool HexagonInstrInfo::isSaveCalleeSavedRegsCall(const MachineInstr &MI) const {
2589 return MI.getOpcode() == Hexagon::SAVE_REGISTERS_CALL_V4 ||
2590 MI.getOpcode() == Hexagon::SAVE_REGISTERS_CALL_V4_EXT ||
2591 MI.getOpcode() == Hexagon::SAVE_REGISTERS_CALL_V4_PIC ||
2592 MI.getOpcode() == Hexagon::SAVE_REGISTERS_CALL_V4_EXT_PIC;
2593}
2594
2595bool HexagonInstrInfo::isSignExtendingLoad(const MachineInstr &MI) const {
2596 switch (MI.getOpcode()) {
2597 // Byte
2598 case Hexagon::L2_loadrb_io:
2599 case Hexagon::L4_loadrb_ur:
2600 case Hexagon::L4_loadrb_ap:
2601 case Hexagon::L2_loadrb_pr:
2602 case Hexagon::L2_loadrb_pbr:
2603 case Hexagon::L2_loadrb_pi:
2604 case Hexagon::L2_loadrb_pci:
2605 case Hexagon::L2_loadrb_pcr:
2606 case Hexagon::L2_loadbsw2_io:
2607 case Hexagon::L4_loadbsw2_ur:
2608 case Hexagon::L4_loadbsw2_ap:
2609 case Hexagon::L2_loadbsw2_pr:
2610 case Hexagon::L2_loadbsw2_pbr:
2611 case Hexagon::L2_loadbsw2_pi:
2612 case Hexagon::L2_loadbsw2_pci:
2613 case Hexagon::L2_loadbsw2_pcr:
2614 case Hexagon::L2_loadbsw4_io:
2615 case Hexagon::L4_loadbsw4_ur:
2616 case Hexagon::L4_loadbsw4_ap:
2617 case Hexagon::L2_loadbsw4_pr:
2618 case Hexagon::L2_loadbsw4_pbr:
2619 case Hexagon::L2_loadbsw4_pi:
2620 case Hexagon::L2_loadbsw4_pci:
2621 case Hexagon::L2_loadbsw4_pcr:
2622 case Hexagon::L4_loadrb_rr:
2623 case Hexagon::L2_ploadrbt_io:
2624 case Hexagon::L2_ploadrbt_pi:
2625 case Hexagon::L2_ploadrbf_io:
2626 case Hexagon::L2_ploadrbf_pi:
2627 case Hexagon::L2_ploadrbtnew_io:
2628 case Hexagon::L2_ploadrbfnew_io:
2629 case Hexagon::L4_ploadrbt_rr:
2630 case Hexagon::L4_ploadrbf_rr:
2631 case Hexagon::L4_ploadrbtnew_rr:
2632 case Hexagon::L4_ploadrbfnew_rr:
2633 case Hexagon::L2_ploadrbtnew_pi:
2634 case Hexagon::L2_ploadrbfnew_pi:
2635 case Hexagon::L4_ploadrbt_abs:
2636 case Hexagon::L4_ploadrbf_abs:
2637 case Hexagon::L4_ploadrbtnew_abs:
2638 case Hexagon::L4_ploadrbfnew_abs:
2639 case Hexagon::L2_loadrbgp:
2640 // Half
2641 case Hexagon::L2_loadrh_io:
2642 case Hexagon::L4_loadrh_ur:
2643 case Hexagon::L4_loadrh_ap:
2644 case Hexagon::L2_loadrh_pr:
2645 case Hexagon::L2_loadrh_pbr:
2646 case Hexagon::L2_loadrh_pi:
2647 case Hexagon::L2_loadrh_pci:
2648 case Hexagon::L2_loadrh_pcr:
2649 case Hexagon::L4_loadrh_rr:
2650 case Hexagon::L2_ploadrht_io:
2651 case Hexagon::L2_ploadrht_pi:
2652 case Hexagon::L2_ploadrhf_io:
2653 case Hexagon::L2_ploadrhf_pi:
2654 case Hexagon::L2_ploadrhtnew_io:
2655 case Hexagon::L2_ploadrhfnew_io:
2656 case Hexagon::L4_ploadrht_rr:
2657 case Hexagon::L4_ploadrhf_rr:
2658 case Hexagon::L4_ploadrhtnew_rr:
2659 case Hexagon::L4_ploadrhfnew_rr:
2660 case Hexagon::L2_ploadrhtnew_pi:
2661 case Hexagon::L2_ploadrhfnew_pi:
2662 case Hexagon::L4_ploadrht_abs:
2663 case Hexagon::L4_ploadrhf_abs:
2664 case Hexagon::L4_ploadrhtnew_abs:
2665 case Hexagon::L4_ploadrhfnew_abs:
2666 case Hexagon::L2_loadrhgp:
2667 return true;
2668 default:
2669 return false;
2670 }
2671}
2672
2673bool HexagonInstrInfo::isSolo(const MachineInstr &MI) const {
2674 const uint64_t F = MI.getDesc().TSFlags;
2675 return (F >> HexagonII::SoloPos) & HexagonII::SoloMask;
2676}
2677
2678bool HexagonInstrInfo::isSpillPredRegOp(const MachineInstr &MI) const {
2679 switch (MI.getOpcode()) {
2680 case Hexagon::STriw_pred:
2681 case Hexagon::LDriw_pred:
2682 return true;
2683 default:
2684 return false;
2685 }
2686}
2687
2688bool HexagonInstrInfo::isTailCall(const MachineInstr &MI) const {
2689 if (!MI.isBranch())
2690 return false;
2691
2692 for (auto &Op : MI.operands())
2693 if (Op.isGlobal() || Op.isSymbol())
2694 return true;
2695 return false;
2696}
2697
2698// Returns true when SU has a timing class TC1.
2699bool HexagonInstrInfo::isTC1(const MachineInstr &MI) const {
2700 unsigned SchedClass = MI.getDesc().getSchedClass();
2701 return is_TC1(SchedClass);
2702}
2703
2704bool HexagonInstrInfo::isTC2(const MachineInstr &MI) const {
2705 unsigned SchedClass = MI.getDesc().getSchedClass();
2706 return is_TC2(SchedClass);
2707}
2708
2709bool HexagonInstrInfo::isTC2Early(const MachineInstr &MI) const {
2710 unsigned SchedClass = MI.getDesc().getSchedClass();
2711 return is_TC2early(SchedClass);
2712}
2713
2714bool HexagonInstrInfo::isTC4x(const MachineInstr &MI) const {
2715 unsigned SchedClass = MI.getDesc().getSchedClass();
2716 return is_TC4x(SchedClass);
2717}
2718
2719// Schedule this ASAP.
2720bool HexagonInstrInfo::isToBeScheduledASAP(const MachineInstr &MI1,
2721 const MachineInstr &MI2) const {
2722 if (mayBeCurLoad(MI: MI1)) {
2723 // if (result of SU is used in Next) return true;
2724 Register DstReg = MI1.getOperand(i: 0).getReg();
2725 int N = MI2.getNumOperands();
2726 for (int I = 0; I < N; I++)
2727 if (MI2.getOperand(i: I).isReg() && DstReg == MI2.getOperand(i: I).getReg())
2728 return true;
2729 }
2730 if (mayBeNewStore(MI: MI2))
2731 if (MI2.getOpcode() == Hexagon::V6_vS32b_pi)
2732 if (MI1.getOperand(i: 0).isReg() && MI2.getOperand(i: 3).isReg() &&
2733 MI1.getOperand(i: 0).getReg() == MI2.getOperand(i: 3).getReg())
2734 return true;
2735 return false;
2736}
2737
2738bool HexagonInstrInfo::isHVXVec(const MachineInstr &MI) const {
2739 const uint64_t V = getType(MI);
2740 return HexagonII::TypeCVI_FIRST <= V && V <= HexagonII::TypeCVI_LAST;
2741}
2742
2743// Check if the Offset is a valid auto-inc imm by Load/Store Type.
2744bool HexagonInstrInfo::isValidAutoIncImm(const EVT VT, int Offset) const {
2745 int Size = VT.getSizeInBits() / 8;
2746 if (Offset % Size != 0)
2747 return false;
2748 int Count = Offset / Size;
2749
2750 switch (VT.getSimpleVT().SimpleTy) {
2751 // For scalars the auto-inc is s4
2752 case MVT::i8:
2753 case MVT::i16:
2754 case MVT::i32:
2755 case MVT::i64:
2756 case MVT::f32:
2757 case MVT::f64:
2758 case MVT::v2i16:
2759 case MVT::v2i32:
2760 case MVT::v4i8:
2761 case MVT::v4i16:
2762 case MVT::v8i8:
2763 return isInt<4>(x: Count);
2764 // For HVX vectors the auto-inc is s3
2765 case MVT::v64i8:
2766 case MVT::v32i16:
2767 case MVT::v16i32:
2768 case MVT::v8i64:
2769 case MVT::v128i8:
2770 case MVT::v64i16:
2771 case MVT::v32i32:
2772 case MVT::v16i64:
2773 return isInt<3>(x: Count);
2774 default:
2775 break;
2776 }
2777
2778 llvm_unreachable("Not an valid type!");
2779}
2780
2781bool HexagonInstrInfo::isValidOffset(unsigned Opcode, int Offset,
2782 const TargetRegisterInfo *TRI, bool Extend) const {
2783 // This function is to check whether the "Offset" is in the correct range of
2784 // the given "Opcode". If "Offset" is not in the correct range, "A2_addi" is
2785 // inserted to calculate the final address. Due to this reason, the function
2786 // assumes that the "Offset" has correct alignment.
2787 // We used to assert if the offset was not properly aligned, however,
2788 // there are cases where a misaligned pointer recast can cause this
2789 // problem, and we need to allow for it. The front end warns of such
2790 // misaligns with respect to load size.
2791 switch (Opcode) {
2792 case Hexagon::PS_vstorerq_ai:
2793 case Hexagon::PS_vstorerv_ai:
2794 case Hexagon::PS_vstorerw_ai:
2795 case Hexagon::PS_vstorerw_nt_ai:
2796 case Hexagon::PS_vloadrq_ai:
2797 case Hexagon::PS_vloadrv_ai:
2798 case Hexagon::PS_vloadrw_ai:
2799 case Hexagon::PS_vloadrw_nt_ai:
2800 case Hexagon::V6_vL32b_ai:
2801 case Hexagon::V6_vS32b_ai:
2802 case Hexagon::V6_vS32b_pred_ai:
2803 case Hexagon::V6_vS32b_npred_ai:
2804 case Hexagon::V6_vS32b_qpred_ai:
2805 case Hexagon::V6_vS32b_nqpred_ai:
2806 case Hexagon::V6_vS32b_new_ai:
2807 case Hexagon::V6_vS32b_new_pred_ai:
2808 case Hexagon::V6_vS32b_new_npred_ai:
2809 case Hexagon::V6_vS32b_nt_pred_ai:
2810 case Hexagon::V6_vS32b_nt_npred_ai:
2811 case Hexagon::V6_vS32b_nt_new_ai:
2812 case Hexagon::V6_vS32b_nt_new_pred_ai:
2813 case Hexagon::V6_vS32b_nt_new_npred_ai:
2814 case Hexagon::V6_vS32b_nt_qpred_ai:
2815 case Hexagon::V6_vS32b_nt_nqpred_ai:
2816 case Hexagon::V6_vL32b_nt_ai:
2817 case Hexagon::V6_vS32b_nt_ai:
2818 case Hexagon::V6_vL32Ub_ai:
2819 case Hexagon::V6_vS32Ub_ai:
2820 case Hexagon::V6_vL32b_cur_ai:
2821 case Hexagon::V6_vL32b_tmp_ai:
2822 case Hexagon::V6_vL32b_pred_ai:
2823 case Hexagon::V6_vL32b_npred_ai:
2824 case Hexagon::V6_vL32b_cur_pred_ai:
2825 case Hexagon::V6_vL32b_cur_npred_ai:
2826 case Hexagon::V6_vL32b_tmp_pred_ai:
2827 case Hexagon::V6_vL32b_tmp_npred_ai:
2828 case Hexagon::V6_vL32b_nt_cur_ai:
2829 case Hexagon::V6_vL32b_nt_tmp_ai:
2830 case Hexagon::V6_vL32b_nt_pred_ai:
2831 case Hexagon::V6_vL32b_nt_npred_ai:
2832 case Hexagon::V6_vL32b_nt_cur_pred_ai:
2833 case Hexagon::V6_vL32b_nt_cur_npred_ai:
2834 case Hexagon::V6_vL32b_nt_tmp_pred_ai:
2835 case Hexagon::V6_vL32b_nt_tmp_npred_ai:
2836 case Hexagon::V6_vS32Ub_npred_ai:
2837 case Hexagon::V6_vgathermh_pseudo:
2838 case Hexagon::V6_vgather_vscatter_mh_pseudo:
2839 case Hexagon::V6_vgathermw_pseudo:
2840 case Hexagon::V6_vgathermhw_pseudo:
2841 case Hexagon::V6_vgathermhq_pseudo:
2842 case Hexagon::V6_vgathermwq_pseudo:
2843 case Hexagon::V6_vgathermhwq_pseudo: {
2844 unsigned VectorSize = TRI->getSpillSize(RC: Hexagon::HvxVRRegClass);
2845 assert(isPowerOf2_32(VectorSize));
2846 if (Offset & (VectorSize-1))
2847 return false;
2848 return isInt<4>(x: Offset >> Log2_32(Value: VectorSize));
2849 }
2850
2851 case Hexagon::J2_loop0i:
2852 case Hexagon::J2_loop1i:
2853 return isUInt<10>(x: Offset);
2854
2855 case Hexagon::S4_storeirb_io:
2856 case Hexagon::S4_storeirbt_io:
2857 case Hexagon::S4_storeirbf_io:
2858 return isUInt<6>(x: Offset);
2859
2860 case Hexagon::S4_storeirh_io:
2861 case Hexagon::S4_storeirht_io:
2862 case Hexagon::S4_storeirhf_io:
2863 return isShiftedUInt<6,1>(x: Offset);
2864
2865 case Hexagon::S4_storeiri_io:
2866 case Hexagon::S4_storeirit_io:
2867 case Hexagon::S4_storeirif_io:
2868 return isShiftedUInt<6,2>(x: Offset);
2869 // Handle these two compare instructions that are not extendable.
2870 case Hexagon::A4_cmpbeqi:
2871 return isUInt<8>(x: Offset);
2872 case Hexagon::A4_cmpbgti:
2873 return isInt<8>(x: Offset);
2874 }
2875
2876 if (Extend)
2877 return true;
2878
2879 switch (Opcode) {
2880 case Hexagon::L2_loadri_io:
2881 case Hexagon::S2_storeri_io:
2882 return (Offset >= Hexagon_MEMW_OFFSET_MIN) &&
2883 (Offset <= Hexagon_MEMW_OFFSET_MAX);
2884
2885 case Hexagon::L2_loadrd_io:
2886 case Hexagon::S2_storerd_io:
2887 return (Offset >= Hexagon_MEMD_OFFSET_MIN) &&
2888 (Offset <= Hexagon_MEMD_OFFSET_MAX);
2889
2890 case Hexagon::L2_loadrh_io:
2891 case Hexagon::L2_loadruh_io:
2892 case Hexagon::S2_storerh_io:
2893 case Hexagon::S2_storerf_io:
2894 return (Offset >= Hexagon_MEMH_OFFSET_MIN) &&
2895 (Offset <= Hexagon_MEMH_OFFSET_MAX);
2896
2897 case Hexagon::L2_loadrb_io:
2898 case Hexagon::L2_loadrub_io:
2899 case Hexagon::S2_storerb_io:
2900 return (Offset >= Hexagon_MEMB_OFFSET_MIN) &&
2901 (Offset <= Hexagon_MEMB_OFFSET_MAX);
2902
2903 case Hexagon::A2_addi:
2904 return (Offset >= Hexagon_ADDI_OFFSET_MIN) &&
2905 (Offset <= Hexagon_ADDI_OFFSET_MAX);
2906
2907 case Hexagon::L4_iadd_memopw_io:
2908 case Hexagon::L4_isub_memopw_io:
2909 case Hexagon::L4_add_memopw_io:
2910 case Hexagon::L4_sub_memopw_io:
2911 case Hexagon::L4_iand_memopw_io:
2912 case Hexagon::L4_ior_memopw_io:
2913 case Hexagon::L4_and_memopw_io:
2914 case Hexagon::L4_or_memopw_io:
2915 return (0 <= Offset && Offset <= 255);
2916
2917 case Hexagon::L4_iadd_memoph_io:
2918 case Hexagon::L4_isub_memoph_io:
2919 case Hexagon::L4_add_memoph_io:
2920 case Hexagon::L4_sub_memoph_io:
2921 case Hexagon::L4_iand_memoph_io:
2922 case Hexagon::L4_ior_memoph_io:
2923 case Hexagon::L4_and_memoph_io:
2924 case Hexagon::L4_or_memoph_io:
2925 return (0 <= Offset && Offset <= 127);
2926
2927 case Hexagon::L4_iadd_memopb_io:
2928 case Hexagon::L4_isub_memopb_io:
2929 case Hexagon::L4_add_memopb_io:
2930 case Hexagon::L4_sub_memopb_io:
2931 case Hexagon::L4_iand_memopb_io:
2932 case Hexagon::L4_ior_memopb_io:
2933 case Hexagon::L4_and_memopb_io:
2934 case Hexagon::L4_or_memopb_io:
2935 return (0 <= Offset && Offset <= 63);
2936
2937 // LDriw_xxx and STriw_xxx are pseudo operations, so it has to take offset of
2938 // any size. Later pass knows how to handle it.
2939 case Hexagon::STriw_pred:
2940 case Hexagon::LDriw_pred:
2941 case Hexagon::STriw_ctr:
2942 case Hexagon::LDriw_ctr:
2943 return true;
2944
2945 case Hexagon::PS_fi:
2946 case Hexagon::PS_fia:
2947 case Hexagon::INLINEASM:
2948 return true;
2949
2950 case Hexagon::L2_ploadrbt_io:
2951 case Hexagon::L2_ploadrbf_io:
2952 case Hexagon::L2_ploadrubt_io:
2953 case Hexagon::L2_ploadrubf_io:
2954 case Hexagon::S2_pstorerbt_io:
2955 case Hexagon::S2_pstorerbf_io:
2956 return isUInt<6>(x: Offset);
2957
2958 case Hexagon::L2_ploadrht_io:
2959 case Hexagon::L2_ploadrhf_io:
2960 case Hexagon::L2_ploadruht_io:
2961 case Hexagon::L2_ploadruhf_io:
2962 case Hexagon::S2_pstorerht_io:
2963 case Hexagon::S2_pstorerhf_io:
2964 case Hexagon::S2_pstorerft_io:
2965 case Hexagon::S2_pstorerff_io:
2966 return isShiftedUInt<6,1>(x: Offset);
2967
2968 case Hexagon::L2_ploadrit_io:
2969 case Hexagon::L2_ploadrif_io:
2970 case Hexagon::S2_pstorerit_io:
2971 case Hexagon::S2_pstorerif_io:
2972 return isShiftedUInt<6,2>(x: Offset);
2973
2974 case Hexagon::L2_ploadrdt_io:
2975 case Hexagon::L2_ploadrdf_io:
2976 case Hexagon::S2_pstorerdt_io:
2977 case Hexagon::S2_pstorerdf_io:
2978 return isShiftedUInt<6,3>(x: Offset);
2979
2980 case Hexagon::L2_loadbsw2_io:
2981 case Hexagon::L2_loadbzw2_io:
2982 return isShiftedInt<11,1>(x: Offset);
2983
2984 case Hexagon::L2_loadbsw4_io:
2985 case Hexagon::L2_loadbzw4_io:
2986 return isShiftedInt<11,2>(x: Offset);
2987 } // switch
2988
2989 dbgs() << "Failed Opcode is : " << Opcode << " (" << getName(Opcode)
2990 << ")\n";
2991 llvm_unreachable("No offset range is defined for this opcode. "
2992 "Please define it in the above switch statement!");
2993}
2994
2995bool HexagonInstrInfo::isVecAcc(const MachineInstr &MI) const {
2996 return isHVXVec(MI) && isAccumulator(MI);
2997}
2998
2999bool HexagonInstrInfo::isVecALU(const MachineInstr &MI) const {
3000 const uint64_t F = get(Opcode: MI.getOpcode()).TSFlags;
3001 const uint64_t V = ((F >> HexagonII::TypePos) & HexagonII::TypeMask);
3002 return
3003 V == HexagonII::TypeCVI_VA ||
3004 V == HexagonII::TypeCVI_VA_DV;
3005}
3006
3007bool HexagonInstrInfo::isVecUsableNextPacket(const MachineInstr &ProdMI,
3008 const MachineInstr &ConsMI) const {
3009 if (EnableACCForwarding && isVecAcc(MI: ProdMI) && isVecAcc(MI: ConsMI))
3010 return true;
3011
3012 if (EnableALUForwarding && (isVecALU(MI: ConsMI) || isLateSourceInstr(MI: ConsMI)))
3013 return true;
3014
3015 if (mayBeNewStore(MI: ConsMI))
3016 return true;
3017
3018 return false;
3019}
3020
3021bool HexagonInstrInfo::isZeroExtendingLoad(const MachineInstr &MI) const {
3022 switch (MI.getOpcode()) {
3023 // Byte
3024 case Hexagon::L2_loadrub_io:
3025 case Hexagon::L4_loadrub_ur:
3026 case Hexagon::L4_loadrub_ap:
3027 case Hexagon::L2_loadrub_pr:
3028 case Hexagon::L2_loadrub_pbr:
3029 case Hexagon::L2_loadrub_pi:
3030 case Hexagon::L2_loadrub_pci:
3031 case Hexagon::L2_loadrub_pcr:
3032 case Hexagon::L2_loadbzw2_io:
3033 case Hexagon::L4_loadbzw2_ur:
3034 case Hexagon::L4_loadbzw2_ap:
3035 case Hexagon::L2_loadbzw2_pr:
3036 case Hexagon::L2_loadbzw2_pbr:
3037 case Hexagon::L2_loadbzw2_pi:
3038 case Hexagon::L2_loadbzw2_pci:
3039 case Hexagon::L2_loadbzw2_pcr:
3040 case Hexagon::L2_loadbzw4_io:
3041 case Hexagon::L4_loadbzw4_ur:
3042 case Hexagon::L4_loadbzw4_ap:
3043 case Hexagon::L2_loadbzw4_pr:
3044 case Hexagon::L2_loadbzw4_pbr:
3045 case Hexagon::L2_loadbzw4_pi:
3046 case Hexagon::L2_loadbzw4_pci:
3047 case Hexagon::L2_loadbzw4_pcr:
3048 case Hexagon::L4_loadrub_rr:
3049 case Hexagon::L2_ploadrubt_io:
3050 case Hexagon::L2_ploadrubt_pi:
3051 case Hexagon::L2_ploadrubf_io:
3052 case Hexagon::L2_ploadrubf_pi:
3053 case Hexagon::L2_ploadrubtnew_io:
3054 case Hexagon::L2_ploadrubfnew_io:
3055 case Hexagon::L4_ploadrubt_rr:
3056 case Hexagon::L4_ploadrubf_rr:
3057 case Hexagon::L4_ploadrubtnew_rr:
3058 case Hexagon::L4_ploadrubfnew_rr:
3059 case Hexagon::L2_ploadrubtnew_pi:
3060 case Hexagon::L2_ploadrubfnew_pi:
3061 case Hexagon::L4_ploadrubt_abs:
3062 case Hexagon::L4_ploadrubf_abs:
3063 case Hexagon::L4_ploadrubtnew_abs:
3064 case Hexagon::L4_ploadrubfnew_abs:
3065 case Hexagon::L2_loadrubgp:
3066 // Half
3067 case Hexagon::L2_loadruh_io:
3068 case Hexagon::L4_loadruh_ur:
3069 case Hexagon::L4_loadruh_ap:
3070 case Hexagon::L2_loadruh_pr:
3071 case Hexagon::L2_loadruh_pbr:
3072 case Hexagon::L2_loadruh_pi:
3073 case Hexagon::L2_loadruh_pci:
3074 case Hexagon::L2_loadruh_pcr:
3075 case Hexagon::L4_loadruh_rr:
3076 case Hexagon::L2_ploadruht_io:
3077 case Hexagon::L2_ploadruht_pi:
3078 case Hexagon::L2_ploadruhf_io:
3079 case Hexagon::L2_ploadruhf_pi:
3080 case Hexagon::L2_ploadruhtnew_io:
3081 case Hexagon::L2_ploadruhfnew_io:
3082 case Hexagon::L4_ploadruht_rr:
3083 case Hexagon::L4_ploadruhf_rr:
3084 case Hexagon::L4_ploadruhtnew_rr:
3085 case Hexagon::L4_ploadruhfnew_rr:
3086 case Hexagon::L2_ploadruhtnew_pi:
3087 case Hexagon::L2_ploadruhfnew_pi:
3088 case Hexagon::L4_ploadruht_abs:
3089 case Hexagon::L4_ploadruhf_abs:
3090 case Hexagon::L4_ploadruhtnew_abs:
3091 case Hexagon::L4_ploadruhfnew_abs:
3092 case Hexagon::L2_loadruhgp:
3093 return true;
3094 default:
3095 return false;
3096 }
3097}
3098
3099// Add latency to instruction.
3100bool HexagonInstrInfo::addLatencyToSchedule(const MachineInstr &MI1,
3101 const MachineInstr &MI2) const {
3102 if (isHVXVec(MI: MI1) && isHVXVec(MI: MI2))
3103 if (!isVecUsableNextPacket(ProdMI: MI1, ConsMI: MI2))
3104 return true;
3105 return false;
3106}
3107
3108/// Get the base register and byte offset of a load/store instr.
3109bool HexagonInstrInfo::getMemOperandsWithOffsetWidth(
3110 const MachineInstr &LdSt, SmallVectorImpl<const MachineOperand *> &BaseOps,
3111 int64_t &Offset, bool &OffsetIsScalable, LocationSize &Width,
3112 const TargetRegisterInfo *TRI) const {
3113 OffsetIsScalable = false;
3114 const MachineOperand *BaseOp = getBaseAndOffset(MI: LdSt, Offset, AccessSize&: Width);
3115 if (!BaseOp || !BaseOp->isReg())
3116 return false;
3117 BaseOps.push_back(Elt: BaseOp);
3118 return true;
3119}
3120
3121/// Can these instructions execute at the same time in a bundle.
3122bool HexagonInstrInfo::canExecuteInBundle(const MachineInstr &First,
3123 const MachineInstr &Second) const {
3124 if (Second.mayStore() && First.getOpcode() == Hexagon::S2_allocframe) {
3125 const MachineOperand &Op = Second.getOperand(i: 0);
3126 if (Op.isReg() && Op.isUse() && Op.getReg() == Hexagon::R29)
3127 return true;
3128 }
3129 if (DisableNVSchedule)
3130 return false;
3131 if (mayBeNewStore(MI: Second)) {
3132 // Make sure the definition of the first instruction is the value being
3133 // stored.
3134 const MachineOperand &Stored =
3135 Second.getOperand(i: Second.getNumOperands() - 1);
3136 if (!Stored.isReg())
3137 return false;
3138 for (unsigned i = 0, e = First.getNumOperands(); i < e; ++i) {
3139 const MachineOperand &Op = First.getOperand(i);
3140 if (Op.isReg() && Op.isDef() && Op.getReg() == Stored.getReg())
3141 return true;
3142 }
3143 }
3144 return false;
3145}
3146
3147bool HexagonInstrInfo::doesNotReturn(const MachineInstr &CallMI) const {
3148 unsigned Opc = CallMI.getOpcode();
3149 return Opc == Hexagon::PS_call_nr || Opc == Hexagon::PS_callr_nr;
3150}
3151
3152bool HexagonInstrInfo::hasEHLabel(const MachineBasicBlock *B) const {
3153 for (auto &I : *B)
3154 if (I.isEHLabel())
3155 return true;
3156 return false;
3157}
3158
3159// Returns true if an instruction can be converted into a non-extended
3160// equivalent instruction.
3161bool HexagonInstrInfo::hasNonExtEquivalent(const MachineInstr &MI) const {
3162 short NonExtOpcode;
3163 // Check if the instruction has a register form that uses register in place
3164 // of the extended operand, if so return that as the non-extended form.
3165 if (Hexagon::getRegForm(Opcode: MI.getOpcode()) >= 0)
3166 return true;
3167
3168 if (MI.getDesc().mayLoad() || MI.getDesc().mayStore()) {
3169 // Check addressing mode and retrieve non-ext equivalent instruction.
3170
3171 switch (getAddrMode(MI)) {
3172 case HexagonII::Absolute:
3173 // Load/store with absolute addressing mode can be converted into
3174 // base+offset mode.
3175 NonExtOpcode = Hexagon::changeAddrMode_abs_io(Opcode: MI.getOpcode());
3176 break;
3177 case HexagonII::BaseImmOffset:
3178 // Load/store with base+offset addressing mode can be converted into
3179 // base+register offset addressing mode. However left shift operand should
3180 // be set to 0.
3181 NonExtOpcode = Hexagon::changeAddrMode_io_rr(Opcode: MI.getOpcode());
3182 break;
3183 case HexagonII::BaseLongOffset:
3184 NonExtOpcode = Hexagon::changeAddrMode_ur_rr(Opcode: MI.getOpcode());
3185 break;
3186 default:
3187 return false;
3188 }
3189 if (NonExtOpcode < 0)
3190 return false;
3191 return true;
3192 }
3193 return false;
3194}
3195
3196bool HexagonInstrInfo::hasPseudoInstrPair(const MachineInstr &MI) const {
3197 return Hexagon::getRealHWInstr(Opcode: MI.getOpcode(),
3198 inInstrType: Hexagon::InstrType_Pseudo) >= 0;
3199}
3200
3201bool HexagonInstrInfo::hasUncondBranch(const MachineBasicBlock *B)
3202 const {
3203 MachineBasicBlock::const_iterator I = B->getFirstTerminator(), E = B->end();
3204 while (I != E) {
3205 if (I->isBarrier())
3206 return true;
3207 ++I;
3208 }
3209 return false;
3210}
3211
3212// Returns true, if a LD insn can be promoted to a cur load.
3213bool HexagonInstrInfo::mayBeCurLoad(const MachineInstr &MI) const {
3214 const uint64_t F = MI.getDesc().TSFlags;
3215 return ((F >> HexagonII::mayCVLoadPos) & HexagonII::mayCVLoadMask) &&
3216 Subtarget.hasV60Ops();
3217}
3218
3219// Returns true, if a ST insn can be promoted to a new-value store.
3220bool HexagonInstrInfo::mayBeNewStore(const MachineInstr &MI) const {
3221 if (MI.mayStore() && !Subtarget.useNewValueStores())
3222 return false;
3223
3224 const uint64_t F = MI.getDesc().TSFlags;
3225 return (F >> HexagonII::mayNVStorePos) & HexagonII::mayNVStoreMask;
3226}
3227
3228bool HexagonInstrInfo::producesStall(const MachineInstr &ProdMI,
3229 const MachineInstr &ConsMI) const {
3230 // There is no stall when ProdMI is not a V60 vector.
3231 if (!isHVXVec(MI: ProdMI))
3232 return false;
3233
3234 // There is no stall when ProdMI and ConsMI are not dependent.
3235 if (!isDependent(ProdMI, ConsMI))
3236 return false;
3237
3238 // When Forward Scheduling is enabled, there is no stall if ProdMI and ConsMI
3239 // are scheduled in consecutive packets.
3240 if (isVecUsableNextPacket(ProdMI, ConsMI))
3241 return false;
3242
3243 return true;
3244}
3245
3246bool HexagonInstrInfo::producesStall(const MachineInstr &MI,
3247 MachineBasicBlock::const_instr_iterator BII) const {
3248 // There is no stall when I is not a V60 vector.
3249 if (!isHVXVec(MI))
3250 return false;
3251
3252 MachineBasicBlock::const_instr_iterator MII = BII;
3253 MachineBasicBlock::const_instr_iterator MIE = MII->getParent()->instr_end();
3254
3255 if (!MII->isBundle())
3256 return producesStall(ProdMI: *MII, ConsMI: MI);
3257
3258 for (++MII; MII != MIE && MII->isInsideBundle(); ++MII) {
3259 const MachineInstr &J = *MII;
3260 if (producesStall(ProdMI: J, ConsMI: MI))
3261 return true;
3262 }
3263 return false;
3264}
3265
3266bool HexagonInstrInfo::predCanBeUsedAsDotNew(const MachineInstr &MI,
3267 Register PredReg) const {
3268 for (const MachineOperand &MO : MI.operands()) {
3269 // Predicate register must be explicitly defined.
3270 if (MO.isRegMask() && MO.clobbersPhysReg(PhysReg: PredReg))
3271 return false;
3272 if (MO.isReg() && MO.isDef() && MO.isImplicit() && (MO.getReg() == PredReg))
3273 return false;
3274 }
3275
3276 // Instruction that produce late predicate cannot be used as sources of
3277 // dot-new.
3278 switch (MI.getOpcode()) {
3279 case Hexagon::A4_addp_c:
3280 case Hexagon::A4_subp_c:
3281 case Hexagon::A4_tlbmatch:
3282 case Hexagon::A5_ACS:
3283 case Hexagon::F2_sfinvsqrta:
3284 case Hexagon::F2_sfrecipa:
3285 case Hexagon::J2_endloop0:
3286 case Hexagon::J2_endloop01:
3287 case Hexagon::J2_ploop1si:
3288 case Hexagon::J2_ploop1sr:
3289 case Hexagon::J2_ploop2si:
3290 case Hexagon::J2_ploop2sr:
3291 case Hexagon::J2_ploop3si:
3292 case Hexagon::J2_ploop3sr:
3293 case Hexagon::S2_cabacdecbin:
3294 case Hexagon::S2_storew_locked:
3295 case Hexagon::S4_stored_locked:
3296 return false;
3297 }
3298 return true;
3299}
3300
3301bool HexagonInstrInfo::PredOpcodeHasJMP_c(unsigned Opcode) const {
3302 return Opcode == Hexagon::J2_jumpt ||
3303 Opcode == Hexagon::J2_jumptpt ||
3304 Opcode == Hexagon::J2_jumpf ||
3305 Opcode == Hexagon::J2_jumpfpt ||
3306 Opcode == Hexagon::J2_jumptnew ||
3307 Opcode == Hexagon::J2_jumpfnew ||
3308 Opcode == Hexagon::J2_jumptnewpt ||
3309 Opcode == Hexagon::J2_jumpfnewpt;
3310}
3311
3312bool HexagonInstrInfo::predOpcodeHasNot(ArrayRef<MachineOperand> Cond) const {
3313 if (Cond.empty() || !isPredicated(Opcode: Cond[0].getImm()))
3314 return false;
3315 return !isPredicatedTrue(Opcode: Cond[0].getImm());
3316}
3317
3318unsigned HexagonInstrInfo::getAddrMode(const MachineInstr &MI) const {
3319 const uint64_t F = MI.getDesc().TSFlags;
3320 return (F >> HexagonII::AddrModePos) & HexagonII::AddrModeMask;
3321}
3322
3323// Returns the base register in a memory access (load/store). The offset is
3324// returned in Offset and the access size is returned in AccessSize.
3325// If the base operand has a subregister or the offset field does not contain
3326// an immediate value, return nullptr.
3327MachineOperand *
3328HexagonInstrInfo::getBaseAndOffset(const MachineInstr &MI, int64_t &Offset,
3329 LocationSize &AccessSize) const {
3330 // Return if it is not a base+offset type instruction or a MemOp.
3331 if (getAddrMode(MI) != HexagonII::BaseImmOffset &&
3332 getAddrMode(MI) != HexagonII::BaseLongOffset && !isMemOp(MI) &&
3333 !isPostIncrement(MI))
3334 return nullptr;
3335
3336 AccessSize = LocationSize::precise(Value: getMemAccessSize(MI));
3337
3338 unsigned BasePos = 0, OffsetPos = 0;
3339 if (!getBaseAndOffsetPosition(MI, BasePos, OffsetPos))
3340 return nullptr;
3341
3342 // Post increment updates its EA after the mem access,
3343 // so we need to treat its offset as zero.
3344 if (isPostIncrement(MI)) {
3345 Offset = 0;
3346 } else {
3347 const MachineOperand &OffsetOp = MI.getOperand(i: OffsetPos);
3348 if (!OffsetOp.isImm())
3349 return nullptr;
3350 Offset = OffsetOp.getImm();
3351 }
3352
3353 const MachineOperand &BaseOp = MI.getOperand(i: BasePos);
3354 if (BaseOp.getSubReg() != 0)
3355 return nullptr;
3356 return &const_cast<MachineOperand&>(BaseOp);
3357}
3358
3359/// Return the position of the base and offset operands for this instruction.
3360bool HexagonInstrInfo::getBaseAndOffsetPosition(const MachineInstr &MI,
3361 unsigned &BasePos, unsigned &OffsetPos) const {
3362 if (!isAddrModeWithOffset(MI) && !isPostIncrement(MI))
3363 return false;
3364
3365 // Deal with memops first.
3366 if (isMemOp(MI)) {
3367 BasePos = 0;
3368 OffsetPos = 1;
3369 } else if (MI.mayStore()) {
3370 BasePos = 0;
3371 OffsetPos = 1;
3372 } else if (MI.mayLoad()) {
3373 BasePos = 1;
3374 OffsetPos = 2;
3375 } else
3376 return false;
3377
3378 if (isPredicated(MI)) {
3379 BasePos++;
3380 OffsetPos++;
3381 }
3382 if (isPostIncrement(MI)) {
3383 BasePos++;
3384 OffsetPos++;
3385 }
3386
3387 if (!MI.getOperand(i: BasePos).isReg() || !MI.getOperand(i: OffsetPos).isImm())
3388 return false;
3389
3390 return true;
3391}
3392
3393// Inserts branching instructions in reverse order of their occurrence.
3394// e.g. jump_t t1 (i1)
3395// jump t2 (i2)
3396// Jumpers = {i2, i1}
3397SmallVector<MachineInstr*, 2> HexagonInstrInfo::getBranchingInstrs(
3398 MachineBasicBlock& MBB) const {
3399 SmallVector<MachineInstr*, 2> Jumpers;
3400 // If the block has no terminators, it just falls into the block after it.
3401 MachineBasicBlock::instr_iterator I = MBB.instr_end();
3402 if (I == MBB.instr_begin())
3403 return Jumpers;
3404
3405 // A basic block may looks like this:
3406 //
3407 // [ insn
3408 // EH_LABEL
3409 // insn
3410 // insn
3411 // insn
3412 // EH_LABEL
3413 // insn ]
3414 //
3415 // It has two succs but does not have a terminator
3416 // Don't know how to handle it.
3417 do {
3418 --I;
3419 if (I->isEHLabel())
3420 return Jumpers;
3421 } while (I != MBB.instr_begin());
3422
3423 I = MBB.instr_end();
3424 --I;
3425
3426 while (I->isDebugInstr()) {
3427 if (I == MBB.instr_begin())
3428 return Jumpers;
3429 --I;
3430 }
3431 if (!isUnpredicatedTerminator(MI: *I))
3432 return Jumpers;
3433
3434 // Get the last instruction in the block.
3435 MachineInstr *LastInst = &*I;
3436 Jumpers.push_back(Elt: LastInst);
3437 MachineInstr *SecondLastInst = nullptr;
3438 // Find one more terminator if present.
3439 do {
3440 if (&*I != LastInst && !I->isBundle() && isUnpredicatedTerminator(MI: *I)) {
3441 if (!SecondLastInst) {
3442 SecondLastInst = &*I;
3443 Jumpers.push_back(Elt: SecondLastInst);
3444 } else // This is a third branch.
3445 return Jumpers;
3446 }
3447 if (I == MBB.instr_begin())
3448 break;
3449 --I;
3450 } while (true);
3451 return Jumpers;
3452}
3453
3454// Returns Operand Index for the constant extended instruction.
3455unsigned HexagonInstrInfo::getCExtOpNum(const MachineInstr &MI) const {
3456 const uint64_t F = MI.getDesc().TSFlags;
3457 return (F >> HexagonII::ExtendableOpPos) & HexagonII::ExtendableOpMask;
3458}
3459
3460// See if instruction could potentially be a duplex candidate.
3461// If so, return its group. Zero otherwise.
3462HexagonII::CompoundGroup HexagonInstrInfo::getCompoundCandidateGroup(
3463 const MachineInstr &MI) const {
3464 Register DstReg, SrcReg, Src1Reg, Src2Reg;
3465
3466 switch (MI.getOpcode()) {
3467 default:
3468 return HexagonII::HCG_None;
3469 //
3470 // Compound pairs.
3471 // "p0=cmp.eq(Rs16,Rt16); if (p0.new) jump:nt #r9:2"
3472 // "Rd16=#U6 ; jump #r9:2"
3473 // "Rd16=Rs16 ; jump #r9:2"
3474 //
3475 case Hexagon::C2_cmpeq:
3476 case Hexagon::C2_cmpgt:
3477 case Hexagon::C2_cmpgtu:
3478 DstReg = MI.getOperand(i: 0).getReg();
3479 Src1Reg = MI.getOperand(i: 1).getReg();
3480 Src2Reg = MI.getOperand(i: 2).getReg();
3481 if (Hexagon::PredRegsRegClass.contains(Reg: DstReg) &&
3482 (Hexagon::P0 == DstReg || Hexagon::P1 == DstReg) &&
3483 isIntRegForSubInst(Reg: Src1Reg) && isIntRegForSubInst(Reg: Src2Reg))
3484 return HexagonII::HCG_A;
3485 break;
3486 case Hexagon::C2_cmpeqi:
3487 case Hexagon::C2_cmpgti:
3488 case Hexagon::C2_cmpgtui:
3489 // P0 = cmp.eq(Rs,#u2)
3490 DstReg = MI.getOperand(i: 0).getReg();
3491 SrcReg = MI.getOperand(i: 1).getReg();
3492 if (Hexagon::PredRegsRegClass.contains(Reg: DstReg) &&
3493 (Hexagon::P0 == DstReg || Hexagon::P1 == DstReg) &&
3494 isIntRegForSubInst(Reg: SrcReg) && MI.getOperand(i: 2).isImm() &&
3495 ((isUInt<5>(x: MI.getOperand(i: 2).getImm())) ||
3496 (MI.getOperand(i: 2).getImm() == -1)))
3497 return HexagonII::HCG_A;
3498 break;
3499 case Hexagon::A2_tfr:
3500 // Rd = Rs
3501 DstReg = MI.getOperand(i: 0).getReg();
3502 SrcReg = MI.getOperand(i: 1).getReg();
3503 if (isIntRegForSubInst(Reg: DstReg) && isIntRegForSubInst(Reg: SrcReg))
3504 return HexagonII::HCG_A;
3505 break;
3506 case Hexagon::A2_tfrsi:
3507 // Rd = #u6
3508 // Do not test for #u6 size since the const is getting extended
3509 // regardless and compound could be formed.
3510 DstReg = MI.getOperand(i: 0).getReg();
3511 if (isIntRegForSubInst(Reg: DstReg))
3512 return HexagonII::HCG_A;
3513 break;
3514 case Hexagon::S2_tstbit_i:
3515 DstReg = MI.getOperand(i: 0).getReg();
3516 Src1Reg = MI.getOperand(i: 1).getReg();
3517 if (Hexagon::PredRegsRegClass.contains(Reg: DstReg) &&
3518 (Hexagon::P0 == DstReg || Hexagon::P1 == DstReg) &&
3519 MI.getOperand(i: 2).isImm() &&
3520 isIntRegForSubInst(Reg: Src1Reg) && (MI.getOperand(i: 2).getImm() == 0))
3521 return HexagonII::HCG_A;
3522 break;
3523 // The fact that .new form is used pretty much guarantees
3524 // that predicate register will match. Nevertheless,
3525 // there could be some false positives without additional
3526 // checking.
3527 case Hexagon::J2_jumptnew:
3528 case Hexagon::J2_jumpfnew:
3529 case Hexagon::J2_jumptnewpt:
3530 case Hexagon::J2_jumpfnewpt:
3531 Src1Reg = MI.getOperand(i: 0).getReg();
3532 if (Hexagon::PredRegsRegClass.contains(Reg: Src1Reg) &&
3533 (Hexagon::P0 == Src1Reg || Hexagon::P1 == Src1Reg))
3534 return HexagonII::HCG_B;
3535 break;
3536 // Transfer and jump:
3537 // Rd=#U6 ; jump #r9:2
3538 // Rd=Rs ; jump #r9:2
3539 // Do not test for jump range here.
3540 case Hexagon::J2_jump:
3541 case Hexagon::RESTORE_DEALLOC_RET_JMP_V4:
3542 case Hexagon::RESTORE_DEALLOC_RET_JMP_V4_PIC:
3543 return HexagonII::HCG_C;
3544 }
3545
3546 return HexagonII::HCG_None;
3547}
3548
3549// Returns -1 when there is no opcode found.
3550unsigned HexagonInstrInfo::getCompoundOpcode(const MachineInstr &GA,
3551 const MachineInstr &GB) const {
3552 assert(getCompoundCandidateGroup(GA) == HexagonII::HCG_A);
3553 assert(getCompoundCandidateGroup(GB) == HexagonII::HCG_B);
3554 if ((GA.getOpcode() != Hexagon::C2_cmpeqi) ||
3555 (GB.getOpcode() != Hexagon::J2_jumptnew))
3556 return -1u;
3557 Register DestReg = GA.getOperand(i: 0).getReg();
3558 if (!GB.readsRegister(Reg: DestReg, /*TRI=*/nullptr))
3559 return -1u;
3560 if (DestReg != Hexagon::P0 && DestReg != Hexagon::P1)
3561 return -1u;
3562 // The value compared against must be either u5 or -1.
3563 const MachineOperand &CmpOp = GA.getOperand(i: 2);
3564 if (!CmpOp.isImm())
3565 return -1u;
3566 int V = CmpOp.getImm();
3567 if (V == -1)
3568 return DestReg == Hexagon::P0 ? Hexagon::J4_cmpeqn1_tp0_jump_nt
3569 : Hexagon::J4_cmpeqn1_tp1_jump_nt;
3570 if (!isUInt<5>(x: V))
3571 return -1u;
3572 return DestReg == Hexagon::P0 ? Hexagon::J4_cmpeqi_tp0_jump_nt
3573 : Hexagon::J4_cmpeqi_tp1_jump_nt;
3574}
3575
3576// Returns -1 if there is no opcode found.
3577int HexagonInstrInfo::getDuplexOpcode(const MachineInstr &MI,
3578 bool ForBigCore) const {
3579 // Static table to switch the opcodes across Tiny Core and Big Core.
3580 // dup_ opcodes are Big core opcodes.
3581 // NOTE: There are special instructions that need to handled later.
3582 // L4_return* instructions, they will only occupy SLOT0 (on big core too).
3583 // PS_jmpret - This pseudo translates to J2_jumpr which occupies only SLOT2.
3584 // The compiler need to base the root instruction to L6_return_map_to_raw
3585 // which can go any slot.
3586 static const std::map<unsigned, unsigned> DupMap = {
3587 {Hexagon::A2_add, Hexagon::dup_A2_add},
3588 {Hexagon::A2_addi, Hexagon::dup_A2_addi},
3589 {Hexagon::A2_andir, Hexagon::dup_A2_andir},
3590 {Hexagon::A2_combineii, Hexagon::dup_A2_combineii},
3591 {Hexagon::A2_sxtb, Hexagon::dup_A2_sxtb},
3592 {Hexagon::A2_sxth, Hexagon::dup_A2_sxth},
3593 {Hexagon::A2_tfr, Hexagon::dup_A2_tfr},
3594 {Hexagon::A2_tfrsi, Hexagon::dup_A2_tfrsi},
3595 {Hexagon::A2_zxtb, Hexagon::dup_A2_zxtb},
3596 {Hexagon::A2_zxth, Hexagon::dup_A2_zxth},
3597 {Hexagon::A4_combineii, Hexagon::dup_A4_combineii},
3598 {Hexagon::A4_combineir, Hexagon::dup_A4_combineir},
3599 {Hexagon::A4_combineri, Hexagon::dup_A4_combineri},
3600 {Hexagon::C2_cmoveif, Hexagon::dup_C2_cmoveif},
3601 {Hexagon::C2_cmoveit, Hexagon::dup_C2_cmoveit},
3602 {Hexagon::C2_cmovenewif, Hexagon::dup_C2_cmovenewif},
3603 {Hexagon::C2_cmovenewit, Hexagon::dup_C2_cmovenewit},
3604 {Hexagon::C2_cmpeqi, Hexagon::dup_C2_cmpeqi},
3605 {Hexagon::L2_deallocframe, Hexagon::dup_L2_deallocframe},
3606 {Hexagon::L2_loadrb_io, Hexagon::dup_L2_loadrb_io},
3607 {Hexagon::L2_loadrd_io, Hexagon::dup_L2_loadrd_io},
3608 {Hexagon::L2_loadrh_io, Hexagon::dup_L2_loadrh_io},
3609 {Hexagon::L2_loadri_io, Hexagon::dup_L2_loadri_io},
3610 {Hexagon::L2_loadrub_io, Hexagon::dup_L2_loadrub_io},
3611 {Hexagon::L2_loadruh_io, Hexagon::dup_L2_loadruh_io},
3612 {Hexagon::S2_allocframe, Hexagon::dup_S2_allocframe},
3613 {Hexagon::S2_storerb_io, Hexagon::dup_S2_storerb_io},
3614 {Hexagon::S2_storerd_io, Hexagon::dup_S2_storerd_io},
3615 {Hexagon::S2_storerh_io, Hexagon::dup_S2_storerh_io},
3616 {Hexagon::S2_storeri_io, Hexagon::dup_S2_storeri_io},
3617 {Hexagon::S4_storeirb_io, Hexagon::dup_S4_storeirb_io},
3618 {Hexagon::S4_storeiri_io, Hexagon::dup_S4_storeiri_io},
3619 };
3620 unsigned OpNum = MI.getOpcode();
3621 // Conversion to Big core.
3622 if (ForBigCore) {
3623 auto Iter = DupMap.find(x: OpNum);
3624 if (Iter != DupMap.end())
3625 return Iter->second;
3626 } else { // Conversion to Tiny core.
3627 for (const auto &Iter : DupMap)
3628 if (Iter.second == OpNum)
3629 return Iter.first;
3630 }
3631 return -1;
3632}
3633
3634int HexagonInstrInfo::getCondOpcode(int Opc, bool invertPredicate) const {
3635 enum Hexagon::PredSense inPredSense;
3636 inPredSense = invertPredicate ? Hexagon::PredSense_false :
3637 Hexagon::PredSense_true;
3638 int CondOpcode = Hexagon::getPredOpcode(Opcode: Opc, inPredSense);
3639 if (CondOpcode >= 0) // Valid Conditional opcode/instruction
3640 return CondOpcode;
3641
3642 llvm_unreachable("Unexpected predicable instruction");
3643}
3644
3645// Return the cur value instruction for a given store.
3646int HexagonInstrInfo::getDotCurOp(const MachineInstr &MI) const {
3647 switch (MI.getOpcode()) {
3648 default: llvm_unreachable("Unknown .cur type");
3649 case Hexagon::V6_vL32b_pi:
3650 return Hexagon::V6_vL32b_cur_pi;
3651 case Hexagon::V6_vL32b_ai:
3652 return Hexagon::V6_vL32b_cur_ai;
3653 case Hexagon::V6_vL32b_nt_pi:
3654 return Hexagon::V6_vL32b_nt_cur_pi;
3655 case Hexagon::V6_vL32b_nt_ai:
3656 return Hexagon::V6_vL32b_nt_cur_ai;
3657 case Hexagon::V6_vL32b_ppu:
3658 return Hexagon::V6_vL32b_cur_ppu;
3659 case Hexagon::V6_vL32b_nt_ppu:
3660 return Hexagon::V6_vL32b_nt_cur_ppu;
3661 }
3662 return 0;
3663}
3664
3665// Return the regular version of the .cur instruction.
3666int HexagonInstrInfo::getNonDotCurOp(const MachineInstr &MI) const {
3667 switch (MI.getOpcode()) {
3668 default: llvm_unreachable("Unknown .cur type");
3669 case Hexagon::V6_vL32b_cur_pi:
3670 return Hexagon::V6_vL32b_pi;
3671 case Hexagon::V6_vL32b_cur_ai:
3672 return Hexagon::V6_vL32b_ai;
3673 case Hexagon::V6_vL32b_nt_cur_pi:
3674 return Hexagon::V6_vL32b_nt_pi;
3675 case Hexagon::V6_vL32b_nt_cur_ai:
3676 return Hexagon::V6_vL32b_nt_ai;
3677 case Hexagon::V6_vL32b_cur_ppu:
3678 return Hexagon::V6_vL32b_ppu;
3679 case Hexagon::V6_vL32b_nt_cur_ppu:
3680 return Hexagon::V6_vL32b_nt_ppu;
3681 }
3682 return 0;
3683}
3684
3685// The diagram below shows the steps involved in the conversion of a predicated
3686// store instruction to its .new predicated new-value form.
3687//
3688// Note: It doesn't include conditional new-value stores as they can't be
3689// converted to .new predicate.
3690//
3691// p.new NV store [ if(p0.new)memw(R0+#0)=R2.new ]
3692// ^ ^
3693// / \ (not OK. it will cause new-value store to be
3694// / X conditional on p0.new while R2 producer is
3695// / \ on p0)
3696// / \.
3697// p.new store p.old NV store
3698// [if(p0.new)memw(R0+#0)=R2] [if(p0)memw(R0+#0)=R2.new]
3699// ^ ^
3700// \ /
3701// \ /
3702// \ /
3703// p.old store
3704// [if (p0)memw(R0+#0)=R2]
3705//
3706// The following set of instructions further explains the scenario where
3707// conditional new-value store becomes invalid when promoted to .new predicate
3708// form.
3709//
3710// { 1) if (p0) r0 = add(r1, r2)
3711// 2) p0 = cmp.eq(r3, #0) }
3712//
3713// 3) if (p0) memb(r1+#0) = r0 --> this instruction can't be grouped with
3714// the first two instructions because in instr 1, r0 is conditional on old value
3715// of p0 but its use in instr 3 is conditional on p0 modified by instr 2 which
3716// is not valid for new-value stores.
3717// Predicated new value stores (i.e. if (p0) memw(..)=r0.new) are excluded
3718// from the "Conditional Store" list. Because a predicated new value store
3719// would NOT be promoted to a double dot new store. See diagram below:
3720// This function returns yes for those stores that are predicated but not
3721// yet promoted to predicate dot new instructions.
3722//
3723// +---------------------+
3724// /-----| if (p0) memw(..)=r0 |---------\~
3725// || +---------------------+ ||
3726// promote || /\ /\ || promote
3727// || /||\ /||\ ||
3728// \||/ demote || \||/
3729// \/ || || \/
3730// +-------------------------+ || +-------------------------+
3731// | if (p0.new) memw(..)=r0 | || | if (p0) memw(..)=r0.new |
3732// +-------------------------+ || +-------------------------+
3733// || || ||
3734// || demote \||/
3735// promote || \/ NOT possible
3736// || || /\~
3737// \||/ || /||\~
3738// \/ || ||
3739// +-----------------------------+
3740// | if (p0.new) memw(..)=r0.new |
3741// +-----------------------------+
3742// Double Dot New Store
3743//
3744// Returns the most basic instruction for the .new predicated instructions and
3745// new-value stores.
3746// For example, all of the following instructions will be converted back to the
3747// same instruction:
3748// 1) if (p0.new) memw(R0+#0) = R1.new --->
3749// 2) if (p0) memw(R0+#0)= R1.new -------> if (p0) memw(R0+#0) = R1
3750// 3) if (p0.new) memw(R0+#0) = R1 --->
3751//
3752// To understand the translation of instruction 1 to its original form, consider
3753// a packet with 3 instructions.
3754// { p0 = cmp.eq(R0,R1)
3755// if (p0.new) R2 = add(R3, R4)
3756// R5 = add (R3, R1)
3757// }
3758// if (p0) memw(R5+#0) = R2 <--- trying to include it in the previous packet
3759//
3760// This instruction can be part of the previous packet only if both p0 and R2
3761// are promoted to .new values. This promotion happens in steps, first
3762// predicate register is promoted to .new and in the next iteration R2 is
3763// promoted. Therefore, in case of dependence check failure (due to R5) during
3764// next iteration, it should be converted back to its most basic form.
3765
3766// Return the new value instruction for a given store.
3767int HexagonInstrInfo::getDotNewOp(const MachineInstr &MI) const {
3768 int NVOpcode = Hexagon::getNewValueOpcode(Opcode: MI.getOpcode());
3769 if (NVOpcode >= 0) // Valid new-value store instruction.
3770 return NVOpcode;
3771
3772 switch (MI.getOpcode()) {
3773 default:
3774 report_fatal_error(reason: Twine("Unknown .new type: ") +
3775 std::to_string(val: MI.getOpcode()));
3776 case Hexagon::S4_storerb_ur:
3777 return Hexagon::S4_storerbnew_ur;
3778
3779 case Hexagon::S2_storerb_pci:
3780 return Hexagon::S2_storerb_pci;
3781
3782 case Hexagon::S2_storeri_pci:
3783 return Hexagon::S2_storeri_pci;
3784
3785 case Hexagon::S2_storerh_pci:
3786 return Hexagon::S2_storerh_pci;
3787
3788 case Hexagon::S2_storerd_pci:
3789 return Hexagon::S2_storerd_pci;
3790
3791 case Hexagon::S2_storerf_pci:
3792 return Hexagon::S2_storerf_pci;
3793
3794 case Hexagon::V6_vS32b_ai:
3795 return Hexagon::V6_vS32b_new_ai;
3796
3797 case Hexagon::V6_vS32b_pi:
3798 return Hexagon::V6_vS32b_new_pi;
3799 }
3800 return 0;
3801}
3802
3803// Returns the opcode to use when converting MI, which is a conditional jump,
3804// into a conditional instruction which uses the .new value of the predicate.
3805// We also use branch probabilities to add a hint to the jump.
3806// If MBPI is null, all edges will be treated as equally likely for the
3807// purposes of establishing a predication hint.
3808int HexagonInstrInfo::getDotNewPredJumpOp(const MachineInstr &MI,
3809 const MachineBranchProbabilityInfo *MBPI) const {
3810 // We assume that block can have at most two successors.
3811 const MachineBasicBlock *Src = MI.getParent();
3812 const MachineOperand &BrTarget = MI.getOperand(i: 1);
3813 bool Taken = false;
3814 const BranchProbability OneHalf(1, 2);
3815
3816 auto getEdgeProbability = [MBPI] (const MachineBasicBlock *Src,
3817 const MachineBasicBlock *Dst) {
3818 if (MBPI)
3819 return MBPI->getEdgeProbability(Src, Dst);
3820 return BranchProbability(1, Src->succ_size());
3821 };
3822
3823 if (BrTarget.isMBB()) {
3824 const MachineBasicBlock *Dst = BrTarget.getMBB();
3825 Taken = getEdgeProbability(Src, Dst) >= OneHalf;
3826 } else {
3827 // The branch target is not a basic block (most likely a function).
3828 // Since BPI only gives probabilities for targets that are basic blocks,
3829 // try to identify another target of this branch (potentially a fall-
3830 // -through) and check the probability of that target.
3831 //
3832 // The only handled branch combinations are:
3833 // - one conditional branch,
3834 // - one conditional branch followed by one unconditional branch.
3835 // Otherwise, assume not-taken.
3836 assert(MI.isConditionalBranch());
3837 const MachineBasicBlock &B = *MI.getParent();
3838 bool SawCond = false, Bad = false;
3839 for (const MachineInstr &I : B) {
3840 if (!I.isBranch())
3841 continue;
3842 if (I.isConditionalBranch()) {
3843 SawCond = true;
3844 if (&I != &MI) {
3845 Bad = true;
3846 break;
3847 }
3848 }
3849 if (I.isUnconditionalBranch() && !SawCond) {
3850 Bad = true;
3851 break;
3852 }
3853 }
3854 if (!Bad) {
3855 MachineBasicBlock::const_instr_iterator It(MI);
3856 MachineBasicBlock::const_instr_iterator NextIt = std::next(x: It);
3857 if (NextIt == B.instr_end()) {
3858 // If this branch is the last, look for the fall-through block.
3859 for (const MachineBasicBlock *SB : B.successors()) {
3860 if (!B.isLayoutSuccessor(MBB: SB))
3861 continue;
3862 Taken = getEdgeProbability(Src, SB) < OneHalf;
3863 break;
3864 }
3865 } else {
3866 assert(NextIt->isUnconditionalBranch());
3867 // Find the first MBB operand and assume it's the target.
3868 const MachineBasicBlock *BT = nullptr;
3869 for (const MachineOperand &Op : NextIt->operands()) {
3870 if (!Op.isMBB())
3871 continue;
3872 BT = Op.getMBB();
3873 break;
3874 }
3875 Taken = BT && getEdgeProbability(Src, BT) < OneHalf;
3876 }
3877 } // if (!Bad)
3878 }
3879
3880 // The Taken flag should be set to something reasonable by this point.
3881
3882 switch (MI.getOpcode()) {
3883 case Hexagon::J2_jumpt:
3884 return Taken ? Hexagon::J2_jumptnewpt : Hexagon::J2_jumptnew;
3885 case Hexagon::J2_jumpf:
3886 return Taken ? Hexagon::J2_jumpfnewpt : Hexagon::J2_jumpfnew;
3887
3888 default:
3889 llvm_unreachable("Unexpected jump instruction.");
3890 }
3891}
3892
3893// Return .new predicate version for an instruction.
3894int HexagonInstrInfo::getDotNewPredOp(const MachineInstr &MI,
3895 const MachineBranchProbabilityInfo *MBPI) const {
3896 switch (MI.getOpcode()) {
3897 // Conditional Jumps
3898 case Hexagon::J2_jumpt:
3899 case Hexagon::J2_jumpf:
3900 return getDotNewPredJumpOp(MI, MBPI);
3901 }
3902
3903 int NewOpcode = Hexagon::getPredNewOpcode(Opcode: MI.getOpcode());
3904 if (NewOpcode >= 0)
3905 return NewOpcode;
3906 return 0;
3907}
3908
3909int HexagonInstrInfo::getDotOldOp(const MachineInstr &MI) const {
3910 int NewOp = MI.getOpcode();
3911 if (isPredicated(Opcode: NewOp) && isPredicatedNew(Opcode: NewOp)) { // Get predicate old form
3912 NewOp = Hexagon::getPredOldOpcode(Opcode: NewOp);
3913 // All Hexagon architectures have prediction bits on dot-new branches,
3914 // but only Hexagon V60+ has prediction bits on dot-old ones. Make sure
3915 // to pick the right opcode when converting back to dot-old.
3916 if (!Subtarget.hasFeature(Feature: Hexagon::ArchV60)) {
3917 switch (NewOp) {
3918 case Hexagon::J2_jumptpt:
3919 NewOp = Hexagon::J2_jumpt;
3920 break;
3921 case Hexagon::J2_jumpfpt:
3922 NewOp = Hexagon::J2_jumpf;
3923 break;
3924 case Hexagon::J2_jumprtpt:
3925 NewOp = Hexagon::J2_jumprt;
3926 break;
3927 case Hexagon::J2_jumprfpt:
3928 NewOp = Hexagon::J2_jumprf;
3929 break;
3930 }
3931 }
3932 assert(NewOp >= 0 &&
3933 "Couldn't change predicate new instruction to its old form.");
3934 }
3935
3936 if (isNewValueStore(Opcode: NewOp)) { // Convert into non-new-value format
3937 NewOp = Hexagon::getNonNVStore(Opcode: NewOp);
3938 assert(NewOp >= 0 && "Couldn't change new-value store to its old form.");
3939 }
3940
3941 if (Subtarget.hasV60Ops())
3942 return NewOp;
3943
3944 // Subtargets prior to V60 didn't support 'taken' forms of predicated jumps.
3945 switch (NewOp) {
3946 case Hexagon::J2_jumpfpt:
3947 return Hexagon::J2_jumpf;
3948 case Hexagon::J2_jumptpt:
3949 return Hexagon::J2_jumpt;
3950 case Hexagon::J2_jumprfpt:
3951 return Hexagon::J2_jumprf;
3952 case Hexagon::J2_jumprtpt:
3953 return Hexagon::J2_jumprt;
3954 }
3955 return NewOp;
3956}
3957
3958// See if instruction could potentially be a duplex candidate.
3959// If so, return its group. Zero otherwise.
3960HexagonII::SubInstructionGroup HexagonInstrInfo::getDuplexCandidateGroup(
3961 const MachineInstr &MI) const {
3962 Register DstReg, SrcReg, Src1Reg, Src2Reg;
3963 const HexagonRegisterInfo &HRI = *Subtarget.getRegisterInfo();
3964
3965 switch (MI.getOpcode()) {
3966 default:
3967 return HexagonII::HSIG_None;
3968 //
3969 // Group L1:
3970 //
3971 // Rd = memw(Rs+#u4:2)
3972 // Rd = memub(Rs+#u4:0)
3973 case Hexagon::L2_loadri_io:
3974 case Hexagon::dup_L2_loadri_io:
3975 DstReg = MI.getOperand(i: 0).getReg();
3976 SrcReg = MI.getOperand(i: 1).getReg();
3977 // Special case this one from Group L2.
3978 // Rd = memw(r29+#u5:2)
3979 if (isIntRegForSubInst(Reg: DstReg)) {
3980 if (Hexagon::IntRegsRegClass.contains(Reg: SrcReg) &&
3981 HRI.getStackRegister() == SrcReg &&
3982 MI.getOperand(i: 2).isImm() &&
3983 isShiftedUInt<5,2>(x: MI.getOperand(i: 2).getImm()))
3984 return HexagonII::HSIG_L2;
3985 // Rd = memw(Rs+#u4:2)
3986 if (isIntRegForSubInst(Reg: SrcReg) &&
3987 (MI.getOperand(i: 2).isImm() &&
3988 isShiftedUInt<4,2>(x: MI.getOperand(i: 2).getImm())))
3989 return HexagonII::HSIG_L1;
3990 }
3991 break;
3992 case Hexagon::L2_loadrub_io:
3993 case Hexagon::dup_L2_loadrub_io:
3994 // Rd = memub(Rs+#u4:0)
3995 DstReg = MI.getOperand(i: 0).getReg();
3996 SrcReg = MI.getOperand(i: 1).getReg();
3997 if (isIntRegForSubInst(Reg: DstReg) && isIntRegForSubInst(Reg: SrcReg) &&
3998 MI.getOperand(i: 2).isImm() && isUInt<4>(x: MI.getOperand(i: 2).getImm()))
3999 return HexagonII::HSIG_L1;
4000 break;
4001 //
4002 // Group L2:
4003 //
4004 // Rd = memh/memuh(Rs+#u3:1)
4005 // Rd = memb(Rs+#u3:0)
4006 // Rd = memw(r29+#u5:2) - Handled above.
4007 // Rdd = memd(r29+#u5:3)
4008 // deallocframe
4009 // [if ([!]p0[.new])] dealloc_return
4010 // [if ([!]p0[.new])] jumpr r31
4011 case Hexagon::L2_loadrh_io:
4012 case Hexagon::L2_loadruh_io:
4013 case Hexagon::dup_L2_loadrh_io:
4014 case Hexagon::dup_L2_loadruh_io:
4015 // Rd = memh/memuh(Rs+#u3:1)
4016 DstReg = MI.getOperand(i: 0).getReg();
4017 SrcReg = MI.getOperand(i: 1).getReg();
4018 if (isIntRegForSubInst(Reg: DstReg) && isIntRegForSubInst(Reg: SrcReg) &&
4019 MI.getOperand(i: 2).isImm() &&
4020 isShiftedUInt<3,1>(x: MI.getOperand(i: 2).getImm()))
4021 return HexagonII::HSIG_L2;
4022 break;
4023 case Hexagon::L2_loadrb_io:
4024 case Hexagon::dup_L2_loadrb_io:
4025 // Rd = memb(Rs+#u3:0)
4026 DstReg = MI.getOperand(i: 0).getReg();
4027 SrcReg = MI.getOperand(i: 1).getReg();
4028 if (isIntRegForSubInst(Reg: DstReg) && isIntRegForSubInst(Reg: SrcReg) &&
4029 MI.getOperand(i: 2).isImm() &&
4030 isUInt<3>(x: MI.getOperand(i: 2).getImm()))
4031 return HexagonII::HSIG_L2;
4032 break;
4033 case Hexagon::L2_loadrd_io:
4034 case Hexagon::dup_L2_loadrd_io:
4035 // Rdd = memd(r29+#u5:3)
4036 DstReg = MI.getOperand(i: 0).getReg();
4037 SrcReg = MI.getOperand(i: 1).getReg();
4038 if (isDblRegForSubInst(Reg: DstReg, HRI) &&
4039 Hexagon::IntRegsRegClass.contains(Reg: SrcReg) &&
4040 HRI.getStackRegister() == SrcReg &&
4041 MI.getOperand(i: 2).isImm() &&
4042 isShiftedUInt<5,3>(x: MI.getOperand(i: 2).getImm()))
4043 return HexagonII::HSIG_L2;
4044 break;
4045 // dealloc_return is not documented in Hexagon Manual, but marked
4046 // with A_SUBINSN attribute in iset_v4classic.py.
4047 case Hexagon::RESTORE_DEALLOC_RET_JMP_V4:
4048 case Hexagon::RESTORE_DEALLOC_RET_JMP_V4_PIC:
4049 case Hexagon::L4_return:
4050 case Hexagon::L2_deallocframe:
4051 case Hexagon::dup_L2_deallocframe:
4052 return HexagonII::HSIG_L2;
4053 case Hexagon::EH_RETURN_JMPR:
4054 case Hexagon::PS_jmpret:
4055 case Hexagon::SL2_jumpr31:
4056 // jumpr r31
4057 // Actual form JMPR implicit-def %pc, implicit %r31, implicit internal %r0
4058 DstReg = MI.getOperand(i: 0).getReg();
4059 if (Hexagon::IntRegsRegClass.contains(Reg: DstReg) && (Hexagon::R31 == DstReg))
4060 return HexagonII::HSIG_L2;
4061 break;
4062 case Hexagon::PS_jmprett:
4063 case Hexagon::PS_jmpretf:
4064 case Hexagon::PS_jmprettnewpt:
4065 case Hexagon::PS_jmpretfnewpt:
4066 case Hexagon::PS_jmprettnew:
4067 case Hexagon::PS_jmpretfnew:
4068 case Hexagon::SL2_jumpr31_t:
4069 case Hexagon::SL2_jumpr31_f:
4070 case Hexagon::SL2_jumpr31_tnew:
4071 case Hexagon::SL2_jumpr31_fnew:
4072 DstReg = MI.getOperand(i: 1).getReg();
4073 SrcReg = MI.getOperand(i: 0).getReg();
4074 // [if ([!]p0[.new])] jumpr r31
4075 if ((Hexagon::PredRegsRegClass.contains(Reg: SrcReg) &&
4076 (Hexagon::P0 == SrcReg)) &&
4077 (Hexagon::IntRegsRegClass.contains(Reg: DstReg) && (Hexagon::R31 == DstReg)))
4078 return HexagonII::HSIG_L2;
4079 break;
4080 case Hexagon::L4_return_t:
4081 case Hexagon::L4_return_f:
4082 case Hexagon::L4_return_tnew_pnt:
4083 case Hexagon::L4_return_fnew_pnt:
4084 case Hexagon::L4_return_tnew_pt:
4085 case Hexagon::L4_return_fnew_pt:
4086 // [if ([!]p0[.new])] dealloc_return
4087 SrcReg = MI.getOperand(i: 0).getReg();
4088 if (Hexagon::PredRegsRegClass.contains(Reg: SrcReg) && (Hexagon::P0 == SrcReg))
4089 return HexagonII::HSIG_L2;
4090 break;
4091 //
4092 // Group S1:
4093 //
4094 // memw(Rs+#u4:2) = Rt
4095 // memb(Rs+#u4:0) = Rt
4096 case Hexagon::S2_storeri_io:
4097 case Hexagon::dup_S2_storeri_io:
4098 // Special case this one from Group S2.
4099 // memw(r29+#u5:2) = Rt
4100 Src1Reg = MI.getOperand(i: 0).getReg();
4101 Src2Reg = MI.getOperand(i: 2).getReg();
4102 if (Hexagon::IntRegsRegClass.contains(Reg: Src1Reg) &&
4103 isIntRegForSubInst(Reg: Src2Reg) &&
4104 HRI.getStackRegister() == Src1Reg && MI.getOperand(i: 1).isImm() &&
4105 isShiftedUInt<5,2>(x: MI.getOperand(i: 1).getImm()))
4106 return HexagonII::HSIG_S2;
4107 // memw(Rs+#u4:2) = Rt
4108 if (isIntRegForSubInst(Reg: Src1Reg) && isIntRegForSubInst(Reg: Src2Reg) &&
4109 MI.getOperand(i: 1).isImm() &&
4110 isShiftedUInt<4,2>(x: MI.getOperand(i: 1).getImm()))
4111 return HexagonII::HSIG_S1;
4112 break;
4113 case Hexagon::S2_storerb_io:
4114 case Hexagon::dup_S2_storerb_io:
4115 // memb(Rs+#u4:0) = Rt
4116 Src1Reg = MI.getOperand(i: 0).getReg();
4117 Src2Reg = MI.getOperand(i: 2).getReg();
4118 if (isIntRegForSubInst(Reg: Src1Reg) && isIntRegForSubInst(Reg: Src2Reg) &&
4119 MI.getOperand(i: 1).isImm() && isUInt<4>(x: MI.getOperand(i: 1).getImm()))
4120 return HexagonII::HSIG_S1;
4121 break;
4122 //
4123 // Group S2:
4124 //
4125 // memh(Rs+#u3:1) = Rt
4126 // memw(r29+#u5:2) = Rt
4127 // memd(r29+#s6:3) = Rtt
4128 // memw(Rs+#u4:2) = #U1
4129 // memb(Rs+#u4) = #U1
4130 // allocframe(#u5:3)
4131 case Hexagon::S2_storerh_io:
4132 case Hexagon::dup_S2_storerh_io:
4133 // memh(Rs+#u3:1) = Rt
4134 Src1Reg = MI.getOperand(i: 0).getReg();
4135 Src2Reg = MI.getOperand(i: 2).getReg();
4136 if (isIntRegForSubInst(Reg: Src1Reg) && isIntRegForSubInst(Reg: Src2Reg) &&
4137 MI.getOperand(i: 1).isImm() &&
4138 isShiftedUInt<3,1>(x: MI.getOperand(i: 1).getImm()))
4139 return HexagonII::HSIG_S1;
4140 break;
4141 case Hexagon::S2_storerd_io:
4142 case Hexagon::dup_S2_storerd_io:
4143 // memd(r29+#s6:3) = Rtt
4144 Src1Reg = MI.getOperand(i: 0).getReg();
4145 Src2Reg = MI.getOperand(i: 2).getReg();
4146 if (isDblRegForSubInst(Reg: Src2Reg, HRI) &&
4147 Hexagon::IntRegsRegClass.contains(Reg: Src1Reg) &&
4148 HRI.getStackRegister() == Src1Reg && MI.getOperand(i: 1).isImm() &&
4149 isShiftedInt<6,3>(x: MI.getOperand(i: 1).getImm()))
4150 return HexagonII::HSIG_S2;
4151 break;
4152 case Hexagon::S4_storeiri_io:
4153 case Hexagon::dup_S4_storeiri_io:
4154 // memw(Rs+#u4:2) = #U1
4155 Src1Reg = MI.getOperand(i: 0).getReg();
4156 if (isIntRegForSubInst(Reg: Src1Reg) && MI.getOperand(i: 1).isImm() &&
4157 isShiftedUInt<4,2>(x: MI.getOperand(i: 1).getImm()) &&
4158 MI.getOperand(i: 2).isImm() && isUInt<1>(x: MI.getOperand(i: 2).getImm()))
4159 return HexagonII::HSIG_S2;
4160 break;
4161 case Hexagon::S4_storeirb_io:
4162 case Hexagon::dup_S4_storeirb_io:
4163 // memb(Rs+#u4) = #U1
4164 Src1Reg = MI.getOperand(i: 0).getReg();
4165 if (isIntRegForSubInst(Reg: Src1Reg) &&
4166 MI.getOperand(i: 1).isImm() && isUInt<4>(x: MI.getOperand(i: 1).getImm()) &&
4167 MI.getOperand(i: 2).isImm() && isUInt<1>(x: MI.getOperand(i: 2).getImm()))
4168 return HexagonII::HSIG_S2;
4169 break;
4170 case Hexagon::S2_allocframe:
4171 case Hexagon::dup_S2_allocframe:
4172 if (MI.getOperand(i: 2).isImm() &&
4173 isShiftedUInt<5,3>(x: MI.getOperand(i: 2).getImm()))
4174 return HexagonII::HSIG_S1;
4175 break;
4176 //
4177 // Group A:
4178 //
4179 // Rx = add(Rx,#s7)
4180 // Rd = Rs
4181 // Rd = #u6
4182 // Rd = #-1
4183 // if ([!]P0[.new]) Rd = #0
4184 // Rd = add(r29,#u6:2)
4185 // Rx = add(Rx,Rs)
4186 // P0 = cmp.eq(Rs,#u2)
4187 // Rdd = combine(#0,Rs)
4188 // Rdd = combine(Rs,#0)
4189 // Rdd = combine(#u2,#U2)
4190 // Rd = add(Rs,#1)
4191 // Rd = add(Rs,#-1)
4192 // Rd = sxth/sxtb/zxtb/zxth(Rs)
4193 // Rd = and(Rs,#1)
4194 case Hexagon::A2_addi:
4195 case Hexagon::dup_A2_addi:
4196 DstReg = MI.getOperand(i: 0).getReg();
4197 SrcReg = MI.getOperand(i: 1).getReg();
4198 if (isIntRegForSubInst(Reg: DstReg)) {
4199 // Rd = add(r29,#u6:2)
4200 if (Hexagon::IntRegsRegClass.contains(Reg: SrcReg) &&
4201 HRI.getStackRegister() == SrcReg && MI.getOperand(i: 2).isImm() &&
4202 isShiftedUInt<6,2>(x: MI.getOperand(i: 2).getImm()))
4203 return HexagonII::HSIG_A;
4204 // Rx = add(Rx,#s7)
4205 if ((DstReg == SrcReg) && MI.getOperand(i: 2).isImm() &&
4206 isInt<7>(x: MI.getOperand(i: 2).getImm()))
4207 return HexagonII::HSIG_A;
4208 // Rd = add(Rs,#1)
4209 // Rd = add(Rs,#-1)
4210 if (isIntRegForSubInst(Reg: SrcReg) && MI.getOperand(i: 2).isImm() &&
4211 ((MI.getOperand(i: 2).getImm() == 1) ||
4212 (MI.getOperand(i: 2).getImm() == -1)))
4213 return HexagonII::HSIG_A;
4214 }
4215 break;
4216 case Hexagon::A2_add:
4217 case Hexagon::dup_A2_add:
4218 // Rx = add(Rx,Rs)
4219 DstReg = MI.getOperand(i: 0).getReg();
4220 Src1Reg = MI.getOperand(i: 1).getReg();
4221 Src2Reg = MI.getOperand(i: 2).getReg();
4222 if (isIntRegForSubInst(Reg: DstReg) && (DstReg == Src1Reg) &&
4223 isIntRegForSubInst(Reg: Src2Reg))
4224 return HexagonII::HSIG_A;
4225 break;
4226 case Hexagon::A2_andir:
4227 case Hexagon::dup_A2_andir:
4228 // Same as zxtb.
4229 // Rd16=and(Rs16,#255)
4230 // Rd16=and(Rs16,#1)
4231 DstReg = MI.getOperand(i: 0).getReg();
4232 SrcReg = MI.getOperand(i: 1).getReg();
4233 if (isIntRegForSubInst(Reg: DstReg) && isIntRegForSubInst(Reg: SrcReg) &&
4234 MI.getOperand(i: 2).isImm() &&
4235 ((MI.getOperand(i: 2).getImm() == 1) ||
4236 (MI.getOperand(i: 2).getImm() == 255)))
4237 return HexagonII::HSIG_A;
4238 break;
4239 case Hexagon::A2_tfr:
4240 case Hexagon::dup_A2_tfr:
4241 // Rd = Rs
4242 DstReg = MI.getOperand(i: 0).getReg();
4243 SrcReg = MI.getOperand(i: 1).getReg();
4244 if (isIntRegForSubInst(Reg: DstReg) && isIntRegForSubInst(Reg: SrcReg))
4245 return HexagonII::HSIG_A;
4246 break;
4247 case Hexagon::A2_tfrsi:
4248 case Hexagon::dup_A2_tfrsi:
4249 // Rd = #u6
4250 // Do not test for #u6 size since the const is getting extended
4251 // regardless and compound could be formed.
4252 // Rd = #-1
4253 DstReg = MI.getOperand(i: 0).getReg();
4254 if (isIntRegForSubInst(Reg: DstReg))
4255 return HexagonII::HSIG_A;
4256 break;
4257 case Hexagon::C2_cmoveit:
4258 case Hexagon::C2_cmovenewit:
4259 case Hexagon::C2_cmoveif:
4260 case Hexagon::C2_cmovenewif:
4261 case Hexagon::dup_C2_cmoveit:
4262 case Hexagon::dup_C2_cmovenewit:
4263 case Hexagon::dup_C2_cmoveif:
4264 case Hexagon::dup_C2_cmovenewif:
4265 // if ([!]P0[.new]) Rd = #0
4266 // Actual form:
4267 // %r16 = C2_cmovenewit internal %p0, 0, implicit undef %r16;
4268 DstReg = MI.getOperand(i: 0).getReg();
4269 SrcReg = MI.getOperand(i: 1).getReg();
4270 if (isIntRegForSubInst(Reg: DstReg) &&
4271 Hexagon::PredRegsRegClass.contains(Reg: SrcReg) && Hexagon::P0 == SrcReg &&
4272 MI.getOperand(i: 2).isImm() && MI.getOperand(i: 2).getImm() == 0)
4273 return HexagonII::HSIG_A;
4274 break;
4275 case Hexagon::C2_cmpeqi:
4276 case Hexagon::dup_C2_cmpeqi:
4277 // P0 = cmp.eq(Rs,#u2)
4278 DstReg = MI.getOperand(i: 0).getReg();
4279 SrcReg = MI.getOperand(i: 1).getReg();
4280 if (Hexagon::PredRegsRegClass.contains(Reg: DstReg) &&
4281 Hexagon::P0 == DstReg && isIntRegForSubInst(Reg: SrcReg) &&
4282 MI.getOperand(i: 2).isImm() && isUInt<2>(x: MI.getOperand(i: 2).getImm()))
4283 return HexagonII::HSIG_A;
4284 break;
4285 case Hexagon::A2_combineii:
4286 case Hexagon::A4_combineii:
4287 case Hexagon::dup_A2_combineii:
4288 case Hexagon::dup_A4_combineii:
4289 // Rdd = combine(#u2,#U2)
4290 DstReg = MI.getOperand(i: 0).getReg();
4291 if (isDblRegForSubInst(Reg: DstReg, HRI) &&
4292 ((MI.getOperand(i: 1).isImm() && isUInt<2>(x: MI.getOperand(i: 1).getImm())) ||
4293 (MI.getOperand(i: 1).isGlobal() &&
4294 isUInt<2>(x: MI.getOperand(i: 1).getOffset()))) &&
4295 ((MI.getOperand(i: 2).isImm() && isUInt<2>(x: MI.getOperand(i: 2).getImm())) ||
4296 (MI.getOperand(i: 2).isGlobal() &&
4297 isUInt<2>(x: MI.getOperand(i: 2).getOffset()))))
4298 return HexagonII::HSIG_A;
4299 break;
4300 case Hexagon::A4_combineri:
4301 case Hexagon::dup_A4_combineri:
4302 // Rdd = combine(Rs,#0)
4303 // Rdd = combine(Rs,#0)
4304 DstReg = MI.getOperand(i: 0).getReg();
4305 SrcReg = MI.getOperand(i: 1).getReg();
4306 if (isDblRegForSubInst(Reg: DstReg, HRI) && isIntRegForSubInst(Reg: SrcReg) &&
4307 ((MI.getOperand(i: 2).isImm() && MI.getOperand(i: 2).getImm() == 0) ||
4308 (MI.getOperand(i: 2).isGlobal() && MI.getOperand(i: 2).getOffset() == 0)))
4309 return HexagonII::HSIG_A;
4310 break;
4311 case Hexagon::A4_combineir:
4312 case Hexagon::dup_A4_combineir:
4313 // Rdd = combine(#0,Rs)
4314 DstReg = MI.getOperand(i: 0).getReg();
4315 SrcReg = MI.getOperand(i: 2).getReg();
4316 if (isDblRegForSubInst(Reg: DstReg, HRI) && isIntRegForSubInst(Reg: SrcReg) &&
4317 ((MI.getOperand(i: 1).isImm() && MI.getOperand(i: 1).getImm() == 0) ||
4318 (MI.getOperand(i: 1).isGlobal() && MI.getOperand(i: 1).getOffset() == 0)))
4319 return HexagonII::HSIG_A;
4320 break;
4321 case Hexagon::A2_sxtb:
4322 case Hexagon::A2_sxth:
4323 case Hexagon::A2_zxtb:
4324 case Hexagon::A2_zxth:
4325 case Hexagon::dup_A2_sxtb:
4326 case Hexagon::dup_A2_sxth:
4327 case Hexagon::dup_A2_zxtb:
4328 case Hexagon::dup_A2_zxth:
4329 // Rd = sxth/sxtb/zxtb/zxth(Rs)
4330 DstReg = MI.getOperand(i: 0).getReg();
4331 SrcReg = MI.getOperand(i: 1).getReg();
4332 if (isIntRegForSubInst(Reg: DstReg) && isIntRegForSubInst(Reg: SrcReg))
4333 return HexagonII::HSIG_A;
4334 break;
4335 }
4336
4337 return HexagonII::HSIG_None;
4338}
4339
4340short HexagonInstrInfo::getEquivalentHWInstr(const MachineInstr &MI) const {
4341 return Hexagon::getRealHWInstr(Opcode: MI.getOpcode(), inInstrType: Hexagon::InstrType_Real);
4342}
4343
4344unsigned HexagonInstrInfo::getInstrTimingClassLatency(
4345 const InstrItineraryData *ItinData, const MachineInstr &MI) const {
4346 // Default to one cycle for no itinerary. However, an "empty" itinerary may
4347 // still have a MinLatency property, which getStageLatency checks.
4348 if (!ItinData)
4349 return getInstrLatency(ItinData, MI);
4350
4351 if (MI.isTransient())
4352 return 0;
4353 return ItinData->getStageLatency(ItinClassIndx: MI.getDesc().getSchedClass());
4354}
4355
4356/// getOperandLatency - Compute and return the use operand latency of a given
4357/// pair of def and use.
4358/// In most cases, the static scheduling itinerary was enough to determine the
4359/// operand latency. But it may not be possible for instructions with variable
4360/// number of defs / uses.
4361///
4362/// This is a raw interface to the itinerary that may be directly overridden by
4363/// a target. Use computeOperandLatency to get the best estimate of latency.
4364std::optional<unsigned> HexagonInstrInfo::getOperandLatency(
4365 const InstrItineraryData *ItinData, const MachineInstr &DefMI,
4366 unsigned DefIdx, const MachineInstr &UseMI, unsigned UseIdx) const {
4367 const HexagonRegisterInfo &HRI = *Subtarget.getRegisterInfo();
4368
4369 // Get DefIdx and UseIdx for super registers.
4370 const MachineOperand &DefMO = DefMI.getOperand(i: DefIdx);
4371
4372 if (DefMO.isReg() && DefMO.getReg().isPhysical()) {
4373 if (DefMO.isImplicit()) {
4374 for (MCPhysReg SR : HRI.superregs(Reg: DefMO.getReg())) {
4375 int Idx = DefMI.findRegisterDefOperandIdx(Reg: SR, TRI: &HRI, isDead: false, Overlap: false);
4376 if (Idx != -1) {
4377 DefIdx = Idx;
4378 break;
4379 }
4380 }
4381 }
4382
4383 const MachineOperand &UseMO = UseMI.getOperand(i: UseIdx);
4384 if (UseMO.isImplicit()) {
4385 for (MCPhysReg SR : HRI.superregs(Reg: UseMO.getReg())) {
4386 int Idx = UseMI.findRegisterUseOperandIdx(Reg: SR, TRI: &HRI, isKill: false);
4387 if (Idx != -1) {
4388 UseIdx = Idx;
4389 break;
4390 }
4391 }
4392 }
4393 }
4394
4395 std::optional<unsigned> Latency = TargetInstrInfo::getOperandLatency(
4396 ItinData, DefMI, DefIdx, UseMI, UseIdx);
4397 if (Latency == 0)
4398 // We should never have 0 cycle latency between two instructions unless
4399 // they can be packetized together. However, this decision can't be made
4400 // here.
4401 Latency = 1;
4402 return Latency;
4403}
4404
4405// inverts the predication logic.
4406// p -> NotP
4407// NotP -> P
4408bool HexagonInstrInfo::getInvertedPredSense(
4409 SmallVectorImpl<MachineOperand> &Cond) const {
4410 if (Cond.empty())
4411 return false;
4412 unsigned Opc = getInvertedPredicatedOpcode(Opc: Cond[0].getImm());
4413 Cond[0].setImm(Opc);
4414 return true;
4415}
4416
4417unsigned HexagonInstrInfo::getInvertedPredicatedOpcode(const int Opc) const {
4418 int InvPredOpcode;
4419 InvPredOpcode = isPredicatedTrue(Opcode: Opc) ? Hexagon::getFalsePredOpcode(Opcode: Opc)
4420 : Hexagon::getTruePredOpcode(Opcode: Opc);
4421 if (InvPredOpcode >= 0) // Valid instruction with the inverted predicate.
4422 return InvPredOpcode;
4423
4424 llvm_unreachable("Unexpected predicated instruction");
4425}
4426
4427// Returns the max value that doesn't need to be extended.
4428int HexagonInstrInfo::getMaxValue(const MachineInstr &MI) const {
4429 const uint64_t F = MI.getDesc().TSFlags;
4430 unsigned isSigned = (F >> HexagonII::ExtentSignedPos)
4431 & HexagonII::ExtentSignedMask;
4432 unsigned bits = (F >> HexagonII::ExtentBitsPos)
4433 & HexagonII::ExtentBitsMask;
4434
4435 if (isSigned) // if value is signed
4436 return ~(-1U << (bits - 1));
4437 else
4438 return ~(-1U << bits);
4439}
4440
4441
4442bool HexagonInstrInfo::isAddrModeWithOffset(const MachineInstr &MI) const {
4443 switch (MI.getOpcode()) {
4444 case Hexagon::L2_loadrbgp:
4445 case Hexagon::L2_loadrdgp:
4446 case Hexagon::L2_loadrhgp:
4447 case Hexagon::L2_loadrigp:
4448 case Hexagon::L2_loadrubgp:
4449 case Hexagon::L2_loadruhgp:
4450 case Hexagon::S2_storerbgp:
4451 case Hexagon::S2_storerbnewgp:
4452 case Hexagon::S2_storerhgp:
4453 case Hexagon::S2_storerhnewgp:
4454 case Hexagon::S2_storerigp:
4455 case Hexagon::S2_storerinewgp:
4456 case Hexagon::S2_storerdgp:
4457 case Hexagon::S2_storerfgp:
4458 return true;
4459 }
4460 const uint64_t F = MI.getDesc().TSFlags;
4461 unsigned addrMode =
4462 ((F >> HexagonII::AddrModePos) & HexagonII::AddrModeMask);
4463 // Disallow any base+offset instruction. The assembler does not yet reorder
4464 // based up any zero offset instruction.
4465 return (addrMode == HexagonII::BaseRegOffset ||
4466 addrMode == HexagonII::BaseImmOffset ||
4467 addrMode == HexagonII::BaseLongOffset);
4468}
4469
4470bool HexagonInstrInfo::isPureSlot0(const MachineInstr &MI) const {
4471 // Workaround for the Global Scheduler. Sometimes, it creates
4472 // A4_ext as a Pseudo instruction and calls this function to see if
4473 // it can be added to an existing bundle. Since the instruction doesn't
4474 // belong to any BB yet, we can't use getUnits API.
4475 if (MI.getOpcode() == Hexagon::A4_ext)
4476 return false;
4477
4478 unsigned FuncUnits = getUnits(MI);
4479 return HexagonFUnits::isSlot0Only(units: FuncUnits);
4480}
4481
4482bool HexagonInstrInfo::isRestrictNoSlot1Store(const MachineInstr &MI) const {
4483 const uint64_t F = MI.getDesc().TSFlags;
4484 return ((F >> HexagonII::RestrictNoSlot1StorePos) &
4485 HexagonII::RestrictNoSlot1StoreMask);
4486}
4487
4488void HexagonInstrInfo::changeDuplexOpcode(MachineBasicBlock::instr_iterator MII,
4489 bool ToBigInstrs) const {
4490 int Opcode = -1;
4491 if (ToBigInstrs) { // To BigCore Instr.
4492 // Check if the instruction can form a Duplex.
4493 if (getDuplexCandidateGroup(MI: *MII))
4494 // Get the opcode marked "dup_*" tag.
4495 Opcode = getDuplexOpcode(MI: *MII, ForBigCore: ToBigInstrs);
4496 } else // To TinyCore Instr.
4497 Opcode = getDuplexOpcode(MI: *MII, ForBigCore: ToBigInstrs);
4498
4499 // Change the opcode of the instruction.
4500 if (Opcode >= 0)
4501 MII->setDesc(get(Opcode));
4502}
4503
4504// This function is used to translate instructions to facilitate generating
4505// Duplexes on TinyCore.
4506void HexagonInstrInfo::translateInstrsForDup(MachineFunction &MF,
4507 bool ToBigInstrs) const {
4508 for (auto &MB : MF)
4509 for (MachineBasicBlock::instr_iterator Instr = MB.instr_begin(),
4510 End = MB.instr_end();
4511 Instr != End; ++Instr)
4512 changeDuplexOpcode(MII: Instr, ToBigInstrs);
4513}
4514
4515// This is a specialized form of above function.
4516void HexagonInstrInfo::translateInstrsForDup(
4517 MachineBasicBlock::instr_iterator MII, bool ToBigInstrs) const {
4518 MachineBasicBlock *MBB = MII->getParent();
4519 while ((MII != MBB->instr_end()) && MII->isInsideBundle()) {
4520 changeDuplexOpcode(MII, ToBigInstrs);
4521 ++MII;
4522 }
4523}
4524
4525unsigned HexagonInstrInfo::getMemAccessSize(const MachineInstr &MI) const {
4526 using namespace HexagonII;
4527
4528 const uint64_t F = MI.getDesc().TSFlags;
4529 unsigned S = (F >> MemAccessSizePos) & MemAccesSizeMask;
4530 unsigned Size = getMemAccessSizeInBytes(S: MemAccessSize(S));
4531 if (Size != 0)
4532 return Size;
4533 // Y2_dcfetchbo is special
4534 if (MI.getOpcode() == Hexagon::Y2_dcfetchbo)
4535 return HexagonII::DoubleWordAccess;
4536
4537 // Handle vector access sizes.
4538 const HexagonRegisterInfo &HRI = *Subtarget.getRegisterInfo();
4539 switch (S) {
4540 case HexagonII::HVXVectorAccess:
4541 return HRI.getSpillSize(RC: Hexagon::HvxVRRegClass);
4542 default:
4543 llvm_unreachable("Unexpected instruction");
4544 }
4545}
4546
4547// Returns the min value that doesn't need to be extended.
4548int HexagonInstrInfo::getMinValue(const MachineInstr &MI) const {
4549 const uint64_t F = MI.getDesc().TSFlags;
4550 unsigned isSigned = (F >> HexagonII::ExtentSignedPos)
4551 & HexagonII::ExtentSignedMask;
4552 unsigned bits = (F >> HexagonII::ExtentBitsPos)
4553 & HexagonII::ExtentBitsMask;
4554
4555 if (isSigned) // if value is signed
4556 return -1U << (bits - 1);
4557 else
4558 return 0;
4559}
4560
4561// Returns opcode of the non-extended equivalent instruction.
4562short HexagonInstrInfo::getNonExtOpcode(const MachineInstr &MI) const {
4563 // Check if the instruction has a register form that uses register in place
4564 // of the extended operand, if so return that as the non-extended form.
4565 short NonExtOpcode = Hexagon::getRegForm(Opcode: MI.getOpcode());
4566 if (NonExtOpcode >= 0)
4567 return NonExtOpcode;
4568
4569 if (MI.getDesc().mayLoad() || MI.getDesc().mayStore()) {
4570 // Check addressing mode and retrieve non-ext equivalent instruction.
4571 switch (getAddrMode(MI)) {
4572 case HexagonII::Absolute:
4573 return Hexagon::changeAddrMode_abs_io(Opcode: MI.getOpcode());
4574 case HexagonII::BaseImmOffset:
4575 return Hexagon::changeAddrMode_io_rr(Opcode: MI.getOpcode());
4576 case HexagonII::BaseLongOffset:
4577 return Hexagon::changeAddrMode_ur_rr(Opcode: MI.getOpcode());
4578
4579 default:
4580 return -1;
4581 }
4582 }
4583 return -1;
4584}
4585
4586bool HexagonInstrInfo::getPredReg(ArrayRef<MachineOperand> Cond,
4587 Register &PredReg, unsigned &PredRegPos,
4588 RegState &PredRegFlags) const {
4589 if (Cond.empty())
4590 return false;
4591 assert(Cond.size() == 2);
4592 if (isNewValueJump(Opcode: Cond[0].getImm()) || Cond[1].isMBB()) {
4593 LLVM_DEBUG(dbgs() << "No predregs for new-value jumps/endloop");
4594 return false;
4595 }
4596 PredReg = Cond[1].getReg();
4597 PredRegPos = 1;
4598 // See IfConversion.cpp why we add RegState::Implicit | RegState::Undef
4599 PredRegFlags = {};
4600 if (Cond[1].isImplicit())
4601 PredRegFlags = RegState::Implicit;
4602 if (Cond[1].isUndef())
4603 PredRegFlags |= RegState::Undef;
4604 return true;
4605}
4606
4607short HexagonInstrInfo::getPseudoInstrPair(const MachineInstr &MI) const {
4608 return Hexagon::getRealHWInstr(Opcode: MI.getOpcode(), inInstrType: Hexagon::InstrType_Pseudo);
4609}
4610
4611short HexagonInstrInfo::getRegForm(const MachineInstr &MI) const {
4612 return Hexagon::getRegForm(Opcode: MI.getOpcode());
4613}
4614
4615// Return the number of bytes required to encode the instruction.
4616// Hexagon instructions are fixed length, 4 bytes, unless they
4617// use a constant extender, which requires another 4 bytes.
4618// For debug instructions and prolog labels, return 0.
4619unsigned HexagonInstrInfo::getSize(const MachineInstr &MI) const {
4620 if (MI.isDebugInstr() || MI.isPosition())
4621 return 0;
4622
4623 unsigned Size = MI.getDesc().getSize();
4624 if (!Size)
4625 // Assume the default insn size in case it cannot be determined
4626 // for whatever reason.
4627 Size = HEXAGON_INSTR_SIZE;
4628
4629 if (isConstExtended(MI) || isExtended(MI))
4630 Size += HEXAGON_INSTR_SIZE;
4631
4632 // Try and compute number of instructions in asm.
4633 if (BranchRelaxAsmLarge && MI.getOpcode() == Hexagon::INLINEASM) {
4634 const MachineBasicBlock &MBB = *MI.getParent();
4635 const MachineFunction *MF = MBB.getParent();
4636 const MCAsmInfo &MAI = MF->getTarget().getMCAsmInfo();
4637
4638 // Count the number of register definitions to find the asm string.
4639 unsigned NumDefs = 0;
4640 for (; MI.getOperand(i: NumDefs).isReg() && MI.getOperand(i: NumDefs).isDef();
4641 ++NumDefs)
4642 assert(NumDefs != MI.getNumOperands()-2 && "No asm string?");
4643
4644 assert(MI.getOperand(NumDefs).isSymbol() && "No asm string?");
4645 // Disassemble the AsmStr and approximate number of instructions.
4646 const char *AsmStr = MI.getOperand(i: NumDefs).getSymbolName();
4647 Size = getInlineAsmLength(Str: AsmStr, MAI);
4648 }
4649
4650 return Size;
4651}
4652
4653uint64_t HexagonInstrInfo::getType(const MachineInstr &MI) const {
4654 const uint64_t F = MI.getDesc().TSFlags;
4655 return (F >> HexagonII::TypePos) & HexagonII::TypeMask;
4656}
4657
4658InstrStage::FuncUnits HexagonInstrInfo::getUnits(const MachineInstr &MI) const {
4659 const InstrItineraryData &II = *Subtarget.getInstrItineraryData();
4660 const InstrStage &IS = *II.beginStage(ItinClassIndx: MI.getDesc().getSchedClass());
4661
4662 return IS.getUnits();
4663}
4664
4665// Calculate size of the basic block without debug instructions.
4666unsigned HexagonInstrInfo::nonDbgBBSize(const MachineBasicBlock *BB) const {
4667 return nonDbgMICount(MIB: BB->instr_begin(), MIE: BB->instr_end());
4668}
4669
4670unsigned HexagonInstrInfo::nonDbgBundleSize(
4671 MachineBasicBlock::const_iterator BundleHead) const {
4672 assert(BundleHead->isBundle() && "Not a bundle header");
4673 auto MII = BundleHead.getInstrIterator();
4674 // Skip the bundle header.
4675 return nonDbgMICount(MIB: ++MII, MIE: getBundleEnd(I: BundleHead.getInstrIterator()));
4676}
4677
4678/// immediateExtend - Changes the instruction in place to one using an immediate
4679/// extender.
4680void HexagonInstrInfo::immediateExtend(MachineInstr &MI) const {
4681 assert((isExtendable(MI)||isConstExtended(MI)) &&
4682 "Instruction must be extendable");
4683 // Find which operand is extendable.
4684 short ExtOpNum = getCExtOpNum(MI);
4685 MachineOperand &MO = MI.getOperand(i: ExtOpNum);
4686 // This needs to be something we understand.
4687 assert((MO.isMBB() || MO.isImm()) &&
4688 "Branch with unknown extendable field type");
4689 // Mark given operand as extended.
4690 MO.addTargetFlag(F: HexagonII::HMOTF_ConstExtended);
4691}
4692
4693bool HexagonInstrInfo::invertAndChangeJumpTarget(
4694 MachineInstr &MI, MachineBasicBlock *NewTarget) const {
4695 LLVM_DEBUG(dbgs() << "\n[invertAndChangeJumpTarget] to "
4696 << printMBBReference(*NewTarget);
4697 MI.dump(););
4698 assert(MI.isBranch());
4699 unsigned NewOpcode = getInvertedPredicatedOpcode(Opc: MI.getOpcode());
4700 int TargetPos = MI.getNumOperands() - 1;
4701 // In general branch target is the last operand,
4702 // but some implicit defs added at the end might change it.
4703 while ((TargetPos > -1) && !MI.getOperand(i: TargetPos).isMBB())
4704 --TargetPos;
4705 assert((TargetPos >= 0) && MI.getOperand(TargetPos).isMBB());
4706 MI.getOperand(i: TargetPos).setMBB(NewTarget);
4707 if (EnableBranchPrediction && isPredicatedNew(MI)) {
4708 NewOpcode = reversePrediction(Opcode: NewOpcode);
4709 }
4710 MI.setDesc(get(Opcode: NewOpcode));
4711 return true;
4712}
4713
4714void HexagonInstrInfo::genAllInsnTimingClasses(MachineFunction &MF) const {
4715 /* +++ The code below is used to generate complete set of Hexagon Insn +++ */
4716 MachineFunction::iterator A = MF.begin();
4717 MachineBasicBlock &B = *A;
4718 MachineBasicBlock::iterator I = B.begin();
4719 DebugLoc DL = I->getDebugLoc();
4720 MachineInstr *NewMI;
4721
4722 for (unsigned insn = TargetOpcode::GENERIC_OP_END+1;
4723 insn < Hexagon::INSTRUCTION_LIST_END; ++insn) {
4724 NewMI = BuildMI(BB&: B, I, MIMD: DL, MCID: get(Opcode: insn));
4725 LLVM_DEBUG(dbgs() << "\n"
4726 << getName(NewMI->getOpcode())
4727 << " Class: " << NewMI->getDesc().getSchedClass());
4728 NewMI->eraseFromParent();
4729 }
4730 /* --- The code above is used to generate complete set of Hexagon Insn --- */
4731}
4732
4733// inverts the predication logic.
4734// p -> NotP
4735// NotP -> P
4736bool HexagonInstrInfo::reversePredSense(MachineInstr &MI) const {
4737 LLVM_DEBUG(dbgs() << "\nTrying to reverse pred. sense of:"; MI.dump());
4738 MI.setDesc(get(Opcode: getInvertedPredicatedOpcode(Opc: MI.getOpcode())));
4739 return true;
4740}
4741
4742// Reverse the branch prediction.
4743unsigned HexagonInstrInfo::reversePrediction(unsigned Opcode) const {
4744 int PredRevOpcode = -1;
4745 if (isPredictedTaken(Opcode))
4746 PredRevOpcode = Hexagon::notTakenBranchPrediction(Opcode);
4747 else
4748 PredRevOpcode = Hexagon::takenBranchPrediction(Opcode);
4749 assert(PredRevOpcode > 0);
4750 return PredRevOpcode;
4751}
4752
4753// TODO: Add more rigorous validation.
4754bool HexagonInstrInfo::validateBranchCond(const ArrayRef<MachineOperand> &Cond)
4755 const {
4756 return Cond.empty() || (Cond[0].isImm() && (Cond.size() != 1));
4757}
4758
4759void HexagonInstrInfo::
4760setBundleNoShuf(MachineBasicBlock::instr_iterator MIB) const {
4761 assert(MIB->isBundle());
4762 MachineOperand &Operand = MIB->getOperand(i: 0);
4763 if (Operand.isImm())
4764 Operand.setImm(Operand.getImm() | memShufDisabledMask);
4765 else
4766 MIB->addOperand(Op: MachineOperand::CreateImm(Val: memShufDisabledMask));
4767}
4768
4769bool HexagonInstrInfo::getBundleNoShuf(const MachineInstr &MIB) const {
4770 assert(MIB.isBundle());
4771 const MachineOperand &Operand = MIB.getOperand(i: 0);
4772 return (Operand.isImm() && (Operand.getImm() & memShufDisabledMask) != 0);
4773}
4774
4775bool HexagonInstrInfo::isQFPMul(const MachineInstr *MI) const {
4776 return (MI->getOpcode() == Hexagon::V6_vmpy_qf16_hf ||
4777 MI->getOpcode() == Hexagon::V6_vmpy_qf16_mix_hf ||
4778 MI->getOpcode() == Hexagon::V6_vmpy_qf32_hf ||
4779 MI->getOpcode() == Hexagon::V6_vmpy_qf32_mix_hf ||
4780 MI->getOpcode() == Hexagon::V6_vmpy_qf32_sf ||
4781 MI->getOpcode() == Hexagon::V6_vmpy_qf16_mix_hf ||
4782 MI->getOpcode() == Hexagon::V6_vmpy_qf16 ||
4783 MI->getOpcode() == Hexagon::V6_vmpy_qf32_mix_hf ||
4784 MI->getOpcode() == Hexagon::V6_vmpy_qf32_qf16 ||
4785 MI->getOpcode() == Hexagon::V6_vmpy_qf32);
4786}
4787
4788namespace llvm::HexagonII {
4789
4790static constexpr RegTypeInfo make(RegType Out, RegType In1 = RegType::Unknown,
4791 RegType In2 = RegType::Unknown,
4792 RegType In3 = RegType::Unknown) {
4793 RegTypeInfo I;
4794 I.Output = Out;
4795 I.Input1 = In1;
4796 I.Input2 = In2;
4797 I.Input3 = In3;
4798 return I;
4799}
4800
4801RegTypeInfo getRegTypeInfo(unsigned Opcode) {
4802 switch (Opcode) {
4803 default:
4804 return {};
4805
4806 case Hexagon::V6_vabs_qf16_hf:
4807 return make(Out: RegType::QF16);
4808 case Hexagon::V6_vabs_qf16_qf16:
4809 return make(Out: RegType::QF16, In1: RegType::QF16);
4810 case Hexagon::V6_vabs_qf32_qf32:
4811 return make(Out: RegType::QF32, In1: RegType::QF32);
4812 case Hexagon::V6_vabs_qf32_sf:
4813 return make(Out: RegType::QF32);
4814 case Hexagon::V6_vadd_hf:
4815 return make(Out: RegType::QF16);
4816 case Hexagon::V6_vadd_qf16:
4817 return make(Out: RegType::QF16, In1: RegType::QF16, In2: RegType::QF16);
4818 case Hexagon::V6_vadd_qf16_mix:
4819 return make(Out: RegType::QF16, In1: RegType::QF16);
4820 case Hexagon::V6_vadd_qf32:
4821 return make(Out: RegType::QF32, In1: RegType::QF32, In2: RegType::QF32);
4822 case Hexagon::V6_vadd_qf32_mix:
4823 return make(Out: RegType::QF32, In1: RegType::QF32);
4824 case Hexagon::V6_vadd_sf:
4825 return make(Out: RegType::QF32);
4826 case Hexagon::V6_vconv_bf_qf32:
4827 return make(Out: RegType::Unknown, In1: RegType::QF32);
4828 case Hexagon::V6_vconv_f8_qf16:
4829 return make(Out: RegType::Unknown, In1: RegType::QF16);
4830 case Hexagon::V6_vconv_hf_qf16:
4831 return make(Out: RegType::Unknown, In1: RegType::QF16);
4832 case Hexagon::V6_vconv_hf_qf32:
4833 return make(Out: RegType::Unknown, In1: RegType::QF32);
4834 case Hexagon::V6_vconv_qf16_f8:
4835 return make(Out: RegType::QF16);
4836 case Hexagon::V6_vconv_qf16_hf:
4837 return make(Out: RegType::QF16);
4838 case Hexagon::V6_vconv_qf16_qf16:
4839 return make(Out: RegType::QF16, In1: RegType::QF16);
4840 case Hexagon::V6_vconv_qf32_qf32:
4841 return make(Out: RegType::QF32, In1: RegType::QF32);
4842 case Hexagon::V6_vconv_qf32_sf:
4843 return make(Out: RegType::QF32);
4844 case Hexagon::V6_vconv_sf_qf32:
4845 return make(Out: RegType::Unknown, In1: RegType::QF32);
4846 case Hexagon::V6_vilog2_qf16:
4847 return make(Out: RegType::Unknown, In1: RegType::QF16);
4848 case Hexagon::V6_vilog2_qf32:
4849 return make(Out: RegType::Unknown, In1: RegType::QF32);
4850 case Hexagon::V6_vmpy_qf16:
4851 return make(Out: RegType::QF16, In1: RegType::QF16, In2: RegType::QF16);
4852 case Hexagon::V6_vmpy_qf16_hf:
4853 return make(Out: RegType::QF16);
4854 case Hexagon::V6_vmpy_qf16_mix_hf:
4855 return make(Out: RegType::QF16, In1: RegType::QF16);
4856 case Hexagon::V6_vmpy_qf32:
4857 return make(Out: RegType::QF32, In1: RegType::QF32, In2: RegType::QF32);
4858 case Hexagon::V6_vmpy_qf32_hf:
4859 return make(Out: RegType::QF32);
4860 case Hexagon::V6_vmpy_qf32_mix_hf:
4861 return make(Out: RegType::QF32, In1: RegType::QF16);
4862 case Hexagon::V6_vmpy_qf32_qf16:
4863 return make(Out: RegType::QF32, In1: RegType::QF16, In2: RegType::QF16);
4864 case Hexagon::V6_vmpy_qf32_sf:
4865 return make(Out: RegType::QF32);
4866 case Hexagon::V6_vmpy_rt_hf:
4867 return make(Out: RegType::QF16);
4868 case Hexagon::V6_vmpy_rt_qf16:
4869 return make(Out: RegType::QF16, In1: RegType::QF16);
4870 case Hexagon::V6_vmpy_rt_sf:
4871 return make(Out: RegType::QF32);
4872 case Hexagon::V6_vneg_qf16_hf:
4873 return make(Out: RegType::QF16);
4874 case Hexagon::V6_vneg_qf16_qf16:
4875 return make(Out: RegType::QF16, In1: RegType::QF16);
4876 case Hexagon::V6_vneg_qf32_qf32:
4877 return make(Out: RegType::QF32, In1: RegType::QF32);
4878 case Hexagon::V6_vneg_qf32_sf:
4879 return make(Out: RegType::QF32);
4880 case Hexagon::V6_vsub_hf:
4881 return make(Out: RegType::QF16);
4882 case Hexagon::V6_vsub_qf16:
4883 return make(Out: RegType::QF16, In1: RegType::QF16, In2: RegType::QF16);
4884 case Hexagon::V6_vsub_qf16_mix:
4885 return make(Out: RegType::QF16, In1: RegType::QF16);
4886 case Hexagon::V6_vsub_qf32:
4887 return make(Out: RegType::QF32, In1: RegType::QF32, In2: RegType::QF32);
4888 case Hexagon::V6_vsub_qf32_mix:
4889 return make(Out: RegType::QF32, In1: RegType::QF32);
4890 case Hexagon::V6_vsub_sf:
4891 return make(Out: RegType::QF32);
4892 case Hexagon::V6_vsub_sf_mix:
4893 return make(Out: RegType::QF32, In1: RegType::Unknown, In2: RegType::QF32);
4894 case Hexagon::V6_vsub_hf_mix:
4895 return make(Out: RegType::QF16, In1: RegType::Unknown, In2: RegType::QF16);
4896 }
4897}
4898
4899} // namespace llvm::HexagonII
4900
4901bool HexagonInstrInfo::usesQF32Operand(MachineInstr *MI, unsigned Index) const {
4902 auto Info = HexagonII::getRegTypeInfo(Opcode: MI->getOpcode());
4903 switch (Index) {
4904 case 1:
4905 return Info.Input1 == HexagonII::RegType::QF32;
4906 case 2:
4907 return Info.Input2 == HexagonII::RegType::QF32;
4908 case 3:
4909 return Info.Input3 == HexagonII::RegType::QF32;
4910 case 0:
4911 return Info.Input1 == HexagonII::RegType::QF32 ||
4912 Info.Input2 == HexagonII::RegType::QF32 ||
4913 Info.Input3 == HexagonII::RegType::QF32;
4914 default: // No instruction with more than 3 operands uses QF32.
4915 return false;
4916 }
4917 return false;
4918}
4919
4920bool HexagonInstrInfo::usesQF16Operand(MachineInstr *MI, unsigned Index) const {
4921 auto Info = HexagonII::getRegTypeInfo(Opcode: MI->getOpcode());
4922 switch (Index) {
4923 case 1:
4924 return Info.Input1 == HexagonII::RegType::QF16;
4925 case 2:
4926 return Info.Input2 == HexagonII::RegType::QF16;
4927 case 3:
4928 return Info.Input3 == HexagonII::RegType::QF16;
4929 case 0:
4930 return Info.Input1 == HexagonII::RegType::QF16 ||
4931 Info.Input2 == HexagonII::RegType::QF16 ||
4932 Info.Input3 == HexagonII::RegType::QF16;
4933 default: // No instruction with more than 3 operands uses QF16.
4934 return false;
4935 }
4936 return false;
4937}
4938
4939bool HexagonInstrInfo::usesQFOperand(MachineInstr *MI, unsigned Index) const {
4940 return usesQF32Operand(MI, Index) || usesQF16Operand(MI, Index);
4941}
4942
4943bool HexagonInstrInfo::isQFP32Instr(MachineInstr *MI) const {
4944 return HexagonII::getOpRegType(Opcode: MI->getOpcode()) == HexagonII::RegType::QF32;
4945}
4946
4947bool HexagonInstrInfo::isQFP16Instr(MachineInstr *MI) const {
4948 return HexagonII::getOpRegType(Opcode: MI->getOpcode()) == HexagonII::RegType::QF16;
4949}
4950
4951bool HexagonInstrInfo::isQFPInstr(MachineInstr *MI) const {
4952 return isQFP32Instr(MI) || isQFP16Instr(MI);
4953}
4954
4955// Return true if the function contains any qf-generating instructions.
4956bool HexagonInstrInfo::hasQFPInstrs(const MachineFunction &MF) const {
4957 for (const MachineBasicBlock &MBB : MF)
4958 for (const MachineInstr &MI : MBB)
4959 if (isQFPInstr(MI: const_cast<MachineInstr *>(&MI)))
4960 return true;
4961 return false;
4962}
4963
4964// Returns true if A appears before B within the same basic block.
4965bool HexagonInstrInfo::isMIBefore(const MachineInstr *A,
4966 const MachineInstr *B) const {
4967 if (!A || !B || A->getParent() != B->getParent())
4968 return false;
4969
4970 for (const MachineInstr &MI : *A->getParent()) {
4971 if (&MI == A)
4972 return true;
4973 if (&MI == B)
4974 return false;
4975 }
4976 return false;
4977}
4978
4979// Addressing mode relations.
4980short HexagonInstrInfo::changeAddrMode_abs_io(short Opc) const {
4981 return Opc >= 0 ? Hexagon::changeAddrMode_abs_io(Opcode: Opc) : Opc;
4982}
4983
4984short HexagonInstrInfo::changeAddrMode_io_abs(short Opc) const {
4985 return Opc >= 0 ? Hexagon::changeAddrMode_io_abs(Opcode: Opc) : Opc;
4986}
4987
4988short HexagonInstrInfo::changeAddrMode_io_pi(short Opc) const {
4989 return Opc >= 0 ? Hexagon::changeAddrMode_io_pi(Opcode: Opc) : Opc;
4990}
4991
4992short HexagonInstrInfo::changeAddrMode_io_rr(short Opc) const {
4993 return Opc >= 0 ? Hexagon::changeAddrMode_io_rr(Opcode: Opc) : Opc;
4994}
4995
4996short HexagonInstrInfo::changeAddrMode_pi_io(short Opc) const {
4997 return Opc >= 0 ? Hexagon::changeAddrMode_pi_io(Opcode: Opc) : Opc;
4998}
4999
5000short HexagonInstrInfo::changeAddrMode_rr_io(short Opc) const {
5001 return Opc >= 0 ? Hexagon::changeAddrMode_rr_io(Opcode: Opc) : Opc;
5002}
5003
5004short HexagonInstrInfo::changeAddrMode_rr_ur(short Opc) const {
5005 return Opc >= 0 ? Hexagon::changeAddrMode_rr_ur(Opcode: Opc) : Opc;
5006}
5007
5008short HexagonInstrInfo::changeAddrMode_ur_rr(short Opc) const {
5009 return Opc >= 0 ? Hexagon::changeAddrMode_ur_rr(Opcode: Opc) : Opc;
5010}
5011
5012MCInst HexagonInstrInfo::getNop() const {
5013 static const MCInst Nop = MCInstBuilder(Hexagon::A2_nop);
5014
5015 return MCInstBuilder(Hexagon::BUNDLE)
5016 .addImm(Val: 0)
5017 .addInst(Val: &Nop);
5018}
5019