1 //===- X86ISelDAGToDAG.cpp - A DAG pattern matching inst selector for X86 -===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the Evan Cheng and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines a DAG pattern matching instruction selector for X86,
11 // converting from a legalized dag to a X86 dag.
13 //===----------------------------------------------------------------------===//
15 #define DEBUG_TYPE "x86-isel"
17 #include "X86InstrBuilder.h"
18 #include "X86ISelLowering.h"
19 #include "X86RegisterInfo.h"
20 #include "X86Subtarget.h"
21 #include "X86TargetMachine.h"
22 #include "llvm/GlobalValue.h"
23 #include "llvm/Instructions.h"
24 #include "llvm/Intrinsics.h"
25 #include "llvm/Support/CFG.h"
26 #include "llvm/CodeGen/MachineConstantPool.h"
27 #include "llvm/CodeGen/MachineFunction.h"
28 #include "llvm/CodeGen/MachineFrameInfo.h"
29 #include "llvm/CodeGen/MachineInstrBuilder.h"
30 #include "llvm/CodeGen/SSARegMap.h"
31 #include "llvm/CodeGen/SelectionDAGISel.h"
32 #include "llvm/Target/TargetMachine.h"
33 #include "llvm/Support/Compiler.h"
34 #include "llvm/Support/Debug.h"
35 #include "llvm/Support/MathExtras.h"
36 #include "llvm/ADT/Statistic.h"
42 //===----------------------------------------------------------------------===//
43 // Pattern Matcher Implementation
44 //===----------------------------------------------------------------------===//
47 /// X86ISelAddressMode - This corresponds to X86AddressMode, but uses
48 /// SDOperand's instead of register numbers for the leaves of the matched
50 struct X86ISelAddressMode {
56 struct { // This is really a union, discriminated by BaseType!
61 bool isRIPRel; // RIP relative?
69 unsigned Align; // CP alignment.
72 : BaseType(RegBase), isRIPRel(false), Scale(1), IndexReg(), Disp(0),
73 GV(0), CP(0), ES(0), JT(-1), Align(0) {
80 NumFPKill("x86-codegen", "Number of FP_REG_KILL instructions added");
83 NumLoadMoved("x86-codegen", "Number of loads moved below TokenFactor");
85 //===--------------------------------------------------------------------===//
86 /// ISel - X86 specific code to select X86 machine instructions for
87 /// SelectionDAG operations.
89 class VISIBILITY_HIDDEN X86DAGToDAGISel : public SelectionDAGISel {
90 /// ContainsFPCode - Every instruction we select that uses or defines a FP
91 /// register should set this to true.
94 /// FastISel - Enable fast(er) instruction selection.
98 /// TM - Keep a reference to X86TargetMachine.
100 X86TargetMachine &TM;
102 /// X86Lowering - This object fully describes how to lower LLVM code to an
103 /// X86-specific SelectionDAG.
104 X86TargetLowering X86Lowering;
106 /// Subtarget - Keep a pointer to the X86Subtarget around so that we can
107 /// make the right decision when generating code for different targets.
108 const X86Subtarget *Subtarget;
110 /// GlobalBaseReg - keeps track of the virtual register mapped onto global
112 unsigned GlobalBaseReg;
115 X86DAGToDAGISel(X86TargetMachine &tm, bool fast)
116 : SelectionDAGISel(X86Lowering),
117 ContainsFPCode(false), FastISel(fast), TM(tm),
118 X86Lowering(*TM.getTargetLowering()),
119 Subtarget(&TM.getSubtarget<X86Subtarget>()) {}
121 virtual bool runOnFunction(Function &Fn) {
122 // Make sure we re-emit a set of the global base reg if necessary
124 return SelectionDAGISel::runOnFunction(Fn);
127 virtual const char *getPassName() const {
128 return "X86 DAG->DAG Instruction Selection";
131 /// InstructionSelectBasicBlock - This callback is invoked by
132 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
133 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG);
135 virtual void EmitFunctionEntryCode(Function &Fn, MachineFunction &MF);
137 virtual bool CanBeFoldedBy(SDNode *N, SDNode *U, SDNode *Root);
139 // Include the pieces autogenerated from the target description.
140 #include "X86GenDAGISel.inc"
143 SDNode *Select(SDOperand N);
145 bool MatchAddress(SDOperand N, X86ISelAddressMode &AM, bool isRoot = true);
146 bool SelectAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
147 SDOperand &Index, SDOperand &Disp);
148 bool SelectLEAAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
149 SDOperand &Index, SDOperand &Disp);
150 bool SelectScalarSSELoad(SDOperand Root, SDOperand Pred,
151 SDOperand N, SDOperand &Base, SDOperand &Scale,
152 SDOperand &Index, SDOperand &Disp,
153 SDOperand &InChain, SDOperand &OutChain);
154 bool TryFoldLoad(SDOperand P, SDOperand N,
155 SDOperand &Base, SDOperand &Scale,
156 SDOperand &Index, SDOperand &Disp);
157 void InstructionSelectPreprocess(SelectionDAG &DAG);
159 /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for
160 /// inline asm expressions.
161 virtual bool SelectInlineAsmMemoryOperand(const SDOperand &Op,
163 std::vector<SDOperand> &OutOps,
166 void EmitSpecialCodeForMain(MachineBasicBlock *BB, MachineFrameInfo *MFI);
168 inline void getAddressOperands(X86ISelAddressMode &AM, SDOperand &Base,
169 SDOperand &Scale, SDOperand &Index,
171 Base = (AM.BaseType == X86ISelAddressMode::FrameIndexBase) ?
172 CurDAG->getTargetFrameIndex(AM.Base.FrameIndex, TLI.getPointerTy()) :
174 Scale = getI8Imm(AM.Scale);
176 // These are 32-bit even in 64-bit mode since RIP relative offset
179 Disp = CurDAG->getTargetGlobalAddress(AM.GV, MVT::i32, AM.Disp);
181 Disp = CurDAG->getTargetConstantPool(AM.CP, MVT::i32, AM.Align, AM.Disp);
183 Disp = CurDAG->getTargetExternalSymbol(AM.ES, MVT::i32);
184 else if (AM.JT != -1)
185 Disp = CurDAG->getTargetJumpTable(AM.JT, MVT::i32);
187 Disp = getI32Imm(AM.Disp);
190 /// getI8Imm - Return a target constant with the specified value, of type
192 inline SDOperand getI8Imm(unsigned Imm) {
193 return CurDAG->getTargetConstant(Imm, MVT::i8);
196 /// getI16Imm - Return a target constant with the specified value, of type
198 inline SDOperand getI16Imm(unsigned Imm) {
199 return CurDAG->getTargetConstant(Imm, MVT::i16);
202 /// getI32Imm - Return a target constant with the specified value, of type
204 inline SDOperand getI32Imm(unsigned Imm) {
205 return CurDAG->getTargetConstant(Imm, MVT::i32);
208 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
209 /// base register. Return the virtual register that holds this value.
210 SDNode *getGlobalBaseReg();
218 static SDNode *findFlagUse(SDNode *N) {
219 unsigned FlagResNo = N->getNumValues()-1;
220 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
222 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) {
223 SDOperand Op = User->getOperand(i);
224 if (Op.Val == N && Op.ResNo == FlagResNo)
231 static void findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
232 SDNode *Root, SDNode *Skip, bool &found,
233 std::set<SDNode *> &Visited) {
235 Use->getNodeId() > Def->getNodeId() ||
236 !Visited.insert(Use).second)
239 for (unsigned i = 0, e = Use->getNumOperands(); !found && i != e; ++i) {
240 SDNode *N = Use->getOperand(i).Val;
245 continue; // Immediate use is ok.
247 assert(Use->getOpcode() == ISD::STORE ||
248 Use->getOpcode() == X86ISD::CMP);
254 findNonImmUse(N, Def, ImmedUse, Root, Skip, found, Visited);
258 /// isNonImmUse - Start searching from Root up the DAG to check is Def can
259 /// be reached. Return true if that's the case. However, ignore direct uses
260 /// by ImmedUse (which would be U in the example illustrated in
261 /// CanBeFoldedBy) and by Root (which can happen in the store case).
262 /// FIXME: to be really generic, we should allow direct use by any node
263 /// that is being folded. But realisticly since we only fold loads which
264 /// have one non-chain use, we only need to watch out for load/op/store
265 /// and load/op/cmp case where the root (store / cmp) may reach the load via
266 /// its chain operand.
267 static inline bool isNonImmUse(SDNode *Root, SDNode *Def, SDNode *ImmedUse,
268 SDNode *Skip = NULL) {
269 std::set<SDNode *> Visited;
271 findNonImmUse(Root, Def, ImmedUse, Root, Skip, found, Visited);
276 bool X86DAGToDAGISel::CanBeFoldedBy(SDNode *N, SDNode *U, SDNode *Root) {
277 if (FastISel) return false;
279 // If U use can somehow reach N through another path then U can't fold N or
280 // it will create a cycle. e.g. In the following diagram, U can reach N
281 // through X. If N is folded into into U, then X is both a predecessor and
292 if (isNonImmUse(Root, N, U))
295 // If U produces a flag, then it gets (even more) interesting. Since it
296 // would have been "glued" together with its flag use, we need to check if
309 // If FU (flag use) indirectly reach N (the load), and U fold N (call it
310 // NU), then TF is a predecessor of FU and a successor of NU. But since
311 // NU and FU are flagged together, this effectively creates a cycle.
312 bool HasFlagUse = false;
313 MVT::ValueType VT = Root->getValueType(Root->getNumValues()-1);
314 while ((VT == MVT::Flag && !Root->use_empty())) {
315 SDNode *FU = findFlagUse(Root);
322 VT = Root->getValueType(Root->getNumValues()-1);
326 return !isNonImmUse(Root, N, Root, U);
330 /// MoveBelowTokenFactor - Replace TokenFactor operand with load's chain operand
331 /// and move load below the TokenFactor. Replace store's chain operand with
332 /// load's chain result.
333 static void MoveBelowTokenFactor(SelectionDAG &DAG, SDOperand Load,
334 SDOperand Store, SDOperand TF) {
335 std::vector<SDOperand> Ops;
336 for (unsigned i = 0, e = TF.Val->getNumOperands(); i != e; ++i)
337 if (Load.Val == TF.Val->getOperand(i).Val)
338 Ops.push_back(Load.Val->getOperand(0));
340 Ops.push_back(TF.Val->getOperand(i));
341 DAG.UpdateNodeOperands(TF, &Ops[0], Ops.size());
342 DAG.UpdateNodeOperands(Load, TF, Load.getOperand(1), Load.getOperand(2));
343 DAG.UpdateNodeOperands(Store, Load.getValue(1), Store.getOperand(1),
344 Store.getOperand(2), Store.getOperand(3));
347 /// InstructionSelectPreprocess - Preprocess the DAG to allow the instruction
348 /// selector to pick more load-modify-store instructions. This is a common
359 /// [TokenFactor] [Op]
366 /// The fact the store's chain operand != load's chain will prevent the
367 /// (store (op (load))) instruction from being selected. We can transform it to:
386 void X86DAGToDAGISel::InstructionSelectPreprocess(SelectionDAG &DAG) {
387 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
388 E = DAG.allnodes_end(); I != E; ++I) {
389 if (!ISD::isNON_TRUNCStore(I))
391 SDOperand Chain = I->getOperand(0);
392 if (Chain.Val->getOpcode() != ISD::TokenFactor)
395 SDOperand N1 = I->getOperand(1);
396 SDOperand N2 = I->getOperand(2);
397 if (MVT::isFloatingPoint(N1.getValueType()) ||
398 MVT::isVector(N1.getValueType()) ||
404 unsigned Opcode = N1.Val->getOpcode();
413 SDOperand N10 = N1.getOperand(0);
414 SDOperand N11 = N1.getOperand(1);
415 if (ISD::isNON_EXTLoad(N10.Val))
417 else if (ISD::isNON_EXTLoad(N11.Val)) {
421 RModW = RModW && N10.Val->isOperand(Chain.Val) && N10.hasOneUse() &&
422 (N10.getOperand(1) == N2) &&
423 (N10.Val->getValueType(0) == N1.getValueType());
438 SDOperand N10 = N1.getOperand(0);
439 if (ISD::isNON_EXTLoad(N10.Val))
440 RModW = N10.Val->isOperand(Chain.Val) && N10.hasOneUse() &&
441 (N10.getOperand(1) == N2) &&
442 (N10.Val->getValueType(0) == N1.getValueType());
450 MoveBelowTokenFactor(DAG, Load, SDOperand(I, 0), Chain);
456 /// InstructionSelectBasicBlock - This callback is invoked by SelectionDAGISel
457 /// when it has created a SelectionDAG for us to codegen.
458 void X86DAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) {
460 MachineFunction::iterator FirstMBB = BB;
463 InstructionSelectPreprocess(DAG);
465 // Codegen the basic block.
467 DEBUG(std::cerr << "===== Instruction selection begins:\n");
470 DAG.setRoot(SelectRoot(DAG.getRoot()));
472 DEBUG(std::cerr << "===== Instruction selection ends:\n");
475 DAG.RemoveDeadNodes();
477 // Emit machine code to BB.
478 ScheduleAndEmitDAG(DAG);
480 // If we are emitting FP stack code, scan the basic block to determine if this
481 // block defines any FP values. If so, put an FP_REG_KILL instruction before
482 // the terminator of the block.
483 if (!Subtarget->hasSSE2()) {
484 // Note that FP stack instructions *are* used in SSE code when returning
485 // values, but these are not live out of the basic block, so we don't need
486 // an FP_REG_KILL in this case either.
487 bool ContainsFPCode = false;
489 // Scan all of the machine instructions in these MBBs, checking for FP
491 MachineFunction::iterator MBBI = FirstMBB;
493 for (MachineBasicBlock::iterator I = MBBI->begin(), E = MBBI->end();
494 !ContainsFPCode && I != E; ++I) {
495 for (unsigned op = 0, e = I->getNumOperands(); op != e; ++op) {
496 if (I->getOperand(op).isRegister() && I->getOperand(op).isDef() &&
497 MRegisterInfo::isVirtualRegister(I->getOperand(op).getReg()) &&
498 RegMap->getRegClass(I->getOperand(0).getReg()) ==
499 X86::RFPRegisterClass) {
500 ContainsFPCode = true;
505 } while (!ContainsFPCode && &*(MBBI++) != BB);
507 // Check PHI nodes in successor blocks. These PHI's will be lowered to have
508 // a copy of the input value in this block.
509 if (!ContainsFPCode) {
510 // Final check, check LLVM BB's that are successors to the LLVM BB
511 // corresponding to BB for FP PHI nodes.
512 const BasicBlock *LLVMBB = BB->getBasicBlock();
514 for (succ_const_iterator SI = succ_begin(LLVMBB), E = succ_end(LLVMBB);
515 !ContainsFPCode && SI != E; ++SI) {
516 for (BasicBlock::const_iterator II = SI->begin();
517 (PN = dyn_cast<PHINode>(II)); ++II) {
518 if (PN->getType()->isFloatingPoint()) {
519 ContainsFPCode = true;
526 // Finally, if we found any FP code, emit the FP_REG_KILL instruction.
527 if (ContainsFPCode) {
528 BuildMI(*BB, BB->getFirstTerminator(), X86::FP_REG_KILL, 0);
534 /// EmitSpecialCodeForMain - Emit any code that needs to be executed only in
535 /// the main function.
536 void X86DAGToDAGISel::EmitSpecialCodeForMain(MachineBasicBlock *BB,
537 MachineFrameInfo *MFI) {
538 if (Subtarget->isTargetCygwin())
539 BuildMI(BB, X86::CALLpcrel32, 1).addExternalSymbol("__main");
541 // Switch the FPU to 64-bit precision mode for better compatibility and speed.
542 int CWFrameIdx = MFI->CreateStackObject(2, 2);
543 addFrameReference(BuildMI(BB, X86::FNSTCW16m, 4), CWFrameIdx);
545 // Set the high part to be 64-bit precision.
546 addFrameReference(BuildMI(BB, X86::MOV8mi, 5),
547 CWFrameIdx, 1).addImm(2);
549 // Reload the modified control word now.
550 addFrameReference(BuildMI(BB, X86::FLDCW16m, 4), CWFrameIdx);
553 void X86DAGToDAGISel::EmitFunctionEntryCode(Function &Fn, MachineFunction &MF) {
554 // If this is main, emit special code for main.
555 MachineBasicBlock *BB = MF.begin();
556 if (Fn.hasExternalLinkage() && Fn.getName() == "main")
557 EmitSpecialCodeForMain(BB, MF.getFrameInfo());
560 /// MatchAddress - Add the specified node to the specified addressing mode,
561 /// returning true if it cannot be done. This just pattern matches for the
563 bool X86DAGToDAGISel::MatchAddress(SDOperand N, X86ISelAddressMode &AM,
565 // RIP relative addressing: %rip + 32-bit displacement!
567 if (!AM.ES && AM.JT != -1 && N.getOpcode() == ISD::Constant) {
568 int64_t Val = cast<ConstantSDNode>(N)->getSignExtended();
569 if (isInt32(AM.Disp + Val)) {
577 int id = N.Val->getNodeId();
578 bool Available = isSelected(id);
580 switch (N.getOpcode()) {
582 case ISD::Constant: {
583 int64_t Val = cast<ConstantSDNode>(N)->getSignExtended();
584 if (isInt32(AM.Disp + Val)) {
591 case X86ISD::Wrapper:
592 // If value is available in a register both base and index components have
593 // been picked, we can't fit the result available in the register in the
594 // addressing mode. Duplicate GlobalAddress or ConstantPool as displacement.
596 // Can't fit GV or CP in addressing mode for X86-64 medium or large code
597 // model since the displacement field is 32-bit. Ok for small code model.
599 // For X86-64 PIC code, only allow GV / CP + displacement so we can use RIP
600 // relative addressing mode.
601 if ((!Subtarget->is64Bit() || TM.getCodeModel() == CodeModel::Small) &&
602 (!Available || (AM.Base.Reg.Val && AM.IndexReg.Val))) {
603 bool isRIP = Subtarget->is64Bit();
604 if (isRIP && (AM.Base.Reg.Val || AM.Scale > 1 || AM.IndexReg.Val ||
605 AM.BaseType == X86ISelAddressMode::FrameIndexBase))
607 if (ConstantPoolSDNode *CP =
608 dyn_cast<ConstantPoolSDNode>(N.getOperand(0))) {
610 AM.CP = CP->getConstVal();
611 AM.Align = CP->getAlignment();
612 AM.Disp += CP->getOffset();
617 } else if (GlobalAddressSDNode *G =
618 dyn_cast<GlobalAddressSDNode>(N.getOperand(0))) {
620 AM.GV = G->getGlobal();
621 AM.Disp += G->getOffset();
626 } else if (isRoot && isRIP) {
627 if (ExternalSymbolSDNode *S =
628 dyn_cast<ExternalSymbolSDNode>(N.getOperand(0))) {
629 AM.ES = S->getSymbol();
632 } else if (JumpTableSDNode *J =
633 dyn_cast<JumpTableSDNode>(N.getOperand(0))) {
634 AM.JT = J->getIndex();
642 case ISD::FrameIndex:
643 if (AM.BaseType == X86ISelAddressMode::RegBase && AM.Base.Reg.Val == 0) {
644 AM.BaseType = X86ISelAddressMode::FrameIndexBase;
645 AM.Base.FrameIndex = cast<FrameIndexSDNode>(N)->getIndex();
651 if (!Available && AM.IndexReg.Val == 0 && AM.Scale == 1)
652 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1))) {
653 unsigned Val = CN->getValue();
654 if (Val == 1 || Val == 2 || Val == 3) {
656 SDOperand ShVal = N.Val->getOperand(0);
658 // Okay, we know that we have a scale by now. However, if the scaled
659 // value is an add of something and a constant, we can fold the
660 // constant into the disp field here.
661 if (ShVal.Val->getOpcode() == ISD::ADD && ShVal.hasOneUse() &&
662 isa<ConstantSDNode>(ShVal.Val->getOperand(1))) {
663 AM.IndexReg = ShVal.Val->getOperand(0);
664 ConstantSDNode *AddVal =
665 cast<ConstantSDNode>(ShVal.Val->getOperand(1));
666 uint64_t Disp = AM.Disp + AddVal->getValue() << Val;
680 // X*[3,5,9] -> X+X*[2,4,8]
682 AM.BaseType == X86ISelAddressMode::RegBase &&
683 AM.Base.Reg.Val == 0 &&
684 AM.IndexReg.Val == 0)
685 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1)))
686 if (CN->getValue() == 3 || CN->getValue() == 5 || CN->getValue() == 9) {
687 AM.Scale = unsigned(CN->getValue())-1;
689 SDOperand MulVal = N.Val->getOperand(0);
692 // Okay, we know that we have a scale by now. However, if the scaled
693 // value is an add of something and a constant, we can fold the
694 // constant into the disp field here.
695 if (MulVal.Val->getOpcode() == ISD::ADD && MulVal.hasOneUse() &&
696 isa<ConstantSDNode>(MulVal.Val->getOperand(1))) {
697 Reg = MulVal.Val->getOperand(0);
698 ConstantSDNode *AddVal =
699 cast<ConstantSDNode>(MulVal.Val->getOperand(1));
700 uint64_t Disp = AM.Disp + AddVal->getValue() * CN->getValue();
704 Reg = N.Val->getOperand(0);
706 Reg = N.Val->getOperand(0);
709 AM.IndexReg = AM.Base.Reg = Reg;
716 X86ISelAddressMode Backup = AM;
717 if (!MatchAddress(N.Val->getOperand(0), AM, false) &&
718 !MatchAddress(N.Val->getOperand(1), AM, false))
721 if (!MatchAddress(N.Val->getOperand(1), AM, false) &&
722 !MatchAddress(N.Val->getOperand(0), AM, false))
731 X86ISelAddressMode Backup = AM;
732 // Look for (x << c1) | c2 where (c2 < c1)
733 ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(0));
734 if (CN && !MatchAddress(N.Val->getOperand(1), AM, false)) {
735 if (AM.GV == NULL && AM.Disp == 0 && CN->getValue() < AM.Scale) {
736 AM.Disp = CN->getValue();
741 CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1));
742 if (CN && !MatchAddress(N.Val->getOperand(0), AM, false)) {
743 if (AM.GV == NULL && AM.Disp == 0 && CN->getValue() < AM.Scale) {
744 AM.Disp = CN->getValue();
754 // Is the base register already occupied?
755 if (AM.BaseType != X86ISelAddressMode::RegBase || AM.Base.Reg.Val) {
756 // If so, check to see if the scale index register is set.
757 if (AM.IndexReg.Val == 0) {
763 // Otherwise, we cannot select it.
767 // Default, generate it as a register.
768 AM.BaseType = X86ISelAddressMode::RegBase;
773 /// SelectAddr - returns true if it is able pattern match an addressing mode.
774 /// It returns the operands which make up the maximal addressing mode it can
775 /// match by reference.
776 bool X86DAGToDAGISel::SelectAddr(SDOperand N, SDOperand &Base, SDOperand &Scale,
777 SDOperand &Index, SDOperand &Disp) {
778 X86ISelAddressMode AM;
779 if (MatchAddress(N, AM))
782 MVT::ValueType VT = N.getValueType();
783 if (AM.BaseType == X86ISelAddressMode::RegBase) {
784 if (!AM.Base.Reg.Val)
785 AM.Base.Reg = CurDAG->getRegister(0, VT);
788 if (!AM.IndexReg.Val)
789 AM.IndexReg = CurDAG->getRegister(0, VT);
791 getAddressOperands(AM, Base, Scale, Index, Disp);
795 /// isZeroNode - Returns true if Elt is a constant zero or a floating point
797 static inline bool isZeroNode(SDOperand Elt) {
798 return ((isa<ConstantSDNode>(Elt) &&
799 cast<ConstantSDNode>(Elt)->getValue() == 0) ||
800 (isa<ConstantFPSDNode>(Elt) &&
801 cast<ConstantFPSDNode>(Elt)->isExactlyValue(0.0)));
805 /// SelectScalarSSELoad - Match a scalar SSE load. In particular, we want to
806 /// match a load whose top elements are either undef or zeros. The load flavor
807 /// is derived from the type of N, which is either v4f32 or v2f64.
808 bool X86DAGToDAGISel::SelectScalarSSELoad(SDOperand Root, SDOperand Pred,
809 SDOperand N, SDOperand &Base,
810 SDOperand &Scale, SDOperand &Index,
811 SDOperand &Disp, SDOperand &InChain,
812 SDOperand &OutChain) {
813 if (N.getOpcode() == ISD::SCALAR_TO_VECTOR) {
814 InChain = N.getOperand(0).getValue(1);
815 if (ISD::isNON_EXTLoad(InChain.Val) &&
816 InChain.getValue(0).hasOneUse() &&
817 CanBeFoldedBy(N.Val, Pred.Val, Root.Val)) {
818 LoadSDNode *LD = cast<LoadSDNode>(InChain);
819 if (!SelectAddr(LD->getBasePtr(), Base, Scale, Index, Disp))
821 OutChain = LD->getChain();
826 // Also handle the case where we explicitly require zeros in the top
827 // elements. This is a vector shuffle from the zero vector.
828 if (N.getOpcode() == ISD::VECTOR_SHUFFLE && N.Val->hasOneUse() &&
829 N.getOperand(0).getOpcode() == ISD::BUILD_VECTOR &&
830 N.getOperand(1).getOpcode() == ISD::SCALAR_TO_VECTOR &&
831 N.getOperand(1).Val->hasOneUse() &&
832 ISD::isNON_EXTLoad(N.getOperand(1).getOperand(0).Val) &&
833 N.getOperand(1).getOperand(0).hasOneUse()) {
834 // Check to see if the BUILD_VECTOR is building a zero vector.
835 SDOperand BV = N.getOperand(0);
836 for (unsigned i = 0, e = BV.getNumOperands(); i != e; ++i)
837 if (!isZeroNode(BV.getOperand(i)) &&
838 BV.getOperand(i).getOpcode() != ISD::UNDEF)
839 return false; // Not a zero/undef vector.
840 // Check to see if the shuffle mask is 4/L/L/L or 2/L, where L is something
842 unsigned VecWidth = BV.getNumOperands();
843 SDOperand ShufMask = N.getOperand(2);
844 assert(ShufMask.getOpcode() == ISD::BUILD_VECTOR && "Invalid shuf mask!");
845 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(ShufMask.getOperand(0))) {
846 if (C->getValue() == VecWidth) {
847 for (unsigned i = 1; i != VecWidth; ++i) {
848 if (ShufMask.getOperand(i).getOpcode() == ISD::UNDEF) {
851 ConstantSDNode *C = cast<ConstantSDNode>(ShufMask.getOperand(i));
852 if (C->getValue() >= VecWidth) return false;
857 // Okay, this is a zero extending load. Fold it.
858 LoadSDNode *LD = cast<LoadSDNode>(N.getOperand(1).getOperand(0));
859 if (!SelectAddr(LD->getBasePtr(), Base, Scale, Index, Disp))
861 OutChain = LD->getChain();
862 InChain = SDOperand(LD, 1);
870 /// SelectLEAAddr - it calls SelectAddr and determines if the maximal addressing
871 /// mode it matches can be cost effectively emitted as an LEA instruction.
872 bool X86DAGToDAGISel::SelectLEAAddr(SDOperand N, SDOperand &Base,
874 SDOperand &Index, SDOperand &Disp) {
875 X86ISelAddressMode AM;
876 if (MatchAddress(N, AM))
879 MVT::ValueType VT = N.getValueType();
880 unsigned Complexity = 0;
881 if (AM.BaseType == X86ISelAddressMode::RegBase)
885 AM.Base.Reg = CurDAG->getRegister(0, VT);
886 else if (AM.BaseType == X86ISelAddressMode::FrameIndexBase)
892 AM.IndexReg = CurDAG->getRegister(0, VT);
896 // Don't match just leal(,%reg,2). It's cheaper to do addl %reg, %reg
897 else if (AM.Scale > 1)
900 // FIXME: We are artificially lowering the criteria to turn ADD %reg, $GA
901 // to a LEA. This is determined with some expermentation but is by no means
902 // optimal (especially for code size consideration). LEA is nice because of
903 // its three-address nature. Tweak the cost function again when we can run
904 // convertToThreeAddress() at register allocation time.
905 if (AM.GV || AM.CP || AM.ES || AM.JT != -1) {
906 // For X86-64, we should always use lea to materialize RIP relative
908 if (Subtarget->is64Bit())
914 if (AM.Disp && (AM.Base.Reg.Val || AM.IndexReg.Val))
917 if (Complexity > 2) {
918 getAddressOperands(AM, Base, Scale, Index, Disp);
924 bool X86DAGToDAGISel::TryFoldLoad(SDOperand P, SDOperand N,
925 SDOperand &Base, SDOperand &Scale,
926 SDOperand &Index, SDOperand &Disp) {
927 if (ISD::isNON_EXTLoad(N.Val) &&
929 CanBeFoldedBy(N.Val, P.Val, P.Val))
930 return SelectAddr(N.getOperand(1), Base, Scale, Index, Disp);
934 /// getGlobalBaseReg - Output the instructions required to put the
935 /// base address to use for accessing globals into a register.
937 SDNode *X86DAGToDAGISel::getGlobalBaseReg() {
938 assert(!Subtarget->is64Bit() && "X86-64 PIC uses RIP relative addressing");
939 if (!GlobalBaseReg) {
940 // Insert the set of GlobalBaseReg into the first MBB of the function
941 MachineBasicBlock &FirstMBB = BB->getParent()->front();
942 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
943 SSARegMap *RegMap = BB->getParent()->getSSARegMap();
944 // FIXME: when we get to LP64, we will need to create the appropriate
945 // type of register here.
946 GlobalBaseReg = RegMap->createVirtualRegister(X86::GR32RegisterClass);
947 BuildMI(FirstMBB, MBBI, X86::MovePCtoStack, 0);
948 BuildMI(FirstMBB, MBBI, X86::POP32r, 1, GlobalBaseReg);
950 return CurDAG->getRegister(GlobalBaseReg, TLI.getPointerTy()).Val;
953 static SDNode *FindCallStartFromCall(SDNode *Node) {
954 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
955 assert(Node->getOperand(0).getValueType() == MVT::Other &&
956 "Node doesn't have a token chain argument!");
957 return FindCallStartFromCall(Node->getOperand(0).Val);
960 SDNode *X86DAGToDAGISel::Select(SDOperand N) {
961 SDNode *Node = N.Val;
962 MVT::ValueType NVT = Node->getValueType(0);
964 unsigned Opcode = Node->getOpcode();
967 DEBUG(std::cerr << std::string(Indent, ' '));
968 DEBUG(std::cerr << "Selecting: ");
969 DEBUG(Node->dump(CurDAG));
970 DEBUG(std::cerr << "\n");
974 if (Opcode >= ISD::BUILTIN_OP_END && Opcode < X86ISD::FIRST_NUMBER) {
976 DEBUG(std::cerr << std::string(Indent-2, ' '));
977 DEBUG(std::cerr << "== ");
978 DEBUG(Node->dump(CurDAG));
979 DEBUG(std::cerr << "\n");
982 return NULL; // Already selected.
987 case X86ISD::GlobalBaseReg:
988 return getGlobalBaseReg();
991 // Turn ADD X, c to MOV32ri X+c. This cannot be done with tblgen'd
992 // code and is matched first so to prevent it from being turned into
994 // In 64-bit mode, use LEA to take advantage of RIP-relative addressing.
995 MVT::ValueType PtrVT = TLI.getPointerTy();
996 SDOperand N0 = N.getOperand(0);
997 SDOperand N1 = N.getOperand(1);
998 if (N.Val->getValueType(0) == PtrVT &&
999 N0.getOpcode() == X86ISD::Wrapper &&
1000 N1.getOpcode() == ISD::Constant) {
1001 unsigned Offset = (unsigned)cast<ConstantSDNode>(N1)->getValue();
1003 // TODO: handle ExternalSymbolSDNode.
1004 if (GlobalAddressSDNode *G =
1005 dyn_cast<GlobalAddressSDNode>(N0.getOperand(0))) {
1006 C = CurDAG->getTargetGlobalAddress(G->getGlobal(), PtrVT,
1007 G->getOffset() + Offset);
1008 } else if (ConstantPoolSDNode *CP =
1009 dyn_cast<ConstantPoolSDNode>(N0.getOperand(0))) {
1010 C = CurDAG->getTargetConstantPool(CP->getConstVal(), PtrVT,
1012 CP->getOffset()+Offset);
1016 if (Subtarget->is64Bit()) {
1017 SDOperand Ops[] = { CurDAG->getRegister(0, PtrVT), getI8Imm(1),
1018 CurDAG->getRegister(0, PtrVT), C };
1019 return CurDAG->SelectNodeTo(N.Val, X86::LEA64r, MVT::i64, Ops, 4);
1021 return CurDAG->SelectNodeTo(N.Val, X86::MOV32ri, PtrVT, C);
1025 // Other cases are handled by auto-generated code.
1031 if (Opcode == ISD::MULHU)
1033 default: assert(0 && "Unsupported VT!");
1034 case MVT::i8: Opc = X86::MUL8r; MOpc = X86::MUL8m; break;
1035 case MVT::i16: Opc = X86::MUL16r; MOpc = X86::MUL16m; break;
1036 case MVT::i32: Opc = X86::MUL32r; MOpc = X86::MUL32m; break;
1037 case MVT::i64: Opc = X86::MUL64r; MOpc = X86::MUL64m; break;
1041 default: assert(0 && "Unsupported VT!");
1042 case MVT::i8: Opc = X86::IMUL8r; MOpc = X86::IMUL8m; break;
1043 case MVT::i16: Opc = X86::IMUL16r; MOpc = X86::IMUL16m; break;
1044 case MVT::i32: Opc = X86::IMUL32r; MOpc = X86::IMUL32m; break;
1045 case MVT::i64: Opc = X86::IMUL64r; MOpc = X86::IMUL64m; break;
1048 unsigned LoReg, HiReg;
1050 default: assert(0 && "Unsupported VT!");
1051 case MVT::i8: LoReg = X86::AL; HiReg = X86::AH; break;
1052 case MVT::i16: LoReg = X86::AX; HiReg = X86::DX; break;
1053 case MVT::i32: LoReg = X86::EAX; HiReg = X86::EDX; break;
1054 case MVT::i64: LoReg = X86::RAX; HiReg = X86::RDX; break;
1057 SDOperand N0 = Node->getOperand(0);
1058 SDOperand N1 = Node->getOperand(1);
1060 bool foldedLoad = false;
1061 SDOperand Tmp0, Tmp1, Tmp2, Tmp3;
1062 foldedLoad = TryFoldLoad(N, N1, Tmp0, Tmp1, Tmp2, Tmp3);
1063 // MULHU and MULHS are commmutative
1065 foldedLoad = TryFoldLoad(N, N0, Tmp0, Tmp1, Tmp2, Tmp3);
1067 N0 = Node->getOperand(1);
1068 N1 = Node->getOperand(0);
1074 Chain = N1.getOperand(0);
1075 AddToISelQueue(Chain);
1077 Chain = CurDAG->getEntryNode();
1079 SDOperand InFlag(0, 0);
1081 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(LoReg, NVT),
1083 InFlag = Chain.getValue(1);
1086 AddToISelQueue(Tmp0);
1087 AddToISelQueue(Tmp1);
1088 AddToISelQueue(Tmp2);
1089 AddToISelQueue(Tmp3);
1090 SDOperand Ops[] = { Tmp0, Tmp1, Tmp2, Tmp3, Chain, InFlag };
1092 CurDAG->getTargetNode(MOpc, MVT::Other, MVT::Flag, Ops, 6);
1093 Chain = SDOperand(CNode, 0);
1094 InFlag = SDOperand(CNode, 1);
1098 SDOperand(CurDAG->getTargetNode(Opc, MVT::Flag, N1, InFlag), 0);
1101 SDOperand Result = CurDAG->getCopyFromReg(Chain, HiReg, NVT, InFlag);
1102 ReplaceUses(N.getValue(0), Result);
1104 ReplaceUses(N1.getValue(1), Result.getValue(1));
1107 DEBUG(std::cerr << std::string(Indent-2, ' '));
1108 DEBUG(std::cerr << "=> ");
1109 DEBUG(Result.Val->dump(CurDAG));
1110 DEBUG(std::cerr << "\n");
1120 bool isSigned = Opcode == ISD::SDIV || Opcode == ISD::SREM;
1121 bool isDiv = Opcode == ISD::SDIV || Opcode == ISD::UDIV;
1124 default: assert(0 && "Unsupported VT!");
1125 case MVT::i8: Opc = X86::DIV8r; MOpc = X86::DIV8m; break;
1126 case MVT::i16: Opc = X86::DIV16r; MOpc = X86::DIV16m; break;
1127 case MVT::i32: Opc = X86::DIV32r; MOpc = X86::DIV32m; break;
1128 case MVT::i64: Opc = X86::DIV64r; MOpc = X86::DIV64m; break;
1132 default: assert(0 && "Unsupported VT!");
1133 case MVT::i8: Opc = X86::IDIV8r; MOpc = X86::IDIV8m; break;
1134 case MVT::i16: Opc = X86::IDIV16r; MOpc = X86::IDIV16m; break;
1135 case MVT::i32: Opc = X86::IDIV32r; MOpc = X86::IDIV32m; break;
1136 case MVT::i64: Opc = X86::IDIV64r; MOpc = X86::IDIV64m; break;
1139 unsigned LoReg, HiReg;
1140 unsigned ClrOpcode, SExtOpcode;
1142 default: assert(0 && "Unsupported VT!");
1144 LoReg = X86::AL; HiReg = X86::AH;
1145 ClrOpcode = X86::MOV8r0;
1146 SExtOpcode = X86::CBW;
1149 LoReg = X86::AX; HiReg = X86::DX;
1150 ClrOpcode = X86::MOV16r0;
1151 SExtOpcode = X86::CWD;
1154 LoReg = X86::EAX; HiReg = X86::EDX;
1155 ClrOpcode = X86::MOV32r0;
1156 SExtOpcode = X86::CDQ;
1159 LoReg = X86::RAX; HiReg = X86::RDX;
1160 ClrOpcode = X86::MOV64r0;
1161 SExtOpcode = X86::CQO;
1165 SDOperand N0 = Node->getOperand(0);
1166 SDOperand N1 = Node->getOperand(1);
1168 bool foldedLoad = false;
1169 SDOperand Tmp0, Tmp1, Tmp2, Tmp3;
1170 foldedLoad = TryFoldLoad(N, N1, Tmp0, Tmp1, Tmp2, Tmp3);
1173 Chain = N1.getOperand(0);
1174 AddToISelQueue(Chain);
1176 Chain = CurDAG->getEntryNode();
1178 SDOperand InFlag(0, 0);
1180 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(LoReg, NVT),
1182 InFlag = Chain.getValue(1);
1185 // Sign extend the low part into the high part.
1187 SDOperand(CurDAG->getTargetNode(SExtOpcode, MVT::Flag, InFlag), 0);
1189 // Zero out the high part, effectively zero extending the input.
1190 SDOperand ClrNode = SDOperand(CurDAG->getTargetNode(ClrOpcode, NVT), 0);
1191 Chain = CurDAG->getCopyToReg(Chain, CurDAG->getRegister(HiReg, NVT),
1193 InFlag = Chain.getValue(1);
1197 AddToISelQueue(Tmp0);
1198 AddToISelQueue(Tmp1);
1199 AddToISelQueue(Tmp2);
1200 AddToISelQueue(Tmp3);
1201 SDOperand Ops[] = { Tmp0, Tmp1, Tmp2, Tmp3, Chain, InFlag };
1203 CurDAG->getTargetNode(MOpc, MVT::Other, MVT::Flag, Ops, 6);
1204 Chain = SDOperand(CNode, 0);
1205 InFlag = SDOperand(CNode, 1);
1209 SDOperand(CurDAG->getTargetNode(Opc, MVT::Flag, N1, InFlag), 0);
1212 SDOperand Result = CurDAG->getCopyFromReg(Chain, isDiv ? LoReg : HiReg,
1214 ReplaceUses(N.getValue(0), Result);
1216 ReplaceUses(N1.getValue(1), Result.getValue(1));
1219 DEBUG(std::cerr << std::string(Indent-2, ' '));
1220 DEBUG(std::cerr << "=> ");
1221 DEBUG(Result.Val->dump(CurDAG));
1222 DEBUG(std::cerr << "\n");
1229 case ISD::TRUNCATE: {
1230 if (!Subtarget->is64Bit() && NVT == MVT::i8) {
1233 switch (Node->getOperand(0).getValueType()) {
1234 default: assert(0 && "Unknown truncate!");
1236 Opc = X86::MOV16to16_;
1238 Opc2 = X86::TRUNC_16_to8;
1241 Opc = X86::MOV32to32_;
1243 Opc2 = X86::TRUNC_32_to8;
1247 AddToISelQueue(Node->getOperand(0));
1249 SDOperand(CurDAG->getTargetNode(Opc, VT, Node->getOperand(0)), 0);
1250 SDNode *ResNode = CurDAG->getTargetNode(Opc2, NVT, Tmp);
1253 DEBUG(std::cerr << std::string(Indent-2, ' '));
1254 DEBUG(std::cerr << "=> ");
1255 DEBUG(ResNode->dump(CurDAG));
1256 DEBUG(std::cerr << "\n");
1266 SDNode *ResNode = SelectCode(N);
1269 DEBUG(std::cerr << std::string(Indent-2, ' '));
1270 DEBUG(std::cerr << "=> ");
1271 if (ResNode == NULL || ResNode == N.Val)
1272 DEBUG(N.Val->dump(CurDAG));
1274 DEBUG(ResNode->dump(CurDAG));
1275 DEBUG(std::cerr << "\n");
1282 bool X86DAGToDAGISel::
1283 SelectInlineAsmMemoryOperand(const SDOperand &Op, char ConstraintCode,
1284 std::vector<SDOperand> &OutOps, SelectionDAG &DAG){
1285 SDOperand Op0, Op1, Op2, Op3;
1286 switch (ConstraintCode) {
1287 case 'o': // offsetable ??
1288 case 'v': // not offsetable ??
1289 default: return true;
1291 if (!SelectAddr(Op, Op0, Op1, Op2, Op3))
1296 OutOps.push_back(Op0);
1297 OutOps.push_back(Op1);
1298 OutOps.push_back(Op2);
1299 OutOps.push_back(Op3);
1300 AddToISelQueue(Op0);
1301 AddToISelQueue(Op1);
1302 AddToISelQueue(Op2);
1303 AddToISelQueue(Op3);
1307 /// createX86ISelDag - This pass converts a legalized DAG into a
1308 /// X86-specific DAG, ready for instruction scheduling.
1310 FunctionPass *llvm::createX86ISelDag(X86TargetMachine &TM, bool Fast) {
1311 return new X86DAGToDAGISel(TM, Fast);