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 "llvm/CodeGen/SelectionDAGISel.h"
16 #include "ScheduleDAGSDNodes.h"
17 #include "SelectionDAGBuilder.h"
18 #include "llvm/ADT/PostOrderIterator.h"
19 #include "llvm/ADT/Statistic.h"
20 #include "llvm/Analysis/AliasAnalysis.h"
21 #include "llvm/Analysis/BranchProbabilityInfo.h"
22 #include "llvm/Analysis/TargetTransformInfo.h"
23 #include "llvm/CodeGen/FastISel.h"
24 #include "llvm/CodeGen/FunctionLoweringInfo.h"
25 #include "llvm/CodeGen/GCMetadata.h"
26 #include "llvm/CodeGen/GCStrategy.h"
27 #include "llvm/CodeGen/MachineFrameInfo.h"
28 #include "llvm/CodeGen/MachineFunction.h"
29 #include "llvm/CodeGen/MachineInstrBuilder.h"
30 #include "llvm/CodeGen/MachineModuleInfo.h"
31 #include "llvm/CodeGen/MachineRegisterInfo.h"
32 #include "llvm/CodeGen/ScheduleHazardRecognizer.h"
33 #include "llvm/CodeGen/SchedulerRegistry.h"
34 #include "llvm/CodeGen/SelectionDAG.h"
35 #include "llvm/DebugInfo.h"
36 #include "llvm/IR/Constants.h"
37 #include "llvm/IR/Function.h"
38 #include "llvm/IR/InlineAsm.h"
39 #include "llvm/IR/Instructions.h"
40 #include "llvm/IR/IntrinsicInst.h"
41 #include "llvm/IR/Intrinsics.h"
42 #include "llvm/IR/LLVMContext.h"
43 #include "llvm/IR/Module.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/Target/TargetInstrInfo.h"
50 #include "llvm/Target/TargetIntrinsicInfo.h"
51 #include "llvm/Target/TargetLibraryInfo.h"
52 #include "llvm/Target/TargetLowering.h"
53 #include "llvm/Target/TargetMachine.h"
54 #include "llvm/Target/TargetOptions.h"
55 #include "llvm/Target/TargetRegisterInfo.h"
56 #include "llvm/Target/TargetSubtargetInfo.h"
57 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
61 STATISTIC(NumFastIselBlocks, "Number of blocks selected entirely by fast isel");
62 STATISTIC(NumDAGBlocks, "Number of blocks selected using DAG");
65 STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
66 STATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on");
67 STATISTIC(NumFastIselSuccess, "Number of instructions fast isel selected");
70 EnableFastISelVerbose2("fast-isel-verbose2", cl::Hidden,
71 cl::desc("Enable extra verbose messages in the \"fast\" "
72 "instruction selector"));
74 STATISTIC(NumFastIselFailRet,"Fast isel fails on Ret");
75 STATISTIC(NumFastIselFailBr,"Fast isel fails on Br");
76 STATISTIC(NumFastIselFailSwitch,"Fast isel fails on Switch");
77 STATISTIC(NumFastIselFailIndirectBr,"Fast isel fails on IndirectBr");
78 STATISTIC(NumFastIselFailInvoke,"Fast isel fails on Invoke");
79 STATISTIC(NumFastIselFailResume,"Fast isel fails on Resume");
80 STATISTIC(NumFastIselFailUnreachable,"Fast isel fails on Unreachable");
82 // Standard binary operators...
83 STATISTIC(NumFastIselFailAdd,"Fast isel fails on Add");
84 STATISTIC(NumFastIselFailFAdd,"Fast isel fails on FAdd");
85 STATISTIC(NumFastIselFailSub,"Fast isel fails on Sub");
86 STATISTIC(NumFastIselFailFSub,"Fast isel fails on FSub");
87 STATISTIC(NumFastIselFailMul,"Fast isel fails on Mul");
88 STATISTIC(NumFastIselFailFMul,"Fast isel fails on FMul");
89 STATISTIC(NumFastIselFailUDiv,"Fast isel fails on UDiv");
90 STATISTIC(NumFastIselFailSDiv,"Fast isel fails on SDiv");
91 STATISTIC(NumFastIselFailFDiv,"Fast isel fails on FDiv");
92 STATISTIC(NumFastIselFailURem,"Fast isel fails on URem");
93 STATISTIC(NumFastIselFailSRem,"Fast isel fails on SRem");
94 STATISTIC(NumFastIselFailFRem,"Fast isel fails on FRem");
96 // Logical operators...
97 STATISTIC(NumFastIselFailAnd,"Fast isel fails on And");
98 STATISTIC(NumFastIselFailOr,"Fast isel fails on Or");
99 STATISTIC(NumFastIselFailXor,"Fast isel fails on Xor");
101 // Memory instructions...
102 STATISTIC(NumFastIselFailAlloca,"Fast isel fails on Alloca");
103 STATISTIC(NumFastIselFailLoad,"Fast isel fails on Load");
104 STATISTIC(NumFastIselFailStore,"Fast isel fails on Store");
105 STATISTIC(NumFastIselFailAtomicCmpXchg,"Fast isel fails on AtomicCmpXchg");
106 STATISTIC(NumFastIselFailAtomicRMW,"Fast isel fails on AtomicRWM");
107 STATISTIC(NumFastIselFailFence,"Fast isel fails on Frence");
108 STATISTIC(NumFastIselFailGetElementPtr,"Fast isel fails on GetElementPtr");
110 // Convert instructions...
111 STATISTIC(NumFastIselFailTrunc,"Fast isel fails on Trunc");
112 STATISTIC(NumFastIselFailZExt,"Fast isel fails on ZExt");
113 STATISTIC(NumFastIselFailSExt,"Fast isel fails on SExt");
114 STATISTIC(NumFastIselFailFPTrunc,"Fast isel fails on FPTrunc");
115 STATISTIC(NumFastIselFailFPExt,"Fast isel fails on FPExt");
116 STATISTIC(NumFastIselFailFPToUI,"Fast isel fails on FPToUI");
117 STATISTIC(NumFastIselFailFPToSI,"Fast isel fails on FPToSI");
118 STATISTIC(NumFastIselFailUIToFP,"Fast isel fails on UIToFP");
119 STATISTIC(NumFastIselFailSIToFP,"Fast isel fails on SIToFP");
120 STATISTIC(NumFastIselFailIntToPtr,"Fast isel fails on IntToPtr");
121 STATISTIC(NumFastIselFailPtrToInt,"Fast isel fails on PtrToInt");
122 STATISTIC(NumFastIselFailBitCast,"Fast isel fails on BitCast");
124 // Other instructions...
125 STATISTIC(NumFastIselFailICmp,"Fast isel fails on ICmp");
126 STATISTIC(NumFastIselFailFCmp,"Fast isel fails on FCmp");
127 STATISTIC(NumFastIselFailPHI,"Fast isel fails on PHI");
128 STATISTIC(NumFastIselFailSelect,"Fast isel fails on Select");
129 STATISTIC(NumFastIselFailCall,"Fast isel fails on Call");
130 STATISTIC(NumFastIselFailShl,"Fast isel fails on Shl");
131 STATISTIC(NumFastIselFailLShr,"Fast isel fails on LShr");
132 STATISTIC(NumFastIselFailAShr,"Fast isel fails on AShr");
133 STATISTIC(NumFastIselFailVAArg,"Fast isel fails on VAArg");
134 STATISTIC(NumFastIselFailExtractElement,"Fast isel fails on ExtractElement");
135 STATISTIC(NumFastIselFailInsertElement,"Fast isel fails on InsertElement");
136 STATISTIC(NumFastIselFailShuffleVector,"Fast isel fails on ShuffleVector");
137 STATISTIC(NumFastIselFailExtractValue,"Fast isel fails on ExtractValue");
138 STATISTIC(NumFastIselFailInsertValue,"Fast isel fails on InsertValue");
139 STATISTIC(NumFastIselFailLandingPad,"Fast isel fails on LandingPad");
143 EnableFastISelVerbose("fast-isel-verbose", cl::Hidden,
144 cl::desc("Enable verbose messages in the \"fast\" "
145 "instruction selector"));
147 EnableFastISelAbort("fast-isel-abort", cl::Hidden,
148 cl::desc("Enable abort calls when \"fast\" instruction selection "
149 "fails to lower an instruction"));
151 EnableFastISelAbortArgs("fast-isel-abort-args", cl::Hidden,
152 cl::desc("Enable abort calls when \"fast\" instruction selection "
153 "fails to lower a formal argument"));
157 cl::desc("use Machine Branch Probability Info"),
158 cl::init(true), cl::Hidden);
162 ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
163 cl::desc("Pop up a window to show dags before the first "
164 "dag combine pass"));
166 ViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden,
167 cl::desc("Pop up a window to show dags before legalize types"));
169 ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
170 cl::desc("Pop up a window to show dags before legalize"));
172 ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
173 cl::desc("Pop up a window to show dags before the second "
174 "dag combine pass"));
176 ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
177 cl::desc("Pop up a window to show dags before the post legalize types"
178 " dag combine pass"));
180 ViewISelDAGs("view-isel-dags", cl::Hidden,
181 cl::desc("Pop up a window to show isel dags as they are selected"));
183 ViewSchedDAGs("view-sched-dags", cl::Hidden,
184 cl::desc("Pop up a window to show sched dags as they are processed"));
186 ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
187 cl::desc("Pop up a window to show SUnit dags after they are processed"));
189 static const bool ViewDAGCombine1 = false,
190 ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false,
191 ViewDAGCombine2 = false,
192 ViewDAGCombineLT = false,
193 ViewISelDAGs = false, ViewSchedDAGs = false,
194 ViewSUnitDAGs = false;
197 //===---------------------------------------------------------------------===//
199 /// RegisterScheduler class - Track the registration of instruction schedulers.
201 //===---------------------------------------------------------------------===//
202 MachinePassRegistry RegisterScheduler::Registry;
204 //===---------------------------------------------------------------------===//
206 /// ISHeuristic command line option for instruction schedulers.
208 //===---------------------------------------------------------------------===//
209 static cl::opt<RegisterScheduler::FunctionPassCtor, false,
210 RegisterPassParser<RegisterScheduler> >
211 ISHeuristic("pre-RA-sched",
212 cl::init(&createDefaultScheduler),
213 cl::desc("Instruction schedulers available (before register"
216 static RegisterScheduler
217 defaultListDAGScheduler("default", "Best scheduler for the target",
218 createDefaultScheduler);
221 //===--------------------------------------------------------------------===//
222 /// createDefaultScheduler - This creates an instruction scheduler appropriate
224 ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS,
225 CodeGenOpt::Level OptLevel) {
226 const TargetLowering &TLI = IS->getTargetLowering();
227 const TargetSubtargetInfo &ST = IS->TM.getSubtarget<TargetSubtargetInfo>();
229 if (OptLevel == CodeGenOpt::None || ST.enableMachineScheduler() ||
230 TLI.getSchedulingPreference() == Sched::Source)
231 return createSourceListDAGScheduler(IS, OptLevel);
232 if (TLI.getSchedulingPreference() == Sched::RegPressure)
233 return createBURRListDAGScheduler(IS, OptLevel);
234 if (TLI.getSchedulingPreference() == Sched::Hybrid)
235 return createHybridListDAGScheduler(IS, OptLevel);
236 if (TLI.getSchedulingPreference() == Sched::VLIW)
237 return createVLIWDAGScheduler(IS, OptLevel);
238 assert(TLI.getSchedulingPreference() == Sched::ILP &&
239 "Unknown sched type!");
240 return createILPListDAGScheduler(IS, OptLevel);
244 // EmitInstrWithCustomInserter - This method should be implemented by targets
245 // that mark instructions with the 'usesCustomInserter' flag. These
246 // instructions are special in various ways, which require special support to
247 // insert. The specified MachineInstr is created but not inserted into any
248 // basic blocks, and this method is called to expand it into a sequence of
249 // instructions, potentially also creating new basic blocks and control flow.
250 // When new basic blocks are inserted and the edges from MBB to its successors
251 // are modified, the method should insert pairs of <OldSucc, NewSucc> into the
254 TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
255 MachineBasicBlock *MBB) const {
257 dbgs() << "If a target marks an instruction with "
258 "'usesCustomInserter', it must implement "
259 "TargetLowering::EmitInstrWithCustomInserter!";
264 void TargetLowering::AdjustInstrPostInstrSelection(MachineInstr *MI,
265 SDNode *Node) const {
266 assert(!MI->hasPostISelHook() &&
267 "If a target marks an instruction with 'hasPostISelHook', "
268 "it must implement TargetLowering::AdjustInstrPostInstrSelection!");
271 //===----------------------------------------------------------------------===//
272 // SelectionDAGISel code
273 //===----------------------------------------------------------------------===//
275 SelectionDAGISel::SelectionDAGISel(const TargetMachine &tm,
276 CodeGenOpt::Level OL) :
277 MachineFunctionPass(ID), TM(tm), TLI(*tm.getTargetLowering()),
278 FuncInfo(new FunctionLoweringInfo(TLI)),
279 CurDAG(new SelectionDAG(tm, OL)),
280 SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
284 initializeGCModuleInfoPass(*PassRegistry::getPassRegistry());
285 initializeAliasAnalysisAnalysisGroup(*PassRegistry::getPassRegistry());
286 initializeBranchProbabilityInfoPass(*PassRegistry::getPassRegistry());
287 initializeTargetLibraryInfoPass(*PassRegistry::getPassRegistry());
290 SelectionDAGISel::~SelectionDAGISel() {
296 void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
297 AU.addRequired<AliasAnalysis>();
298 AU.addPreserved<AliasAnalysis>();
299 AU.addRequired<GCModuleInfo>();
300 AU.addPreserved<GCModuleInfo>();
301 AU.addRequired<TargetLibraryInfo>();
302 if (UseMBPI && OptLevel != CodeGenOpt::None)
303 AU.addRequired<BranchProbabilityInfo>();
304 MachineFunctionPass::getAnalysisUsage(AU);
307 /// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
308 /// may trap on it. In this case we have to split the edge so that the path
309 /// through the predecessor block that doesn't go to the phi block doesn't
310 /// execute the possibly trapping instruction.
312 /// This is required for correctness, so it must be done at -O0.
314 static void SplitCriticalSideEffectEdges(Function &Fn, Pass *SDISel) {
315 // Loop for blocks with phi nodes.
316 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
317 PHINode *PN = dyn_cast<PHINode>(BB->begin());
318 if (PN == 0) continue;
321 // For each block with a PHI node, check to see if any of the input values
322 // are potentially trapping constant expressions. Constant expressions are
323 // the only potentially trapping value that can occur as the argument to a
325 for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I)
326 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
327 ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i));
328 if (CE == 0 || !CE->canTrap()) continue;
330 // The only case we have to worry about is when the edge is critical.
331 // Since this block has a PHI Node, we assume it has multiple input
332 // edges: check to see if the pred has multiple successors.
333 BasicBlock *Pred = PN->getIncomingBlock(i);
334 if (Pred->getTerminator()->getNumSuccessors() == 1)
337 // Okay, we have to split this edge.
338 SplitCriticalEdge(Pred->getTerminator(),
339 GetSuccessorNumber(Pred, BB), SDISel, true);
345 bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
346 // Do some sanity-checking on the command-line options.
347 assert((!EnableFastISelVerbose || TM.Options.EnableFastISel) &&
348 "-fast-isel-verbose requires -fast-isel");
349 assert((!EnableFastISelAbort || TM.Options.EnableFastISel) &&
350 "-fast-isel-abort requires -fast-isel");
352 const Function &Fn = *mf.getFunction();
353 const TargetInstrInfo &TII = *TM.getInstrInfo();
354 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
357 RegInfo = &MF->getRegInfo();
358 AA = &getAnalysis<AliasAnalysis>();
359 LibInfo = &getAnalysis<TargetLibraryInfo>();
360 TTI = getAnalysisIfAvailable<TargetTransformInfo>();
361 GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0;
363 TargetSubtargetInfo &ST =
364 const_cast<TargetSubtargetInfo&>(TM.getSubtarget<TargetSubtargetInfo>());
365 ST.resetSubtargetFeatures(MF);
367 DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
369 SplitCriticalSideEffectEdges(const_cast<Function&>(Fn), this);
371 CurDAG->init(*MF, TTI);
372 FuncInfo->set(Fn, *MF);
374 if (UseMBPI && OptLevel != CodeGenOpt::None)
375 FuncInfo->BPI = &getAnalysis<BranchProbabilityInfo>();
379 SDB->init(GFI, *AA, LibInfo);
381 MF->setHasMSInlineAsm(false);
382 SelectAllBasicBlocks(Fn);
384 // If the first basic block in the function has live ins that need to be
385 // copied into vregs, emit the copies into the top of the block before
386 // emitting the code for the block.
387 MachineBasicBlock *EntryMBB = MF->begin();
388 RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII);
390 DenseMap<unsigned, unsigned> LiveInMap;
391 if (!FuncInfo->ArgDbgValues.empty())
392 for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(),
393 E = RegInfo->livein_end(); LI != E; ++LI)
395 LiveInMap.insert(std::make_pair(LI->first, LI->second));
397 // Insert DBG_VALUE instructions for function arguments to the entry block.
398 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
399 MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
400 unsigned Reg = MI->getOperand(0).getReg();
401 if (TargetRegisterInfo::isPhysicalRegister(Reg))
402 EntryMBB->insert(EntryMBB->begin(), MI);
404 MachineInstr *Def = RegInfo->getVRegDef(Reg);
405 MachineBasicBlock::iterator InsertPos = Def;
406 // FIXME: VR def may not be in entry block.
407 Def->getParent()->insert(llvm::next(InsertPos), MI);
410 // If Reg is live-in then update debug info to track its copy in a vreg.
411 DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg);
412 if (LDI != LiveInMap.end()) {
413 MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
414 MachineBasicBlock::iterator InsertPos = Def;
415 const MDNode *Variable =
416 MI->getOperand(MI->getNumOperands()-1).getMetadata();
417 unsigned Offset = MI->getOperand(1).getImm();
418 // Def is never a terminator here, so it is ok to increment InsertPos.
419 BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(),
420 TII.get(TargetOpcode::DBG_VALUE))
421 .addReg(LDI->second, RegState::Debug)
422 .addImm(Offset).addMetadata(Variable);
424 // If this vreg is directly copied into an exported register then
425 // that COPY instructions also need DBG_VALUE, if it is the only
426 // user of LDI->second.
427 MachineInstr *CopyUseMI = NULL;
428 for (MachineRegisterInfo::use_iterator
429 UI = RegInfo->use_begin(LDI->second);
430 MachineInstr *UseMI = UI.skipInstruction();) {
431 if (UseMI->isDebugValue()) continue;
432 if (UseMI->isCopy() && !CopyUseMI && UseMI->getParent() == EntryMBB) {
433 CopyUseMI = UseMI; continue;
435 // Otherwise this is another use or second copy use.
436 CopyUseMI = NULL; break;
439 MachineInstr *NewMI =
440 BuildMI(*MF, CopyUseMI->getDebugLoc(),
441 TII.get(TargetOpcode::DBG_VALUE))
442 .addReg(CopyUseMI->getOperand(0).getReg(), RegState::Debug)
443 .addImm(Offset).addMetadata(Variable);
444 MachineBasicBlock::iterator Pos = CopyUseMI;
445 EntryMBB->insertAfter(Pos, NewMI);
450 // Determine if there are any calls in this machine function.
451 MachineFrameInfo *MFI = MF->getFrameInfo();
452 for (MachineFunction::const_iterator I = MF->begin(), E = MF->end(); I != E;
455 if (MFI->hasCalls() && MF->hasMSInlineAsm())
458 const MachineBasicBlock *MBB = I;
459 for (MachineBasicBlock::const_iterator II = MBB->begin(), IE = MBB->end();
461 const MCInstrDesc &MCID = TM.getInstrInfo()->get(II->getOpcode());
462 if ((MCID.isCall() && !MCID.isReturn()) ||
463 II->isStackAligningInlineAsm()) {
464 MFI->setHasCalls(true);
466 if (II->isMSInlineAsm()) {
467 MF->setHasMSInlineAsm(true);
472 // Determine if there is a call to setjmp in the machine function.
473 MF->setExposesReturnsTwice(Fn.callsFunctionThatReturnsTwice());
475 // Replace forward-declared registers with the registers containing
476 // the desired value.
477 MachineRegisterInfo &MRI = MF->getRegInfo();
478 for (DenseMap<unsigned, unsigned>::iterator
479 I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end();
481 unsigned From = I->first;
482 unsigned To = I->second;
483 // If To is also scheduled to be replaced, find what its ultimate
486 DenseMap<unsigned, unsigned>::iterator J = FuncInfo->RegFixups.find(To);
491 MRI.replaceRegWith(From, To);
494 // Freeze the set of reserved registers now that MachineFrameInfo has been
495 // set up. All the information required by getReservedRegs() should be
497 MRI.freezeReservedRegs(*MF);
499 // Release function-specific state. SDB and CurDAG are already cleared
506 void SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin,
507 BasicBlock::const_iterator End,
509 // Lower all of the non-terminator instructions. If a call is emitted
510 // as a tail call, cease emitting nodes for this block. Terminators
511 // are handled below.
512 for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
515 // Make sure the root of the DAG is up-to-date.
516 CurDAG->setRoot(SDB->getControlRoot());
517 HadTailCall = SDB->HasTailCall;
520 // Final step, emit the lowered DAG as machine code.
524 void SelectionDAGISel::ComputeLiveOutVRegInfo() {
525 SmallPtrSet<SDNode*, 128> VisitedNodes;
526 SmallVector<SDNode*, 128> Worklist;
528 Worklist.push_back(CurDAG->getRoot().getNode());
534 SDNode *N = Worklist.pop_back_val();
536 // If we've already seen this node, ignore it.
537 if (!VisitedNodes.insert(N))
540 // Otherwise, add all chain operands to the worklist.
541 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
542 if (N->getOperand(i).getValueType() == MVT::Other)
543 Worklist.push_back(N->getOperand(i).getNode());
545 // If this is a CopyToReg with a vreg dest, process it.
546 if (N->getOpcode() != ISD::CopyToReg)
549 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
550 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
553 // Ignore non-scalar or non-integer values.
554 SDValue Src = N->getOperand(2);
555 EVT SrcVT = Src.getValueType();
556 if (!SrcVT.isInteger() || SrcVT.isVector())
559 unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
560 CurDAG->ComputeMaskedBits(Src, KnownZero, KnownOne);
561 FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne);
562 } while (!Worklist.empty());
565 void SelectionDAGISel::CodeGenAndEmitDAG() {
566 std::string GroupName;
567 if (TimePassesIsEnabled)
568 GroupName = "Instruction Selection and Scheduling";
569 std::string BlockName;
570 int BlockNumber = -1;
573 if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
574 ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
578 BlockNumber = FuncInfo->MBB->getNumber();
579 BlockName = MF->getName().str() + ":" +
580 FuncInfo->MBB->getBasicBlock()->getName().str();
582 DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber
583 << " '" << BlockName << "'\n"; CurDAG->dump());
585 if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName);
587 // Run the DAG combiner in pre-legalize mode.
589 NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled);
590 CurDAG->Combine(BeforeLegalizeTypes, *AA, OptLevel);
593 DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber
594 << " '" << BlockName << "'\n"; CurDAG->dump());
596 // Second step, hack on the DAG until it only uses operations and types that
597 // the target supports.
598 if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " +
603 NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled);
604 Changed = CurDAG->LegalizeTypes();
607 DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber
608 << " '" << BlockName << "'\n"; CurDAG->dump());
611 if (ViewDAGCombineLT)
612 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
614 // Run the DAG combiner in post-type-legalize mode.
616 NamedRegionTimer T("DAG Combining after legalize types", GroupName,
617 TimePassesIsEnabled);
618 CurDAG->Combine(AfterLegalizeTypes, *AA, OptLevel);
621 DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumber
622 << " '" << BlockName << "'\n"; CurDAG->dump());
626 NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled);
627 Changed = CurDAG->LegalizeVectors();
632 NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled);
633 CurDAG->LegalizeTypes();
636 if (ViewDAGCombineLT)
637 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
639 // Run the DAG combiner in post-type-legalize mode.
641 NamedRegionTimer T("DAG Combining after legalize vectors", GroupName,
642 TimePassesIsEnabled);
643 CurDAG->Combine(AfterLegalizeVectorOps, *AA, OptLevel);
646 DEBUG(dbgs() << "Optimized vector-legalized selection DAG: BB#"
647 << BlockNumber << " '" << BlockName << "'\n"; CurDAG->dump());
650 if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName);
653 NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled);
657 DEBUG(dbgs() << "Legalized selection DAG: BB#" << BlockNumber
658 << " '" << BlockName << "'\n"; CurDAG->dump());
660 if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName);
662 // Run the DAG combiner in post-legalize mode.
664 NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled);
665 CurDAG->Combine(AfterLegalizeDAG, *AA, OptLevel);
668 DEBUG(dbgs() << "Optimized legalized selection DAG: BB#" << BlockNumber
669 << " '" << BlockName << "'\n"; CurDAG->dump());
671 if (OptLevel != CodeGenOpt::None)
672 ComputeLiveOutVRegInfo();
674 if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName);
676 // Third, instruction select all of the operations to machine code, adding the
677 // code to the MachineBasicBlock.
679 NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled);
680 DoInstructionSelection();
683 DEBUG(dbgs() << "Selected selection DAG: BB#" << BlockNumber
684 << " '" << BlockName << "'\n"; CurDAG->dump());
686 if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName);
688 // Schedule machine code.
689 ScheduleDAGSDNodes *Scheduler = CreateScheduler();
691 NamedRegionTimer T("Instruction Scheduling", GroupName,
692 TimePassesIsEnabled);
693 Scheduler->Run(CurDAG, FuncInfo->MBB);
696 if (ViewSUnitDAGs) Scheduler->viewGraph();
698 // Emit machine code to BB. This can change 'BB' to the last block being
700 MachineBasicBlock *FirstMBB = FuncInfo->MBB, *LastMBB;
702 NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled);
704 // FuncInfo->InsertPt is passed by reference and set to the end of the
705 // scheduled instructions.
706 LastMBB = FuncInfo->MBB = Scheduler->EmitSchedule(FuncInfo->InsertPt);
709 // If the block was split, make sure we update any references that are used to
710 // update PHI nodes later on.
711 if (FirstMBB != LastMBB)
712 SDB->UpdateSplitBlock(FirstMBB, LastMBB);
714 // Free the scheduler state.
716 NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName,
717 TimePassesIsEnabled);
721 // Free the SelectionDAG state, now that we're finished with it.
726 /// ISelUpdater - helper class to handle updates of the instruction selection
728 class ISelUpdater : public SelectionDAG::DAGUpdateListener {
729 SelectionDAG::allnodes_iterator &ISelPosition;
731 ISelUpdater(SelectionDAG &DAG, SelectionDAG::allnodes_iterator &isp)
732 : SelectionDAG::DAGUpdateListener(DAG), ISelPosition(isp) {}
734 /// NodeDeleted - Handle nodes deleted from the graph. If the node being
735 /// deleted is the current ISelPosition node, update ISelPosition.
737 virtual void NodeDeleted(SDNode *N, SDNode *E) {
738 if (ISelPosition == SelectionDAG::allnodes_iterator(N))
742 } // end anonymous namespace
744 void SelectionDAGISel::DoInstructionSelection() {
745 DEBUG(errs() << "===== Instruction selection begins: BB#"
746 << FuncInfo->MBB->getNumber()
747 << " '" << FuncInfo->MBB->getName() << "'\n");
751 // Select target instructions for the DAG.
753 // Number all nodes with a topological order and set DAGSize.
754 DAGSize = CurDAG->AssignTopologicalOrder();
756 // Create a dummy node (which is not added to allnodes), that adds
757 // a reference to the root node, preventing it from being deleted,
758 // and tracking any changes of the root.
759 HandleSDNode Dummy(CurDAG->getRoot());
760 SelectionDAG::allnodes_iterator ISelPosition (CurDAG->getRoot().getNode());
763 // Make sure that ISelPosition gets properly updated when nodes are deleted
764 // in calls made from this function.
765 ISelUpdater ISU(*CurDAG, ISelPosition);
767 // The AllNodes list is now topological-sorted. Visit the
768 // nodes by starting at the end of the list (the root of the
769 // graph) and preceding back toward the beginning (the entry
771 while (ISelPosition != CurDAG->allnodes_begin()) {
772 SDNode *Node = --ISelPosition;
773 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
774 // but there are currently some corner cases that it misses. Also, this
775 // makes it theoretically possible to disable the DAGCombiner.
776 if (Node->use_empty())
779 SDNode *ResNode = Select(Node);
781 // FIXME: This is pretty gross. 'Select' should be changed to not return
782 // anything at all and this code should be nuked with a tactical strike.
784 // If node should not be replaced, continue with the next one.
785 if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
789 ReplaceUses(Node, ResNode);
791 // If after the replacement this node is not used any more,
792 // remove this dead node.
793 if (Node->use_empty()) // Don't delete EntryToken, etc.
794 CurDAG->RemoveDeadNode(Node);
797 CurDAG->setRoot(Dummy.getValue());
800 DEBUG(errs() << "===== Instruction selection ends:\n");
802 PostprocessISelDAG();
805 /// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
806 /// do other setup for EH landing-pad blocks.
807 void SelectionDAGISel::PrepareEHLandingPad() {
808 MachineBasicBlock *MBB = FuncInfo->MBB;
810 // Add a label to mark the beginning of the landing pad. Deletion of the
811 // landing pad can thus be detected via the MachineModuleInfo.
812 MCSymbol *Label = MF->getMMI().addLandingPad(MBB);
814 // Assign the call site to the landing pad's begin label.
815 MF->getMMI().setCallSiteLandingPad(Label, SDB->LPadToCallSiteMap[MBB]);
817 const MCInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL);
818 BuildMI(*MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II)
821 // Mark exception register as live in.
822 unsigned Reg = TLI.getExceptionPointerRegister();
823 if (Reg) MBB->addLiveIn(Reg);
825 // Mark exception selector register as live in.
826 Reg = TLI.getExceptionSelectorRegister();
827 if (Reg) MBB->addLiveIn(Reg);
830 /// TryToFoldFastISelLoad - We're checking to see if we can fold the specified
831 /// load into the specified FoldInst. Note that we could have a sequence where
832 /// multiple LLVM IR instructions are folded into the same machineinstr. For
833 /// example we could have:
834 /// A: x = load i32 *P
835 /// B: y = icmp A, 42
838 /// In this scenario, LI is "A", and FoldInst is "C". We know about "B" (and
839 /// any other folded instructions) because it is between A and C.
841 /// If we succeed in folding the load into the operation, return true.
843 bool SelectionDAGISel::TryToFoldFastISelLoad(const LoadInst *LI,
844 const Instruction *FoldInst,
846 // We know that the load has a single use, but don't know what it is. If it
847 // isn't one of the folded instructions, then we can't succeed here. Handle
848 // this by scanning the single-use users of the load until we get to FoldInst.
849 unsigned MaxUsers = 6; // Don't scan down huge single-use chains of instrs.
851 const Instruction *TheUser = LI->use_back();
852 while (TheUser != FoldInst && // Scan up until we find FoldInst.
853 // Stay in the right block.
854 TheUser->getParent() == FoldInst->getParent() &&
855 --MaxUsers) { // Don't scan too far.
856 // If there are multiple or no uses of this instruction, then bail out.
857 if (!TheUser->hasOneUse())
860 TheUser = TheUser->use_back();
863 // If we didn't find the fold instruction, then we failed to collapse the
865 if (TheUser != FoldInst)
868 // Don't try to fold volatile loads. Target has to deal with alignment
870 if (LI->isVolatile()) return false;
872 // Figure out which vreg this is going into. If there is no assigned vreg yet
873 // then there actually was no reference to it. Perhaps the load is referenced
874 // by a dead instruction.
875 unsigned LoadReg = FastIS->getRegForValue(LI);
879 // Check to see what the uses of this vreg are. If it has no uses, or more
880 // than one use (at the machine instr level) then we can't fold it.
881 MachineRegisterInfo::reg_iterator RI = RegInfo->reg_begin(LoadReg);
882 if (RI == RegInfo->reg_end())
885 // See if there is exactly one use of the vreg. If there are multiple uses,
886 // then the instruction got lowered to multiple machine instructions or the
887 // use of the loaded value ended up being multiple operands of the result, in
888 // either case, we can't fold this.
889 MachineRegisterInfo::reg_iterator PostRI = RI; ++PostRI;
890 if (PostRI != RegInfo->reg_end())
893 assert(RI.getOperand().isUse() &&
894 "The only use of the vreg must be a use, we haven't emitted the def!");
896 MachineInstr *User = &*RI;
898 // Set the insertion point properly. Folding the load can cause generation of
899 // other random instructions (like sign extends) for addressing modes, make
900 // sure they get inserted in a logical place before the new instruction.
901 FuncInfo->InsertPt = User;
902 FuncInfo->MBB = User->getParent();
904 // Ask the target to try folding the load.
905 return FastIS->TryToFoldLoad(User, RI.getOperandNo(), LI);
908 /// isFoldedOrDeadInstruction - Return true if the specified instruction is
909 /// side-effect free and is either dead or folded into a generated instruction.
910 /// Return false if it needs to be emitted.
911 static bool isFoldedOrDeadInstruction(const Instruction *I,
912 FunctionLoweringInfo *FuncInfo) {
913 return !I->mayWriteToMemory() && // Side-effecting instructions aren't folded.
914 !isa<TerminatorInst>(I) && // Terminators aren't folded.
915 !isa<DbgInfoIntrinsic>(I) && // Debug instructions aren't folded.
916 !isa<LandingPadInst>(I) && // Landingpad instructions aren't folded.
917 !FuncInfo->isExportedInst(I); // Exported instrs must be computed.
921 // Collect per Instruction statistics for fast-isel misses. Only those
922 // instructions that cause the bail are accounted for. It does not account for
923 // instructions higher in the block. Thus, summing the per instructions stats
924 // will not add up to what is reported by NumFastIselFailures.
925 static void collectFailStats(const Instruction *I) {
926 switch (I->getOpcode()) {
927 default: assert (0 && "<Invalid operator> ");
930 case Instruction::Ret: NumFastIselFailRet++; return;
931 case Instruction::Br: NumFastIselFailBr++; return;
932 case Instruction::Switch: NumFastIselFailSwitch++; return;
933 case Instruction::IndirectBr: NumFastIselFailIndirectBr++; return;
934 case Instruction::Invoke: NumFastIselFailInvoke++; return;
935 case Instruction::Resume: NumFastIselFailResume++; return;
936 case Instruction::Unreachable: NumFastIselFailUnreachable++; return;
938 // Standard binary operators...
939 case Instruction::Add: NumFastIselFailAdd++; return;
940 case Instruction::FAdd: NumFastIselFailFAdd++; return;
941 case Instruction::Sub: NumFastIselFailSub++; return;
942 case Instruction::FSub: NumFastIselFailFSub++; return;
943 case Instruction::Mul: NumFastIselFailMul++; return;
944 case Instruction::FMul: NumFastIselFailFMul++; return;
945 case Instruction::UDiv: NumFastIselFailUDiv++; return;
946 case Instruction::SDiv: NumFastIselFailSDiv++; return;
947 case Instruction::FDiv: NumFastIselFailFDiv++; return;
948 case Instruction::URem: NumFastIselFailURem++; return;
949 case Instruction::SRem: NumFastIselFailSRem++; return;
950 case Instruction::FRem: NumFastIselFailFRem++; return;
952 // Logical operators...
953 case Instruction::And: NumFastIselFailAnd++; return;
954 case Instruction::Or: NumFastIselFailOr++; return;
955 case Instruction::Xor: NumFastIselFailXor++; return;
957 // Memory instructions...
958 case Instruction::Alloca: NumFastIselFailAlloca++; return;
959 case Instruction::Load: NumFastIselFailLoad++; return;
960 case Instruction::Store: NumFastIselFailStore++; return;
961 case Instruction::AtomicCmpXchg: NumFastIselFailAtomicCmpXchg++; return;
962 case Instruction::AtomicRMW: NumFastIselFailAtomicRMW++; return;
963 case Instruction::Fence: NumFastIselFailFence++; return;
964 case Instruction::GetElementPtr: NumFastIselFailGetElementPtr++; return;
966 // Convert instructions...
967 case Instruction::Trunc: NumFastIselFailTrunc++; return;
968 case Instruction::ZExt: NumFastIselFailZExt++; return;
969 case Instruction::SExt: NumFastIselFailSExt++; return;
970 case Instruction::FPTrunc: NumFastIselFailFPTrunc++; return;
971 case Instruction::FPExt: NumFastIselFailFPExt++; return;
972 case Instruction::FPToUI: NumFastIselFailFPToUI++; return;
973 case Instruction::FPToSI: NumFastIselFailFPToSI++; return;
974 case Instruction::UIToFP: NumFastIselFailUIToFP++; return;
975 case Instruction::SIToFP: NumFastIselFailSIToFP++; return;
976 case Instruction::IntToPtr: NumFastIselFailIntToPtr++; return;
977 case Instruction::PtrToInt: NumFastIselFailPtrToInt++; return;
978 case Instruction::BitCast: NumFastIselFailBitCast++; return;
980 // Other instructions...
981 case Instruction::ICmp: NumFastIselFailICmp++; return;
982 case Instruction::FCmp: NumFastIselFailFCmp++; return;
983 case Instruction::PHI: NumFastIselFailPHI++; return;
984 case Instruction::Select: NumFastIselFailSelect++; return;
985 case Instruction::Call: NumFastIselFailCall++; return;
986 case Instruction::Shl: NumFastIselFailShl++; return;
987 case Instruction::LShr: NumFastIselFailLShr++; return;
988 case Instruction::AShr: NumFastIselFailAShr++; return;
989 case Instruction::VAArg: NumFastIselFailVAArg++; return;
990 case Instruction::ExtractElement: NumFastIselFailExtractElement++; return;
991 case Instruction::InsertElement: NumFastIselFailInsertElement++; return;
992 case Instruction::ShuffleVector: NumFastIselFailShuffleVector++; return;
993 case Instruction::ExtractValue: NumFastIselFailExtractValue++; return;
994 case Instruction::InsertValue: NumFastIselFailInsertValue++; return;
995 case Instruction::LandingPad: NumFastIselFailLandingPad++; return;
1000 void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
1001 // Initialize the Fast-ISel state, if needed.
1002 FastISel *FastIS = 0;
1003 if (TM.Options.EnableFastISel)
1004 FastIS = TLI.createFastISel(*FuncInfo, LibInfo);
1006 // Iterate over all basic blocks in the function.
1007 ReversePostOrderTraversal<const Function*> RPOT(&Fn);
1008 for (ReversePostOrderTraversal<const Function*>::rpo_iterator
1009 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
1010 const BasicBlock *LLVMBB = *I;
1012 if (OptLevel != CodeGenOpt::None) {
1013 bool AllPredsVisited = true;
1014 for (const_pred_iterator PI = pred_begin(LLVMBB), PE = pred_end(LLVMBB);
1016 if (!FuncInfo->VisitedBBs.count(*PI)) {
1017 AllPredsVisited = false;
1022 if (AllPredsVisited) {
1023 for (BasicBlock::const_iterator I = LLVMBB->begin();
1024 const PHINode *PN = dyn_cast<PHINode>(I); ++I)
1025 FuncInfo->ComputePHILiveOutRegInfo(PN);
1027 for (BasicBlock::const_iterator I = LLVMBB->begin();
1028 const PHINode *PN = dyn_cast<PHINode>(I); ++I)
1029 FuncInfo->InvalidatePHILiveOutRegInfo(PN);
1032 FuncInfo->VisitedBBs.insert(LLVMBB);
1035 FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB];
1036 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
1038 BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
1039 BasicBlock::const_iterator const End = LLVMBB->end();
1040 BasicBlock::const_iterator BI = End;
1042 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
1044 // Setup an EH landing-pad block.
1045 if (FuncInfo->MBB->isLandingPad())
1046 PrepareEHLandingPad();
1048 // Before doing SelectionDAG ISel, see if FastISel has been requested.
1050 FastIS->startNewBlock();
1052 // Emit code for any incoming arguments. This must happen before
1053 // beginning FastISel on the entry block.
1054 if (LLVMBB == &Fn.getEntryBlock()) {
1055 // Lower any arguments needed in this block if this is the entry block.
1056 if (!FastIS->LowerArguments()) {
1058 if (EnableFastISelAbortArgs)
1059 // The "fast" selector couldn't lower these arguments. For the
1060 // purpose of debugging, just abort.
1061 llvm_unreachable("FastISel didn't lower all arguments");
1063 // Call target indepedent SDISel argument lowering code if the target
1064 // specific routine is not successful.
1065 LowerArguments(LLVMBB);
1066 CurDAG->setRoot(SDB->getControlRoot());
1068 CodeGenAndEmitDAG();
1071 // If we inserted any instructions at the beginning, make a note of
1072 // where they are, so we can be sure to emit subsequent instructions
1074 if (FuncInfo->InsertPt != FuncInfo->MBB->begin())
1075 FastIS->setLastLocalValue(llvm::prior(FuncInfo->InsertPt));
1077 FastIS->setLastLocalValue(0);
1080 unsigned NumFastIselRemaining = std::distance(Begin, End);
1081 // Do FastISel on as many instructions as possible.
1082 for (; BI != Begin; --BI) {
1083 const Instruction *Inst = llvm::prior(BI);
1085 // If we no longer require this instruction, skip it.
1086 if (isFoldedOrDeadInstruction(Inst, FuncInfo)) {
1087 --NumFastIselRemaining;
1091 // Bottom-up: reset the insert pos at the top, after any local-value
1093 FastIS->recomputeInsertPt();
1095 // Try to select the instruction with FastISel.
1096 if (FastIS->SelectInstruction(Inst)) {
1097 --NumFastIselRemaining;
1098 DEBUG(++NumFastIselSuccess);
1099 // If fast isel succeeded, skip over all the folded instructions, and
1100 // then see if there is a load right before the selected instructions.
1101 // Try to fold the load if so.
1102 const Instruction *BeforeInst = Inst;
1103 while (BeforeInst != Begin) {
1104 BeforeInst = llvm::prior(BasicBlock::const_iterator(BeforeInst));
1105 if (!isFoldedOrDeadInstruction(BeforeInst, FuncInfo))
1108 if (BeforeInst != Inst && isa<LoadInst>(BeforeInst) &&
1109 BeforeInst->hasOneUse() &&
1110 TryToFoldFastISelLoad(cast<LoadInst>(BeforeInst), Inst, FastIS)) {
1111 // If we succeeded, don't re-select the load.
1112 BI = llvm::next(BasicBlock::const_iterator(BeforeInst));
1113 --NumFastIselRemaining;
1114 DEBUG(++NumFastIselSuccess);
1120 if (EnableFastISelVerbose2)
1121 collectFailStats(Inst);
1124 // Then handle certain instructions as single-LLVM-Instruction blocks.
1125 if (isa<CallInst>(Inst)) {
1127 if (EnableFastISelVerbose || EnableFastISelAbort) {
1128 dbgs() << "FastISel missed call: ";
1132 if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) {
1133 unsigned &R = FuncInfo->ValueMap[Inst];
1135 R = FuncInfo->CreateRegs(Inst->getType());
1138 bool HadTailCall = false;
1139 MachineBasicBlock::iterator SavedInsertPt = FuncInfo->InsertPt;
1140 SelectBasicBlock(Inst, BI, HadTailCall);
1142 // If the call was emitted as a tail call, we're done with the block.
1143 // We also need to delete any previously emitted instructions.
1145 FastIS->removeDeadCode(SavedInsertPt, FuncInfo->MBB->end());
1150 // Recompute NumFastIselRemaining as Selection DAG instruction
1151 // selection may have handled the call, input args, etc.
1152 unsigned RemainingNow = std::distance(Begin, BI);
1153 (void) RemainingNow;
1154 DEBUG(NumFastIselFailures += NumFastIselRemaining - RemainingNow);
1155 DEBUG(NumFastIselRemaining = RemainingNow);
1159 if (isa<TerminatorInst>(Inst) && !isa<BranchInst>(Inst)) {
1160 // Don't abort, and use a different message for terminator misses.
1161 DEBUG(NumFastIselFailures += NumFastIselRemaining);
1162 if (EnableFastISelVerbose || EnableFastISelAbort) {
1163 dbgs() << "FastISel missed terminator: ";
1167 DEBUG(NumFastIselFailures += NumFastIselRemaining);
1168 if (EnableFastISelVerbose || EnableFastISelAbort) {
1169 dbgs() << "FastISel miss: ";
1172 if (EnableFastISelAbort)
1173 // The "fast" selector couldn't handle something and bailed.
1174 // For the purpose of debugging, just abort.
1175 llvm_unreachable("FastISel didn't select the entire block");
1180 FastIS->recomputeInsertPt();
1182 // Lower any arguments needed in this block if this is the entry block.
1183 if (LLVMBB == &Fn.getEntryBlock())
1184 LowerArguments(LLVMBB);
1190 ++NumFastIselBlocks;
1193 // Run SelectionDAG instruction selection on the remainder of the block
1194 // not handled by FastISel. If FastISel is not run, this is the entire
1197 SelectBasicBlock(Begin, BI, HadTailCall);
1201 FuncInfo->PHINodesToUpdate.clear();
1205 SDB->clearDanglingDebugInfo();
1209 SelectionDAGISel::FinishBasicBlock() {
1211 DEBUG(dbgs() << "Total amount of phi nodes to update: "
1212 << FuncInfo->PHINodesToUpdate.size() << "\n";
1213 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
1214 dbgs() << "Node " << i << " : ("
1215 << FuncInfo->PHINodesToUpdate[i].first
1216 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
1218 // Next, now that we know what the last MBB the LLVM BB expanded is, update
1219 // PHI nodes in successors.
1220 if (SDB->SwitchCases.empty() &&
1221 SDB->JTCases.empty() &&
1222 SDB->BitTestCases.empty()) {
1223 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1224 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[i].first);
1225 assert(PHI->isPHI() &&
1226 "This is not a machine PHI node that we are updating!");
1227 if (!FuncInfo->MBB->isSuccessor(PHI->getParent()))
1229 PHI.addReg(FuncInfo->PHINodesToUpdate[i].second).addMBB(FuncInfo->MBB);
1234 for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
1235 // Lower header first, if it wasn't already lowered
1236 if (!SDB->BitTestCases[i].Emitted) {
1237 // Set the current basic block to the mbb we wish to insert the code into
1238 FuncInfo->MBB = SDB->BitTestCases[i].Parent;
1239 FuncInfo->InsertPt = FuncInfo->MBB->end();
1241 SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB);
1242 CurDAG->setRoot(SDB->getRoot());
1244 CodeGenAndEmitDAG();
1247 uint32_t UnhandledWeight = 0;
1248 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j)
1249 UnhandledWeight += SDB->BitTestCases[i].Cases[j].ExtraWeight;
1251 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
1252 UnhandledWeight -= SDB->BitTestCases[i].Cases[j].ExtraWeight;
1253 // Set the current basic block to the mbb we wish to insert the code into
1254 FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB;
1255 FuncInfo->InsertPt = FuncInfo->MBB->end();
1258 SDB->visitBitTestCase(SDB->BitTestCases[i],
1259 SDB->BitTestCases[i].Cases[j+1].ThisBB,
1261 SDB->BitTestCases[i].Reg,
1262 SDB->BitTestCases[i].Cases[j],
1265 SDB->visitBitTestCase(SDB->BitTestCases[i],
1266 SDB->BitTestCases[i].Default,
1268 SDB->BitTestCases[i].Reg,
1269 SDB->BitTestCases[i].Cases[j],
1273 CurDAG->setRoot(SDB->getRoot());
1275 CodeGenAndEmitDAG();
1279 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1281 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[pi].first);
1282 MachineBasicBlock *PHIBB = PHI->getParent();
1283 assert(PHI->isPHI() &&
1284 "This is not a machine PHI node that we are updating!");
1285 // This is "default" BB. We have two jumps to it. From "header" BB and
1286 // from last "case" BB.
1287 if (PHIBB == SDB->BitTestCases[i].Default)
1288 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second)
1289 .addMBB(SDB->BitTestCases[i].Parent)
1290 .addReg(FuncInfo->PHINodesToUpdate[pi].second)
1291 .addMBB(SDB->BitTestCases[i].Cases.back().ThisBB);
1292 // One of "cases" BB.
1293 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
1295 MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
1296 if (cBB->isSuccessor(PHIBB))
1297 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second).addMBB(cBB);
1301 SDB->BitTestCases.clear();
1303 // If the JumpTable record is filled in, then we need to emit a jump table.
1304 // Updating the PHI nodes is tricky in this case, since we need to determine
1305 // whether the PHI is a successor of the range check MBB or the jump table MBB
1306 for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
1307 // Lower header first, if it wasn't already lowered
1308 if (!SDB->JTCases[i].first.Emitted) {
1309 // Set the current basic block to the mbb we wish to insert the code into
1310 FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB;
1311 FuncInfo->InsertPt = FuncInfo->MBB->end();
1313 SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
1315 CurDAG->setRoot(SDB->getRoot());
1317 CodeGenAndEmitDAG();
1320 // Set the current basic block to the mbb we wish to insert the code into
1321 FuncInfo->MBB = SDB->JTCases[i].second.MBB;
1322 FuncInfo->InsertPt = FuncInfo->MBB->end();
1324 SDB->visitJumpTable(SDB->JTCases[i].second);
1325 CurDAG->setRoot(SDB->getRoot());
1327 CodeGenAndEmitDAG();
1330 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1332 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[pi].first);
1333 MachineBasicBlock *PHIBB = PHI->getParent();
1334 assert(PHI->isPHI() &&
1335 "This is not a machine PHI node that we are updating!");
1336 // "default" BB. We can go there only from header BB.
1337 if (PHIBB == SDB->JTCases[i].second.Default)
1338 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second)
1339 .addMBB(SDB->JTCases[i].first.HeaderBB);
1340 // JT BB. Just iterate over successors here
1341 if (FuncInfo->MBB->isSuccessor(PHIBB))
1342 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second).addMBB(FuncInfo->MBB);
1345 SDB->JTCases.clear();
1347 // If the switch block involved a branch to one of the actual successors, we
1348 // need to update PHI nodes in that block.
1349 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1350 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[i].first);
1351 assert(PHI->isPHI() &&
1352 "This is not a machine PHI node that we are updating!");
1353 if (FuncInfo->MBB->isSuccessor(PHI->getParent()))
1354 PHI.addReg(FuncInfo->PHINodesToUpdate[i].second).addMBB(FuncInfo->MBB);
1357 // If we generated any switch lowering information, build and codegen any
1358 // additional DAGs necessary.
1359 for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
1360 // Set the current basic block to the mbb we wish to insert the code into
1361 FuncInfo->MBB = SDB->SwitchCases[i].ThisBB;
1362 FuncInfo->InsertPt = FuncInfo->MBB->end();
1364 // Determine the unique successors.
1365 SmallVector<MachineBasicBlock *, 2> Succs;
1366 Succs.push_back(SDB->SwitchCases[i].TrueBB);
1367 if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB)
1368 Succs.push_back(SDB->SwitchCases[i].FalseBB);
1370 // Emit the code. Note that this could result in FuncInfo->MBB being split.
1371 SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB);
1372 CurDAG->setRoot(SDB->getRoot());
1374 CodeGenAndEmitDAG();
1376 // Remember the last block, now that any splitting is done, for use in
1377 // populating PHI nodes in successors.
1378 MachineBasicBlock *ThisBB = FuncInfo->MBB;
1380 // Handle any PHI nodes in successors of this chunk, as if we were coming
1381 // from the original BB before switch expansion. Note that PHI nodes can
1382 // occur multiple times in PHINodesToUpdate. We have to be very careful to
1383 // handle them the right number of times.
1384 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
1385 FuncInfo->MBB = Succs[i];
1386 FuncInfo->InsertPt = FuncInfo->MBB->end();
1387 // FuncInfo->MBB may have been removed from the CFG if a branch was
1389 if (ThisBB->isSuccessor(FuncInfo->MBB)) {
1390 for (MachineBasicBlock::iterator
1391 MBBI = FuncInfo->MBB->begin(), MBBE = FuncInfo->MBB->end();
1392 MBBI != MBBE && MBBI->isPHI(); ++MBBI) {
1393 MachineInstrBuilder PHI(*MF, MBBI);
1394 // This value for this PHI node is recorded in PHINodesToUpdate.
1395 for (unsigned pn = 0; ; ++pn) {
1396 assert(pn != FuncInfo->PHINodesToUpdate.size() &&
1397 "Didn't find PHI entry!");
1398 if (FuncInfo->PHINodesToUpdate[pn].first == PHI) {
1399 PHI.addReg(FuncInfo->PHINodesToUpdate[pn].second).addMBB(ThisBB);
1407 SDB->SwitchCases.clear();
1411 /// Create the scheduler. If a specific scheduler was specified
1412 /// via the SchedulerRegistry, use it, otherwise select the
1413 /// one preferred by the target.
1415 ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
1416 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
1420 RegisterScheduler::setDefault(Ctor);
1423 return Ctor(this, OptLevel);
1426 //===----------------------------------------------------------------------===//
1427 // Helper functions used by the generated instruction selector.
1428 //===----------------------------------------------------------------------===//
1429 // Calls to these methods are generated by tblgen.
1431 /// CheckAndMask - The isel is trying to match something like (and X, 255). If
1432 /// the dag combiner simplified the 255, we still want to match. RHS is the
1433 /// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
1434 /// specified in the .td file (e.g. 255).
1435 bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
1436 int64_t DesiredMaskS) const {
1437 const APInt &ActualMask = RHS->getAPIntValue();
1438 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
1440 // If the actual mask exactly matches, success!
1441 if (ActualMask == DesiredMask)
1444 // If the actual AND mask is allowing unallowed bits, this doesn't match.
1445 if (ActualMask.intersects(~DesiredMask))
1448 // Otherwise, the DAG Combiner may have proven that the value coming in is
1449 // either already zero or is not demanded. Check for known zero input bits.
1450 APInt NeededMask = DesiredMask & ~ActualMask;
1451 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
1454 // TODO: check to see if missing bits are just not demanded.
1456 // Otherwise, this pattern doesn't match.
1460 /// CheckOrMask - The isel is trying to match something like (or X, 255). If
1461 /// the dag combiner simplified the 255, we still want to match. RHS is the
1462 /// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
1463 /// specified in the .td file (e.g. 255).
1464 bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
1465 int64_t DesiredMaskS) const {
1466 const APInt &ActualMask = RHS->getAPIntValue();
1467 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
1469 // If the actual mask exactly matches, success!
1470 if (ActualMask == DesiredMask)
1473 // If the actual AND mask is allowing unallowed bits, this doesn't match.
1474 if (ActualMask.intersects(~DesiredMask))
1477 // Otherwise, the DAG Combiner may have proven that the value coming in is
1478 // either already zero or is not demanded. Check for known zero input bits.
1479 APInt NeededMask = DesiredMask & ~ActualMask;
1481 APInt KnownZero, KnownOne;
1482 CurDAG->ComputeMaskedBits(LHS, KnownZero, KnownOne);
1484 // If all the missing bits in the or are already known to be set, match!
1485 if ((NeededMask & KnownOne) == NeededMask)
1488 // TODO: check to see if missing bits are just not demanded.
1490 // Otherwise, this pattern doesn't match.
1495 /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
1496 /// by tblgen. Others should not call it.
1497 void SelectionDAGISel::
1498 SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
1499 std::vector<SDValue> InOps;
1500 std::swap(InOps, Ops);
1502 Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
1503 Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
1504 Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
1505 Ops.push_back(InOps[InlineAsm::Op_ExtraInfo]); // 3 (SideEffect, AlignStack)
1507 unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
1508 if (InOps[e-1].getValueType() == MVT::Glue)
1509 --e; // Don't process a glue operand if it is here.
1512 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
1513 if (!InlineAsm::isMemKind(Flags)) {
1514 // Just skip over this operand, copying the operands verbatim.
1515 Ops.insert(Ops.end(), InOps.begin()+i,
1516 InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
1517 i += InlineAsm::getNumOperandRegisters(Flags) + 1;
1519 assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
1520 "Memory operand with multiple values?");
1521 // Otherwise, this is a memory operand. Ask the target to select it.
1522 std::vector<SDValue> SelOps;
1523 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps))
1524 report_fatal_error("Could not match memory address. Inline asm"
1527 // Add this to the output node.
1529 InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
1530 Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
1531 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
1536 // Add the glue input back if present.
1537 if (e != InOps.size())
1538 Ops.push_back(InOps.back());
1541 /// findGlueUse - Return use of MVT::Glue value produced by the specified
1544 static SDNode *findGlueUse(SDNode *N) {
1545 unsigned FlagResNo = N->getNumValues()-1;
1546 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
1547 SDUse &Use = I.getUse();
1548 if (Use.getResNo() == FlagResNo)
1549 return Use.getUser();
1554 /// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
1555 /// This function recursively traverses up the operand chain, ignoring
1557 static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
1558 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1559 bool IgnoreChains) {
1560 // The NodeID's are given uniques ID's where a node ID is guaranteed to be
1561 // greater than all of its (recursive) operands. If we scan to a point where
1562 // 'use' is smaller than the node we're scanning for, then we know we will
1565 // The Use may be -1 (unassigned) if it is a newly allocated node. This can
1566 // happen because we scan down to newly selected nodes in the case of glue
1568 if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
1571 // Don't revisit nodes if we already scanned it and didn't fail, we know we
1572 // won't fail if we scan it again.
1573 if (!Visited.insert(Use))
1576 for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
1577 // Ignore chain uses, they are validated by HandleMergeInputChains.
1578 if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
1581 SDNode *N = Use->getOperand(i).getNode();
1583 if (Use == ImmedUse || Use == Root)
1584 continue; // We are not looking for immediate use.
1589 // Traverse up the operand chain.
1590 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
1596 /// IsProfitableToFold - Returns true if it's profitable to fold the specific
1597 /// operand node N of U during instruction selection that starts at Root.
1598 bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
1599 SDNode *Root) const {
1600 if (OptLevel == CodeGenOpt::None) return false;
1601 return N.hasOneUse();
1604 /// IsLegalToFold - Returns true if the specific operand node N of
1605 /// U can be folded during instruction selection that starts at Root.
1606 bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
1607 CodeGenOpt::Level OptLevel,
1608 bool IgnoreChains) {
1609 if (OptLevel == CodeGenOpt::None) return false;
1611 // If Root use can somehow reach N through a path that that doesn't contain
1612 // U then folding N would create a cycle. e.g. In the following
1613 // diagram, Root can reach N through X. If N is folded into into Root, then
1614 // X is both a predecessor and a successor of U.
1625 // * indicates nodes to be folded together.
1627 // If Root produces glue, then it gets (even more) interesting. Since it
1628 // will be "glued" together with its glue use in the scheduler, we need to
1629 // check if it might reach N.
1648 // If GU (glue use) indirectly reaches N (the load), and Root folds N
1649 // (call it Fold), then X is a predecessor of GU and a successor of
1650 // Fold. But since Fold and GU are glued together, this will create
1651 // a cycle in the scheduling graph.
1653 // If the node has glue, walk down the graph to the "lowest" node in the
1655 EVT VT = Root->getValueType(Root->getNumValues()-1);
1656 while (VT == MVT::Glue) {
1657 SDNode *GU = findGlueUse(Root);
1661 VT = Root->getValueType(Root->getNumValues()-1);
1663 // If our query node has a glue result with a use, we've walked up it. If
1664 // the user (which has already been selected) has a chain or indirectly uses
1665 // the chain, our WalkChainUsers predicate will not consider it. Because of
1666 // this, we cannot ignore chains in this predicate.
1667 IgnoreChains = false;
1671 SmallPtrSet<SDNode*, 16> Visited;
1672 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
1675 SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
1676 std::vector<SDValue> Ops(N->op_begin(), N->op_end());
1677 SelectInlineAsmMemoryOperands(Ops);
1679 std::vector<EVT> VTs;
1680 VTs.push_back(MVT::Other);
1681 VTs.push_back(MVT::Glue);
1682 SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(),
1683 VTs, &Ops[0], Ops.size());
1685 return New.getNode();
1688 SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
1689 return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
1692 /// GetVBR - decode a vbr encoding whose top bit is set.
1693 LLVM_ATTRIBUTE_ALWAYS_INLINE static uint64_t
1694 GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
1695 assert(Val >= 128 && "Not a VBR");
1696 Val &= 127; // Remove first vbr bit.
1701 NextBits = MatcherTable[Idx++];
1702 Val |= (NextBits&127) << Shift;
1704 } while (NextBits & 128);
1710 /// UpdateChainsAndGlue - When a match is complete, this method updates uses of
1711 /// interior glue and chain results to use the new glue and chain results.
1712 void SelectionDAGISel::
1713 UpdateChainsAndGlue(SDNode *NodeToMatch, SDValue InputChain,
1714 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1716 const SmallVectorImpl<SDNode*> &GlueResultNodesMatched,
1717 bool isMorphNodeTo) {
1718 SmallVector<SDNode*, 4> NowDeadNodes;
1720 // Now that all the normal results are replaced, we replace the chain and
1721 // glue results if present.
1722 if (!ChainNodesMatched.empty()) {
1723 assert(InputChain.getNode() != 0 &&
1724 "Matched input chains but didn't produce a chain");
1725 // Loop over all of the nodes we matched that produced a chain result.
1726 // Replace all the chain results with the final chain we ended up with.
1727 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1728 SDNode *ChainNode = ChainNodesMatched[i];
1730 // If this node was already deleted, don't look at it.
1731 if (ChainNode->getOpcode() == ISD::DELETED_NODE)
1734 // Don't replace the results of the root node if we're doing a
1736 if (ChainNode == NodeToMatch && isMorphNodeTo)
1739 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
1740 if (ChainVal.getValueType() == MVT::Glue)
1741 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
1742 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
1743 CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain);
1745 // If the node became dead and we haven't already seen it, delete it.
1746 if (ChainNode->use_empty() &&
1747 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
1748 NowDeadNodes.push_back(ChainNode);
1752 // If the result produces glue, update any glue results in the matched
1753 // pattern with the glue result.
1754 if (InputGlue.getNode() != 0) {
1755 // Handle any interior nodes explicitly marked.
1756 for (unsigned i = 0, e = GlueResultNodesMatched.size(); i != e; ++i) {
1757 SDNode *FRN = GlueResultNodesMatched[i];
1759 // If this node was already deleted, don't look at it.
1760 if (FRN->getOpcode() == ISD::DELETED_NODE)
1763 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue &&
1764 "Doesn't have a glue result");
1765 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
1768 // If the node became dead and we haven't already seen it, delete it.
1769 if (FRN->use_empty() &&
1770 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
1771 NowDeadNodes.push_back(FRN);
1775 if (!NowDeadNodes.empty())
1776 CurDAG->RemoveDeadNodes(NowDeadNodes);
1778 DEBUG(errs() << "ISEL: Match complete!\n");
1784 CR_LeadsToInteriorNode
1787 /// WalkChainUsers - Walk down the users of the specified chained node that is
1788 /// part of the pattern we're matching, looking at all of the users we find.
1789 /// This determines whether something is an interior node, whether we have a
1790 /// non-pattern node in between two pattern nodes (which prevent folding because
1791 /// it would induce a cycle) and whether we have a TokenFactor node sandwiched
1792 /// between pattern nodes (in which case the TF becomes part of the pattern).
1794 /// The walk we do here is guaranteed to be small because we quickly get down to
1795 /// already selected nodes "below" us.
1797 WalkChainUsers(const SDNode *ChainedNode,
1798 SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
1799 SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
1800 ChainResult Result = CR_Simple;
1802 for (SDNode::use_iterator UI = ChainedNode->use_begin(),
1803 E = ChainedNode->use_end(); UI != E; ++UI) {
1804 // Make sure the use is of the chain, not some other value we produce.
1805 if (UI.getUse().getValueType() != MVT::Other) continue;
1809 // If we see an already-selected machine node, then we've gone beyond the
1810 // pattern that we're selecting down into the already selected chunk of the
1812 if (User->isMachineOpcode() ||
1813 User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
1816 unsigned UserOpcode = User->getOpcode();
1817 if (UserOpcode == ISD::CopyToReg ||
1818 UserOpcode == ISD::CopyFromReg ||
1819 UserOpcode == ISD::INLINEASM ||
1820 UserOpcode == ISD::EH_LABEL ||
1821 UserOpcode == ISD::LIFETIME_START ||
1822 UserOpcode == ISD::LIFETIME_END) {
1823 // If their node ID got reset to -1 then they've already been selected.
1824 // Treat them like a MachineOpcode.
1825 if (User->getNodeId() == -1)
1829 // If we have a TokenFactor, we handle it specially.
1830 if (User->getOpcode() != ISD::TokenFactor) {
1831 // If the node isn't a token factor and isn't part of our pattern, then it
1832 // must be a random chained node in between two nodes we're selecting.
1833 // This happens when we have something like:
1838 // Because we structurally match the load/store as a read/modify/write,
1839 // but the call is chained between them. We cannot fold in this case
1840 // because it would induce a cycle in the graph.
1841 if (!std::count(ChainedNodesInPattern.begin(),
1842 ChainedNodesInPattern.end(), User))
1843 return CR_InducesCycle;
1845 // Otherwise we found a node that is part of our pattern. For example in:
1849 // This would happen when we're scanning down from the load and see the
1850 // store as a user. Record that there is a use of ChainedNode that is
1851 // part of the pattern and keep scanning uses.
1852 Result = CR_LeadsToInteriorNode;
1853 InteriorChainedNodes.push_back(User);
1857 // If we found a TokenFactor, there are two cases to consider: first if the
1858 // TokenFactor is just hanging "below" the pattern we're matching (i.e. no
1859 // uses of the TF are in our pattern) we just want to ignore it. Second,
1860 // the TokenFactor can be sandwiched in between two chained nodes, like so:
1866 // | \ DAG's like cheese
1869 // [TokenFactor] [Op]
1876 // In this case, the TokenFactor becomes part of our match and we rewrite it
1877 // as a new TokenFactor.
1879 // To distinguish these two cases, do a recursive walk down the uses.
1880 switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
1882 // If the uses of the TokenFactor are just already-selected nodes, ignore
1883 // it, it is "below" our pattern.
1885 case CR_InducesCycle:
1886 // If the uses of the TokenFactor lead to nodes that are not part of our
1887 // pattern that are not selected, folding would turn this into a cycle,
1889 return CR_InducesCycle;
1890 case CR_LeadsToInteriorNode:
1891 break; // Otherwise, keep processing.
1894 // Okay, we know we're in the interesting interior case. The TokenFactor
1895 // is now going to be considered part of the pattern so that we rewrite its
1896 // uses (it may have uses that are not part of the pattern) with the
1897 // ultimate chain result of the generated code. We will also add its chain
1898 // inputs as inputs to the ultimate TokenFactor we create.
1899 Result = CR_LeadsToInteriorNode;
1900 ChainedNodesInPattern.push_back(User);
1901 InteriorChainedNodes.push_back(User);
1908 /// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
1909 /// operation for when the pattern matched at least one node with a chains. The
1910 /// input vector contains a list of all of the chained nodes that we match. We
1911 /// must determine if this is a valid thing to cover (i.e. matching it won't
1912 /// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
1913 /// be used as the input node chain for the generated nodes.
1915 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
1916 SelectionDAG *CurDAG) {
1917 // Walk all of the chained nodes we've matched, recursively scanning down the
1918 // users of the chain result. This adds any TokenFactor nodes that are caught
1919 // in between chained nodes to the chained and interior nodes list.
1920 SmallVector<SDNode*, 3> InteriorChainedNodes;
1921 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1922 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1923 InteriorChainedNodes) == CR_InducesCycle)
1924 return SDValue(); // Would induce a cycle.
1927 // Okay, we have walked all the matched nodes and collected TokenFactor nodes
1928 // that we are interested in. Form our input TokenFactor node.
1929 SmallVector<SDValue, 3> InputChains;
1930 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1931 // Add the input chain of this node to the InputChains list (which will be
1932 // the operands of the generated TokenFactor) if it's not an interior node.
1933 SDNode *N = ChainNodesMatched[i];
1934 if (N->getOpcode() != ISD::TokenFactor) {
1935 if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
1938 // Otherwise, add the input chain.
1939 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1940 assert(InChain.getValueType() == MVT::Other && "Not a chain");
1941 InputChains.push_back(InChain);
1945 // If we have a token factor, we want to add all inputs of the token factor
1946 // that are not part of the pattern we're matching.
1947 for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
1948 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
1949 N->getOperand(op).getNode()))
1950 InputChains.push_back(N->getOperand(op));
1955 if (InputChains.size() == 1)
1956 return InputChains[0];
1957 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
1958 MVT::Other, &InputChains[0], InputChains.size());
1961 /// MorphNode - Handle morphing a node in place for the selector.
1962 SDNode *SelectionDAGISel::
1963 MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
1964 const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) {
1965 // It is possible we're using MorphNodeTo to replace a node with no
1966 // normal results with one that has a normal result (or we could be
1967 // adding a chain) and the input could have glue and chains as well.
1968 // In this case we need to shift the operands down.
1969 // FIXME: This is a horrible hack and broken in obscure cases, no worse
1970 // than the old isel though.
1971 int OldGlueResultNo = -1, OldChainResultNo = -1;
1973 unsigned NTMNumResults = Node->getNumValues();
1974 if (Node->getValueType(NTMNumResults-1) == MVT::Glue) {
1975 OldGlueResultNo = NTMNumResults-1;
1976 if (NTMNumResults != 1 &&
1977 Node->getValueType(NTMNumResults-2) == MVT::Other)
1978 OldChainResultNo = NTMNumResults-2;
1979 } else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
1980 OldChainResultNo = NTMNumResults-1;
1982 // Call the underlying SelectionDAG routine to do the transmogrification. Note
1983 // that this deletes operands of the old node that become dead.
1984 SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps);
1986 // MorphNodeTo can operate in two ways: if an existing node with the
1987 // specified operands exists, it can just return it. Otherwise, it
1988 // updates the node in place to have the requested operands.
1990 // If we updated the node in place, reset the node ID. To the isel,
1991 // this should be just like a newly allocated machine node.
1995 unsigned ResNumResults = Res->getNumValues();
1996 // Move the glue if needed.
1997 if ((EmitNodeInfo & OPFL_GlueOutput) && OldGlueResultNo != -1 &&
1998 (unsigned)OldGlueResultNo != ResNumResults-1)
1999 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldGlueResultNo),
2000 SDValue(Res, ResNumResults-1));
2002 if ((EmitNodeInfo & OPFL_GlueOutput) != 0)
2005 // Move the chain reference if needed.
2006 if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
2007 (unsigned)OldChainResultNo != ResNumResults-1)
2008 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
2009 SDValue(Res, ResNumResults-1));
2011 // Otherwise, no replacement happened because the node already exists. Replace
2012 // Uses of the old node with the new one.
2014 CurDAG->ReplaceAllUsesWith(Node, Res);
2019 /// CheckSame - Implements OP_CheckSame.
2020 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2021 CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2023 const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
2024 // Accept if it is exactly the same as a previously recorded node.
2025 unsigned RecNo = MatcherTable[MatcherIndex++];
2026 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2027 return N == RecordedNodes[RecNo].first;
2030 /// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
2031 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2032 CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2033 const SelectionDAGISel &SDISel) {
2034 return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
2037 /// CheckNodePredicate - Implements OP_CheckNodePredicate.
2038 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2039 CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2040 const SelectionDAGISel &SDISel, SDNode *N) {
2041 return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
2044 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2045 CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2047 uint16_t Opc = MatcherTable[MatcherIndex++];
2048 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2049 return N->getOpcode() == Opc;
2052 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2053 CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2054 SDValue N, const TargetLowering &TLI) {
2055 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2056 if (N.getValueType() == VT) return true;
2058 // Handle the case when VT is iPTR.
2059 return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy();
2062 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2063 CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2064 SDValue N, const TargetLowering &TLI,
2066 if (ChildNo >= N.getNumOperands())
2067 return false; // Match fails if out of range child #.
2068 return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
2072 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2073 CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2075 return cast<CondCodeSDNode>(N)->get() ==
2076 (ISD::CondCode)MatcherTable[MatcherIndex++];
2079 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2080 CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2081 SDValue N, const TargetLowering &TLI) {
2082 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2083 if (cast<VTSDNode>(N)->getVT() == VT)
2086 // Handle the case when VT is iPTR.
2087 return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy();
2090 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2091 CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2093 int64_t Val = MatcherTable[MatcherIndex++];
2095 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2097 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
2098 return C != 0 && C->getSExtValue() == Val;
2101 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2102 CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2103 SDValue N, const SelectionDAGISel &SDISel) {
2104 int64_t Val = MatcherTable[MatcherIndex++];
2106 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2108 if (N->getOpcode() != ISD::AND) return false;
2110 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
2111 return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val);
2114 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2115 CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2116 SDValue N, const SelectionDAGISel &SDISel) {
2117 int64_t Val = MatcherTable[MatcherIndex++];
2119 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2121 if (N->getOpcode() != ISD::OR) return false;
2123 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
2124 return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val);
2127 /// IsPredicateKnownToFail - If we know how and can do so without pushing a
2128 /// scope, evaluate the current node. If the current predicate is known to
2129 /// fail, set Result=true and return anything. If the current predicate is
2130 /// known to pass, set Result=false and return the MatcherIndex to continue
2131 /// with. If the current predicate is unknown, set Result=false and return the
2132 /// MatcherIndex to continue with.
2133 static unsigned IsPredicateKnownToFail(const unsigned char *Table,
2134 unsigned Index, SDValue N,
2136 const SelectionDAGISel &SDISel,
2137 SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
2138 switch (Table[Index++]) {
2141 return Index-1; // Could not evaluate this predicate.
2142 case SelectionDAGISel::OPC_CheckSame:
2143 Result = !::CheckSame(Table, Index, N, RecordedNodes);
2145 case SelectionDAGISel::OPC_CheckPatternPredicate:
2146 Result = !::CheckPatternPredicate(Table, Index, SDISel);
2148 case SelectionDAGISel::OPC_CheckPredicate:
2149 Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
2151 case SelectionDAGISel::OPC_CheckOpcode:
2152 Result = !::CheckOpcode(Table, Index, N.getNode());
2154 case SelectionDAGISel::OPC_CheckType:
2155 Result = !::CheckType(Table, Index, N, SDISel.TLI);
2157 case SelectionDAGISel::OPC_CheckChild0Type:
2158 case SelectionDAGISel::OPC_CheckChild1Type:
2159 case SelectionDAGISel::OPC_CheckChild2Type:
2160 case SelectionDAGISel::OPC_CheckChild3Type:
2161 case SelectionDAGISel::OPC_CheckChild4Type:
2162 case SelectionDAGISel::OPC_CheckChild5Type:
2163 case SelectionDAGISel::OPC_CheckChild6Type:
2164 case SelectionDAGISel::OPC_CheckChild7Type:
2165 Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
2166 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type);
2168 case SelectionDAGISel::OPC_CheckCondCode:
2169 Result = !::CheckCondCode(Table, Index, N);
2171 case SelectionDAGISel::OPC_CheckValueType:
2172 Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
2174 case SelectionDAGISel::OPC_CheckInteger:
2175 Result = !::CheckInteger(Table, Index, N);
2177 case SelectionDAGISel::OPC_CheckAndImm:
2178 Result = !::CheckAndImm(Table, Index, N, SDISel);
2180 case SelectionDAGISel::OPC_CheckOrImm:
2181 Result = !::CheckOrImm(Table, Index, N, SDISel);
2189 /// FailIndex - If this match fails, this is the index to continue with.
2192 /// NodeStack - The node stack when the scope was formed.
2193 SmallVector<SDValue, 4> NodeStack;
2195 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
2196 unsigned NumRecordedNodes;
2198 /// NumMatchedMemRefs - The number of matched memref entries.
2199 unsigned NumMatchedMemRefs;
2201 /// InputChain/InputGlue - The current chain/glue
2202 SDValue InputChain, InputGlue;
2204 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
2205 bool HasChainNodesMatched, HasGlueResultNodesMatched;
2210 SDNode *SelectionDAGISel::
2211 SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
2212 unsigned TableSize) {
2213 // FIXME: Should these even be selected? Handle these cases in the caller?
2214 switch (NodeToMatch->getOpcode()) {
2217 case ISD::EntryToken: // These nodes remain the same.
2218 case ISD::BasicBlock:
2220 case ISD::RegisterMask:
2221 //case ISD::VALUETYPE:
2222 //case ISD::CONDCODE:
2223 case ISD::HANDLENODE:
2224 case ISD::MDNODE_SDNODE:
2225 case ISD::TargetConstant:
2226 case ISD::TargetConstantFP:
2227 case ISD::TargetConstantPool:
2228 case ISD::TargetFrameIndex:
2229 case ISD::TargetExternalSymbol:
2230 case ISD::TargetBlockAddress:
2231 case ISD::TargetJumpTable:
2232 case ISD::TargetGlobalTLSAddress:
2233 case ISD::TargetGlobalAddress:
2234 case ISD::TokenFactor:
2235 case ISD::CopyFromReg:
2236 case ISD::CopyToReg:
2238 case ISD::LIFETIME_START:
2239 case ISD::LIFETIME_END:
2240 NodeToMatch->setNodeId(-1); // Mark selected.
2242 case ISD::AssertSext:
2243 case ISD::AssertZext:
2244 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
2245 NodeToMatch->getOperand(0));
2247 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
2248 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
2251 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
2253 // Set up the node stack with NodeToMatch as the only node on the stack.
2254 SmallVector<SDValue, 8> NodeStack;
2255 SDValue N = SDValue(NodeToMatch, 0);
2256 NodeStack.push_back(N);
2258 // MatchScopes - Scopes used when matching, if a match failure happens, this
2259 // indicates where to continue checking.
2260 SmallVector<MatchScope, 8> MatchScopes;
2262 // RecordedNodes - This is the set of nodes that have been recorded by the
2263 // state machine. The second value is the parent of the node, or null if the
2264 // root is recorded.
2265 SmallVector<std::pair<SDValue, SDNode*>, 8> RecordedNodes;
2267 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
2269 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
2271 // These are the current input chain and glue for use when generating nodes.
2272 // Various Emit operations change these. For example, emitting a copytoreg
2273 // uses and updates these.
2274 SDValue InputChain, InputGlue;
2276 // ChainNodesMatched - If a pattern matches nodes that have input/output
2277 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
2278 // which ones they are. The result is captured into this list so that we can
2279 // update the chain results when the pattern is complete.
2280 SmallVector<SDNode*, 3> ChainNodesMatched;
2281 SmallVector<SDNode*, 3> GlueResultNodesMatched;
2283 DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
2284 NodeToMatch->dump(CurDAG);
2287 // Determine where to start the interpreter. Normally we start at opcode #0,
2288 // but if the state machine starts with an OPC_SwitchOpcode, then we
2289 // accelerate the first lookup (which is guaranteed to be hot) with the
2290 // OpcodeOffset table.
2291 unsigned MatcherIndex = 0;
2293 if (!OpcodeOffset.empty()) {
2294 // Already computed the OpcodeOffset table, just index into it.
2295 if (N.getOpcode() < OpcodeOffset.size())
2296 MatcherIndex = OpcodeOffset[N.getOpcode()];
2297 DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n");
2299 } else if (MatcherTable[0] == OPC_SwitchOpcode) {
2300 // Otherwise, the table isn't computed, but the state machine does start
2301 // with an OPC_SwitchOpcode instruction. Populate the table now, since this
2302 // is the first time we're selecting an instruction.
2305 // Get the size of this case.
2306 unsigned CaseSize = MatcherTable[Idx++];
2308 CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
2309 if (CaseSize == 0) break;
2311 // Get the opcode, add the index to the table.
2312 uint16_t Opc = MatcherTable[Idx++];
2313 Opc |= (unsigned short)MatcherTable[Idx++] << 8;
2314 if (Opc >= OpcodeOffset.size())
2315 OpcodeOffset.resize((Opc+1)*2);
2316 OpcodeOffset[Opc] = Idx;
2320 // Okay, do the lookup for the first opcode.
2321 if (N.getOpcode() < OpcodeOffset.size())
2322 MatcherIndex = OpcodeOffset[N.getOpcode()];
2326 assert(MatcherIndex < TableSize && "Invalid index");
2328 unsigned CurrentOpcodeIndex = MatcherIndex;
2330 BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
2333 // Okay, the semantics of this operation are that we should push a scope
2334 // then evaluate the first child. However, pushing a scope only to have
2335 // the first check fail (which then pops it) is inefficient. If we can
2336 // determine immediately that the first check (or first several) will
2337 // immediately fail, don't even bother pushing a scope for them.
2341 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2342 if (NumToSkip & 128)
2343 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2344 // Found the end of the scope with no match.
2345 if (NumToSkip == 0) {
2350 FailIndex = MatcherIndex+NumToSkip;
2352 unsigned MatcherIndexOfPredicate = MatcherIndex;
2353 (void)MatcherIndexOfPredicate; // silence warning.
2355 // If we can't evaluate this predicate without pushing a scope (e.g. if
2356 // it is a 'MoveParent') or if the predicate succeeds on this node, we
2357 // push the scope and evaluate the full predicate chain.
2359 MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
2360 Result, *this, RecordedNodes);
2364 DEBUG(errs() << " Skipped scope entry (due to false predicate) at "
2365 << "index " << MatcherIndexOfPredicate
2366 << ", continuing at " << FailIndex << "\n");
2367 DEBUG(++NumDAGIselRetries);
2369 // Otherwise, we know that this case of the Scope is guaranteed to fail,
2370 // move to the next case.
2371 MatcherIndex = FailIndex;
2374 // If the whole scope failed to match, bail.
2375 if (FailIndex == 0) break;
2377 // Push a MatchScope which indicates where to go if the first child fails
2379 MatchScope NewEntry;
2380 NewEntry.FailIndex = FailIndex;
2381 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
2382 NewEntry.NumRecordedNodes = RecordedNodes.size();
2383 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
2384 NewEntry.InputChain = InputChain;
2385 NewEntry.InputGlue = InputGlue;
2386 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
2387 NewEntry.HasGlueResultNodesMatched = !GlueResultNodesMatched.empty();
2388 MatchScopes.push_back(NewEntry);
2391 case OPC_RecordNode: {
2392 // Remember this node, it may end up being an operand in the pattern.
2394 if (NodeStack.size() > 1)
2395 Parent = NodeStack[NodeStack.size()-2].getNode();
2396 RecordedNodes.push_back(std::make_pair(N, Parent));
2400 case OPC_RecordChild0: case OPC_RecordChild1:
2401 case OPC_RecordChild2: case OPC_RecordChild3:
2402 case OPC_RecordChild4: case OPC_RecordChild5:
2403 case OPC_RecordChild6: case OPC_RecordChild7: {
2404 unsigned ChildNo = Opcode-OPC_RecordChild0;
2405 if (ChildNo >= N.getNumOperands())
2406 break; // Match fails if out of range child #.
2408 RecordedNodes.push_back(std::make_pair(N->getOperand(ChildNo),
2412 case OPC_RecordMemRef:
2413 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
2416 case OPC_CaptureGlueInput:
2417 // If the current node has an input glue, capture it in InputGlue.
2418 if (N->getNumOperands() != 0 &&
2419 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue)
2420 InputGlue = N->getOperand(N->getNumOperands()-1);
2423 case OPC_MoveChild: {
2424 unsigned ChildNo = MatcherTable[MatcherIndex++];
2425 if (ChildNo >= N.getNumOperands())
2426 break; // Match fails if out of range child #.
2427 N = N.getOperand(ChildNo);
2428 NodeStack.push_back(N);
2432 case OPC_MoveParent:
2433 // Pop the current node off the NodeStack.
2434 NodeStack.pop_back();
2435 assert(!NodeStack.empty() && "Node stack imbalance!");
2436 N = NodeStack.back();
2440 if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
2442 case OPC_CheckPatternPredicate:
2443 if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
2445 case OPC_CheckPredicate:
2446 if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
2450 case OPC_CheckComplexPat: {
2451 unsigned CPNum = MatcherTable[MatcherIndex++];
2452 unsigned RecNo = MatcherTable[MatcherIndex++];
2453 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
2454 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second,
2455 RecordedNodes[RecNo].first, CPNum,
2460 case OPC_CheckOpcode:
2461 if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
2465 if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break;
2468 case OPC_SwitchOpcode: {
2469 unsigned CurNodeOpcode = N.getOpcode();
2470 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2473 // Get the size of this case.
2474 CaseSize = MatcherTable[MatcherIndex++];
2476 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2477 if (CaseSize == 0) break;
2479 uint16_t Opc = MatcherTable[MatcherIndex++];
2480 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2482 // If the opcode matches, then we will execute this case.
2483 if (CurNodeOpcode == Opc)
2486 // Otherwise, skip over this case.
2487 MatcherIndex += CaseSize;
2490 // If no cases matched, bail out.
2491 if (CaseSize == 0) break;
2493 // Otherwise, execute the case we found.
2494 DEBUG(errs() << " OpcodeSwitch from " << SwitchStart
2495 << " to " << MatcherIndex << "\n");
2499 case OPC_SwitchType: {
2500 MVT CurNodeVT = N.getValueType().getSimpleVT();
2501 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2504 // Get the size of this case.
2505 CaseSize = MatcherTable[MatcherIndex++];
2507 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2508 if (CaseSize == 0) break;
2510 MVT CaseVT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2511 if (CaseVT == MVT::iPTR)
2512 CaseVT = TLI.getPointerTy();
2514 // If the VT matches, then we will execute this case.
2515 if (CurNodeVT == CaseVT)
2518 // Otherwise, skip over this case.
2519 MatcherIndex += CaseSize;
2522 // If no cases matched, bail out.
2523 if (CaseSize == 0) break;
2525 // Otherwise, execute the case we found.
2526 DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
2527 << "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
2530 case OPC_CheckChild0Type: case OPC_CheckChild1Type:
2531 case OPC_CheckChild2Type: case OPC_CheckChild3Type:
2532 case OPC_CheckChild4Type: case OPC_CheckChild5Type:
2533 case OPC_CheckChild6Type: case OPC_CheckChild7Type:
2534 if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
2535 Opcode-OPC_CheckChild0Type))
2538 case OPC_CheckCondCode:
2539 if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
2541 case OPC_CheckValueType:
2542 if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break;
2544 case OPC_CheckInteger:
2545 if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
2547 case OPC_CheckAndImm:
2548 if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
2550 case OPC_CheckOrImm:
2551 if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
2554 case OPC_CheckFoldableChainNode: {
2555 assert(NodeStack.size() != 1 && "No parent node");
2556 // Verify that all intermediate nodes between the root and this one have
2558 bool HasMultipleUses = false;
2559 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
2560 if (!NodeStack[i].hasOneUse()) {
2561 HasMultipleUses = true;
2564 if (HasMultipleUses) break;
2566 // Check to see that the target thinks this is profitable to fold and that
2567 // we can fold it without inducing cycles in the graph.
2568 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2570 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2571 NodeToMatch, OptLevel,
2572 true/*We validate our own chains*/))
2577 case OPC_EmitInteger: {
2578 MVT::SimpleValueType VT =
2579 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2580 int64_t Val = MatcherTable[MatcherIndex++];
2582 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2583 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2584 CurDAG->getTargetConstant(Val, VT), (SDNode*)0));
2587 case OPC_EmitRegister: {
2588 MVT::SimpleValueType VT =
2589 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2590 unsigned RegNo = MatcherTable[MatcherIndex++];
2591 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2592 CurDAG->getRegister(RegNo, VT), (SDNode*)0));
2595 case OPC_EmitRegister2: {
2596 // For targets w/ more than 256 register names, the register enum
2597 // values are stored in two bytes in the matcher table (just like
2599 MVT::SimpleValueType VT =
2600 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2601 unsigned RegNo = MatcherTable[MatcherIndex++];
2602 RegNo |= MatcherTable[MatcherIndex++] << 8;
2603 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2604 CurDAG->getRegister(RegNo, VT), (SDNode*)0));
2608 case OPC_EmitConvertToTarget: {
2609 // Convert from IMM/FPIMM to target version.
2610 unsigned RecNo = MatcherTable[MatcherIndex++];
2611 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2612 SDValue Imm = RecordedNodes[RecNo].first;
2614 if (Imm->getOpcode() == ISD::Constant) {
2615 int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
2616 Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
2617 } else if (Imm->getOpcode() == ISD::ConstantFP) {
2618 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
2619 Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
2622 RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second));
2626 case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
2627 case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
2628 // These are space-optimized forms of OPC_EmitMergeInputChains.
2629 assert(InputChain.getNode() == 0 &&
2630 "EmitMergeInputChains should be the first chain producing node");
2631 assert(ChainNodesMatched.empty() &&
2632 "Should only have one EmitMergeInputChains per match");
2634 // Read all of the chained nodes.
2635 unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
2636 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2637 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2639 // FIXME: What if other value results of the node have uses not matched
2641 if (ChainNodesMatched.back() != NodeToMatch &&
2642 !RecordedNodes[RecNo].first.hasOneUse()) {
2643 ChainNodesMatched.clear();
2647 // Merge the input chains if they are not intra-pattern references.
2648 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2650 if (InputChain.getNode() == 0)
2651 break; // Failed to merge.
2655 case OPC_EmitMergeInputChains: {
2656 assert(InputChain.getNode() == 0 &&
2657 "EmitMergeInputChains should be the first chain producing node");
2658 // This node gets a list of nodes we matched in the input that have
2659 // chains. We want to token factor all of the input chains to these nodes
2660 // together. However, if any of the input chains is actually one of the
2661 // nodes matched in this pattern, then we have an intra-match reference.
2662 // Ignore these because the newly token factored chain should not refer to
2664 unsigned NumChains = MatcherTable[MatcherIndex++];
2665 assert(NumChains != 0 && "Can't TF zero chains");
2667 assert(ChainNodesMatched.empty() &&
2668 "Should only have one EmitMergeInputChains per match");
2670 // Read all of the chained nodes.
2671 for (unsigned i = 0; i != NumChains; ++i) {
2672 unsigned RecNo = MatcherTable[MatcherIndex++];
2673 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2674 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2676 // FIXME: What if other value results of the node have uses not matched
2678 if (ChainNodesMatched.back() != NodeToMatch &&
2679 !RecordedNodes[RecNo].first.hasOneUse()) {
2680 ChainNodesMatched.clear();
2685 // If the inner loop broke out, the match fails.
2686 if (ChainNodesMatched.empty())
2689 // Merge the input chains if they are not intra-pattern references.
2690 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2692 if (InputChain.getNode() == 0)
2693 break; // Failed to merge.
2698 case OPC_EmitCopyToReg: {
2699 unsigned RecNo = MatcherTable[MatcherIndex++];
2700 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2701 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
2703 if (InputChain.getNode() == 0)
2704 InputChain = CurDAG->getEntryNode();
2706 InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
2707 DestPhysReg, RecordedNodes[RecNo].first,
2710 InputGlue = InputChain.getValue(1);
2714 case OPC_EmitNodeXForm: {
2715 unsigned XFormNo = MatcherTable[MatcherIndex++];
2716 unsigned RecNo = MatcherTable[MatcherIndex++];
2717 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2718 SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo);
2719 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(Res, (SDNode*) 0));
2724 case OPC_MorphNodeTo: {
2725 uint16_t TargetOpc = MatcherTable[MatcherIndex++];
2726 TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2727 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
2728 // Get the result VT list.
2729 unsigned NumVTs = MatcherTable[MatcherIndex++];
2730 SmallVector<EVT, 4> VTs;
2731 for (unsigned i = 0; i != NumVTs; ++i) {
2732 MVT::SimpleValueType VT =
2733 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2734 if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
2738 if (EmitNodeInfo & OPFL_Chain)
2739 VTs.push_back(MVT::Other);
2740 if (EmitNodeInfo & OPFL_GlueOutput)
2741 VTs.push_back(MVT::Glue);
2743 // This is hot code, so optimize the two most common cases of 1 and 2
2746 if (VTs.size() == 1)
2747 VTList = CurDAG->getVTList(VTs[0]);
2748 else if (VTs.size() == 2)
2749 VTList = CurDAG->getVTList(VTs[0], VTs[1]);
2751 VTList = CurDAG->getVTList(VTs.data(), VTs.size());
2753 // Get the operand list.
2754 unsigned NumOps = MatcherTable[MatcherIndex++];
2755 SmallVector<SDValue, 8> Ops;
2756 for (unsigned i = 0; i != NumOps; ++i) {
2757 unsigned RecNo = MatcherTable[MatcherIndex++];
2759 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2761 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
2762 Ops.push_back(RecordedNodes[RecNo].first);
2765 // If there are variadic operands to add, handle them now.
2766 if (EmitNodeInfo & OPFL_VariadicInfo) {
2767 // Determine the start index to copy from.
2768 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
2769 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
2770 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
2771 "Invalid variadic node");
2772 // Copy all of the variadic operands, not including a potential glue
2774 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
2776 SDValue V = NodeToMatch->getOperand(i);
2777 if (V.getValueType() == MVT::Glue) break;
2782 // If this has chain/glue inputs, add them.
2783 if (EmitNodeInfo & OPFL_Chain)
2784 Ops.push_back(InputChain);
2785 if ((EmitNodeInfo & OPFL_GlueInput) && InputGlue.getNode() != 0)
2786 Ops.push_back(InputGlue);
2790 if (Opcode != OPC_MorphNodeTo) {
2791 // If this is a normal EmitNode command, just create the new node and
2792 // add the results to the RecordedNodes list.
2793 Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(),
2794 VTList, Ops.data(), Ops.size());
2796 // Add all the non-glue/non-chain results to the RecordedNodes list.
2797 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
2798 if (VTs[i] == MVT::Other || VTs[i] == MVT::Glue) break;
2799 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(SDValue(Res, i),
2803 } else if (NodeToMatch->getOpcode() != ISD::DELETED_NODE) {
2804 Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(),
2807 // NodeToMatch was eliminated by CSE when the target changed the DAG.
2808 // We will visit the equivalent node later.
2809 DEBUG(dbgs() << "Node was eliminated by CSE\n");
2813 // If the node had chain/glue results, update our notion of the current
2815 if (EmitNodeInfo & OPFL_GlueOutput) {
2816 InputGlue = SDValue(Res, VTs.size()-1);
2817 if (EmitNodeInfo & OPFL_Chain)
2818 InputChain = SDValue(Res, VTs.size()-2);
2819 } else if (EmitNodeInfo & OPFL_Chain)
2820 InputChain = SDValue(Res, VTs.size()-1);
2822 // If the OPFL_MemRefs glue is set on this node, slap all of the
2823 // accumulated memrefs onto it.
2825 // FIXME: This is vastly incorrect for patterns with multiple outputs
2826 // instructions that access memory and for ComplexPatterns that match
2828 if (EmitNodeInfo & OPFL_MemRefs) {
2829 // Only attach load or store memory operands if the generated
2830 // instruction may load or store.
2831 const MCInstrDesc &MCID = TM.getInstrInfo()->get(TargetOpc);
2832 bool mayLoad = MCID.mayLoad();
2833 bool mayStore = MCID.mayStore();
2835 unsigned NumMemRefs = 0;
2836 for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
2837 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
2838 if ((*I)->isLoad()) {
2841 } else if ((*I)->isStore()) {
2849 MachineSDNode::mmo_iterator MemRefs =
2850 MF->allocateMemRefsArray(NumMemRefs);
2852 MachineSDNode::mmo_iterator MemRefsPos = MemRefs;
2853 for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
2854 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
2855 if ((*I)->isLoad()) {
2858 } else if ((*I)->isStore()) {
2866 cast<MachineSDNode>(Res)
2867 ->setMemRefs(MemRefs, MemRefs + NumMemRefs);
2871 << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
2872 << " node: "; Res->dump(CurDAG); errs() << "\n");
2874 // If this was a MorphNodeTo then we're completely done!
2875 if (Opcode == OPC_MorphNodeTo) {
2876 // Update chain and glue uses.
2877 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2878 InputGlue, GlueResultNodesMatched, true);
2885 case OPC_MarkGlueResults: {
2886 unsigned NumNodes = MatcherTable[MatcherIndex++];
2888 // Read and remember all the glue-result nodes.
2889 for (unsigned i = 0; i != NumNodes; ++i) {
2890 unsigned RecNo = MatcherTable[MatcherIndex++];
2892 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2894 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2895 GlueResultNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2900 case OPC_CompleteMatch: {
2901 // The match has been completed, and any new nodes (if any) have been
2902 // created. Patch up references to the matched dag to use the newly
2904 unsigned NumResults = MatcherTable[MatcherIndex++];
2906 for (unsigned i = 0; i != NumResults; ++i) {
2907 unsigned ResSlot = MatcherTable[MatcherIndex++];
2909 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
2911 assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
2912 SDValue Res = RecordedNodes[ResSlot].first;
2914 assert(i < NodeToMatch->getNumValues() &&
2915 NodeToMatch->getValueType(i) != MVT::Other &&
2916 NodeToMatch->getValueType(i) != MVT::Glue &&
2917 "Invalid number of results to complete!");
2918 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
2919 NodeToMatch->getValueType(i) == MVT::iPTR ||
2920 Res.getValueType() == MVT::iPTR ||
2921 NodeToMatch->getValueType(i).getSizeInBits() ==
2922 Res.getValueType().getSizeInBits()) &&
2923 "invalid replacement");
2924 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
2927 // If the root node defines glue, add it to the glue nodes to update list.
2928 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Glue)
2929 GlueResultNodesMatched.push_back(NodeToMatch);
2931 // Update chain and glue uses.
2932 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2933 InputGlue, GlueResultNodesMatched, false);
2935 assert(NodeToMatch->use_empty() &&
2936 "Didn't replace all uses of the node?");
2938 // FIXME: We just return here, which interacts correctly with SelectRoot
2939 // above. We should fix this to not return an SDNode* anymore.
2944 // If the code reached this point, then the match failed. See if there is
2945 // another child to try in the current 'Scope', otherwise pop it until we
2946 // find a case to check.
2947 DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
2948 DEBUG(++NumDAGIselRetries);
2950 if (MatchScopes.empty()) {
2951 CannotYetSelect(NodeToMatch);
2955 // Restore the interpreter state back to the point where the scope was
2957 MatchScope &LastScope = MatchScopes.back();
2958 RecordedNodes.resize(LastScope.NumRecordedNodes);
2960 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
2961 N = NodeStack.back();
2963 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
2964 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
2965 MatcherIndex = LastScope.FailIndex;
2967 DEBUG(errs() << " Continuing at " << MatcherIndex << "\n");
2969 InputChain = LastScope.InputChain;
2970 InputGlue = LastScope.InputGlue;
2971 if (!LastScope.HasChainNodesMatched)
2972 ChainNodesMatched.clear();
2973 if (!LastScope.HasGlueResultNodesMatched)
2974 GlueResultNodesMatched.clear();
2976 // Check to see what the offset is at the new MatcherIndex. If it is zero
2977 // we have reached the end of this scope, otherwise we have another child
2978 // in the current scope to try.
2979 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2980 if (NumToSkip & 128)
2981 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2983 // If we have another child in this scope to match, update FailIndex and
2985 if (NumToSkip != 0) {
2986 LastScope.FailIndex = MatcherIndex+NumToSkip;
2990 // End of this scope, pop it and try the next child in the containing
2992 MatchScopes.pop_back();
2999 void SelectionDAGISel::CannotYetSelect(SDNode *N) {
3001 raw_string_ostream Msg(msg);
3002 Msg << "Cannot select: ";
3004 if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
3005 N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
3006 N->getOpcode() != ISD::INTRINSIC_VOID) {
3007 N->printrFull(Msg, CurDAG);
3008 Msg << "\nIn function: " << MF->getName();
3010 bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
3012 cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
3013 if (iid < Intrinsic::num_intrinsics)
3014 Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
3015 else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
3016 Msg << "target intrinsic %" << TII->getName(iid);
3018 Msg << "unknown intrinsic #" << iid;
3020 report_fatal_error(Msg.str());
3023 char SelectionDAGISel::ID = 0;