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 #include "llvm/CodeGen/GCStrategy.h"
15 #include "ScheduleDAGSDNodes.h"
16 #include "SelectionDAGBuilder.h"
17 #include "llvm/ADT/PostOrderIterator.h"
18 #include "llvm/ADT/Statistic.h"
19 #include "llvm/Analysis/AliasAnalysis.h"
20 #include "llvm/Analysis/BranchProbabilityInfo.h"
21 #include "llvm/Analysis/CFG.h"
22 #include "llvm/Analysis/TargetLibraryInfo.h"
23 #include "llvm/CodeGen/Analysis.h"
24 #include "llvm/CodeGen/FastISel.h"
25 #include "llvm/CodeGen/FunctionLoweringInfo.h"
26 #include "llvm/CodeGen/GCMetadata.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/CodeGen/SelectionDAGISel.h"
36 #include "llvm/CodeGen/WinEHFuncInfo.h"
37 #include "llvm/IR/Constants.h"
38 #include "llvm/IR/DebugInfo.h"
39 #include "llvm/IR/Function.h"
40 #include "llvm/IR/InlineAsm.h"
41 #include "llvm/IR/Instructions.h"
42 #include "llvm/IR/IntrinsicInst.h"
43 #include "llvm/IR/Intrinsics.h"
44 #include "llvm/IR/LLVMContext.h"
45 #include "llvm/IR/Module.h"
46 #include "llvm/MC/MCAsmInfo.h"
47 #include "llvm/Support/Compiler.h"
48 #include "llvm/Support/Debug.h"
49 #include "llvm/Support/ErrorHandling.h"
50 #include "llvm/Support/Timer.h"
51 #include "llvm/Support/raw_ostream.h"
52 #include "llvm/Target/TargetInstrInfo.h"
53 #include "llvm/Target/TargetIntrinsicInfo.h"
54 #include "llvm/Target/TargetLowering.h"
55 #include "llvm/Target/TargetMachine.h"
56 #include "llvm/Target/TargetOptions.h"
57 #include "llvm/Target/TargetRegisterInfo.h"
58 #include "llvm/Target/TargetSubtargetInfo.h"
59 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
63 #define DEBUG_TYPE "isel"
65 STATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on");
66 STATISTIC(NumFastIselSuccess, "Number of instructions fast isel selected");
67 STATISTIC(NumFastIselBlocks, "Number of blocks selected entirely by fast isel");
68 STATISTIC(NumDAGBlocks, "Number of blocks selected using DAG");
69 STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
70 STATISTIC(NumEntryBlocks, "Number of entry blocks encountered");
71 STATISTIC(NumFastIselFailLowerArguments,
72 "Number of entry blocks where fast isel failed to lower arguments");
76 EnableFastISelVerbose2("fast-isel-verbose2", cl::Hidden,
77 cl::desc("Enable extra verbose messages in the \"fast\" "
78 "instruction selector"));
81 STATISTIC(NumFastIselFailRet,"Fast isel fails on Ret");
82 STATISTIC(NumFastIselFailBr,"Fast isel fails on Br");
83 STATISTIC(NumFastIselFailSwitch,"Fast isel fails on Switch");
84 STATISTIC(NumFastIselFailIndirectBr,"Fast isel fails on IndirectBr");
85 STATISTIC(NumFastIselFailInvoke,"Fast isel fails on Invoke");
86 STATISTIC(NumFastIselFailResume,"Fast isel fails on Resume");
87 STATISTIC(NumFastIselFailUnreachable,"Fast isel fails on Unreachable");
89 // Standard binary operators...
90 STATISTIC(NumFastIselFailAdd,"Fast isel fails on Add");
91 STATISTIC(NumFastIselFailFAdd,"Fast isel fails on FAdd");
92 STATISTIC(NumFastIselFailSub,"Fast isel fails on Sub");
93 STATISTIC(NumFastIselFailFSub,"Fast isel fails on FSub");
94 STATISTIC(NumFastIselFailMul,"Fast isel fails on Mul");
95 STATISTIC(NumFastIselFailFMul,"Fast isel fails on FMul");
96 STATISTIC(NumFastIselFailUDiv,"Fast isel fails on UDiv");
97 STATISTIC(NumFastIselFailSDiv,"Fast isel fails on SDiv");
98 STATISTIC(NumFastIselFailFDiv,"Fast isel fails on FDiv");
99 STATISTIC(NumFastIselFailURem,"Fast isel fails on URem");
100 STATISTIC(NumFastIselFailSRem,"Fast isel fails on SRem");
101 STATISTIC(NumFastIselFailFRem,"Fast isel fails on FRem");
103 // Logical operators...
104 STATISTIC(NumFastIselFailAnd,"Fast isel fails on And");
105 STATISTIC(NumFastIselFailOr,"Fast isel fails on Or");
106 STATISTIC(NumFastIselFailXor,"Fast isel fails on Xor");
108 // Memory instructions...
109 STATISTIC(NumFastIselFailAlloca,"Fast isel fails on Alloca");
110 STATISTIC(NumFastIselFailLoad,"Fast isel fails on Load");
111 STATISTIC(NumFastIselFailStore,"Fast isel fails on Store");
112 STATISTIC(NumFastIselFailAtomicCmpXchg,"Fast isel fails on AtomicCmpXchg");
113 STATISTIC(NumFastIselFailAtomicRMW,"Fast isel fails on AtomicRWM");
114 STATISTIC(NumFastIselFailFence,"Fast isel fails on Frence");
115 STATISTIC(NumFastIselFailGetElementPtr,"Fast isel fails on GetElementPtr");
117 // Convert instructions...
118 STATISTIC(NumFastIselFailTrunc,"Fast isel fails on Trunc");
119 STATISTIC(NumFastIselFailZExt,"Fast isel fails on ZExt");
120 STATISTIC(NumFastIselFailSExt,"Fast isel fails on SExt");
121 STATISTIC(NumFastIselFailFPTrunc,"Fast isel fails on FPTrunc");
122 STATISTIC(NumFastIselFailFPExt,"Fast isel fails on FPExt");
123 STATISTIC(NumFastIselFailFPToUI,"Fast isel fails on FPToUI");
124 STATISTIC(NumFastIselFailFPToSI,"Fast isel fails on FPToSI");
125 STATISTIC(NumFastIselFailUIToFP,"Fast isel fails on UIToFP");
126 STATISTIC(NumFastIselFailSIToFP,"Fast isel fails on SIToFP");
127 STATISTIC(NumFastIselFailIntToPtr,"Fast isel fails on IntToPtr");
128 STATISTIC(NumFastIselFailPtrToInt,"Fast isel fails on PtrToInt");
129 STATISTIC(NumFastIselFailBitCast,"Fast isel fails on BitCast");
131 // Other instructions...
132 STATISTIC(NumFastIselFailICmp,"Fast isel fails on ICmp");
133 STATISTIC(NumFastIselFailFCmp,"Fast isel fails on FCmp");
134 STATISTIC(NumFastIselFailPHI,"Fast isel fails on PHI");
135 STATISTIC(NumFastIselFailSelect,"Fast isel fails on Select");
136 STATISTIC(NumFastIselFailCall,"Fast isel fails on Call");
137 STATISTIC(NumFastIselFailShl,"Fast isel fails on Shl");
138 STATISTIC(NumFastIselFailLShr,"Fast isel fails on LShr");
139 STATISTIC(NumFastIselFailAShr,"Fast isel fails on AShr");
140 STATISTIC(NumFastIselFailVAArg,"Fast isel fails on VAArg");
141 STATISTIC(NumFastIselFailExtractElement,"Fast isel fails on ExtractElement");
142 STATISTIC(NumFastIselFailInsertElement,"Fast isel fails on InsertElement");
143 STATISTIC(NumFastIselFailShuffleVector,"Fast isel fails on ShuffleVector");
144 STATISTIC(NumFastIselFailExtractValue,"Fast isel fails on ExtractValue");
145 STATISTIC(NumFastIselFailInsertValue,"Fast isel fails on InsertValue");
146 STATISTIC(NumFastIselFailLandingPad,"Fast isel fails on LandingPad");
148 // Intrinsic instructions...
149 STATISTIC(NumFastIselFailIntrinsicCall, "Fast isel fails on Intrinsic call");
150 STATISTIC(NumFastIselFailSAddWithOverflow,
151 "Fast isel fails on sadd.with.overflow");
152 STATISTIC(NumFastIselFailUAddWithOverflow,
153 "Fast isel fails on uadd.with.overflow");
154 STATISTIC(NumFastIselFailSSubWithOverflow,
155 "Fast isel fails on ssub.with.overflow");
156 STATISTIC(NumFastIselFailUSubWithOverflow,
157 "Fast isel fails on usub.with.overflow");
158 STATISTIC(NumFastIselFailSMulWithOverflow,
159 "Fast isel fails on smul.with.overflow");
160 STATISTIC(NumFastIselFailUMulWithOverflow,
161 "Fast isel fails on umul.with.overflow");
162 STATISTIC(NumFastIselFailFrameaddress, "Fast isel fails on Frameaddress");
163 STATISTIC(NumFastIselFailSqrt, "Fast isel fails on sqrt call");
164 STATISTIC(NumFastIselFailStackMap, "Fast isel fails on StackMap call");
165 STATISTIC(NumFastIselFailPatchPoint, "Fast isel fails on PatchPoint call");
169 EnableFastISelVerbose("fast-isel-verbose", cl::Hidden,
170 cl::desc("Enable verbose messages in the \"fast\" "
171 "instruction selector"));
172 static cl::opt<int> EnableFastISelAbort(
173 "fast-isel-abort", cl::Hidden,
174 cl::desc("Enable abort calls when \"fast\" instruction selection "
175 "fails to lower an instruction: 0 disable the abort, 1 will "
176 "abort but for args, calls and terminators, 2 will also "
177 "abort for argument lowering, and 3 will never fallback "
178 "to SelectionDAG."));
182 cl::desc("use Machine Branch Probability Info"),
183 cl::init(true), cl::Hidden);
186 static cl::opt<std::string>
187 FilterDAGBasicBlockName("filter-view-dags", cl::Hidden,
188 cl::desc("Only display the basic block whose name "
189 "matches this for all view-*-dags options"));
191 ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
192 cl::desc("Pop up a window to show dags before the first "
193 "dag combine pass"));
195 ViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden,
196 cl::desc("Pop up a window to show dags before legalize types"));
198 ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
199 cl::desc("Pop up a window to show dags before legalize"));
201 ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
202 cl::desc("Pop up a window to show dags before the second "
203 "dag combine pass"));
205 ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
206 cl::desc("Pop up a window to show dags before the post legalize types"
207 " dag combine pass"));
209 ViewISelDAGs("view-isel-dags", cl::Hidden,
210 cl::desc("Pop up a window to show isel dags as they are selected"));
212 ViewSchedDAGs("view-sched-dags", cl::Hidden,
213 cl::desc("Pop up a window to show sched dags as they are processed"));
215 ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
216 cl::desc("Pop up a window to show SUnit dags after they are processed"));
218 static const bool ViewDAGCombine1 = false,
219 ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false,
220 ViewDAGCombine2 = false,
221 ViewDAGCombineLT = false,
222 ViewISelDAGs = false, ViewSchedDAGs = false,
223 ViewSUnitDAGs = false;
226 //===---------------------------------------------------------------------===//
228 /// RegisterScheduler class - Track the registration of instruction schedulers.
230 //===---------------------------------------------------------------------===//
231 MachinePassRegistry RegisterScheduler::Registry;
233 //===---------------------------------------------------------------------===//
235 /// ISHeuristic command line option for instruction schedulers.
237 //===---------------------------------------------------------------------===//
238 static cl::opt<RegisterScheduler::FunctionPassCtor, false,
239 RegisterPassParser<RegisterScheduler> >
240 ISHeuristic("pre-RA-sched",
241 cl::init(&createDefaultScheduler), cl::Hidden,
242 cl::desc("Instruction schedulers available (before register"
245 static RegisterScheduler
246 defaultListDAGScheduler("default", "Best scheduler for the target",
247 createDefaultScheduler);
250 //===--------------------------------------------------------------------===//
251 /// \brief This class is used by SelectionDAGISel to temporarily override
252 /// the optimization level on a per-function basis.
253 class OptLevelChanger {
254 SelectionDAGISel &IS;
255 CodeGenOpt::Level SavedOptLevel;
259 OptLevelChanger(SelectionDAGISel &ISel,
260 CodeGenOpt::Level NewOptLevel) : IS(ISel) {
261 SavedOptLevel = IS.OptLevel;
262 if (NewOptLevel == SavedOptLevel)
264 IS.OptLevel = NewOptLevel;
265 IS.TM.setOptLevel(NewOptLevel);
266 SavedFastISel = IS.TM.Options.EnableFastISel;
267 if (NewOptLevel == CodeGenOpt::None)
268 IS.TM.setFastISel(true);
269 DEBUG(dbgs() << "\nChanging optimization level for Function "
270 << IS.MF->getFunction()->getName() << "\n");
271 DEBUG(dbgs() << "\tBefore: -O" << SavedOptLevel
272 << " ; After: -O" << NewOptLevel << "\n");
276 if (IS.OptLevel == SavedOptLevel)
278 DEBUG(dbgs() << "\nRestoring optimization level for Function "
279 << IS.MF->getFunction()->getName() << "\n");
280 DEBUG(dbgs() << "\tBefore: -O" << IS.OptLevel
281 << " ; After: -O" << SavedOptLevel << "\n");
282 IS.OptLevel = SavedOptLevel;
283 IS.TM.setOptLevel(SavedOptLevel);
284 IS.TM.setFastISel(SavedFastISel);
288 //===--------------------------------------------------------------------===//
289 /// createDefaultScheduler - This creates an instruction scheduler appropriate
291 ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS,
292 CodeGenOpt::Level OptLevel) {
293 const TargetLowering *TLI = IS->TLI;
294 const TargetSubtargetInfo &ST = IS->MF->getSubtarget();
296 if (OptLevel == CodeGenOpt::None ||
297 (ST.enableMachineScheduler() && ST.enableMachineSchedDefaultSched()) ||
298 TLI->getSchedulingPreference() == Sched::Source)
299 return createSourceListDAGScheduler(IS, OptLevel);
300 if (TLI->getSchedulingPreference() == Sched::RegPressure)
301 return createBURRListDAGScheduler(IS, OptLevel);
302 if (TLI->getSchedulingPreference() == Sched::Hybrid)
303 return createHybridListDAGScheduler(IS, OptLevel);
304 if (TLI->getSchedulingPreference() == Sched::VLIW)
305 return createVLIWDAGScheduler(IS, OptLevel);
306 assert(TLI->getSchedulingPreference() == Sched::ILP &&
307 "Unknown sched type!");
308 return createILPListDAGScheduler(IS, OptLevel);
312 // EmitInstrWithCustomInserter - This method should be implemented by targets
313 // that mark instructions with the 'usesCustomInserter' flag. These
314 // instructions are special in various ways, which require special support to
315 // insert. The specified MachineInstr is created but not inserted into any
316 // basic blocks, and this method is called to expand it into a sequence of
317 // instructions, potentially also creating new basic blocks and control flow.
318 // When new basic blocks are inserted and the edges from MBB to its successors
319 // are modified, the method should insert pairs of <OldSucc, NewSucc> into the
322 TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
323 MachineBasicBlock *MBB) const {
325 dbgs() << "If a target marks an instruction with "
326 "'usesCustomInserter', it must implement "
327 "TargetLowering::EmitInstrWithCustomInserter!";
329 llvm_unreachable(nullptr);
332 void TargetLowering::AdjustInstrPostInstrSelection(MachineInstr *MI,
333 SDNode *Node) const {
334 assert(!MI->hasPostISelHook() &&
335 "If a target marks an instruction with 'hasPostISelHook', "
336 "it must implement TargetLowering::AdjustInstrPostInstrSelection!");
339 //===----------------------------------------------------------------------===//
340 // SelectionDAGISel code
341 //===----------------------------------------------------------------------===//
343 SelectionDAGISel::SelectionDAGISel(TargetMachine &tm,
344 CodeGenOpt::Level OL) :
345 MachineFunctionPass(ID), TM(tm),
346 FuncInfo(new FunctionLoweringInfo()),
347 CurDAG(new SelectionDAG(tm, OL)),
348 SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
352 initializeGCModuleInfoPass(*PassRegistry::getPassRegistry());
353 initializeAliasAnalysisAnalysisGroup(*PassRegistry::getPassRegistry());
354 initializeBranchProbabilityInfoPass(*PassRegistry::getPassRegistry());
355 initializeTargetLibraryInfoWrapperPassPass(
356 *PassRegistry::getPassRegistry());
359 SelectionDAGISel::~SelectionDAGISel() {
365 void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
366 AU.addRequired<AliasAnalysis>();
367 AU.addPreserved<AliasAnalysis>();
368 AU.addRequired<GCModuleInfo>();
369 AU.addPreserved<GCModuleInfo>();
370 AU.addRequired<TargetLibraryInfoWrapperPass>();
371 if (UseMBPI && OptLevel != CodeGenOpt::None)
372 AU.addRequired<BranchProbabilityInfo>();
373 MachineFunctionPass::getAnalysisUsage(AU);
376 /// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
377 /// may trap on it. In this case we have to split the edge so that the path
378 /// through the predecessor block that doesn't go to the phi block doesn't
379 /// execute the possibly trapping instruction.
381 /// This is required for correctness, so it must be done at -O0.
383 static void SplitCriticalSideEffectEdges(Function &Fn, AliasAnalysis *AA) {
384 // Loop for blocks with phi nodes.
385 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
386 PHINode *PN = dyn_cast<PHINode>(BB->begin());
390 // For each block with a PHI node, check to see if any of the input values
391 // are potentially trapping constant expressions. Constant expressions are
392 // the only potentially trapping value that can occur as the argument to a
394 for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I)
395 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
396 ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i));
397 if (!CE || !CE->canTrap()) continue;
399 // The only case we have to worry about is when the edge is critical.
400 // Since this block has a PHI Node, we assume it has multiple input
401 // edges: check to see if the pred has multiple successors.
402 BasicBlock *Pred = PN->getIncomingBlock(i);
403 if (Pred->getTerminator()->getNumSuccessors() == 1)
406 // Okay, we have to split this edge.
408 Pred->getTerminator(), GetSuccessorNumber(Pred, BB),
409 CriticalEdgeSplittingOptions(AA).setMergeIdenticalEdges());
415 bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
416 // Do some sanity-checking on the command-line options.
417 assert((!EnableFastISelVerbose || TM.Options.EnableFastISel) &&
418 "-fast-isel-verbose requires -fast-isel");
419 assert((!EnableFastISelAbort || TM.Options.EnableFastISel) &&
420 "-fast-isel-abort > 0 requires -fast-isel");
422 const Function &Fn = *mf.getFunction();
425 // Reset the target options before resetting the optimization
427 // FIXME: This is a horrible hack and should be processed via
428 // codegen looking at the optimization level explicitly when
429 // it wants to look at it.
430 TM.resetTargetOptions(Fn);
431 // Reset OptLevel to None for optnone functions.
432 CodeGenOpt::Level NewOptLevel = OptLevel;
433 if (Fn.hasFnAttribute(Attribute::OptimizeNone))
434 NewOptLevel = CodeGenOpt::None;
435 OptLevelChanger OLC(*this, NewOptLevel);
437 TII = MF->getSubtarget().getInstrInfo();
438 TLI = MF->getSubtarget().getTargetLowering();
439 RegInfo = &MF->getRegInfo();
440 AA = &getAnalysis<AliasAnalysis>();
441 LibInfo = &getAnalysis<TargetLibraryInfoWrapperPass>().getTLI();
442 GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : nullptr;
444 DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
446 SplitCriticalSideEffectEdges(const_cast<Function&>(Fn), AA);
449 FuncInfo->set(Fn, *MF, CurDAG);
451 if (UseMBPI && OptLevel != CodeGenOpt::None)
452 FuncInfo->BPI = &getAnalysis<BranchProbabilityInfo>();
454 FuncInfo->BPI = nullptr;
456 SDB->init(GFI, *AA, LibInfo);
458 MF->setHasInlineAsm(false);
460 SelectAllBasicBlocks(Fn);
462 // If the first basic block in the function has live ins that need to be
463 // copied into vregs, emit the copies into the top of the block before
464 // emitting the code for the block.
465 MachineBasicBlock *EntryMBB = MF->begin();
466 const TargetRegisterInfo &TRI = *MF->getSubtarget().getRegisterInfo();
467 RegInfo->EmitLiveInCopies(EntryMBB, TRI, *TII);
469 DenseMap<unsigned, unsigned> LiveInMap;
470 if (!FuncInfo->ArgDbgValues.empty())
471 for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(),
472 E = RegInfo->livein_end(); LI != E; ++LI)
474 LiveInMap.insert(std::make_pair(LI->first, LI->second));
476 // Insert DBG_VALUE instructions for function arguments to the entry block.
477 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
478 MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
479 bool hasFI = MI->getOperand(0).isFI();
481 hasFI ? TRI.getFrameRegister(*MF) : MI->getOperand(0).getReg();
482 if (TargetRegisterInfo::isPhysicalRegister(Reg))
483 EntryMBB->insert(EntryMBB->begin(), MI);
485 MachineInstr *Def = RegInfo->getVRegDef(Reg);
487 MachineBasicBlock::iterator InsertPos = Def;
488 // FIXME: VR def may not be in entry block.
489 Def->getParent()->insert(std::next(InsertPos), MI);
491 DEBUG(dbgs() << "Dropping debug info for dead vreg"
492 << TargetRegisterInfo::virtReg2Index(Reg) << "\n");
495 // If Reg is live-in then update debug info to track its copy in a vreg.
496 DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg);
497 if (LDI != LiveInMap.end()) {
498 assert(!hasFI && "There's no handling of frame pointer updating here yet "
500 MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
501 MachineBasicBlock::iterator InsertPos = Def;
502 const MDNode *Variable = MI->getDebugVariable();
503 const MDNode *Expr = MI->getDebugExpression();
504 DebugLoc DL = MI->getDebugLoc();
505 bool IsIndirect = MI->isIndirectDebugValue();
506 unsigned Offset = IsIndirect ? MI->getOperand(1).getImm() : 0;
507 assert(cast<MDLocalVariable>(Variable)->isValidLocationForIntrinsic(DL) &&
508 "Expected inlined-at fields to agree");
509 // Def is never a terminator here, so it is ok to increment InsertPos.
510 BuildMI(*EntryMBB, ++InsertPos, DL, TII->get(TargetOpcode::DBG_VALUE),
511 IsIndirect, LDI->second, Offset, Variable, Expr);
513 // If this vreg is directly copied into an exported register then
514 // that COPY instructions also need DBG_VALUE, if it is the only
515 // user of LDI->second.
516 MachineInstr *CopyUseMI = nullptr;
517 for (MachineRegisterInfo::use_instr_iterator
518 UI = RegInfo->use_instr_begin(LDI->second),
519 E = RegInfo->use_instr_end(); UI != E; ) {
520 MachineInstr *UseMI = &*(UI++);
521 if (UseMI->isDebugValue()) continue;
522 if (UseMI->isCopy() && !CopyUseMI && UseMI->getParent() == EntryMBB) {
523 CopyUseMI = UseMI; continue;
525 // Otherwise this is another use or second copy use.
526 CopyUseMI = nullptr; break;
529 // Use MI's debug location, which describes where Variable was
530 // declared, rather than whatever is attached to CopyUseMI.
531 MachineInstr *NewMI =
532 BuildMI(*MF, DL, TII->get(TargetOpcode::DBG_VALUE), IsIndirect,
533 CopyUseMI->getOperand(0).getReg(), Offset, Variable, Expr);
534 MachineBasicBlock::iterator Pos = CopyUseMI;
535 EntryMBB->insertAfter(Pos, NewMI);
540 // Determine if there are any calls in this machine function.
541 MachineFrameInfo *MFI = MF->getFrameInfo();
542 for (const auto &MBB : *MF) {
543 if (MFI->hasCalls() && MF->hasInlineAsm())
546 for (const auto &MI : MBB) {
547 const MCInstrDesc &MCID = TII->get(MI.getOpcode());
548 if ((MCID.isCall() && !MCID.isReturn()) ||
549 MI.isStackAligningInlineAsm()) {
550 MFI->setHasCalls(true);
552 if (MI.isInlineAsm()) {
553 MF->setHasInlineAsm(true);
558 // Determine if there is a call to setjmp in the machine function.
559 MF->setExposesReturnsTwice(Fn.callsFunctionThatReturnsTwice());
561 // Replace forward-declared registers with the registers containing
562 // the desired value.
563 MachineRegisterInfo &MRI = MF->getRegInfo();
564 for (DenseMap<unsigned, unsigned>::iterator
565 I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end();
567 unsigned From = I->first;
568 unsigned To = I->second;
569 // If To is also scheduled to be replaced, find what its ultimate
572 DenseMap<unsigned, unsigned>::iterator J = FuncInfo->RegFixups.find(To);
576 // Make sure the new register has a sufficiently constrained register class.
577 if (TargetRegisterInfo::isVirtualRegister(From) &&
578 TargetRegisterInfo::isVirtualRegister(To))
579 MRI.constrainRegClass(To, MRI.getRegClass(From));
581 MRI.replaceRegWith(From, To);
584 // Freeze the set of reserved registers now that MachineFrameInfo has been
585 // set up. All the information required by getReservedRegs() should be
587 MRI.freezeReservedRegs(*MF);
589 // Release function-specific state. SDB and CurDAG are already cleared
593 DEBUG(dbgs() << "*** MachineFunction at end of ISel ***\n");
594 DEBUG(MF->print(dbgs()));
599 void SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin,
600 BasicBlock::const_iterator End,
602 // Lower the instructions. If a call is emitted as a tail call, cease emitting
603 // nodes for this block.
604 for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
607 // Make sure the root of the DAG is up-to-date.
608 CurDAG->setRoot(SDB->getControlRoot());
609 HadTailCall = SDB->HasTailCall;
612 // Final step, emit the lowered DAG as machine code.
616 void SelectionDAGISel::ComputeLiveOutVRegInfo() {
617 SmallPtrSet<SDNode*, 128> VisitedNodes;
618 SmallVector<SDNode*, 128> Worklist;
620 Worklist.push_back(CurDAG->getRoot().getNode());
626 SDNode *N = Worklist.pop_back_val();
628 // If we've already seen this node, ignore it.
629 if (!VisitedNodes.insert(N).second)
632 // Otherwise, add all chain operands to the worklist.
633 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
634 if (N->getOperand(i).getValueType() == MVT::Other)
635 Worklist.push_back(N->getOperand(i).getNode());
637 // If this is a CopyToReg with a vreg dest, process it.
638 if (N->getOpcode() != ISD::CopyToReg)
641 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
642 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
645 // Ignore non-scalar or non-integer values.
646 SDValue Src = N->getOperand(2);
647 EVT SrcVT = Src.getValueType();
648 if (!SrcVT.isInteger() || SrcVT.isVector())
651 unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
652 CurDAG->computeKnownBits(Src, KnownZero, KnownOne);
653 FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne);
654 } while (!Worklist.empty());
657 void SelectionDAGISel::CodeGenAndEmitDAG() {
658 std::string GroupName;
659 if (TimePassesIsEnabled)
660 GroupName = "Instruction Selection and Scheduling";
661 std::string BlockName;
662 int BlockNumber = -1;
664 bool MatchFilterBB = false; (void)MatchFilterBB;
666 MatchFilterBB = (FilterDAGBasicBlockName.empty() ||
667 FilterDAGBasicBlockName ==
668 FuncInfo->MBB->getBasicBlock()->getName().str());
671 if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
672 ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
676 BlockNumber = FuncInfo->MBB->getNumber();
678 (MF->getName() + ":" + FuncInfo->MBB->getBasicBlock()->getName()).str();
680 DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber
681 << " '" << BlockName << "'\n"; CurDAG->dump());
683 if (ViewDAGCombine1 && MatchFilterBB)
684 CurDAG->viewGraph("dag-combine1 input for " + BlockName);
686 // Run the DAG combiner in pre-legalize mode.
688 NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled);
689 CurDAG->Combine(BeforeLegalizeTypes, *AA, OptLevel);
692 DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber
693 << " '" << BlockName << "'\n"; CurDAG->dump());
695 // Second step, hack on the DAG until it only uses operations and types that
696 // the target supports.
697 if (ViewLegalizeTypesDAGs && MatchFilterBB)
698 CurDAG->viewGraph("legalize-types input for " + BlockName);
702 NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled);
703 Changed = CurDAG->LegalizeTypes();
706 DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber
707 << " '" << BlockName << "'\n"; CurDAG->dump());
709 CurDAG->NewNodesMustHaveLegalTypes = true;
712 if (ViewDAGCombineLT && MatchFilterBB)
713 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
715 // Run the DAG combiner in post-type-legalize mode.
717 NamedRegionTimer T("DAG Combining after legalize types", GroupName,
718 TimePassesIsEnabled);
719 CurDAG->Combine(AfterLegalizeTypes, *AA, OptLevel);
722 DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumber
723 << " '" << BlockName << "'\n"; CurDAG->dump());
728 NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled);
729 Changed = CurDAG->LegalizeVectors();
734 NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled);
735 CurDAG->LegalizeTypes();
738 if (ViewDAGCombineLT && MatchFilterBB)
739 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
741 // Run the DAG combiner in post-type-legalize mode.
743 NamedRegionTimer T("DAG Combining after legalize vectors", GroupName,
744 TimePassesIsEnabled);
745 CurDAG->Combine(AfterLegalizeVectorOps, *AA, OptLevel);
748 DEBUG(dbgs() << "Optimized vector-legalized selection DAG: BB#"
749 << BlockNumber << " '" << BlockName << "'\n"; CurDAG->dump());
752 if (ViewLegalizeDAGs && MatchFilterBB)
753 CurDAG->viewGraph("legalize input for " + BlockName);
756 NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled);
760 DEBUG(dbgs() << "Legalized selection DAG: BB#" << BlockNumber
761 << " '" << BlockName << "'\n"; CurDAG->dump());
763 if (ViewDAGCombine2 && MatchFilterBB)
764 CurDAG->viewGraph("dag-combine2 input for " + BlockName);
766 // Run the DAG combiner in post-legalize mode.
768 NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled);
769 CurDAG->Combine(AfterLegalizeDAG, *AA, OptLevel);
772 DEBUG(dbgs() << "Optimized legalized selection DAG: BB#" << BlockNumber
773 << " '" << BlockName << "'\n"; CurDAG->dump());
775 if (OptLevel != CodeGenOpt::None)
776 ComputeLiveOutVRegInfo();
778 if (ViewISelDAGs && MatchFilterBB)
779 CurDAG->viewGraph("isel input for " + BlockName);
781 // Third, instruction select all of the operations to machine code, adding the
782 // code to the MachineBasicBlock.
784 NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled);
785 DoInstructionSelection();
788 DEBUG(dbgs() << "Selected selection DAG: BB#" << BlockNumber
789 << " '" << BlockName << "'\n"; CurDAG->dump());
791 if (ViewSchedDAGs && MatchFilterBB)
792 CurDAG->viewGraph("scheduler input for " + BlockName);
794 // Schedule machine code.
795 ScheduleDAGSDNodes *Scheduler = CreateScheduler();
797 NamedRegionTimer T("Instruction Scheduling", GroupName,
798 TimePassesIsEnabled);
799 Scheduler->Run(CurDAG, FuncInfo->MBB);
802 if (ViewSUnitDAGs && MatchFilterBB) Scheduler->viewGraph();
804 // Emit machine code to BB. This can change 'BB' to the last block being
806 MachineBasicBlock *FirstMBB = FuncInfo->MBB, *LastMBB;
808 NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled);
810 // FuncInfo->InsertPt is passed by reference and set to the end of the
811 // scheduled instructions.
812 LastMBB = FuncInfo->MBB = Scheduler->EmitSchedule(FuncInfo->InsertPt);
815 // If the block was split, make sure we update any references that are used to
816 // update PHI nodes later on.
817 if (FirstMBB != LastMBB)
818 SDB->UpdateSplitBlock(FirstMBB, LastMBB);
820 // Free the scheduler state.
822 NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName,
823 TimePassesIsEnabled);
827 // Free the SelectionDAG state, now that we're finished with it.
832 /// ISelUpdater - helper class to handle updates of the instruction selection
834 class ISelUpdater : public SelectionDAG::DAGUpdateListener {
835 SelectionDAG::allnodes_iterator &ISelPosition;
837 ISelUpdater(SelectionDAG &DAG, SelectionDAG::allnodes_iterator &isp)
838 : SelectionDAG::DAGUpdateListener(DAG), ISelPosition(isp) {}
840 /// NodeDeleted - Handle nodes deleted from the graph. If the node being
841 /// deleted is the current ISelPosition node, update ISelPosition.
843 void NodeDeleted(SDNode *N, SDNode *E) override {
844 if (ISelPosition == SelectionDAG::allnodes_iterator(N))
848 } // end anonymous namespace
850 void SelectionDAGISel::DoInstructionSelection() {
851 DEBUG(dbgs() << "===== Instruction selection begins: BB#"
852 << FuncInfo->MBB->getNumber()
853 << " '" << FuncInfo->MBB->getName() << "'\n");
857 // Select target instructions for the DAG.
859 // Number all nodes with a topological order and set DAGSize.
860 DAGSize = CurDAG->AssignTopologicalOrder();
862 // Create a dummy node (which is not added to allnodes), that adds
863 // a reference to the root node, preventing it from being deleted,
864 // and tracking any changes of the root.
865 HandleSDNode Dummy(CurDAG->getRoot());
866 SelectionDAG::allnodes_iterator ISelPosition (CurDAG->getRoot().getNode());
869 // Make sure that ISelPosition gets properly updated when nodes are deleted
870 // in calls made from this function.
871 ISelUpdater ISU(*CurDAG, ISelPosition);
873 // The AllNodes list is now topological-sorted. Visit the
874 // nodes by starting at the end of the list (the root of the
875 // graph) and preceding back toward the beginning (the entry
877 while (ISelPosition != CurDAG->allnodes_begin()) {
878 SDNode *Node = --ISelPosition;
879 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
880 // but there are currently some corner cases that it misses. Also, this
881 // makes it theoretically possible to disable the DAGCombiner.
882 if (Node->use_empty())
885 SDNode *ResNode = Select(Node);
887 // FIXME: This is pretty gross. 'Select' should be changed to not return
888 // anything at all and this code should be nuked with a tactical strike.
890 // If node should not be replaced, continue with the next one.
891 if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
895 ReplaceUses(Node, ResNode);
898 // If after the replacement this node is not used any more,
899 // remove this dead node.
900 if (Node->use_empty()) // Don't delete EntryToken, etc.
901 CurDAG->RemoveDeadNode(Node);
904 CurDAG->setRoot(Dummy.getValue());
907 DEBUG(dbgs() << "===== Instruction selection ends:\n");
909 PostprocessISelDAG();
912 /// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
913 /// do other setup for EH landing-pad blocks.
914 bool SelectionDAGISel::PrepareEHLandingPad() {
915 MachineBasicBlock *MBB = FuncInfo->MBB;
917 const TargetRegisterClass *PtrRC = TLI->getRegClassFor(TLI->getPointerTy());
919 // Add a label to mark the beginning of the landing pad. Deletion of the
920 // landing pad can thus be detected via the MachineModuleInfo.
921 MCSymbol *Label = MF->getMMI().addLandingPad(MBB);
923 // Assign the call site to the landing pad's begin label.
924 MF->getMMI().setCallSiteLandingPad(Label, SDB->LPadToCallSiteMap[MBB]);
926 const MCInstrDesc &II = TII->get(TargetOpcode::EH_LABEL);
927 BuildMI(*MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II)
930 // If this is an MSVC-style personality function, we need to split the landing
931 // pad into several BBs.
932 const BasicBlock *LLVMBB = MBB->getBasicBlock();
933 const LandingPadInst *LPadInst = LLVMBB->getLandingPadInst();
934 MF->getMMI().addPersonality(
935 MBB, cast<Function>(LPadInst->getPersonalityFn()->stripPointerCasts()));
936 EHPersonality Personality = MF->getMMI().getPersonalityType();
938 if (isMSVCEHPersonality(Personality)) {
939 SmallVector<MachineBasicBlock *, 4> ClauseBBs;
940 const IntrinsicInst *ActionsCall =
941 dyn_cast<IntrinsicInst>(LLVMBB->getFirstInsertionPt());
942 // Get all invoke BBs that unwind to this landingpad.
943 SmallVector<MachineBasicBlock *, 4> InvokeBBs(MBB->pred_begin(),
945 if (!ActionsCall || ActionsCall->getIntrinsicID() != Intrinsic::eh_actions) {
946 assert(isa<UnreachableInst>(LLVMBB->getFirstInsertionPt()) &&
947 "found landingpad without unreachable or llvm.eh.actions");
951 // If this is a call to llvm.eh.actions followed by indirectbr, then we've
952 // run WinEHPrepare, and we should remove this block from the machine CFG.
953 // Mark the targets of the indirectbr as landingpads instead.
954 for (const BasicBlock *LLVMSucc : successors(LLVMBB)) {
955 MachineBasicBlock *ClauseBB = FuncInfo->MBBMap[LLVMSucc];
956 // Add the edge from the invoke to the clause.
957 for (MachineBasicBlock *InvokeBB : InvokeBBs)
958 InvokeBB->addSuccessor(ClauseBB);
960 // Mark the clause as a landing pad or MI passes will delete it.
961 ClauseBB->setIsLandingPad();
964 // Remove the edge from the invoke to the lpad.
965 for (MachineBasicBlock *InvokeBB : InvokeBBs)
966 InvokeBB->removeSuccessor(MBB);
968 // Restore FuncInfo back to its previous state and select the main landing
971 FuncInfo->InsertPt = MBB->end();
973 // Transfer EH state number assigned to the IR block to the MBB.
974 if (Personality == EHPersonality::MSVC_CXX) {
975 WinEHFuncInfo &FI = MF->getMMI().getWinEHFuncInfo(MF->getFunction());
976 MF->getMMI().addWinEHState(MBB, FI.LandingPadStateMap[LPadInst]);
979 // Don't select instructions for landing pads using llvm.eh.actions.
983 // Mark exception register as live in.
984 if (unsigned Reg = TLI->getExceptionPointerRegister())
985 FuncInfo->ExceptionPointerVirtReg = MBB->addLiveIn(Reg, PtrRC);
987 // Mark exception selector register as live in.
988 if (unsigned Reg = TLI->getExceptionSelectorRegister())
989 FuncInfo->ExceptionSelectorVirtReg = MBB->addLiveIn(Reg, PtrRC);
994 /// isFoldedOrDeadInstruction - Return true if the specified instruction is
995 /// side-effect free and is either dead or folded into a generated instruction.
996 /// Return false if it needs to be emitted.
997 static bool isFoldedOrDeadInstruction(const Instruction *I,
998 FunctionLoweringInfo *FuncInfo) {
999 return !I->mayWriteToMemory() && // Side-effecting instructions aren't folded.
1000 !isa<TerminatorInst>(I) && // Terminators aren't folded.
1001 !isa<DbgInfoIntrinsic>(I) && // Debug instructions aren't folded.
1002 !isa<LandingPadInst>(I) && // Landingpad instructions aren't folded.
1003 !FuncInfo->isExportedInst(I); // Exported instrs must be computed.
1007 // Collect per Instruction statistics for fast-isel misses. Only those
1008 // instructions that cause the bail are accounted for. It does not account for
1009 // instructions higher in the block. Thus, summing the per instructions stats
1010 // will not add up to what is reported by NumFastIselFailures.
1011 static void collectFailStats(const Instruction *I) {
1012 switch (I->getOpcode()) {
1013 default: assert (0 && "<Invalid operator> ");
1016 case Instruction::Ret: NumFastIselFailRet++; return;
1017 case Instruction::Br: NumFastIselFailBr++; return;
1018 case Instruction::Switch: NumFastIselFailSwitch++; return;
1019 case Instruction::IndirectBr: NumFastIselFailIndirectBr++; return;
1020 case Instruction::Invoke: NumFastIselFailInvoke++; return;
1021 case Instruction::Resume: NumFastIselFailResume++; return;
1022 case Instruction::Unreachable: NumFastIselFailUnreachable++; return;
1024 // Standard binary operators...
1025 case Instruction::Add: NumFastIselFailAdd++; return;
1026 case Instruction::FAdd: NumFastIselFailFAdd++; return;
1027 case Instruction::Sub: NumFastIselFailSub++; return;
1028 case Instruction::FSub: NumFastIselFailFSub++; return;
1029 case Instruction::Mul: NumFastIselFailMul++; return;
1030 case Instruction::FMul: NumFastIselFailFMul++; return;
1031 case Instruction::UDiv: NumFastIselFailUDiv++; return;
1032 case Instruction::SDiv: NumFastIselFailSDiv++; return;
1033 case Instruction::FDiv: NumFastIselFailFDiv++; return;
1034 case Instruction::URem: NumFastIselFailURem++; return;
1035 case Instruction::SRem: NumFastIselFailSRem++; return;
1036 case Instruction::FRem: NumFastIselFailFRem++; return;
1038 // Logical operators...
1039 case Instruction::And: NumFastIselFailAnd++; return;
1040 case Instruction::Or: NumFastIselFailOr++; return;
1041 case Instruction::Xor: NumFastIselFailXor++; return;
1043 // Memory instructions...
1044 case Instruction::Alloca: NumFastIselFailAlloca++; return;
1045 case Instruction::Load: NumFastIselFailLoad++; return;
1046 case Instruction::Store: NumFastIselFailStore++; return;
1047 case Instruction::AtomicCmpXchg: NumFastIselFailAtomicCmpXchg++; return;
1048 case Instruction::AtomicRMW: NumFastIselFailAtomicRMW++; return;
1049 case Instruction::Fence: NumFastIselFailFence++; return;
1050 case Instruction::GetElementPtr: NumFastIselFailGetElementPtr++; return;
1052 // Convert instructions...
1053 case Instruction::Trunc: NumFastIselFailTrunc++; return;
1054 case Instruction::ZExt: NumFastIselFailZExt++; return;
1055 case Instruction::SExt: NumFastIselFailSExt++; return;
1056 case Instruction::FPTrunc: NumFastIselFailFPTrunc++; return;
1057 case Instruction::FPExt: NumFastIselFailFPExt++; return;
1058 case Instruction::FPToUI: NumFastIselFailFPToUI++; return;
1059 case Instruction::FPToSI: NumFastIselFailFPToSI++; return;
1060 case Instruction::UIToFP: NumFastIselFailUIToFP++; return;
1061 case Instruction::SIToFP: NumFastIselFailSIToFP++; return;
1062 case Instruction::IntToPtr: NumFastIselFailIntToPtr++; return;
1063 case Instruction::PtrToInt: NumFastIselFailPtrToInt++; return;
1064 case Instruction::BitCast: NumFastIselFailBitCast++; return;
1066 // Other instructions...
1067 case Instruction::ICmp: NumFastIselFailICmp++; return;
1068 case Instruction::FCmp: NumFastIselFailFCmp++; return;
1069 case Instruction::PHI: NumFastIselFailPHI++; return;
1070 case Instruction::Select: NumFastIselFailSelect++; return;
1071 case Instruction::Call: {
1072 if (auto const *Intrinsic = dyn_cast<IntrinsicInst>(I)) {
1073 switch (Intrinsic->getIntrinsicID()) {
1075 NumFastIselFailIntrinsicCall++; return;
1076 case Intrinsic::sadd_with_overflow:
1077 NumFastIselFailSAddWithOverflow++; return;
1078 case Intrinsic::uadd_with_overflow:
1079 NumFastIselFailUAddWithOverflow++; return;
1080 case Intrinsic::ssub_with_overflow:
1081 NumFastIselFailSSubWithOverflow++; return;
1082 case Intrinsic::usub_with_overflow:
1083 NumFastIselFailUSubWithOverflow++; return;
1084 case Intrinsic::smul_with_overflow:
1085 NumFastIselFailSMulWithOverflow++; return;
1086 case Intrinsic::umul_with_overflow:
1087 NumFastIselFailUMulWithOverflow++; return;
1088 case Intrinsic::frameaddress:
1089 NumFastIselFailFrameaddress++; return;
1090 case Intrinsic::sqrt:
1091 NumFastIselFailSqrt++; return;
1092 case Intrinsic::experimental_stackmap:
1093 NumFastIselFailStackMap++; return;
1094 case Intrinsic::experimental_patchpoint_void: // fall-through
1095 case Intrinsic::experimental_patchpoint_i64:
1096 NumFastIselFailPatchPoint++; return;
1099 NumFastIselFailCall++;
1102 case Instruction::Shl: NumFastIselFailShl++; return;
1103 case Instruction::LShr: NumFastIselFailLShr++; return;
1104 case Instruction::AShr: NumFastIselFailAShr++; return;
1105 case Instruction::VAArg: NumFastIselFailVAArg++; return;
1106 case Instruction::ExtractElement: NumFastIselFailExtractElement++; return;
1107 case Instruction::InsertElement: NumFastIselFailInsertElement++; return;
1108 case Instruction::ShuffleVector: NumFastIselFailShuffleVector++; return;
1109 case Instruction::ExtractValue: NumFastIselFailExtractValue++; return;
1110 case Instruction::InsertValue: NumFastIselFailInsertValue++; return;
1111 case Instruction::LandingPad: NumFastIselFailLandingPad++; return;
1116 void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
1117 // Initialize the Fast-ISel state, if needed.
1118 FastISel *FastIS = nullptr;
1119 if (TM.Options.EnableFastISel)
1120 FastIS = TLI->createFastISel(*FuncInfo, LibInfo);
1122 // Iterate over all basic blocks in the function.
1123 ReversePostOrderTraversal<const Function*> RPOT(&Fn);
1124 for (ReversePostOrderTraversal<const Function*>::rpo_iterator
1125 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
1126 const BasicBlock *LLVMBB = *I;
1128 if (OptLevel != CodeGenOpt::None) {
1129 bool AllPredsVisited = true;
1130 for (const_pred_iterator PI = pred_begin(LLVMBB), PE = pred_end(LLVMBB);
1132 if (!FuncInfo->VisitedBBs.count(*PI)) {
1133 AllPredsVisited = false;
1138 if (AllPredsVisited) {
1139 for (BasicBlock::const_iterator I = LLVMBB->begin();
1140 const PHINode *PN = dyn_cast<PHINode>(I); ++I)
1141 FuncInfo->ComputePHILiveOutRegInfo(PN);
1143 for (BasicBlock::const_iterator I = LLVMBB->begin();
1144 const PHINode *PN = dyn_cast<PHINode>(I); ++I)
1145 FuncInfo->InvalidatePHILiveOutRegInfo(PN);
1148 FuncInfo->VisitedBBs.insert(LLVMBB);
1151 BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
1152 BasicBlock::const_iterator const End = LLVMBB->end();
1153 BasicBlock::const_iterator BI = End;
1155 FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB];
1156 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
1158 // Setup an EH landing-pad block.
1159 FuncInfo->ExceptionPointerVirtReg = 0;
1160 FuncInfo->ExceptionSelectorVirtReg = 0;
1161 if (LLVMBB->isLandingPad())
1162 if (!PrepareEHLandingPad())
1165 // Before doing SelectionDAG ISel, see if FastISel has been requested.
1167 FastIS->startNewBlock();
1169 // Emit code for any incoming arguments. This must happen before
1170 // beginning FastISel on the entry block.
1171 if (LLVMBB == &Fn.getEntryBlock()) {
1174 // Lower any arguments needed in this block if this is the entry block.
1175 if (!FastIS->lowerArguments()) {
1176 // Fast isel failed to lower these arguments
1177 ++NumFastIselFailLowerArguments;
1178 if (EnableFastISelAbort > 1)
1179 report_fatal_error("FastISel didn't lower all arguments");
1181 // Use SelectionDAG argument lowering
1183 CurDAG->setRoot(SDB->getControlRoot());
1185 CodeGenAndEmitDAG();
1188 // If we inserted any instructions at the beginning, make a note of
1189 // where they are, so we can be sure to emit subsequent instructions
1191 if (FuncInfo->InsertPt != FuncInfo->MBB->begin())
1192 FastIS->setLastLocalValue(std::prev(FuncInfo->InsertPt));
1194 FastIS->setLastLocalValue(nullptr);
1197 unsigned NumFastIselRemaining = std::distance(Begin, End);
1198 // Do FastISel on as many instructions as possible.
1199 for (; BI != Begin; --BI) {
1200 const Instruction *Inst = std::prev(BI);
1202 // If we no longer require this instruction, skip it.
1203 if (isFoldedOrDeadInstruction(Inst, FuncInfo)) {
1204 --NumFastIselRemaining;
1208 // Bottom-up: reset the insert pos at the top, after any local-value
1210 FastIS->recomputeInsertPt();
1212 // Try to select the instruction with FastISel.
1213 if (FastIS->selectInstruction(Inst)) {
1214 --NumFastIselRemaining;
1215 ++NumFastIselSuccess;
1216 // If fast isel succeeded, skip over all the folded instructions, and
1217 // then see if there is a load right before the selected instructions.
1218 // Try to fold the load if so.
1219 const Instruction *BeforeInst = Inst;
1220 while (BeforeInst != Begin) {
1221 BeforeInst = std::prev(BasicBlock::const_iterator(BeforeInst));
1222 if (!isFoldedOrDeadInstruction(BeforeInst, FuncInfo))
1225 if (BeforeInst != Inst && isa<LoadInst>(BeforeInst) &&
1226 BeforeInst->hasOneUse() &&
1227 FastIS->tryToFoldLoad(cast<LoadInst>(BeforeInst), Inst)) {
1228 // If we succeeded, don't re-select the load.
1229 BI = std::next(BasicBlock::const_iterator(BeforeInst));
1230 --NumFastIselRemaining;
1231 ++NumFastIselSuccess;
1237 if (EnableFastISelVerbose2)
1238 collectFailStats(Inst);
1241 // Then handle certain instructions as single-LLVM-Instruction blocks.
1242 if (isa<CallInst>(Inst)) {
1244 if (EnableFastISelVerbose || EnableFastISelAbort) {
1245 dbgs() << "FastISel missed call: ";
1248 if (EnableFastISelAbort > 2)
1249 // FastISel selector couldn't handle something and bailed.
1250 // For the purpose of debugging, just abort.
1251 report_fatal_error("FastISel didn't select the entire block");
1253 if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) {
1254 unsigned &R = FuncInfo->ValueMap[Inst];
1256 R = FuncInfo->CreateRegs(Inst->getType());
1259 bool HadTailCall = false;
1260 MachineBasicBlock::iterator SavedInsertPt = FuncInfo->InsertPt;
1261 SelectBasicBlock(Inst, BI, HadTailCall);
1263 // If the call was emitted as a tail call, we're done with the block.
1264 // We also need to delete any previously emitted instructions.
1266 FastIS->removeDeadCode(SavedInsertPt, FuncInfo->MBB->end());
1271 // Recompute NumFastIselRemaining as Selection DAG instruction
1272 // selection may have handled the call, input args, etc.
1273 unsigned RemainingNow = std::distance(Begin, BI);
1274 NumFastIselFailures += NumFastIselRemaining - RemainingNow;
1275 NumFastIselRemaining = RemainingNow;
1279 bool ShouldAbort = EnableFastISelAbort;
1280 if (EnableFastISelVerbose || EnableFastISelAbort) {
1281 if (isa<TerminatorInst>(Inst)) {
1282 // Use a different message for terminator misses.
1283 dbgs() << "FastISel missed terminator: ";
1284 // Don't abort unless for terminator unless the level is really high
1285 ShouldAbort = (EnableFastISelAbort > 2);
1287 dbgs() << "FastISel miss: ";
1292 // FastISel selector couldn't handle something and bailed.
1293 // For the purpose of debugging, just abort.
1294 report_fatal_error("FastISel didn't select the entire block");
1296 NumFastIselFailures += NumFastIselRemaining;
1300 FastIS->recomputeInsertPt();
1302 // Lower any arguments needed in this block if this is the entry block.
1303 if (LLVMBB == &Fn.getEntryBlock()) {
1312 ++NumFastIselBlocks;
1315 // Run SelectionDAG instruction selection on the remainder of the block
1316 // not handled by FastISel. If FastISel is not run, this is the entire
1319 SelectBasicBlock(Begin, BI, HadTailCall);
1323 FuncInfo->PHINodesToUpdate.clear();
1327 SDB->clearDanglingDebugInfo();
1328 SDB->SPDescriptor.resetPerFunctionState();
1331 /// Given that the input MI is before a partial terminator sequence TSeq, return
1332 /// true if M + TSeq also a partial terminator sequence.
1334 /// A Terminator sequence is a sequence of MachineInstrs which at this point in
1335 /// lowering copy vregs into physical registers, which are then passed into
1336 /// terminator instructors so we can satisfy ABI constraints. A partial
1337 /// terminator sequence is an improper subset of a terminator sequence (i.e. it
1338 /// may be the whole terminator sequence).
1339 static bool MIIsInTerminatorSequence(const MachineInstr *MI) {
1340 // If we do not have a copy or an implicit def, we return true if and only if
1341 // MI is a debug value.
1342 if (!MI->isCopy() && !MI->isImplicitDef())
1343 // Sometimes DBG_VALUE MI sneak in between the copies from the vregs to the
1344 // physical registers if there is debug info associated with the terminator
1345 // of our mbb. We want to include said debug info in our terminator
1346 // sequence, so we return true in that case.
1347 return MI->isDebugValue();
1349 // We have left the terminator sequence if we are not doing one of the
1352 // 1. Copying a vreg into a physical register.
1353 // 2. Copying a vreg into a vreg.
1354 // 3. Defining a register via an implicit def.
1356 // OPI should always be a register definition...
1357 MachineInstr::const_mop_iterator OPI = MI->operands_begin();
1358 if (!OPI->isReg() || !OPI->isDef())
1361 // Defining any register via an implicit def is always ok.
1362 if (MI->isImplicitDef())
1365 // Grab the copy source...
1366 MachineInstr::const_mop_iterator OPI2 = OPI;
1368 assert(OPI2 != MI->operands_end()
1369 && "Should have a copy implying we should have 2 arguments.");
1371 // Make sure that the copy dest is not a vreg when the copy source is a
1372 // physical register.
1373 if (!OPI2->isReg() ||
1374 (!TargetRegisterInfo::isPhysicalRegister(OPI->getReg()) &&
1375 TargetRegisterInfo::isPhysicalRegister(OPI2->getReg())))
1381 /// Find the split point at which to splice the end of BB into its success stack
1382 /// protector check machine basic block.
1384 /// On many platforms, due to ABI constraints, terminators, even before register
1385 /// allocation, use physical registers. This creates an issue for us since
1386 /// physical registers at this point can not travel across basic
1387 /// blocks. Luckily, selectiondag always moves physical registers into vregs
1388 /// when they enter functions and moves them through a sequence of copies back
1389 /// into the physical registers right before the terminator creating a
1390 /// ``Terminator Sequence''. This function is searching for the beginning of the
1391 /// terminator sequence so that we can ensure that we splice off not just the
1392 /// terminator, but additionally the copies that move the vregs into the
1393 /// physical registers.
1394 static MachineBasicBlock::iterator
1395 FindSplitPointForStackProtector(MachineBasicBlock *BB, DebugLoc DL) {
1396 MachineBasicBlock::iterator SplitPoint = BB->getFirstTerminator();
1398 if (SplitPoint == BB->begin())
1401 MachineBasicBlock::iterator Start = BB->begin();
1402 MachineBasicBlock::iterator Previous = SplitPoint;
1405 while (MIIsInTerminatorSequence(Previous)) {
1406 SplitPoint = Previous;
1407 if (Previous == Start)
1416 SelectionDAGISel::FinishBasicBlock() {
1418 DEBUG(dbgs() << "Total amount of phi nodes to update: "
1419 << FuncInfo->PHINodesToUpdate.size() << "\n";
1420 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
1421 dbgs() << "Node " << i << " : ("
1422 << FuncInfo->PHINodesToUpdate[i].first
1423 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
1425 const bool MustUpdatePHINodes = SDB->SwitchCases.empty() &&
1426 SDB->JTCases.empty() &&
1427 SDB->BitTestCases.empty();
1429 // Next, now that we know what the last MBB the LLVM BB expanded is, update
1430 // PHI nodes in successors.
1431 if (MustUpdatePHINodes) {
1432 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1433 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[i].first);
1434 assert(PHI->isPHI() &&
1435 "This is not a machine PHI node that we are updating!");
1436 if (!FuncInfo->MBB->isSuccessor(PHI->getParent()))
1438 PHI.addReg(FuncInfo->PHINodesToUpdate[i].second).addMBB(FuncInfo->MBB);
1442 // Handle stack protector.
1443 if (SDB->SPDescriptor.shouldEmitStackProtector()) {
1444 MachineBasicBlock *ParentMBB = SDB->SPDescriptor.getParentMBB();
1445 MachineBasicBlock *SuccessMBB = SDB->SPDescriptor.getSuccessMBB();
1447 // Find the split point to split the parent mbb. At the same time copy all
1448 // physical registers used in the tail of parent mbb into virtual registers
1449 // before the split point and back into physical registers after the split
1450 // point. This prevents us needing to deal with Live-ins and many other
1451 // register allocation issues caused by us splitting the parent mbb. The
1452 // register allocator will clean up said virtual copies later on.
1453 MachineBasicBlock::iterator SplitPoint =
1454 FindSplitPointForStackProtector(ParentMBB, SDB->getCurDebugLoc());
1456 // Splice the terminator of ParentMBB into SuccessMBB.
1457 SuccessMBB->splice(SuccessMBB->end(), ParentMBB,
1461 // Add compare/jump on neq/jump to the parent BB.
1462 FuncInfo->MBB = ParentMBB;
1463 FuncInfo->InsertPt = ParentMBB->end();
1464 SDB->visitSPDescriptorParent(SDB->SPDescriptor, ParentMBB);
1465 CurDAG->setRoot(SDB->getRoot());
1467 CodeGenAndEmitDAG();
1469 // CodeGen Failure MBB if we have not codegened it yet.
1470 MachineBasicBlock *FailureMBB = SDB->SPDescriptor.getFailureMBB();
1471 if (!FailureMBB->size()) {
1472 FuncInfo->MBB = FailureMBB;
1473 FuncInfo->InsertPt = FailureMBB->end();
1474 SDB->visitSPDescriptorFailure(SDB->SPDescriptor);
1475 CurDAG->setRoot(SDB->getRoot());
1477 CodeGenAndEmitDAG();
1480 // Clear the Per-BB State.
1481 SDB->SPDescriptor.resetPerBBState();
1484 // If we updated PHI Nodes, return early.
1485 if (MustUpdatePHINodes)
1488 for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
1489 // Lower header first, if it wasn't already lowered
1490 if (!SDB->BitTestCases[i].Emitted) {
1491 // Set the current basic block to the mbb we wish to insert the code into
1492 FuncInfo->MBB = SDB->BitTestCases[i].Parent;
1493 FuncInfo->InsertPt = FuncInfo->MBB->end();
1495 SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB);
1496 CurDAG->setRoot(SDB->getRoot());
1498 CodeGenAndEmitDAG();
1501 uint32_t UnhandledWeight = 0;
1502 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j)
1503 UnhandledWeight += SDB->BitTestCases[i].Cases[j].ExtraWeight;
1505 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
1506 UnhandledWeight -= SDB->BitTestCases[i].Cases[j].ExtraWeight;
1507 // Set the current basic block to the mbb we wish to insert the code into
1508 FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB;
1509 FuncInfo->InsertPt = FuncInfo->MBB->end();
1512 SDB->visitBitTestCase(SDB->BitTestCases[i],
1513 SDB->BitTestCases[i].Cases[j+1].ThisBB,
1515 SDB->BitTestCases[i].Reg,
1516 SDB->BitTestCases[i].Cases[j],
1519 SDB->visitBitTestCase(SDB->BitTestCases[i],
1520 SDB->BitTestCases[i].Default,
1522 SDB->BitTestCases[i].Reg,
1523 SDB->BitTestCases[i].Cases[j],
1527 CurDAG->setRoot(SDB->getRoot());
1529 CodeGenAndEmitDAG();
1533 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1535 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[pi].first);
1536 MachineBasicBlock *PHIBB = PHI->getParent();
1537 assert(PHI->isPHI() &&
1538 "This is not a machine PHI node that we are updating!");
1539 // This is "default" BB. We have two jumps to it. From "header" BB and
1540 // from last "case" BB.
1541 if (PHIBB == SDB->BitTestCases[i].Default)
1542 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second)
1543 .addMBB(SDB->BitTestCases[i].Parent)
1544 .addReg(FuncInfo->PHINodesToUpdate[pi].second)
1545 .addMBB(SDB->BitTestCases[i].Cases.back().ThisBB);
1546 // One of "cases" BB.
1547 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
1549 MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
1550 if (cBB->isSuccessor(PHIBB))
1551 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second).addMBB(cBB);
1555 SDB->BitTestCases.clear();
1557 // If the JumpTable record is filled in, then we need to emit a jump table.
1558 // Updating the PHI nodes is tricky in this case, since we need to determine
1559 // whether the PHI is a successor of the range check MBB or the jump table MBB
1560 for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
1561 // Lower header first, if it wasn't already lowered
1562 if (!SDB->JTCases[i].first.Emitted) {
1563 // Set the current basic block to the mbb we wish to insert the code into
1564 FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB;
1565 FuncInfo->InsertPt = FuncInfo->MBB->end();
1567 SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
1569 CurDAG->setRoot(SDB->getRoot());
1571 CodeGenAndEmitDAG();
1574 // Set the current basic block to the mbb we wish to insert the code into
1575 FuncInfo->MBB = SDB->JTCases[i].second.MBB;
1576 FuncInfo->InsertPt = FuncInfo->MBB->end();
1578 SDB->visitJumpTable(SDB->JTCases[i].second);
1579 CurDAG->setRoot(SDB->getRoot());
1581 CodeGenAndEmitDAG();
1584 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1586 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[pi].first);
1587 MachineBasicBlock *PHIBB = PHI->getParent();
1588 assert(PHI->isPHI() &&
1589 "This is not a machine PHI node that we are updating!");
1590 // "default" BB. We can go there only from header BB.
1591 if (PHIBB == SDB->JTCases[i].second.Default)
1592 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second)
1593 .addMBB(SDB->JTCases[i].first.HeaderBB);
1594 // JT BB. Just iterate over successors here
1595 if (FuncInfo->MBB->isSuccessor(PHIBB))
1596 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second).addMBB(FuncInfo->MBB);
1599 SDB->JTCases.clear();
1601 // If the switch block involved a branch to one of the actual successors, we
1602 // need to update PHI nodes in that block.
1603 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1604 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[i].first);
1605 assert(PHI->isPHI() &&
1606 "This is not a machine PHI node that we are updating!");
1607 if (FuncInfo->MBB->isSuccessor(PHI->getParent()))
1608 PHI.addReg(FuncInfo->PHINodesToUpdate[i].second).addMBB(FuncInfo->MBB);
1611 // If we generated any switch lowering information, build and codegen any
1612 // additional DAGs necessary.
1613 for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
1614 // Set the current basic block to the mbb we wish to insert the code into
1615 FuncInfo->MBB = SDB->SwitchCases[i].ThisBB;
1616 FuncInfo->InsertPt = FuncInfo->MBB->end();
1618 // Determine the unique successors.
1619 SmallVector<MachineBasicBlock *, 2> Succs;
1620 Succs.push_back(SDB->SwitchCases[i].TrueBB);
1621 if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB)
1622 Succs.push_back(SDB->SwitchCases[i].FalseBB);
1624 // Emit the code. Note that this could result in FuncInfo->MBB being split.
1625 SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB);
1626 CurDAG->setRoot(SDB->getRoot());
1628 CodeGenAndEmitDAG();
1630 // Remember the last block, now that any splitting is done, for use in
1631 // populating PHI nodes in successors.
1632 MachineBasicBlock *ThisBB = FuncInfo->MBB;
1634 // Handle any PHI nodes in successors of this chunk, as if we were coming
1635 // from the original BB before switch expansion. Note that PHI nodes can
1636 // occur multiple times in PHINodesToUpdate. We have to be very careful to
1637 // handle them the right number of times.
1638 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
1639 FuncInfo->MBB = Succs[i];
1640 FuncInfo->InsertPt = FuncInfo->MBB->end();
1641 // FuncInfo->MBB may have been removed from the CFG if a branch was
1643 if (ThisBB->isSuccessor(FuncInfo->MBB)) {
1644 for (MachineBasicBlock::iterator
1645 MBBI = FuncInfo->MBB->begin(), MBBE = FuncInfo->MBB->end();
1646 MBBI != MBBE && MBBI->isPHI(); ++MBBI) {
1647 MachineInstrBuilder PHI(*MF, MBBI);
1648 // This value for this PHI node is recorded in PHINodesToUpdate.
1649 for (unsigned pn = 0; ; ++pn) {
1650 assert(pn != FuncInfo->PHINodesToUpdate.size() &&
1651 "Didn't find PHI entry!");
1652 if (FuncInfo->PHINodesToUpdate[pn].first == PHI) {
1653 PHI.addReg(FuncInfo->PHINodesToUpdate[pn].second).addMBB(ThisBB);
1661 SDB->SwitchCases.clear();
1665 /// Create the scheduler. If a specific scheduler was specified
1666 /// via the SchedulerRegistry, use it, otherwise select the
1667 /// one preferred by the target.
1669 ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
1670 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
1674 RegisterScheduler::setDefault(Ctor);
1677 return Ctor(this, OptLevel);
1680 //===----------------------------------------------------------------------===//
1681 // Helper functions used by the generated instruction selector.
1682 //===----------------------------------------------------------------------===//
1683 // Calls to these methods are generated by tblgen.
1685 /// CheckAndMask - The isel is trying to match something like (and X, 255). If
1686 /// the dag combiner simplified the 255, we still want to match. RHS is the
1687 /// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
1688 /// specified in the .td file (e.g. 255).
1689 bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
1690 int64_t DesiredMaskS) const {
1691 const APInt &ActualMask = RHS->getAPIntValue();
1692 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
1694 // If the actual mask exactly matches, success!
1695 if (ActualMask == DesiredMask)
1698 // If the actual AND mask is allowing unallowed bits, this doesn't match.
1699 if (ActualMask.intersects(~DesiredMask))
1702 // Otherwise, the DAG Combiner may have proven that the value coming in is
1703 // either already zero or is not demanded. Check for known zero input bits.
1704 APInt NeededMask = DesiredMask & ~ActualMask;
1705 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
1708 // TODO: check to see if missing bits are just not demanded.
1710 // Otherwise, this pattern doesn't match.
1714 /// CheckOrMask - The isel is trying to match something like (or X, 255). If
1715 /// the dag combiner simplified the 255, we still want to match. RHS is the
1716 /// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
1717 /// specified in the .td file (e.g. 255).
1718 bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
1719 int64_t DesiredMaskS) const {
1720 const APInt &ActualMask = RHS->getAPIntValue();
1721 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
1723 // If the actual mask exactly matches, success!
1724 if (ActualMask == DesiredMask)
1727 // If the actual AND mask is allowing unallowed bits, this doesn't match.
1728 if (ActualMask.intersects(~DesiredMask))
1731 // Otherwise, the DAG Combiner may have proven that the value coming in is
1732 // either already zero or is not demanded. Check for known zero input bits.
1733 APInt NeededMask = DesiredMask & ~ActualMask;
1735 APInt KnownZero, KnownOne;
1736 CurDAG->computeKnownBits(LHS, KnownZero, KnownOne);
1738 // If all the missing bits in the or are already known to be set, match!
1739 if ((NeededMask & KnownOne) == NeededMask)
1742 // TODO: check to see if missing bits are just not demanded.
1744 // Otherwise, this pattern doesn't match.
1749 /// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
1750 /// by tblgen. Others should not call it.
1751 void SelectionDAGISel::
1752 SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
1753 std::vector<SDValue> InOps;
1754 std::swap(InOps, Ops);
1756 Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
1757 Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
1758 Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
1759 Ops.push_back(InOps[InlineAsm::Op_ExtraInfo]); // 3 (SideEffect, AlignStack)
1761 unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
1762 if (InOps[e-1].getValueType() == MVT::Glue)
1763 --e; // Don't process a glue operand if it is here.
1766 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
1767 if (!InlineAsm::isMemKind(Flags)) {
1768 // Just skip over this operand, copying the operands verbatim.
1769 Ops.insert(Ops.end(), InOps.begin()+i,
1770 InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
1771 i += InlineAsm::getNumOperandRegisters(Flags) + 1;
1773 assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
1774 "Memory operand with multiple values?");
1776 unsigned TiedToOperand;
1777 if (InlineAsm::isUseOperandTiedToDef(Flags, TiedToOperand)) {
1778 // We need the constraint ID from the operand this is tied to.
1779 unsigned CurOp = InlineAsm::Op_FirstOperand;
1780 Flags = cast<ConstantSDNode>(InOps[CurOp])->getZExtValue();
1781 for (; TiedToOperand; --TiedToOperand) {
1782 CurOp += InlineAsm::getNumOperandRegisters(Flags)+1;
1783 Flags = cast<ConstantSDNode>(InOps[CurOp])->getZExtValue();
1787 // Otherwise, this is a memory operand. Ask the target to select it.
1788 std::vector<SDValue> SelOps;
1789 if (SelectInlineAsmMemoryOperand(InOps[i+1],
1790 InlineAsm::getMemoryConstraintID(Flags),
1792 report_fatal_error("Could not match memory address. Inline asm"
1795 // Add this to the output node.
1797 InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
1798 Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
1799 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
1804 // Add the glue input back if present.
1805 if (e != InOps.size())
1806 Ops.push_back(InOps.back());
1809 /// findGlueUse - Return use of MVT::Glue value produced by the specified
1812 static SDNode *findGlueUse(SDNode *N) {
1813 unsigned FlagResNo = N->getNumValues()-1;
1814 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
1815 SDUse &Use = I.getUse();
1816 if (Use.getResNo() == FlagResNo)
1817 return Use.getUser();
1822 /// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
1823 /// This function recursively traverses up the operand chain, ignoring
1825 static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
1826 SDNode *Root, SmallPtrSetImpl<SDNode*> &Visited,
1827 bool IgnoreChains) {
1828 // The NodeID's are given uniques ID's where a node ID is guaranteed to be
1829 // greater than all of its (recursive) operands. If we scan to a point where
1830 // 'use' is smaller than the node we're scanning for, then we know we will
1833 // The Use may be -1 (unassigned) if it is a newly allocated node. This can
1834 // happen because we scan down to newly selected nodes in the case of glue
1836 if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
1839 // Don't revisit nodes if we already scanned it and didn't fail, we know we
1840 // won't fail if we scan it again.
1841 if (!Visited.insert(Use).second)
1844 for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
1845 // Ignore chain uses, they are validated by HandleMergeInputChains.
1846 if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
1849 SDNode *N = Use->getOperand(i).getNode();
1851 if (Use == ImmedUse || Use == Root)
1852 continue; // We are not looking for immediate use.
1857 // Traverse up the operand chain.
1858 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
1864 /// IsProfitableToFold - Returns true if it's profitable to fold the specific
1865 /// operand node N of U during instruction selection that starts at Root.
1866 bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
1867 SDNode *Root) const {
1868 if (OptLevel == CodeGenOpt::None) return false;
1869 return N.hasOneUse();
1872 /// IsLegalToFold - Returns true if the specific operand node N of
1873 /// U can be folded during instruction selection that starts at Root.
1874 bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
1875 CodeGenOpt::Level OptLevel,
1876 bool IgnoreChains) {
1877 if (OptLevel == CodeGenOpt::None) return false;
1879 // If Root use can somehow reach N through a path that that doesn't contain
1880 // U then folding N would create a cycle. e.g. In the following
1881 // diagram, Root can reach N through X. If N is folded into into Root, then
1882 // X is both a predecessor and a successor of U.
1893 // * indicates nodes to be folded together.
1895 // If Root produces glue, then it gets (even more) interesting. Since it
1896 // will be "glued" together with its glue use in the scheduler, we need to
1897 // check if it might reach N.
1916 // If GU (glue use) indirectly reaches N (the load), and Root folds N
1917 // (call it Fold), then X is a predecessor of GU and a successor of
1918 // Fold. But since Fold and GU are glued together, this will create
1919 // a cycle in the scheduling graph.
1921 // If the node has glue, walk down the graph to the "lowest" node in the
1923 EVT VT = Root->getValueType(Root->getNumValues()-1);
1924 while (VT == MVT::Glue) {
1925 SDNode *GU = findGlueUse(Root);
1929 VT = Root->getValueType(Root->getNumValues()-1);
1931 // If our query node has a glue result with a use, we've walked up it. If
1932 // the user (which has already been selected) has a chain or indirectly uses
1933 // the chain, our WalkChainUsers predicate will not consider it. Because of
1934 // this, we cannot ignore chains in this predicate.
1935 IgnoreChains = false;
1939 SmallPtrSet<SDNode*, 16> Visited;
1940 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
1943 SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
1944 std::vector<SDValue> Ops(N->op_begin(), N->op_end());
1945 SelectInlineAsmMemoryOperands(Ops);
1947 const EVT VTs[] = {MVT::Other, MVT::Glue};
1948 SDValue New = CurDAG->getNode(ISD::INLINEASM, SDLoc(N), VTs, Ops);
1950 return New.getNode();
1954 *SelectionDAGISel::Select_READ_REGISTER(SDNode *Op) {
1956 MDNodeSDNode *MD = dyn_cast<MDNodeSDNode>(Op->getOperand(0));
1957 const MDString *RegStr = dyn_cast<MDString>(MD->getMD()->getOperand(0));
1959 TLI->getRegisterByName(RegStr->getString().data(), Op->getValueType(0));
1960 SDValue New = CurDAG->getCopyFromReg(
1961 CurDAG->getEntryNode(), dl, Reg, Op->getValueType(0));
1963 return New.getNode();
1967 *SelectionDAGISel::Select_WRITE_REGISTER(SDNode *Op) {
1969 MDNodeSDNode *MD = dyn_cast<MDNodeSDNode>(Op->getOperand(1));
1970 const MDString *RegStr = dyn_cast<MDString>(MD->getMD()->getOperand(0));
1971 unsigned Reg = TLI->getRegisterByName(RegStr->getString().data(),
1972 Op->getOperand(2).getValueType());
1973 SDValue New = CurDAG->getCopyToReg(
1974 CurDAG->getEntryNode(), dl, Reg, Op->getOperand(2));
1976 return New.getNode();
1981 SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
1982 return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
1985 /// GetVBR - decode a vbr encoding whose top bit is set.
1986 LLVM_ATTRIBUTE_ALWAYS_INLINE static uint64_t
1987 GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
1988 assert(Val >= 128 && "Not a VBR");
1989 Val &= 127; // Remove first vbr bit.
1994 NextBits = MatcherTable[Idx++];
1995 Val |= (NextBits&127) << Shift;
1997 } while (NextBits & 128);
2003 /// UpdateChainsAndGlue - When a match is complete, this method updates uses of
2004 /// interior glue and chain results to use the new glue and chain results.
2005 void SelectionDAGISel::
2006 UpdateChainsAndGlue(SDNode *NodeToMatch, SDValue InputChain,
2007 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
2009 const SmallVectorImpl<SDNode*> &GlueResultNodesMatched,
2010 bool isMorphNodeTo) {
2011 SmallVector<SDNode*, 4> NowDeadNodes;
2013 // Now that all the normal results are replaced, we replace the chain and
2014 // glue results if present.
2015 if (!ChainNodesMatched.empty()) {
2016 assert(InputChain.getNode() &&
2017 "Matched input chains but didn't produce a chain");
2018 // Loop over all of the nodes we matched that produced a chain result.
2019 // Replace all the chain results with the final chain we ended up with.
2020 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
2021 SDNode *ChainNode = ChainNodesMatched[i];
2023 // If this node was already deleted, don't look at it.
2024 if (ChainNode->getOpcode() == ISD::DELETED_NODE)
2027 // Don't replace the results of the root node if we're doing a
2029 if (ChainNode == NodeToMatch && isMorphNodeTo)
2032 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
2033 if (ChainVal.getValueType() == MVT::Glue)
2034 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
2035 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
2036 CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain);
2038 // If the node became dead and we haven't already seen it, delete it.
2039 if (ChainNode->use_empty() &&
2040 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
2041 NowDeadNodes.push_back(ChainNode);
2045 // If the result produces glue, update any glue results in the matched
2046 // pattern with the glue result.
2047 if (InputGlue.getNode()) {
2048 // Handle any interior nodes explicitly marked.
2049 for (unsigned i = 0, e = GlueResultNodesMatched.size(); i != e; ++i) {
2050 SDNode *FRN = GlueResultNodesMatched[i];
2052 // If this node was already deleted, don't look at it.
2053 if (FRN->getOpcode() == ISD::DELETED_NODE)
2056 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue &&
2057 "Doesn't have a glue result");
2058 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
2061 // If the node became dead and we haven't already seen it, delete it.
2062 if (FRN->use_empty() &&
2063 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
2064 NowDeadNodes.push_back(FRN);
2068 if (!NowDeadNodes.empty())
2069 CurDAG->RemoveDeadNodes(NowDeadNodes);
2071 DEBUG(dbgs() << "ISEL: Match complete!\n");
2077 CR_LeadsToInteriorNode
2080 /// WalkChainUsers - Walk down the users of the specified chained node that is
2081 /// part of the pattern we're matching, looking at all of the users we find.
2082 /// This determines whether something is an interior node, whether we have a
2083 /// non-pattern node in between two pattern nodes (which prevent folding because
2084 /// it would induce a cycle) and whether we have a TokenFactor node sandwiched
2085 /// between pattern nodes (in which case the TF becomes part of the pattern).
2087 /// The walk we do here is guaranteed to be small because we quickly get down to
2088 /// already selected nodes "below" us.
2090 WalkChainUsers(const SDNode *ChainedNode,
2091 SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
2092 SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
2093 ChainResult Result = CR_Simple;
2095 for (SDNode::use_iterator UI = ChainedNode->use_begin(),
2096 E = ChainedNode->use_end(); UI != E; ++UI) {
2097 // Make sure the use is of the chain, not some other value we produce.
2098 if (UI.getUse().getValueType() != MVT::Other) continue;
2102 if (User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
2105 // If we see an already-selected machine node, then we've gone beyond the
2106 // pattern that we're selecting down into the already selected chunk of the
2108 unsigned UserOpcode = User->getOpcode();
2109 if (User->isMachineOpcode() ||
2110 UserOpcode == ISD::CopyToReg ||
2111 UserOpcode == ISD::CopyFromReg ||
2112 UserOpcode == ISD::INLINEASM ||
2113 UserOpcode == ISD::EH_LABEL ||
2114 UserOpcode == ISD::LIFETIME_START ||
2115 UserOpcode == ISD::LIFETIME_END) {
2116 // If their node ID got reset to -1 then they've already been selected.
2117 // Treat them like a MachineOpcode.
2118 if (User->getNodeId() == -1)
2122 // If we have a TokenFactor, we handle it specially.
2123 if (User->getOpcode() != ISD::TokenFactor) {
2124 // If the node isn't a token factor and isn't part of our pattern, then it
2125 // must be a random chained node in between two nodes we're selecting.
2126 // This happens when we have something like:
2131 // Because we structurally match the load/store as a read/modify/write,
2132 // but the call is chained between them. We cannot fold in this case
2133 // because it would induce a cycle in the graph.
2134 if (!std::count(ChainedNodesInPattern.begin(),
2135 ChainedNodesInPattern.end(), User))
2136 return CR_InducesCycle;
2138 // Otherwise we found a node that is part of our pattern. For example in:
2142 // This would happen when we're scanning down from the load and see the
2143 // store as a user. Record that there is a use of ChainedNode that is
2144 // part of the pattern and keep scanning uses.
2145 Result = CR_LeadsToInteriorNode;
2146 InteriorChainedNodes.push_back(User);
2150 // If we found a TokenFactor, there are two cases to consider: first if the
2151 // TokenFactor is just hanging "below" the pattern we're matching (i.e. no
2152 // uses of the TF are in our pattern) we just want to ignore it. Second,
2153 // the TokenFactor can be sandwiched in between two chained nodes, like so:
2159 // | \ DAG's like cheese
2162 // [TokenFactor] [Op]
2169 // In this case, the TokenFactor becomes part of our match and we rewrite it
2170 // as a new TokenFactor.
2172 // To distinguish these two cases, do a recursive walk down the uses.
2173 switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
2175 // If the uses of the TokenFactor are just already-selected nodes, ignore
2176 // it, it is "below" our pattern.
2178 case CR_InducesCycle:
2179 // If the uses of the TokenFactor lead to nodes that are not part of our
2180 // pattern that are not selected, folding would turn this into a cycle,
2182 return CR_InducesCycle;
2183 case CR_LeadsToInteriorNode:
2184 break; // Otherwise, keep processing.
2187 // Okay, we know we're in the interesting interior case. The TokenFactor
2188 // is now going to be considered part of the pattern so that we rewrite its
2189 // uses (it may have uses that are not part of the pattern) with the
2190 // ultimate chain result of the generated code. We will also add its chain
2191 // inputs as inputs to the ultimate TokenFactor we create.
2192 Result = CR_LeadsToInteriorNode;
2193 ChainedNodesInPattern.push_back(User);
2194 InteriorChainedNodes.push_back(User);
2201 /// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
2202 /// operation for when the pattern matched at least one node with a chains. The
2203 /// input vector contains a list of all of the chained nodes that we match. We
2204 /// must determine if this is a valid thing to cover (i.e. matching it won't
2205 /// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
2206 /// be used as the input node chain for the generated nodes.
2208 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
2209 SelectionDAG *CurDAG) {
2210 // Walk all of the chained nodes we've matched, recursively scanning down the
2211 // users of the chain result. This adds any TokenFactor nodes that are caught
2212 // in between chained nodes to the chained and interior nodes list.
2213 SmallVector<SDNode*, 3> InteriorChainedNodes;
2214 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
2215 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
2216 InteriorChainedNodes) == CR_InducesCycle)
2217 return SDValue(); // Would induce a cycle.
2220 // Okay, we have walked all the matched nodes and collected TokenFactor nodes
2221 // that we are interested in. Form our input TokenFactor node.
2222 SmallVector<SDValue, 3> InputChains;
2223 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
2224 // Add the input chain of this node to the InputChains list (which will be
2225 // the operands of the generated TokenFactor) if it's not an interior node.
2226 SDNode *N = ChainNodesMatched[i];
2227 if (N->getOpcode() != ISD::TokenFactor) {
2228 if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
2231 // Otherwise, add the input chain.
2232 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
2233 assert(InChain.getValueType() == MVT::Other && "Not a chain");
2234 InputChains.push_back(InChain);
2238 // If we have a token factor, we want to add all inputs of the token factor
2239 // that are not part of the pattern we're matching.
2240 for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
2241 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
2242 N->getOperand(op).getNode()))
2243 InputChains.push_back(N->getOperand(op));
2247 if (InputChains.size() == 1)
2248 return InputChains[0];
2249 return CurDAG->getNode(ISD::TokenFactor, SDLoc(ChainNodesMatched[0]),
2250 MVT::Other, InputChains);
2253 /// MorphNode - Handle morphing a node in place for the selector.
2254 SDNode *SelectionDAGISel::
2255 MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
2256 ArrayRef<SDValue> Ops, unsigned EmitNodeInfo) {
2257 // It is possible we're using MorphNodeTo to replace a node with no
2258 // normal results with one that has a normal result (or we could be
2259 // adding a chain) and the input could have glue and chains as well.
2260 // In this case we need to shift the operands down.
2261 // FIXME: This is a horrible hack and broken in obscure cases, no worse
2262 // than the old isel though.
2263 int OldGlueResultNo = -1, OldChainResultNo = -1;
2265 unsigned NTMNumResults = Node->getNumValues();
2266 if (Node->getValueType(NTMNumResults-1) == MVT::Glue) {
2267 OldGlueResultNo = NTMNumResults-1;
2268 if (NTMNumResults != 1 &&
2269 Node->getValueType(NTMNumResults-2) == MVT::Other)
2270 OldChainResultNo = NTMNumResults-2;
2271 } else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
2272 OldChainResultNo = NTMNumResults-1;
2274 // Call the underlying SelectionDAG routine to do the transmogrification. Note
2275 // that this deletes operands of the old node that become dead.
2276 SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops);
2278 // MorphNodeTo can operate in two ways: if an existing node with the
2279 // specified operands exists, it can just return it. Otherwise, it
2280 // updates the node in place to have the requested operands.
2282 // If we updated the node in place, reset the node ID. To the isel,
2283 // this should be just like a newly allocated machine node.
2287 unsigned ResNumResults = Res->getNumValues();
2288 // Move the glue if needed.
2289 if ((EmitNodeInfo & OPFL_GlueOutput) && OldGlueResultNo != -1 &&
2290 (unsigned)OldGlueResultNo != ResNumResults-1)
2291 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldGlueResultNo),
2292 SDValue(Res, ResNumResults-1));
2294 if ((EmitNodeInfo & OPFL_GlueOutput) != 0)
2297 // Move the chain reference if needed.
2298 if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
2299 (unsigned)OldChainResultNo != ResNumResults-1)
2300 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
2301 SDValue(Res, ResNumResults-1));
2303 // Otherwise, no replacement happened because the node already exists. Replace
2304 // Uses of the old node with the new one.
2306 CurDAG->ReplaceAllUsesWith(Node, Res);
2311 /// CheckSame - Implements OP_CheckSame.
2312 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2313 CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2315 const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
2316 // Accept if it is exactly the same as a previously recorded node.
2317 unsigned RecNo = MatcherTable[MatcherIndex++];
2318 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2319 return N == RecordedNodes[RecNo].first;
2322 /// CheckChildSame - Implements OP_CheckChildXSame.
2323 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2324 CheckChildSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2326 const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes,
2328 if (ChildNo >= N.getNumOperands())
2329 return false; // Match fails if out of range child #.
2330 return ::CheckSame(MatcherTable, MatcherIndex, N.getOperand(ChildNo),
2334 /// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
2335 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2336 CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2337 const SelectionDAGISel &SDISel) {
2338 return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
2341 /// CheckNodePredicate - Implements OP_CheckNodePredicate.
2342 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2343 CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2344 const SelectionDAGISel &SDISel, SDNode *N) {
2345 return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
2348 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2349 CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2351 uint16_t Opc = MatcherTable[MatcherIndex++];
2352 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2353 return N->getOpcode() == Opc;
2356 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2357 CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2358 SDValue N, const TargetLowering *TLI) {
2359 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2360 if (N.getValueType() == VT) return true;
2362 // Handle the case when VT is iPTR.
2363 return VT == MVT::iPTR && N.getValueType() == TLI->getPointerTy();
2366 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2367 CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2368 SDValue N, const TargetLowering *TLI, unsigned ChildNo) {
2369 if (ChildNo >= N.getNumOperands())
2370 return false; // Match fails if out of range child #.
2371 return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
2374 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2375 CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2377 return cast<CondCodeSDNode>(N)->get() ==
2378 (ISD::CondCode)MatcherTable[MatcherIndex++];
2381 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2382 CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2383 SDValue N, const TargetLowering *TLI) {
2384 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2385 if (cast<VTSDNode>(N)->getVT() == VT)
2388 // Handle the case when VT is iPTR.
2389 return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI->getPointerTy();
2392 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2393 CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2395 int64_t Val = MatcherTable[MatcherIndex++];
2397 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2399 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
2400 return C && C->getSExtValue() == Val;
2403 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2404 CheckChildInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2405 SDValue N, unsigned ChildNo) {
2406 if (ChildNo >= N.getNumOperands())
2407 return false; // Match fails if out of range child #.
2408 return ::CheckInteger(MatcherTable, MatcherIndex, N.getOperand(ChildNo));
2411 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2412 CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2413 SDValue N, const SelectionDAGISel &SDISel) {
2414 int64_t Val = MatcherTable[MatcherIndex++];
2416 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2418 if (N->getOpcode() != ISD::AND) return false;
2420 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
2421 return C && SDISel.CheckAndMask(N.getOperand(0), C, Val);
2424 LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
2425 CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2426 SDValue N, const SelectionDAGISel &SDISel) {
2427 int64_t Val = MatcherTable[MatcherIndex++];
2429 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2431 if (N->getOpcode() != ISD::OR) return false;
2433 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
2434 return C && SDISel.CheckOrMask(N.getOperand(0), C, Val);
2437 /// IsPredicateKnownToFail - If we know how and can do so without pushing a
2438 /// scope, evaluate the current node. If the current predicate is known to
2439 /// fail, set Result=true and return anything. If the current predicate is
2440 /// known to pass, set Result=false and return the MatcherIndex to continue
2441 /// with. If the current predicate is unknown, set Result=false and return the
2442 /// MatcherIndex to continue with.
2443 static unsigned IsPredicateKnownToFail(const unsigned char *Table,
2444 unsigned Index, SDValue N,
2446 const SelectionDAGISel &SDISel,
2447 SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
2448 switch (Table[Index++]) {
2451 return Index-1; // Could not evaluate this predicate.
2452 case SelectionDAGISel::OPC_CheckSame:
2453 Result = !::CheckSame(Table, Index, N, RecordedNodes);
2455 case SelectionDAGISel::OPC_CheckChild0Same:
2456 case SelectionDAGISel::OPC_CheckChild1Same:
2457 case SelectionDAGISel::OPC_CheckChild2Same:
2458 case SelectionDAGISel::OPC_CheckChild3Same:
2459 Result = !::CheckChildSame(Table, Index, N, RecordedNodes,
2460 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Same);
2462 case SelectionDAGISel::OPC_CheckPatternPredicate:
2463 Result = !::CheckPatternPredicate(Table, Index, SDISel);
2465 case SelectionDAGISel::OPC_CheckPredicate:
2466 Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
2468 case SelectionDAGISel::OPC_CheckOpcode:
2469 Result = !::CheckOpcode(Table, Index, N.getNode());
2471 case SelectionDAGISel::OPC_CheckType:
2472 Result = !::CheckType(Table, Index, N, SDISel.TLI);
2474 case SelectionDAGISel::OPC_CheckChild0Type:
2475 case SelectionDAGISel::OPC_CheckChild1Type:
2476 case SelectionDAGISel::OPC_CheckChild2Type:
2477 case SelectionDAGISel::OPC_CheckChild3Type:
2478 case SelectionDAGISel::OPC_CheckChild4Type:
2479 case SelectionDAGISel::OPC_CheckChild5Type:
2480 case SelectionDAGISel::OPC_CheckChild6Type:
2481 case SelectionDAGISel::OPC_CheckChild7Type:
2482 Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
2484 SelectionDAGISel::OPC_CheckChild0Type);
2486 case SelectionDAGISel::OPC_CheckCondCode:
2487 Result = !::CheckCondCode(Table, Index, N);
2489 case SelectionDAGISel::OPC_CheckValueType:
2490 Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
2492 case SelectionDAGISel::OPC_CheckInteger:
2493 Result = !::CheckInteger(Table, Index, N);
2495 case SelectionDAGISel::OPC_CheckChild0Integer:
2496 case SelectionDAGISel::OPC_CheckChild1Integer:
2497 case SelectionDAGISel::OPC_CheckChild2Integer:
2498 case SelectionDAGISel::OPC_CheckChild3Integer:
2499 case SelectionDAGISel::OPC_CheckChild4Integer:
2500 Result = !::CheckChildInteger(Table, Index, N,
2501 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Integer);
2503 case SelectionDAGISel::OPC_CheckAndImm:
2504 Result = !::CheckAndImm(Table, Index, N, SDISel);
2506 case SelectionDAGISel::OPC_CheckOrImm:
2507 Result = !::CheckOrImm(Table, Index, N, SDISel);
2515 /// FailIndex - If this match fails, this is the index to continue with.
2518 /// NodeStack - The node stack when the scope was formed.
2519 SmallVector<SDValue, 4> NodeStack;
2521 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
2522 unsigned NumRecordedNodes;
2524 /// NumMatchedMemRefs - The number of matched memref entries.
2525 unsigned NumMatchedMemRefs;
2527 /// InputChain/InputGlue - The current chain/glue
2528 SDValue InputChain, InputGlue;
2530 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
2531 bool HasChainNodesMatched, HasGlueResultNodesMatched;
2534 /// \\brief A DAG update listener to keep the matching state
2535 /// (i.e. RecordedNodes and MatchScope) uptodate if the target is allowed to
2536 /// change the DAG while matching. X86 addressing mode matcher is an example
2538 class MatchStateUpdater : public SelectionDAG::DAGUpdateListener
2540 SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes;
2541 SmallVectorImpl<MatchScope> &MatchScopes;
2543 MatchStateUpdater(SelectionDAG &DAG,
2544 SmallVectorImpl<std::pair<SDValue, SDNode*> > &RN,
2545 SmallVectorImpl<MatchScope> &MS) :
2546 SelectionDAG::DAGUpdateListener(DAG),
2547 RecordedNodes(RN), MatchScopes(MS) { }
2549 void NodeDeleted(SDNode *N, SDNode *E) override {
2550 // Some early-returns here to avoid the search if we deleted the node or
2551 // if the update comes from MorphNodeTo (MorphNodeTo is the last thing we
2552 // do, so it's unnecessary to update matching state at that point).
2553 // Neither of these can occur currently because we only install this
2554 // update listener during matching a complex patterns.
2555 if (!E || E->isMachineOpcode())
2557 // Performing linear search here does not matter because we almost never
2558 // run this code. You'd have to have a CSE during complex pattern
2560 for (auto &I : RecordedNodes)
2561 if (I.first.getNode() == N)
2564 for (auto &I : MatchScopes)
2565 for (auto &J : I.NodeStack)
2566 if (J.getNode() == N)
2572 SDNode *SelectionDAGISel::
2573 SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
2574 unsigned TableSize) {
2575 // FIXME: Should these even be selected? Handle these cases in the caller?
2576 switch (NodeToMatch->getOpcode()) {
2579 case ISD::EntryToken: // These nodes remain the same.
2580 case ISD::BasicBlock:
2582 case ISD::RegisterMask:
2583 case ISD::HANDLENODE:
2584 case ISD::MDNODE_SDNODE:
2585 case ISD::TargetConstant:
2586 case ISD::TargetConstantFP:
2587 case ISD::TargetConstantPool:
2588 case ISD::TargetFrameIndex:
2589 case ISD::TargetExternalSymbol:
2590 case ISD::TargetBlockAddress:
2591 case ISD::TargetJumpTable:
2592 case ISD::TargetGlobalTLSAddress:
2593 case ISD::TargetGlobalAddress:
2594 case ISD::TokenFactor:
2595 case ISD::CopyFromReg:
2596 case ISD::CopyToReg:
2598 case ISD::LIFETIME_START:
2599 case ISD::LIFETIME_END:
2600 NodeToMatch->setNodeId(-1); // Mark selected.
2602 case ISD::AssertSext:
2603 case ISD::AssertZext:
2604 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
2605 NodeToMatch->getOperand(0));
2607 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
2608 case ISD::READ_REGISTER: return Select_READ_REGISTER(NodeToMatch);
2609 case ISD::WRITE_REGISTER: return Select_WRITE_REGISTER(NodeToMatch);
2610 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
2613 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
2615 // Set up the node stack with NodeToMatch as the only node on the stack.
2616 SmallVector<SDValue, 8> NodeStack;
2617 SDValue N = SDValue(NodeToMatch, 0);
2618 NodeStack.push_back(N);
2620 // MatchScopes - Scopes used when matching, if a match failure happens, this
2621 // indicates where to continue checking.
2622 SmallVector<MatchScope, 8> MatchScopes;
2624 // RecordedNodes - This is the set of nodes that have been recorded by the
2625 // state machine. The second value is the parent of the node, or null if the
2626 // root is recorded.
2627 SmallVector<std::pair<SDValue, SDNode*>, 8> RecordedNodes;
2629 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
2631 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
2633 // These are the current input chain and glue for use when generating nodes.
2634 // Various Emit operations change these. For example, emitting a copytoreg
2635 // uses and updates these.
2636 SDValue InputChain, InputGlue;
2638 // ChainNodesMatched - If a pattern matches nodes that have input/output
2639 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
2640 // which ones they are. The result is captured into this list so that we can
2641 // update the chain results when the pattern is complete.
2642 SmallVector<SDNode*, 3> ChainNodesMatched;
2643 SmallVector<SDNode*, 3> GlueResultNodesMatched;
2645 DEBUG(dbgs() << "ISEL: Starting pattern match on root node: ";
2646 NodeToMatch->dump(CurDAG);
2649 // Determine where to start the interpreter. Normally we start at opcode #0,
2650 // but if the state machine starts with an OPC_SwitchOpcode, then we
2651 // accelerate the first lookup (which is guaranteed to be hot) with the
2652 // OpcodeOffset table.
2653 unsigned MatcherIndex = 0;
2655 if (!OpcodeOffset.empty()) {
2656 // Already computed the OpcodeOffset table, just index into it.
2657 if (N.getOpcode() < OpcodeOffset.size())
2658 MatcherIndex = OpcodeOffset[N.getOpcode()];
2659 DEBUG(dbgs() << " Initial Opcode index to " << MatcherIndex << "\n");
2661 } else if (MatcherTable[0] == OPC_SwitchOpcode) {
2662 // Otherwise, the table isn't computed, but the state machine does start
2663 // with an OPC_SwitchOpcode instruction. Populate the table now, since this
2664 // is the first time we're selecting an instruction.
2667 // Get the size of this case.
2668 unsigned CaseSize = MatcherTable[Idx++];
2670 CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
2671 if (CaseSize == 0) break;
2673 // Get the opcode, add the index to the table.
2674 uint16_t Opc = MatcherTable[Idx++];
2675 Opc |= (unsigned short)MatcherTable[Idx++] << 8;
2676 if (Opc >= OpcodeOffset.size())
2677 OpcodeOffset.resize((Opc+1)*2);
2678 OpcodeOffset[Opc] = Idx;
2682 // Okay, do the lookup for the first opcode.
2683 if (N.getOpcode() < OpcodeOffset.size())
2684 MatcherIndex = OpcodeOffset[N.getOpcode()];
2688 assert(MatcherIndex < TableSize && "Invalid index");
2690 unsigned CurrentOpcodeIndex = MatcherIndex;
2692 BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
2695 // Okay, the semantics of this operation are that we should push a scope
2696 // then evaluate the first child. However, pushing a scope only to have
2697 // the first check fail (which then pops it) is inefficient. If we can
2698 // determine immediately that the first check (or first several) will
2699 // immediately fail, don't even bother pushing a scope for them.
2703 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2704 if (NumToSkip & 128)
2705 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2706 // Found the end of the scope with no match.
2707 if (NumToSkip == 0) {
2712 FailIndex = MatcherIndex+NumToSkip;
2714 unsigned MatcherIndexOfPredicate = MatcherIndex;
2715 (void)MatcherIndexOfPredicate; // silence warning.
2717 // If we can't evaluate this predicate without pushing a scope (e.g. if
2718 // it is a 'MoveParent') or if the predicate succeeds on this node, we
2719 // push the scope and evaluate the full predicate chain.
2721 MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
2722 Result, *this, RecordedNodes);
2726 DEBUG(dbgs() << " Skipped scope entry (due to false predicate) at "
2727 << "index " << MatcherIndexOfPredicate
2728 << ", continuing at " << FailIndex << "\n");
2729 ++NumDAGIselRetries;
2731 // Otherwise, we know that this case of the Scope is guaranteed to fail,
2732 // move to the next case.
2733 MatcherIndex = FailIndex;
2736 // If the whole scope failed to match, bail.
2737 if (FailIndex == 0) break;
2739 // Push a MatchScope which indicates where to go if the first child fails
2741 MatchScope NewEntry;
2742 NewEntry.FailIndex = FailIndex;
2743 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
2744 NewEntry.NumRecordedNodes = RecordedNodes.size();
2745 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
2746 NewEntry.InputChain = InputChain;
2747 NewEntry.InputGlue = InputGlue;
2748 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
2749 NewEntry.HasGlueResultNodesMatched = !GlueResultNodesMatched.empty();
2750 MatchScopes.push_back(NewEntry);
2753 case OPC_RecordNode: {
2754 // Remember this node, it may end up being an operand in the pattern.
2755 SDNode *Parent = nullptr;
2756 if (NodeStack.size() > 1)
2757 Parent = NodeStack[NodeStack.size()-2].getNode();
2758 RecordedNodes.push_back(std::make_pair(N, Parent));
2762 case OPC_RecordChild0: case OPC_RecordChild1:
2763 case OPC_RecordChild2: case OPC_RecordChild3:
2764 case OPC_RecordChild4: case OPC_RecordChild5:
2765 case OPC_RecordChild6: case OPC_RecordChild7: {
2766 unsigned ChildNo = Opcode-OPC_RecordChild0;
2767 if (ChildNo >= N.getNumOperands())
2768 break; // Match fails if out of range child #.
2770 RecordedNodes.push_back(std::make_pair(N->getOperand(ChildNo),
2774 case OPC_RecordMemRef:
2775 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
2778 case OPC_CaptureGlueInput:
2779 // If the current node has an input glue, capture it in InputGlue.
2780 if (N->getNumOperands() != 0 &&
2781 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue)
2782 InputGlue = N->getOperand(N->getNumOperands()-1);
2785 case OPC_MoveChild: {
2786 unsigned ChildNo = MatcherTable[MatcherIndex++];
2787 if (ChildNo >= N.getNumOperands())
2788 break; // Match fails if out of range child #.
2789 N = N.getOperand(ChildNo);
2790 NodeStack.push_back(N);
2794 case OPC_MoveParent:
2795 // Pop the current node off the NodeStack.
2796 NodeStack.pop_back();
2797 assert(!NodeStack.empty() && "Node stack imbalance!");
2798 N = NodeStack.back();
2802 if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
2805 case OPC_CheckChild0Same: case OPC_CheckChild1Same:
2806 case OPC_CheckChild2Same: case OPC_CheckChild3Same:
2807 if (!::CheckChildSame(MatcherTable, MatcherIndex, N, RecordedNodes,
2808 Opcode-OPC_CheckChild0Same))
2812 case OPC_CheckPatternPredicate:
2813 if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
2815 case OPC_CheckPredicate:
2816 if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
2820 case OPC_CheckComplexPat: {
2821 unsigned CPNum = MatcherTable[MatcherIndex++];
2822 unsigned RecNo = MatcherTable[MatcherIndex++];
2823 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
2825 // If target can modify DAG during matching, keep the matching state
2827 std::unique_ptr<MatchStateUpdater> MSU;
2828 if (ComplexPatternFuncMutatesDAG())
2829 MSU.reset(new MatchStateUpdater(*CurDAG, RecordedNodes,
2832 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second,
2833 RecordedNodes[RecNo].first, CPNum,
2838 case OPC_CheckOpcode:
2839 if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
2843 if (!::CheckType(MatcherTable, MatcherIndex, N, TLI))
2847 case OPC_SwitchOpcode: {
2848 unsigned CurNodeOpcode = N.getOpcode();
2849 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2852 // Get the size of this case.
2853 CaseSize = MatcherTable[MatcherIndex++];
2855 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2856 if (CaseSize == 0) break;
2858 uint16_t Opc = MatcherTable[MatcherIndex++];
2859 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2861 // If the opcode matches, then we will execute this case.
2862 if (CurNodeOpcode == Opc)
2865 // Otherwise, skip over this case.
2866 MatcherIndex += CaseSize;
2869 // If no cases matched, bail out.
2870 if (CaseSize == 0) break;
2872 // Otherwise, execute the case we found.
2873 DEBUG(dbgs() << " OpcodeSwitch from " << SwitchStart
2874 << " to " << MatcherIndex << "\n");
2878 case OPC_SwitchType: {
2879 MVT CurNodeVT = N.getSimpleValueType();
2880 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2883 // Get the size of this case.
2884 CaseSize = MatcherTable[MatcherIndex++];
2886 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2887 if (CaseSize == 0) break;
2889 MVT CaseVT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2890 if (CaseVT == MVT::iPTR)
2891 CaseVT = TLI->getPointerTy();
2893 // If the VT matches, then we will execute this case.
2894 if (CurNodeVT == CaseVT)
2897 // Otherwise, skip over this case.
2898 MatcherIndex += CaseSize;
2901 // If no cases matched, bail out.
2902 if (CaseSize == 0) break;
2904 // Otherwise, execute the case we found.
2905 DEBUG(dbgs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
2906 << "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
2909 case OPC_CheckChild0Type: case OPC_CheckChild1Type:
2910 case OPC_CheckChild2Type: case OPC_CheckChild3Type:
2911 case OPC_CheckChild4Type: case OPC_CheckChild5Type:
2912 case OPC_CheckChild6Type: case OPC_CheckChild7Type:
2913 if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
2914 Opcode-OPC_CheckChild0Type))
2917 case OPC_CheckCondCode:
2918 if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
2920 case OPC_CheckValueType:
2921 if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI))
2924 case OPC_CheckInteger:
2925 if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
2927 case OPC_CheckChild0Integer: case OPC_CheckChild1Integer:
2928 case OPC_CheckChild2Integer: case OPC_CheckChild3Integer:
2929 case OPC_CheckChild4Integer:
2930 if (!::CheckChildInteger(MatcherTable, MatcherIndex, N,
2931 Opcode-OPC_CheckChild0Integer)) break;
2933 case OPC_CheckAndImm:
2934 if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
2936 case OPC_CheckOrImm:
2937 if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
2940 case OPC_CheckFoldableChainNode: {
2941 assert(NodeStack.size() != 1 && "No parent node");
2942 // Verify that all intermediate nodes between the root and this one have
2944 bool HasMultipleUses = false;
2945 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
2946 if (!NodeStack[i].hasOneUse()) {
2947 HasMultipleUses = true;
2950 if (HasMultipleUses) break;
2952 // Check to see that the target thinks this is profitable to fold and that
2953 // we can fold it without inducing cycles in the graph.
2954 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2956 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2957 NodeToMatch, OptLevel,
2958 true/*We validate our own chains*/))
2963 case OPC_EmitInteger: {
2964 MVT::SimpleValueType VT =
2965 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2966 int64_t Val = MatcherTable[MatcherIndex++];
2968 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2969 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2970 CurDAG->getTargetConstant(Val, VT), nullptr));
2973 case OPC_EmitRegister: {
2974 MVT::SimpleValueType VT =
2975 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2976 unsigned RegNo = MatcherTable[MatcherIndex++];
2977 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2978 CurDAG->getRegister(RegNo, VT), nullptr));
2981 case OPC_EmitRegister2: {
2982 // For targets w/ more than 256 register names, the register enum
2983 // values are stored in two bytes in the matcher table (just like
2985 MVT::SimpleValueType VT =
2986 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2987 unsigned RegNo = MatcherTable[MatcherIndex++];
2988 RegNo |= MatcherTable[MatcherIndex++] << 8;
2989 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2990 CurDAG->getRegister(RegNo, VT), nullptr));
2994 case OPC_EmitConvertToTarget: {
2995 // Convert from IMM/FPIMM to target version.
2996 unsigned RecNo = MatcherTable[MatcherIndex++];
2997 assert(RecNo < RecordedNodes.size() && "Invalid EmitConvertToTarget");
2998 SDValue Imm = RecordedNodes[RecNo].first;
3000 if (Imm->getOpcode() == ISD::Constant) {
3001 const ConstantInt *Val=cast<ConstantSDNode>(Imm)->getConstantIntValue();
3002 Imm = CurDAG->getConstant(*Val, Imm.getValueType(), true);
3003 } else if (Imm->getOpcode() == ISD::ConstantFP) {
3004 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
3005 Imm = CurDAG->getConstantFP(*Val, Imm.getValueType(), true);
3008 RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second));
3012 case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
3013 case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
3014 // These are space-optimized forms of OPC_EmitMergeInputChains.
3015 assert(!InputChain.getNode() &&
3016 "EmitMergeInputChains should be the first chain producing node");
3017 assert(ChainNodesMatched.empty() &&
3018 "Should only have one EmitMergeInputChains per match");
3020 // Read all of the chained nodes.
3021 unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
3022 assert(RecNo < RecordedNodes.size() && "Invalid EmitMergeInputChains");
3023 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3025 // FIXME: What if other value results of the node have uses not matched
3027 if (ChainNodesMatched.back() != NodeToMatch &&
3028 !RecordedNodes[RecNo].first.hasOneUse()) {
3029 ChainNodesMatched.clear();
3033 // Merge the input chains if they are not intra-pattern references.
3034 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
3036 if (!InputChain.getNode())
3037 break; // Failed to merge.
3041 case OPC_EmitMergeInputChains: {
3042 assert(!InputChain.getNode() &&
3043 "EmitMergeInputChains should be the first chain producing node");
3044 // This node gets a list of nodes we matched in the input that have
3045 // chains. We want to token factor all of the input chains to these nodes
3046 // together. However, if any of the input chains is actually one of the
3047 // nodes matched in this pattern, then we have an intra-match reference.
3048 // Ignore these because the newly token factored chain should not refer to
3050 unsigned NumChains = MatcherTable[MatcherIndex++];
3051 assert(NumChains != 0 && "Can't TF zero chains");
3053 assert(ChainNodesMatched.empty() &&
3054 "Should only have one EmitMergeInputChains per match");
3056 // Read all of the chained nodes.
3057 for (unsigned i = 0; i != NumChains; ++i) {
3058 unsigned RecNo = MatcherTable[MatcherIndex++];
3059 assert(RecNo < RecordedNodes.size() && "Invalid EmitMergeInputChains");
3060 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3062 // FIXME: What if other value results of the node have uses not matched
3064 if (ChainNodesMatched.back() != NodeToMatch &&
3065 !RecordedNodes[RecNo].first.hasOneUse()) {
3066 ChainNodesMatched.clear();
3071 // If the inner loop broke out, the match fails.
3072 if (ChainNodesMatched.empty())
3075 // Merge the input chains if they are not intra-pattern references.
3076 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
3078 if (!InputChain.getNode())
3079 break; // Failed to merge.
3084 case OPC_EmitCopyToReg: {
3085 unsigned RecNo = MatcherTable[MatcherIndex++];
3086 assert(RecNo < RecordedNodes.size() && "Invalid EmitCopyToReg");
3087 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
3089 if (!InputChain.getNode())
3090 InputChain = CurDAG->getEntryNode();
3092 InputChain = CurDAG->getCopyToReg(InputChain, SDLoc(NodeToMatch),
3093 DestPhysReg, RecordedNodes[RecNo].first,
3096 InputGlue = InputChain.getValue(1);
3100 case OPC_EmitNodeXForm: {
3101 unsigned XFormNo = MatcherTable[MatcherIndex++];
3102 unsigned RecNo = MatcherTable[MatcherIndex++];
3103 assert(RecNo < RecordedNodes.size() && "Invalid EmitNodeXForm");
3104 SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo);
3105 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(Res, nullptr));
3110 case OPC_MorphNodeTo: {
3111 uint16_t TargetOpc = MatcherTable[MatcherIndex++];
3112 TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
3113 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
3114 // Get the result VT list.
3115 unsigned NumVTs = MatcherTable[MatcherIndex++];
3116 SmallVector<EVT, 4> VTs;
3117 for (unsigned i = 0; i != NumVTs; ++i) {
3118 MVT::SimpleValueType VT =
3119 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
3120 if (VT == MVT::iPTR)
3121 VT = TLI->getPointerTy().SimpleTy;
3125 if (EmitNodeInfo & OPFL_Chain)
3126 VTs.push_back(MVT::Other);
3127 if (EmitNodeInfo & OPFL_GlueOutput)
3128 VTs.push_back(MVT::Glue);
3130 // This is hot code, so optimize the two most common cases of 1 and 2
3133 if (VTs.size() == 1)
3134 VTList = CurDAG->getVTList(VTs[0]);
3135 else if (VTs.size() == 2)
3136 VTList = CurDAG->getVTList(VTs[0], VTs[1]);
3138 VTList = CurDAG->getVTList(VTs);
3140 // Get the operand list.
3141 unsigned NumOps = MatcherTable[MatcherIndex++];
3142 SmallVector<SDValue, 8> Ops;
3143 for (unsigned i = 0; i != NumOps; ++i) {
3144 unsigned RecNo = MatcherTable[MatcherIndex++];
3146 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
3148 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
3149 Ops.push_back(RecordedNodes[RecNo].first);
3152 // If there are variadic operands to add, handle them now.
3153 if (EmitNodeInfo & OPFL_VariadicInfo) {
3154 // Determine the start index to copy from.
3155 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
3156 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
3157 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
3158 "Invalid variadic node");
3159 // Copy all of the variadic operands, not including a potential glue
3161 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
3163 SDValue V = NodeToMatch->getOperand(i);
3164 if (V.getValueType() == MVT::Glue) break;
3169 // If this has chain/glue inputs, add them.
3170 if (EmitNodeInfo & OPFL_Chain)
3171 Ops.push_back(InputChain);
3172 if ((EmitNodeInfo & OPFL_GlueInput) && InputGlue.getNode() != nullptr)
3173 Ops.push_back(InputGlue);
3176 SDNode *Res = nullptr;
3177 if (Opcode != OPC_MorphNodeTo) {
3178 // If this is a normal EmitNode command, just create the new node and
3179 // add the results to the RecordedNodes list.
3180 Res = CurDAG->getMachineNode(TargetOpc, SDLoc(NodeToMatch),
3183 // Add all the non-glue/non-chain results to the RecordedNodes list.
3184 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
3185 if (VTs[i] == MVT::Other || VTs[i] == MVT::Glue) break;
3186 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(SDValue(Res, i),
3190 } else if (NodeToMatch->getOpcode() != ISD::DELETED_NODE) {
3191 Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops, EmitNodeInfo);
3193 // NodeToMatch was eliminated by CSE when the target changed the DAG.
3194 // We will visit the equivalent node later.
3195 DEBUG(dbgs() << "Node was eliminated by CSE\n");
3199 // If the node had chain/glue results, update our notion of the current
3201 if (EmitNodeInfo & OPFL_GlueOutput) {
3202 InputGlue = SDValue(Res, VTs.size()-1);
3203 if (EmitNodeInfo & OPFL_Chain)
3204 InputChain = SDValue(Res, VTs.size()-2);
3205 } else if (EmitNodeInfo & OPFL_Chain)
3206 InputChain = SDValue(Res, VTs.size()-1);
3208 // If the OPFL_MemRefs glue is set on this node, slap all of the
3209 // accumulated memrefs onto it.
3211 // FIXME: This is vastly incorrect for patterns with multiple outputs
3212 // instructions that access memory and for ComplexPatterns that match
3214 if (EmitNodeInfo & OPFL_MemRefs) {
3215 // Only attach load or store memory operands if the generated
3216 // instruction may load or store.
3217 const MCInstrDesc &MCID = TII->get(TargetOpc);
3218 bool mayLoad = MCID.mayLoad();
3219 bool mayStore = MCID.mayStore();
3221 unsigned NumMemRefs = 0;
3222 for (SmallVectorImpl<MachineMemOperand *>::const_iterator I =
3223 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
3224 if ((*I)->isLoad()) {
3227 } else if ((*I)->isStore()) {
3235 MachineSDNode::mmo_iterator MemRefs =
3236 MF->allocateMemRefsArray(NumMemRefs);
3238 MachineSDNode::mmo_iterator MemRefsPos = MemRefs;
3239 for (SmallVectorImpl<MachineMemOperand *>::const_iterator I =
3240 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
3241 if ((*I)->isLoad()) {
3244 } else if ((*I)->isStore()) {
3252 cast<MachineSDNode>(Res)
3253 ->setMemRefs(MemRefs, MemRefs + NumMemRefs);
3257 << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
3258 << " node: "; Res->dump(CurDAG); dbgs() << "\n");
3260 // If this was a MorphNodeTo then we're completely done!
3261 if (Opcode == OPC_MorphNodeTo) {
3262 // Update chain and glue uses.
3263 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
3264 InputGlue, GlueResultNodesMatched, true);
3271 case OPC_MarkGlueResults: {
3272 unsigned NumNodes = MatcherTable[MatcherIndex++];
3274 // Read and remember all the glue-result nodes.
3275 for (unsigned i = 0; i != NumNodes; ++i) {
3276 unsigned RecNo = MatcherTable[MatcherIndex++];
3278 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
3280 assert(RecNo < RecordedNodes.size() && "Invalid MarkGlueResults");
3281 GlueResultNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3286 case OPC_CompleteMatch: {
3287 // The match has been completed, and any new nodes (if any) have been
3288 // created. Patch up references to the matched dag to use the newly
3290 unsigned NumResults = MatcherTable[MatcherIndex++];
3292 for (unsigned i = 0; i != NumResults; ++i) {
3293 unsigned ResSlot = MatcherTable[MatcherIndex++];
3295 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
3297 assert(ResSlot < RecordedNodes.size() && "Invalid CompleteMatch");
3298 SDValue Res = RecordedNodes[ResSlot].first;
3300 assert(i < NodeToMatch->getNumValues() &&
3301 NodeToMatch->getValueType(i) != MVT::Other &&
3302 NodeToMatch->getValueType(i) != MVT::Glue &&
3303 "Invalid number of results to complete!");
3304 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
3305 NodeToMatch->getValueType(i) == MVT::iPTR ||
3306 Res.getValueType() == MVT::iPTR ||
3307 NodeToMatch->getValueType(i).getSizeInBits() ==
3308 Res.getValueType().getSizeInBits()) &&
3309 "invalid replacement");
3310 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
3313 // If the root node defines glue, add it to the glue nodes to update list.
3314 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Glue)
3315 GlueResultNodesMatched.push_back(NodeToMatch);
3317 // Update chain and glue uses.
3318 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
3319 InputGlue, GlueResultNodesMatched, false);
3321 assert(NodeToMatch->use_empty() &&
3322 "Didn't replace all uses of the node?");
3324 // FIXME: We just return here, which interacts correctly with SelectRoot
3325 // above. We should fix this to not return an SDNode* anymore.
3330 // If the code reached this point, then the match failed. See if there is
3331 // another child to try in the current 'Scope', otherwise pop it until we
3332 // find a case to check.
3333 DEBUG(dbgs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
3334 ++NumDAGIselRetries;
3336 if (MatchScopes.empty()) {
3337 CannotYetSelect(NodeToMatch);
3341 // Restore the interpreter state back to the point where the scope was
3343 MatchScope &LastScope = MatchScopes.back();
3344 RecordedNodes.resize(LastScope.NumRecordedNodes);
3346 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
3347 N = NodeStack.back();
3349 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
3350 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
3351 MatcherIndex = LastScope.FailIndex;
3353 DEBUG(dbgs() << " Continuing at " << MatcherIndex << "\n");
3355 InputChain = LastScope.InputChain;
3356 InputGlue = LastScope.InputGlue;
3357 if (!LastScope.HasChainNodesMatched)
3358 ChainNodesMatched.clear();
3359 if (!LastScope.HasGlueResultNodesMatched)
3360 GlueResultNodesMatched.clear();
3362 // Check to see what the offset is at the new MatcherIndex. If it is zero
3363 // we have reached the end of this scope, otherwise we have another child
3364 // in the current scope to try.
3365 unsigned NumToSkip = MatcherTable[MatcherIndex++];
3366 if (NumToSkip & 128)
3367 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
3369 // If we have another child in this scope to match, update FailIndex and
3371 if (NumToSkip != 0) {
3372 LastScope.FailIndex = MatcherIndex+NumToSkip;
3376 // End of this scope, pop it and try the next child in the containing
3378 MatchScopes.pop_back();
3385 void SelectionDAGISel::CannotYetSelect(SDNode *N) {
3387 raw_string_ostream Msg(msg);
3388 Msg << "Cannot select: ";
3390 if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
3391 N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
3392 N->getOpcode() != ISD::INTRINSIC_VOID) {
3393 N->printrFull(Msg, CurDAG);
3394 Msg << "\nIn function: " << MF->getName();
3396 bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
3398 cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
3399 if (iid < Intrinsic::num_intrinsics)
3400 Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
3401 else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
3402 Msg << "target intrinsic %" << TII->getName(iid);
3404 Msg << "unknown intrinsic #" << iid;
3406 report_fatal_error(Msg.str());
3409 char SelectionDAGISel::ID = 0;