1 //===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===//
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 implements the SelectionDAGISel class.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "isel"
15 #include "ScheduleDAGSDNodes.h"
16 #include "SelectionDAGBuilder.h"
17 #include "FunctionLoweringInfo.h"
18 #include "llvm/CodeGen/SelectionDAGISel.h"
19 #include "llvm/Analysis/AliasAnalysis.h"
20 #include "llvm/Analysis/DebugInfo.h"
21 #include "llvm/Constants.h"
22 #include "llvm/Function.h"
23 #include "llvm/InlineAsm.h"
24 #include "llvm/Instructions.h"
25 #include "llvm/Intrinsics.h"
26 #include "llvm/IntrinsicInst.h"
27 #include "llvm/LLVMContext.h"
28 #include "llvm/CodeGen/FastISel.h"
29 #include "llvm/CodeGen/GCStrategy.h"
30 #include "llvm/CodeGen/GCMetadata.h"
31 #include "llvm/CodeGen/MachineFunction.h"
32 #include "llvm/CodeGen/MachineInstrBuilder.h"
33 #include "llvm/CodeGen/MachineModuleInfo.h"
34 #include "llvm/CodeGen/MachineRegisterInfo.h"
35 #include "llvm/CodeGen/ScheduleHazardRecognizer.h"
36 #include "llvm/CodeGen/SchedulerRegistry.h"
37 #include "llvm/CodeGen/SelectionDAG.h"
38 #include "llvm/Target/TargetRegisterInfo.h"
39 #include "llvm/Target/TargetIntrinsicInfo.h"
40 #include "llvm/Target/TargetInstrInfo.h"
41 #include "llvm/Target/TargetLowering.h"
42 #include "llvm/Target/TargetMachine.h"
43 #include "llvm/Target/TargetOptions.h"
44 #include "llvm/Support/Compiler.h"
45 #include "llvm/Support/Debug.h"
46 #include "llvm/Support/ErrorHandling.h"
47 #include "llvm/Support/Timer.h"
48 #include "llvm/Support/raw_ostream.h"
49 #include "llvm/ADT/Statistic.h"
53 STATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on");
54 STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
57 EnableFastISelVerbose("fast-isel-verbose", cl::Hidden,
58 cl::desc("Enable verbose messages in the \"fast\" "
59 "instruction selector"));
61 EnableFastISelAbort("fast-isel-abort", cl::Hidden,
62 cl::desc("Enable abort calls when \"fast\" instruction fails"));
66 ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
67 cl::desc("Pop up a window to show dags before the first "
70 ViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden,
71 cl::desc("Pop up a window to show dags before legalize types"));
73 ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
74 cl::desc("Pop up a window to show dags before legalize"));
76 ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
77 cl::desc("Pop up a window to show dags before the second "
80 ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
81 cl::desc("Pop up a window to show dags before the post legalize types"
82 " dag combine pass"));
84 ViewISelDAGs("view-isel-dags", cl::Hidden,
85 cl::desc("Pop up a window to show isel dags as they are selected"));
87 ViewSchedDAGs("view-sched-dags", cl::Hidden,
88 cl::desc("Pop up a window to show sched dags as they are processed"));
90 ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
91 cl::desc("Pop up a window to show SUnit dags after they are processed"));
93 static const bool ViewDAGCombine1 = false,
94 ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false,
95 ViewDAGCombine2 = false,
96 ViewDAGCombineLT = false,
97 ViewISelDAGs = false, ViewSchedDAGs = false,
98 ViewSUnitDAGs = false;
101 //===---------------------------------------------------------------------===//
103 /// RegisterScheduler class - Track the registration of instruction schedulers.
105 //===---------------------------------------------------------------------===//
106 MachinePassRegistry RegisterScheduler::Registry;
108 //===---------------------------------------------------------------------===//
110 /// ISHeuristic command line option for instruction schedulers.
112 //===---------------------------------------------------------------------===//
113 static cl::opt<RegisterScheduler::FunctionPassCtor, false,
114 RegisterPassParser<RegisterScheduler> >
115 ISHeuristic("pre-RA-sched",
116 cl::init(&createDefaultScheduler),
117 cl::desc("Instruction schedulers available (before register"
120 static RegisterScheduler
121 defaultListDAGScheduler("default", "Best scheduler for the target",
122 createDefaultScheduler);
125 //===--------------------------------------------------------------------===//
126 /// createDefaultScheduler - This creates an instruction scheduler appropriate
128 ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS,
129 CodeGenOpt::Level OptLevel) {
130 const TargetLowering &TLI = IS->getTargetLowering();
132 if (OptLevel == CodeGenOpt::None)
133 return createFastDAGScheduler(IS, OptLevel);
134 if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency)
135 return createTDListDAGScheduler(IS, OptLevel);
136 assert(TLI.getSchedulingPreference() ==
137 TargetLowering::SchedulingForRegPressure && "Unknown sched type!");
138 return createBURRListDAGScheduler(IS, OptLevel);
142 // EmitInstrWithCustomInserter - This method should be implemented by targets
143 // that mark instructions with the 'usesCustomInserter' flag. These
144 // instructions are special in various ways, which require special support to
145 // insert. The specified MachineInstr is created but not inserted into any
146 // basic blocks, and this method is called to expand it into a sequence of
147 // instructions, potentially also creating new basic blocks and control flow.
148 // When new basic blocks are inserted and the edges from MBB to its successors
149 // are modified, the method should insert pairs of <OldSucc, NewSucc> into the
151 MachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
152 MachineBasicBlock *MBB,
153 DenseMap<MachineBasicBlock*, MachineBasicBlock*> *EM) const {
155 dbgs() << "If a target marks an instruction with "
156 "'usesCustomInserter', it must implement "
157 "TargetLowering::EmitInstrWithCustomInserter!";
163 //===----------------------------------------------------------------------===//
164 // SelectionDAGISel code
165 //===----------------------------------------------------------------------===//
167 SelectionDAGISel::SelectionDAGISel(const TargetMachine &tm, CodeGenOpt::Level OL) :
168 MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()),
169 FuncInfo(new FunctionLoweringInfo(TLI)),
170 CurDAG(new SelectionDAG(tm, *FuncInfo)),
171 SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
177 SelectionDAGISel::~SelectionDAGISel() {
183 void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
184 AU.addRequired<AliasAnalysis>();
185 AU.addPreserved<AliasAnalysis>();
186 AU.addRequired<GCModuleInfo>();
187 AU.addPreserved<GCModuleInfo>();
188 MachineFunctionPass::getAnalysisUsage(AU);
191 bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
192 // Do some sanity-checking on the command-line options.
193 assert((!EnableFastISelVerbose || EnableFastISel) &&
194 "-fast-isel-verbose requires -fast-isel");
195 assert((!EnableFastISelAbort || EnableFastISel) &&
196 "-fast-isel-abort requires -fast-isel");
198 const Function &Fn = *mf.getFunction();
199 const TargetInstrInfo &TII = *TM.getInstrInfo();
200 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
203 RegInfo = &MF->getRegInfo();
204 AA = &getAnalysis<AliasAnalysis>();
205 GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0;
207 DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
210 FuncInfo->set(Fn, *MF, EnableFastISel);
213 SelectAllBasicBlocks(Fn);
217 // If the first basic block in the function has live ins that need to be
218 // copied into vregs, emit the copies into the top of the block before
219 // emitting the code for the block.
220 MachineBasicBlock *EntryMBB = MF->begin();
221 RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII);
224 // Insert DBG_VALUE instructions for function arguments to the entry block.
225 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
226 MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
227 unsigned Reg = MI->getOperand(0).getReg();
228 if (TargetRegisterInfo::isPhysicalRegister(Reg))
229 EntryMBB->insert(EntryMBB->begin(), MI);
231 MachineInstr *Def = RegInfo->getVRegDef(Reg);
232 MachineBasicBlock::iterator InsertPos = Def;
233 EntryMBB->insert(llvm::next(InsertPos), MI);
237 // Release function-specific state. SDB and CurDAG are already cleared
246 SelectionDAGISel::SelectBasicBlock(MachineBasicBlock *BB,
247 const BasicBlock *LLVMBB,
248 BasicBlock::const_iterator Begin,
249 BasicBlock::const_iterator End,
251 // Lower all of the non-terminator instructions. If a call is emitted
252 // as a tail call, cease emitting nodes for this block. Terminators
253 // are handled below.
254 for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
257 // Make sure the root of the DAG is up-to-date.
258 CurDAG->setRoot(SDB->getControlRoot());
260 // Final step, emit the lowered DAG as machine code.
261 BB = CodeGenAndEmitDAG(BB);
262 HadTailCall = SDB->HasTailCall;
268 /// WorkListRemover - This class is a DAGUpdateListener that removes any deleted
269 /// nodes from the worklist.
270 class SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener {
271 SmallVector<SDNode*, 128> &Worklist;
272 SmallPtrSet<SDNode*, 128> &InWorklist;
274 SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl,
275 SmallPtrSet<SDNode*, 128> &inwl)
276 : Worklist(wl), InWorklist(inwl) {}
278 void RemoveFromWorklist(SDNode *N) {
279 if (!InWorklist.erase(N)) return;
281 SmallVector<SDNode*, 128>::iterator I =
282 std::find(Worklist.begin(), Worklist.end(), N);
283 assert(I != Worklist.end() && "Not in worklist");
285 *I = Worklist.back();
289 virtual void NodeDeleted(SDNode *N, SDNode *E) {
290 RemoveFromWorklist(N);
293 virtual void NodeUpdated(SDNode *N) {
299 /// TrivialTruncElim - Eliminate some trivial nops that can result from
300 /// ShrinkDemandedOps: (trunc (ext n)) -> n.
301 static bool TrivialTruncElim(SDValue Op,
302 TargetLowering::TargetLoweringOpt &TLO) {
303 SDValue N0 = Op.getOperand(0);
304 EVT VT = Op.getValueType();
305 if ((N0.getOpcode() == ISD::ZERO_EXTEND ||
306 N0.getOpcode() == ISD::SIGN_EXTEND ||
307 N0.getOpcode() == ISD::ANY_EXTEND) &&
308 N0.getOperand(0).getValueType() == VT) {
309 return TLO.CombineTo(Op, N0.getOperand(0));
314 /// ShrinkDemandedOps - A late transformation pass that shrink expressions
315 /// using TargetLowering::TargetLoweringOpt::ShrinkDemandedOp. It converts
316 /// x+y to (VT)((SmallVT)x+(SmallVT)y) if the casts are free.
317 void SelectionDAGISel::ShrinkDemandedOps() {
318 SmallVector<SDNode*, 128> Worklist;
319 SmallPtrSet<SDNode*, 128> InWorklist;
321 // Add all the dag nodes to the worklist.
322 Worklist.reserve(CurDAG->allnodes_size());
323 for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(),
324 E = CurDAG->allnodes_end(); I != E; ++I) {
325 Worklist.push_back(I);
326 InWorklist.insert(I);
329 TargetLowering::TargetLoweringOpt TLO(*CurDAG, true, true, true);
330 while (!Worklist.empty()) {
331 SDNode *N = Worklist.pop_back_val();
334 if (N->use_empty() && N != CurDAG->getRoot().getNode()) {
335 // Deleting this node may make its operands dead, add them to the worklist
336 // if they aren't already there.
337 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
338 if (InWorklist.insert(N->getOperand(i).getNode()))
339 Worklist.push_back(N->getOperand(i).getNode());
341 CurDAG->DeleteNode(N);
345 // Run ShrinkDemandedOp on scalar binary operations.
346 if (N->getNumValues() != 1 ||
347 !N->getValueType(0).isSimple() || !N->getValueType(0).isInteger())
350 unsigned BitWidth = N->getValueType(0).getScalarType().getSizeInBits();
351 APInt Demanded = APInt::getAllOnesValue(BitWidth);
352 APInt KnownZero, KnownOne;
353 if (!TLI.SimplifyDemandedBits(SDValue(N, 0), Demanded,
354 KnownZero, KnownOne, TLO) &&
355 (N->getOpcode() != ISD::TRUNCATE ||
356 !TrivialTruncElim(SDValue(N, 0), TLO)))
360 assert(!InWorklist.count(N) && "Already in worklist");
361 Worklist.push_back(N);
362 InWorklist.insert(N);
364 // Replace the old value with the new one.
365 DEBUG(errs() << "\nShrinkDemandedOps replacing ";
366 TLO.Old.getNode()->dump(CurDAG);
367 errs() << "\nWith: ";
368 TLO.New.getNode()->dump(CurDAG);
371 if (InWorklist.insert(TLO.New.getNode()))
372 Worklist.push_back(TLO.New.getNode());
374 SDOPsWorkListRemover DeadNodes(Worklist, InWorklist);
375 CurDAG->ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, &DeadNodes);
377 if (!TLO.Old.getNode()->use_empty()) continue;
379 for (unsigned i = 0, e = TLO.Old.getNode()->getNumOperands();
381 SDNode *OpNode = TLO.Old.getNode()->getOperand(i).getNode();
382 if (OpNode->hasOneUse()) {
383 // Add OpNode to the end of the list to revisit.
384 DeadNodes.RemoveFromWorklist(OpNode);
385 Worklist.push_back(OpNode);
386 InWorklist.insert(OpNode);
390 DeadNodes.RemoveFromWorklist(TLO.Old.getNode());
391 CurDAG->DeleteNode(TLO.Old.getNode());
395 void SelectionDAGISel::ComputeLiveOutVRegInfo() {
396 SmallPtrSet<SDNode*, 128> VisitedNodes;
397 SmallVector<SDNode*, 128> Worklist;
399 Worklist.push_back(CurDAG->getRoot().getNode());
406 SDNode *N = Worklist.pop_back_val();
408 // If we've already seen this node, ignore it.
409 if (!VisitedNodes.insert(N))
412 // Otherwise, add all chain operands to the worklist.
413 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
414 if (N->getOperand(i).getValueType() == MVT::Other)
415 Worklist.push_back(N->getOperand(i).getNode());
417 // If this is a CopyToReg with a vreg dest, process it.
418 if (N->getOpcode() != ISD::CopyToReg)
421 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
422 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
425 // Ignore non-scalar or non-integer values.
426 SDValue Src = N->getOperand(2);
427 EVT SrcVT = Src.getValueType();
428 if (!SrcVT.isInteger() || SrcVT.isVector())
431 unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
432 Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
433 CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
435 // Only install this information if it tells us something.
436 if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) {
437 DestReg -= TargetRegisterInfo::FirstVirtualRegister;
438 if (DestReg >= FuncInfo->LiveOutRegInfo.size())
439 FuncInfo->LiveOutRegInfo.resize(DestReg+1);
440 FunctionLoweringInfo::LiveOutInfo &LOI =
441 FuncInfo->LiveOutRegInfo[DestReg];
442 LOI.NumSignBits = NumSignBits;
443 LOI.KnownOne = KnownOne;
444 LOI.KnownZero = KnownZero;
446 } while (!Worklist.empty());
449 MachineBasicBlock *SelectionDAGISel::CodeGenAndEmitDAG(MachineBasicBlock *BB) {
450 std::string GroupName;
451 if (TimePassesIsEnabled)
452 GroupName = "Instruction Selection and Scheduling";
453 std::string BlockName;
454 if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
455 ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
457 BlockName = MF->getFunction()->getNameStr() + ":" +
458 BB->getBasicBlock()->getNameStr();
460 DEBUG(dbgs() << "Initial selection DAG:\n");
461 DEBUG(CurDAG->dump());
463 if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName);
465 // Run the DAG combiner in pre-legalize mode.
466 if (TimePassesIsEnabled) {
467 NamedRegionTimer T("DAG Combining 1", GroupName);
468 CurDAG->Combine(Unrestricted, *AA, OptLevel);
470 CurDAG->Combine(Unrestricted, *AA, OptLevel);
473 DEBUG(dbgs() << "Optimized lowered selection DAG:\n");
474 DEBUG(CurDAG->dump());
476 // Second step, hack on the DAG until it only uses operations and types that
477 // the target supports.
478 if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " +
482 if (TimePassesIsEnabled) {
483 NamedRegionTimer T("Type Legalization", GroupName);
484 Changed = CurDAG->LegalizeTypes();
486 Changed = CurDAG->LegalizeTypes();
489 DEBUG(dbgs() << "Type-legalized selection DAG:\n");
490 DEBUG(CurDAG->dump());
493 if (ViewDAGCombineLT)
494 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
496 // Run the DAG combiner in post-type-legalize mode.
497 if (TimePassesIsEnabled) {
498 NamedRegionTimer T("DAG Combining after legalize types", GroupName);
499 CurDAG->Combine(NoIllegalTypes, *AA, OptLevel);
501 CurDAG->Combine(NoIllegalTypes, *AA, OptLevel);
504 DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n");
505 DEBUG(CurDAG->dump());
508 if (TimePassesIsEnabled) {
509 NamedRegionTimer T("Vector Legalization", GroupName);
510 Changed = CurDAG->LegalizeVectors();
512 Changed = CurDAG->LegalizeVectors();
516 if (TimePassesIsEnabled) {
517 NamedRegionTimer T("Type Legalization 2", GroupName);
518 CurDAG->LegalizeTypes();
520 CurDAG->LegalizeTypes();
523 if (ViewDAGCombineLT)
524 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
526 // Run the DAG combiner in post-type-legalize mode.
527 if (TimePassesIsEnabled) {
528 NamedRegionTimer T("DAG Combining after legalize vectors", GroupName);
529 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
531 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
534 DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n");
535 DEBUG(CurDAG->dump());
538 if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName);
540 if (TimePassesIsEnabled) {
541 NamedRegionTimer T("DAG Legalization", GroupName);
542 CurDAG->Legalize(OptLevel);
544 CurDAG->Legalize(OptLevel);
547 DEBUG(dbgs() << "Legalized selection DAG:\n");
548 DEBUG(CurDAG->dump());
550 if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName);
552 // Run the DAG combiner in post-legalize mode.
553 if (TimePassesIsEnabled) {
554 NamedRegionTimer T("DAG Combining 2", GroupName);
555 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
557 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
560 DEBUG(dbgs() << "Optimized legalized selection DAG:\n");
561 DEBUG(CurDAG->dump());
563 if (OptLevel != CodeGenOpt::None) {
565 ComputeLiveOutVRegInfo();
568 if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName);
570 // Third, instruction select all of the operations to machine code, adding the
571 // code to the MachineBasicBlock.
572 if (TimePassesIsEnabled) {
573 NamedRegionTimer T("Instruction Selection", GroupName);
574 DoInstructionSelection();
576 DoInstructionSelection();
579 DEBUG(dbgs() << "Selected selection DAG:\n");
580 DEBUG(CurDAG->dump());
582 if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName);
584 // Schedule machine code.
585 ScheduleDAGSDNodes *Scheduler = CreateScheduler();
586 if (TimePassesIsEnabled) {
587 NamedRegionTimer T("Instruction Scheduling", GroupName);
588 Scheduler->Run(CurDAG, BB, BB->end());
590 Scheduler->Run(CurDAG, BB, BB->end());
593 if (ViewSUnitDAGs) Scheduler->viewGraph();
595 // Emit machine code to BB. This can change 'BB' to the last block being
597 if (TimePassesIsEnabled) {
598 NamedRegionTimer T("Instruction Creation", GroupName);
599 BB = Scheduler->EmitSchedule(&SDB->EdgeMapping);
601 BB = Scheduler->EmitSchedule(&SDB->EdgeMapping);
604 // Free the scheduler state.
605 if (TimePassesIsEnabled) {
606 NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName);
615 void SelectionDAGISel::DoInstructionSelection() {
616 DEBUG(errs() << "===== Instruction selection begins:\n");
620 // Select target instructions for the DAG.
622 // Number all nodes with a topological order and set DAGSize.
623 DAGSize = CurDAG->AssignTopologicalOrder();
625 // Create a dummy node (which is not added to allnodes), that adds
626 // a reference to the root node, preventing it from being deleted,
627 // and tracking any changes of the root.
628 HandleSDNode Dummy(CurDAG->getRoot());
629 ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode());
632 // The AllNodes list is now topological-sorted. Visit the
633 // nodes by starting at the end of the list (the root of the
634 // graph) and preceding back toward the beginning (the entry
636 while (ISelPosition != CurDAG->allnodes_begin()) {
637 SDNode *Node = --ISelPosition;
638 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
639 // but there are currently some corner cases that it misses. Also, this
640 // makes it theoretically possible to disable the DAGCombiner.
641 if (Node->use_empty())
644 SDNode *ResNode = Select(Node);
646 // FIXME: This is pretty gross. 'Select' should be changed to not return
647 // anything at all and this code should be nuked with a tactical strike.
649 // If node should not be replaced, continue with the next one.
650 if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
654 ReplaceUses(Node, ResNode);
656 // If after the replacement this node is not used any more,
657 // remove this dead node.
658 if (Node->use_empty()) { // Don't delete EntryToken, etc.
659 ISelUpdater ISU(ISelPosition);
660 CurDAG->RemoveDeadNode(Node, &ISU);
664 CurDAG->setRoot(Dummy.getValue());
666 DEBUG(errs() << "===== Instruction selection ends:\n");
668 PostprocessISelDAG();
671 /// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
672 /// do other setup for EH landing-pad blocks.
673 void SelectionDAGISel::PrepareEHLandingPad(MachineBasicBlock *BB) {
674 // Add a label to mark the beginning of the landing pad. Deletion of the
675 // landing pad can thus be detected via the MachineModuleInfo.
676 MCSymbol *Label = MF->getMMI().addLandingPad(BB);
678 const TargetInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL);
679 BuildMI(BB, SDB->getCurDebugLoc(), II).addSym(Label);
681 // Mark exception register as live in.
682 unsigned Reg = TLI.getExceptionAddressRegister();
683 if (Reg) BB->addLiveIn(Reg);
685 // Mark exception selector register as live in.
686 Reg = TLI.getExceptionSelectorRegister();
687 if (Reg) BB->addLiveIn(Reg);
689 // FIXME: Hack around an exception handling flaw (PR1508): the personality
690 // function and list of typeids logically belong to the invoke (or, if you
691 // like, the basic block containing the invoke), and need to be associated
692 // with it in the dwarf exception handling tables. Currently however the
693 // information is provided by an intrinsic (eh.selector) that can be moved
694 // to unexpected places by the optimizers: if the unwind edge is critical,
695 // then breaking it can result in the intrinsics being in the successor of
696 // the landing pad, not the landing pad itself. This results
697 // in exceptions not being caught because no typeids are associated with
698 // the invoke. This may not be the only way things can go wrong, but it
699 // is the only way we try to work around for the moment.
700 const BasicBlock *LLVMBB = BB->getBasicBlock();
701 const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
703 if (Br && Br->isUnconditional()) { // Critical edge?
704 BasicBlock::const_iterator I, E;
705 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
706 if (isa<EHSelectorInst>(I))
710 // No catch info found - try to extract some from the successor.
711 CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo);
715 void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
716 // Initialize the Fast-ISel state, if needed.
717 FastISel *FastIS = 0;
719 FastIS = TLI.createFastISel(*MF, FuncInfo->ValueMap, FuncInfo->MBBMap,
720 FuncInfo->StaticAllocaMap,
721 FuncInfo->PHINodesToUpdate
723 , FuncInfo->CatchInfoLost
727 // Iterate over all basic blocks in the function.
728 for (Function::const_iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) {
729 const BasicBlock *LLVMBB = &*I;
730 MachineBasicBlock *BB = FuncInfo->MBBMap[LLVMBB];
732 BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
733 BasicBlock::const_iterator const End = LLVMBB->end();
734 BasicBlock::const_iterator BI = Begin;
736 // Lower any arguments needed in this block if this is the entry block.
737 bool SuppressFastISel = false;
738 if (LLVMBB == &Fn.getEntryBlock()) {
739 LowerArguments(LLVMBB);
741 // If any of the arguments has the byval attribute, forgo
742 // fast-isel in the entry block.
745 for (Function::const_arg_iterator I = Fn.arg_begin(), E = Fn.arg_end();
747 if (Fn.paramHasAttr(j, Attribute::ByVal)) {
748 if (EnableFastISelVerbose || EnableFastISelAbort)
749 dbgs() << "FastISel skips entry block due to byval argument\n";
750 SuppressFastISel = true;
756 // Setup an EH landing-pad block.
757 if (BB->isLandingPad())
758 PrepareEHLandingPad(BB);
760 // Before doing SelectionDAG ISel, see if FastISel has been requested.
761 if (FastIS && !SuppressFastISel) {
762 // Emit code for any incoming arguments. This must happen before
763 // beginning FastISel on the entry block.
764 if (LLVMBB == &Fn.getEntryBlock()) {
765 CurDAG->setRoot(SDB->getControlRoot());
766 BB = CodeGenAndEmitDAG(BB);
769 FastIS->startNewBlock(BB);
770 // Do FastISel on as many instructions as possible.
771 for (; BI != End; ++BI) {
772 // Try to select the instruction with FastISel.
773 if (FastIS->SelectInstruction(BI))
776 // Then handle certain instructions as single-LLVM-Instruction blocks.
777 if (isa<CallInst>(BI)) {
778 ++NumFastIselFailures;
779 if (EnableFastISelVerbose || EnableFastISelAbort) {
780 dbgs() << "FastISel missed call: ";
784 if (!BI->getType()->isVoidTy() && !BI->use_empty()) {
785 unsigned &R = FuncInfo->ValueMap[BI];
787 R = FuncInfo->CreateRegForValue(BI);
790 bool HadTailCall = false;
791 BB = SelectBasicBlock(BB, LLVMBB, BI, llvm::next(BI), HadTailCall);
793 // If the call was emitted as a tail call, we're done with the block.
799 // If the instruction was codegen'd with multiple blocks,
800 // inform the FastISel object where to resume inserting.
801 FastIS->setCurrentBlock(BB);
805 // Otherwise, give up on FastISel for the rest of the block.
806 // For now, be a little lenient about non-branch terminators.
807 if (!isa<TerminatorInst>(BI) || isa<BranchInst>(BI)) {
808 ++NumFastIselFailures;
809 if (EnableFastISelVerbose || EnableFastISelAbort) {
810 dbgs() << "FastISel miss: ";
813 if (EnableFastISelAbort)
814 // The "fast" selector couldn't handle something and bailed.
815 // For the purpose of debugging, just abort.
816 llvm_unreachable("FastISel didn't select the entire block");
822 // Run SelectionDAG instruction selection on the remainder of the block
823 // not handled by FastISel. If FastISel is not run, this is the entire
827 BB = SelectBasicBlock(BB, LLVMBB, BI, End, HadTailCall);
830 FinishBasicBlock(BB);
831 FuncInfo->PHINodesToUpdate.clear();
838 SelectionDAGISel::FinishBasicBlock(MachineBasicBlock *BB) {
840 DEBUG(dbgs() << "Target-post-processed machine code:\n");
843 DEBUG(dbgs() << "Total amount of phi nodes to update: "
844 << FuncInfo->PHINodesToUpdate.size() << "\n");
845 DEBUG(for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
846 dbgs() << "Node " << i << " : ("
847 << FuncInfo->PHINodesToUpdate[i].first
848 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
850 // Next, now that we know what the last MBB the LLVM BB expanded is, update
851 // PHI nodes in successors.
852 if (SDB->SwitchCases.empty() &&
853 SDB->JTCases.empty() &&
854 SDB->BitTestCases.empty()) {
855 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
856 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
857 assert(PHI->isPHI() &&
858 "This is not a machine PHI node that we are updating!");
859 if (!BB->isSuccessor(PHI->getParent()))
862 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
863 PHI->addOperand(MachineOperand::CreateMBB(BB));
868 for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
869 // Lower header first, if it wasn't already lowered
870 if (!SDB->BitTestCases[i].Emitted) {
871 // Set the current basic block to the mbb we wish to insert the code into
872 BB = SDB->BitTestCases[i].Parent;
874 SDB->visitBitTestHeader(SDB->BitTestCases[i], BB);
875 CurDAG->setRoot(SDB->getRoot());
876 BB = CodeGenAndEmitDAG(BB);
880 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
881 // Set the current basic block to the mbb we wish to insert the code into
882 BB = SDB->BitTestCases[i].Cases[j].ThisBB;
885 SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB,
886 SDB->BitTestCases[i].Reg,
887 SDB->BitTestCases[i].Cases[j],
890 SDB->visitBitTestCase(SDB->BitTestCases[i].Default,
891 SDB->BitTestCases[i].Reg,
892 SDB->BitTestCases[i].Cases[j],
896 CurDAG->setRoot(SDB->getRoot());
897 BB = CodeGenAndEmitDAG(BB);
902 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
904 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
905 MachineBasicBlock *PHIBB = PHI->getParent();
906 assert(PHI->isPHI() &&
907 "This is not a machine PHI node that we are updating!");
908 // This is "default" BB. We have two jumps to it. From "header" BB and
909 // from last "case" BB.
910 if (PHIBB == SDB->BitTestCases[i].Default) {
911 PHI->addOperand(MachineOperand::
912 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
914 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent));
915 PHI->addOperand(MachineOperand::
916 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
918 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases.
921 // One of "cases" BB.
922 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
924 MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
925 if (cBB->isSuccessor(PHIBB)) {
926 PHI->addOperand(MachineOperand::
927 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
929 PHI->addOperand(MachineOperand::CreateMBB(cBB));
934 SDB->BitTestCases.clear();
936 // If the JumpTable record is filled in, then we need to emit a jump table.
937 // Updating the PHI nodes is tricky in this case, since we need to determine
938 // whether the PHI is a successor of the range check MBB or the jump table MBB
939 for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
940 // Lower header first, if it wasn't already lowered
941 if (!SDB->JTCases[i].first.Emitted) {
942 // Set the current basic block to the mbb we wish to insert the code into
943 BB = SDB->JTCases[i].first.HeaderBB;
945 SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
947 CurDAG->setRoot(SDB->getRoot());
948 BB = CodeGenAndEmitDAG(BB);
952 // Set the current basic block to the mbb we wish to insert the code into
953 BB = SDB->JTCases[i].second.MBB;
955 SDB->visitJumpTable(SDB->JTCases[i].second);
956 CurDAG->setRoot(SDB->getRoot());
957 BB = CodeGenAndEmitDAG(BB);
961 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
963 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
964 MachineBasicBlock *PHIBB = PHI->getParent();
965 assert(PHI->isPHI() &&
966 "This is not a machine PHI node that we are updating!");
967 // "default" BB. We can go there only from header BB.
968 if (PHIBB == SDB->JTCases[i].second.Default) {
970 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
973 (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB));
975 // JT BB. Just iterate over successors here
976 if (BB->isSuccessor(PHIBB)) {
978 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
980 PHI->addOperand(MachineOperand::CreateMBB(BB));
984 SDB->JTCases.clear();
986 // If the switch block involved a branch to one of the actual successors, we
987 // need to update PHI nodes in that block.
988 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
989 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
990 assert(PHI->isPHI() &&
991 "This is not a machine PHI node that we are updating!");
992 if (BB->isSuccessor(PHI->getParent())) {
994 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
995 PHI->addOperand(MachineOperand::CreateMBB(BB));
999 // If we generated any switch lowering information, build and codegen any
1000 // additional DAGs necessary.
1001 for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
1002 // Set the current basic block to the mbb we wish to insert the code into
1003 MachineBasicBlock *ThisBB = BB = SDB->SwitchCases[i].ThisBB;
1006 SDB->visitSwitchCase(SDB->SwitchCases[i], BB);
1007 CurDAG->setRoot(SDB->getRoot());
1008 BB = CodeGenAndEmitDAG(BB);
1010 // Handle any PHI nodes in successors of this chunk, as if we were coming
1011 // from the original BB before switch expansion. Note that PHI nodes can
1012 // occur multiple times in PHINodesToUpdate. We have to be very careful to
1013 // handle them the right number of times.
1014 while ((BB = SDB->SwitchCases[i].TrueBB)) { // Handle LHS and RHS.
1015 // If new BB's are created during scheduling, the edges may have been
1016 // updated. That is, the edge from ThisBB to BB may have been split and
1017 // BB's predecessor is now another block.
1018 DenseMap<MachineBasicBlock*, MachineBasicBlock*>::iterator EI =
1019 SDB->EdgeMapping.find(BB);
1020 if (EI != SDB->EdgeMapping.end())
1021 ThisBB = EI->second;
1023 // BB may have been removed from the CFG if a branch was constant folded.
1024 if (ThisBB->isSuccessor(BB)) {
1025 for (MachineBasicBlock::iterator Phi = BB->begin();
1026 Phi != BB->end() && Phi->isPHI();
1028 // This value for this PHI node is recorded in PHINodesToUpdate.
1029 for (unsigned pn = 0; ; ++pn) {
1030 assert(pn != FuncInfo->PHINodesToUpdate.size() &&
1031 "Didn't find PHI entry!");
1032 if (FuncInfo->PHINodesToUpdate[pn].first == Phi) {
1033 Phi->addOperand(MachineOperand::
1034 CreateReg(FuncInfo->PHINodesToUpdate[pn].second,
1036 Phi->addOperand(MachineOperand::CreateMBB(ThisBB));
1043 // Don't process RHS if same block as LHS.
1044 if (BB == SDB->SwitchCases[i].FalseBB)
1045 SDB->SwitchCases[i].FalseBB = 0;
1047 // If we haven't handled the RHS, do so now. Otherwise, we're done.
1048 SDB->SwitchCases[i].TrueBB = SDB->SwitchCases[i].FalseBB;
1049 SDB->SwitchCases[i].FalseBB = 0;
1051 assert(SDB->SwitchCases[i].TrueBB == 0 && SDB->SwitchCases[i].FalseBB == 0);
1054 SDB->SwitchCases.clear();
1058 /// Create the scheduler. If a specific scheduler was specified
1059 /// via the SchedulerRegistry, use it, otherwise select the
1060 /// one preferred by the target.
1062 ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
1063 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
1067 RegisterScheduler::setDefault(Ctor);
1070 return Ctor(this, OptLevel);
1073 ScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() {
1074 return new ScheduleHazardRecognizer();
1077 //===----------------------------------------------------------------------===//
1078 // Helper functions used by the generated instruction selector.
1079 //===----------------------------------------------------------------------===//
1080 // Calls to these methods are generated by tblgen.
1082 /// CheckAndMask - The isel is trying to match something like (and X, 255). If
1083 /// the dag combiner simplified the 255, we still want to match. RHS is the
1084 /// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
1085 /// specified in the .td file (e.g. 255).
1086 bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
1087 int64_t DesiredMaskS) const {
1088 const APInt &ActualMask = RHS->getAPIntValue();
1089 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
1091 // If the actual mask exactly matches, success!
1092 if (ActualMask == DesiredMask)
1095 // If the actual AND mask is allowing unallowed bits, this doesn't match.
1096 if (ActualMask.intersects(~DesiredMask))
1099 // Otherwise, the DAG Combiner may have proven that the value coming in is
1100 // either already zero or is not demanded. Check for known zero input bits.
1101 APInt NeededMask = DesiredMask & ~ActualMask;
1102 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
1105 // TODO: check to see if missing bits are just not demanded.
1107 // Otherwise, this pattern doesn't match.
1111 /// CheckOrMask - The isel is trying to match something like (or X, 255). If
1112 /// the dag combiner simplified the 255, we still want to match. RHS is the
1113 /// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
1114 /// specified in the .td file (e.g. 255).
1115 bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
1116 int64_t DesiredMaskS) const {
1117 const APInt &ActualMask = RHS->getAPIntValue();
1118 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
1120 // If the actual mask exactly matches, success!
1121 if (ActualMask == DesiredMask)
1124 // If the actual AND mask is allowing unallowed bits, this doesn't match.
1125 if (ActualMask.intersects(~DesiredMask))
1128 // Otherwise, the DAG Combiner may have proven that the value coming in is
1129 // either already zero or is not demanded. Check for known zero input bits.
1130 APInt NeededMask = DesiredMask & ~ActualMask;
1132 APInt KnownZero, KnownOne;
1133 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
1135 // If all the missing bits in the or are already known to be set, match!
1136 if ((NeededMask & KnownOne) == NeededMask)
1139 // TODO: check to see if missing bits are just not demanded.
1141 // Otherwise, this pattern doesn't match.
1146 /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
1147 /// by tblgen. Others should not call it.
1148 void SelectionDAGISel::
1149 SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
1150 std::vector<SDValue> InOps;
1151 std::swap(InOps, Ops);
1153 Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
1154 Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
1155 Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
1157 unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
1158 if (InOps[e-1].getValueType() == MVT::Flag)
1159 --e; // Don't process a flag operand if it is here.
1162 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
1163 if (!InlineAsm::isMemKind(Flags)) {
1164 // Just skip over this operand, copying the operands verbatim.
1165 Ops.insert(Ops.end(), InOps.begin()+i,
1166 InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
1167 i += InlineAsm::getNumOperandRegisters(Flags) + 1;
1169 assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
1170 "Memory operand with multiple values?");
1171 // Otherwise, this is a memory operand. Ask the target to select it.
1172 std::vector<SDValue> SelOps;
1173 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps))
1174 report_fatal_error("Could not match memory address. Inline asm"
1177 // Add this to the output node.
1179 InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
1180 Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
1181 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
1186 // Add the flag input back if present.
1187 if (e != InOps.size())
1188 Ops.push_back(InOps.back());
1191 /// findFlagUse - Return use of EVT::Flag value produced by the specified
1194 static SDNode *findFlagUse(SDNode *N) {
1195 unsigned FlagResNo = N->getNumValues()-1;
1196 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
1197 SDUse &Use = I.getUse();
1198 if (Use.getResNo() == FlagResNo)
1199 return Use.getUser();
1204 /// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
1205 /// This function recursively traverses up the operand chain, ignoring
1207 static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
1208 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1209 bool IgnoreChains) {
1210 // The NodeID's are given uniques ID's where a node ID is guaranteed to be
1211 // greater than all of its (recursive) operands. If we scan to a point where
1212 // 'use' is smaller than the node we're scanning for, then we know we will
1215 // The Use may be -1 (unassigned) if it is a newly allocated node. This can
1216 // happen because we scan down to newly selected nodes in the case of flag
1218 if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
1221 // Don't revisit nodes if we already scanned it and didn't fail, we know we
1222 // won't fail if we scan it again.
1223 if (!Visited.insert(Use))
1226 for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
1227 // Ignore chain uses, they are validated by HandleMergeInputChains.
1228 if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
1231 SDNode *N = Use->getOperand(i).getNode();
1233 if (Use == ImmedUse || Use == Root)
1234 continue; // We are not looking for immediate use.
1239 // Traverse up the operand chain.
1240 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
1246 /// IsProfitableToFold - Returns true if it's profitable to fold the specific
1247 /// operand node N of U during instruction selection that starts at Root.
1248 bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
1249 SDNode *Root) const {
1250 if (OptLevel == CodeGenOpt::None) return false;
1251 return N.hasOneUse();
1254 /// IsLegalToFold - Returns true if the specific operand node N of
1255 /// U can be folded during instruction selection that starts at Root.
1256 bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
1257 CodeGenOpt::Level OptLevel,
1258 bool IgnoreChains) {
1259 if (OptLevel == CodeGenOpt::None) return false;
1261 // If Root use can somehow reach N through a path that that doesn't contain
1262 // U then folding N would create a cycle. e.g. In the following
1263 // diagram, Root can reach N through X. If N is folded into into Root, then
1264 // X is both a predecessor and a successor of U.
1275 // * indicates nodes to be folded together.
1277 // If Root produces a flag, then it gets (even more) interesting. Since it
1278 // will be "glued" together with its flag use in the scheduler, we need to
1279 // check if it might reach N.
1298 // If FU (flag use) indirectly reaches N (the load), and Root folds N
1299 // (call it Fold), then X is a predecessor of FU and a successor of
1300 // Fold. But since Fold and FU are flagged together, this will create
1301 // a cycle in the scheduling graph.
1303 // If the node has flags, walk down the graph to the "lowest" node in the
1305 EVT VT = Root->getValueType(Root->getNumValues()-1);
1306 while (VT == MVT::Flag) {
1307 SDNode *FU = findFlagUse(Root);
1311 VT = Root->getValueType(Root->getNumValues()-1);
1313 // If our query node has a flag result with a use, we've walked up it. If
1314 // the user (which has already been selected) has a chain or indirectly uses
1315 // the chain, our WalkChainUsers predicate will not consider it. Because of
1316 // this, we cannot ignore chains in this predicate.
1317 IgnoreChains = false;
1321 SmallPtrSet<SDNode*, 16> Visited;
1322 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
1325 SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
1326 std::vector<SDValue> Ops(N->op_begin(), N->op_end());
1327 SelectInlineAsmMemoryOperands(Ops);
1329 std::vector<EVT> VTs;
1330 VTs.push_back(MVT::Other);
1331 VTs.push_back(MVT::Flag);
1332 SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(),
1333 VTs, &Ops[0], Ops.size());
1335 return New.getNode();
1338 SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
1339 return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
1342 /// GetVBR - decode a vbr encoding whose top bit is set.
1343 ALWAYS_INLINE static uint64_t
1344 GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
1345 assert(Val >= 128 && "Not a VBR");
1346 Val &= 127; // Remove first vbr bit.
1351 NextBits = MatcherTable[Idx++];
1352 Val |= (NextBits&127) << Shift;
1354 } while (NextBits & 128);
1360 /// UpdateChainsAndFlags - When a match is complete, this method updates uses of
1361 /// interior flag and chain results to use the new flag and chain results.
1362 void SelectionDAGISel::
1363 UpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain,
1364 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1366 const SmallVectorImpl<SDNode*> &FlagResultNodesMatched,
1367 bool isMorphNodeTo) {
1368 SmallVector<SDNode*, 4> NowDeadNodes;
1370 ISelUpdater ISU(ISelPosition);
1372 // Now that all the normal results are replaced, we replace the chain and
1373 // flag results if present.
1374 if (!ChainNodesMatched.empty()) {
1375 assert(InputChain.getNode() != 0 &&
1376 "Matched input chains but didn't produce a chain");
1377 // Loop over all of the nodes we matched that produced a chain result.
1378 // Replace all the chain results with the final chain we ended up with.
1379 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1380 SDNode *ChainNode = ChainNodesMatched[i];
1382 // If this node was already deleted, don't look at it.
1383 if (ChainNode->getOpcode() == ISD::DELETED_NODE)
1386 // Don't replace the results of the root node if we're doing a
1388 if (ChainNode == NodeToMatch && isMorphNodeTo)
1391 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
1392 if (ChainVal.getValueType() == MVT::Flag)
1393 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
1394 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
1395 CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU);
1397 // If the node became dead and we haven't already seen it, delete it.
1398 if (ChainNode->use_empty() &&
1399 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
1400 NowDeadNodes.push_back(ChainNode);
1404 // If the result produces a flag, update any flag results in the matched
1405 // pattern with the flag result.
1406 if (InputFlag.getNode() != 0) {
1407 // Handle any interior nodes explicitly marked.
1408 for (unsigned i = 0, e = FlagResultNodesMatched.size(); i != e; ++i) {
1409 SDNode *FRN = FlagResultNodesMatched[i];
1411 // If this node was already deleted, don't look at it.
1412 if (FRN->getOpcode() == ISD::DELETED_NODE)
1415 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Flag &&
1416 "Doesn't have a flag result");
1417 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
1420 // If the node became dead and we haven't already seen it, delete it.
1421 if (FRN->use_empty() &&
1422 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
1423 NowDeadNodes.push_back(FRN);
1427 if (!NowDeadNodes.empty())
1428 CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU);
1430 DEBUG(errs() << "ISEL: Match complete!\n");
1436 CR_LeadsToInteriorNode
1439 /// WalkChainUsers - Walk down the users of the specified chained node that is
1440 /// part of the pattern we're matching, looking at all of the users we find.
1441 /// This determines whether something is an interior node, whether we have a
1442 /// non-pattern node in between two pattern nodes (which prevent folding because
1443 /// it would induce a cycle) and whether we have a TokenFactor node sandwiched
1444 /// between pattern nodes (in which case the TF becomes part of the pattern).
1446 /// The walk we do here is guaranteed to be small because we quickly get down to
1447 /// already selected nodes "below" us.
1449 WalkChainUsers(SDNode *ChainedNode,
1450 SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
1451 SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
1452 ChainResult Result = CR_Simple;
1454 for (SDNode::use_iterator UI = ChainedNode->use_begin(),
1455 E = ChainedNode->use_end(); UI != E; ++UI) {
1456 // Make sure the use is of the chain, not some other value we produce.
1457 if (UI.getUse().getValueType() != MVT::Other) continue;
1461 // If we see an already-selected machine node, then we've gone beyond the
1462 // pattern that we're selecting down into the already selected chunk of the
1464 if (User->isMachineOpcode() ||
1465 User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
1468 if (User->getOpcode() == ISD::CopyToReg ||
1469 User->getOpcode() == ISD::CopyFromReg ||
1470 User->getOpcode() == ISD::INLINEASM ||
1471 User->getOpcode() == ISD::EH_LABEL) {
1472 // If their node ID got reset to -1 then they've already been selected.
1473 // Treat them like a MachineOpcode.
1474 if (User->getNodeId() == -1)
1478 // If we have a TokenFactor, we handle it specially.
1479 if (User->getOpcode() != ISD::TokenFactor) {
1480 // If the node isn't a token factor and isn't part of our pattern, then it
1481 // must be a random chained node in between two nodes we're selecting.
1482 // This happens when we have something like:
1487 // Because we structurally match the load/store as a read/modify/write,
1488 // but the call is chained between them. We cannot fold in this case
1489 // because it would induce a cycle in the graph.
1490 if (!std::count(ChainedNodesInPattern.begin(),
1491 ChainedNodesInPattern.end(), User))
1492 return CR_InducesCycle;
1494 // Otherwise we found a node that is part of our pattern. For example in:
1498 // This would happen when we're scanning down from the load and see the
1499 // store as a user. Record that there is a use of ChainedNode that is
1500 // part of the pattern and keep scanning uses.
1501 Result = CR_LeadsToInteriorNode;
1502 InteriorChainedNodes.push_back(User);
1506 // If we found a TokenFactor, there are two cases to consider: first if the
1507 // TokenFactor is just hanging "below" the pattern we're matching (i.e. no
1508 // uses of the TF are in our pattern) we just want to ignore it. Second,
1509 // the TokenFactor can be sandwiched in between two chained nodes, like so:
1515 // | \ DAG's like cheese
1518 // [TokenFactor] [Op]
1525 // In this case, the TokenFactor becomes part of our match and we rewrite it
1526 // as a new TokenFactor.
1528 // To distinguish these two cases, do a recursive walk down the uses.
1529 switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
1531 // If the uses of the TokenFactor are just already-selected nodes, ignore
1532 // it, it is "below" our pattern.
1534 case CR_InducesCycle:
1535 // If the uses of the TokenFactor lead to nodes that are not part of our
1536 // pattern that are not selected, folding would turn this into a cycle,
1538 return CR_InducesCycle;
1539 case CR_LeadsToInteriorNode:
1540 break; // Otherwise, keep processing.
1543 // Okay, we know we're in the interesting interior case. The TokenFactor
1544 // is now going to be considered part of the pattern so that we rewrite its
1545 // uses (it may have uses that are not part of the pattern) with the
1546 // ultimate chain result of the generated code. We will also add its chain
1547 // inputs as inputs to the ultimate TokenFactor we create.
1548 Result = CR_LeadsToInteriorNode;
1549 ChainedNodesInPattern.push_back(User);
1550 InteriorChainedNodes.push_back(User);
1557 /// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
1558 /// operation for when the pattern matched at least one node with a chains. The
1559 /// input vector contains a list of all of the chained nodes that we match. We
1560 /// must determine if this is a valid thing to cover (i.e. matching it won't
1561 /// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
1562 /// be used as the input node chain for the generated nodes.
1564 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
1565 SelectionDAG *CurDAG) {
1566 // Walk all of the chained nodes we've matched, recursively scanning down the
1567 // users of the chain result. This adds any TokenFactor nodes that are caught
1568 // in between chained nodes to the chained and interior nodes list.
1569 SmallVector<SDNode*, 3> InteriorChainedNodes;
1570 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1571 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1572 InteriorChainedNodes) == CR_InducesCycle)
1573 return SDValue(); // Would induce a cycle.
1576 // Okay, we have walked all the matched nodes and collected TokenFactor nodes
1577 // that we are interested in. Form our input TokenFactor node.
1578 SmallVector<SDValue, 3> InputChains;
1579 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1580 // Add the input chain of this node to the InputChains list (which will be
1581 // the operands of the generated TokenFactor) if it's not an interior node.
1582 SDNode *N = ChainNodesMatched[i];
1583 if (N->getOpcode() != ISD::TokenFactor) {
1584 if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
1587 // Otherwise, add the input chain.
1588 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1589 assert(InChain.getValueType() == MVT::Other && "Not a chain");
1590 InputChains.push_back(InChain);
1594 // If we have a token factor, we want to add all inputs of the token factor
1595 // that are not part of the pattern we're matching.
1596 for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
1597 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
1598 N->getOperand(op).getNode()))
1599 InputChains.push_back(N->getOperand(op));
1604 if (InputChains.size() == 1)
1605 return InputChains[0];
1606 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
1607 MVT::Other, &InputChains[0], InputChains.size());
1610 /// MorphNode - Handle morphing a node in place for the selector.
1611 SDNode *SelectionDAGISel::
1612 MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
1613 const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) {
1614 // It is possible we're using MorphNodeTo to replace a node with no
1615 // normal results with one that has a normal result (or we could be
1616 // adding a chain) and the input could have flags and chains as well.
1617 // In this case we need to shift the operands down.
1618 // FIXME: This is a horrible hack and broken in obscure cases, no worse
1619 // than the old isel though.
1620 int OldFlagResultNo = -1, OldChainResultNo = -1;
1622 unsigned NTMNumResults = Node->getNumValues();
1623 if (Node->getValueType(NTMNumResults-1) == MVT::Flag) {
1624 OldFlagResultNo = NTMNumResults-1;
1625 if (NTMNumResults != 1 &&
1626 Node->getValueType(NTMNumResults-2) == MVT::Other)
1627 OldChainResultNo = NTMNumResults-2;
1628 } else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
1629 OldChainResultNo = NTMNumResults-1;
1631 // Call the underlying SelectionDAG routine to do the transmogrification. Note
1632 // that this deletes operands of the old node that become dead.
1633 SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps);
1635 // MorphNodeTo can operate in two ways: if an existing node with the
1636 // specified operands exists, it can just return it. Otherwise, it
1637 // updates the node in place to have the requested operands.
1639 // If we updated the node in place, reset the node ID. To the isel,
1640 // this should be just like a newly allocated machine node.
1644 unsigned ResNumResults = Res->getNumValues();
1645 // Move the flag if needed.
1646 if ((EmitNodeInfo & OPFL_FlagOutput) && OldFlagResultNo != -1 &&
1647 (unsigned)OldFlagResultNo != ResNumResults-1)
1648 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldFlagResultNo),
1649 SDValue(Res, ResNumResults-1));
1651 if ((EmitNodeInfo & OPFL_FlagOutput) != 0)
1654 // Move the chain reference if needed.
1655 if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
1656 (unsigned)OldChainResultNo != ResNumResults-1)
1657 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
1658 SDValue(Res, ResNumResults-1));
1660 // Otherwise, no replacement happened because the node already exists. Replace
1661 // Uses of the old node with the new one.
1663 CurDAG->ReplaceAllUsesWith(Node, Res);
1668 /// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
1669 ALWAYS_INLINE static bool
1670 CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1671 SDValue N, const SmallVectorImpl<SDValue> &RecordedNodes) {
1672 // Accept if it is exactly the same as a previously recorded node.
1673 unsigned RecNo = MatcherTable[MatcherIndex++];
1674 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
1675 return N == RecordedNodes[RecNo];
1678 /// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
1679 ALWAYS_INLINE static bool
1680 CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1681 SelectionDAGISel &SDISel) {
1682 return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
1685 /// CheckNodePredicate - Implements OP_CheckNodePredicate.
1686 ALWAYS_INLINE static bool
1687 CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1688 SelectionDAGISel &SDISel, SDNode *N) {
1689 return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
1692 ALWAYS_INLINE static bool
1693 CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1695 uint16_t Opc = MatcherTable[MatcherIndex++];
1696 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
1697 return N->getOpcode() == Opc;
1700 ALWAYS_INLINE static bool
1701 CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1702 SDValue N, const TargetLowering &TLI) {
1703 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1704 if (N.getValueType() == VT) return true;
1706 // Handle the case when VT is iPTR.
1707 return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy();
1710 ALWAYS_INLINE static bool
1711 CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1712 SDValue N, const TargetLowering &TLI,
1714 if (ChildNo >= N.getNumOperands())
1715 return false; // Match fails if out of range child #.
1716 return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
1720 ALWAYS_INLINE static bool
1721 CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1723 return cast<CondCodeSDNode>(N)->get() ==
1724 (ISD::CondCode)MatcherTable[MatcherIndex++];
1727 ALWAYS_INLINE static bool
1728 CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1729 SDValue N, const TargetLowering &TLI) {
1730 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1731 if (cast<VTSDNode>(N)->getVT() == VT)
1734 // Handle the case when VT is iPTR.
1735 return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy();
1738 ALWAYS_INLINE static bool
1739 CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1741 int64_t Val = MatcherTable[MatcherIndex++];
1743 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1745 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
1746 return C != 0 && C->getSExtValue() == Val;
1749 ALWAYS_INLINE static bool
1750 CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1751 SDValue N, SelectionDAGISel &SDISel) {
1752 int64_t Val = MatcherTable[MatcherIndex++];
1754 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1756 if (N->getOpcode() != ISD::AND) return false;
1758 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1759 return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val);
1762 ALWAYS_INLINE static bool
1763 CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1764 SDValue N, SelectionDAGISel &SDISel) {
1765 int64_t Val = MatcherTable[MatcherIndex++];
1767 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1769 if (N->getOpcode() != ISD::OR) return false;
1771 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1772 return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val);
1775 /// IsPredicateKnownToFail - If we know how and can do so without pushing a
1776 /// scope, evaluate the current node. If the current predicate is known to
1777 /// fail, set Result=true and return anything. If the current predicate is
1778 /// known to pass, set Result=false and return the MatcherIndex to continue
1779 /// with. If the current predicate is unknown, set Result=false and return the
1780 /// MatcherIndex to continue with.
1781 static unsigned IsPredicateKnownToFail(const unsigned char *Table,
1782 unsigned Index, SDValue N,
1783 bool &Result, SelectionDAGISel &SDISel,
1784 SmallVectorImpl<SDValue> &RecordedNodes){
1785 switch (Table[Index++]) {
1788 return Index-1; // Could not evaluate this predicate.
1789 case SelectionDAGISel::OPC_CheckSame:
1790 Result = !::CheckSame(Table, Index, N, RecordedNodes);
1792 case SelectionDAGISel::OPC_CheckPatternPredicate:
1793 Result = !::CheckPatternPredicate(Table, Index, SDISel);
1795 case SelectionDAGISel::OPC_CheckPredicate:
1796 Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
1798 case SelectionDAGISel::OPC_CheckOpcode:
1799 Result = !::CheckOpcode(Table, Index, N.getNode());
1801 case SelectionDAGISel::OPC_CheckType:
1802 Result = !::CheckType(Table, Index, N, SDISel.TLI);
1804 case SelectionDAGISel::OPC_CheckChild0Type:
1805 case SelectionDAGISel::OPC_CheckChild1Type:
1806 case SelectionDAGISel::OPC_CheckChild2Type:
1807 case SelectionDAGISel::OPC_CheckChild3Type:
1808 case SelectionDAGISel::OPC_CheckChild4Type:
1809 case SelectionDAGISel::OPC_CheckChild5Type:
1810 case SelectionDAGISel::OPC_CheckChild6Type:
1811 case SelectionDAGISel::OPC_CheckChild7Type:
1812 Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
1813 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type);
1815 case SelectionDAGISel::OPC_CheckCondCode:
1816 Result = !::CheckCondCode(Table, Index, N);
1818 case SelectionDAGISel::OPC_CheckValueType:
1819 Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
1821 case SelectionDAGISel::OPC_CheckInteger:
1822 Result = !::CheckInteger(Table, Index, N);
1824 case SelectionDAGISel::OPC_CheckAndImm:
1825 Result = !::CheckAndImm(Table, Index, N, SDISel);
1827 case SelectionDAGISel::OPC_CheckOrImm:
1828 Result = !::CheckOrImm(Table, Index, N, SDISel);
1836 /// FailIndex - If this match fails, this is the index to continue with.
1839 /// NodeStack - The node stack when the scope was formed.
1840 SmallVector<SDValue, 4> NodeStack;
1842 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
1843 unsigned NumRecordedNodes;
1845 /// NumMatchedMemRefs - The number of matched memref entries.
1846 unsigned NumMatchedMemRefs;
1848 /// InputChain/InputFlag - The current chain/flag
1849 SDValue InputChain, InputFlag;
1851 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
1852 bool HasChainNodesMatched, HasFlagResultNodesMatched;
1857 SDNode *SelectionDAGISel::
1858 SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
1859 unsigned TableSize) {
1860 // FIXME: Should these even be selected? Handle these cases in the caller?
1861 switch (NodeToMatch->getOpcode()) {
1864 case ISD::EntryToken: // These nodes remain the same.
1865 case ISD::BasicBlock:
1867 //case ISD::VALUETYPE:
1868 //case ISD::CONDCODE:
1869 case ISD::HANDLENODE:
1870 case ISD::MDNODE_SDNODE:
1871 case ISD::TargetConstant:
1872 case ISD::TargetConstantFP:
1873 case ISD::TargetConstantPool:
1874 case ISD::TargetFrameIndex:
1875 case ISD::TargetExternalSymbol:
1876 case ISD::TargetBlockAddress:
1877 case ISD::TargetJumpTable:
1878 case ISD::TargetGlobalTLSAddress:
1879 case ISD::TargetGlobalAddress:
1880 case ISD::TokenFactor:
1881 case ISD::CopyFromReg:
1882 case ISD::CopyToReg:
1884 NodeToMatch->setNodeId(-1); // Mark selected.
1886 case ISD::AssertSext:
1887 case ISD::AssertZext:
1888 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
1889 NodeToMatch->getOperand(0));
1891 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
1892 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
1895 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
1897 // Set up the node stack with NodeToMatch as the only node on the stack.
1898 SmallVector<SDValue, 8> NodeStack;
1899 SDValue N = SDValue(NodeToMatch, 0);
1900 NodeStack.push_back(N);
1902 // MatchScopes - Scopes used when matching, if a match failure happens, this
1903 // indicates where to continue checking.
1904 SmallVector<MatchScope, 8> MatchScopes;
1906 // RecordedNodes - This is the set of nodes that have been recorded by the
1908 SmallVector<SDValue, 8> RecordedNodes;
1910 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
1912 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
1914 // These are the current input chain and flag for use when generating nodes.
1915 // Various Emit operations change these. For example, emitting a copytoreg
1916 // uses and updates these.
1917 SDValue InputChain, InputFlag;
1919 // ChainNodesMatched - If a pattern matches nodes that have input/output
1920 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
1921 // which ones they are. The result is captured into this list so that we can
1922 // update the chain results when the pattern is complete.
1923 SmallVector<SDNode*, 3> ChainNodesMatched;
1924 SmallVector<SDNode*, 3> FlagResultNodesMatched;
1926 DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
1927 NodeToMatch->dump(CurDAG);
1930 // Determine where to start the interpreter. Normally we start at opcode #0,
1931 // but if the state machine starts with an OPC_SwitchOpcode, then we
1932 // accelerate the first lookup (which is guaranteed to be hot) with the
1933 // OpcodeOffset table.
1934 unsigned MatcherIndex = 0;
1936 if (!OpcodeOffset.empty()) {
1937 // Already computed the OpcodeOffset table, just index into it.
1938 if (N.getOpcode() < OpcodeOffset.size())
1939 MatcherIndex = OpcodeOffset[N.getOpcode()];
1940 DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n");
1942 } else if (MatcherTable[0] == OPC_SwitchOpcode) {
1943 // Otherwise, the table isn't computed, but the state machine does start
1944 // with an OPC_SwitchOpcode instruction. Populate the table now, since this
1945 // is the first time we're selecting an instruction.
1948 // Get the size of this case.
1949 unsigned CaseSize = MatcherTable[Idx++];
1951 CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
1952 if (CaseSize == 0) break;
1954 // Get the opcode, add the index to the table.
1955 uint16_t Opc = MatcherTable[Idx++];
1956 Opc |= (unsigned short)MatcherTable[Idx++] << 8;
1957 if (Opc >= OpcodeOffset.size())
1958 OpcodeOffset.resize((Opc+1)*2);
1959 OpcodeOffset[Opc] = Idx;
1963 // Okay, do the lookup for the first opcode.
1964 if (N.getOpcode() < OpcodeOffset.size())
1965 MatcherIndex = OpcodeOffset[N.getOpcode()];
1969 assert(MatcherIndex < TableSize && "Invalid index");
1971 unsigned CurrentOpcodeIndex = MatcherIndex;
1973 BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
1976 // Okay, the semantics of this operation are that we should push a scope
1977 // then evaluate the first child. However, pushing a scope only to have
1978 // the first check fail (which then pops it) is inefficient. If we can
1979 // determine immediately that the first check (or first several) will
1980 // immediately fail, don't even bother pushing a scope for them.
1984 unsigned NumToSkip = MatcherTable[MatcherIndex++];
1985 if (NumToSkip & 128)
1986 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
1987 // Found the end of the scope with no match.
1988 if (NumToSkip == 0) {
1993 FailIndex = MatcherIndex+NumToSkip;
1995 unsigned MatcherIndexOfPredicate = MatcherIndex;
1996 (void)MatcherIndexOfPredicate; // silence warning.
1998 // If we can't evaluate this predicate without pushing a scope (e.g. if
1999 // it is a 'MoveParent') or if the predicate succeeds on this node, we
2000 // push the scope and evaluate the full predicate chain.
2002 MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
2003 Result, *this, RecordedNodes);
2007 DEBUG(errs() << " Skipped scope entry (due to false predicate) at "
2008 << "index " << MatcherIndexOfPredicate
2009 << ", continuing at " << FailIndex << "\n");
2010 ++NumDAGIselRetries;
2012 // Otherwise, we know that this case of the Scope is guaranteed to fail,
2013 // move to the next case.
2014 MatcherIndex = FailIndex;
2017 // If the whole scope failed to match, bail.
2018 if (FailIndex == 0) break;
2020 // Push a MatchScope which indicates where to go if the first child fails
2022 MatchScope NewEntry;
2023 NewEntry.FailIndex = FailIndex;
2024 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
2025 NewEntry.NumRecordedNodes = RecordedNodes.size();
2026 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
2027 NewEntry.InputChain = InputChain;
2028 NewEntry.InputFlag = InputFlag;
2029 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
2030 NewEntry.HasFlagResultNodesMatched = !FlagResultNodesMatched.empty();
2031 MatchScopes.push_back(NewEntry);
2034 case OPC_RecordNode:
2035 // Remember this node, it may end up being an operand in the pattern.
2036 RecordedNodes.push_back(N);
2039 case OPC_RecordChild0: case OPC_RecordChild1:
2040 case OPC_RecordChild2: case OPC_RecordChild3:
2041 case OPC_RecordChild4: case OPC_RecordChild5:
2042 case OPC_RecordChild6: case OPC_RecordChild7: {
2043 unsigned ChildNo = Opcode-OPC_RecordChild0;
2044 if (ChildNo >= N.getNumOperands())
2045 break; // Match fails if out of range child #.
2047 RecordedNodes.push_back(N->getOperand(ChildNo));
2050 case OPC_RecordMemRef:
2051 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
2054 case OPC_CaptureFlagInput:
2055 // If the current node has an input flag, capture it in InputFlag.
2056 if (N->getNumOperands() != 0 &&
2057 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag)
2058 InputFlag = N->getOperand(N->getNumOperands()-1);
2061 case OPC_MoveChild: {
2062 unsigned ChildNo = MatcherTable[MatcherIndex++];
2063 if (ChildNo >= N.getNumOperands())
2064 break; // Match fails if out of range child #.
2065 N = N.getOperand(ChildNo);
2066 NodeStack.push_back(N);
2070 case OPC_MoveParent:
2071 // Pop the current node off the NodeStack.
2072 NodeStack.pop_back();
2073 assert(!NodeStack.empty() && "Node stack imbalance!");
2074 N = NodeStack.back();
2078 if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
2080 case OPC_CheckPatternPredicate:
2081 if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
2083 case OPC_CheckPredicate:
2084 if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
2088 case OPC_CheckComplexPat: {
2089 unsigned CPNum = MatcherTable[MatcherIndex++];
2090 unsigned RecNo = MatcherTable[MatcherIndex++];
2091 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
2092 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo], CPNum,
2097 case OPC_CheckOpcode:
2098 if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
2102 if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break;
2105 case OPC_SwitchOpcode: {
2106 unsigned CurNodeOpcode = N.getOpcode();
2107 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2110 // Get the size of this case.
2111 CaseSize = MatcherTable[MatcherIndex++];
2113 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2114 if (CaseSize == 0) break;
2116 uint16_t Opc = MatcherTable[MatcherIndex++];
2117 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2119 // If the opcode matches, then we will execute this case.
2120 if (CurNodeOpcode == Opc)
2123 // Otherwise, skip over this case.
2124 MatcherIndex += CaseSize;
2127 // If no cases matched, bail out.
2128 if (CaseSize == 0) break;
2130 // Otherwise, execute the case we found.
2131 DEBUG(errs() << " OpcodeSwitch from " << SwitchStart
2132 << " to " << MatcherIndex << "\n");
2136 case OPC_SwitchType: {
2137 MVT::SimpleValueType CurNodeVT = N.getValueType().getSimpleVT().SimpleTy;
2138 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2141 // Get the size of this case.
2142 CaseSize = MatcherTable[MatcherIndex++];
2144 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2145 if (CaseSize == 0) break;
2147 MVT::SimpleValueType CaseVT =
2148 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2149 if (CaseVT == MVT::iPTR)
2150 CaseVT = TLI.getPointerTy().SimpleTy;
2152 // If the VT matches, then we will execute this case.
2153 if (CurNodeVT == CaseVT)
2156 // Otherwise, skip over this case.
2157 MatcherIndex += CaseSize;
2160 // If no cases matched, bail out.
2161 if (CaseSize == 0) break;
2163 // Otherwise, execute the case we found.
2164 DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
2165 << "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
2168 case OPC_CheckChild0Type: case OPC_CheckChild1Type:
2169 case OPC_CheckChild2Type: case OPC_CheckChild3Type:
2170 case OPC_CheckChild4Type: case OPC_CheckChild5Type:
2171 case OPC_CheckChild6Type: case OPC_CheckChild7Type:
2172 if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
2173 Opcode-OPC_CheckChild0Type))
2176 case OPC_CheckCondCode:
2177 if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
2179 case OPC_CheckValueType:
2180 if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break;
2182 case OPC_CheckInteger:
2183 if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
2185 case OPC_CheckAndImm:
2186 if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
2188 case OPC_CheckOrImm:
2189 if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
2192 case OPC_CheckFoldableChainNode: {
2193 assert(NodeStack.size() != 1 && "No parent node");
2194 // Verify that all intermediate nodes between the root and this one have
2196 bool HasMultipleUses = false;
2197 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
2198 if (!NodeStack[i].hasOneUse()) {
2199 HasMultipleUses = true;
2202 if (HasMultipleUses) break;
2204 // Check to see that the target thinks this is profitable to fold and that
2205 // we can fold it without inducing cycles in the graph.
2206 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2208 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2209 NodeToMatch, OptLevel,
2210 true/*We validate our own chains*/))
2215 case OPC_EmitInteger: {
2216 MVT::SimpleValueType VT =
2217 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2218 int64_t Val = MatcherTable[MatcherIndex++];
2220 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2221 RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT));
2224 case OPC_EmitRegister: {
2225 MVT::SimpleValueType VT =
2226 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2227 unsigned RegNo = MatcherTable[MatcherIndex++];
2228 RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT));
2232 case OPC_EmitConvertToTarget: {
2233 // Convert from IMM/FPIMM to target version.
2234 unsigned RecNo = MatcherTable[MatcherIndex++];
2235 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2236 SDValue Imm = RecordedNodes[RecNo];
2238 if (Imm->getOpcode() == ISD::Constant) {
2239 int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
2240 Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
2241 } else if (Imm->getOpcode() == ISD::ConstantFP) {
2242 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
2243 Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
2246 RecordedNodes.push_back(Imm);
2250 case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
2251 case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
2252 // These are space-optimized forms of OPC_EmitMergeInputChains.
2253 assert(InputChain.getNode() == 0 &&
2254 "EmitMergeInputChains should be the first chain producing node");
2255 assert(ChainNodesMatched.empty() &&
2256 "Should only have one EmitMergeInputChains per match");
2258 // Read all of the chained nodes.
2259 unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
2260 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2261 ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2263 // FIXME: What if other value results of the node have uses not matched
2265 if (ChainNodesMatched.back() != NodeToMatch &&
2266 !RecordedNodes[RecNo].hasOneUse()) {
2267 ChainNodesMatched.clear();
2271 // Merge the input chains if they are not intra-pattern references.
2272 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2274 if (InputChain.getNode() == 0)
2275 break; // Failed to merge.
2279 case OPC_EmitMergeInputChains: {
2280 assert(InputChain.getNode() == 0 &&
2281 "EmitMergeInputChains should be the first chain producing node");
2282 // This node gets a list of nodes we matched in the input that have
2283 // chains. We want to token factor all of the input chains to these nodes
2284 // together. However, if any of the input chains is actually one of the
2285 // nodes matched in this pattern, then we have an intra-match reference.
2286 // Ignore these because the newly token factored chain should not refer to
2288 unsigned NumChains = MatcherTable[MatcherIndex++];
2289 assert(NumChains != 0 && "Can't TF zero chains");
2291 assert(ChainNodesMatched.empty() &&
2292 "Should only have one EmitMergeInputChains per match");
2294 // Read all of the chained nodes.
2295 for (unsigned i = 0; i != NumChains; ++i) {
2296 unsigned RecNo = MatcherTable[MatcherIndex++];
2297 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2298 ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2300 // FIXME: What if other value results of the node have uses not matched
2302 if (ChainNodesMatched.back() != NodeToMatch &&
2303 !RecordedNodes[RecNo].hasOneUse()) {
2304 ChainNodesMatched.clear();
2309 // If the inner loop broke out, the match fails.
2310 if (ChainNodesMatched.empty())
2313 // Merge the input chains if they are not intra-pattern references.
2314 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2316 if (InputChain.getNode() == 0)
2317 break; // Failed to merge.
2322 case OPC_EmitCopyToReg: {
2323 unsigned RecNo = MatcherTable[MatcherIndex++];
2324 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2325 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
2327 if (InputChain.getNode() == 0)
2328 InputChain = CurDAG->getEntryNode();
2330 InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
2331 DestPhysReg, RecordedNodes[RecNo],
2334 InputFlag = InputChain.getValue(1);
2338 case OPC_EmitNodeXForm: {
2339 unsigned XFormNo = MatcherTable[MatcherIndex++];
2340 unsigned RecNo = MatcherTable[MatcherIndex++];
2341 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2342 RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo));
2347 case OPC_MorphNodeTo: {
2348 uint16_t TargetOpc = MatcherTable[MatcherIndex++];
2349 TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2350 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
2351 // Get the result VT list.
2352 unsigned NumVTs = MatcherTable[MatcherIndex++];
2353 SmallVector<EVT, 4> VTs;
2354 for (unsigned i = 0; i != NumVTs; ++i) {
2355 MVT::SimpleValueType VT =
2356 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2357 if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
2361 if (EmitNodeInfo & OPFL_Chain)
2362 VTs.push_back(MVT::Other);
2363 if (EmitNodeInfo & OPFL_FlagOutput)
2364 VTs.push_back(MVT::Flag);
2366 // This is hot code, so optimize the two most common cases of 1 and 2
2369 if (VTs.size() == 1)
2370 VTList = CurDAG->getVTList(VTs[0]);
2371 else if (VTs.size() == 2)
2372 VTList = CurDAG->getVTList(VTs[0], VTs[1]);
2374 VTList = CurDAG->getVTList(VTs.data(), VTs.size());
2376 // Get the operand list.
2377 unsigned NumOps = MatcherTable[MatcherIndex++];
2378 SmallVector<SDValue, 8> Ops;
2379 for (unsigned i = 0; i != NumOps; ++i) {
2380 unsigned RecNo = MatcherTable[MatcherIndex++];
2382 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2384 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
2385 Ops.push_back(RecordedNodes[RecNo]);
2388 // If there are variadic operands to add, handle them now.
2389 if (EmitNodeInfo & OPFL_VariadicInfo) {
2390 // Determine the start index to copy from.
2391 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
2392 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
2393 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
2394 "Invalid variadic node");
2395 // Copy all of the variadic operands, not including a potential flag
2397 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
2399 SDValue V = NodeToMatch->getOperand(i);
2400 if (V.getValueType() == MVT::Flag) break;
2405 // If this has chain/flag inputs, add them.
2406 if (EmitNodeInfo & OPFL_Chain)
2407 Ops.push_back(InputChain);
2408 if ((EmitNodeInfo & OPFL_FlagInput) && InputFlag.getNode() != 0)
2409 Ops.push_back(InputFlag);
2413 if (Opcode != OPC_MorphNodeTo) {
2414 // If this is a normal EmitNode command, just create the new node and
2415 // add the results to the RecordedNodes list.
2416 Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(),
2417 VTList, Ops.data(), Ops.size());
2419 // Add all the non-flag/non-chain results to the RecordedNodes list.
2420 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
2421 if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break;
2422 RecordedNodes.push_back(SDValue(Res, i));
2426 Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(),
2430 // If the node had chain/flag results, update our notion of the current
2432 if (EmitNodeInfo & OPFL_FlagOutput) {
2433 InputFlag = SDValue(Res, VTs.size()-1);
2434 if (EmitNodeInfo & OPFL_Chain)
2435 InputChain = SDValue(Res, VTs.size()-2);
2436 } else if (EmitNodeInfo & OPFL_Chain)
2437 InputChain = SDValue(Res, VTs.size()-1);
2439 // If the OPFL_MemRefs flag is set on this node, slap all of the
2440 // accumulated memrefs onto it.
2442 // FIXME: This is vastly incorrect for patterns with multiple outputs
2443 // instructions that access memory and for ComplexPatterns that match
2445 if (EmitNodeInfo & OPFL_MemRefs) {
2446 MachineSDNode::mmo_iterator MemRefs =
2447 MF->allocateMemRefsArray(MatchedMemRefs.size());
2448 std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs);
2449 cast<MachineSDNode>(Res)
2450 ->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size());
2454 << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
2455 << " node: "; Res->dump(CurDAG); errs() << "\n");
2457 // If this was a MorphNodeTo then we're completely done!
2458 if (Opcode == OPC_MorphNodeTo) {
2459 // Update chain and flag uses.
2460 UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched,
2461 InputFlag, FlagResultNodesMatched, true);
2468 case OPC_MarkFlagResults: {
2469 unsigned NumNodes = MatcherTable[MatcherIndex++];
2471 // Read and remember all the flag-result nodes.
2472 for (unsigned i = 0; i != NumNodes; ++i) {
2473 unsigned RecNo = MatcherTable[MatcherIndex++];
2475 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2477 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2478 FlagResultNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2483 case OPC_CompleteMatch: {
2484 // The match has been completed, and any new nodes (if any) have been
2485 // created. Patch up references to the matched dag to use the newly
2487 unsigned NumResults = MatcherTable[MatcherIndex++];
2489 for (unsigned i = 0; i != NumResults; ++i) {
2490 unsigned ResSlot = MatcherTable[MatcherIndex++];
2492 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
2494 assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
2495 SDValue Res = RecordedNodes[ResSlot];
2497 assert(i < NodeToMatch->getNumValues() &&
2498 NodeToMatch->getValueType(i) != MVT::Other &&
2499 NodeToMatch->getValueType(i) != MVT::Flag &&
2500 "Invalid number of results to complete!");
2501 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
2502 NodeToMatch->getValueType(i) == MVT::iPTR ||
2503 Res.getValueType() == MVT::iPTR ||
2504 NodeToMatch->getValueType(i).getSizeInBits() ==
2505 Res.getValueType().getSizeInBits()) &&
2506 "invalid replacement");
2507 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
2510 // If the root node defines a flag, add it to the flag nodes to update
2512 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Flag)
2513 FlagResultNodesMatched.push_back(NodeToMatch);
2515 // Update chain and flag uses.
2516 UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched,
2517 InputFlag, FlagResultNodesMatched, false);
2519 assert(NodeToMatch->use_empty() &&
2520 "Didn't replace all uses of the node?");
2522 // FIXME: We just return here, which interacts correctly with SelectRoot
2523 // above. We should fix this to not return an SDNode* anymore.
2528 // If the code reached this point, then the match failed. See if there is
2529 // another child to try in the current 'Scope', otherwise pop it until we
2530 // find a case to check.
2531 DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
2532 ++NumDAGIselRetries;
2534 if (MatchScopes.empty()) {
2535 CannotYetSelect(NodeToMatch);
2539 // Restore the interpreter state back to the point where the scope was
2541 MatchScope &LastScope = MatchScopes.back();
2542 RecordedNodes.resize(LastScope.NumRecordedNodes);
2544 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
2545 N = NodeStack.back();
2547 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
2548 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
2549 MatcherIndex = LastScope.FailIndex;
2551 DEBUG(errs() << " Continuing at " << MatcherIndex << "\n");
2553 InputChain = LastScope.InputChain;
2554 InputFlag = LastScope.InputFlag;
2555 if (!LastScope.HasChainNodesMatched)
2556 ChainNodesMatched.clear();
2557 if (!LastScope.HasFlagResultNodesMatched)
2558 FlagResultNodesMatched.clear();
2560 // Check to see what the offset is at the new MatcherIndex. If it is zero
2561 // we have reached the end of this scope, otherwise we have another child
2562 // in the current scope to try.
2563 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2564 if (NumToSkip & 128)
2565 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2567 // If we have another child in this scope to match, update FailIndex and
2569 if (NumToSkip != 0) {
2570 LastScope.FailIndex = MatcherIndex+NumToSkip;
2574 // End of this scope, pop it and try the next child in the containing
2576 MatchScopes.pop_back();
2583 void SelectionDAGISel::CannotYetSelect(SDNode *N) {
2585 raw_string_ostream Msg(msg);
2586 Msg << "Cannot yet select: ";
2588 if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
2589 N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
2590 N->getOpcode() != ISD::INTRINSIC_VOID) {
2591 N->printrFull(Msg, CurDAG);
2593 bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
2595 cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
2596 if (iid < Intrinsic::num_intrinsics)
2597 Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
2598 else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
2599 Msg << "target intrinsic %" << TII->getName(iid);
2601 Msg << "unknown intrinsic #" << iid;
2603 report_fatal_error(Msg.str());
2606 char SelectionDAGISel::ID = 0;