blob: 35a5516c599a7ac96f9796c8879e986659d3afa7 [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===- X86ISelDAGToDAG.cpp - A DAG pattern matching inst selector for X86 -===//
2//
3// The LLVM Compiler Infrastructure
4//
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.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file defines a DAG pattern matching instruction selector for X86,
11// converting from a legalized dag to a X86 dag.
12//
13//===----------------------------------------------------------------------===//
14
15#define DEBUG_TYPE "x86-isel"
16#include "X86.h"
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/Type.h"
27#include "llvm/CodeGen/MachineConstantPool.h"
28#include "llvm/CodeGen/MachineFunction.h"
29#include "llvm/CodeGen/MachineFrameInfo.h"
30#include "llvm/CodeGen/MachineInstrBuilder.h"
31#include "llvm/CodeGen/SSARegMap.h"
32#include "llvm/CodeGen/SelectionDAGISel.h"
33#include "llvm/Target/TargetMachine.h"
34#include "llvm/Support/Compiler.h"
35#include "llvm/Support/Debug.h"
36#include "llvm/Support/MathExtras.h"
37#include "llvm/ADT/Statistic.h"
38#include <queue>
39#include <set>
40using namespace llvm;
41
42STATISTIC(NumFPKill , "Number of FP_REG_KILL instructions added");
43STATISTIC(NumLoadMoved, "Number of loads moved below TokenFactor");
44
45
46//===----------------------------------------------------------------------===//
47// Pattern Matcher Implementation
48//===----------------------------------------------------------------------===//
49
50namespace {
51 /// X86ISelAddressMode - This corresponds to X86AddressMode, but uses
52 /// SDOperand's instead of register numbers for the leaves of the matched
53 /// tree.
54 struct X86ISelAddressMode {
55 enum {
56 RegBase,
57 FrameIndexBase
58 } BaseType;
59
60 struct { // This is really a union, discriminated by BaseType!
61 SDOperand Reg;
62 int FrameIndex;
63 } Base;
64
65 bool isRIPRel; // RIP relative?
66 unsigned Scale;
67 SDOperand IndexReg;
68 unsigned Disp;
69 GlobalValue *GV;
70 Constant *CP;
71 const char *ES;
72 int JT;
73 unsigned Align; // CP alignment.
74
75 X86ISelAddressMode()
76 : BaseType(RegBase), isRIPRel(false), Scale(1), IndexReg(), Disp(0),
77 GV(0), CP(0), ES(0), JT(-1), Align(0) {
78 }
79 };
80}
81
82namespace {
83 //===--------------------------------------------------------------------===//
84 /// ISel - X86 specific code to select X86 machine instructions for
85 /// SelectionDAG operations.
86 ///
87 class VISIBILITY_HIDDEN X86DAGToDAGISel : public SelectionDAGISel {
88 /// ContainsFPCode - Every instruction we select that uses or defines a FP
89 /// register should set this to true.
90 bool ContainsFPCode;
91
92 /// FastISel - Enable fast(er) instruction selection.
93 ///
94 bool FastISel;
95
96 /// TM - Keep a reference to X86TargetMachine.
97 ///
98 X86TargetMachine &TM;
99
100 /// X86Lowering - This object fully describes how to lower LLVM code to an
101 /// X86-specific SelectionDAG.
102 X86TargetLowering X86Lowering;
103
104 /// Subtarget - Keep a pointer to the X86Subtarget around so that we can
105 /// make the right decision when generating code for different targets.
106 const X86Subtarget *Subtarget;
107
108 /// GlobalBaseReg - keeps track of the virtual register mapped onto global
109 /// base register.
110 unsigned GlobalBaseReg;
111
112 public:
113 X86DAGToDAGISel(X86TargetMachine &tm, bool fast)
114 : SelectionDAGISel(X86Lowering),
115 ContainsFPCode(false), FastISel(fast), TM(tm),
116 X86Lowering(*TM.getTargetLowering()),
117 Subtarget(&TM.getSubtarget<X86Subtarget>()) {}
118
119 virtual bool runOnFunction(Function &Fn) {
120 // Make sure we re-emit a set of the global base reg if necessary
121 GlobalBaseReg = 0;
122 return SelectionDAGISel::runOnFunction(Fn);
123 }
124
125 virtual const char *getPassName() const {
126 return "X86 DAG->DAG Instruction Selection";
127 }
128
129 /// InstructionSelectBasicBlock - This callback is invoked by
130 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
131 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG);
132
Anton Korobeynikov34ef31e2007-09-25 21:52:30 +0000133 virtual void EmitFunctionEntryCode(Function &Fn, MachineFunction &MF);
134
Dan Gohmand6098272007-07-24 23:00:27 +0000135 virtual bool CanBeFoldedBy(SDNode *N, SDNode *U, SDNode *Root) const;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000136
137// Include the pieces autogenerated from the target description.
138#include "X86GenDAGISel.inc"
139
140 private:
141 SDNode *Select(SDOperand N);
142
143 bool MatchAddress(SDOperand N, X86ISelAddressMode &AM,
144 bool isRoot = true, unsigned Depth = 0);
Dan Gohmana60c1b32007-08-13 20:03:06 +0000145 bool MatchAddressBase(SDOperand N, X86ISelAddressMode &AM,
146 bool isRoot, unsigned Depth);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000147 bool SelectAddr(SDOperand Op, SDOperand N, SDOperand &Base,
148 SDOperand &Scale, SDOperand &Index, SDOperand &Disp);
149 bool SelectLEAAddr(SDOperand Op, SDOperand N, SDOperand &Base,
150 SDOperand &Scale, SDOperand &Index, SDOperand &Disp);
151 bool SelectScalarSSELoad(SDOperand Op, SDOperand Pred,
152 SDOperand N, SDOperand &Base, SDOperand &Scale,
153 SDOperand &Index, SDOperand &Disp,
154 SDOperand &InChain, SDOperand &OutChain);
155 bool TryFoldLoad(SDOperand P, SDOperand N,
156 SDOperand &Base, SDOperand &Scale,
157 SDOperand &Index, SDOperand &Disp);
158 void InstructionSelectPreprocess(SelectionDAG &DAG);
159
160 /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for
161 /// inline asm expressions.
162 virtual bool SelectInlineAsmMemoryOperand(const SDOperand &Op,
163 char ConstraintCode,
164 std::vector<SDOperand> &OutOps,
165 SelectionDAG &DAG);
166
Anton Korobeynikov34ef31e2007-09-25 21:52:30 +0000167 void EmitSpecialCodeForMain(MachineBasicBlock *BB, MachineFrameInfo *MFI);
168
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000169 inline void getAddressOperands(X86ISelAddressMode &AM, SDOperand &Base,
170 SDOperand &Scale, SDOperand &Index,
171 SDOperand &Disp) {
172 Base = (AM.BaseType == X86ISelAddressMode::FrameIndexBase) ?
173 CurDAG->getTargetFrameIndex(AM.Base.FrameIndex, TLI.getPointerTy()) :
174 AM.Base.Reg;
175 Scale = getI8Imm(AM.Scale);
176 Index = AM.IndexReg;
177 // These are 32-bit even in 64-bit mode since RIP relative offset
178 // is 32-bit.
179 if (AM.GV)
180 Disp = CurDAG->getTargetGlobalAddress(AM.GV, MVT::i32, AM.Disp);
181 else if (AM.CP)
182 Disp = CurDAG->getTargetConstantPool(AM.CP, MVT::i32, AM.Align, AM.Disp);
183 else if (AM.ES)
184 Disp = CurDAG->getTargetExternalSymbol(AM.ES, MVT::i32);
185 else if (AM.JT != -1)
186 Disp = CurDAG->getTargetJumpTable(AM.JT, MVT::i32);
187 else
188 Disp = getI32Imm(AM.Disp);
189 }
190
191 /// getI8Imm - Return a target constant with the specified value, of type
192 /// i8.
193 inline SDOperand getI8Imm(unsigned Imm) {
194 return CurDAG->getTargetConstant(Imm, MVT::i8);
195 }
196
197 /// getI16Imm - Return a target constant with the specified value, of type
198 /// i16.
199 inline SDOperand getI16Imm(unsigned Imm) {
200 return CurDAG->getTargetConstant(Imm, MVT::i16);
201 }
202
203 /// getI32Imm - Return a target constant with the specified value, of type
204 /// i32.
205 inline SDOperand getI32Imm(unsigned Imm) {
206 return CurDAG->getTargetConstant(Imm, MVT::i32);
207 }
208
209 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
210 /// base register. Return the virtual register that holds this value.
211 SDNode *getGlobalBaseReg();
212
Christopher Lamb0a7c8662007-08-10 21:48:46 +0000213 /// getTruncate - return an SDNode that implements a subreg based truncate
214 /// of the specified operand to the the specified value type.
215 SDNode *getTruncate(SDOperand N0, MVT::ValueType VT);
216
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000217#ifndef NDEBUG
218 unsigned Indent;
219#endif
220 };
221}
222
223static SDNode *findFlagUse(SDNode *N) {
224 unsigned FlagResNo = N->getNumValues()-1;
225 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
226 SDNode *User = *I;
227 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) {
228 SDOperand Op = User->getOperand(i);
229 if (Op.Val == N && Op.ResNo == FlagResNo)
230 return User;
231 }
232 }
233 return NULL;
234}
235
236static void findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
237 SDNode *Root, SDNode *Skip, bool &found,
238 std::set<SDNode *> &Visited) {
239 if (found ||
240 Use->getNodeId() > Def->getNodeId() ||
241 !Visited.insert(Use).second)
242 return;
243
244 for (unsigned i = 0, e = Use->getNumOperands(); !found && i != e; ++i) {
245 SDNode *N = Use->getOperand(i).Val;
246 if (N == Skip)
247 continue;
248 if (N == Def) {
249 if (Use == ImmedUse)
250 continue; // Immediate use is ok.
251 if (Use == Root) {
252 assert(Use->getOpcode() == ISD::STORE ||
253 Use->getOpcode() == X86ISD::CMP);
254 continue;
255 }
256 found = true;
257 break;
258 }
259 findNonImmUse(N, Def, ImmedUse, Root, Skip, found, Visited);
260 }
261}
262
263/// isNonImmUse - Start searching from Root up the DAG to check is Def can
264/// be reached. Return true if that's the case. However, ignore direct uses
265/// by ImmedUse (which would be U in the example illustrated in
266/// CanBeFoldedBy) and by Root (which can happen in the store case).
267/// FIXME: to be really generic, we should allow direct use by any node
268/// that is being folded. But realisticly since we only fold loads which
269/// have one non-chain use, we only need to watch out for load/op/store
270/// and load/op/cmp case where the root (store / cmp) may reach the load via
271/// its chain operand.
272static inline bool isNonImmUse(SDNode *Root, SDNode *Def, SDNode *ImmedUse,
273 SDNode *Skip = NULL) {
274 std::set<SDNode *> Visited;
275 bool found = false;
276 findNonImmUse(Root, Def, ImmedUse, Root, Skip, found, Visited);
277 return found;
278}
279
280
Dan Gohmand6098272007-07-24 23:00:27 +0000281bool X86DAGToDAGISel::CanBeFoldedBy(SDNode *N, SDNode *U, SDNode *Root) const {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000282 if (FastISel) return false;
283
284 // If U use can somehow reach N through another path then U can't fold N or
285 // it will create a cycle. e.g. In the following diagram, U can reach N
286 // through X. If N is folded into into U, then X is both a predecessor and
287 // a successor of U.
288 //
289 // [ N ]
290 // ^ ^
291 // | |
292 // / \---
293 // / [X]
294 // | ^
295 // [U]--------|
296
297 if (isNonImmUse(Root, N, U))
298 return false;
299
300 // If U produces a flag, then it gets (even more) interesting. Since it
301 // would have been "glued" together with its flag use, we need to check if
302 // it might reach N:
303 //
304 // [ N ]
305 // ^ ^
306 // | |
307 // [U] \--
308 // ^ [TF]
309 // | ^
310 // | |
311 // \ /
312 // [FU]
313 //
314 // If FU (flag use) indirectly reach N (the load), and U fold N (call it
315 // NU), then TF is a predecessor of FU and a successor of NU. But since
316 // NU and FU are flagged together, this effectively creates a cycle.
317 bool HasFlagUse = false;
318 MVT::ValueType VT = Root->getValueType(Root->getNumValues()-1);
319 while ((VT == MVT::Flag && !Root->use_empty())) {
320 SDNode *FU = findFlagUse(Root);
321 if (FU == NULL)
322 break;
323 else {
324 Root = FU;
325 HasFlagUse = true;
326 }
327 VT = Root->getValueType(Root->getNumValues()-1);
328 }
329
330 if (HasFlagUse)
331 return !isNonImmUse(Root, N, Root, U);
332 return true;
333}
334
335/// MoveBelowTokenFactor - Replace TokenFactor operand with load's chain operand
336/// and move load below the TokenFactor. Replace store's chain operand with
337/// load's chain result.
338static void MoveBelowTokenFactor(SelectionDAG &DAG, SDOperand Load,
339 SDOperand Store, SDOperand TF) {
340 std::vector<SDOperand> Ops;
341 for (unsigned i = 0, e = TF.Val->getNumOperands(); i != e; ++i)
342 if (Load.Val == TF.Val->getOperand(i).Val)
343 Ops.push_back(Load.Val->getOperand(0));
344 else
345 Ops.push_back(TF.Val->getOperand(i));
346 DAG.UpdateNodeOperands(TF, &Ops[0], Ops.size());
347 DAG.UpdateNodeOperands(Load, TF, Load.getOperand(1), Load.getOperand(2));
348 DAG.UpdateNodeOperands(Store, Load.getValue(1), Store.getOperand(1),
349 Store.getOperand(2), Store.getOperand(3));
350}
351
352/// InstructionSelectPreprocess - Preprocess the DAG to allow the instruction
353/// selector to pick more load-modify-store instructions. This is a common
354/// case:
355///
356/// [Load chain]
357/// ^
358/// |
359/// [Load]
360/// ^ ^
361/// | |
362/// / \-
363/// / |
364/// [TokenFactor] [Op]
365/// ^ ^
366/// | |
367/// \ /
368/// \ /
369/// [Store]
370///
371/// The fact the store's chain operand != load's chain will prevent the
372/// (store (op (load))) instruction from being selected. We can transform it to:
373///
374/// [Load chain]
375/// ^
376/// |
377/// [TokenFactor]
378/// ^
379/// |
380/// [Load]
381/// ^ ^
382/// | |
383/// | \-
384/// | |
385/// | [Op]
386/// | ^
387/// | |
388/// \ /
389/// \ /
390/// [Store]
391void X86DAGToDAGISel::InstructionSelectPreprocess(SelectionDAG &DAG) {
392 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
393 E = DAG.allnodes_end(); I != E; ++I) {
394 if (!ISD::isNON_TRUNCStore(I))
395 continue;
396 SDOperand Chain = I->getOperand(0);
397 if (Chain.Val->getOpcode() != ISD::TokenFactor)
398 continue;
399
400 SDOperand N1 = I->getOperand(1);
401 SDOperand N2 = I->getOperand(2);
402 if (MVT::isFloatingPoint(N1.getValueType()) ||
403 MVT::isVector(N1.getValueType()) ||
404 !N1.hasOneUse())
405 continue;
406
407 bool RModW = false;
408 SDOperand Load;
409 unsigned Opcode = N1.Val->getOpcode();
410 switch (Opcode) {
411 case ISD::ADD:
412 case ISD::MUL:
413 case ISD::AND:
414 case ISD::OR:
415 case ISD::XOR:
416 case ISD::ADDC:
417 case ISD::ADDE: {
418 SDOperand N10 = N1.getOperand(0);
419 SDOperand N11 = N1.getOperand(1);
420 if (ISD::isNON_EXTLoad(N10.Val))
421 RModW = true;
422 else if (ISD::isNON_EXTLoad(N11.Val)) {
423 RModW = true;
424 std::swap(N10, N11);
425 }
426 RModW = RModW && N10.Val->isOperand(Chain.Val) && N10.hasOneUse() &&
427 (N10.getOperand(1) == N2) &&
428 (N10.Val->getValueType(0) == N1.getValueType());
429 if (RModW)
430 Load = N10;
431 break;
432 }
433 case ISD::SUB:
434 case ISD::SHL:
435 case ISD::SRA:
436 case ISD::SRL:
437 case ISD::ROTL:
438 case ISD::ROTR:
439 case ISD::SUBC:
440 case ISD::SUBE:
441 case X86ISD::SHLD:
442 case X86ISD::SHRD: {
443 SDOperand N10 = N1.getOperand(0);
444 if (ISD::isNON_EXTLoad(N10.Val))
445 RModW = N10.Val->isOperand(Chain.Val) && N10.hasOneUse() &&
446 (N10.getOperand(1) == N2) &&
447 (N10.Val->getValueType(0) == N1.getValueType());
448 if (RModW)
449 Load = N10;
450 break;
451 }
452 }
453
454 if (RModW) {
455 MoveBelowTokenFactor(DAG, Load, SDOperand(I, 0), Chain);
456 ++NumLoadMoved;
457 }
458 }
459}
460
461/// InstructionSelectBasicBlock - This callback is invoked by SelectionDAGISel
462/// when it has created a SelectionDAG for us to codegen.
463void X86DAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) {
464 DEBUG(BB->dump());
465 MachineFunction::iterator FirstMBB = BB;
466
467 if (!FastISel)
468 InstructionSelectPreprocess(DAG);
469
470 // Codegen the basic block.
471#ifndef NDEBUG
472 DOUT << "===== Instruction selection begins:\n";
473 Indent = 0;
474#endif
475 DAG.setRoot(SelectRoot(DAG.getRoot()));
476#ifndef NDEBUG
477 DOUT << "===== Instruction selection ends:\n";
478#endif
479
480 DAG.RemoveDeadNodes();
481
482 // Emit machine code to BB.
483 ScheduleAndEmitDAG(DAG);
484
485 // If we are emitting FP stack code, scan the basic block to determine if this
486 // block defines any FP values. If so, put an FP_REG_KILL instruction before
487 // the terminator of the block.
Dale Johannesenc428e0f2007-08-07 20:29:26 +0000488
Dale Johannesen684887e2007-09-24 22:52:39 +0000489 // Note that FP stack instructions are used in all modes for long double,
490 // so we always need to do this check.
491 // Also note that it's possible for an FP stack register to be live across
492 // an instruction that produces multiple basic blocks (SSE CMOV) so we
493 // must check all the generated basic blocks.
Dale Johannesenc428e0f2007-08-07 20:29:26 +0000494
495 // Scan all of the machine instructions in these MBBs, checking for FP
496 // stores. (RFP32 and RFP64 will not exist in SSE mode, but RFP80 might.)
497 MachineFunction::iterator MBBI = FirstMBB;
498 do {
Dale Johannesen684887e2007-09-24 22:52:39 +0000499 bool ContainsFPCode = false;
Dale Johannesenc428e0f2007-08-07 20:29:26 +0000500 for (MachineBasicBlock::iterator I = MBBI->begin(), E = MBBI->end();
501 !ContainsFPCode && I != E; ++I) {
502 if (I->getNumOperands() != 0 && I->getOperand(0).isRegister()) {
503 const TargetRegisterClass *clas;
504 for (unsigned op = 0, e = I->getNumOperands(); op != e; ++op) {
505 if (I->getOperand(op).isRegister() && I->getOperand(op).isDef() &&
506 MRegisterInfo::isVirtualRegister(I->getOperand(op).getReg()) &&
507 ((clas = RegMap->getRegClass(I->getOperand(0).getReg())) ==
508 X86::RFP32RegisterClass ||
509 clas == X86::RFP64RegisterClass ||
510 clas == X86::RFP80RegisterClass)) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000511 ContainsFPCode = true;
512 break;
513 }
514 }
515 }
516 }
Dale Johannesen684887e2007-09-24 22:52:39 +0000517 // Check PHI nodes in successor blocks. These PHI's will be lowered to have
518 // a copy of the input value in this block. In SSE mode, we only care about
519 // 80-bit values.
520 if (!ContainsFPCode) {
521 // Final check, check LLVM BB's that are successors to the LLVM BB
522 // corresponding to BB for FP PHI nodes.
523 const BasicBlock *LLVMBB = BB->getBasicBlock();
524 const PHINode *PN;
525 for (succ_const_iterator SI = succ_begin(LLVMBB), E = succ_end(LLVMBB);
526 !ContainsFPCode && SI != E; ++SI) {
527 for (BasicBlock::const_iterator II = SI->begin();
528 (PN = dyn_cast<PHINode>(II)); ++II) {
529 if (PN->getType()==Type::X86_FP80Ty ||
530 (!Subtarget->hasSSE1() && PN->getType()->isFloatingPoint()) ||
531 (!Subtarget->hasSSE2() && PN->getType()==Type::DoubleTy)) {
532 ContainsFPCode = true;
533 break;
534 }
Dale Johannesenc428e0f2007-08-07 20:29:26 +0000535 }
536 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000537 }
Dale Johannesen684887e2007-09-24 22:52:39 +0000538 // Finally, if we found any FP code, emit the FP_REG_KILL instruction.
539 if (ContainsFPCode) {
540 BuildMI(*MBBI, MBBI->getFirstTerminator(),
541 TM.getInstrInfo()->get(X86::FP_REG_KILL));
542 ++NumFPKill;
543 }
544 } while (&*(MBBI++) != BB);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000545}
546
Anton Korobeynikov34ef31e2007-09-25 21:52:30 +0000547/// EmitSpecialCodeForMain - Emit any code that needs to be executed only in
548/// the main function.
549void X86DAGToDAGISel::EmitSpecialCodeForMain(MachineBasicBlock *BB,
550 MachineFrameInfo *MFI) {
551 const TargetInstrInfo *TII = TM.getInstrInfo();
552 if (Subtarget->isTargetCygMing())
553 BuildMI(BB, TII->get(X86::CALLpcrel32)).addExternalSymbol("__main");
554}
555
556void X86DAGToDAGISel::EmitFunctionEntryCode(Function &Fn, MachineFunction &MF) {
557 // If this is main, emit special code for main.
558 MachineBasicBlock *BB = MF.begin();
559 if (Fn.hasExternalLinkage() && Fn.getName() == "main")
560 EmitSpecialCodeForMain(BB, MF.getFrameInfo());
561}
562
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000563/// MatchAddress - Add the specified node to the specified addressing mode,
564/// returning true if it cannot be done. This just pattern matches for the
Chris Lattner7f06edd2007-12-08 07:22:58 +0000565/// addressing mode.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000566bool X86DAGToDAGISel::MatchAddress(SDOperand N, X86ISelAddressMode &AM,
567 bool isRoot, unsigned Depth) {
Dan Gohmana60c1b32007-08-13 20:03:06 +0000568 // Limit recursion.
569 if (Depth > 5)
570 return MatchAddressBase(N, AM, isRoot, Depth);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000571
572 // RIP relative addressing: %rip + 32-bit displacement!
573 if (AM.isRIPRel) {
574 if (!AM.ES && AM.JT != -1 && N.getOpcode() == ISD::Constant) {
575 int64_t Val = cast<ConstantSDNode>(N)->getSignExtended();
576 if (isInt32(AM.Disp + Val)) {
577 AM.Disp += Val;
578 return false;
579 }
580 }
581 return true;
582 }
583
584 int id = N.Val->getNodeId();
585 bool Available = isSelected(id);
586
587 switch (N.getOpcode()) {
588 default: break;
589 case ISD::Constant: {
590 int64_t Val = cast<ConstantSDNode>(N)->getSignExtended();
591 if (isInt32(AM.Disp + Val)) {
592 AM.Disp += Val;
593 return false;
594 }
595 break;
596 }
597
598 case X86ISD::Wrapper: {
599 bool is64Bit = Subtarget->is64Bit();
600 // Under X86-64 non-small code model, GV (and friends) are 64-bits.
601 if (is64Bit && TM.getCodeModel() != CodeModel::Small)
602 break;
603 if (AM.GV != 0 || AM.CP != 0 || AM.ES != 0 || AM.JT != -1)
604 break;
605 // If value is available in a register both base and index components have
606 // been picked, we can't fit the result available in the register in the
607 // addressing mode. Duplicate GlobalAddress or ConstantPool as displacement.
608 if (!Available || (AM.Base.Reg.Val && AM.IndexReg.Val)) {
609 bool isStatic = TM.getRelocationModel() == Reloc::Static;
610 SDOperand N0 = N.getOperand(0);
Evan Chenga2f7d4e2007-07-26 07:35:15 +0000611 // Mac OS X X86-64 lower 4G address is not available.
Evan Cheng09e13792007-08-01 23:45:51 +0000612 bool isAbs32 = !is64Bit ||
613 (isStatic && Subtarget->hasLow4GUserSpaceAddress());
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000614 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) {
615 GlobalValue *GV = G->getGlobal();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000616 if (isAbs32 || isRoot) {
617 AM.GV = GV;
618 AM.Disp += G->getOffset();
619 AM.isRIPRel = !isAbs32;
620 return false;
621 }
622 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) {
Evan Chenga2f7d4e2007-07-26 07:35:15 +0000623 if (isAbs32 || isRoot) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000624 AM.CP = CP->getConstVal();
625 AM.Align = CP->getAlignment();
626 AM.Disp += CP->getOffset();
Evan Chengeda2f2b2007-07-26 17:02:45 +0000627 AM.isRIPRel = !isAbs32;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000628 return false;
629 }
630 } else if (ExternalSymbolSDNode *S =dyn_cast<ExternalSymbolSDNode>(N0)) {
Evan Chenga2f7d4e2007-07-26 07:35:15 +0000631 if (isAbs32 || isRoot) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000632 AM.ES = S->getSymbol();
Evan Chengeda2f2b2007-07-26 17:02:45 +0000633 AM.isRIPRel = !isAbs32;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000634 return false;
635 }
636 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) {
Evan Chenga2f7d4e2007-07-26 07:35:15 +0000637 if (isAbs32 || isRoot) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000638 AM.JT = J->getIndex();
Evan Chengeda2f2b2007-07-26 17:02:45 +0000639 AM.isRIPRel = !isAbs32;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000640 return false;
641 }
642 }
643 }
644 break;
645 }
646
647 case ISD::FrameIndex:
648 if (AM.BaseType == X86ISelAddressMode::RegBase && AM.Base.Reg.Val == 0) {
649 AM.BaseType = X86ISelAddressMode::FrameIndexBase;
650 AM.Base.FrameIndex = cast<FrameIndexSDNode>(N)->getIndex();
651 return false;
652 }
653 break;
654
655 case ISD::SHL:
Chris Lattner7f06edd2007-12-08 07:22:58 +0000656 if (Available || AM.IndexReg.Val != 0 || AM.Scale != 1)
657 break;
658
659 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1))) {
660 unsigned Val = CN->getValue();
661 if (Val == 1 || Val == 2 || Val == 3) {
662 AM.Scale = 1 << Val;
663 SDOperand ShVal = N.Val->getOperand(0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000664
Chris Lattner7f06edd2007-12-08 07:22:58 +0000665 // Okay, we know that we have a scale by now. However, if the scaled
666 // value is an add of something and a constant, we can fold the
667 // constant into the disp field here.
668 if (ShVal.Val->getOpcode() == ISD::ADD && ShVal.hasOneUse() &&
669 isa<ConstantSDNode>(ShVal.Val->getOperand(1))) {
670 AM.IndexReg = ShVal.Val->getOperand(0);
671 ConstantSDNode *AddVal =
672 cast<ConstantSDNode>(ShVal.Val->getOperand(1));
673 uint64_t Disp = AM.Disp + (AddVal->getValue() << Val);
674 if (isInt32(Disp))
675 AM.Disp = Disp;
676 else
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000677 AM.IndexReg = ShVal;
Chris Lattner7f06edd2007-12-08 07:22:58 +0000678 } else {
679 AM.IndexReg = ShVal;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000680 }
Chris Lattner7f06edd2007-12-08 07:22:58 +0000681 return false;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000682 }
683 break;
Chris Lattner7f06edd2007-12-08 07:22:58 +0000684 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000685
Dan Gohman35b99222007-10-22 20:22:24 +0000686 case ISD::SMUL_LOHI:
687 case ISD::UMUL_LOHI:
688 // A mul_lohi where we need the low part can be folded as a plain multiply.
689 if (N.ResNo != 0) break;
690 // FALL THROUGH
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000691 case ISD::MUL:
692 // X*[3,5,9] -> X+X*[2,4,8]
693 if (!Available &&
694 AM.BaseType == X86ISelAddressMode::RegBase &&
695 AM.Base.Reg.Val == 0 &&
696 AM.IndexReg.Val == 0) {
697 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.Val->getOperand(1)))
698 if (CN->getValue() == 3 || CN->getValue() == 5 || CN->getValue() == 9) {
699 AM.Scale = unsigned(CN->getValue())-1;
700
701 SDOperand MulVal = N.Val->getOperand(0);
702 SDOperand Reg;
703
704 // Okay, we know that we have a scale by now. However, if the scaled
705 // value is an add of something and a constant, we can fold the
706 // constant into the disp field here.
707 if (MulVal.Val->getOpcode() == ISD::ADD && MulVal.hasOneUse() &&
708 isa<ConstantSDNode>(MulVal.Val->getOperand(1))) {
709 Reg = MulVal.Val->getOperand(0);
710 ConstantSDNode *AddVal =
711 cast<ConstantSDNode>(MulVal.Val->getOperand(1));
712 uint64_t Disp = AM.Disp + AddVal->getValue() * CN->getValue();
713 if (isInt32(Disp))
714 AM.Disp = Disp;
715 else
716 Reg = N.Val->getOperand(0);
717 } else {
718 Reg = N.Val->getOperand(0);
719 }
720
721 AM.IndexReg = AM.Base.Reg = Reg;
722 return false;
723 }
724 }
725 break;
726
727 case ISD::ADD:
728 if (!Available) {
729 X86ISelAddressMode Backup = AM;
730 if (!MatchAddress(N.Val->getOperand(0), AM, false, Depth+1) &&
731 !MatchAddress(N.Val->getOperand(1), AM, false, Depth+1))
732 return false;
733 AM = Backup;
734 if (!MatchAddress(N.Val->getOperand(1), AM, false, Depth+1) &&
735 !MatchAddress(N.Val->getOperand(0), AM, false, Depth+1))
736 return false;
737 AM = Backup;
738 }
739 break;
740
741 case ISD::OR:
742 // Handle "X | C" as "X + C" iff X is known to have C bits clear.
Chris Lattner7f06edd2007-12-08 07:22:58 +0000743 if (Available) break;
744
745 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
746 X86ISelAddressMode Backup = AM;
747 // Start with the LHS as an addr mode.
748 if (!MatchAddress(N.getOperand(0), AM, false) &&
749 // Address could not have picked a GV address for the displacement.
750 AM.GV == NULL &&
751 // On x86-64, the resultant disp must fit in 32-bits.
752 isInt32(AM.Disp + CN->getSignExtended()) &&
753 // Check to see if the LHS & C is zero.
754 CurDAG->MaskedValueIsZero(N.getOperand(0), CN->getValue())) {
755 AM.Disp += CN->getValue();
756 return false;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000757 }
Chris Lattner7f06edd2007-12-08 07:22:58 +0000758 AM = Backup;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000759 }
760 break;
761 }
762
Dan Gohmana60c1b32007-08-13 20:03:06 +0000763 return MatchAddressBase(N, AM, isRoot, Depth);
764}
765
766/// MatchAddressBase - Helper for MatchAddress. Add the specified node to the
767/// specified addressing mode without any further recursion.
768bool X86DAGToDAGISel::MatchAddressBase(SDOperand N, X86ISelAddressMode &AM,
769 bool isRoot, unsigned Depth) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000770 // Is the base register already occupied?
771 if (AM.BaseType != X86ISelAddressMode::RegBase || AM.Base.Reg.Val) {
772 // If so, check to see if the scale index register is set.
773 if (AM.IndexReg.Val == 0) {
774 AM.IndexReg = N;
775 AM.Scale = 1;
776 return false;
777 }
778
779 // Otherwise, we cannot select it.
780 return true;
781 }
782
783 // Default, generate it as a register.
784 AM.BaseType = X86ISelAddressMode::RegBase;
785 AM.Base.Reg = N;
786 return false;
787}
788
789/// SelectAddr - returns true if it is able pattern match an addressing mode.
790/// It returns the operands which make up the maximal addressing mode it can
791/// match by reference.
792bool X86DAGToDAGISel::SelectAddr(SDOperand Op, SDOperand N, SDOperand &Base,
793 SDOperand &Scale, SDOperand &Index,
794 SDOperand &Disp) {
795 X86ISelAddressMode AM;
796 if (MatchAddress(N, AM))
797 return false;
798
799 MVT::ValueType VT = N.getValueType();
800 if (AM.BaseType == X86ISelAddressMode::RegBase) {
801 if (!AM.Base.Reg.Val)
802 AM.Base.Reg = CurDAG->getRegister(0, VT);
803 }
804
805 if (!AM.IndexReg.Val)
806 AM.IndexReg = CurDAG->getRegister(0, VT);
807
808 getAddressOperands(AM, Base, Scale, Index, Disp);
809 return true;
810}
811
812/// isZeroNode - Returns true if Elt is a constant zero or a floating point
813/// constant +0.0.
814static inline bool isZeroNode(SDOperand Elt) {
815 return ((isa<ConstantSDNode>(Elt) &&
816 cast<ConstantSDNode>(Elt)->getValue() == 0) ||
817 (isa<ConstantFPSDNode>(Elt) &&
Dale Johannesendf8a8312007-08-31 04:03:46 +0000818 cast<ConstantFPSDNode>(Elt)->getValueAPF().isPosZero()));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000819}
820
821
822/// SelectScalarSSELoad - Match a scalar SSE load. In particular, we want to
823/// match a load whose top elements are either undef or zeros. The load flavor
824/// is derived from the type of N, which is either v4f32 or v2f64.
825bool X86DAGToDAGISel::SelectScalarSSELoad(SDOperand Op, SDOperand Pred,
826 SDOperand N, SDOperand &Base,
827 SDOperand &Scale, SDOperand &Index,
828 SDOperand &Disp, SDOperand &InChain,
829 SDOperand &OutChain) {
830 if (N.getOpcode() == ISD::SCALAR_TO_VECTOR) {
831 InChain = N.getOperand(0).getValue(1);
832 if (ISD::isNON_EXTLoad(InChain.Val) &&
833 InChain.getValue(0).hasOneUse() &&
834 N.hasOneUse() &&
835 CanBeFoldedBy(N.Val, Pred.Val, Op.Val)) {
836 LoadSDNode *LD = cast<LoadSDNode>(InChain);
837 if (!SelectAddr(Op, LD->getBasePtr(), Base, Scale, Index, Disp))
838 return false;
839 OutChain = LD->getChain();
840 return true;
841 }
842 }
843
844 // Also handle the case where we explicitly require zeros in the top
845 // elements. This is a vector shuffle from the zero vector.
846 if (N.getOpcode() == ISD::VECTOR_SHUFFLE && N.Val->hasOneUse() &&
Chris Lattnere6aa3862007-11-25 00:24:49 +0000847 // Check to see if the top elements are all zeros (or bitcast of zeros).
848 ISD::isBuildVectorAllZeros(N.getOperand(0).Val) &&
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000849 N.getOperand(1).getOpcode() == ISD::SCALAR_TO_VECTOR &&
850 N.getOperand(1).Val->hasOneUse() &&
851 ISD::isNON_EXTLoad(N.getOperand(1).getOperand(0).Val) &&
852 N.getOperand(1).getOperand(0).hasOneUse()) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000853 // Check to see if the shuffle mask is 4/L/L/L or 2/L, where L is something
854 // from the LHS.
Chris Lattnere6aa3862007-11-25 00:24:49 +0000855 unsigned VecWidth=MVT::getVectorNumElements(N.getOperand(0).getValueType());
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000856 SDOperand ShufMask = N.getOperand(2);
857 assert(ShufMask.getOpcode() == ISD::BUILD_VECTOR && "Invalid shuf mask!");
858 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(ShufMask.getOperand(0))) {
859 if (C->getValue() == VecWidth) {
860 for (unsigned i = 1; i != VecWidth; ++i) {
861 if (ShufMask.getOperand(i).getOpcode() == ISD::UNDEF) {
862 // ok.
863 } else {
864 ConstantSDNode *C = cast<ConstantSDNode>(ShufMask.getOperand(i));
865 if (C->getValue() >= VecWidth) return false;
866 }
867 }
868 }
869
870 // Okay, this is a zero extending load. Fold it.
871 LoadSDNode *LD = cast<LoadSDNode>(N.getOperand(1).getOperand(0));
872 if (!SelectAddr(Op, LD->getBasePtr(), Base, Scale, Index, Disp))
873 return false;
874 OutChain = LD->getChain();
875 InChain = SDOperand(LD, 1);
876 return true;
877 }
878 }
879 return false;
880}
881
882
883/// SelectLEAAddr - it calls SelectAddr and determines if the maximal addressing
884/// mode it matches can be cost effectively emitted as an LEA instruction.
885bool X86DAGToDAGISel::SelectLEAAddr(SDOperand Op, SDOperand N,
886 SDOperand &Base, SDOperand &Scale,
887 SDOperand &Index, SDOperand &Disp) {
888 X86ISelAddressMode AM;
889 if (MatchAddress(N, AM))
890 return false;
891
892 MVT::ValueType VT = N.getValueType();
893 unsigned Complexity = 0;
894 if (AM.BaseType == X86ISelAddressMode::RegBase)
895 if (AM.Base.Reg.Val)
896 Complexity = 1;
897 else
898 AM.Base.Reg = CurDAG->getRegister(0, VT);
899 else if (AM.BaseType == X86ISelAddressMode::FrameIndexBase)
900 Complexity = 4;
901
902 if (AM.IndexReg.Val)
903 Complexity++;
904 else
905 AM.IndexReg = CurDAG->getRegister(0, VT);
906
907 // Don't match just leal(,%reg,2). It's cheaper to do addl %reg, %reg, or with
908 // a simple shift.
909 if (AM.Scale > 1)
910 Complexity++;
911
912 // FIXME: We are artificially lowering the criteria to turn ADD %reg, $GA
913 // to a LEA. This is determined with some expermentation but is by no means
914 // optimal (especially for code size consideration). LEA is nice because of
915 // its three-address nature. Tweak the cost function again when we can run
916 // convertToThreeAddress() at register allocation time.
917 if (AM.GV || AM.CP || AM.ES || AM.JT != -1) {
918 // For X86-64, we should always use lea to materialize RIP relative
919 // addresses.
920 if (Subtarget->is64Bit())
921 Complexity = 4;
922 else
923 Complexity += 2;
924 }
925
926 if (AM.Disp && (AM.Base.Reg.Val || AM.IndexReg.Val))
927 Complexity++;
928
929 if (Complexity > 2) {
930 getAddressOperands(AM, Base, Scale, Index, Disp);
931 return true;
932 }
933 return false;
934}
935
936bool X86DAGToDAGISel::TryFoldLoad(SDOperand P, SDOperand N,
937 SDOperand &Base, SDOperand &Scale,
938 SDOperand &Index, SDOperand &Disp) {
939 if (ISD::isNON_EXTLoad(N.Val) &&
940 N.hasOneUse() &&
941 CanBeFoldedBy(N.Val, P.Val, P.Val))
942 return SelectAddr(P, N.getOperand(1), Base, Scale, Index, Disp);
943 return false;
944}
945
946/// getGlobalBaseReg - Output the instructions required to put the
947/// base address to use for accessing globals into a register.
948///
949SDNode *X86DAGToDAGISel::getGlobalBaseReg() {
950 assert(!Subtarget->is64Bit() && "X86-64 PIC uses RIP relative addressing");
951 if (!GlobalBaseReg) {
952 // Insert the set of GlobalBaseReg into the first MBB of the function
953 MachineBasicBlock &FirstMBB = BB->getParent()->front();
954 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
955 SSARegMap *RegMap = BB->getParent()->getSSARegMap();
956 unsigned PC = RegMap->createVirtualRegister(X86::GR32RegisterClass);
957
958 const TargetInstrInfo *TII = TM.getInstrInfo();
959 BuildMI(FirstMBB, MBBI, TII->get(X86::MovePCtoStack));
960 BuildMI(FirstMBB, MBBI, TII->get(X86::POP32r), PC);
961
962 // If we're using vanilla 'GOT' PIC style, we should use relative addressing
963 // not to pc, but to _GLOBAL_ADDRESS_TABLE_ external
964 if (TM.getRelocationModel() == Reloc::PIC_ &&
965 Subtarget->isPICStyleGOT()) {
966 GlobalBaseReg = RegMap->createVirtualRegister(X86::GR32RegisterClass);
967 BuildMI(FirstMBB, MBBI, TII->get(X86::ADD32ri), GlobalBaseReg).
968 addReg(PC).
969 addExternalSymbol("_GLOBAL_OFFSET_TABLE_");
970 } else {
971 GlobalBaseReg = PC;
972 }
973
974 }
975 return CurDAG->getRegister(GlobalBaseReg, TLI.getPointerTy()).Val;
976}
977
978static SDNode *FindCallStartFromCall(SDNode *Node) {
979 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
980 assert(Node->getOperand(0).getValueType() == MVT::Other &&
981 "Node doesn't have a token chain argument!");
982 return FindCallStartFromCall(Node->getOperand(0).Val);
983}
984
Christopher Lamb0a7c8662007-08-10 21:48:46 +0000985SDNode *X86DAGToDAGISel::getTruncate(SDOperand N0, MVT::ValueType VT) {
986 SDOperand SRIdx;
987 switch (VT) {
988 case MVT::i8:
989 SRIdx = CurDAG->getTargetConstant(1, MVT::i32); // SubRegSet 1
990 // Ensure that the source register has an 8-bit subreg on 32-bit targets
991 if (!Subtarget->is64Bit()) {
992 unsigned Opc;
993 MVT::ValueType VT;
994 switch (N0.getValueType()) {
995 default: assert(0 && "Unknown truncate!");
996 case MVT::i16:
997 Opc = X86::MOV16to16_;
998 VT = MVT::i16;
999 break;
1000 case MVT::i32:
1001 Opc = X86::MOV32to32_;
1002 VT = MVT::i32;
1003 break;
1004 }
Evan Chenge1f39552007-10-12 07:55:53 +00001005 N0 = SDOperand(CurDAG->getTargetNode(Opc, VT, MVT::Flag, N0), 0);
1006 return CurDAG->getTargetNode(X86::EXTRACT_SUBREG,
1007 VT, N0, SRIdx, N0.getValue(1));
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001008 }
1009 break;
1010 case MVT::i16:
1011 SRIdx = CurDAG->getTargetConstant(2, MVT::i32); // SubRegSet 2
1012 break;
1013 case MVT::i32:
1014 SRIdx = CurDAG->getTargetConstant(3, MVT::i32); // SubRegSet 3
1015 break;
Evan Chenge1f39552007-10-12 07:55:53 +00001016 default: assert(0 && "Unknown truncate!"); break;
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001017 }
Evan Chenge1f39552007-10-12 07:55:53 +00001018 return CurDAG->getTargetNode(X86::EXTRACT_SUBREG, VT, N0, SRIdx);
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001019}
1020
1021
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001022SDNode *X86DAGToDAGISel::Select(SDOperand N) {
1023 SDNode *Node = N.Val;
1024 MVT::ValueType NVT = Node->getValueType(0);
1025 unsigned Opc, MOpc;
1026 unsigned Opcode = Node->getOpcode();
1027
1028#ifndef NDEBUG
1029 DOUT << std::string(Indent, ' ') << "Selecting: ";
1030 DEBUG(Node->dump(CurDAG));
1031 DOUT << "\n";
1032 Indent += 2;
1033#endif
1034
1035 if (Opcode >= ISD::BUILTIN_OP_END && Opcode < X86ISD::FIRST_NUMBER) {
1036#ifndef NDEBUG
1037 DOUT << std::string(Indent-2, ' ') << "== ";
1038 DEBUG(Node->dump(CurDAG));
1039 DOUT << "\n";
1040 Indent -= 2;
1041#endif
1042 return NULL; // Already selected.
1043 }
1044
1045 switch (Opcode) {
1046 default: break;
1047 case X86ISD::GlobalBaseReg:
1048 return getGlobalBaseReg();
1049
1050 case ISD::ADD: {
1051 // Turn ADD X, c to MOV32ri X+c. This cannot be done with tblgen'd
1052 // code and is matched first so to prevent it from being turned into
1053 // LEA32r X+c.
1054 // In 64-bit mode, use LEA to take advantage of RIP-relative addressing.
1055 MVT::ValueType PtrVT = TLI.getPointerTy();
1056 SDOperand N0 = N.getOperand(0);
1057 SDOperand N1 = N.getOperand(1);
1058 if (N.Val->getValueType(0) == PtrVT &&
1059 N0.getOpcode() == X86ISD::Wrapper &&
1060 N1.getOpcode() == ISD::Constant) {
1061 unsigned Offset = (unsigned)cast<ConstantSDNode>(N1)->getValue();
1062 SDOperand C(0, 0);
1063 // TODO: handle ExternalSymbolSDNode.
1064 if (GlobalAddressSDNode *G =
1065 dyn_cast<GlobalAddressSDNode>(N0.getOperand(0))) {
1066 C = CurDAG->getTargetGlobalAddress(G->getGlobal(), PtrVT,
1067 G->getOffset() + Offset);
1068 } else if (ConstantPoolSDNode *CP =
1069 dyn_cast<ConstantPoolSDNode>(N0.getOperand(0))) {
1070 C = CurDAG->getTargetConstantPool(CP->getConstVal(), PtrVT,
1071 CP->getAlignment(),
1072 CP->getOffset()+Offset);
1073 }
1074
1075 if (C.Val) {
1076 if (Subtarget->is64Bit()) {
1077 SDOperand Ops[] = { CurDAG->getRegister(0, PtrVT), getI8Imm(1),
1078 CurDAG->getRegister(0, PtrVT), C };
1079 return CurDAG->SelectNodeTo(N.Val, X86::LEA64r, MVT::i64, Ops, 4);
1080 } else
1081 return CurDAG->SelectNodeTo(N.Val, X86::MOV32ri, PtrVT, C);
1082 }
1083 }
1084
1085 // Other cases are handled by auto-generated code.
1086 break;
1087 }
1088
Dan Gohman5a199552007-10-08 18:33:35 +00001089 case ISD::SMUL_LOHI:
1090 case ISD::UMUL_LOHI: {
1091 SDOperand N0 = Node->getOperand(0);
1092 SDOperand N1 = Node->getOperand(1);
1093
Dan Gohmana5685ba2007-10-09 15:44:37 +00001094 // There are several forms of IMUL that just return the low part and
1095 // don't have fixed-register operands. If we don't need the high part,
1096 // use these instead. They can be selected with the generated ISel code.
Dan Gohman5a199552007-10-08 18:33:35 +00001097 if (NVT != MVT::i8 &&
1098 N.getValue(1).use_empty()) {
1099 N = CurDAG->getNode(ISD::MUL, NVT, N0, N1);
1100 break;
1101 }
1102
1103 bool isSigned = Opcode == ISD::SMUL_LOHI;
1104 if (!isSigned)
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001105 switch (NVT) {
1106 default: assert(0 && "Unsupported VT!");
1107 case MVT::i8: Opc = X86::MUL8r; MOpc = X86::MUL8m; break;
1108 case MVT::i16: Opc = X86::MUL16r; MOpc = X86::MUL16m; break;
1109 case MVT::i32: Opc = X86::MUL32r; MOpc = X86::MUL32m; break;
1110 case MVT::i64: Opc = X86::MUL64r; MOpc = X86::MUL64m; break;
1111 }
1112 else
1113 switch (NVT) {
1114 default: assert(0 && "Unsupported VT!");
1115 case MVT::i8: Opc = X86::IMUL8r; MOpc = X86::IMUL8m; break;
1116 case MVT::i16: Opc = X86::IMUL16r; MOpc = X86::IMUL16m; break;
1117 case MVT::i32: Opc = X86::IMUL32r; MOpc = X86::IMUL32m; break;
1118 case MVT::i64: Opc = X86::IMUL64r; MOpc = X86::IMUL64m; break;
1119 }
1120
1121 unsigned LoReg, HiReg;
1122 switch (NVT) {
1123 default: assert(0 && "Unsupported VT!");
1124 case MVT::i8: LoReg = X86::AL; HiReg = X86::AH; break;
1125 case MVT::i16: LoReg = X86::AX; HiReg = X86::DX; break;
1126 case MVT::i32: LoReg = X86::EAX; HiReg = X86::EDX; break;
1127 case MVT::i64: LoReg = X86::RAX; HiReg = X86::RDX; break;
1128 }
1129
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001130 SDOperand Tmp0, Tmp1, Tmp2, Tmp3;
Evan Cheng508fe8b2007-08-02 05:48:35 +00001131 bool foldedLoad = TryFoldLoad(N, N1, Tmp0, Tmp1, Tmp2, Tmp3);
Dan Gohman5a199552007-10-08 18:33:35 +00001132 // multiplty is commmutative
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001133 if (!foldedLoad) {
1134 foldedLoad = TryFoldLoad(N, N0, Tmp0, Tmp1, Tmp2, Tmp3);
Evan Cheng508fe8b2007-08-02 05:48:35 +00001135 if (foldedLoad)
1136 std::swap(N0, N1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001137 }
1138
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001139 AddToISelQueue(N0);
Dan Gohman5a199552007-10-08 18:33:35 +00001140 SDOperand InFlag = CurDAG->getCopyToReg(CurDAG->getEntryNode(), LoReg,
1141 N0, SDOperand()).getValue(1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001142
1143 if (foldedLoad) {
Dan Gohman5a199552007-10-08 18:33:35 +00001144 AddToISelQueue(N1.getOperand(0));
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001145 AddToISelQueue(Tmp0);
1146 AddToISelQueue(Tmp1);
1147 AddToISelQueue(Tmp2);
1148 AddToISelQueue(Tmp3);
Dan Gohman5a199552007-10-08 18:33:35 +00001149 SDOperand Ops[] = { Tmp0, Tmp1, Tmp2, Tmp3, N1.getOperand(0), InFlag };
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001150 SDNode *CNode =
1151 CurDAG->getTargetNode(MOpc, MVT::Other, MVT::Flag, Ops, 6);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001152 InFlag = SDOperand(CNode, 1);
Dan Gohman5a199552007-10-08 18:33:35 +00001153 // Update the chain.
1154 ReplaceUses(N1.getValue(1), SDOperand(CNode, 0));
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001155 } else {
1156 AddToISelQueue(N1);
1157 InFlag =
1158 SDOperand(CurDAG->getTargetNode(Opc, MVT::Flag, N1, InFlag), 0);
1159 }
1160
Dan Gohman5a199552007-10-08 18:33:35 +00001161 // Copy the low half of the result, if it is needed.
1162 if (!N.getValue(0).use_empty()) {
1163 SDOperand Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(),
1164 LoReg, NVT, InFlag);
1165 InFlag = Result.getValue(2);
1166 ReplaceUses(N.getValue(0), Result);
1167#ifndef NDEBUG
1168 DOUT << std::string(Indent-2, ' ') << "=> ";
1169 DEBUG(Result.Val->dump(CurDAG));
1170 DOUT << "\n";
1171#endif
Evan Cheng6f0f0dd2007-08-09 21:59:35 +00001172 }
Dan Gohman5a199552007-10-08 18:33:35 +00001173 // Copy the high half of the result, if it is needed.
1174 if (!N.getValue(1).use_empty()) {
1175 SDOperand Result;
1176 if (HiReg == X86::AH && Subtarget->is64Bit()) {
1177 // Prevent use of AH in a REX instruction by referencing AX instead.
1178 // Shift it down 8 bits.
1179 Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(),
1180 X86::AX, MVT::i16, InFlag);
1181 InFlag = Result.getValue(2);
1182 Result = SDOperand(CurDAG->getTargetNode(X86::SHR16ri, MVT::i16, Result,
1183 CurDAG->getTargetConstant(8, MVT::i8)), 0);
1184 // Then truncate it down to i8.
1185 SDOperand SRIdx = CurDAG->getTargetConstant(1, MVT::i32); // SubRegSet 1
1186 Result = SDOperand(CurDAG->getTargetNode(X86::EXTRACT_SUBREG,
1187 MVT::i8, Result, SRIdx), 0);
1188 } else {
1189 Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(),
1190 HiReg, NVT, InFlag);
1191 InFlag = Result.getValue(2);
1192 }
1193 ReplaceUses(N.getValue(1), Result);
1194#ifndef NDEBUG
1195 DOUT << std::string(Indent-2, ' ') << "=> ";
1196 DEBUG(Result.Val->dump(CurDAG));
1197 DOUT << "\n";
1198#endif
1199 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001200
1201#ifndef NDEBUG
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001202 Indent -= 2;
1203#endif
Dan Gohman5a199552007-10-08 18:33:35 +00001204
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001205 return NULL;
1206 }
1207
Dan Gohman5a199552007-10-08 18:33:35 +00001208 case ISD::SDIVREM:
1209 case ISD::UDIVREM: {
1210 SDOperand N0 = Node->getOperand(0);
1211 SDOperand N1 = Node->getOperand(1);
1212
1213 bool isSigned = Opcode == ISD::SDIVREM;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001214 if (!isSigned)
1215 switch (NVT) {
1216 default: assert(0 && "Unsupported VT!");
1217 case MVT::i8: Opc = X86::DIV8r; MOpc = X86::DIV8m; break;
1218 case MVT::i16: Opc = X86::DIV16r; MOpc = X86::DIV16m; break;
1219 case MVT::i32: Opc = X86::DIV32r; MOpc = X86::DIV32m; break;
1220 case MVT::i64: Opc = X86::DIV64r; MOpc = X86::DIV64m; break;
1221 }
1222 else
1223 switch (NVT) {
1224 default: assert(0 && "Unsupported VT!");
1225 case MVT::i8: Opc = X86::IDIV8r; MOpc = X86::IDIV8m; break;
1226 case MVT::i16: Opc = X86::IDIV16r; MOpc = X86::IDIV16m; break;
1227 case MVT::i32: Opc = X86::IDIV32r; MOpc = X86::IDIV32m; break;
1228 case MVT::i64: Opc = X86::IDIV64r; MOpc = X86::IDIV64m; break;
1229 }
1230
1231 unsigned LoReg, HiReg;
1232 unsigned ClrOpcode, SExtOpcode;
1233 switch (NVT) {
1234 default: assert(0 && "Unsupported VT!");
1235 case MVT::i8:
1236 LoReg = X86::AL; HiReg = X86::AH;
1237 ClrOpcode = 0;
1238 SExtOpcode = X86::CBW;
1239 break;
1240 case MVT::i16:
1241 LoReg = X86::AX; HiReg = X86::DX;
1242 ClrOpcode = X86::MOV16r0;
1243 SExtOpcode = X86::CWD;
1244 break;
1245 case MVT::i32:
1246 LoReg = X86::EAX; HiReg = X86::EDX;
1247 ClrOpcode = X86::MOV32r0;
1248 SExtOpcode = X86::CDQ;
1249 break;
1250 case MVT::i64:
1251 LoReg = X86::RAX; HiReg = X86::RDX;
1252 ClrOpcode = X86::MOV64r0;
1253 SExtOpcode = X86::CQO;
1254 break;
1255 }
1256
Dan Gohman5a199552007-10-08 18:33:35 +00001257 SDOperand Tmp0, Tmp1, Tmp2, Tmp3;
1258 bool foldedLoad = TryFoldLoad(N, N1, Tmp0, Tmp1, Tmp2, Tmp3);
1259
1260 SDOperand InFlag;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001261 if (NVT == MVT::i8 && !isSigned) {
1262 // Special case for div8, just use a move with zero extension to AX to
1263 // clear the upper 8 bits (AH).
1264 SDOperand Tmp0, Tmp1, Tmp2, Tmp3, Move, Chain;
1265 if (TryFoldLoad(N, N0, Tmp0, Tmp1, Tmp2, Tmp3)) {
1266 SDOperand Ops[] = { Tmp0, Tmp1, Tmp2, Tmp3, N0.getOperand(0) };
1267 AddToISelQueue(N0.getOperand(0));
1268 AddToISelQueue(Tmp0);
1269 AddToISelQueue(Tmp1);
1270 AddToISelQueue(Tmp2);
1271 AddToISelQueue(Tmp3);
1272 Move =
1273 SDOperand(CurDAG->getTargetNode(X86::MOVZX16rm8, MVT::i16, MVT::Other,
1274 Ops, 5), 0);
1275 Chain = Move.getValue(1);
1276 ReplaceUses(N0.getValue(1), Chain);
1277 } else {
1278 AddToISelQueue(N0);
1279 Move =
1280 SDOperand(CurDAG->getTargetNode(X86::MOVZX16rr8, MVT::i16, N0), 0);
1281 Chain = CurDAG->getEntryNode();
1282 }
Dan Gohman5a199552007-10-08 18:33:35 +00001283 Chain = CurDAG->getCopyToReg(Chain, X86::AX, Move, SDOperand());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001284 InFlag = Chain.getValue(1);
1285 } else {
1286 AddToISelQueue(N0);
1287 InFlag =
Dan Gohman5a199552007-10-08 18:33:35 +00001288 CurDAG->getCopyToReg(CurDAG->getEntryNode(),
1289 LoReg, N0, SDOperand()).getValue(1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001290 if (isSigned) {
1291 // Sign extend the low part into the high part.
1292 InFlag =
1293 SDOperand(CurDAG->getTargetNode(SExtOpcode, MVT::Flag, InFlag), 0);
1294 } else {
1295 // Zero out the high part, effectively zero extending the input.
1296 SDOperand ClrNode = SDOperand(CurDAG->getTargetNode(ClrOpcode, NVT), 0);
Dan Gohman5a199552007-10-08 18:33:35 +00001297 InFlag = CurDAG->getCopyToReg(CurDAG->getEntryNode(), HiReg,
1298 ClrNode, InFlag).getValue(1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001299 }
1300 }
1301
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001302 if (foldedLoad) {
1303 AddToISelQueue(N1.getOperand(0));
1304 AddToISelQueue(Tmp0);
1305 AddToISelQueue(Tmp1);
1306 AddToISelQueue(Tmp2);
1307 AddToISelQueue(Tmp3);
1308 SDOperand Ops[] = { Tmp0, Tmp1, Tmp2, Tmp3, N1.getOperand(0), InFlag };
1309 SDNode *CNode =
1310 CurDAG->getTargetNode(MOpc, MVT::Other, MVT::Flag, Ops, 6);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001311 InFlag = SDOperand(CNode, 1);
Dan Gohman5a199552007-10-08 18:33:35 +00001312 // Update the chain.
1313 ReplaceUses(N1.getValue(1), SDOperand(CNode, 0));
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001314 } else {
1315 AddToISelQueue(N1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001316 InFlag =
1317 SDOperand(CurDAG->getTargetNode(Opc, MVT::Flag, N1, InFlag), 0);
1318 }
1319
Dan Gohman242a5ba2007-09-25 18:23:27 +00001320 // Copy the division (low) result, if it is needed.
1321 if (!N.getValue(0).use_empty()) {
Dan Gohman5a199552007-10-08 18:33:35 +00001322 SDOperand Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(),
1323 LoReg, NVT, InFlag);
Dan Gohman242a5ba2007-09-25 18:23:27 +00001324 InFlag = Result.getValue(2);
1325 ReplaceUses(N.getValue(0), Result);
1326#ifndef NDEBUG
1327 DOUT << std::string(Indent-2, ' ') << "=> ";
1328 DEBUG(Result.Val->dump(CurDAG));
1329 DOUT << "\n";
1330#endif
Evan Cheng6f0f0dd2007-08-09 21:59:35 +00001331 }
Dan Gohman242a5ba2007-09-25 18:23:27 +00001332 // Copy the remainder (high) result, if it is needed.
1333 if (!N.getValue(1).use_empty()) {
1334 SDOperand Result;
1335 if (HiReg == X86::AH && Subtarget->is64Bit()) {
1336 // Prevent use of AH in a REX instruction by referencing AX instead.
1337 // Shift it down 8 bits.
Dan Gohman5a199552007-10-08 18:33:35 +00001338 Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(),
1339 X86::AX, MVT::i16, InFlag);
Dan Gohman242a5ba2007-09-25 18:23:27 +00001340 InFlag = Result.getValue(2);
1341 Result = SDOperand(CurDAG->getTargetNode(X86::SHR16ri, MVT::i16, Result,
1342 CurDAG->getTargetConstant(8, MVT::i8)), 0);
1343 // Then truncate it down to i8.
1344 SDOperand SRIdx = CurDAG->getTargetConstant(1, MVT::i32); // SubRegSet 1
1345 Result = SDOperand(CurDAG->getTargetNode(X86::EXTRACT_SUBREG,
1346 MVT::i8, Result, SRIdx), 0);
1347 } else {
Dan Gohman5a199552007-10-08 18:33:35 +00001348 Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(),
1349 HiReg, NVT, InFlag);
Dan Gohman242a5ba2007-09-25 18:23:27 +00001350 InFlag = Result.getValue(2);
1351 }
1352 ReplaceUses(N.getValue(1), Result);
1353#ifndef NDEBUG
1354 DOUT << std::string(Indent-2, ' ') << "=> ";
1355 DEBUG(Result.Val->dump(CurDAG));
1356 DOUT << "\n";
1357#endif
1358 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001359
1360#ifndef NDEBUG
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001361 Indent -= 2;
1362#endif
1363
1364 return NULL;
1365 }
Christopher Lamb422213d2007-08-10 22:22:41 +00001366
1367 case ISD::ANY_EXTEND: {
1368 SDOperand N0 = Node->getOperand(0);
1369 AddToISelQueue(N0);
1370 if (NVT == MVT::i64 || NVT == MVT::i32 || NVT == MVT::i16) {
1371 SDOperand SRIdx;
1372 switch(N0.getValueType()) {
1373 case MVT::i32:
1374 SRIdx = CurDAG->getTargetConstant(3, MVT::i32); // SubRegSet 3
1375 break;
1376 case MVT::i16:
1377 SRIdx = CurDAG->getTargetConstant(2, MVT::i32); // SubRegSet 2
1378 break;
1379 case MVT::i8:
1380 if (Subtarget->is64Bit())
1381 SRIdx = CurDAG->getTargetConstant(1, MVT::i32); // SubRegSet 1
1382 break;
1383 default: assert(0 && "Unknown any_extend!");
1384 }
1385 if (SRIdx.Val) {
Evan Chenge1f39552007-10-12 07:55:53 +00001386 SDNode *ResNode = CurDAG->getTargetNode(X86::INSERT_SUBREG,
1387 NVT, N0, SRIdx);
Christopher Lamb422213d2007-08-10 22:22:41 +00001388
1389#ifndef NDEBUG
1390 DOUT << std::string(Indent-2, ' ') << "=> ";
1391 DEBUG(ResNode->dump(CurDAG));
1392 DOUT << "\n";
1393 Indent -= 2;
1394#endif
1395 return ResNode;
1396 } // Otherwise let generated ISel handle it.
1397 }
1398 break;
1399 }
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001400
1401 case ISD::SIGN_EXTEND_INREG: {
1402 SDOperand N0 = Node->getOperand(0);
1403 AddToISelQueue(N0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001404
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001405 MVT::ValueType SVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
1406 SDOperand TruncOp = SDOperand(getTruncate(N0, SVT), 0);
Bill Wendling79bb1a22007-11-01 08:51:44 +00001407 unsigned Opc = 0;
Christopher Lamb444336c2007-07-29 01:24:57 +00001408 switch (NVT) {
Christopher Lamb444336c2007-07-29 01:24:57 +00001409 case MVT::i16:
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001410 if (SVT == MVT::i8) Opc = X86::MOVSX16rr8;
1411 else assert(0 && "Unknown sign_extend_inreg!");
Christopher Lamb444336c2007-07-29 01:24:57 +00001412 break;
1413 case MVT::i32:
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001414 switch (SVT) {
1415 case MVT::i8: Opc = X86::MOVSX32rr8; break;
1416 case MVT::i16: Opc = X86::MOVSX32rr16; break;
1417 default: assert(0 && "Unknown sign_extend_inreg!");
1418 }
Christopher Lamb444336c2007-07-29 01:24:57 +00001419 break;
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001420 case MVT::i64:
1421 switch (SVT) {
1422 case MVT::i8: Opc = X86::MOVSX64rr8; break;
1423 case MVT::i16: Opc = X86::MOVSX64rr16; break;
1424 case MVT::i32: Opc = X86::MOVSX64rr32; break;
1425 default: assert(0 && "Unknown sign_extend_inreg!");
1426 }
1427 break;
1428 default: assert(0 && "Unknown sign_extend_inreg!");
Christopher Lamb444336c2007-07-29 01:24:57 +00001429 }
Christopher Lamb0a7c8662007-08-10 21:48:46 +00001430
1431 SDNode *ResNode = CurDAG->getTargetNode(Opc, NVT, TruncOp);
1432
1433#ifndef NDEBUG
1434 DOUT << std::string(Indent-2, ' ') << "=> ";
1435 DEBUG(TruncOp.Val->dump(CurDAG));
1436 DOUT << "\n";
1437 DOUT << std::string(Indent-2, ' ') << "=> ";
1438 DEBUG(ResNode->dump(CurDAG));
1439 DOUT << "\n";
1440 Indent -= 2;
1441#endif
1442 return ResNode;
1443 break;
1444 }
1445
1446 case ISD::TRUNCATE: {
1447 SDOperand Input = Node->getOperand(0);
1448 AddToISelQueue(Node->getOperand(0));
1449 SDNode *ResNode = getTruncate(Input, NVT);
1450
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001451#ifndef NDEBUG
1452 DOUT << std::string(Indent-2, ' ') << "=> ";
1453 DEBUG(ResNode->dump(CurDAG));
1454 DOUT << "\n";
1455 Indent -= 2;
1456#endif
Christopher Lamb444336c2007-07-29 01:24:57 +00001457 return ResNode;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001458 break;
1459 }
1460 }
1461
1462 SDNode *ResNode = SelectCode(N);
1463
1464#ifndef NDEBUG
1465 DOUT << std::string(Indent-2, ' ') << "=> ";
1466 if (ResNode == NULL || ResNode == N.Val)
1467 DEBUG(N.Val->dump(CurDAG));
1468 else
1469 DEBUG(ResNode->dump(CurDAG));
1470 DOUT << "\n";
1471 Indent -= 2;
1472#endif
1473
1474 return ResNode;
1475}
1476
1477bool X86DAGToDAGISel::
1478SelectInlineAsmMemoryOperand(const SDOperand &Op, char ConstraintCode,
1479 std::vector<SDOperand> &OutOps, SelectionDAG &DAG){
1480 SDOperand Op0, Op1, Op2, Op3;
1481 switch (ConstraintCode) {
1482 case 'o': // offsetable ??
1483 case 'v': // not offsetable ??
1484 default: return true;
1485 case 'm': // memory
1486 if (!SelectAddr(Op, Op, Op0, Op1, Op2, Op3))
1487 return true;
1488 break;
1489 }
1490
1491 OutOps.push_back(Op0);
1492 OutOps.push_back(Op1);
1493 OutOps.push_back(Op2);
1494 OutOps.push_back(Op3);
1495 AddToISelQueue(Op0);
1496 AddToISelQueue(Op1);
1497 AddToISelQueue(Op2);
1498 AddToISelQueue(Op3);
1499 return false;
1500}
1501
1502/// createX86ISelDag - This pass converts a legalized DAG into a
1503/// X86-specific DAG, ready for instruction scheduling.
1504///
1505FunctionPass *llvm::createX86ISelDag(X86TargetMachine &TM, bool Fast) {
1506 return new X86DAGToDAGISel(TM, Fast);
1507}