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/Module.h"
29 #include "llvm/CodeGen/FastISel.h"
30 #include "llvm/CodeGen/GCStrategy.h"
31 #include "llvm/CodeGen/GCMetadata.h"
32 #include "llvm/CodeGen/MachineFrameInfo.h"
33 #include "llvm/CodeGen/MachineFunction.h"
34 #include "llvm/CodeGen/MachineInstrBuilder.h"
35 #include "llvm/CodeGen/MachineModuleInfo.h"
36 #include "llvm/CodeGen/MachineRegisterInfo.h"
37 #include "llvm/CodeGen/ScheduleHazardRecognizer.h"
38 #include "llvm/CodeGen/SchedulerRegistry.h"
39 #include "llvm/CodeGen/SelectionDAG.h"
40 #include "llvm/Target/TargetRegisterInfo.h"
41 #include "llvm/Target/TargetIntrinsicInfo.h"
42 #include "llvm/Target/TargetInstrInfo.h"
43 #include "llvm/Target/TargetLowering.h"
44 #include "llvm/Target/TargetMachine.h"
45 #include "llvm/Target/TargetOptions.h"
46 #include "llvm/Support/Compiler.h"
47 #include "llvm/Support/Debug.h"
48 #include "llvm/Support/ErrorHandling.h"
49 #include "llvm/Support/Timer.h"
50 #include "llvm/Support/raw_ostream.h"
51 #include "llvm/ADT/Statistic.h"
55 STATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on");
56 STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
59 EnableFastISelVerbose("fast-isel-verbose", cl::Hidden,
60 cl::desc("Enable verbose messages in the \"fast\" "
61 "instruction selector"));
63 EnableFastISelAbort("fast-isel-abort", cl::Hidden,
64 cl::desc("Enable abort calls when \"fast\" instruction fails"));
68 ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
69 cl::desc("Pop up a window to show dags before the first "
72 ViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden,
73 cl::desc("Pop up a window to show dags before legalize types"));
75 ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
76 cl::desc("Pop up a window to show dags before legalize"));
78 ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
79 cl::desc("Pop up a window to show dags before the second "
82 ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
83 cl::desc("Pop up a window to show dags before the post legalize types"
84 " dag combine pass"));
86 ViewISelDAGs("view-isel-dags", cl::Hidden,
87 cl::desc("Pop up a window to show isel dags as they are selected"));
89 ViewSchedDAGs("view-sched-dags", cl::Hidden,
90 cl::desc("Pop up a window to show sched dags as they are processed"));
92 ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
93 cl::desc("Pop up a window to show SUnit dags after they are processed"));
95 static const bool ViewDAGCombine1 = false,
96 ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false,
97 ViewDAGCombine2 = false,
98 ViewDAGCombineLT = false,
99 ViewISelDAGs = false, ViewSchedDAGs = false,
100 ViewSUnitDAGs = false;
103 //===---------------------------------------------------------------------===//
105 /// RegisterScheduler class - Track the registration of instruction schedulers.
107 //===---------------------------------------------------------------------===//
108 MachinePassRegistry RegisterScheduler::Registry;
110 //===---------------------------------------------------------------------===//
112 /// ISHeuristic command line option for instruction schedulers.
114 //===---------------------------------------------------------------------===//
115 static cl::opt<RegisterScheduler::FunctionPassCtor, false,
116 RegisterPassParser<RegisterScheduler> >
117 ISHeuristic("pre-RA-sched",
118 cl::init(&createDefaultScheduler),
119 cl::desc("Instruction schedulers available (before register"
122 static RegisterScheduler
123 defaultListDAGScheduler("default", "Best scheduler for the target",
124 createDefaultScheduler);
127 //===--------------------------------------------------------------------===//
128 /// createDefaultScheduler - This creates an instruction scheduler appropriate
130 ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS,
131 CodeGenOpt::Level OptLevel) {
132 const TargetLowering &TLI = IS->getTargetLowering();
134 if (OptLevel == CodeGenOpt::None)
135 return createFastDAGScheduler(IS, OptLevel);
136 if (TLI.getSchedulingPreference() == Sched::Latency)
137 return createTDListDAGScheduler(IS, OptLevel);
138 if (TLI.getSchedulingPreference() == Sched::RegPressure)
139 return createBURRListDAGScheduler(IS, OptLevel);
140 assert(TLI.getSchedulingPreference() == Sched::Hybrid &&
141 "Unknown sched type!");
142 return createHybridListDAGScheduler(IS, OptLevel);
146 // EmitInstrWithCustomInserter - This method should be implemented by targets
147 // that mark instructions with the 'usesCustomInserter' flag. These
148 // instructions are special in various ways, which require special support to
149 // insert. The specified MachineInstr is created but not inserted into any
150 // basic blocks, and this method is called to expand it into a sequence of
151 // instructions, potentially also creating new basic blocks and control flow.
152 // When new basic blocks are inserted and the edges from MBB to its successors
153 // are modified, the method should insert pairs of <OldSucc, NewSucc> into the
156 TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
157 MachineBasicBlock *MBB) const {
159 dbgs() << "If a target marks an instruction with "
160 "'usesCustomInserter', it must implement "
161 "TargetLowering::EmitInstrWithCustomInserter!";
167 //===----------------------------------------------------------------------===//
168 // SelectionDAGISel code
169 //===----------------------------------------------------------------------===//
171 SelectionDAGISel::SelectionDAGISel(const TargetMachine &tm, CodeGenOpt::Level OL) :
172 MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()),
173 FuncInfo(new FunctionLoweringInfo(TLI)),
174 CurDAG(new SelectionDAG(tm)),
175 SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
181 SelectionDAGISel::~SelectionDAGISel() {
187 void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
188 AU.addRequired<AliasAnalysis>();
189 AU.addPreserved<AliasAnalysis>();
190 AU.addRequired<GCModuleInfo>();
191 AU.addPreserved<GCModuleInfo>();
192 MachineFunctionPass::getAnalysisUsage(AU);
195 /// FunctionCallsSetJmp - Return true if the function has a call to setjmp or
196 /// other function that gcc recognizes as "returning twice". This is used to
197 /// limit code-gen optimizations on the machine function.
199 /// FIXME: Remove after <rdar://problem/8031714> is fixed.
200 static bool FunctionCallsSetJmp(const Function *F) {
201 const Module *M = F->getParent();
202 static const char *ReturnsTwiceFns[] = {
211 #define NUM_RETURNS_TWICE_FNS sizeof(ReturnsTwiceFns) / sizeof(const char *)
213 for (unsigned I = 0; I < NUM_RETURNS_TWICE_FNS; ++I)
214 if (const Function *Callee = M->getFunction(ReturnsTwiceFns[I])) {
215 if (!Callee->use_empty())
216 for (Value::const_use_iterator
217 I = Callee->use_begin(), E = Callee->use_end();
219 if (const CallInst *CI = dyn_cast<CallInst>(I))
220 if (CI->getParent()->getParent() == F)
225 #undef NUM_RETURNS_TWICE_FNS
228 bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
229 // Do some sanity-checking on the command-line options.
230 assert((!EnableFastISelVerbose || EnableFastISel) &&
231 "-fast-isel-verbose requires -fast-isel");
232 assert((!EnableFastISelAbort || EnableFastISel) &&
233 "-fast-isel-abort requires -fast-isel");
235 const Function &Fn = *mf.getFunction();
236 const TargetInstrInfo &TII = *TM.getInstrInfo();
237 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
240 RegInfo = &MF->getRegInfo();
241 AA = &getAnalysis<AliasAnalysis>();
242 GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0;
244 DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
247 FuncInfo->set(Fn, *MF);
250 SelectAllBasicBlocks(Fn);
252 // If the first basic block in the function has live ins that need to be
253 // copied into vregs, emit the copies into the top of the block before
254 // emitting the code for the block.
255 MachineBasicBlock *EntryMBB = MF->begin();
256 RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII);
258 DenseMap<unsigned, unsigned> LiveInMap;
259 if (!FuncInfo->ArgDbgValues.empty())
260 for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(),
261 E = RegInfo->livein_end(); LI != E; ++LI)
263 LiveInMap.insert(std::make_pair(LI->first, LI->second));
265 // Insert DBG_VALUE instructions for function arguments to the entry block.
266 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
267 MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
268 unsigned Reg = MI->getOperand(0).getReg();
269 if (TargetRegisterInfo::isPhysicalRegister(Reg))
270 EntryMBB->insert(EntryMBB->begin(), MI);
272 MachineInstr *Def = RegInfo->getVRegDef(Reg);
273 MachineBasicBlock::iterator InsertPos = Def;
274 // FIXME: VR def may not be in entry block.
275 Def->getParent()->insert(llvm::next(InsertPos), MI);
278 // If Reg is live-in then update debug info to track its copy in a vreg.
279 DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg);
280 if (LDI != LiveInMap.end()) {
281 MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
282 MachineBasicBlock::iterator InsertPos = Def;
283 const MDNode *Variable =
284 MI->getOperand(MI->getNumOperands()-1).getMetadata();
285 unsigned Offset = MI->getOperand(1).getImm();
286 // Def is never a terminator here, so it is ok to increment InsertPos.
287 BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(),
288 TII.get(TargetOpcode::DBG_VALUE))
289 .addReg(LDI->second, RegState::Debug)
290 .addImm(Offset).addMetadata(Variable);
294 // Determine if there are any calls in this machine function.
295 MachineFrameInfo *MFI = MF->getFrameInfo();
296 if (!MFI->hasCalls()) {
297 for (MachineFunction::const_iterator
298 I = MF->begin(), E = MF->end(); I != E; ++I) {
299 const MachineBasicBlock *MBB = I;
300 for (MachineBasicBlock::const_iterator
301 II = MBB->begin(), IE = MBB->end(); II != IE; ++II) {
302 const TargetInstrDesc &TID = TM.getInstrInfo()->get(II->getOpcode());
303 if (II->isInlineAsm() || (TID.isCall() && !TID.isReturn())) {
304 MFI->setHasCalls(true);
312 // Determine if there is a call to setjmp in the machine function.
313 MF->setCallsSetJmp(FunctionCallsSetJmp(&Fn));
315 // Release function-specific state. SDB and CurDAG are already cleared
323 SelectionDAGISel::SelectBasicBlock(MachineBasicBlock *BB,
324 const BasicBlock *LLVMBB,
325 BasicBlock::const_iterator Begin,
326 BasicBlock::const_iterator End,
328 // Lower all of the non-terminator instructions. If a call is emitted
329 // as a tail call, cease emitting nodes for this block. Terminators
330 // are handled below.
331 for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
334 // Make sure the root of the DAG is up-to-date.
335 CurDAG->setRoot(SDB->getControlRoot());
336 HadTailCall = SDB->HasTailCall;
339 // Final step, emit the lowered DAG as machine code.
340 return CodeGenAndEmitDAG(BB);
344 /// WorkListRemover - This class is a DAGUpdateListener that removes any deleted
345 /// nodes from the worklist.
346 class SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener {
347 SmallVector<SDNode*, 128> &Worklist;
348 SmallPtrSet<SDNode*, 128> &InWorklist;
350 SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl,
351 SmallPtrSet<SDNode*, 128> &inwl)
352 : Worklist(wl), InWorklist(inwl) {}
354 void RemoveFromWorklist(SDNode *N) {
355 if (!InWorklist.erase(N)) return;
357 SmallVector<SDNode*, 128>::iterator I =
358 std::find(Worklist.begin(), Worklist.end(), N);
359 assert(I != Worklist.end() && "Not in worklist");
361 *I = Worklist.back();
365 virtual void NodeDeleted(SDNode *N, SDNode *E) {
366 RemoveFromWorklist(N);
369 virtual void NodeUpdated(SDNode *N) {
375 void SelectionDAGISel::ComputeLiveOutVRegInfo() {
376 SmallPtrSet<SDNode*, 128> VisitedNodes;
377 SmallVector<SDNode*, 128> Worklist;
379 Worklist.push_back(CurDAG->getRoot().getNode());
386 SDNode *N = Worklist.pop_back_val();
388 // If we've already seen this node, ignore it.
389 if (!VisitedNodes.insert(N))
392 // Otherwise, add all chain operands to the worklist.
393 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
394 if (N->getOperand(i).getValueType() == MVT::Other)
395 Worklist.push_back(N->getOperand(i).getNode());
397 // If this is a CopyToReg with a vreg dest, process it.
398 if (N->getOpcode() != ISD::CopyToReg)
401 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
402 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
405 // Ignore non-scalar or non-integer values.
406 SDValue Src = N->getOperand(2);
407 EVT SrcVT = Src.getValueType();
408 if (!SrcVT.isInteger() || SrcVT.isVector())
411 unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
412 Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
413 CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
415 // Only install this information if it tells us something.
416 if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) {
417 DestReg -= TargetRegisterInfo::FirstVirtualRegister;
418 if (DestReg >= FuncInfo->LiveOutRegInfo.size())
419 FuncInfo->LiveOutRegInfo.resize(DestReg+1);
420 FunctionLoweringInfo::LiveOutInfo &LOI =
421 FuncInfo->LiveOutRegInfo[DestReg];
422 LOI.NumSignBits = NumSignBits;
423 LOI.KnownOne = KnownOne;
424 LOI.KnownZero = KnownZero;
426 } while (!Worklist.empty());
429 MachineBasicBlock *SelectionDAGISel::CodeGenAndEmitDAG(MachineBasicBlock *BB) {
430 std::string GroupName;
431 if (TimePassesIsEnabled)
432 GroupName = "Instruction Selection and Scheduling";
433 std::string BlockName;
434 if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
435 ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
437 BlockName = MF->getFunction()->getNameStr() + ":" +
438 BB->getBasicBlock()->getNameStr();
440 DEBUG(dbgs() << "Initial selection DAG:\n");
441 DEBUG(CurDAG->dump());
443 if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName);
445 // Run the DAG combiner in pre-legalize mode.
447 NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled);
448 CurDAG->Combine(Unrestricted, *AA, OptLevel);
451 DEBUG(dbgs() << "Optimized lowered selection DAG:\n");
452 DEBUG(CurDAG->dump());
454 // Second step, hack on the DAG until it only uses operations and types that
455 // the target supports.
456 if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " +
461 NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled);
462 Changed = CurDAG->LegalizeTypes();
465 DEBUG(dbgs() << "Type-legalized selection DAG:\n");
466 DEBUG(CurDAG->dump());
469 if (ViewDAGCombineLT)
470 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
472 // Run the DAG combiner in post-type-legalize mode.
474 NamedRegionTimer T("DAG Combining after legalize types", GroupName,
475 TimePassesIsEnabled);
476 CurDAG->Combine(NoIllegalTypes, *AA, OptLevel);
479 DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n");
480 DEBUG(CurDAG->dump());
484 NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled);
485 Changed = CurDAG->LegalizeVectors();
490 NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled);
491 CurDAG->LegalizeTypes();
494 if (ViewDAGCombineLT)
495 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
497 // Run the DAG combiner in post-type-legalize mode.
499 NamedRegionTimer T("DAG Combining after legalize vectors", GroupName,
500 TimePassesIsEnabled);
501 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
504 DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n");
505 DEBUG(CurDAG->dump());
508 if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName);
511 NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled);
512 CurDAG->Legalize(OptLevel);
515 DEBUG(dbgs() << "Legalized selection DAG:\n");
516 DEBUG(CurDAG->dump());
518 if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName);
520 // Run the DAG combiner in post-legalize mode.
522 NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled);
523 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
526 DEBUG(dbgs() << "Optimized legalized selection DAG:\n");
527 DEBUG(CurDAG->dump());
529 if (OptLevel != CodeGenOpt::None)
530 ComputeLiveOutVRegInfo();
532 if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName);
534 // Third, instruction select all of the operations to machine code, adding the
535 // code to the MachineBasicBlock.
537 NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled);
538 DoInstructionSelection();
541 DEBUG(dbgs() << "Selected selection DAG:\n");
542 DEBUG(CurDAG->dump());
544 if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName);
546 // Schedule machine code.
547 ScheduleDAGSDNodes *Scheduler = CreateScheduler();
549 NamedRegionTimer T("Instruction Scheduling", GroupName,
550 TimePassesIsEnabled);
551 Scheduler->Run(CurDAG, BB, BB->end());
554 if (ViewSUnitDAGs) Scheduler->viewGraph();
556 // Emit machine code to BB. This can change 'BB' to the last block being
559 NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled);
560 BB = Scheduler->EmitSchedule();
563 // Free the scheduler state.
565 NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName,
566 TimePassesIsEnabled);
570 // Free the SelectionDAG state, now that we're finished with it.
576 void SelectionDAGISel::DoInstructionSelection() {
577 DEBUG(errs() << "===== Instruction selection begins:\n");
581 // Select target instructions for the DAG.
583 // Number all nodes with a topological order and set DAGSize.
584 DAGSize = CurDAG->AssignTopologicalOrder();
586 // Create a dummy node (which is not added to allnodes), that adds
587 // a reference to the root node, preventing it from being deleted,
588 // and tracking any changes of the root.
589 HandleSDNode Dummy(CurDAG->getRoot());
590 ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode());
593 // The AllNodes list is now topological-sorted. Visit the
594 // nodes by starting at the end of the list (the root of the
595 // graph) and preceding back toward the beginning (the entry
597 while (ISelPosition != CurDAG->allnodes_begin()) {
598 SDNode *Node = --ISelPosition;
599 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
600 // but there are currently some corner cases that it misses. Also, this
601 // makes it theoretically possible to disable the DAGCombiner.
602 if (Node->use_empty())
605 SDNode *ResNode = Select(Node);
607 // FIXME: This is pretty gross. 'Select' should be changed to not return
608 // anything at all and this code should be nuked with a tactical strike.
610 // If node should not be replaced, continue with the next one.
611 if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
615 ReplaceUses(Node, ResNode);
617 // If after the replacement this node is not used any more,
618 // remove this dead node.
619 if (Node->use_empty()) { // Don't delete EntryToken, etc.
620 ISelUpdater ISU(ISelPosition);
621 CurDAG->RemoveDeadNode(Node, &ISU);
625 CurDAG->setRoot(Dummy.getValue());
628 DEBUG(errs() << "===== Instruction selection ends:\n");
630 PostprocessISelDAG();
633 /// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
634 /// do other setup for EH landing-pad blocks.
635 void SelectionDAGISel::PrepareEHLandingPad(MachineBasicBlock *BB) {
636 // Add a label to mark the beginning of the landing pad. Deletion of the
637 // landing pad can thus be detected via the MachineModuleInfo.
638 MCSymbol *Label = MF->getMMI().addLandingPad(BB);
640 const TargetInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL);
641 BuildMI(BB, SDB->getCurDebugLoc(), II).addSym(Label);
643 // Mark exception register as live in.
644 unsigned Reg = TLI.getExceptionAddressRegister();
645 if (Reg) BB->addLiveIn(Reg);
647 // Mark exception selector register as live in.
648 Reg = TLI.getExceptionSelectorRegister();
649 if (Reg) BB->addLiveIn(Reg);
651 // FIXME: Hack around an exception handling flaw (PR1508): the personality
652 // function and list of typeids logically belong to the invoke (or, if you
653 // like, the basic block containing the invoke), and need to be associated
654 // with it in the dwarf exception handling tables. Currently however the
655 // information is provided by an intrinsic (eh.selector) that can be moved
656 // to unexpected places by the optimizers: if the unwind edge is critical,
657 // then breaking it can result in the intrinsics being in the successor of
658 // the landing pad, not the landing pad itself. This results
659 // in exceptions not being caught because no typeids are associated with
660 // the invoke. This may not be the only way things can go wrong, but it
661 // is the only way we try to work around for the moment.
662 const BasicBlock *LLVMBB = BB->getBasicBlock();
663 const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
665 if (Br && Br->isUnconditional()) { // Critical edge?
666 BasicBlock::const_iterator I, E;
667 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
668 if (isa<EHSelectorInst>(I))
672 // No catch info found - try to extract some from the successor.
673 CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo);
677 void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
678 // Initialize the Fast-ISel state, if needed.
679 FastISel *FastIS = 0;
681 FastIS = TLI.createFastISel(*MF, FuncInfo->ValueMap, FuncInfo->MBBMap,
682 FuncInfo->StaticAllocaMap,
683 FuncInfo->PHINodesToUpdate
685 , FuncInfo->CatchInfoLost
689 // Iterate over all basic blocks in the function.
690 for (Function::const_iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) {
691 const BasicBlock *LLVMBB = &*I;
692 MachineBasicBlock *BB = FuncInfo->MBBMap[LLVMBB];
694 BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
695 BasicBlock::const_iterator const End = LLVMBB->end();
696 BasicBlock::const_iterator BI = Begin;
698 // Lower any arguments needed in this block if this is the entry block.
699 if (LLVMBB == &Fn.getEntryBlock())
700 LowerArguments(LLVMBB);
702 // Setup an EH landing-pad block.
703 if (BB->isLandingPad())
704 PrepareEHLandingPad(BB);
706 // Before doing SelectionDAG ISel, see if FastISel has been requested.
708 // Emit code for any incoming arguments. This must happen before
709 // beginning FastISel on the entry block.
710 if (LLVMBB == &Fn.getEntryBlock()) {
711 CurDAG->setRoot(SDB->getControlRoot());
713 BB = CodeGenAndEmitDAG(BB);
715 FastIS->startNewBlock(BB);
716 // Do FastISel on as many instructions as possible.
717 for (; BI != End; ++BI) {
718 // Try to select the instruction with FastISel.
719 if (FastIS->SelectInstruction(BI))
722 // Then handle certain instructions as single-LLVM-Instruction blocks.
723 if (isa<CallInst>(BI)) {
724 ++NumFastIselFailures;
725 if (EnableFastISelVerbose || EnableFastISelAbort) {
726 dbgs() << "FastISel missed call: ";
730 if (!BI->getType()->isVoidTy() && !BI->use_empty()) {
731 unsigned &R = FuncInfo->ValueMap[BI];
733 R = FuncInfo->CreateRegForValue(BI);
736 bool HadTailCall = false;
737 BB = SelectBasicBlock(BB, LLVMBB, BI, llvm::next(BI), HadTailCall);
739 // If the call was emitted as a tail call, we're done with the block.
745 // If the instruction was codegen'd with multiple blocks,
746 // inform the FastISel object where to resume inserting.
747 FastIS->setCurrentBlock(BB);
751 // Otherwise, give up on FastISel for the rest of the block.
752 // For now, be a little lenient about non-branch terminators.
753 if (!isa<TerminatorInst>(BI) || isa<BranchInst>(BI)) {
754 ++NumFastIselFailures;
755 if (EnableFastISelVerbose || EnableFastISelAbort) {
756 dbgs() << "FastISel miss: ";
759 if (EnableFastISelAbort)
760 // The "fast" selector couldn't handle something and bailed.
761 // For the purpose of debugging, just abort.
762 llvm_unreachable("FastISel didn't select the entire block");
768 // Run SelectionDAG instruction selection on the remainder of the block
769 // not handled by FastISel. If FastISel is not run, this is the entire
773 BB = SelectBasicBlock(BB, LLVMBB, BI, End, HadTailCall);
776 FinishBasicBlock(BB);
777 FuncInfo->PHINodesToUpdate.clear();
784 SelectionDAGISel::FinishBasicBlock(MachineBasicBlock *BB) {
786 DEBUG(dbgs() << "Total amount of phi nodes to update: "
787 << FuncInfo->PHINodesToUpdate.size() << "\n");
788 DEBUG(for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
789 dbgs() << "Node " << i << " : ("
790 << FuncInfo->PHINodesToUpdate[i].first
791 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
793 // Next, now that we know what the last MBB the LLVM BB expanded is, update
794 // PHI nodes in successors.
795 if (SDB->SwitchCases.empty() &&
796 SDB->JTCases.empty() &&
797 SDB->BitTestCases.empty()) {
798 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
799 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
800 assert(PHI->isPHI() &&
801 "This is not a machine PHI node that we are updating!");
802 if (!BB->isSuccessor(PHI->getParent()))
805 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
806 PHI->addOperand(MachineOperand::CreateMBB(BB));
811 for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
812 // Lower header first, if it wasn't already lowered
813 if (!SDB->BitTestCases[i].Emitted) {
814 // Set the current basic block to the mbb we wish to insert the code into
815 BB = SDB->BitTestCases[i].Parent;
817 SDB->visitBitTestHeader(SDB->BitTestCases[i], BB);
818 CurDAG->setRoot(SDB->getRoot());
820 BB = CodeGenAndEmitDAG(BB);
823 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
824 // Set the current basic block to the mbb we wish to insert the code into
825 BB = SDB->BitTestCases[i].Cases[j].ThisBB;
828 SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB,
829 SDB->BitTestCases[i].Reg,
830 SDB->BitTestCases[i].Cases[j],
833 SDB->visitBitTestCase(SDB->BitTestCases[i].Default,
834 SDB->BitTestCases[i].Reg,
835 SDB->BitTestCases[i].Cases[j],
839 CurDAG->setRoot(SDB->getRoot());
841 BB = CodeGenAndEmitDAG(BB);
845 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
847 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
848 MachineBasicBlock *PHIBB = PHI->getParent();
849 assert(PHI->isPHI() &&
850 "This is not a machine PHI node that we are updating!");
851 // This is "default" BB. We have two jumps to it. From "header" BB and
852 // from last "case" BB.
853 if (PHIBB == SDB->BitTestCases[i].Default) {
854 PHI->addOperand(MachineOperand::
855 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
857 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent));
858 PHI->addOperand(MachineOperand::
859 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
861 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases.
864 // One of "cases" BB.
865 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
867 MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
868 if (cBB->isSuccessor(PHIBB)) {
869 PHI->addOperand(MachineOperand::
870 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
872 PHI->addOperand(MachineOperand::CreateMBB(cBB));
877 SDB->BitTestCases.clear();
879 // If the JumpTable record is filled in, then we need to emit a jump table.
880 // Updating the PHI nodes is tricky in this case, since we need to determine
881 // whether the PHI is a successor of the range check MBB or the jump table MBB
882 for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
883 // Lower header first, if it wasn't already lowered
884 if (!SDB->JTCases[i].first.Emitted) {
885 // Set the current basic block to the mbb we wish to insert the code into
886 BB = SDB->JTCases[i].first.HeaderBB;
888 SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
890 CurDAG->setRoot(SDB->getRoot());
892 BB = CodeGenAndEmitDAG(BB);
895 // Set the current basic block to the mbb we wish to insert the code into
896 BB = SDB->JTCases[i].second.MBB;
898 SDB->visitJumpTable(SDB->JTCases[i].second);
899 CurDAG->setRoot(SDB->getRoot());
901 BB = CodeGenAndEmitDAG(BB);
904 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
906 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
907 MachineBasicBlock *PHIBB = PHI->getParent();
908 assert(PHI->isPHI() &&
909 "This is not a machine PHI node that we are updating!");
910 // "default" BB. We can go there only from header BB.
911 if (PHIBB == SDB->JTCases[i].second.Default) {
913 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
916 (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB));
918 // JT BB. Just iterate over successors here
919 if (BB->isSuccessor(PHIBB)) {
921 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
923 PHI->addOperand(MachineOperand::CreateMBB(BB));
927 SDB->JTCases.clear();
929 // If the switch block involved a branch to one of the actual successors, we
930 // need to update PHI nodes in that block.
931 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
932 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
933 assert(PHI->isPHI() &&
934 "This is not a machine PHI node that we are updating!");
935 if (BB->isSuccessor(PHI->getParent())) {
937 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
938 PHI->addOperand(MachineOperand::CreateMBB(BB));
942 // If we generated any switch lowering information, build and codegen any
943 // additional DAGs necessary.
944 for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
945 // Set the current basic block to the mbb we wish to insert the code into
946 MachineBasicBlock *ThisBB = BB = SDB->SwitchCases[i].ThisBB;
948 // Determine the unique successors.
949 SmallVector<MachineBasicBlock *, 2> Succs;
950 Succs.push_back(SDB->SwitchCases[i].TrueBB);
951 if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB)
952 Succs.push_back(SDB->SwitchCases[i].FalseBB);
954 // Emit the code. Note that this could result in ThisBB being split, so
955 // we need to check for updates.
956 SDB->visitSwitchCase(SDB->SwitchCases[i], BB);
957 CurDAG->setRoot(SDB->getRoot());
959 ThisBB = CodeGenAndEmitDAG(BB);
961 // Handle any PHI nodes in successors of this chunk, as if we were coming
962 // from the original BB before switch expansion. Note that PHI nodes can
963 // occur multiple times in PHINodesToUpdate. We have to be very careful to
964 // handle them the right number of times.
965 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
967 // BB may have been removed from the CFG if a branch was constant folded.
968 if (ThisBB->isSuccessor(BB)) {
969 for (MachineBasicBlock::iterator Phi = BB->begin();
970 Phi != BB->end() && Phi->isPHI();
972 // This value for this PHI node is recorded in PHINodesToUpdate.
973 for (unsigned pn = 0; ; ++pn) {
974 assert(pn != FuncInfo->PHINodesToUpdate.size() &&
975 "Didn't find PHI entry!");
976 if (FuncInfo->PHINodesToUpdate[pn].first == Phi) {
977 Phi->addOperand(MachineOperand::
978 CreateReg(FuncInfo->PHINodesToUpdate[pn].second,
980 Phi->addOperand(MachineOperand::CreateMBB(ThisBB));
988 SDB->SwitchCases.clear();
992 /// Create the scheduler. If a specific scheduler was specified
993 /// via the SchedulerRegistry, use it, otherwise select the
994 /// one preferred by the target.
996 ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
997 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
1001 RegisterScheduler::setDefault(Ctor);
1004 return Ctor(this, OptLevel);
1007 ScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() {
1008 return new ScheduleHazardRecognizer();
1011 //===----------------------------------------------------------------------===//
1012 // Helper functions used by the generated instruction selector.
1013 //===----------------------------------------------------------------------===//
1014 // Calls to these methods are generated by tblgen.
1016 /// CheckAndMask - The isel is trying to match something like (and X, 255). If
1017 /// the dag combiner simplified the 255, we still want to match. RHS is the
1018 /// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
1019 /// specified in the .td file (e.g. 255).
1020 bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
1021 int64_t DesiredMaskS) const {
1022 const APInt &ActualMask = RHS->getAPIntValue();
1023 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
1025 // If the actual mask exactly matches, success!
1026 if (ActualMask == DesiredMask)
1029 // If the actual AND mask is allowing unallowed bits, this doesn't match.
1030 if (ActualMask.intersects(~DesiredMask))
1033 // Otherwise, the DAG Combiner may have proven that the value coming in is
1034 // either already zero or is not demanded. Check for known zero input bits.
1035 APInt NeededMask = DesiredMask & ~ActualMask;
1036 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
1039 // TODO: check to see if missing bits are just not demanded.
1041 // Otherwise, this pattern doesn't match.
1045 /// CheckOrMask - The isel is trying to match something like (or X, 255). If
1046 /// the dag combiner simplified the 255, we still want to match. RHS is the
1047 /// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
1048 /// specified in the .td file (e.g. 255).
1049 bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
1050 int64_t DesiredMaskS) const {
1051 const APInt &ActualMask = RHS->getAPIntValue();
1052 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
1054 // If the actual mask exactly matches, success!
1055 if (ActualMask == DesiredMask)
1058 // If the actual AND mask is allowing unallowed bits, this doesn't match.
1059 if (ActualMask.intersects(~DesiredMask))
1062 // Otherwise, the DAG Combiner may have proven that the value coming in is
1063 // either already zero or is not demanded. Check for known zero input bits.
1064 APInt NeededMask = DesiredMask & ~ActualMask;
1066 APInt KnownZero, KnownOne;
1067 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
1069 // If all the missing bits in the or are already known to be set, match!
1070 if ((NeededMask & KnownOne) == NeededMask)
1073 // TODO: check to see if missing bits are just not demanded.
1075 // Otherwise, this pattern doesn't match.
1080 /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
1081 /// by tblgen. Others should not call it.
1082 void SelectionDAGISel::
1083 SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
1084 std::vector<SDValue> InOps;
1085 std::swap(InOps, Ops);
1087 Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
1088 Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
1089 Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
1091 unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
1092 if (InOps[e-1].getValueType() == MVT::Flag)
1093 --e; // Don't process a flag operand if it is here.
1096 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
1097 if (!InlineAsm::isMemKind(Flags)) {
1098 // Just skip over this operand, copying the operands verbatim.
1099 Ops.insert(Ops.end(), InOps.begin()+i,
1100 InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
1101 i += InlineAsm::getNumOperandRegisters(Flags) + 1;
1103 assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
1104 "Memory operand with multiple values?");
1105 // Otherwise, this is a memory operand. Ask the target to select it.
1106 std::vector<SDValue> SelOps;
1107 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps))
1108 report_fatal_error("Could not match memory address. Inline asm"
1111 // Add this to the output node.
1113 InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
1114 Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
1115 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
1120 // Add the flag input back if present.
1121 if (e != InOps.size())
1122 Ops.push_back(InOps.back());
1125 /// findFlagUse - Return use of EVT::Flag value produced by the specified
1128 static SDNode *findFlagUse(SDNode *N) {
1129 unsigned FlagResNo = N->getNumValues()-1;
1130 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
1131 SDUse &Use = I.getUse();
1132 if (Use.getResNo() == FlagResNo)
1133 return Use.getUser();
1138 /// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
1139 /// This function recursively traverses up the operand chain, ignoring
1141 static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
1142 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1143 bool IgnoreChains) {
1144 // The NodeID's are given uniques ID's where a node ID is guaranteed to be
1145 // greater than all of its (recursive) operands. If we scan to a point where
1146 // 'use' is smaller than the node we're scanning for, then we know we will
1149 // The Use may be -1 (unassigned) if it is a newly allocated node. This can
1150 // happen because we scan down to newly selected nodes in the case of flag
1152 if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
1155 // Don't revisit nodes if we already scanned it and didn't fail, we know we
1156 // won't fail if we scan it again.
1157 if (!Visited.insert(Use))
1160 for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
1161 // Ignore chain uses, they are validated by HandleMergeInputChains.
1162 if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
1165 SDNode *N = Use->getOperand(i).getNode();
1167 if (Use == ImmedUse || Use == Root)
1168 continue; // We are not looking for immediate use.
1173 // Traverse up the operand chain.
1174 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
1180 /// IsProfitableToFold - Returns true if it's profitable to fold the specific
1181 /// operand node N of U during instruction selection that starts at Root.
1182 bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
1183 SDNode *Root) const {
1184 if (OptLevel == CodeGenOpt::None) return false;
1185 return N.hasOneUse();
1188 /// IsLegalToFold - Returns true if the specific operand node N of
1189 /// U can be folded during instruction selection that starts at Root.
1190 bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
1191 CodeGenOpt::Level OptLevel,
1192 bool IgnoreChains) {
1193 if (OptLevel == CodeGenOpt::None) return false;
1195 // If Root use can somehow reach N through a path that that doesn't contain
1196 // U then folding N would create a cycle. e.g. In the following
1197 // diagram, Root can reach N through X. If N is folded into into Root, then
1198 // X is both a predecessor and a successor of U.
1209 // * indicates nodes to be folded together.
1211 // If Root produces a flag, then it gets (even more) interesting. Since it
1212 // will be "glued" together with its flag use in the scheduler, we need to
1213 // check if it might reach N.
1232 // If FU (flag use) indirectly reaches N (the load), and Root folds N
1233 // (call it Fold), then X is a predecessor of FU and a successor of
1234 // Fold. But since Fold and FU are flagged together, this will create
1235 // a cycle in the scheduling graph.
1237 // If the node has flags, walk down the graph to the "lowest" node in the
1239 EVT VT = Root->getValueType(Root->getNumValues()-1);
1240 while (VT == MVT::Flag) {
1241 SDNode *FU = findFlagUse(Root);
1245 VT = Root->getValueType(Root->getNumValues()-1);
1247 // If our query node has a flag result with a use, we've walked up it. If
1248 // the user (which has already been selected) has a chain or indirectly uses
1249 // the chain, our WalkChainUsers predicate will not consider it. Because of
1250 // this, we cannot ignore chains in this predicate.
1251 IgnoreChains = false;
1255 SmallPtrSet<SDNode*, 16> Visited;
1256 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
1259 SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
1260 std::vector<SDValue> Ops(N->op_begin(), N->op_end());
1261 SelectInlineAsmMemoryOperands(Ops);
1263 std::vector<EVT> VTs;
1264 VTs.push_back(MVT::Other);
1265 VTs.push_back(MVT::Flag);
1266 SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(),
1267 VTs, &Ops[0], Ops.size());
1269 return New.getNode();
1272 SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
1273 return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
1276 /// GetVBR - decode a vbr encoding whose top bit is set.
1277 ALWAYS_INLINE static uint64_t
1278 GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
1279 assert(Val >= 128 && "Not a VBR");
1280 Val &= 127; // Remove first vbr bit.
1285 NextBits = MatcherTable[Idx++];
1286 Val |= (NextBits&127) << Shift;
1288 } while (NextBits & 128);
1294 /// UpdateChainsAndFlags - When a match is complete, this method updates uses of
1295 /// interior flag and chain results to use the new flag and chain results.
1296 void SelectionDAGISel::
1297 UpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain,
1298 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1300 const SmallVectorImpl<SDNode*> &FlagResultNodesMatched,
1301 bool isMorphNodeTo) {
1302 SmallVector<SDNode*, 4> NowDeadNodes;
1304 ISelUpdater ISU(ISelPosition);
1306 // Now that all the normal results are replaced, we replace the chain and
1307 // flag results if present.
1308 if (!ChainNodesMatched.empty()) {
1309 assert(InputChain.getNode() != 0 &&
1310 "Matched input chains but didn't produce a chain");
1311 // Loop over all of the nodes we matched that produced a chain result.
1312 // Replace all the chain results with the final chain we ended up with.
1313 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1314 SDNode *ChainNode = ChainNodesMatched[i];
1316 // If this node was already deleted, don't look at it.
1317 if (ChainNode->getOpcode() == ISD::DELETED_NODE)
1320 // Don't replace the results of the root node if we're doing a
1322 if (ChainNode == NodeToMatch && isMorphNodeTo)
1325 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
1326 if (ChainVal.getValueType() == MVT::Flag)
1327 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
1328 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
1329 CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU);
1331 // If the node became dead and we haven't already seen it, delete it.
1332 if (ChainNode->use_empty() &&
1333 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
1334 NowDeadNodes.push_back(ChainNode);
1338 // If the result produces a flag, update any flag results in the matched
1339 // pattern with the flag result.
1340 if (InputFlag.getNode() != 0) {
1341 // Handle any interior nodes explicitly marked.
1342 for (unsigned i = 0, e = FlagResultNodesMatched.size(); i != e; ++i) {
1343 SDNode *FRN = FlagResultNodesMatched[i];
1345 // If this node was already deleted, don't look at it.
1346 if (FRN->getOpcode() == ISD::DELETED_NODE)
1349 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Flag &&
1350 "Doesn't have a flag result");
1351 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
1354 // If the node became dead and we haven't already seen it, delete it.
1355 if (FRN->use_empty() &&
1356 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
1357 NowDeadNodes.push_back(FRN);
1361 if (!NowDeadNodes.empty())
1362 CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU);
1364 DEBUG(errs() << "ISEL: Match complete!\n");
1370 CR_LeadsToInteriorNode
1373 /// WalkChainUsers - Walk down the users of the specified chained node that is
1374 /// part of the pattern we're matching, looking at all of the users we find.
1375 /// This determines whether something is an interior node, whether we have a
1376 /// non-pattern node in between two pattern nodes (which prevent folding because
1377 /// it would induce a cycle) and whether we have a TokenFactor node sandwiched
1378 /// between pattern nodes (in which case the TF becomes part of the pattern).
1380 /// The walk we do here is guaranteed to be small because we quickly get down to
1381 /// already selected nodes "below" us.
1383 WalkChainUsers(SDNode *ChainedNode,
1384 SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
1385 SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
1386 ChainResult Result = CR_Simple;
1388 for (SDNode::use_iterator UI = ChainedNode->use_begin(),
1389 E = ChainedNode->use_end(); UI != E; ++UI) {
1390 // Make sure the use is of the chain, not some other value we produce.
1391 if (UI.getUse().getValueType() != MVT::Other) continue;
1395 // If we see an already-selected machine node, then we've gone beyond the
1396 // pattern that we're selecting down into the already selected chunk of the
1398 if (User->isMachineOpcode() ||
1399 User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
1402 if (User->getOpcode() == ISD::CopyToReg ||
1403 User->getOpcode() == ISD::CopyFromReg ||
1404 User->getOpcode() == ISD::INLINEASM ||
1405 User->getOpcode() == ISD::EH_LABEL) {
1406 // If their node ID got reset to -1 then they've already been selected.
1407 // Treat them like a MachineOpcode.
1408 if (User->getNodeId() == -1)
1412 // If we have a TokenFactor, we handle it specially.
1413 if (User->getOpcode() != ISD::TokenFactor) {
1414 // If the node isn't a token factor and isn't part of our pattern, then it
1415 // must be a random chained node in between two nodes we're selecting.
1416 // This happens when we have something like:
1421 // Because we structurally match the load/store as a read/modify/write,
1422 // but the call is chained between them. We cannot fold in this case
1423 // because it would induce a cycle in the graph.
1424 if (!std::count(ChainedNodesInPattern.begin(),
1425 ChainedNodesInPattern.end(), User))
1426 return CR_InducesCycle;
1428 // Otherwise we found a node that is part of our pattern. For example in:
1432 // This would happen when we're scanning down from the load and see the
1433 // store as a user. Record that there is a use of ChainedNode that is
1434 // part of the pattern and keep scanning uses.
1435 Result = CR_LeadsToInteriorNode;
1436 InteriorChainedNodes.push_back(User);
1440 // If we found a TokenFactor, there are two cases to consider: first if the
1441 // TokenFactor is just hanging "below" the pattern we're matching (i.e. no
1442 // uses of the TF are in our pattern) we just want to ignore it. Second,
1443 // the TokenFactor can be sandwiched in between two chained nodes, like so:
1449 // | \ DAG's like cheese
1452 // [TokenFactor] [Op]
1459 // In this case, the TokenFactor becomes part of our match and we rewrite it
1460 // as a new TokenFactor.
1462 // To distinguish these two cases, do a recursive walk down the uses.
1463 switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
1465 // If the uses of the TokenFactor are just already-selected nodes, ignore
1466 // it, it is "below" our pattern.
1468 case CR_InducesCycle:
1469 // If the uses of the TokenFactor lead to nodes that are not part of our
1470 // pattern that are not selected, folding would turn this into a cycle,
1472 return CR_InducesCycle;
1473 case CR_LeadsToInteriorNode:
1474 break; // Otherwise, keep processing.
1477 // Okay, we know we're in the interesting interior case. The TokenFactor
1478 // is now going to be considered part of the pattern so that we rewrite its
1479 // uses (it may have uses that are not part of the pattern) with the
1480 // ultimate chain result of the generated code. We will also add its chain
1481 // inputs as inputs to the ultimate TokenFactor we create.
1482 Result = CR_LeadsToInteriorNode;
1483 ChainedNodesInPattern.push_back(User);
1484 InteriorChainedNodes.push_back(User);
1491 /// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
1492 /// operation for when the pattern matched at least one node with a chains. The
1493 /// input vector contains a list of all of the chained nodes that we match. We
1494 /// must determine if this is a valid thing to cover (i.e. matching it won't
1495 /// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
1496 /// be used as the input node chain for the generated nodes.
1498 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
1499 SelectionDAG *CurDAG) {
1500 // Walk all of the chained nodes we've matched, recursively scanning down the
1501 // users of the chain result. This adds any TokenFactor nodes that are caught
1502 // in between chained nodes to the chained and interior nodes list.
1503 SmallVector<SDNode*, 3> InteriorChainedNodes;
1504 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1505 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1506 InteriorChainedNodes) == CR_InducesCycle)
1507 return SDValue(); // Would induce a cycle.
1510 // Okay, we have walked all the matched nodes and collected TokenFactor nodes
1511 // that we are interested in. Form our input TokenFactor node.
1512 SmallVector<SDValue, 3> InputChains;
1513 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1514 // Add the input chain of this node to the InputChains list (which will be
1515 // the operands of the generated TokenFactor) if it's not an interior node.
1516 SDNode *N = ChainNodesMatched[i];
1517 if (N->getOpcode() != ISD::TokenFactor) {
1518 if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
1521 // Otherwise, add the input chain.
1522 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1523 assert(InChain.getValueType() == MVT::Other && "Not a chain");
1524 InputChains.push_back(InChain);
1528 // If we have a token factor, we want to add all inputs of the token factor
1529 // that are not part of the pattern we're matching.
1530 for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
1531 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
1532 N->getOperand(op).getNode()))
1533 InputChains.push_back(N->getOperand(op));
1538 if (InputChains.size() == 1)
1539 return InputChains[0];
1540 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
1541 MVT::Other, &InputChains[0], InputChains.size());
1544 /// MorphNode - Handle morphing a node in place for the selector.
1545 SDNode *SelectionDAGISel::
1546 MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
1547 const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) {
1548 // It is possible we're using MorphNodeTo to replace a node with no
1549 // normal results with one that has a normal result (or we could be
1550 // adding a chain) and the input could have flags and chains as well.
1551 // In this case we need to shift the operands down.
1552 // FIXME: This is a horrible hack and broken in obscure cases, no worse
1553 // than the old isel though.
1554 int OldFlagResultNo = -1, OldChainResultNo = -1;
1556 unsigned NTMNumResults = Node->getNumValues();
1557 if (Node->getValueType(NTMNumResults-1) == MVT::Flag) {
1558 OldFlagResultNo = NTMNumResults-1;
1559 if (NTMNumResults != 1 &&
1560 Node->getValueType(NTMNumResults-2) == MVT::Other)
1561 OldChainResultNo = NTMNumResults-2;
1562 } else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
1563 OldChainResultNo = NTMNumResults-1;
1565 // Call the underlying SelectionDAG routine to do the transmogrification. Note
1566 // that this deletes operands of the old node that become dead.
1567 SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps);
1569 // MorphNodeTo can operate in two ways: if an existing node with the
1570 // specified operands exists, it can just return it. Otherwise, it
1571 // updates the node in place to have the requested operands.
1573 // If we updated the node in place, reset the node ID. To the isel,
1574 // this should be just like a newly allocated machine node.
1578 unsigned ResNumResults = Res->getNumValues();
1579 // Move the flag if needed.
1580 if ((EmitNodeInfo & OPFL_FlagOutput) && OldFlagResultNo != -1 &&
1581 (unsigned)OldFlagResultNo != ResNumResults-1)
1582 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldFlagResultNo),
1583 SDValue(Res, ResNumResults-1));
1585 if ((EmitNodeInfo & OPFL_FlagOutput) != 0)
1588 // Move the chain reference if needed.
1589 if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
1590 (unsigned)OldChainResultNo != ResNumResults-1)
1591 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
1592 SDValue(Res, ResNumResults-1));
1594 // Otherwise, no replacement happened because the node already exists. Replace
1595 // Uses of the old node with the new one.
1597 CurDAG->ReplaceAllUsesWith(Node, Res);
1602 /// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
1603 ALWAYS_INLINE static bool
1604 CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1605 SDValue N, const SmallVectorImpl<SDValue> &RecordedNodes) {
1606 // Accept if it is exactly the same as a previously recorded node.
1607 unsigned RecNo = MatcherTable[MatcherIndex++];
1608 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
1609 return N == RecordedNodes[RecNo];
1612 /// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
1613 ALWAYS_INLINE static bool
1614 CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1615 SelectionDAGISel &SDISel) {
1616 return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
1619 /// CheckNodePredicate - Implements OP_CheckNodePredicate.
1620 ALWAYS_INLINE static bool
1621 CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1622 SelectionDAGISel &SDISel, SDNode *N) {
1623 return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
1626 ALWAYS_INLINE static bool
1627 CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1629 uint16_t Opc = MatcherTable[MatcherIndex++];
1630 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
1631 return N->getOpcode() == Opc;
1634 ALWAYS_INLINE static bool
1635 CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1636 SDValue N, const TargetLowering &TLI) {
1637 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1638 if (N.getValueType() == VT) return true;
1640 // Handle the case when VT is iPTR.
1641 return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy();
1644 ALWAYS_INLINE static bool
1645 CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1646 SDValue N, const TargetLowering &TLI,
1648 if (ChildNo >= N.getNumOperands())
1649 return false; // Match fails if out of range child #.
1650 return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
1654 ALWAYS_INLINE static bool
1655 CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1657 return cast<CondCodeSDNode>(N)->get() ==
1658 (ISD::CondCode)MatcherTable[MatcherIndex++];
1661 ALWAYS_INLINE static bool
1662 CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1663 SDValue N, const TargetLowering &TLI) {
1664 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1665 if (cast<VTSDNode>(N)->getVT() == VT)
1668 // Handle the case when VT is iPTR.
1669 return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy();
1672 ALWAYS_INLINE static bool
1673 CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1675 int64_t Val = MatcherTable[MatcherIndex++];
1677 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1679 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
1680 return C != 0 && C->getSExtValue() == Val;
1683 ALWAYS_INLINE static bool
1684 CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1685 SDValue N, SelectionDAGISel &SDISel) {
1686 int64_t Val = MatcherTable[MatcherIndex++];
1688 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1690 if (N->getOpcode() != ISD::AND) return false;
1692 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1693 return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val);
1696 ALWAYS_INLINE static bool
1697 CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1698 SDValue N, SelectionDAGISel &SDISel) {
1699 int64_t Val = MatcherTable[MatcherIndex++];
1701 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1703 if (N->getOpcode() != ISD::OR) return false;
1705 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1706 return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val);
1709 /// IsPredicateKnownToFail - If we know how and can do so without pushing a
1710 /// scope, evaluate the current node. If the current predicate is known to
1711 /// fail, set Result=true and return anything. If the current predicate is
1712 /// known to pass, set Result=false and return the MatcherIndex to continue
1713 /// with. If the current predicate is unknown, set Result=false and return the
1714 /// MatcherIndex to continue with.
1715 static unsigned IsPredicateKnownToFail(const unsigned char *Table,
1716 unsigned Index, SDValue N,
1717 bool &Result, SelectionDAGISel &SDISel,
1718 SmallVectorImpl<SDValue> &RecordedNodes){
1719 switch (Table[Index++]) {
1722 return Index-1; // Could not evaluate this predicate.
1723 case SelectionDAGISel::OPC_CheckSame:
1724 Result = !::CheckSame(Table, Index, N, RecordedNodes);
1726 case SelectionDAGISel::OPC_CheckPatternPredicate:
1727 Result = !::CheckPatternPredicate(Table, Index, SDISel);
1729 case SelectionDAGISel::OPC_CheckPredicate:
1730 Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
1732 case SelectionDAGISel::OPC_CheckOpcode:
1733 Result = !::CheckOpcode(Table, Index, N.getNode());
1735 case SelectionDAGISel::OPC_CheckType:
1736 Result = !::CheckType(Table, Index, N, SDISel.TLI);
1738 case SelectionDAGISel::OPC_CheckChild0Type:
1739 case SelectionDAGISel::OPC_CheckChild1Type:
1740 case SelectionDAGISel::OPC_CheckChild2Type:
1741 case SelectionDAGISel::OPC_CheckChild3Type:
1742 case SelectionDAGISel::OPC_CheckChild4Type:
1743 case SelectionDAGISel::OPC_CheckChild5Type:
1744 case SelectionDAGISel::OPC_CheckChild6Type:
1745 case SelectionDAGISel::OPC_CheckChild7Type:
1746 Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
1747 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type);
1749 case SelectionDAGISel::OPC_CheckCondCode:
1750 Result = !::CheckCondCode(Table, Index, N);
1752 case SelectionDAGISel::OPC_CheckValueType:
1753 Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
1755 case SelectionDAGISel::OPC_CheckInteger:
1756 Result = !::CheckInteger(Table, Index, N);
1758 case SelectionDAGISel::OPC_CheckAndImm:
1759 Result = !::CheckAndImm(Table, Index, N, SDISel);
1761 case SelectionDAGISel::OPC_CheckOrImm:
1762 Result = !::CheckOrImm(Table, Index, N, SDISel);
1770 /// FailIndex - If this match fails, this is the index to continue with.
1773 /// NodeStack - The node stack when the scope was formed.
1774 SmallVector<SDValue, 4> NodeStack;
1776 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
1777 unsigned NumRecordedNodes;
1779 /// NumMatchedMemRefs - The number of matched memref entries.
1780 unsigned NumMatchedMemRefs;
1782 /// InputChain/InputFlag - The current chain/flag
1783 SDValue InputChain, InputFlag;
1785 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
1786 bool HasChainNodesMatched, HasFlagResultNodesMatched;
1791 SDNode *SelectionDAGISel::
1792 SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
1793 unsigned TableSize) {
1794 // FIXME: Should these even be selected? Handle these cases in the caller?
1795 switch (NodeToMatch->getOpcode()) {
1798 case ISD::EntryToken: // These nodes remain the same.
1799 case ISD::BasicBlock:
1801 //case ISD::VALUETYPE:
1802 //case ISD::CONDCODE:
1803 case ISD::HANDLENODE:
1804 case ISD::MDNODE_SDNODE:
1805 case ISD::TargetConstant:
1806 case ISD::TargetConstantFP:
1807 case ISD::TargetConstantPool:
1808 case ISD::TargetFrameIndex:
1809 case ISD::TargetExternalSymbol:
1810 case ISD::TargetBlockAddress:
1811 case ISD::TargetJumpTable:
1812 case ISD::TargetGlobalTLSAddress:
1813 case ISD::TargetGlobalAddress:
1814 case ISD::TokenFactor:
1815 case ISD::CopyFromReg:
1816 case ISD::CopyToReg:
1818 NodeToMatch->setNodeId(-1); // Mark selected.
1820 case ISD::AssertSext:
1821 case ISD::AssertZext:
1822 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
1823 NodeToMatch->getOperand(0));
1825 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
1826 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
1829 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
1831 // Set up the node stack with NodeToMatch as the only node on the stack.
1832 SmallVector<SDValue, 8> NodeStack;
1833 SDValue N = SDValue(NodeToMatch, 0);
1834 NodeStack.push_back(N);
1836 // MatchScopes - Scopes used when matching, if a match failure happens, this
1837 // indicates where to continue checking.
1838 SmallVector<MatchScope, 8> MatchScopes;
1840 // RecordedNodes - This is the set of nodes that have been recorded by the
1842 SmallVector<SDValue, 8> RecordedNodes;
1844 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
1846 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
1848 // These are the current input chain and flag for use when generating nodes.
1849 // Various Emit operations change these. For example, emitting a copytoreg
1850 // uses and updates these.
1851 SDValue InputChain, InputFlag;
1853 // ChainNodesMatched - If a pattern matches nodes that have input/output
1854 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
1855 // which ones they are. The result is captured into this list so that we can
1856 // update the chain results when the pattern is complete.
1857 SmallVector<SDNode*, 3> ChainNodesMatched;
1858 SmallVector<SDNode*, 3> FlagResultNodesMatched;
1860 DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
1861 NodeToMatch->dump(CurDAG);
1864 // Determine where to start the interpreter. Normally we start at opcode #0,
1865 // but if the state machine starts with an OPC_SwitchOpcode, then we
1866 // accelerate the first lookup (which is guaranteed to be hot) with the
1867 // OpcodeOffset table.
1868 unsigned MatcherIndex = 0;
1870 if (!OpcodeOffset.empty()) {
1871 // Already computed the OpcodeOffset table, just index into it.
1872 if (N.getOpcode() < OpcodeOffset.size())
1873 MatcherIndex = OpcodeOffset[N.getOpcode()];
1874 DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n");
1876 } else if (MatcherTable[0] == OPC_SwitchOpcode) {
1877 // Otherwise, the table isn't computed, but the state machine does start
1878 // with an OPC_SwitchOpcode instruction. Populate the table now, since this
1879 // is the first time we're selecting an instruction.
1882 // Get the size of this case.
1883 unsigned CaseSize = MatcherTable[Idx++];
1885 CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
1886 if (CaseSize == 0) break;
1888 // Get the opcode, add the index to the table.
1889 uint16_t Opc = MatcherTable[Idx++];
1890 Opc |= (unsigned short)MatcherTable[Idx++] << 8;
1891 if (Opc >= OpcodeOffset.size())
1892 OpcodeOffset.resize((Opc+1)*2);
1893 OpcodeOffset[Opc] = Idx;
1897 // Okay, do the lookup for the first opcode.
1898 if (N.getOpcode() < OpcodeOffset.size())
1899 MatcherIndex = OpcodeOffset[N.getOpcode()];
1903 assert(MatcherIndex < TableSize && "Invalid index");
1905 unsigned CurrentOpcodeIndex = MatcherIndex;
1907 BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
1910 // Okay, the semantics of this operation are that we should push a scope
1911 // then evaluate the first child. However, pushing a scope only to have
1912 // the first check fail (which then pops it) is inefficient. If we can
1913 // determine immediately that the first check (or first several) will
1914 // immediately fail, don't even bother pushing a scope for them.
1918 unsigned NumToSkip = MatcherTable[MatcherIndex++];
1919 if (NumToSkip & 128)
1920 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
1921 // Found the end of the scope with no match.
1922 if (NumToSkip == 0) {
1927 FailIndex = MatcherIndex+NumToSkip;
1929 unsigned MatcherIndexOfPredicate = MatcherIndex;
1930 (void)MatcherIndexOfPredicate; // silence warning.
1932 // If we can't evaluate this predicate without pushing a scope (e.g. if
1933 // it is a 'MoveParent') or if the predicate succeeds on this node, we
1934 // push the scope and evaluate the full predicate chain.
1936 MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
1937 Result, *this, RecordedNodes);
1941 DEBUG(errs() << " Skipped scope entry (due to false predicate) at "
1942 << "index " << MatcherIndexOfPredicate
1943 << ", continuing at " << FailIndex << "\n");
1944 ++NumDAGIselRetries;
1946 // Otherwise, we know that this case of the Scope is guaranteed to fail,
1947 // move to the next case.
1948 MatcherIndex = FailIndex;
1951 // If the whole scope failed to match, bail.
1952 if (FailIndex == 0) break;
1954 // Push a MatchScope which indicates where to go if the first child fails
1956 MatchScope NewEntry;
1957 NewEntry.FailIndex = FailIndex;
1958 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
1959 NewEntry.NumRecordedNodes = RecordedNodes.size();
1960 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
1961 NewEntry.InputChain = InputChain;
1962 NewEntry.InputFlag = InputFlag;
1963 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
1964 NewEntry.HasFlagResultNodesMatched = !FlagResultNodesMatched.empty();
1965 MatchScopes.push_back(NewEntry);
1968 case OPC_RecordNode:
1969 // Remember this node, it may end up being an operand in the pattern.
1970 RecordedNodes.push_back(N);
1973 case OPC_RecordChild0: case OPC_RecordChild1:
1974 case OPC_RecordChild2: case OPC_RecordChild3:
1975 case OPC_RecordChild4: case OPC_RecordChild5:
1976 case OPC_RecordChild6: case OPC_RecordChild7: {
1977 unsigned ChildNo = Opcode-OPC_RecordChild0;
1978 if (ChildNo >= N.getNumOperands())
1979 break; // Match fails if out of range child #.
1981 RecordedNodes.push_back(N->getOperand(ChildNo));
1984 case OPC_RecordMemRef:
1985 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
1988 case OPC_CaptureFlagInput:
1989 // If the current node has an input flag, capture it in InputFlag.
1990 if (N->getNumOperands() != 0 &&
1991 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag)
1992 InputFlag = N->getOperand(N->getNumOperands()-1);
1995 case OPC_MoveChild: {
1996 unsigned ChildNo = MatcherTable[MatcherIndex++];
1997 if (ChildNo >= N.getNumOperands())
1998 break; // Match fails if out of range child #.
1999 N = N.getOperand(ChildNo);
2000 NodeStack.push_back(N);
2004 case OPC_MoveParent:
2005 // Pop the current node off the NodeStack.
2006 NodeStack.pop_back();
2007 assert(!NodeStack.empty() && "Node stack imbalance!");
2008 N = NodeStack.back();
2012 if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
2014 case OPC_CheckPatternPredicate:
2015 if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
2017 case OPC_CheckPredicate:
2018 if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
2022 case OPC_CheckComplexPat: {
2023 unsigned CPNum = MatcherTable[MatcherIndex++];
2024 unsigned RecNo = MatcherTable[MatcherIndex++];
2025 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
2026 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo], CPNum,
2031 case OPC_CheckOpcode:
2032 if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
2036 if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break;
2039 case OPC_SwitchOpcode: {
2040 unsigned CurNodeOpcode = N.getOpcode();
2041 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2044 // Get the size of this case.
2045 CaseSize = MatcherTable[MatcherIndex++];
2047 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2048 if (CaseSize == 0) break;
2050 uint16_t Opc = MatcherTable[MatcherIndex++];
2051 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2053 // If the opcode matches, then we will execute this case.
2054 if (CurNodeOpcode == Opc)
2057 // Otherwise, skip over this case.
2058 MatcherIndex += CaseSize;
2061 // If no cases matched, bail out.
2062 if (CaseSize == 0) break;
2064 // Otherwise, execute the case we found.
2065 DEBUG(errs() << " OpcodeSwitch from " << SwitchStart
2066 << " to " << MatcherIndex << "\n");
2070 case OPC_SwitchType: {
2071 MVT::SimpleValueType CurNodeVT = N.getValueType().getSimpleVT().SimpleTy;
2072 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2075 // Get the size of this case.
2076 CaseSize = MatcherTable[MatcherIndex++];
2078 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2079 if (CaseSize == 0) break;
2081 MVT::SimpleValueType CaseVT =
2082 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2083 if (CaseVT == MVT::iPTR)
2084 CaseVT = TLI.getPointerTy().SimpleTy;
2086 // If the VT matches, then we will execute this case.
2087 if (CurNodeVT == CaseVT)
2090 // Otherwise, skip over this case.
2091 MatcherIndex += CaseSize;
2094 // If no cases matched, bail out.
2095 if (CaseSize == 0) break;
2097 // Otherwise, execute the case we found.
2098 DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
2099 << "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
2102 case OPC_CheckChild0Type: case OPC_CheckChild1Type:
2103 case OPC_CheckChild2Type: case OPC_CheckChild3Type:
2104 case OPC_CheckChild4Type: case OPC_CheckChild5Type:
2105 case OPC_CheckChild6Type: case OPC_CheckChild7Type:
2106 if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
2107 Opcode-OPC_CheckChild0Type))
2110 case OPC_CheckCondCode:
2111 if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
2113 case OPC_CheckValueType:
2114 if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break;
2116 case OPC_CheckInteger:
2117 if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
2119 case OPC_CheckAndImm:
2120 if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
2122 case OPC_CheckOrImm:
2123 if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
2126 case OPC_CheckFoldableChainNode: {
2127 assert(NodeStack.size() != 1 && "No parent node");
2128 // Verify that all intermediate nodes between the root and this one have
2130 bool HasMultipleUses = false;
2131 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
2132 if (!NodeStack[i].hasOneUse()) {
2133 HasMultipleUses = true;
2136 if (HasMultipleUses) break;
2138 // Check to see that the target thinks this is profitable to fold and that
2139 // we can fold it without inducing cycles in the graph.
2140 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2142 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2143 NodeToMatch, OptLevel,
2144 true/*We validate our own chains*/))
2149 case OPC_EmitInteger: {
2150 MVT::SimpleValueType VT =
2151 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2152 int64_t Val = MatcherTable[MatcherIndex++];
2154 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2155 RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT));
2158 case OPC_EmitRegister: {
2159 MVT::SimpleValueType VT =
2160 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2161 unsigned RegNo = MatcherTable[MatcherIndex++];
2162 RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT));
2166 case OPC_EmitConvertToTarget: {
2167 // Convert from IMM/FPIMM to target version.
2168 unsigned RecNo = MatcherTable[MatcherIndex++];
2169 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2170 SDValue Imm = RecordedNodes[RecNo];
2172 if (Imm->getOpcode() == ISD::Constant) {
2173 int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
2174 Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
2175 } else if (Imm->getOpcode() == ISD::ConstantFP) {
2176 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
2177 Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
2180 RecordedNodes.push_back(Imm);
2184 case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
2185 case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
2186 // These are space-optimized forms of OPC_EmitMergeInputChains.
2187 assert(InputChain.getNode() == 0 &&
2188 "EmitMergeInputChains should be the first chain producing node");
2189 assert(ChainNodesMatched.empty() &&
2190 "Should only have one EmitMergeInputChains per match");
2192 // Read all of the chained nodes.
2193 unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
2194 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2195 ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2197 // FIXME: What if other value results of the node have uses not matched
2199 if (ChainNodesMatched.back() != NodeToMatch &&
2200 !RecordedNodes[RecNo].hasOneUse()) {
2201 ChainNodesMatched.clear();
2205 // Merge the input chains if they are not intra-pattern references.
2206 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2208 if (InputChain.getNode() == 0)
2209 break; // Failed to merge.
2213 case OPC_EmitMergeInputChains: {
2214 assert(InputChain.getNode() == 0 &&
2215 "EmitMergeInputChains should be the first chain producing node");
2216 // This node gets a list of nodes we matched in the input that have
2217 // chains. We want to token factor all of the input chains to these nodes
2218 // together. However, if any of the input chains is actually one of the
2219 // nodes matched in this pattern, then we have an intra-match reference.
2220 // Ignore these because the newly token factored chain should not refer to
2222 unsigned NumChains = MatcherTable[MatcherIndex++];
2223 assert(NumChains != 0 && "Can't TF zero chains");
2225 assert(ChainNodesMatched.empty() &&
2226 "Should only have one EmitMergeInputChains per match");
2228 // Read all of the chained nodes.
2229 for (unsigned i = 0; i != NumChains; ++i) {
2230 unsigned RecNo = MatcherTable[MatcherIndex++];
2231 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2232 ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2234 // FIXME: What if other value results of the node have uses not matched
2236 if (ChainNodesMatched.back() != NodeToMatch &&
2237 !RecordedNodes[RecNo].hasOneUse()) {
2238 ChainNodesMatched.clear();
2243 // If the inner loop broke out, the match fails.
2244 if (ChainNodesMatched.empty())
2247 // Merge the input chains if they are not intra-pattern references.
2248 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2250 if (InputChain.getNode() == 0)
2251 break; // Failed to merge.
2256 case OPC_EmitCopyToReg: {
2257 unsigned RecNo = MatcherTable[MatcherIndex++];
2258 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2259 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
2261 if (InputChain.getNode() == 0)
2262 InputChain = CurDAG->getEntryNode();
2264 InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
2265 DestPhysReg, RecordedNodes[RecNo],
2268 InputFlag = InputChain.getValue(1);
2272 case OPC_EmitNodeXForm: {
2273 unsigned XFormNo = MatcherTable[MatcherIndex++];
2274 unsigned RecNo = MatcherTable[MatcherIndex++];
2275 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2276 RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo));
2281 case OPC_MorphNodeTo: {
2282 uint16_t TargetOpc = MatcherTable[MatcherIndex++];
2283 TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2284 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
2285 // Get the result VT list.
2286 unsigned NumVTs = MatcherTable[MatcherIndex++];
2287 SmallVector<EVT, 4> VTs;
2288 for (unsigned i = 0; i != NumVTs; ++i) {
2289 MVT::SimpleValueType VT =
2290 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2291 if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
2295 if (EmitNodeInfo & OPFL_Chain)
2296 VTs.push_back(MVT::Other);
2297 if (EmitNodeInfo & OPFL_FlagOutput)
2298 VTs.push_back(MVT::Flag);
2300 // This is hot code, so optimize the two most common cases of 1 and 2
2303 if (VTs.size() == 1)
2304 VTList = CurDAG->getVTList(VTs[0]);
2305 else if (VTs.size() == 2)
2306 VTList = CurDAG->getVTList(VTs[0], VTs[1]);
2308 VTList = CurDAG->getVTList(VTs.data(), VTs.size());
2310 // Get the operand list.
2311 unsigned NumOps = MatcherTable[MatcherIndex++];
2312 SmallVector<SDValue, 8> Ops;
2313 for (unsigned i = 0; i != NumOps; ++i) {
2314 unsigned RecNo = MatcherTable[MatcherIndex++];
2316 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2318 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
2319 Ops.push_back(RecordedNodes[RecNo]);
2322 // If there are variadic operands to add, handle them now.
2323 if (EmitNodeInfo & OPFL_VariadicInfo) {
2324 // Determine the start index to copy from.
2325 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
2326 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
2327 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
2328 "Invalid variadic node");
2329 // Copy all of the variadic operands, not including a potential flag
2331 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
2333 SDValue V = NodeToMatch->getOperand(i);
2334 if (V.getValueType() == MVT::Flag) break;
2339 // If this has chain/flag inputs, add them.
2340 if (EmitNodeInfo & OPFL_Chain)
2341 Ops.push_back(InputChain);
2342 if ((EmitNodeInfo & OPFL_FlagInput) && InputFlag.getNode() != 0)
2343 Ops.push_back(InputFlag);
2347 if (Opcode != OPC_MorphNodeTo) {
2348 // If this is a normal EmitNode command, just create the new node and
2349 // add the results to the RecordedNodes list.
2350 Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(),
2351 VTList, Ops.data(), Ops.size());
2353 // Add all the non-flag/non-chain results to the RecordedNodes list.
2354 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
2355 if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break;
2356 RecordedNodes.push_back(SDValue(Res, i));
2360 Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(),
2364 // If the node had chain/flag results, update our notion of the current
2366 if (EmitNodeInfo & OPFL_FlagOutput) {
2367 InputFlag = SDValue(Res, VTs.size()-1);
2368 if (EmitNodeInfo & OPFL_Chain)
2369 InputChain = SDValue(Res, VTs.size()-2);
2370 } else if (EmitNodeInfo & OPFL_Chain)
2371 InputChain = SDValue(Res, VTs.size()-1);
2373 // If the OPFL_MemRefs flag is set on this node, slap all of the
2374 // accumulated memrefs onto it.
2376 // FIXME: This is vastly incorrect for patterns with multiple outputs
2377 // instructions that access memory and for ComplexPatterns that match
2379 if (EmitNodeInfo & OPFL_MemRefs) {
2380 MachineSDNode::mmo_iterator MemRefs =
2381 MF->allocateMemRefsArray(MatchedMemRefs.size());
2382 std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs);
2383 cast<MachineSDNode>(Res)
2384 ->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size());
2388 << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
2389 << " node: "; Res->dump(CurDAG); errs() << "\n");
2391 // If this was a MorphNodeTo then we're completely done!
2392 if (Opcode == OPC_MorphNodeTo) {
2393 // Update chain and flag uses.
2394 UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched,
2395 InputFlag, FlagResultNodesMatched, true);
2402 case OPC_MarkFlagResults: {
2403 unsigned NumNodes = MatcherTable[MatcherIndex++];
2405 // Read and remember all the flag-result nodes.
2406 for (unsigned i = 0; i != NumNodes; ++i) {
2407 unsigned RecNo = MatcherTable[MatcherIndex++];
2409 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2411 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2412 FlagResultNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2417 case OPC_CompleteMatch: {
2418 // The match has been completed, and any new nodes (if any) have been
2419 // created. Patch up references to the matched dag to use the newly
2421 unsigned NumResults = MatcherTable[MatcherIndex++];
2423 for (unsigned i = 0; i != NumResults; ++i) {
2424 unsigned ResSlot = MatcherTable[MatcherIndex++];
2426 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
2428 assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
2429 SDValue Res = RecordedNodes[ResSlot];
2431 assert(i < NodeToMatch->getNumValues() &&
2432 NodeToMatch->getValueType(i) != MVT::Other &&
2433 NodeToMatch->getValueType(i) != MVT::Flag &&
2434 "Invalid number of results to complete!");
2435 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
2436 NodeToMatch->getValueType(i) == MVT::iPTR ||
2437 Res.getValueType() == MVT::iPTR ||
2438 NodeToMatch->getValueType(i).getSizeInBits() ==
2439 Res.getValueType().getSizeInBits()) &&
2440 "invalid replacement");
2441 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
2444 // If the root node defines a flag, add it to the flag nodes to update
2446 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Flag)
2447 FlagResultNodesMatched.push_back(NodeToMatch);
2449 // Update chain and flag uses.
2450 UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched,
2451 InputFlag, FlagResultNodesMatched, false);
2453 assert(NodeToMatch->use_empty() &&
2454 "Didn't replace all uses of the node?");
2456 // FIXME: We just return here, which interacts correctly with SelectRoot
2457 // above. We should fix this to not return an SDNode* anymore.
2462 // If the code reached this point, then the match failed. See if there is
2463 // another child to try in the current 'Scope', otherwise pop it until we
2464 // find a case to check.
2465 DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
2466 ++NumDAGIselRetries;
2468 if (MatchScopes.empty()) {
2469 CannotYetSelect(NodeToMatch);
2473 // Restore the interpreter state back to the point where the scope was
2475 MatchScope &LastScope = MatchScopes.back();
2476 RecordedNodes.resize(LastScope.NumRecordedNodes);
2478 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
2479 N = NodeStack.back();
2481 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
2482 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
2483 MatcherIndex = LastScope.FailIndex;
2485 DEBUG(errs() << " Continuing at " << MatcherIndex << "\n");
2487 InputChain = LastScope.InputChain;
2488 InputFlag = LastScope.InputFlag;
2489 if (!LastScope.HasChainNodesMatched)
2490 ChainNodesMatched.clear();
2491 if (!LastScope.HasFlagResultNodesMatched)
2492 FlagResultNodesMatched.clear();
2494 // Check to see what the offset is at the new MatcherIndex. If it is zero
2495 // we have reached the end of this scope, otherwise we have another child
2496 // in the current scope to try.
2497 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2498 if (NumToSkip & 128)
2499 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2501 // If we have another child in this scope to match, update FailIndex and
2503 if (NumToSkip != 0) {
2504 LastScope.FailIndex = MatcherIndex+NumToSkip;
2508 // End of this scope, pop it and try the next child in the containing
2510 MatchScopes.pop_back();
2517 void SelectionDAGISel::CannotYetSelect(SDNode *N) {
2519 raw_string_ostream Msg(msg);
2520 Msg << "Cannot yet select: ";
2522 if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
2523 N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
2524 N->getOpcode() != ISD::INTRINSIC_VOID) {
2525 N->printrFull(Msg, CurDAG);
2527 bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
2529 cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
2530 if (iid < Intrinsic::num_intrinsics)
2531 Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
2532 else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
2533 Msg << "target intrinsic %" << TII->getName(iid);
2535 Msg << "unknown intrinsic #" << iid;
2537 report_fatal_error(Msg.str());
2540 char SelectionDAGISel::ID = 0;