1 //===-- PPCInstrInfo.cpp - PowerPC Instruction Information ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains the PowerPC implementation of the TargetInstrInfo class.
12 //===----------------------------------------------------------------------===//
14 #include "PPCInstrInfo.h"
15 #include "MCTargetDesc/PPCPredicates.h"
17 #include "PPCHazardRecognizers.h"
18 #include "PPCInstrBuilder.h"
19 #include "PPCMachineFunctionInfo.h"
20 #include "PPCTargetMachine.h"
21 #include "llvm/ADT/STLExtras.h"
22 #include "llvm/ADT/Statistic.h"
23 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
24 #include "llvm/CodeGen/MachineFrameInfo.h"
25 #include "llvm/CodeGen/MachineFunctionPass.h"
26 #include "llvm/CodeGen/MachineInstrBuilder.h"
27 #include "llvm/CodeGen/MachineMemOperand.h"
28 #include "llvm/CodeGen/MachineRegisterInfo.h"
29 #include "llvm/CodeGen/PseudoSourceValue.h"
30 #include "llvm/CodeGen/SlotIndexes.h"
31 #include "llvm/MC/MCAsmInfo.h"
32 #include "llvm/Support/CommandLine.h"
33 #include "llvm/Support/Debug.h"
34 #include "llvm/Support/ErrorHandling.h"
35 #include "llvm/Support/TargetRegistry.h"
36 #include "llvm/Support/raw_ostream.h"
38 #define GET_INSTRMAP_INFO
39 #define GET_INSTRINFO_CTOR_DTOR
40 #include "PPCGenInstrInfo.inc"
45 opt<bool> DisableCTRLoopAnal("disable-ppc-ctrloop-analysis", cl::Hidden,
46 cl::desc("Disable analysis for CTR loops"));
48 static cl::opt<bool> DisableCmpOpt("disable-ppc-cmp-opt",
49 cl::desc("Disable compare instruction optimization"), cl::Hidden);
51 static cl::opt<bool> DisableVSXFMAMutate("disable-ppc-vsx-fma-mutation",
52 cl::desc("Disable VSX FMA instruction mutation"), cl::Hidden);
54 static cl::opt<bool> VSXSelfCopyCrash("crash-on-ppc-vsx-self-copy",
55 cl::desc("Causes the backend to crash instead of generating a nop VSX copy"),
58 // Pin the vtable to this file.
59 void PPCInstrInfo::anchor() {}
61 PPCInstrInfo::PPCInstrInfo(PPCTargetMachine &tm)
62 : PPCGenInstrInfo(PPC::ADJCALLSTACKDOWN, PPC::ADJCALLSTACKUP),
63 TM(tm), RI(*TM.getSubtargetImpl()) {}
65 /// CreateTargetHazardRecognizer - Return the hazard recognizer to use for
66 /// this target when scheduling the DAG.
67 ScheduleHazardRecognizer *PPCInstrInfo::CreateTargetHazardRecognizer(
68 const TargetMachine *TM,
69 const ScheduleDAG *DAG) const {
70 unsigned Directive = TM->getSubtarget<PPCSubtarget>().getDarwinDirective();
71 if (Directive == PPC::DIR_440 || Directive == PPC::DIR_A2 ||
72 Directive == PPC::DIR_E500mc || Directive == PPC::DIR_E5500) {
73 const InstrItineraryData *II = TM->getInstrItineraryData();
74 return new ScoreboardHazardRecognizer(II, DAG);
77 return TargetInstrInfo::CreateTargetHazardRecognizer(TM, DAG);
80 /// CreateTargetPostRAHazardRecognizer - Return the postRA hazard recognizer
81 /// to use for this target when scheduling the DAG.
82 ScheduleHazardRecognizer *PPCInstrInfo::CreateTargetPostRAHazardRecognizer(
83 const InstrItineraryData *II,
84 const ScheduleDAG *DAG) const {
85 unsigned Directive = TM.getSubtarget<PPCSubtarget>().getDarwinDirective();
87 if (Directive == PPC::DIR_PWR7)
88 return new PPCDispatchGroupSBHazardRecognizer(II, DAG);
90 // Most subtargets use a PPC970 recognizer.
91 if (Directive != PPC::DIR_440 && Directive != PPC::DIR_A2 &&
92 Directive != PPC::DIR_E500mc && Directive != PPC::DIR_E5500) {
93 assert(TM.getInstrInfo() && "No InstrInfo?");
95 return new PPCHazardRecognizer970(TM);
98 return new ScoreboardHazardRecognizer(II, DAG);
102 int PPCInstrInfo::getOperandLatency(const InstrItineraryData *ItinData,
103 const MachineInstr *DefMI, unsigned DefIdx,
104 const MachineInstr *UseMI,
105 unsigned UseIdx) const {
106 int Latency = PPCGenInstrInfo::getOperandLatency(ItinData, DefMI, DefIdx,
109 const MachineOperand &DefMO = DefMI->getOperand(DefIdx);
110 unsigned Reg = DefMO.getReg();
112 const TargetRegisterInfo *TRI = &getRegisterInfo();
114 if (TRI->isVirtualRegister(Reg)) {
115 const MachineRegisterInfo *MRI =
116 &DefMI->getParent()->getParent()->getRegInfo();
117 IsRegCR = MRI->getRegClass(Reg)->hasSuperClassEq(&PPC::CRRCRegClass) ||
118 MRI->getRegClass(Reg)->hasSuperClassEq(&PPC::CRBITRCRegClass);
120 IsRegCR = PPC::CRRCRegClass.contains(Reg) ||
121 PPC::CRBITRCRegClass.contains(Reg);
124 if (UseMI->isBranch() && IsRegCR) {
126 Latency = getInstrLatency(ItinData, DefMI);
128 // On some cores, there is an additional delay between writing to a condition
129 // register, and using it from a branch.
130 unsigned Directive = TM.getSubtarget<PPCSubtarget>().getDarwinDirective();
151 // Detect 32 -> 64-bit extensions where we may reuse the low sub-register.
152 bool PPCInstrInfo::isCoalescableExtInstr(const MachineInstr &MI,
153 unsigned &SrcReg, unsigned &DstReg,
154 unsigned &SubIdx) const {
155 switch (MI.getOpcode()) {
156 default: return false;
158 case PPC::EXTSW_32_64:
159 SrcReg = MI.getOperand(1).getReg();
160 DstReg = MI.getOperand(0).getReg();
161 SubIdx = PPC::sub_32;
166 unsigned PPCInstrInfo::isLoadFromStackSlot(const MachineInstr *MI,
167 int &FrameIndex) const {
168 // Note: This list must be kept consistent with LoadRegFromStackSlot.
169 switch (MI->getOpcode()) {
175 case PPC::RESTORE_CR:
176 case PPC::RESTORE_CRBIT:
179 case PPC::RESTORE_VRSAVE:
180 // Check for the operands added by addFrameReference (the immediate is the
181 // offset which defaults to 0).
182 if (MI->getOperand(1).isImm() && !MI->getOperand(1).getImm() &&
183 MI->getOperand(2).isFI()) {
184 FrameIndex = MI->getOperand(2).getIndex();
185 return MI->getOperand(0).getReg();
192 unsigned PPCInstrInfo::isStoreToStackSlot(const MachineInstr *MI,
193 int &FrameIndex) const {
194 // Note: This list must be kept consistent with StoreRegToStackSlot.
195 switch (MI->getOpcode()) {
202 case PPC::SPILL_CRBIT:
205 case PPC::SPILL_VRSAVE:
206 // Check for the operands added by addFrameReference (the immediate is the
207 // offset which defaults to 0).
208 if (MI->getOperand(1).isImm() && !MI->getOperand(1).getImm() &&
209 MI->getOperand(2).isFI()) {
210 FrameIndex = MI->getOperand(2).getIndex();
211 return MI->getOperand(0).getReg();
218 // commuteInstruction - We can commute rlwimi instructions, but only if the
219 // rotate amt is zero. We also have to munge the immediates a bit.
221 PPCInstrInfo::commuteInstruction(MachineInstr *MI, bool NewMI) const {
222 MachineFunction &MF = *MI->getParent()->getParent();
224 // Normal instructions can be commuted the obvious way.
225 if (MI->getOpcode() != PPC::RLWIMI &&
226 MI->getOpcode() != PPC::RLWIMIo &&
227 MI->getOpcode() != PPC::RLWIMI8 &&
228 MI->getOpcode() != PPC::RLWIMI8o)
229 return TargetInstrInfo::commuteInstruction(MI, NewMI);
231 // Cannot commute if it has a non-zero rotate count.
232 if (MI->getOperand(3).getImm() != 0)
235 // If we have a zero rotate count, we have:
237 // Op0 = (Op1 & ~M) | (Op2 & M)
239 // M = mask((ME+1)&31, (MB-1)&31)
240 // Op0 = (Op2 & ~M) | (Op1 & M)
243 unsigned Reg0 = MI->getOperand(0).getReg();
244 unsigned Reg1 = MI->getOperand(1).getReg();
245 unsigned Reg2 = MI->getOperand(2).getReg();
246 unsigned SubReg1 = MI->getOperand(1).getSubReg();
247 unsigned SubReg2 = MI->getOperand(2).getSubReg();
248 bool Reg1IsKill = MI->getOperand(1).isKill();
249 bool Reg2IsKill = MI->getOperand(2).isKill();
250 bool ChangeReg0 = false;
251 // If machine instrs are no longer in two-address forms, update
252 // destination register as well.
254 // Must be two address instruction!
255 assert(MI->getDesc().getOperandConstraint(0, MCOI::TIED_TO) &&
256 "Expecting a two-address instruction!");
257 assert(MI->getOperand(0).getSubReg() == SubReg1 && "Tied subreg mismatch");
263 unsigned MB = MI->getOperand(4).getImm();
264 unsigned ME = MI->getOperand(5).getImm();
267 // Create a new instruction.
268 unsigned Reg0 = ChangeReg0 ? Reg2 : MI->getOperand(0).getReg();
269 bool Reg0IsDead = MI->getOperand(0).isDead();
270 return BuildMI(MF, MI->getDebugLoc(), MI->getDesc())
271 .addReg(Reg0, RegState::Define | getDeadRegState(Reg0IsDead))
272 .addReg(Reg2, getKillRegState(Reg2IsKill))
273 .addReg(Reg1, getKillRegState(Reg1IsKill))
275 .addImm((MB-1) & 31);
279 MI->getOperand(0).setReg(Reg2);
280 MI->getOperand(0).setSubReg(SubReg2);
282 MI->getOperand(2).setReg(Reg1);
283 MI->getOperand(1).setReg(Reg2);
284 MI->getOperand(2).setSubReg(SubReg1);
285 MI->getOperand(1).setSubReg(SubReg2);
286 MI->getOperand(2).setIsKill(Reg1IsKill);
287 MI->getOperand(1).setIsKill(Reg2IsKill);
289 // Swap the mask around.
290 MI->getOperand(4).setImm((ME+1) & 31);
291 MI->getOperand(5).setImm((MB-1) & 31);
295 bool PPCInstrInfo::findCommutedOpIndices(MachineInstr *MI, unsigned &SrcOpIdx1,
296 unsigned &SrcOpIdx2) const {
297 // For VSX A-Type FMA instructions, it is the first two operands that can be
298 // commuted, however, because the non-encoded tied input operand is listed
299 // first, the operands to swap are actually the second and third.
301 int AltOpc = PPC::getAltVSXFMAOpcode(MI->getOpcode());
303 return TargetInstrInfo::findCommutedOpIndices(MI, SrcOpIdx1, SrcOpIdx2);
310 void PPCInstrInfo::insertNoop(MachineBasicBlock &MBB,
311 MachineBasicBlock::iterator MI) const {
312 // This function is used for scheduling, and the nop wanted here is the type
313 // that terminates dispatch groups on the POWER cores.
314 unsigned Directive = TM.getSubtarget<PPCSubtarget>().getDarwinDirective();
317 default: Opcode = PPC::NOP; break;
318 case PPC::DIR_PWR6: Opcode = PPC::NOP_GT_PWR6; break;
319 case PPC::DIR_PWR7: Opcode = PPC::NOP_GT_PWR7; break;
323 BuildMI(MBB, MI, DL, get(Opcode));
327 // Note: If the condition register is set to CTR or CTR8 then this is a
328 // BDNZ (imm == 1) or BDZ (imm == 0) branch.
329 bool PPCInstrInfo::AnalyzeBranch(MachineBasicBlock &MBB,MachineBasicBlock *&TBB,
330 MachineBasicBlock *&FBB,
331 SmallVectorImpl<MachineOperand> &Cond,
332 bool AllowModify) const {
333 bool isPPC64 = TM.getSubtargetImpl()->isPPC64();
335 // If the block has no terminators, it just falls into the block after it.
336 MachineBasicBlock::iterator I = MBB.end();
337 if (I == MBB.begin())
340 while (I->isDebugValue()) {
341 if (I == MBB.begin())
345 if (!isUnpredicatedTerminator(I))
348 // Get the last instruction in the block.
349 MachineInstr *LastInst = I;
351 // If there is only one terminator instruction, process it.
352 if (I == MBB.begin() || !isUnpredicatedTerminator(--I)) {
353 if (LastInst->getOpcode() == PPC::B) {
354 if (!LastInst->getOperand(0).isMBB())
356 TBB = LastInst->getOperand(0).getMBB();
358 } else if (LastInst->getOpcode() == PPC::BCC) {
359 if (!LastInst->getOperand(2).isMBB())
361 // Block ends with fall-through condbranch.
362 TBB = LastInst->getOperand(2).getMBB();
363 Cond.push_back(LastInst->getOperand(0));
364 Cond.push_back(LastInst->getOperand(1));
366 } else if (LastInst->getOpcode() == PPC::BC) {
367 if (!LastInst->getOperand(1).isMBB())
369 // Block ends with fall-through condbranch.
370 TBB = LastInst->getOperand(1).getMBB();
371 Cond.push_back(MachineOperand::CreateImm(PPC::PRED_BIT_SET));
372 Cond.push_back(LastInst->getOperand(0));
374 } else if (LastInst->getOpcode() == PPC::BCn) {
375 if (!LastInst->getOperand(1).isMBB())
377 // Block ends with fall-through condbranch.
378 TBB = LastInst->getOperand(1).getMBB();
379 Cond.push_back(MachineOperand::CreateImm(PPC::PRED_BIT_UNSET));
380 Cond.push_back(LastInst->getOperand(0));
382 } else if (LastInst->getOpcode() == PPC::BDNZ8 ||
383 LastInst->getOpcode() == PPC::BDNZ) {
384 if (!LastInst->getOperand(0).isMBB())
386 if (DisableCTRLoopAnal)
388 TBB = LastInst->getOperand(0).getMBB();
389 Cond.push_back(MachineOperand::CreateImm(1));
390 Cond.push_back(MachineOperand::CreateReg(isPPC64 ? PPC::CTR8 : PPC::CTR,
393 } else if (LastInst->getOpcode() == PPC::BDZ8 ||
394 LastInst->getOpcode() == PPC::BDZ) {
395 if (!LastInst->getOperand(0).isMBB())
397 if (DisableCTRLoopAnal)
399 TBB = LastInst->getOperand(0).getMBB();
400 Cond.push_back(MachineOperand::CreateImm(0));
401 Cond.push_back(MachineOperand::CreateReg(isPPC64 ? PPC::CTR8 : PPC::CTR,
406 // Otherwise, don't know what this is.
410 // Get the instruction before it if it's a terminator.
411 MachineInstr *SecondLastInst = I;
413 // If there are three terminators, we don't know what sort of block this is.
414 if (SecondLastInst && I != MBB.begin() &&
415 isUnpredicatedTerminator(--I))
418 // If the block ends with PPC::B and PPC:BCC, handle it.
419 if (SecondLastInst->getOpcode() == PPC::BCC &&
420 LastInst->getOpcode() == PPC::B) {
421 if (!SecondLastInst->getOperand(2).isMBB() ||
422 !LastInst->getOperand(0).isMBB())
424 TBB = SecondLastInst->getOperand(2).getMBB();
425 Cond.push_back(SecondLastInst->getOperand(0));
426 Cond.push_back(SecondLastInst->getOperand(1));
427 FBB = LastInst->getOperand(0).getMBB();
429 } else if (SecondLastInst->getOpcode() == PPC::BC &&
430 LastInst->getOpcode() == PPC::B) {
431 if (!SecondLastInst->getOperand(1).isMBB() ||
432 !LastInst->getOperand(0).isMBB())
434 TBB = SecondLastInst->getOperand(1).getMBB();
435 Cond.push_back(MachineOperand::CreateImm(PPC::PRED_BIT_SET));
436 Cond.push_back(SecondLastInst->getOperand(0));
437 FBB = LastInst->getOperand(0).getMBB();
439 } else if (SecondLastInst->getOpcode() == PPC::BCn &&
440 LastInst->getOpcode() == PPC::B) {
441 if (!SecondLastInst->getOperand(1).isMBB() ||
442 !LastInst->getOperand(0).isMBB())
444 TBB = SecondLastInst->getOperand(1).getMBB();
445 Cond.push_back(MachineOperand::CreateImm(PPC::PRED_BIT_UNSET));
446 Cond.push_back(SecondLastInst->getOperand(0));
447 FBB = LastInst->getOperand(0).getMBB();
449 } else if ((SecondLastInst->getOpcode() == PPC::BDNZ8 ||
450 SecondLastInst->getOpcode() == PPC::BDNZ) &&
451 LastInst->getOpcode() == PPC::B) {
452 if (!SecondLastInst->getOperand(0).isMBB() ||
453 !LastInst->getOperand(0).isMBB())
455 if (DisableCTRLoopAnal)
457 TBB = SecondLastInst->getOperand(0).getMBB();
458 Cond.push_back(MachineOperand::CreateImm(1));
459 Cond.push_back(MachineOperand::CreateReg(isPPC64 ? PPC::CTR8 : PPC::CTR,
461 FBB = LastInst->getOperand(0).getMBB();
463 } else if ((SecondLastInst->getOpcode() == PPC::BDZ8 ||
464 SecondLastInst->getOpcode() == PPC::BDZ) &&
465 LastInst->getOpcode() == PPC::B) {
466 if (!SecondLastInst->getOperand(0).isMBB() ||
467 !LastInst->getOperand(0).isMBB())
469 if (DisableCTRLoopAnal)
471 TBB = SecondLastInst->getOperand(0).getMBB();
472 Cond.push_back(MachineOperand::CreateImm(0));
473 Cond.push_back(MachineOperand::CreateReg(isPPC64 ? PPC::CTR8 : PPC::CTR,
475 FBB = LastInst->getOperand(0).getMBB();
479 // If the block ends with two PPC:Bs, handle it. The second one is not
480 // executed, so remove it.
481 if (SecondLastInst->getOpcode() == PPC::B &&
482 LastInst->getOpcode() == PPC::B) {
483 if (!SecondLastInst->getOperand(0).isMBB())
485 TBB = SecondLastInst->getOperand(0).getMBB();
488 I->eraseFromParent();
492 // Otherwise, can't handle this.
496 unsigned PPCInstrInfo::RemoveBranch(MachineBasicBlock &MBB) const {
497 MachineBasicBlock::iterator I = MBB.end();
498 if (I == MBB.begin()) return 0;
500 while (I->isDebugValue()) {
501 if (I == MBB.begin())
505 if (I->getOpcode() != PPC::B && I->getOpcode() != PPC::BCC &&
506 I->getOpcode() != PPC::BC && I->getOpcode() != PPC::BCn &&
507 I->getOpcode() != PPC::BDNZ8 && I->getOpcode() != PPC::BDNZ &&
508 I->getOpcode() != PPC::BDZ8 && I->getOpcode() != PPC::BDZ)
511 // Remove the branch.
512 I->eraseFromParent();
516 if (I == MBB.begin()) return 1;
518 if (I->getOpcode() != PPC::BCC &&
519 I->getOpcode() != PPC::BC && I->getOpcode() != PPC::BCn &&
520 I->getOpcode() != PPC::BDNZ8 && I->getOpcode() != PPC::BDNZ &&
521 I->getOpcode() != PPC::BDZ8 && I->getOpcode() != PPC::BDZ)
524 // Remove the branch.
525 I->eraseFromParent();
530 PPCInstrInfo::InsertBranch(MachineBasicBlock &MBB, MachineBasicBlock *TBB,
531 MachineBasicBlock *FBB,
532 const SmallVectorImpl<MachineOperand> &Cond,
534 // Shouldn't be a fall through.
535 assert(TBB && "InsertBranch must not be told to insert a fallthrough");
536 assert((Cond.size() == 2 || Cond.size() == 0) &&
537 "PPC branch conditions have two components!");
539 bool isPPC64 = TM.getSubtargetImpl()->isPPC64();
543 if (Cond.empty()) // Unconditional branch
544 BuildMI(&MBB, DL, get(PPC::B)).addMBB(TBB);
545 else if (Cond[1].getReg() == PPC::CTR || Cond[1].getReg() == PPC::CTR8)
546 BuildMI(&MBB, DL, get(Cond[0].getImm() ?
547 (isPPC64 ? PPC::BDNZ8 : PPC::BDNZ) :
548 (isPPC64 ? PPC::BDZ8 : PPC::BDZ))).addMBB(TBB);
549 else if (Cond[0].getImm() == PPC::PRED_BIT_SET)
550 BuildMI(&MBB, DL, get(PPC::BC)).addOperand(Cond[1]).addMBB(TBB);
551 else if (Cond[0].getImm() == PPC::PRED_BIT_UNSET)
552 BuildMI(&MBB, DL, get(PPC::BCn)).addOperand(Cond[1]).addMBB(TBB);
553 else // Conditional branch
554 BuildMI(&MBB, DL, get(PPC::BCC))
555 .addImm(Cond[0].getImm()).addOperand(Cond[1]).addMBB(TBB);
559 // Two-way Conditional Branch.
560 if (Cond[1].getReg() == PPC::CTR || Cond[1].getReg() == PPC::CTR8)
561 BuildMI(&MBB, DL, get(Cond[0].getImm() ?
562 (isPPC64 ? PPC::BDNZ8 : PPC::BDNZ) :
563 (isPPC64 ? PPC::BDZ8 : PPC::BDZ))).addMBB(TBB);
564 else if (Cond[0].getImm() == PPC::PRED_BIT_SET)
565 BuildMI(&MBB, DL, get(PPC::BC)).addOperand(Cond[1]).addMBB(TBB);
566 else if (Cond[0].getImm() == PPC::PRED_BIT_UNSET)
567 BuildMI(&MBB, DL, get(PPC::BCn)).addOperand(Cond[1]).addMBB(TBB);
569 BuildMI(&MBB, DL, get(PPC::BCC))
570 .addImm(Cond[0].getImm()).addOperand(Cond[1]).addMBB(TBB);
571 BuildMI(&MBB, DL, get(PPC::B)).addMBB(FBB);
576 bool PPCInstrInfo::canInsertSelect(const MachineBasicBlock &MBB,
577 const SmallVectorImpl<MachineOperand> &Cond,
578 unsigned TrueReg, unsigned FalseReg,
579 int &CondCycles, int &TrueCycles, int &FalseCycles) const {
580 if (!TM.getSubtargetImpl()->hasISEL())
583 if (Cond.size() != 2)
586 // If this is really a bdnz-like condition, then it cannot be turned into a
588 if (Cond[1].getReg() == PPC::CTR || Cond[1].getReg() == PPC::CTR8)
591 // Check register classes.
592 const MachineRegisterInfo &MRI = MBB.getParent()->getRegInfo();
593 const TargetRegisterClass *RC =
594 RI.getCommonSubClass(MRI.getRegClass(TrueReg), MRI.getRegClass(FalseReg));
598 // isel is for regular integer GPRs only.
599 if (!PPC::GPRCRegClass.hasSubClassEq(RC) &&
600 !PPC::GPRC_NOR0RegClass.hasSubClassEq(RC) &&
601 !PPC::G8RCRegClass.hasSubClassEq(RC) &&
602 !PPC::G8RC_NOX0RegClass.hasSubClassEq(RC))
605 // FIXME: These numbers are for the A2, how well they work for other cores is
606 // an open question. On the A2, the isel instruction has a 2-cycle latency
607 // but single-cycle throughput. These numbers are used in combination with
608 // the MispredictPenalty setting from the active SchedMachineModel.
616 void PPCInstrInfo::insertSelect(MachineBasicBlock &MBB,
617 MachineBasicBlock::iterator MI, DebugLoc dl,
619 const SmallVectorImpl<MachineOperand> &Cond,
620 unsigned TrueReg, unsigned FalseReg) const {
621 assert(Cond.size() == 2 &&
622 "PPC branch conditions have two components!");
624 assert(TM.getSubtargetImpl()->hasISEL() &&
625 "Cannot insert select on target without ISEL support");
627 // Get the register classes.
628 MachineRegisterInfo &MRI = MBB.getParent()->getRegInfo();
629 const TargetRegisterClass *RC =
630 RI.getCommonSubClass(MRI.getRegClass(TrueReg), MRI.getRegClass(FalseReg));
631 assert(RC && "TrueReg and FalseReg must have overlapping register classes");
633 bool Is64Bit = PPC::G8RCRegClass.hasSubClassEq(RC) ||
634 PPC::G8RC_NOX0RegClass.hasSubClassEq(RC);
636 PPC::GPRCRegClass.hasSubClassEq(RC) ||
637 PPC::GPRC_NOR0RegClass.hasSubClassEq(RC)) &&
638 "isel is for regular integer GPRs only");
640 unsigned OpCode = Is64Bit ? PPC::ISEL8 : PPC::ISEL;
641 unsigned SelectPred = Cond[0].getImm();
645 switch (SelectPred) {
646 default: llvm_unreachable("invalid predicate for isel");
647 case PPC::PRED_EQ: SubIdx = PPC::sub_eq; SwapOps = false; break;
648 case PPC::PRED_NE: SubIdx = PPC::sub_eq; SwapOps = true; break;
649 case PPC::PRED_LT: SubIdx = PPC::sub_lt; SwapOps = false; break;
650 case PPC::PRED_GE: SubIdx = PPC::sub_lt; SwapOps = true; break;
651 case PPC::PRED_GT: SubIdx = PPC::sub_gt; SwapOps = false; break;
652 case PPC::PRED_LE: SubIdx = PPC::sub_gt; SwapOps = true; break;
653 case PPC::PRED_UN: SubIdx = PPC::sub_un; SwapOps = false; break;
654 case PPC::PRED_NU: SubIdx = PPC::sub_un; SwapOps = true; break;
655 case PPC::PRED_BIT_SET: SubIdx = 0; SwapOps = false; break;
656 case PPC::PRED_BIT_UNSET: SubIdx = 0; SwapOps = true; break;
659 unsigned FirstReg = SwapOps ? FalseReg : TrueReg,
660 SecondReg = SwapOps ? TrueReg : FalseReg;
662 // The first input register of isel cannot be r0. If it is a member
663 // of a register class that can be r0, then copy it first (the
664 // register allocator should eliminate the copy).
665 if (MRI.getRegClass(FirstReg)->contains(PPC::R0) ||
666 MRI.getRegClass(FirstReg)->contains(PPC::X0)) {
667 const TargetRegisterClass *FirstRC =
668 MRI.getRegClass(FirstReg)->contains(PPC::X0) ?
669 &PPC::G8RC_NOX0RegClass : &PPC::GPRC_NOR0RegClass;
670 unsigned OldFirstReg = FirstReg;
671 FirstReg = MRI.createVirtualRegister(FirstRC);
672 BuildMI(MBB, MI, dl, get(TargetOpcode::COPY), FirstReg)
673 .addReg(OldFirstReg);
676 BuildMI(MBB, MI, dl, get(OpCode), DestReg)
677 .addReg(FirstReg).addReg(SecondReg)
678 .addReg(Cond[1].getReg(), 0, SubIdx);
681 void PPCInstrInfo::copyPhysReg(MachineBasicBlock &MBB,
682 MachineBasicBlock::iterator I, DebugLoc DL,
683 unsigned DestReg, unsigned SrcReg,
684 bool KillSrc) const {
685 // We can end up with self copies and similar things as a result of VSX copy
686 // legalization. Promote them here.
687 const TargetRegisterInfo *TRI = &getRegisterInfo();
688 if (PPC::F8RCRegClass.contains(DestReg) &&
689 PPC::VSLRCRegClass.contains(SrcReg)) {
691 TRI->getMatchingSuperReg(DestReg, PPC::sub_64, &PPC::VSRCRegClass);
693 if (VSXSelfCopyCrash && SrcReg == SuperReg)
694 llvm_unreachable("nop VSX copy");
697 } else if (PPC::VRRCRegClass.contains(DestReg) &&
698 PPC::VSHRCRegClass.contains(SrcReg)) {
700 TRI->getMatchingSuperReg(DestReg, PPC::sub_128, &PPC::VSRCRegClass);
702 if (VSXSelfCopyCrash && SrcReg == SuperReg)
703 llvm_unreachable("nop VSX copy");
706 } else if (PPC::F8RCRegClass.contains(SrcReg) &&
707 PPC::VSLRCRegClass.contains(DestReg)) {
709 TRI->getMatchingSuperReg(SrcReg, PPC::sub_64, &PPC::VSRCRegClass);
711 if (VSXSelfCopyCrash && DestReg == SuperReg)
712 llvm_unreachable("nop VSX copy");
715 } else if (PPC::VRRCRegClass.contains(SrcReg) &&
716 PPC::VSHRCRegClass.contains(DestReg)) {
718 TRI->getMatchingSuperReg(SrcReg, PPC::sub_128, &PPC::VSRCRegClass);
720 if (VSXSelfCopyCrash && DestReg == SuperReg)
721 llvm_unreachable("nop VSX copy");
727 if (PPC::GPRCRegClass.contains(DestReg, SrcReg))
729 else if (PPC::G8RCRegClass.contains(DestReg, SrcReg))
731 else if (PPC::F4RCRegClass.contains(DestReg, SrcReg))
733 else if (PPC::CRRCRegClass.contains(DestReg, SrcReg))
735 else if (PPC::VRRCRegClass.contains(DestReg, SrcReg))
737 else if (PPC::VSRCRegClass.contains(DestReg, SrcReg))
738 // There are two different ways this can be done:
739 // 1. xxlor : This has lower latency (on the P7), 2 cycles, but can only
740 // issue in VSU pipeline 0.
741 // 2. xmovdp/xmovsp: This has higher latency (on the P7), 6 cycles, but
742 // can go to either pipeline.
743 // We'll always use xxlor here, because in practically all cases where
744 // copies are generated, they are close enough to some use that the
745 // lower-latency form is preferable.
747 else if (PPC::CRBITRCRegClass.contains(DestReg, SrcReg))
750 llvm_unreachable("Impossible reg-to-reg copy");
752 const MCInstrDesc &MCID = get(Opc);
753 if (MCID.getNumOperands() == 3)
754 BuildMI(MBB, I, DL, MCID, DestReg)
755 .addReg(SrcReg).addReg(SrcReg, getKillRegState(KillSrc));
757 BuildMI(MBB, I, DL, MCID, DestReg).addReg(SrcReg, getKillRegState(KillSrc));
760 // This function returns true if a CR spill is necessary and false otherwise.
762 PPCInstrInfo::StoreRegToStackSlot(MachineFunction &MF,
763 unsigned SrcReg, bool isKill,
765 const TargetRegisterClass *RC,
766 SmallVectorImpl<MachineInstr*> &NewMIs,
767 bool &NonRI, bool &SpillsVRS) const{
768 // Note: If additional store instructions are added here,
769 // update isStoreToStackSlot.
772 if (PPC::GPRCRegClass.hasSubClassEq(RC) ||
773 PPC::GPRC_NOR0RegClass.hasSubClassEq(RC)) {
774 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::STW))
776 getKillRegState(isKill)),
778 } else if (PPC::G8RCRegClass.hasSubClassEq(RC) ||
779 PPC::G8RC_NOX0RegClass.hasSubClassEq(RC)) {
780 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::STD))
782 getKillRegState(isKill)),
784 } else if (PPC::F8RCRegClass.hasSubClassEq(RC)) {
785 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::STFD))
787 getKillRegState(isKill)),
789 } else if (PPC::F4RCRegClass.hasSubClassEq(RC)) {
790 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::STFS))
792 getKillRegState(isKill)),
794 } else if (PPC::CRRCRegClass.hasSubClassEq(RC)) {
795 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::SPILL_CR))
797 getKillRegState(isKill)),
800 } else if (PPC::CRBITRCRegClass.hasSubClassEq(RC)) {
801 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::SPILL_CRBIT))
803 getKillRegState(isKill)),
806 } else if (PPC::VRRCRegClass.hasSubClassEq(RC)) {
807 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::STVX))
809 getKillRegState(isKill)),
812 } else if (PPC::VSRCRegClass.hasSubClassEq(RC)) {
813 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::STXVD2X))
815 getKillRegState(isKill)),
818 } else if (PPC::VRSAVERCRegClass.hasSubClassEq(RC)) {
819 assert(TM.getSubtargetImpl()->isDarwin() &&
820 "VRSAVE only needs spill/restore on Darwin");
821 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::SPILL_VRSAVE))
823 getKillRegState(isKill)),
827 llvm_unreachable("Unknown regclass!");
834 PPCInstrInfo::storeRegToStackSlot(MachineBasicBlock &MBB,
835 MachineBasicBlock::iterator MI,
836 unsigned SrcReg, bool isKill, int FrameIdx,
837 const TargetRegisterClass *RC,
838 const TargetRegisterInfo *TRI) const {
839 MachineFunction &MF = *MBB.getParent();
840 SmallVector<MachineInstr*, 4> NewMIs;
842 PPCFunctionInfo *FuncInfo = MF.getInfo<PPCFunctionInfo>();
843 FuncInfo->setHasSpills();
845 bool NonRI = false, SpillsVRS = false;
846 if (StoreRegToStackSlot(MF, SrcReg, isKill, FrameIdx, RC, NewMIs,
848 FuncInfo->setSpillsCR();
851 FuncInfo->setSpillsVRSAVE();
854 FuncInfo->setHasNonRISpills();
856 for (unsigned i = 0, e = NewMIs.size(); i != e; ++i)
857 MBB.insert(MI, NewMIs[i]);
859 const MachineFrameInfo &MFI = *MF.getFrameInfo();
860 MachineMemOperand *MMO =
861 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(FrameIdx),
862 MachineMemOperand::MOStore,
863 MFI.getObjectSize(FrameIdx),
864 MFI.getObjectAlignment(FrameIdx));
865 NewMIs.back()->addMemOperand(MF, MMO);
869 PPCInstrInfo::LoadRegFromStackSlot(MachineFunction &MF, DebugLoc DL,
870 unsigned DestReg, int FrameIdx,
871 const TargetRegisterClass *RC,
872 SmallVectorImpl<MachineInstr*> &NewMIs,
873 bool &NonRI, bool &SpillsVRS) const{
874 // Note: If additional load instructions are added here,
875 // update isLoadFromStackSlot.
877 if (PPC::GPRCRegClass.hasSubClassEq(RC) ||
878 PPC::GPRC_NOR0RegClass.hasSubClassEq(RC)) {
879 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::LWZ),
880 DestReg), FrameIdx));
881 } else if (PPC::G8RCRegClass.hasSubClassEq(RC) ||
882 PPC::G8RC_NOX0RegClass.hasSubClassEq(RC)) {
883 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::LD), DestReg),
885 } else if (PPC::F8RCRegClass.hasSubClassEq(RC)) {
886 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::LFD), DestReg),
888 } else if (PPC::F4RCRegClass.hasSubClassEq(RC)) {
889 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::LFS), DestReg),
891 } else if (PPC::CRRCRegClass.hasSubClassEq(RC)) {
892 NewMIs.push_back(addFrameReference(BuildMI(MF, DL,
893 get(PPC::RESTORE_CR), DestReg),
896 } else if (PPC::CRBITRCRegClass.hasSubClassEq(RC)) {
897 NewMIs.push_back(addFrameReference(BuildMI(MF, DL,
898 get(PPC::RESTORE_CRBIT), DestReg),
901 } else if (PPC::VRRCRegClass.hasSubClassEq(RC)) {
902 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::LVX), DestReg),
905 } else if (PPC::VSRCRegClass.hasSubClassEq(RC)) {
906 NewMIs.push_back(addFrameReference(BuildMI(MF, DL, get(PPC::LXVD2X), DestReg),
909 } else if (PPC::VRSAVERCRegClass.hasSubClassEq(RC)) {
910 assert(TM.getSubtargetImpl()->isDarwin() &&
911 "VRSAVE only needs spill/restore on Darwin");
912 NewMIs.push_back(addFrameReference(BuildMI(MF, DL,
913 get(PPC::RESTORE_VRSAVE),
918 llvm_unreachable("Unknown regclass!");
925 PPCInstrInfo::loadRegFromStackSlot(MachineBasicBlock &MBB,
926 MachineBasicBlock::iterator MI,
927 unsigned DestReg, int FrameIdx,
928 const TargetRegisterClass *RC,
929 const TargetRegisterInfo *TRI) const {
930 MachineFunction &MF = *MBB.getParent();
931 SmallVector<MachineInstr*, 4> NewMIs;
933 if (MI != MBB.end()) DL = MI->getDebugLoc();
935 PPCFunctionInfo *FuncInfo = MF.getInfo<PPCFunctionInfo>();
936 FuncInfo->setHasSpills();
938 bool NonRI = false, SpillsVRS = false;
939 if (LoadRegFromStackSlot(MF, DL, DestReg, FrameIdx, RC, NewMIs,
941 FuncInfo->setSpillsCR();
944 FuncInfo->setSpillsVRSAVE();
947 FuncInfo->setHasNonRISpills();
949 for (unsigned i = 0, e = NewMIs.size(); i != e; ++i)
950 MBB.insert(MI, NewMIs[i]);
952 const MachineFrameInfo &MFI = *MF.getFrameInfo();
953 MachineMemOperand *MMO =
954 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(FrameIdx),
955 MachineMemOperand::MOLoad,
956 MFI.getObjectSize(FrameIdx),
957 MFI.getObjectAlignment(FrameIdx));
958 NewMIs.back()->addMemOperand(MF, MMO);
962 ReverseBranchCondition(SmallVectorImpl<MachineOperand> &Cond) const {
963 assert(Cond.size() == 2 && "Invalid PPC branch opcode!");
964 if (Cond[1].getReg() == PPC::CTR8 || Cond[1].getReg() == PPC::CTR)
965 Cond[0].setImm(Cond[0].getImm() == 0 ? 1 : 0);
967 // Leave the CR# the same, but invert the condition.
968 Cond[0].setImm(PPC::InvertPredicate((PPC::Predicate)Cond[0].getImm()));
972 bool PPCInstrInfo::FoldImmediate(MachineInstr *UseMI, MachineInstr *DefMI,
973 unsigned Reg, MachineRegisterInfo *MRI) const {
974 // For some instructions, it is legal to fold ZERO into the RA register field.
975 // A zero immediate should always be loaded with a single li.
976 unsigned DefOpc = DefMI->getOpcode();
977 if (DefOpc != PPC::LI && DefOpc != PPC::LI8)
979 if (!DefMI->getOperand(1).isImm())
981 if (DefMI->getOperand(1).getImm() != 0)
984 // Note that we cannot here invert the arguments of an isel in order to fold
985 // a ZERO into what is presented as the second argument. All we have here
986 // is the condition bit, and that might come from a CR-logical bit operation.
988 const MCInstrDesc &UseMCID = UseMI->getDesc();
990 // Only fold into real machine instructions.
991 if (UseMCID.isPseudo())
995 for (UseIdx = 0; UseIdx < UseMI->getNumOperands(); ++UseIdx)
996 if (UseMI->getOperand(UseIdx).isReg() &&
997 UseMI->getOperand(UseIdx).getReg() == Reg)
1000 assert(UseIdx < UseMI->getNumOperands() && "Cannot find Reg in UseMI");
1001 assert(UseIdx < UseMCID.getNumOperands() && "No operand description for Reg");
1003 const MCOperandInfo *UseInfo = &UseMCID.OpInfo[UseIdx];
1005 // We can fold the zero if this register requires a GPRC_NOR0/G8RC_NOX0
1006 // register (which might also be specified as a pointer class kind).
1007 if (UseInfo->isLookupPtrRegClass()) {
1008 if (UseInfo->RegClass /* Kind */ != 1)
1011 if (UseInfo->RegClass != PPC::GPRC_NOR0RegClassID &&
1012 UseInfo->RegClass != PPC::G8RC_NOX0RegClassID)
1016 // Make sure this is not tied to an output register (or otherwise
1017 // constrained). This is true for ST?UX registers, for example, which
1018 // are tied to their output registers.
1019 if (UseInfo->Constraints != 0)
1023 if (UseInfo->isLookupPtrRegClass()) {
1024 bool isPPC64 = TM.getSubtargetImpl()->isPPC64();
1025 ZeroReg = isPPC64 ? PPC::ZERO8 : PPC::ZERO;
1027 ZeroReg = UseInfo->RegClass == PPC::G8RC_NOX0RegClassID ?
1028 PPC::ZERO8 : PPC::ZERO;
1031 bool DeleteDef = MRI->hasOneNonDBGUse(Reg);
1032 UseMI->getOperand(UseIdx).setReg(ZeroReg);
1035 DefMI->eraseFromParent();
1040 static bool MBBDefinesCTR(MachineBasicBlock &MBB) {
1041 for (MachineBasicBlock::iterator I = MBB.begin(), IE = MBB.end();
1043 if (I->definesRegister(PPC::CTR) || I->definesRegister(PPC::CTR8))
1048 // We should make sure that, if we're going to predicate both sides of a
1049 // condition (a diamond), that both sides don't define the counter register. We
1050 // can predicate counter-decrement-based branches, but while that predicates
1051 // the branching, it does not predicate the counter decrement. If we tried to
1052 // merge the triangle into one predicated block, we'd decrement the counter
1054 bool PPCInstrInfo::isProfitableToIfCvt(MachineBasicBlock &TMBB,
1055 unsigned NumT, unsigned ExtraT,
1056 MachineBasicBlock &FMBB,
1057 unsigned NumF, unsigned ExtraF,
1058 const BranchProbability &Probability) const {
1059 return !(MBBDefinesCTR(TMBB) && MBBDefinesCTR(FMBB));
1063 bool PPCInstrInfo::isPredicated(const MachineInstr *MI) const {
1064 // The predicated branches are identified by their type, not really by the
1065 // explicit presence of a predicate. Furthermore, some of them can be
1066 // predicated more than once. Because if conversion won't try to predicate
1067 // any instruction which already claims to be predicated (by returning true
1068 // here), always return false. In doing so, we let isPredicable() be the
1069 // final word on whether not the instruction can be (further) predicated.
1074 bool PPCInstrInfo::isUnpredicatedTerminator(const MachineInstr *MI) const {
1075 if (!MI->isTerminator())
1078 // Conditional branch is a special case.
1079 if (MI->isBranch() && !MI->isBarrier())
1082 return !isPredicated(MI);
1085 bool PPCInstrInfo::PredicateInstruction(
1087 const SmallVectorImpl<MachineOperand> &Pred) const {
1088 unsigned OpC = MI->getOpcode();
1089 if (OpC == PPC::BLR) {
1090 if (Pred[1].getReg() == PPC::CTR8 || Pred[1].getReg() == PPC::CTR) {
1091 bool isPPC64 = TM.getSubtargetImpl()->isPPC64();
1092 MI->setDesc(get(Pred[0].getImm() ?
1093 (isPPC64 ? PPC::BDNZLR8 : PPC::BDNZLR) :
1094 (isPPC64 ? PPC::BDZLR8 : PPC::BDZLR)));
1095 } else if (Pred[0].getImm() == PPC::PRED_BIT_SET) {
1096 MI->setDesc(get(PPC::BCLR));
1097 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1098 .addReg(Pred[1].getReg());
1099 } else if (Pred[0].getImm() == PPC::PRED_BIT_UNSET) {
1100 MI->setDesc(get(PPC::BCLRn));
1101 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1102 .addReg(Pred[1].getReg());
1104 MI->setDesc(get(PPC::BCCLR));
1105 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1106 .addImm(Pred[0].getImm())
1107 .addReg(Pred[1].getReg());
1111 } else if (OpC == PPC::B) {
1112 if (Pred[1].getReg() == PPC::CTR8 || Pred[1].getReg() == PPC::CTR) {
1113 bool isPPC64 = TM.getSubtargetImpl()->isPPC64();
1114 MI->setDesc(get(Pred[0].getImm() ?
1115 (isPPC64 ? PPC::BDNZ8 : PPC::BDNZ) :
1116 (isPPC64 ? PPC::BDZ8 : PPC::BDZ)));
1117 } else if (Pred[0].getImm() == PPC::PRED_BIT_SET) {
1118 MachineBasicBlock *MBB = MI->getOperand(0).getMBB();
1119 MI->RemoveOperand(0);
1121 MI->setDesc(get(PPC::BC));
1122 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1123 .addReg(Pred[1].getReg())
1125 } else if (Pred[0].getImm() == PPC::PRED_BIT_UNSET) {
1126 MachineBasicBlock *MBB = MI->getOperand(0).getMBB();
1127 MI->RemoveOperand(0);
1129 MI->setDesc(get(PPC::BCn));
1130 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1131 .addReg(Pred[1].getReg())
1134 MachineBasicBlock *MBB = MI->getOperand(0).getMBB();
1135 MI->RemoveOperand(0);
1137 MI->setDesc(get(PPC::BCC));
1138 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1139 .addImm(Pred[0].getImm())
1140 .addReg(Pred[1].getReg())
1145 } else if (OpC == PPC::BCTR || OpC == PPC::BCTR8 ||
1146 OpC == PPC::BCTRL || OpC == PPC::BCTRL8) {
1147 if (Pred[1].getReg() == PPC::CTR8 || Pred[1].getReg() == PPC::CTR)
1148 llvm_unreachable("Cannot predicate bctr[l] on the ctr register");
1150 bool setLR = OpC == PPC::BCTRL || OpC == PPC::BCTRL8;
1151 bool isPPC64 = TM.getSubtargetImpl()->isPPC64();
1153 if (Pred[0].getImm() == PPC::PRED_BIT_SET) {
1154 MI->setDesc(get(isPPC64 ? (setLR ? PPC::BCCTRL8 : PPC::BCCTR8) :
1155 (setLR ? PPC::BCCTRL : PPC::BCCTR)));
1156 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1157 .addReg(Pred[1].getReg());
1159 } else if (Pred[0].getImm() == PPC::PRED_BIT_UNSET) {
1160 MI->setDesc(get(isPPC64 ? (setLR ? PPC::BCCTRL8n : PPC::BCCTR8n) :
1161 (setLR ? PPC::BCCTRLn : PPC::BCCTRn)));
1162 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1163 .addReg(Pred[1].getReg());
1167 MI->setDesc(get(isPPC64 ? (setLR ? PPC::BCCCTRL8 : PPC::BCCCTR8) :
1168 (setLR ? PPC::BCCCTRL : PPC::BCCCTR)));
1169 MachineInstrBuilder(*MI->getParent()->getParent(), MI)
1170 .addImm(Pred[0].getImm())
1171 .addReg(Pred[1].getReg());
1178 bool PPCInstrInfo::SubsumesPredicate(
1179 const SmallVectorImpl<MachineOperand> &Pred1,
1180 const SmallVectorImpl<MachineOperand> &Pred2) const {
1181 assert(Pred1.size() == 2 && "Invalid PPC first predicate");
1182 assert(Pred2.size() == 2 && "Invalid PPC second predicate");
1184 if (Pred1[1].getReg() == PPC::CTR8 || Pred1[1].getReg() == PPC::CTR)
1186 if (Pred2[1].getReg() == PPC::CTR8 || Pred2[1].getReg() == PPC::CTR)
1189 // P1 can only subsume P2 if they test the same condition register.
1190 if (Pred1[1].getReg() != Pred2[1].getReg())
1193 PPC::Predicate P1 = (PPC::Predicate) Pred1[0].getImm();
1194 PPC::Predicate P2 = (PPC::Predicate) Pred2[0].getImm();
1199 // Does P1 subsume P2, e.g. GE subsumes GT.
1200 if (P1 == PPC::PRED_LE &&
1201 (P2 == PPC::PRED_LT || P2 == PPC::PRED_EQ))
1203 if (P1 == PPC::PRED_GE &&
1204 (P2 == PPC::PRED_GT || P2 == PPC::PRED_EQ))
1210 bool PPCInstrInfo::DefinesPredicate(MachineInstr *MI,
1211 std::vector<MachineOperand> &Pred) const {
1212 // Note: At the present time, the contents of Pred from this function is
1213 // unused by IfConversion. This implementation follows ARM by pushing the
1214 // CR-defining operand. Because the 'DZ' and 'DNZ' count as types of
1215 // predicate, instructions defining CTR or CTR8 are also included as
1216 // predicate-defining instructions.
1218 const TargetRegisterClass *RCs[] =
1219 { &PPC::CRRCRegClass, &PPC::CRBITRCRegClass,
1220 &PPC::CTRRCRegClass, &PPC::CTRRC8RegClass };
1223 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
1224 const MachineOperand &MO = MI->getOperand(i);
1225 for (unsigned c = 0; c < array_lengthof(RCs) && !Found; ++c) {
1226 const TargetRegisterClass *RC = RCs[c];
1228 if (MO.isDef() && RC->contains(MO.getReg())) {
1232 } else if (MO.isRegMask()) {
1233 for (TargetRegisterClass::iterator I = RC->begin(),
1234 IE = RC->end(); I != IE; ++I)
1235 if (MO.clobbersPhysReg(*I)) {
1246 bool PPCInstrInfo::isPredicable(MachineInstr *MI) const {
1247 unsigned OpC = MI->getOpcode();
1261 bool PPCInstrInfo::analyzeCompare(const MachineInstr *MI,
1262 unsigned &SrcReg, unsigned &SrcReg2,
1263 int &Mask, int &Value) const {
1264 unsigned Opc = MI->getOpcode();
1267 default: return false;
1272 SrcReg = MI->getOperand(1).getReg();
1274 Value = MI->getOperand(2).getImm();
1283 SrcReg = MI->getOperand(1).getReg();
1284 SrcReg2 = MI->getOperand(2).getReg();
1289 bool PPCInstrInfo::optimizeCompareInstr(MachineInstr *CmpInstr,
1290 unsigned SrcReg, unsigned SrcReg2,
1291 int Mask, int Value,
1292 const MachineRegisterInfo *MRI) const {
1296 int OpC = CmpInstr->getOpcode();
1297 unsigned CRReg = CmpInstr->getOperand(0).getReg();
1299 // FP record forms set CR1 based on the execption status bits, not a
1300 // comparison with zero.
1301 if (OpC == PPC::FCMPUS || OpC == PPC::FCMPUD)
1304 // The record forms set the condition register based on a signed comparison
1305 // with zero (so says the ISA manual). This is not as straightforward as it
1306 // seems, however, because this is always a 64-bit comparison on PPC64, even
1307 // for instructions that are 32-bit in nature (like slw for example).
1308 // So, on PPC32, for unsigned comparisons, we can use the record forms only
1309 // for equality checks (as those don't depend on the sign). On PPC64,
1310 // we are restricted to equality for unsigned 64-bit comparisons and for
1311 // signed 32-bit comparisons the applicability is more restricted.
1312 bool isPPC64 = TM.getSubtargetImpl()->isPPC64();
1313 bool is32BitSignedCompare = OpC == PPC::CMPWI || OpC == PPC::CMPW;
1314 bool is32BitUnsignedCompare = OpC == PPC::CMPLWI || OpC == PPC::CMPLW;
1315 bool is64BitUnsignedCompare = OpC == PPC::CMPLDI || OpC == PPC::CMPLD;
1317 // Get the unique definition of SrcReg.
1318 MachineInstr *MI = MRI->getUniqueVRegDef(SrcReg);
1319 if (!MI) return false;
1320 int MIOpC = MI->getOpcode();
1322 bool equalityOnly = false;
1325 if (is32BitSignedCompare) {
1326 // We can perform this optimization only if MI is sign-extending.
1327 if (MIOpC == PPC::SRAW || MIOpC == PPC::SRAWo ||
1328 MIOpC == PPC::SRAWI || MIOpC == PPC::SRAWIo ||
1329 MIOpC == PPC::EXTSB || MIOpC == PPC::EXTSBo ||
1330 MIOpC == PPC::EXTSH || MIOpC == PPC::EXTSHo ||
1331 MIOpC == PPC::EXTSW || MIOpC == PPC::EXTSWo) {
1335 } else if (is32BitUnsignedCompare) {
1336 // We can perform this optimization, equality only, if MI is
1338 if (MIOpC == PPC::CNTLZW || MIOpC == PPC::CNTLZWo ||
1339 MIOpC == PPC::SLW || MIOpC == PPC::SLWo ||
1340 MIOpC == PPC::SRW || MIOpC == PPC::SRWo) {
1342 equalityOnly = true;
1346 equalityOnly = is64BitUnsignedCompare;
1348 equalityOnly = is32BitUnsignedCompare;
1351 // We need to check the uses of the condition register in order to reject
1352 // non-equality comparisons.
1353 for (MachineRegisterInfo::use_instr_iterator I =MRI->use_instr_begin(CRReg),
1354 IE = MRI->use_instr_end(); I != IE; ++I) {
1355 MachineInstr *UseMI = &*I;
1356 if (UseMI->getOpcode() == PPC::BCC) {
1357 unsigned Pred = UseMI->getOperand(0).getImm();
1358 if (Pred != PPC::PRED_EQ && Pred != PPC::PRED_NE)
1360 } else if (UseMI->getOpcode() == PPC::ISEL ||
1361 UseMI->getOpcode() == PPC::ISEL8) {
1362 unsigned SubIdx = UseMI->getOperand(3).getSubReg();
1363 if (SubIdx != PPC::sub_eq)
1370 MachineBasicBlock::iterator I = CmpInstr;
1372 // Scan forward to find the first use of the compare.
1373 for (MachineBasicBlock::iterator EL = CmpInstr->getParent()->end();
1375 bool FoundUse = false;
1376 for (MachineRegisterInfo::use_instr_iterator J =MRI->use_instr_begin(CRReg),
1377 JE = MRI->use_instr_end(); J != JE; ++J)
1387 // There are two possible candidates which can be changed to set CR[01].
1388 // One is MI, the other is a SUB instruction.
1389 // For CMPrr(r1,r2), we are looking for SUB(r1,r2) or SUB(r2,r1).
1390 MachineInstr *Sub = NULL;
1392 // MI is not a candidate for CMPrr.
1394 // FIXME: Conservatively refuse to convert an instruction which isn't in the
1395 // same BB as the comparison. This is to allow the check below to avoid calls
1396 // (and other explicit clobbers); instead we should really check for these
1397 // more explicitly (in at least a few predecessors).
1398 else if (MI->getParent() != CmpInstr->getParent() || Value != 0) {
1399 // PPC does not have a record-form SUBri.
1404 const TargetRegisterInfo *TRI = &getRegisterInfo();
1407 // Get ready to iterate backward from CmpInstr.
1408 MachineBasicBlock::iterator E = MI,
1409 B = CmpInstr->getParent()->begin();
1411 for (; I != E && !noSub; --I) {
1412 const MachineInstr &Instr = *I;
1413 unsigned IOpC = Instr.getOpcode();
1415 if (&*I != CmpInstr && (
1416 Instr.modifiesRegister(PPC::CR0, TRI) ||
1417 Instr.readsRegister(PPC::CR0, TRI)))
1418 // This instruction modifies or uses the record condition register after
1419 // the one we want to change. While we could do this transformation, it
1420 // would likely not be profitable. This transformation removes one
1421 // instruction, and so even forcing RA to generate one move probably
1422 // makes it unprofitable.
1425 // Check whether CmpInstr can be made redundant by the current instruction.
1426 if ((OpC == PPC::CMPW || OpC == PPC::CMPLW ||
1427 OpC == PPC::CMPD || OpC == PPC::CMPLD) &&
1428 (IOpC == PPC::SUBF || IOpC == PPC::SUBF8) &&
1429 ((Instr.getOperand(1).getReg() == SrcReg &&
1430 Instr.getOperand(2).getReg() == SrcReg2) ||
1431 (Instr.getOperand(1).getReg() == SrcReg2 &&
1432 Instr.getOperand(2).getReg() == SrcReg))) {
1438 // The 'and' is below the comparison instruction.
1442 // Return false if no candidates exist.
1446 // The single candidate is called MI.
1450 MIOpC = MI->getOpcode();
1451 if (MIOpC == PPC::ANDIo || MIOpC == PPC::ANDIo8)
1454 NewOpC = PPC::getRecordFormOpcode(MIOpC);
1455 if (NewOpC == -1 && PPC::getNonRecordFormOpcode(MIOpC) != -1)
1459 // FIXME: On the non-embedded POWER architectures, only some of the record
1460 // forms are fast, and we should use only the fast ones.
1462 // The defining instruction has a record form (or is already a record
1463 // form). It is possible, however, that we'll need to reverse the condition
1464 // code of the users.
1468 SmallVector<std::pair<MachineOperand*, PPC::Predicate>, 4> PredsToUpdate;
1469 SmallVector<std::pair<MachineOperand*, unsigned>, 4> SubRegsToUpdate;
1471 // If we have SUB(r1, r2) and CMP(r2, r1), the condition code based on CMP
1472 // needs to be updated to be based on SUB. Push the condition code
1473 // operands to OperandsToUpdate. If it is safe to remove CmpInstr, the
1474 // condition code of these operands will be modified.
1475 bool ShouldSwap = false;
1477 ShouldSwap = SrcReg2 != 0 && Sub->getOperand(1).getReg() == SrcReg2 &&
1478 Sub->getOperand(2).getReg() == SrcReg;
1480 // The operands to subf are the opposite of sub, so only in the fixed-point
1481 // case, invert the order.
1482 ShouldSwap = !ShouldSwap;
1486 for (MachineRegisterInfo::use_instr_iterator
1487 I = MRI->use_instr_begin(CRReg), IE = MRI->use_instr_end();
1489 MachineInstr *UseMI = &*I;
1490 if (UseMI->getOpcode() == PPC::BCC) {
1491 PPC::Predicate Pred = (PPC::Predicate) UseMI->getOperand(0).getImm();
1492 assert((!equalityOnly ||
1493 Pred == PPC::PRED_EQ || Pred == PPC::PRED_NE) &&
1494 "Invalid predicate for equality-only optimization");
1495 PredsToUpdate.push_back(std::make_pair(&(UseMI->getOperand(0)),
1496 PPC::getSwappedPredicate(Pred)));
1497 } else if (UseMI->getOpcode() == PPC::ISEL ||
1498 UseMI->getOpcode() == PPC::ISEL8) {
1499 unsigned NewSubReg = UseMI->getOperand(3).getSubReg();
1500 assert((!equalityOnly || NewSubReg == PPC::sub_eq) &&
1501 "Invalid CR bit for equality-only optimization");
1503 if (NewSubReg == PPC::sub_lt)
1504 NewSubReg = PPC::sub_gt;
1505 else if (NewSubReg == PPC::sub_gt)
1506 NewSubReg = PPC::sub_lt;
1508 SubRegsToUpdate.push_back(std::make_pair(&(UseMI->getOperand(3)),
1510 } else // We need to abort on a user we don't understand.
1514 // Create a new virtual register to hold the value of the CR set by the
1515 // record-form instruction. If the instruction was not previously in
1516 // record form, then set the kill flag on the CR.
1517 CmpInstr->eraseFromParent();
1519 MachineBasicBlock::iterator MII = MI;
1520 BuildMI(*MI->getParent(), std::next(MII), MI->getDebugLoc(),
1521 get(TargetOpcode::COPY), CRReg)
1522 .addReg(PPC::CR0, MIOpC != NewOpC ? RegState::Kill : 0);
1524 if (MIOpC != NewOpC) {
1525 // We need to be careful here: we're replacing one instruction with
1526 // another, and we need to make sure that we get all of the right
1527 // implicit uses and defs. On the other hand, the caller may be holding
1528 // an iterator to this instruction, and so we can't delete it (this is
1529 // specifically the case if this is the instruction directly after the
1532 const MCInstrDesc &NewDesc = get(NewOpC);
1533 MI->setDesc(NewDesc);
1535 if (NewDesc.ImplicitDefs)
1536 for (const uint16_t *ImpDefs = NewDesc.getImplicitDefs();
1537 *ImpDefs; ++ImpDefs)
1538 if (!MI->definesRegister(*ImpDefs))
1539 MI->addOperand(*MI->getParent()->getParent(),
1540 MachineOperand::CreateReg(*ImpDefs, true, true));
1541 if (NewDesc.ImplicitUses)
1542 for (const uint16_t *ImpUses = NewDesc.getImplicitUses();
1543 *ImpUses; ++ImpUses)
1544 if (!MI->readsRegister(*ImpUses))
1545 MI->addOperand(*MI->getParent()->getParent(),
1546 MachineOperand::CreateReg(*ImpUses, false, true));
1549 // Modify the condition code of operands in OperandsToUpdate.
1550 // Since we have SUB(r1, r2) and CMP(r2, r1), the condition code needs to
1551 // be changed from r2 > r1 to r1 < r2, from r2 < r1 to r1 > r2, etc.
1552 for (unsigned i = 0, e = PredsToUpdate.size(); i < e; i++)
1553 PredsToUpdate[i].first->setImm(PredsToUpdate[i].second);
1555 for (unsigned i = 0, e = SubRegsToUpdate.size(); i < e; i++)
1556 SubRegsToUpdate[i].first->setSubReg(SubRegsToUpdate[i].second);
1561 /// GetInstSize - Return the number of bytes of code the specified
1562 /// instruction may be. This returns the maximum number of bytes.
1564 unsigned PPCInstrInfo::GetInstSizeInBytes(const MachineInstr *MI) const {
1565 unsigned Opcode = MI->getOpcode();
1567 if (Opcode == PPC::INLINEASM) {
1568 const MachineFunction *MF = MI->getParent()->getParent();
1569 const char *AsmStr = MI->getOperand(0).getSymbolName();
1570 return getInlineAsmLength(AsmStr, *MF->getTarget().getMCAsmInfo());
1572 const MCInstrDesc &Desc = get(Opcode);
1573 return Desc.getSize();
1578 #define DEBUG_TYPE "ppc-vsx-fma-mutate"
1581 // PPCVSXFMAMutate pass - For copies between VSX registers and non-VSX registers
1582 // (Altivec and scalar floating-point registers), we need to transform the
1583 // copies into subregister copies with other restrictions.
1584 struct PPCVSXFMAMutate : public MachineFunctionPass {
1586 PPCVSXFMAMutate() : MachineFunctionPass(ID) {
1587 initializePPCVSXFMAMutatePass(*PassRegistry::getPassRegistry());
1592 const PPCTargetMachine *TM;
1593 const PPCInstrInfo *TII;
1596 bool processBlock(MachineBasicBlock &MBB) {
1597 bool Changed = false;
1599 MachineRegisterInfo &MRI = MBB.getParent()->getRegInfo();
1600 for (MachineBasicBlock::iterator I = MBB.begin(), IE = MBB.end();
1602 MachineInstr *MI = I;
1604 // The default (A-type) VSX FMA form kills the addend (it is taken from
1605 // the target register, which is then updated to reflect the result of
1606 // the FMA). If the instruction, however, kills one of the registers
1607 // used for the product, then we can use the M-form instruction (which
1608 // will take that value from the to-be-defined register).
1610 int AltOpc = PPC::getAltVSXFMAOpcode(MI->getOpcode());
1614 // This pass is run after register coalescing, and so we're looking for
1615 // a situation like this:
1617 // %vreg5<def> = COPY %vreg9; VSLRC:%vreg5,%vreg9
1618 // %vreg5<def,tied1> = XSMADDADP %vreg5<tied0>, %vreg17, %vreg16,
1619 // %RM<imp-use>; VSLRC:%vreg5,%vreg17,%vreg16
1621 // %vreg9<def,tied1> = XSMADDADP %vreg9<tied0>, %vreg17, %vreg19,
1622 // %RM<imp-use>; VSLRC:%vreg9,%vreg17,%vreg19
1624 // Where we can eliminate the copy by changing from the A-type to the
1625 // M-type instruction. Specifically, for this example, this means:
1626 // %vreg5<def,tied1> = XSMADDADP %vreg5<tied0>, %vreg17, %vreg16,
1627 // %RM<imp-use>; VSLRC:%vreg5,%vreg17,%vreg16
1629 // %vreg16<def,tied1> = XSMADDMDP %vreg16<tied0>, %vreg18, %vreg9,
1630 // %RM<imp-use>; VSLRC:%vreg16,%vreg18,%vreg9
1631 // and we remove: %vreg5<def> = COPY %vreg9; VSLRC:%vreg5,%vreg9
1633 SlotIndex FMAIdx = LIS->getInstructionIndex(MI);
1635 VNInfo *AddendValNo =
1636 LIS->getInterval(MI->getOperand(1).getReg()).Query(FMAIdx).valueIn();
1637 MachineInstr *AddendMI = LIS->getInstructionFromIndex(AddendValNo->def);
1639 // The addend and this instruction must be in the same block.
1641 if (AddendMI->getParent() != MI->getParent())
1644 // The addend must be a full copy within the same register class.
1646 if (!AddendMI->isFullCopy())
1649 if (MRI.getRegClass(AddendMI->getOperand(0).getReg()) !=
1650 MRI.getRegClass(AddendMI->getOperand(1).getReg()))
1653 // In theory, there could be other uses of the addend copy before this
1654 // fma. We could deal with this, but that would require additional
1655 // logic below and I suspect it will not occur in any relevant
1657 bool OtherUsers = false;
1658 for (auto J = std::prev(I), JE = MachineBasicBlock::iterator(AddendMI);
1660 if (J->readsVirtualRegister(AddendMI->getOperand(0).getReg())) {
1668 // Find one of the product operands that is killed by this instruction.
1670 unsigned KilledProdOp = 0, OtherProdOp = 0;
1671 if (LIS->getInterval(MI->getOperand(2).getReg())
1672 .Query(FMAIdx).isKill()) {
1675 } else if (LIS->getInterval(MI->getOperand(3).getReg())
1676 .Query(FMAIdx).isKill()) {
1681 // If there are no killed product operands, then this transformation is
1682 // likely not profitable.
1686 // In order to replace the addend here with the source of the copy,
1687 // it must still be live here.
1688 if (!LIS->getInterval(AddendMI->getOperand(1).getReg()).liveAt(FMAIdx))
1691 // Transform: (O2 * O3) + O1 -> (O2 * O1) + O3.
1693 unsigned AddReg = AddendMI->getOperand(1).getReg();
1694 unsigned KilledProdReg = MI->getOperand(KilledProdOp).getReg();
1695 unsigned OtherProdReg = MI->getOperand(OtherProdOp).getReg();
1697 unsigned AddSubReg = AddendMI->getOperand(1).getSubReg();
1698 unsigned KilledProdSubReg = MI->getOperand(KilledProdOp).getSubReg();
1699 unsigned OtherProdSubReg = MI->getOperand(OtherProdOp).getSubReg();
1701 bool AddRegKill = AddendMI->getOperand(1).isKill();
1702 bool KilledProdRegKill = MI->getOperand(KilledProdOp).isKill();
1703 bool OtherProdRegKill = MI->getOperand(OtherProdOp).isKill();
1705 bool AddRegUndef = AddendMI->getOperand(1).isUndef();
1706 bool KilledProdRegUndef = MI->getOperand(KilledProdOp).isUndef();
1707 bool OtherProdRegUndef = MI->getOperand(OtherProdOp).isUndef();
1709 unsigned OldFMAReg = MI->getOperand(0).getReg();
1711 assert(OldFMAReg == AddendMI->getOperand(0).getReg() &&
1712 "Addend copy not tied to old FMA output!");
1714 DEBUG(dbgs() << "VSX FMA Mutation:\n " << *MI;);
1716 MI->getOperand(0).setReg(KilledProdReg);
1717 MI->getOperand(1).setReg(KilledProdReg);
1718 MI->getOperand(3).setReg(AddReg);
1719 MI->getOperand(2).setReg(OtherProdReg);
1721 MI->getOperand(0).setSubReg(KilledProdSubReg);
1722 MI->getOperand(1).setSubReg(KilledProdSubReg);
1723 MI->getOperand(3).setSubReg(AddSubReg);
1724 MI->getOperand(2).setSubReg(OtherProdSubReg);
1726 MI->getOperand(1).setIsKill(KilledProdRegKill);
1727 MI->getOperand(3).setIsKill(AddRegKill);
1728 MI->getOperand(2).setIsKill(OtherProdRegKill);
1730 MI->getOperand(1).setIsUndef(KilledProdRegUndef);
1731 MI->getOperand(3).setIsUndef(AddRegUndef);
1732 MI->getOperand(2).setIsUndef(OtherProdRegUndef);
1734 MI->setDesc(TII->get(AltOpc));
1736 DEBUG(dbgs() << " -> " << *MI);
1738 // The killed product operand was killed here, so we can reuse it now
1739 // for the result of the fma.
1741 LiveInterval &FMAInt = LIS->getInterval(OldFMAReg);
1742 VNInfo *FMAValNo = FMAInt.getVNInfoAt(FMAIdx.getRegSlot());
1743 for (auto UI = MRI.reg_nodbg_begin(OldFMAReg), UE = MRI.reg_nodbg_end();
1745 MachineOperand &UseMO = *UI;
1746 MachineInstr *UseMI = UseMO.getParent();
1749 // Don't replace the result register of the copy we're about to erase.
1750 if (UseMI == AddendMI)
1753 UseMO.setReg(KilledProdReg);
1754 UseMO.setSubReg(KilledProdSubReg);
1757 // Extend the live intervals of the killed product operand to hold the
1760 LiveInterval &NewFMAInt = LIS->getInterval(KilledProdReg);
1761 for (LiveInterval::iterator AI = FMAInt.begin(), AE = FMAInt.end();
1763 // Don't add the segment that corresponds to the original copy.
1764 if (AI->valno == AddendValNo)
1767 VNInfo *NewFMAValNo =
1768 NewFMAInt.getNextValue(AI->start,
1769 LIS->getVNInfoAllocator());
1771 NewFMAInt.addSegment(LiveInterval::Segment(AI->start, AI->end,
1774 DEBUG(dbgs() << " extended: " << NewFMAInt << '\n');
1776 FMAInt.removeValNo(FMAValNo);
1777 DEBUG(dbgs() << " trimmed: " << FMAInt << '\n');
1779 // Remove the (now unused) copy.
1781 DEBUG(dbgs() << " removing: " << *AddendMI << '\n');
1782 LIS->RemoveMachineInstrFromMaps(AddendMI);
1783 AddendMI->eraseFromParent();
1792 virtual bool runOnMachineFunction(MachineFunction &MF) {
1793 LIS = &getAnalysis<LiveIntervals>();
1795 TM = static_cast<const PPCTargetMachine *>(&MF.getTarget());
1796 TII = TM->getInstrInfo();
1798 bool Changed = false;
1800 if (DisableVSXFMAMutate)
1803 for (MachineFunction::iterator I = MF.begin(); I != MF.end();) {
1804 MachineBasicBlock &B = *I++;
1805 if (processBlock(B))
1812 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
1813 AU.addRequired<LiveIntervals>();
1814 AU.addPreserved<LiveIntervals>();
1815 AU.addRequired<SlotIndexes>();
1816 AU.addPreserved<SlotIndexes>();
1817 MachineFunctionPass::getAnalysisUsage(AU);
1822 INITIALIZE_PASS_BEGIN(PPCVSXFMAMutate, DEBUG_TYPE,
1823 "PowerPC VSX FMA Mutation", false, false)
1824 INITIALIZE_PASS_DEPENDENCY(LiveIntervals)
1825 INITIALIZE_PASS_DEPENDENCY(SlotIndexes)
1826 INITIALIZE_PASS_END(PPCVSXFMAMutate, DEBUG_TYPE,
1827 "PowerPC VSX FMA Mutation", false, false)
1829 char &llvm::PPCVSXFMAMutateID = PPCVSXFMAMutate::ID;
1831 char PPCVSXFMAMutate::ID = 0;
1833 llvm::createPPCVSXFMAMutatePass() { return new PPCVSXFMAMutate(); }
1836 #define DEBUG_TYPE "ppc-vsx-copy"
1839 void initializePPCVSXCopyPass(PassRegistry&);
1843 // PPCVSXCopy pass - For copies between VSX registers and non-VSX registers
1844 // (Altivec and scalar floating-point registers), we need to transform the
1845 // copies into subregister copies with other restrictions.
1846 struct PPCVSXCopy : public MachineFunctionPass {
1848 PPCVSXCopy() : MachineFunctionPass(ID) {
1849 initializePPCVSXCopyPass(*PassRegistry::getPassRegistry());
1852 const PPCTargetMachine *TM;
1853 const PPCInstrInfo *TII;
1855 bool IsRegInClass(unsigned Reg, const TargetRegisterClass *RC,
1856 MachineRegisterInfo &MRI) {
1857 if (TargetRegisterInfo::isVirtualRegister(Reg)) {
1858 return RC->hasSubClassEq(MRI.getRegClass(Reg));
1859 } else if (RC->contains(Reg)) {
1866 bool IsVSReg(unsigned Reg, MachineRegisterInfo &MRI) {
1867 return IsRegInClass(Reg, &PPC::VSRCRegClass, MRI);
1870 bool IsVRReg(unsigned Reg, MachineRegisterInfo &MRI) {
1871 return IsRegInClass(Reg, &PPC::VRRCRegClass, MRI);
1874 bool IsF8Reg(unsigned Reg, MachineRegisterInfo &MRI) {
1875 return IsRegInClass(Reg, &PPC::F8RCRegClass, MRI);
1879 bool processBlock(MachineBasicBlock &MBB) {
1880 bool Changed = false;
1882 MachineRegisterInfo &MRI = MBB.getParent()->getRegInfo();
1883 for (MachineBasicBlock::iterator I = MBB.begin(), IE = MBB.end();
1885 MachineInstr *MI = I;
1886 if (!MI->isFullCopy())
1889 MachineOperand &DstMO = MI->getOperand(0);
1890 MachineOperand &SrcMO = MI->getOperand(1);
1892 if ( IsVSReg(DstMO.getReg(), MRI) &&
1893 !IsVSReg(SrcMO.getReg(), MRI)) {
1894 // This is a copy *to* a VSX register from a non-VSX register.
1897 const TargetRegisterClass *SrcRC =
1898 IsVRReg(SrcMO.getReg(), MRI) ? &PPC::VSHRCRegClass :
1899 &PPC::VSLRCRegClass;
1900 assert((IsF8Reg(SrcMO.getReg(), MRI) ||
1901 IsVRReg(SrcMO.getReg(), MRI)) &&
1902 "Unknown source for a VSX copy");
1904 unsigned NewVReg = MRI.createVirtualRegister(SrcRC);
1905 BuildMI(MBB, MI, MI->getDebugLoc(),
1906 TII->get(TargetOpcode::SUBREG_TO_REG), NewVReg)
1907 .addImm(1) // add 1, not 0, because there is no implicit clearing
1908 // of the high bits.
1910 .addImm(IsVRReg(SrcMO.getReg(), MRI) ? PPC::sub_128 :
1913 // The source of the original copy is now the new virtual register.
1914 SrcMO.setReg(NewVReg);
1915 } else if (!IsVSReg(DstMO.getReg(), MRI) &&
1916 IsVSReg(SrcMO.getReg(), MRI)) {
1917 // This is a copy *from* a VSX register to a non-VSX register.
1920 const TargetRegisterClass *DstRC =
1921 IsVRReg(DstMO.getReg(), MRI) ? &PPC::VSHRCRegClass :
1922 &PPC::VSLRCRegClass;
1923 assert((IsF8Reg(DstMO.getReg(), MRI) ||
1924 IsVRReg(DstMO.getReg(), MRI)) &&
1925 "Unknown destination for a VSX copy");
1927 // Copy the VSX value into a new VSX register of the correct subclass.
1928 unsigned NewVReg = MRI.createVirtualRegister(DstRC);
1929 BuildMI(MBB, MI, MI->getDebugLoc(),
1930 TII->get(TargetOpcode::COPY), NewVReg)
1933 // Transform the original copy into a subregister extraction copy.
1934 SrcMO.setReg(NewVReg);
1935 SrcMO.setSubReg(IsVRReg(DstMO.getReg(), MRI) ? PPC::sub_128 :
1944 virtual bool runOnMachineFunction(MachineFunction &MF) {
1945 TM = static_cast<const PPCTargetMachine *>(&MF.getTarget());
1946 TII = TM->getInstrInfo();
1948 bool Changed = false;
1950 for (MachineFunction::iterator I = MF.begin(); I != MF.end();) {
1951 MachineBasicBlock &B = *I++;
1952 if (processBlock(B))
1959 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
1960 MachineFunctionPass::getAnalysisUsage(AU);
1965 INITIALIZE_PASS(PPCVSXCopy, DEBUG_TYPE,
1966 "PowerPC VSX Copy Legalization", false, false)
1968 char PPCVSXCopy::ID = 0;
1970 llvm::createPPCVSXCopyPass() { return new PPCVSXCopy(); }
1973 #define DEBUG_TYPE "ppc-early-ret"
1974 STATISTIC(NumBCLR, "Number of early conditional returns");
1975 STATISTIC(NumBLR, "Number of early returns");
1978 void initializePPCEarlyReturnPass(PassRegistry&);
1982 // PPCEarlyReturn pass - For simple functions without epilogue code, move
1983 // returns up, and create conditional returns, to avoid unnecessary
1984 // branch-to-blr sequences.
1985 struct PPCEarlyReturn : public MachineFunctionPass {
1987 PPCEarlyReturn() : MachineFunctionPass(ID) {
1988 initializePPCEarlyReturnPass(*PassRegistry::getPassRegistry());
1991 const PPCTargetMachine *TM;
1992 const PPCInstrInfo *TII;
1995 bool processBlock(MachineBasicBlock &ReturnMBB) {
1996 bool Changed = false;
1998 MachineBasicBlock::iterator I = ReturnMBB.begin();
1999 I = ReturnMBB.SkipPHIsAndLabels(I);
2001 // The block must be essentially empty except for the blr.
2002 if (I == ReturnMBB.end() || I->getOpcode() != PPC::BLR ||
2003 I != ReturnMBB.getLastNonDebugInstr())
2006 SmallVector<MachineBasicBlock*, 8> PredToRemove;
2007 for (MachineBasicBlock::pred_iterator PI = ReturnMBB.pred_begin(),
2008 PIE = ReturnMBB.pred_end(); PI != PIE; ++PI) {
2009 bool OtherReference = false, BlockChanged = false;
2010 for (MachineBasicBlock::iterator J = (*PI)->getLastNonDebugInstr();;) {
2011 if (J->getOpcode() == PPC::B) {
2012 if (J->getOperand(0).getMBB() == &ReturnMBB) {
2013 // This is an unconditional branch to the return. Replace the
2014 // branch with a blr.
2015 BuildMI(**PI, J, J->getDebugLoc(), TII->get(PPC::BLR));
2016 MachineBasicBlock::iterator K = J--;
2017 K->eraseFromParent();
2018 BlockChanged = true;
2022 } else if (J->getOpcode() == PPC::BCC) {
2023 if (J->getOperand(2).getMBB() == &ReturnMBB) {
2024 // This is a conditional branch to the return. Replace the branch
2026 BuildMI(**PI, J, J->getDebugLoc(), TII->get(PPC::BCCLR))
2027 .addImm(J->getOperand(0).getImm())
2028 .addReg(J->getOperand(1).getReg());
2029 MachineBasicBlock::iterator K = J--;
2030 K->eraseFromParent();
2031 BlockChanged = true;
2035 } else if (J->getOpcode() == PPC::BC || J->getOpcode() == PPC::BCn) {
2036 if (J->getOperand(1).getMBB() == &ReturnMBB) {
2037 // This is a conditional branch to the return. Replace the branch
2039 BuildMI(**PI, J, J->getDebugLoc(),
2040 TII->get(J->getOpcode() == PPC::BC ?
2041 PPC::BCLR : PPC::BCLRn))
2042 .addReg(J->getOperand(0).getReg());
2043 MachineBasicBlock::iterator K = J--;
2044 K->eraseFromParent();
2045 BlockChanged = true;
2049 } else if (J->isBranch()) {
2050 if (J->isIndirectBranch()) {
2051 if (ReturnMBB.hasAddressTaken())
2052 OtherReference = true;
2054 for (unsigned i = 0; i < J->getNumOperands(); ++i)
2055 if (J->getOperand(i).isMBB() &&
2056 J->getOperand(i).getMBB() == &ReturnMBB)
2057 OtherReference = true;
2058 } else if (!J->isTerminator() && !J->isDebugValue())
2061 if (J == (*PI)->begin())
2067 if ((*PI)->canFallThrough() && (*PI)->isLayoutSuccessor(&ReturnMBB))
2068 OtherReference = true;
2070 // Predecessors are stored in a vector and can't be removed here.
2071 if (!OtherReference && BlockChanged) {
2072 PredToRemove.push_back(*PI);
2079 for (unsigned i = 0, ie = PredToRemove.size(); i != ie; ++i)
2080 PredToRemove[i]->removeSuccessor(&ReturnMBB);
2082 if (Changed && !ReturnMBB.hasAddressTaken()) {
2083 // We now might be able to merge this blr-only block into its
2084 // by-layout predecessor.
2085 if (ReturnMBB.pred_size() == 1 &&
2086 (*ReturnMBB.pred_begin())->isLayoutSuccessor(&ReturnMBB)) {
2087 // Move the blr into the preceding block.
2088 MachineBasicBlock &PrevMBB = **ReturnMBB.pred_begin();
2089 PrevMBB.splice(PrevMBB.end(), &ReturnMBB, I);
2090 PrevMBB.removeSuccessor(&ReturnMBB);
2093 if (ReturnMBB.pred_empty())
2094 ReturnMBB.eraseFromParent();
2101 virtual bool runOnMachineFunction(MachineFunction &MF) {
2102 TM = static_cast<const PPCTargetMachine *>(&MF.getTarget());
2103 TII = TM->getInstrInfo();
2105 bool Changed = false;
2107 // If the function does not have at least two blocks, then there is
2112 for (MachineFunction::iterator I = MF.begin(); I != MF.end();) {
2113 MachineBasicBlock &B = *I++;
2114 if (processBlock(B))
2121 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
2122 MachineFunctionPass::getAnalysisUsage(AU);
2127 INITIALIZE_PASS(PPCEarlyReturn, DEBUG_TYPE,
2128 "PowerPC Early-Return Creation", false, false)
2130 char PPCEarlyReturn::ID = 0;
2132 llvm::createPPCEarlyReturnPass() { return new PPCEarlyReturn(); }