1 //===- DAGISelEmitter.cpp - Generate an instruction selector --------------===//
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 tablegen backend emits a DAG instruction selector.
12 //===----------------------------------------------------------------------===//
14 #include "DAGISelEmitter.h"
16 #include "llvm/ADT/StringExtras.h"
17 #include "llvm/Support/Debug.h"
18 #include "llvm/Support/MathExtras.h"
19 #include "llvm/Support/Streams.h"
23 //===----------------------------------------------------------------------===//
24 // DAGISelEmitter Helper methods
27 /// NodeIsComplexPattern - return true if N is a leaf node and a subclass of
29 static bool NodeIsComplexPattern(TreePatternNode *N) {
30 return (N->isLeaf() &&
31 dynamic_cast<DefInit*>(N->getLeafValue()) &&
32 static_cast<DefInit*>(N->getLeafValue())->getDef()->
33 isSubClassOf("ComplexPattern"));
36 /// NodeGetComplexPattern - return the pointer to the ComplexPattern if N
37 /// is a leaf node and a subclass of ComplexPattern, else it returns NULL.
38 static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
39 CodeGenDAGPatterns &CGP) {
41 dynamic_cast<DefInit*>(N->getLeafValue()) &&
42 static_cast<DefInit*>(N->getLeafValue())->getDef()->
43 isSubClassOf("ComplexPattern")) {
44 return &CGP.getComplexPattern(static_cast<DefInit*>(N->getLeafValue())
50 /// getPatternSize - Return the 'size' of this pattern. We want to match large
51 /// patterns before small ones. This is used to determine the size of a
53 static unsigned getPatternSize(TreePatternNode *P, CodeGenDAGPatterns &CGP) {
54 assert((EMVT::isExtIntegerInVTs(P->getExtTypes()) ||
55 EMVT::isExtFloatingPointInVTs(P->getExtTypes()) ||
56 P->getExtTypeNum(0) == MVT::isVoid ||
57 P->getExtTypeNum(0) == MVT::Flag ||
58 P->getExtTypeNum(0) == MVT::iPTR) &&
59 "Not a valid pattern node to size!");
60 unsigned Size = 3; // The node itself.
61 // If the root node is a ConstantSDNode, increases its size.
62 // e.g. (set R32:$dst, 0).
63 if (P->isLeaf() && dynamic_cast<IntInit*>(P->getLeafValue()))
66 // FIXME: This is a hack to statically increase the priority of patterns
67 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
68 // Later we can allow complexity / cost for each pattern to be (optionally)
69 // specified. To get best possible pattern match we'll need to dynamically
70 // calculate the complexity of all patterns a dag can potentially map to.
71 const ComplexPattern *AM = NodeGetComplexPattern(P, CGP);
73 Size += AM->getNumOperands() * 3;
75 // If this node has some predicate function that must match, it adds to the
76 // complexity of this node.
77 if (!P->getPredicateFn().empty())
80 // Count children in the count if they are also nodes.
81 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
82 TreePatternNode *Child = P->getChild(i);
83 if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
84 Size += getPatternSize(Child, CGP);
85 else if (Child->isLeaf()) {
86 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
87 Size += 5; // Matches a ConstantSDNode (+3) and a specific value (+2).
88 else if (NodeIsComplexPattern(Child))
89 Size += getPatternSize(Child, CGP);
90 else if (!Child->getPredicateFn().empty())
98 /// getResultPatternCost - Compute the number of instructions for this pattern.
99 /// This is a temporary hack. We should really include the instruction
100 /// latencies in this calculation.
101 static unsigned getResultPatternCost(TreePatternNode *P,
102 CodeGenDAGPatterns &CGP) {
103 if (P->isLeaf()) return 0;
106 Record *Op = P->getOperator();
107 if (Op->isSubClassOf("Instruction")) {
109 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op->getName());
110 if (II.usesCustomDAGSchedInserter)
113 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
114 Cost += getResultPatternCost(P->getChild(i), CGP);
118 /// getResultPatternCodeSize - Compute the code size of instructions for this
120 static unsigned getResultPatternSize(TreePatternNode *P,
121 CodeGenDAGPatterns &CGP) {
122 if (P->isLeaf()) return 0;
125 Record *Op = P->getOperator();
126 if (Op->isSubClassOf("Instruction")) {
127 Cost += Op->getValueAsInt("CodeSize");
129 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
130 Cost += getResultPatternSize(P->getChild(i), CGP);
134 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
135 // In particular, we want to match maximal patterns first and lowest cost within
136 // a particular complexity first.
137 struct PatternSortingPredicate {
138 PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {}
139 CodeGenDAGPatterns &CGP;
141 bool operator()(const PatternToMatch *LHS,
142 const PatternToMatch *RHS) {
143 unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), CGP);
144 unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), CGP);
145 LHSSize += LHS->getAddedComplexity();
146 RHSSize += RHS->getAddedComplexity();
147 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
148 if (LHSSize < RHSSize) return false;
150 // If the patterns have equal complexity, compare generated instruction cost
151 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP);
152 unsigned RHSCost = getResultPatternCost(RHS->getDstPattern(), CGP);
153 if (LHSCost < RHSCost) return true;
154 if (LHSCost > RHSCost) return false;
156 return getResultPatternSize(LHS->getDstPattern(), CGP) <
157 getResultPatternSize(RHS->getDstPattern(), CGP);
161 /// getRegisterValueType - Look up and return the first ValueType of specified
162 /// RegisterClass record
163 static MVT::SimpleValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
164 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
165 return RC->getValueTypeNum(0);
170 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
171 /// type information from it.
172 static void RemoveAllTypes(TreePatternNode *N) {
175 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
176 RemoveAllTypes(N->getChild(i));
179 /// NodeHasProperty - return true if TreePatternNode has the specified
181 static bool NodeHasProperty(TreePatternNode *N, SDNP Property,
182 CodeGenDAGPatterns &CGP) {
184 const ComplexPattern *CP = NodeGetComplexPattern(N, CGP);
186 return CP->hasProperty(Property);
189 Record *Operator = N->getOperator();
190 if (!Operator->isSubClassOf("SDNode")) return false;
192 return CGP.getSDNodeInfo(Operator).hasProperty(Property);
195 static bool PatternHasProperty(TreePatternNode *N, SDNP Property,
196 CodeGenDAGPatterns &CGP) {
197 if (NodeHasProperty(N, Property, CGP))
200 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
201 TreePatternNode *Child = N->getChild(i);
202 if (PatternHasProperty(Child, Property, CGP))
209 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) {
210 return CGP.getSDNodeInfo(Op).getEnumName();
214 bool DisablePatternForFastISel(TreePatternNode *N, CodeGenDAGPatterns &CGP) {
215 bool isStore = !N->isLeaf() &&
216 getOpcodeName(N->getOperator(), CGP) == "ISD::STORE";
217 if (!isStore && NodeHasProperty(N, SDNPHasChain, CGP))
220 bool HasChain = false;
221 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
222 TreePatternNode *Child = N->getChild(i);
223 if (PatternHasProperty(Child, SDNPHasChain, CGP)) {
231 //===----------------------------------------------------------------------===//
232 // Node Transformation emitter implementation.
234 void DAGISelEmitter::EmitNodeTransforms(std::ostream &OS) {
235 // Walk the pattern fragments, adding them to a map, which sorts them by
237 typedef std::map<std::string, CodeGenDAGPatterns::NodeXForm> NXsByNameTy;
238 NXsByNameTy NXsByName;
240 for (CodeGenDAGPatterns::nx_iterator I = CGP.nx_begin(), E = CGP.nx_end();
242 NXsByName.insert(std::make_pair(I->first->getName(), I->second));
244 OS << "\n// Node transformations.\n";
246 for (NXsByNameTy::iterator I = NXsByName.begin(), E = NXsByName.end();
248 Record *SDNode = I->second.first;
249 std::string Code = I->second.second;
251 if (Code.empty()) continue; // Empty code? Skip it.
253 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName();
254 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
256 OS << "inline SDOperand Transform_" << I->first << "(SDNode *" << C2
258 if (ClassName != "SDNode")
259 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
260 OS << Code << "\n}\n";
264 //===----------------------------------------------------------------------===//
265 // Predicate emitter implementation.
268 void DAGISelEmitter::EmitPredicateFunctions(std::ostream &OS) {
269 OS << "\n// Predicate functions.\n";
271 // Walk the pattern fragments, adding them to a map, which sorts them by
273 typedef std::map<std::string, std::pair<Record*, TreePattern*> > PFsByNameTy;
274 PFsByNameTy PFsByName;
276 for (CodeGenDAGPatterns::pf_iterator I = CGP.pf_begin(), E = CGP.pf_end();
278 PFsByName.insert(std::make_pair(I->first->getName(), *I));
281 for (PFsByNameTy::iterator I = PFsByName.begin(), E = PFsByName.end();
283 Record *PatFragRecord = I->second.first;// Record that derives from PatFrag.
284 TreePattern *P = I->second.second;
286 // If there is a code init for this fragment, emit the predicate code.
287 std::string Code = PatFragRecord->getValueAsCode("Predicate");
288 if (Code.empty()) continue;
290 if (P->getOnlyTree()->isLeaf())
291 OS << "inline bool Predicate_" << PatFragRecord->getName()
292 << "(SDNode *N) {\n";
294 std::string ClassName =
295 CGP.getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
296 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
298 OS << "inline bool Predicate_" << PatFragRecord->getName()
299 << "(SDNode *" << C2 << ") {\n";
300 if (ClassName != "SDNode")
301 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
303 OS << Code << "\n}\n";
310 //===----------------------------------------------------------------------===//
311 // PatternCodeEmitter implementation.
313 class PatternCodeEmitter {
315 CodeGenDAGPatterns &CGP;
318 ListInit *Predicates;
321 // Instruction selector pattern.
322 TreePatternNode *Pattern;
323 // Matched instruction.
324 TreePatternNode *Instruction;
326 // Node to name mapping
327 std::map<std::string, std::string> VariableMap;
328 // Node to operator mapping
329 std::map<std::string, Record*> OperatorMap;
330 // Name of the folded node which produces a flag.
331 std::pair<std::string, unsigned> FoldedFlag;
332 // Names of all the folded nodes which produce chains.
333 std::vector<std::pair<std::string, unsigned> > FoldedChains;
334 // Original input chain(s).
335 std::vector<std::pair<std::string, std::string> > OrigChains;
336 std::set<std::string> Duplicates;
338 /// LSI - Load/Store information.
339 /// Save loads/stores matched by a pattern, and generate a MemOperandSDNode
340 /// for each memory access. This facilitates the use of AliasAnalysis in
342 std::vector<std::string> LSI;
344 /// GeneratedCode - This is the buffer that we emit code to. The first int
345 /// indicates whether this is an exit predicate (something that should be
346 /// tested, and if true, the match fails) [when 1], or normal code to emit
347 /// [when 0], or initialization code to emit [when 2].
348 std::vector<std::pair<unsigned, std::string> > &GeneratedCode;
349 /// GeneratedDecl - This is the set of all SDOperand declarations needed for
350 /// the set of patterns for each top-level opcode.
351 std::set<std::string> &GeneratedDecl;
352 /// TargetOpcodes - The target specific opcodes used by the resulting
354 std::vector<std::string> &TargetOpcodes;
355 std::vector<std::string> &TargetVTs;
356 /// OutputIsVariadic - Records whether the instruction output pattern uses
357 /// variable_ops. This requires that the Emit function be passed an
358 /// additional argument to indicate where the input varargs operands
360 bool &OutputIsVariadic;
361 /// NumInputRootOps - Records the number of operands the root node of the
362 /// input pattern has. This information is used in the generated code to
363 /// pass to Emit functions when variable_ops processing is needed.
364 unsigned &NumInputRootOps;
366 std::string ChainName;
371 void emitCheck(const std::string &S) {
373 GeneratedCode.push_back(std::make_pair(1, S));
375 void emitCode(const std::string &S) {
377 GeneratedCode.push_back(std::make_pair(0, S));
379 void emitInit(const std::string &S) {
381 GeneratedCode.push_back(std::make_pair(2, S));
383 void emitDecl(const std::string &S) {
384 assert(!S.empty() && "Invalid declaration");
385 GeneratedDecl.insert(S);
387 void emitOpcode(const std::string &Opc) {
388 TargetOpcodes.push_back(Opc);
391 void emitVT(const std::string &VT) {
392 TargetVTs.push_back(VT);
396 PatternCodeEmitter(CodeGenDAGPatterns &cgp, ListInit *preds,
397 TreePatternNode *pattern, TreePatternNode *instr,
398 std::vector<std::pair<unsigned, std::string> > &gc,
399 std::set<std::string> &gd,
400 std::vector<std::string> &to,
401 std::vector<std::string> &tv,
404 : CGP(cgp), Predicates(preds), Pattern(pattern), Instruction(instr),
405 GeneratedCode(gc), GeneratedDecl(gd),
406 TargetOpcodes(to), TargetVTs(tv),
407 OutputIsVariadic(oiv), NumInputRootOps(niro),
408 TmpNo(0), OpcNo(0), VTNo(0) {}
410 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
411 /// if the match fails. At this point, we already know that the opcode for N
412 /// matches, and the SDNode for the result has the RootName specified name.
413 void EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
414 const std::string &RootName, const std::string &ChainSuffix,
417 // Save loads/stores matched by a pattern.
418 if (!N->isLeaf() && N->getName().empty()) {
419 if (NodeHasProperty(N, SDNPMemOperand, CGP))
420 LSI.push_back(RootName);
423 bool isRoot = (P == NULL);
424 // Emit instruction predicates. Each predicate is just a string for now.
426 // Record input varargs info.
427 NumInputRootOps = N->getNumChildren();
429 if (DisablePatternForFastISel(N, CGP))
430 emitCheck("!FastISel");
432 std::string PredicateCheck;
433 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
434 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
435 Record *Def = Pred->getDef();
436 if (!Def->isSubClassOf("Predicate")) {
440 assert(0 && "Unknown predicate type!");
442 if (!PredicateCheck.empty())
443 PredicateCheck += " && ";
444 PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
448 emitCheck(PredicateCheck);
452 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
453 emitCheck("cast<ConstantSDNode>(" + RootName +
454 ")->getSignExtended() == " + itostr(II->getValue()));
456 } else if (!NodeIsComplexPattern(N)) {
457 assert(0 && "Cannot match this as a leaf value!");
462 // If this node has a name associated with it, capture it in VariableMap. If
463 // we already saw this in the pattern, emit code to verify dagness.
464 if (!N->getName().empty()) {
465 std::string &VarMapEntry = VariableMap[N->getName()];
466 if (VarMapEntry.empty()) {
467 VarMapEntry = RootName;
469 // If we get here, this is a second reference to a specific name. Since
470 // we already have checked that the first reference is valid, we don't
471 // have to recursively match it, just check that it's the same as the
472 // previously named thing.
473 emitCheck(VarMapEntry + " == " + RootName);
478 OperatorMap[N->getName()] = N->getOperator();
482 // Emit code to load the child nodes and match their contents recursively.
484 bool NodeHasChain = NodeHasProperty (N, SDNPHasChain, CGP);
485 bool HasChain = PatternHasProperty(N, SDNPHasChain, CGP);
486 bool EmittedUseCheck = false;
491 // Multiple uses of actual result?
492 emitCheck(RootName + ".hasOneUse()");
493 EmittedUseCheck = true;
495 // If the immediate use can somehow reach this node through another
496 // path, then can't fold it either or it will create a cycle.
497 // e.g. In the following diagram, XX can reach ld through YY. If
498 // ld is folded into XX, then YY is both a predecessor and a successor
508 bool NeedCheck = P != Pattern;
510 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(P->getOperator());
512 P->getOperator() == CGP.get_intrinsic_void_sdnode() ||
513 P->getOperator() == CGP.get_intrinsic_w_chain_sdnode() ||
514 P->getOperator() == CGP.get_intrinsic_wo_chain_sdnode() ||
515 PInfo.getNumOperands() > 1 ||
516 PInfo.hasProperty(SDNPHasChain) ||
517 PInfo.hasProperty(SDNPInFlag) ||
518 PInfo.hasProperty(SDNPOptInFlag);
522 std::string ParentName(RootName.begin(), RootName.end()-1);
523 emitCheck("CanBeFoldedBy(" + RootName + ".Val, " + ParentName +
531 emitCheck("(" + ChainName + ".Val == " + RootName + ".Val || "
532 "IsChainCompatible(" + ChainName + ".Val, " +
533 RootName + ".Val))");
534 OrigChains.push_back(std::make_pair(ChainName, RootName));
537 ChainName = "Chain" + ChainSuffix;
538 emitInit("SDOperand " + ChainName + " = " + RootName +
543 // Don't fold any node which reads or writes a flag and has multiple uses.
544 // FIXME: We really need to separate the concepts of flag and "glue". Those
545 // real flag results, e.g. X86CMP output, can have multiple uses.
546 // FIXME: If the optional incoming flag does not exist. Then it is ok to
549 (PatternHasProperty(N, SDNPInFlag, CGP) ||
550 PatternHasProperty(N, SDNPOptInFlag, CGP) ||
551 PatternHasProperty(N, SDNPOutFlag, CGP))) {
552 if (!EmittedUseCheck) {
553 // Multiple uses of actual result?
554 emitCheck(RootName + ".hasOneUse()");
558 // If there is a node predicate for this, emit the call.
559 if (!N->getPredicateFn().empty())
560 emitCheck(N->getPredicateFn() + "(" + RootName + ".Val)");
563 // If this is an 'and R, 1234' where the operation is AND/OR and the RHS is
564 // a constant without a predicate fn that has more that one bit set, handle
565 // this as a special case. This is usually for targets that have special
566 // handling of certain large constants (e.g. alpha with it's 8/16/32-bit
567 // handling stuff). Using these instructions is often far more efficient
568 // than materializing the constant. Unfortunately, both the instcombiner
569 // and the dag combiner can often infer that bits are dead, and thus drop
570 // them from the mask in the dag. For example, it might turn 'AND X, 255'
571 // into 'AND X, 254' if it knows the low bit is set. Emit code that checks
574 (N->getOperator()->getName() == "and" ||
575 N->getOperator()->getName() == "or") &&
576 N->getChild(1)->isLeaf() &&
577 N->getChild(1)->getPredicateFn().empty()) {
578 if (IntInit *II = dynamic_cast<IntInit*>(N->getChild(1)->getLeafValue())) {
579 if (!isPowerOf2_32(II->getValue())) { // Don't bother with single bits.
580 emitInit("SDOperand " + RootName + "0" + " = " +
581 RootName + ".getOperand(" + utostr(0) + ");");
582 emitInit("SDOperand " + RootName + "1" + " = " +
583 RootName + ".getOperand(" + utostr(1) + ");");
585 emitCheck("isa<ConstantSDNode>(" + RootName + "1)");
586 const char *MaskPredicate = N->getOperator()->getName() == "or"
587 ? "CheckOrMask(" : "CheckAndMask(";
588 emitCheck(MaskPredicate + RootName + "0, cast<ConstantSDNode>(" +
589 RootName + "1), " + itostr(II->getValue()) + ")");
591 EmitChildMatchCode(N->getChild(0), N, RootName + utostr(0), RootName,
592 ChainSuffix + utostr(0), FoundChain);
598 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
599 emitInit("SDOperand " + RootName + utostr(OpNo) + " = " +
600 RootName + ".getOperand(" +utostr(OpNo) + ");");
602 EmitChildMatchCode(N->getChild(i), N, RootName + utostr(OpNo), RootName,
603 ChainSuffix + utostr(OpNo), FoundChain);
606 // Handle cases when root is a complex pattern.
607 const ComplexPattern *CP;
608 if (isRoot && N->isLeaf() && (CP = NodeGetComplexPattern(N, CGP))) {
609 std::string Fn = CP->getSelectFunc();
610 unsigned NumOps = CP->getNumOperands();
611 for (unsigned i = 0; i < NumOps; ++i) {
612 emitDecl("CPTmp" + utostr(i));
613 emitCode("SDOperand CPTmp" + utostr(i) + ";");
615 if (CP->hasProperty(SDNPHasChain)) {
616 emitDecl("CPInChain");
617 emitDecl("Chain" + ChainSuffix);
618 emitCode("SDOperand CPInChain;");
619 emitCode("SDOperand Chain" + ChainSuffix + ";");
622 std::string Code = Fn + "(" + RootName + ", " + RootName;
623 for (unsigned i = 0; i < NumOps; i++)
624 Code += ", CPTmp" + utostr(i);
625 if (CP->hasProperty(SDNPHasChain)) {
626 ChainName = "Chain" + ChainSuffix;
627 Code += ", CPInChain, Chain" + ChainSuffix;
629 emitCheck(Code + ")");
633 void EmitChildMatchCode(TreePatternNode *Child, TreePatternNode *Parent,
634 const std::string &RootName,
635 const std::string &ParentRootName,
636 const std::string &ChainSuffix, bool &FoundChain) {
637 if (!Child->isLeaf()) {
638 // If it's not a leaf, recursively match.
639 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(Child->getOperator());
640 emitCheck(RootName + ".getOpcode() == " +
641 CInfo.getEnumName());
642 EmitMatchCode(Child, Parent, RootName, ChainSuffix, FoundChain);
643 bool HasChain = false;
644 if (NodeHasProperty(Child, SDNPHasChain, CGP)) {
646 FoldedChains.push_back(std::make_pair(RootName, CInfo.getNumResults()));
648 if (NodeHasProperty(Child, SDNPOutFlag, CGP)) {
649 assert(FoldedFlag.first == "" && FoldedFlag.second == 0 &&
650 "Pattern folded multiple nodes which produce flags?");
651 FoldedFlag = std::make_pair(RootName,
652 CInfo.getNumResults() + (unsigned)HasChain);
655 // If this child has a name associated with it, capture it in VarMap. If
656 // we already saw this in the pattern, emit code to verify dagness.
657 if (!Child->getName().empty()) {
658 std::string &VarMapEntry = VariableMap[Child->getName()];
659 if (VarMapEntry.empty()) {
660 VarMapEntry = RootName;
662 // If we get here, this is a second reference to a specific name.
663 // Since we already have checked that the first reference is valid,
664 // we don't have to recursively match it, just check that it's the
665 // same as the previously named thing.
666 emitCheck(VarMapEntry + " == " + RootName);
667 Duplicates.insert(RootName);
672 // Handle leaves of various types.
673 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
674 Record *LeafRec = DI->getDef();
675 if (LeafRec->isSubClassOf("RegisterClass") ||
676 LeafRec->getName() == "ptr_rc") {
677 // Handle register references. Nothing to do here.
678 } else if (LeafRec->isSubClassOf("Register")) {
679 // Handle register references.
680 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
681 // Handle complex pattern.
682 const ComplexPattern *CP = NodeGetComplexPattern(Child, CGP);
683 std::string Fn = CP->getSelectFunc();
684 unsigned NumOps = CP->getNumOperands();
685 for (unsigned i = 0; i < NumOps; ++i) {
686 emitDecl("CPTmp" + utostr(i));
687 emitCode("SDOperand CPTmp" + utostr(i) + ";");
689 if (CP->hasProperty(SDNPHasChain)) {
690 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Parent->getOperator());
691 FoldedChains.push_back(std::make_pair("CPInChain",
692 PInfo.getNumResults()));
693 ChainName = "Chain" + ChainSuffix;
694 emitDecl("CPInChain");
696 emitCode("SDOperand CPInChain;");
697 emitCode("SDOperand " + ChainName + ";");
700 std::string Code = Fn + "(";
701 if (CP->hasAttribute(CPAttrParentAsRoot)) {
702 Code += ParentRootName + ", ";
706 if (CP->hasProperty(SDNPHasChain)) {
707 std::string ParentName(RootName.begin(), RootName.end()-1);
708 Code += ParentName + ", ";
711 for (unsigned i = 0; i < NumOps; i++)
712 Code += ", CPTmp" + utostr(i);
713 if (CP->hasProperty(SDNPHasChain))
714 Code += ", CPInChain, Chain" + ChainSuffix;
715 emitCheck(Code + ")");
716 } else if (LeafRec->getName() == "srcvalue") {
717 // Place holder for SRCVALUE nodes. Nothing to do here.
718 } else if (LeafRec->isSubClassOf("ValueType")) {
719 // Make sure this is the specified value type.
720 emitCheck("cast<VTSDNode>(" + RootName +
721 ")->getVT() == MVT::" + LeafRec->getName());
722 } else if (LeafRec->isSubClassOf("CondCode")) {
723 // Make sure this is the specified cond code.
724 emitCheck("cast<CondCodeSDNode>(" + RootName +
725 ")->get() == ISD::" + LeafRec->getName());
731 assert(0 && "Unknown leaf type!");
734 // If there is a node predicate for this, emit the call.
735 if (!Child->getPredicateFn().empty())
736 emitCheck(Child->getPredicateFn() + "(" + RootName +
738 } else if (IntInit *II =
739 dynamic_cast<IntInit*>(Child->getLeafValue())) {
740 emitCheck("isa<ConstantSDNode>(" + RootName + ")");
741 unsigned CTmp = TmpNo++;
742 emitCode("int64_t CN"+utostr(CTmp)+" = cast<ConstantSDNode>("+
743 RootName + ")->getSignExtended();");
745 emitCheck("CN" + utostr(CTmp) + " == " +itostr(II->getValue()));
750 assert(0 && "Unknown leaf type!");
755 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
756 /// we actually have to build a DAG!
757 std::vector<std::string>
758 EmitResultCode(TreePatternNode *N, std::vector<Record*> DstRegs,
759 bool InFlagDecled, bool ResNodeDecled,
760 bool LikeLeaf = false, bool isRoot = false) {
761 // List of arguments of getTargetNode() or SelectNodeTo().
762 std::vector<std::string> NodeOps;
763 // This is something selected from the pattern we matched.
764 if (!N->getName().empty()) {
765 const std::string &VarName = N->getName();
766 std::string Val = VariableMap[VarName];
767 bool ModifiedVal = false;
769 cerr << "Variable '" << VarName << " referenced but not defined "
770 << "and not caught earlier!\n";
773 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
774 // Already selected this operand, just return the tmpval.
775 NodeOps.push_back(Val);
779 const ComplexPattern *CP;
780 unsigned ResNo = TmpNo++;
781 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
782 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
783 std::string CastType;
784 std::string TmpVar = "Tmp" + utostr(ResNo);
785 switch (N->getTypeNum(0)) {
787 cerr << "Cannot handle " << getEnumName(N->getTypeNum(0))
788 << " type as an immediate constant. Aborting\n";
790 case MVT::i1: CastType = "bool"; break;
791 case MVT::i8: CastType = "unsigned char"; break;
792 case MVT::i16: CastType = "unsigned short"; break;
793 case MVT::i32: CastType = "unsigned"; break;
794 case MVT::i64: CastType = "uint64_t"; break;
796 emitCode("SDOperand " + TmpVar +
797 " = CurDAG->getTargetConstant(((" + CastType +
798 ") cast<ConstantSDNode>(" + Val + ")->getValue()), " +
799 getEnumName(N->getTypeNum(0)) + ");");
800 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
801 // value if used multiple times by this pattern result.
804 NodeOps.push_back(Val);
805 } else if (!N->isLeaf() && N->getOperator()->getName() == "fpimm") {
806 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
807 std::string TmpVar = "Tmp" + utostr(ResNo);
808 emitCode("SDOperand " + TmpVar +
809 " = CurDAG->getTargetConstantFP(cast<ConstantFPSDNode>(" +
810 Val + ")->getValueAPF(), cast<ConstantFPSDNode>(" + Val +
811 ")->getValueType(0));");
812 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
813 // value if used multiple times by this pattern result.
816 NodeOps.push_back(Val);
817 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
818 Record *Op = OperatorMap[N->getName()];
819 // Transform ExternalSymbol to TargetExternalSymbol
820 if (Op && Op->getName() == "externalsym") {
821 std::string TmpVar = "Tmp"+utostr(ResNo);
822 emitCode("SDOperand " + TmpVar + " = CurDAG->getTarget"
823 "ExternalSymbol(cast<ExternalSymbolSDNode>(" +
824 Val + ")->getSymbol(), " +
825 getEnumName(N->getTypeNum(0)) + ");");
826 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select
827 // this value if used multiple times by this pattern result.
831 NodeOps.push_back(Val);
832 } else if (!N->isLeaf() && (N->getOperator()->getName() == "tglobaladdr"
833 || N->getOperator()->getName() == "tglobaltlsaddr")) {
834 Record *Op = OperatorMap[N->getName()];
835 // Transform GlobalAddress to TargetGlobalAddress
836 if (Op && (Op->getName() == "globaladdr" ||
837 Op->getName() == "globaltlsaddr")) {
838 std::string TmpVar = "Tmp" + utostr(ResNo);
839 emitCode("SDOperand " + TmpVar + " = CurDAG->getTarget"
840 "GlobalAddress(cast<GlobalAddressSDNode>(" + Val +
841 ")->getGlobal(), " + getEnumName(N->getTypeNum(0)) +
843 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select
844 // this value if used multiple times by this pattern result.
848 NodeOps.push_back(Val);
849 } else if (!N->isLeaf()
850 && (N->getOperator()->getName() == "texternalsym"
851 || N->getOperator()->getName() == "tconstpool")) {
852 // Do not rewrite the variable name, since we don't generate a new
854 NodeOps.push_back(Val);
855 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, CGP))) {
856 for (unsigned i = 0; i < CP->getNumOperands(); ++i) {
857 emitCode("AddToISelQueue(CPTmp" + utostr(i) + ");");
858 NodeOps.push_back("CPTmp" + utostr(i));
861 // This node, probably wrapped in a SDNodeXForm, behaves like a leaf
862 // node even if it isn't one. Don't select it.
864 emitCode("AddToISelQueue(" + Val + ");");
865 if (isRoot && N->isLeaf()) {
866 emitCode("ReplaceUses(N, " + Val + ");");
867 emitCode("return NULL;");
870 NodeOps.push_back(Val);
874 VariableMap[VarName] = Val;
879 // If this is an explicit register reference, handle it.
880 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
881 unsigned ResNo = TmpNo++;
882 if (DI->getDef()->isSubClassOf("Register")) {
883 emitCode("SDOperand Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" +
884 getQualifiedName(DI->getDef()) + ", " +
885 getEnumName(N->getTypeNum(0)) + ");");
886 NodeOps.push_back("Tmp" + utostr(ResNo));
888 } else if (DI->getDef()->getName() == "zero_reg") {
889 emitCode("SDOperand Tmp" + utostr(ResNo) +
890 " = CurDAG->getRegister(0, " +
891 getEnumName(N->getTypeNum(0)) + ");");
892 NodeOps.push_back("Tmp" + utostr(ResNo));
895 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
896 unsigned ResNo = TmpNo++;
897 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
898 emitCode("SDOperand Tmp" + utostr(ResNo) +
899 " = CurDAG->getTargetConstant(0x" + itohexstr(II->getValue()) +
900 "ULL, " + getEnumName(N->getTypeNum(0)) + ");");
901 NodeOps.push_back("Tmp" + utostr(ResNo));
908 assert(0 && "Unknown leaf type!");
912 Record *Op = N->getOperator();
913 if (Op->isSubClassOf("Instruction")) {
914 const CodeGenTarget &CGT = CGP.getTargetInfo();
915 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
916 const DAGInstruction &Inst = CGP.getInstruction(Op);
917 const TreePattern *InstPat = Inst.getPattern();
918 // FIXME: Assume actual pattern comes before "implicit".
919 TreePatternNode *InstPatNode =
920 isRoot ? (InstPat ? InstPat->getTree(0) : Pattern)
921 : (InstPat ? InstPat->getTree(0) : NULL);
922 if (InstPatNode && InstPatNode->getOperator()->getName() == "set") {
923 InstPatNode = InstPatNode->getChild(InstPatNode->getNumChildren()-1);
925 bool IsVariadic = isRoot && II.isVariadic;
926 // FIXME: fix how we deal with physical register operands.
927 bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0;
928 bool HasImpResults = isRoot && DstRegs.size() > 0;
929 bool NodeHasOptInFlag = isRoot &&
930 PatternHasProperty(Pattern, SDNPOptInFlag, CGP);
931 bool NodeHasInFlag = isRoot &&
932 PatternHasProperty(Pattern, SDNPInFlag, CGP);
933 bool NodeHasOutFlag = isRoot &&
934 PatternHasProperty(Pattern, SDNPOutFlag, CGP);
935 bool NodeHasChain = InstPatNode &&
936 PatternHasProperty(InstPatNode, SDNPHasChain, CGP);
937 bool InputHasChain = isRoot &&
938 NodeHasProperty(Pattern, SDNPHasChain, CGP);
939 unsigned NumResults = Inst.getNumResults();
940 unsigned NumDstRegs = HasImpResults ? DstRegs.size() : 0;
942 // Record output varargs info.
943 OutputIsVariadic = IsVariadic;
945 if (NodeHasOptInFlag) {
946 emitCode("bool HasInFlag = "
947 "(N.getOperand(N.getNumOperands()-1).getValueType() == MVT::Flag);");
950 emitCode("SmallVector<SDOperand, 8> Ops" + utostr(OpcNo) + ";");
952 // How many results is this pattern expected to produce?
953 unsigned NumPatResults = 0;
954 for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
955 MVT::SimpleValueType VT = Pattern->getTypeNum(i);
956 if (VT != MVT::isVoid && VT != MVT::Flag)
960 if (OrigChains.size() > 0) {
961 // The original input chain is being ignored. If it is not just
962 // pointing to the op that's being folded, we should create a
963 // TokenFactor with it and the chain of the folded op as the new chain.
964 // We could potentially be doing multiple levels of folding, in that
965 // case, the TokenFactor can have more operands.
966 emitCode("SmallVector<SDOperand, 8> InChains;");
967 for (unsigned i = 0, e = OrigChains.size(); i < e; ++i) {
968 emitCode("if (" + OrigChains[i].first + ".Val != " +
969 OrigChains[i].second + ".Val) {");
970 emitCode(" AddToISelQueue(" + OrigChains[i].first + ");");
971 emitCode(" InChains.push_back(" + OrigChains[i].first + ");");
974 emitCode("AddToISelQueue(" + ChainName + ");");
975 emitCode("InChains.push_back(" + ChainName + ");");
976 emitCode(ChainName + " = CurDAG->getNode(ISD::TokenFactor, MVT::Other, "
977 "&InChains[0], InChains.size());");
980 // Loop over all of the operands of the instruction pattern, emitting code
981 // to fill them all in. The node 'N' usually has number children equal to
982 // the number of input operands of the instruction. However, in cases
983 // where there are predicate operands for an instruction, we need to fill
984 // in the 'execute always' values. Match up the node operands to the
985 // instruction operands to do this.
986 std::vector<std::string> AllOps;
987 for (unsigned ChildNo = 0, InstOpNo = NumResults;
988 InstOpNo != II.OperandList.size(); ++InstOpNo) {
989 std::vector<std::string> Ops;
991 // Determine what to emit for this operand.
992 Record *OperandNode = II.OperandList[InstOpNo].Rec;
993 if ((OperandNode->isSubClassOf("PredicateOperand") ||
994 OperandNode->isSubClassOf("OptionalDefOperand")) &&
995 !CGP.getDefaultOperand(OperandNode).DefaultOps.empty()) {
996 // This is a predicate or optional def operand; emit the
997 // 'default ops' operands.
998 const DAGDefaultOperand &DefaultOp =
999 CGP.getDefaultOperand(II.OperandList[InstOpNo].Rec);
1000 for (unsigned i = 0, e = DefaultOp.DefaultOps.size(); i != e; ++i) {
1001 Ops = EmitResultCode(DefaultOp.DefaultOps[i], DstRegs,
1002 InFlagDecled, ResNodeDecled);
1003 AllOps.insert(AllOps.end(), Ops.begin(), Ops.end());
1006 // Otherwise this is a normal operand or a predicate operand without
1007 // 'execute always'; emit it.
1008 Ops = EmitResultCode(N->getChild(ChildNo), DstRegs,
1009 InFlagDecled, ResNodeDecled);
1010 AllOps.insert(AllOps.end(), Ops.begin(), Ops.end());
1015 // Emit all the chain and CopyToReg stuff.
1016 bool ChainEmitted = NodeHasChain;
1018 emitCode("AddToISelQueue(" + ChainName + ");");
1019 if (NodeHasInFlag || HasImpInputs)
1020 EmitInFlagSelectCode(Pattern, "N", ChainEmitted,
1021 InFlagDecled, ResNodeDecled, true);
1022 if (NodeHasOptInFlag || NodeHasInFlag || HasImpInputs) {
1023 if (!InFlagDecled) {
1024 emitCode("SDOperand InFlag(0, 0);");
1025 InFlagDecled = true;
1027 if (NodeHasOptInFlag) {
1028 emitCode("if (HasInFlag) {");
1029 emitCode(" InFlag = N.getOperand(N.getNumOperands()-1);");
1030 emitCode(" AddToISelQueue(InFlag);");
1035 unsigned ResNo = TmpNo++;
1036 if (!isRoot || InputHasChain || NodeHasChain || NodeHasOutFlag ||
1037 NodeHasOptInFlag || HasImpResults) {
1040 std::string NodeName;
1042 NodeName = "Tmp" + utostr(ResNo);
1043 Code2 = "SDOperand " + NodeName + "(";
1045 NodeName = "ResNode";
1046 if (!ResNodeDecled) {
1047 Code2 = "SDNode *" + NodeName + " = ";
1048 ResNodeDecled = true;
1050 Code2 = NodeName + " = ";
1053 Code += "CurDAG->getTargetNode(Opc" + utostr(OpcNo);
1054 unsigned OpsNo = OpcNo;
1055 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
1057 // Output order: results, chain, flags
1059 if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid) {
1060 Code += ", VT" + utostr(VTNo);
1061 emitVT(getEnumName(N->getTypeNum(0)));
1063 // Add types for implicit results in physical registers, scheduler will
1064 // care of adding copyfromreg nodes.
1065 for (unsigned i = 0; i < NumDstRegs; i++) {
1066 Record *RR = DstRegs[i];
1067 if (RR->isSubClassOf("Register")) {
1068 MVT::SimpleValueType RVT = getRegisterValueType(RR, CGT);
1069 Code += ", " + getEnumName(RVT);
1073 Code += ", MVT::Other";
1075 Code += ", MVT::Flag";
1079 for (unsigned i = 0, e = AllOps.size(); i != e; ++i)
1080 emitCode("Ops" + utostr(OpsNo) + ".push_back(" + AllOps[i] + ");");
1083 // Figure out whether any operands at the end of the op list are not
1084 // part of the variable section.
1085 std::string EndAdjust;
1086 if (NodeHasInFlag || HasImpInputs)
1087 EndAdjust = "-1"; // Always has one flag.
1088 else if (NodeHasOptInFlag)
1089 EndAdjust = "-(HasInFlag?1:0)"; // May have a flag.
1091 emitCode("for (unsigned i = NumInputRootOps + " + utostr(NodeHasChain) +
1092 ", e = N.getNumOperands()" + EndAdjust + "; i != e; ++i) {");
1094 emitCode(" AddToISelQueue(N.getOperand(i));");
1095 emitCode(" Ops" + utostr(OpsNo) + ".push_back(N.getOperand(i));");
1099 // Generate MemOperandSDNodes nodes for each memory accesses covered by
1101 if (II.isSimpleLoad | II.mayLoad | II.mayStore) {
1102 std::vector<std::string>::const_iterator mi, mie;
1103 for (mi = LSI.begin(), mie = LSI.end(); mi != mie; ++mi) {
1104 emitCode("SDOperand LSI_" + *mi + " = "
1105 "CurDAG->getMemOperand(cast<MemSDNode>(" +
1106 *mi + ")->getMemOperand());");
1108 emitCode("Ops" + utostr(OpsNo) + ".push_back(LSI_" + *mi + ");");
1110 AllOps.push_back("LSI_" + *mi);
1116 emitCode("Ops" + utostr(OpsNo) + ".push_back(" + ChainName + ");");
1118 AllOps.push_back(ChainName);
1122 if (NodeHasInFlag || HasImpInputs)
1123 emitCode("Ops" + utostr(OpsNo) + ".push_back(InFlag);");
1124 else if (NodeHasOptInFlag) {
1125 emitCode("if (HasInFlag)");
1126 emitCode(" Ops" + utostr(OpsNo) + ".push_back(InFlag);");
1128 Code += ", &Ops" + utostr(OpsNo) + "[0], Ops" + utostr(OpsNo) +
1130 } else if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs)
1131 AllOps.push_back("InFlag");
1133 unsigned NumOps = AllOps.size();
1135 if (!NodeHasOptInFlag && NumOps < 4) {
1136 for (unsigned i = 0; i != NumOps; ++i)
1137 Code += ", " + AllOps[i];
1139 std::string OpsCode = "SDOperand Ops" + utostr(OpsNo) + "[] = { ";
1140 for (unsigned i = 0; i != NumOps; ++i) {
1141 OpsCode += AllOps[i];
1145 emitCode(OpsCode + " };");
1146 Code += ", Ops" + utostr(OpsNo) + ", ";
1147 if (NodeHasOptInFlag) {
1148 Code += "HasInFlag ? ";
1149 Code += utostr(NumOps) + " : " + utostr(NumOps-1);
1151 Code += utostr(NumOps);
1157 emitCode(Code2 + Code + ");");
1160 // Remember which op produces the chain.
1162 emitCode(ChainName + " = SDOperand(" + NodeName +
1163 ".Val, " + utostr(NumResults+NumDstRegs) + ");");
1165 emitCode(ChainName + " = SDOperand(" + NodeName +
1166 ", " + utostr(NumResults+NumDstRegs) + ");");
1170 NodeOps.push_back("Tmp" + utostr(ResNo));
1174 bool NeedReplace = false;
1175 if (NodeHasOutFlag) {
1176 if (!InFlagDecled) {
1177 emitCode("SDOperand InFlag(ResNode, " +
1178 utostr(NumResults+NumDstRegs+(unsigned)NodeHasChain) + ");");
1179 InFlagDecled = true;
1181 emitCode("InFlag = SDOperand(ResNode, " +
1182 utostr(NumResults+NumDstRegs+(unsigned)NodeHasChain) + ");");
1185 if (FoldedChains.size() > 0) {
1187 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
1188 emitCode("ReplaceUses(SDOperand(" +
1189 FoldedChains[j].first + ".Val, " +
1190 utostr(FoldedChains[j].second) + "), SDOperand(ResNode, " +
1191 utostr(NumResults+NumDstRegs) + "));");
1195 if (NodeHasOutFlag) {
1196 if (FoldedFlag.first != "") {
1197 emitCode("ReplaceUses(SDOperand(" + FoldedFlag.first + ".Val, " +
1198 utostr(FoldedFlag.second) + "), InFlag);");
1200 assert(NodeHasProperty(Pattern, SDNPOutFlag, CGP));
1201 emitCode("ReplaceUses(SDOperand(N.Val, " +
1202 utostr(NumPatResults + (unsigned)InputHasChain)
1208 if (NeedReplace && InputHasChain)
1209 emitCode("ReplaceUses(SDOperand(N.Val, " +
1210 utostr(NumPatResults) + "), SDOperand(" + ChainName
1211 + ".Val, " + ChainName + ".ResNo" + "));");
1213 // User does not expect the instruction would produce a chain!
1214 if ((!InputHasChain && NodeHasChain) && NodeHasOutFlag) {
1216 } else if (InputHasChain && !NodeHasChain) {
1217 // One of the inner node produces a chain.
1219 emitCode("ReplaceUses(SDOperand(N.Val, " + utostr(NumPatResults+1) +
1220 "), SDOperand(ResNode, N.ResNo-1));");
1221 emitCode("ReplaceUses(SDOperand(N.Val, " + utostr(NumPatResults) +
1222 "), " + ChainName + ");");
1225 emitCode("return ResNode;");
1227 std::string Code = "return CurDAG->SelectNodeTo(N.Val, Opc" +
1229 if (N->getTypeNum(0) != MVT::isVoid)
1230 Code += ", VT" + utostr(VTNo);
1232 Code += ", MVT::Flag";
1234 if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs)
1235 AllOps.push_back("InFlag");
1237 unsigned NumOps = AllOps.size();
1239 if (!NodeHasOptInFlag && NumOps < 4) {
1240 for (unsigned i = 0; i != NumOps; ++i)
1241 Code += ", " + AllOps[i];
1243 std::string OpsCode = "SDOperand Ops" + utostr(OpcNo) + "[] = { ";
1244 for (unsigned i = 0; i != NumOps; ++i) {
1245 OpsCode += AllOps[i];
1249 emitCode(OpsCode + " };");
1250 Code += ", Ops" + utostr(OpcNo) + ", ";
1251 Code += utostr(NumOps);
1254 emitCode(Code + ");");
1255 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
1256 if (N->getTypeNum(0) != MVT::isVoid)
1257 emitVT(getEnumName(N->getTypeNum(0)));
1261 } else if (Op->isSubClassOf("SDNodeXForm")) {
1262 assert(N->getNumChildren() == 1 && "node xform should have one child!");
1263 // PatLeaf node - the operand may or may not be a leaf node. But it should
1265 std::vector<std::string> Ops =
1266 EmitResultCode(N->getChild(0), DstRegs, InFlagDecled,
1267 ResNodeDecled, true);
1268 unsigned ResNo = TmpNo++;
1269 emitCode("SDOperand Tmp" + utostr(ResNo) + " = Transform_" + Op->getName()
1270 + "(" + Ops.back() + ".Val);");
1271 NodeOps.push_back("Tmp" + utostr(ResNo));
1273 emitCode("return Tmp" + utostr(ResNo) + ".Val;");
1278 throw std::string("Unknown node in result pattern!");
1282 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat'
1283 /// and add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
1284 /// 'Pat' may be missing types. If we find an unresolved type to add a check
1285 /// for, this returns true otherwise false if Pat has all types.
1286 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
1287 const std::string &Prefix, bool isRoot = false) {
1289 if (Pat->getExtTypes() != Other->getExtTypes()) {
1290 // Move a type over from 'other' to 'pat'.
1291 Pat->setTypes(Other->getExtTypes());
1292 // The top level node type is checked outside of the select function.
1294 emitCheck(Prefix + ".Val->getValueType(0) == " +
1295 getName(Pat->getTypeNum(0)));
1300 (unsigned) NodeHasProperty(Pat, SDNPHasChain, CGP);
1301 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
1302 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
1303 Prefix + utostr(OpNo)))
1309 /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is
1311 void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName,
1312 bool &ChainEmitted, bool &InFlagDecled,
1313 bool &ResNodeDecled, bool isRoot = false) {
1314 const CodeGenTarget &T = CGP.getTargetInfo();
1316 (unsigned) NodeHasProperty(N, SDNPHasChain, CGP);
1317 bool HasInFlag = NodeHasProperty(N, SDNPInFlag, CGP);
1318 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
1319 TreePatternNode *Child = N->getChild(i);
1320 if (!Child->isLeaf()) {
1321 EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted,
1322 InFlagDecled, ResNodeDecled);
1324 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1325 if (!Child->getName().empty()) {
1326 std::string Name = RootName + utostr(OpNo);
1327 if (Duplicates.find(Name) != Duplicates.end())
1328 // A duplicate! Do not emit a copy for this node.
1332 Record *RR = DI->getDef();
1333 if (RR->isSubClassOf("Register")) {
1334 MVT::SimpleValueType RVT = getRegisterValueType(RR, T);
1335 if (RVT == MVT::Flag) {
1336 if (!InFlagDecled) {
1337 emitCode("SDOperand InFlag = " + RootName + utostr(OpNo) + ";");
1338 InFlagDecled = true;
1340 emitCode("InFlag = " + RootName + utostr(OpNo) + ";");
1341 emitCode("AddToISelQueue(InFlag);");
1343 if (!ChainEmitted) {
1344 emitCode("SDOperand Chain = CurDAG->getEntryNode();");
1345 ChainName = "Chain";
1346 ChainEmitted = true;
1348 emitCode("AddToISelQueue(" + RootName + utostr(OpNo) + ");");
1349 if (!InFlagDecled) {
1350 emitCode("SDOperand InFlag(0, 0);");
1351 InFlagDecled = true;
1353 std::string Decl = (!ResNodeDecled) ? "SDNode *" : "";
1354 emitCode(Decl + "ResNode = CurDAG->getCopyToReg(" + ChainName +
1355 ", " + getQualifiedName(RR) +
1356 ", " + RootName + utostr(OpNo) + ", InFlag).Val;");
1357 ResNodeDecled = true;
1358 emitCode(ChainName + " = SDOperand(ResNode, 0);");
1359 emitCode("InFlag = SDOperand(ResNode, 1);");
1367 if (!InFlagDecled) {
1368 emitCode("SDOperand InFlag = " + RootName +
1369 ".getOperand(" + utostr(OpNo) + ");");
1370 InFlagDecled = true;
1372 emitCode("InFlag = " + RootName +
1373 ".getOperand(" + utostr(OpNo) + ");");
1374 emitCode("AddToISelQueue(InFlag);");
1379 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
1380 /// stream to match the pattern, and generate the code for the match if it
1381 /// succeeds. Returns true if the pattern is not guaranteed to match.
1382 void DAGISelEmitter::GenerateCodeForPattern(const PatternToMatch &Pattern,
1383 std::vector<std::pair<unsigned, std::string> > &GeneratedCode,
1384 std::set<std::string> &GeneratedDecl,
1385 std::vector<std::string> &TargetOpcodes,
1386 std::vector<std::string> &TargetVTs,
1387 bool &OutputIsVariadic,
1388 unsigned &NumInputRootOps) {
1389 OutputIsVariadic = false;
1390 NumInputRootOps = 0;
1392 PatternCodeEmitter Emitter(CGP, Pattern.getPredicates(),
1393 Pattern.getSrcPattern(), Pattern.getDstPattern(),
1394 GeneratedCode, GeneratedDecl,
1395 TargetOpcodes, TargetVTs,
1396 OutputIsVariadic, NumInputRootOps);
1398 // Emit the matcher, capturing named arguments in VariableMap.
1399 bool FoundChain = false;
1400 Emitter.EmitMatchCode(Pattern.getSrcPattern(), NULL, "N", "", FoundChain);
1402 // TP - Get *SOME* tree pattern, we don't care which.
1403 TreePattern &TP = *CGP.pf_begin()->second;
1405 // At this point, we know that we structurally match the pattern, but the
1406 // types of the nodes may not match. Figure out the fewest number of type
1407 // comparisons we need to emit. For example, if there is only one integer
1408 // type supported by a target, there should be no type comparisons at all for
1409 // integer patterns!
1411 // To figure out the fewest number of type checks needed, clone the pattern,
1412 // remove the types, then perform type inference on the pattern as a whole.
1413 // If there are unresolved types, emit an explicit check for those types,
1414 // apply the type to the tree, then rerun type inference. Iterate until all
1415 // types are resolved.
1417 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
1418 RemoveAllTypes(Pat);
1421 // Resolve/propagate as many types as possible.
1423 bool MadeChange = true;
1425 MadeChange = Pat->ApplyTypeConstraints(TP,
1426 true/*Ignore reg constraints*/);
1428 assert(0 && "Error: could not find consistent types for something we"
1429 " already decided was ok!");
1433 // Insert a check for an unresolved type and add it to the tree. If we find
1434 // an unresolved type to add a check for, this returns true and we iterate,
1435 // otherwise we are done.
1436 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N", true));
1438 Emitter.EmitResultCode(Pattern.getDstPattern(), Pattern.getDstRegs(),
1439 false, false, false, true);
1443 /// EraseCodeLine - Erase one code line from all of the patterns. If removing
1444 /// a line causes any of them to be empty, remove them and return true when
1446 static bool EraseCodeLine(std::vector<std::pair<const PatternToMatch*,
1447 std::vector<std::pair<unsigned, std::string> > > >
1449 bool ErasedPatterns = false;
1450 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1451 Patterns[i].second.pop_back();
1452 if (Patterns[i].second.empty()) {
1453 Patterns.erase(Patterns.begin()+i);
1455 ErasedPatterns = true;
1458 return ErasedPatterns;
1461 /// EmitPatterns - Emit code for at least one pattern, but try to group common
1462 /// code together between the patterns.
1463 void DAGISelEmitter::EmitPatterns(std::vector<std::pair<const PatternToMatch*,
1464 std::vector<std::pair<unsigned, std::string> > > >
1465 &Patterns, unsigned Indent,
1467 typedef std::pair<unsigned, std::string> CodeLine;
1468 typedef std::vector<CodeLine> CodeList;
1469 typedef std::vector<std::pair<const PatternToMatch*, CodeList> > PatternList;
1471 if (Patterns.empty()) return;
1473 // Figure out how many patterns share the next code line. Explicitly copy
1474 // FirstCodeLine so that we don't invalidate a reference when changing
1476 const CodeLine FirstCodeLine = Patterns.back().second.back();
1477 unsigned LastMatch = Patterns.size()-1;
1478 while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
1481 // If not all patterns share this line, split the list into two pieces. The
1482 // first chunk will use this line, the second chunk won't.
1483 if (LastMatch != 0) {
1484 PatternList Shared(Patterns.begin()+LastMatch, Patterns.end());
1485 PatternList Other(Patterns.begin(), Patterns.begin()+LastMatch);
1487 // FIXME: Emit braces?
1488 if (Shared.size() == 1) {
1489 const PatternToMatch &Pattern = *Shared.back().first;
1490 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
1491 Pattern.getSrcPattern()->print(OS);
1492 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
1493 Pattern.getDstPattern()->print(OS);
1495 unsigned AddedComplexity = Pattern.getAddedComplexity();
1496 OS << std::string(Indent, ' ') << "// Pattern complexity = "
1497 << getPatternSize(Pattern.getSrcPattern(), CGP) + AddedComplexity
1499 << getResultPatternCost(Pattern.getDstPattern(), CGP)
1501 << getResultPatternSize(Pattern.getDstPattern(), CGP) << "\n";
1503 if (FirstCodeLine.first != 1) {
1504 OS << std::string(Indent, ' ') << "{\n";
1507 EmitPatterns(Shared, Indent, OS);
1508 if (FirstCodeLine.first != 1) {
1510 OS << std::string(Indent, ' ') << "}\n";
1513 if (Other.size() == 1) {
1514 const PatternToMatch &Pattern = *Other.back().first;
1515 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
1516 Pattern.getSrcPattern()->print(OS);
1517 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
1518 Pattern.getDstPattern()->print(OS);
1520 unsigned AddedComplexity = Pattern.getAddedComplexity();
1521 OS << std::string(Indent, ' ') << "// Pattern complexity = "
1522 << getPatternSize(Pattern.getSrcPattern(), CGP) + AddedComplexity
1524 << getResultPatternCost(Pattern.getDstPattern(), CGP)
1526 << getResultPatternSize(Pattern.getDstPattern(), CGP) << "\n";
1528 EmitPatterns(Other, Indent, OS);
1532 // Remove this code from all of the patterns that share it.
1533 bool ErasedPatterns = EraseCodeLine(Patterns);
1535 bool isPredicate = FirstCodeLine.first == 1;
1537 // Otherwise, every pattern in the list has this line. Emit it.
1540 OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
1542 OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
1544 // If the next code line is another predicate, and if all of the pattern
1545 // in this group share the same next line, emit it inline now. Do this
1546 // until we run out of common predicates.
1547 while (!ErasedPatterns && Patterns.back().second.back().first == 1) {
1548 // Check that all of fhe patterns in Patterns end with the same predicate.
1549 bool AllEndWithSamePredicate = true;
1550 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
1551 if (Patterns[i].second.back() != Patterns.back().second.back()) {
1552 AllEndWithSamePredicate = false;
1555 // If all of the predicates aren't the same, we can't share them.
1556 if (!AllEndWithSamePredicate) break;
1558 // Otherwise we can. Emit it shared now.
1559 OS << " &&\n" << std::string(Indent+4, ' ')
1560 << Patterns.back().second.back().second;
1561 ErasedPatterns = EraseCodeLine(Patterns);
1568 EmitPatterns(Patterns, Indent, OS);
1571 OS << std::string(Indent-2, ' ') << "}\n";
1574 static std::string getLegalCName(std::string OpName) {
1575 std::string::size_type pos = OpName.find("::");
1576 if (pos != std::string::npos)
1577 OpName.replace(pos, 2, "_");
1581 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
1582 const CodeGenTarget &Target = CGP.getTargetInfo();
1584 // Get the namespace to insert instructions into. Make sure not to pick up
1585 // "TargetInstrInfo" by accidentally getting the namespace off the PHI
1586 // instruction or something.
1588 for (CodeGenTarget::inst_iterator i = Target.inst_begin(),
1589 e = Target.inst_end(); i != e; ++i) {
1590 InstNS = i->second.Namespace;
1591 if (InstNS != "TargetInstrInfo")
1595 if (!InstNS.empty()) InstNS += "::";
1597 // Group the patterns by their top-level opcodes.
1598 std::map<std::string, std::vector<const PatternToMatch*> > PatternsByOpcode;
1599 // All unique target node emission functions.
1600 std::map<std::string, unsigned> EmitFunctions;
1601 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
1602 E = CGP.ptm_end(); I != E; ++I) {
1603 const PatternToMatch &Pattern = *I;
1605 TreePatternNode *Node = Pattern.getSrcPattern();
1606 if (!Node->isLeaf()) {
1607 PatternsByOpcode[getOpcodeName(Node->getOperator(), CGP)].
1608 push_back(&Pattern);
1610 const ComplexPattern *CP;
1611 if (dynamic_cast<IntInit*>(Node->getLeafValue())) {
1612 PatternsByOpcode[getOpcodeName(CGP.getSDNodeNamed("imm"), CGP)].
1613 push_back(&Pattern);
1614 } else if ((CP = NodeGetComplexPattern(Node, CGP))) {
1615 std::vector<Record*> OpNodes = CP->getRootNodes();
1616 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
1617 PatternsByOpcode[getOpcodeName(OpNodes[j], CGP)]
1618 .insert(PatternsByOpcode[getOpcodeName(OpNodes[j], CGP)].begin(),
1622 cerr << "Unrecognized opcode '";
1624 cerr << "' on tree pattern '";
1625 cerr << Pattern.getDstPattern()->getOperator()->getName() << "'!\n";
1631 // For each opcode, there might be multiple select functions, one per
1632 // ValueType of the node (or its first operand if it doesn't produce a
1633 // non-chain result.
1634 std::map<std::string, std::vector<std::string> > OpcodeVTMap;
1636 // Emit one Select_* method for each top-level opcode. We do this instead of
1637 // emitting one giant switch statement to support compilers where this will
1638 // result in the recursive functions taking less stack space.
1639 for (std::map<std::string, std::vector<const PatternToMatch*> >::iterator
1640 PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end();
1641 PBOI != E; ++PBOI) {
1642 const std::string &OpName = PBOI->first;
1643 std::vector<const PatternToMatch*> &PatternsOfOp = PBOI->second;
1644 assert(!PatternsOfOp.empty() && "No patterns but map has entry?");
1646 // We want to emit all of the matching code now. However, we want to emit
1647 // the matches in order of minimal cost. Sort the patterns so the least
1648 // cost one is at the start.
1649 std::stable_sort(PatternsOfOp.begin(), PatternsOfOp.end(),
1650 PatternSortingPredicate(CGP));
1652 // Split them into groups by type.
1653 std::map<MVT::SimpleValueType,
1654 std::vector<const PatternToMatch*> > PatternsByType;
1655 for (unsigned i = 0, e = PatternsOfOp.size(); i != e; ++i) {
1656 const PatternToMatch *Pat = PatternsOfOp[i];
1657 TreePatternNode *SrcPat = Pat->getSrcPattern();
1658 MVT::SimpleValueType VT = SrcPat->getTypeNum(0);
1659 std::map<MVT::SimpleValueType,
1660 std::vector<const PatternToMatch*> >::iterator TI =
1661 PatternsByType.find(VT);
1662 if (TI != PatternsByType.end())
1663 TI->second.push_back(Pat);
1665 std::vector<const PatternToMatch*> PVec;
1666 PVec.push_back(Pat);
1667 PatternsByType.insert(std::make_pair(VT, PVec));
1671 for (std::map<MVT::SimpleValueType,
1672 std::vector<const PatternToMatch*> >::iterator
1673 II = PatternsByType.begin(), EE = PatternsByType.end(); II != EE;
1675 MVT::SimpleValueType OpVT = II->first;
1676 std::vector<const PatternToMatch*> &Patterns = II->second;
1677 typedef std::vector<std::pair<unsigned,std::string> > CodeList;
1678 typedef std::vector<std::pair<unsigned,std::string> >::iterator CodeListI;
1680 std::vector<std::pair<const PatternToMatch*, CodeList> > CodeForPatterns;
1681 std::vector<std::vector<std::string> > PatternOpcodes;
1682 std::vector<std::vector<std::string> > PatternVTs;
1683 std::vector<std::set<std::string> > PatternDecls;
1684 std::vector<bool> OutputIsVariadicFlags;
1685 std::vector<unsigned> NumInputRootOpsCounts;
1686 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1687 CodeList GeneratedCode;
1688 std::set<std::string> GeneratedDecl;
1689 std::vector<std::string> TargetOpcodes;
1690 std::vector<std::string> TargetVTs;
1691 bool OutputIsVariadic;
1692 unsigned NumInputRootOps;
1693 GenerateCodeForPattern(*Patterns[i], GeneratedCode, GeneratedDecl,
1694 TargetOpcodes, TargetVTs,
1695 OutputIsVariadic, NumInputRootOps);
1696 CodeForPatterns.push_back(std::make_pair(Patterns[i], GeneratedCode));
1697 PatternDecls.push_back(GeneratedDecl);
1698 PatternOpcodes.push_back(TargetOpcodes);
1699 PatternVTs.push_back(TargetVTs);
1700 OutputIsVariadicFlags.push_back(OutputIsVariadic);
1701 NumInputRootOpsCounts.push_back(NumInputRootOps);
1704 // Scan the code to see if all of the patterns are reachable and if it is
1705 // possible that the last one might not match.
1706 bool mightNotMatch = true;
1707 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1708 CodeList &GeneratedCode = CodeForPatterns[i].second;
1709 mightNotMatch = false;
1711 for (unsigned j = 0, e = GeneratedCode.size(); j != e; ++j) {
1712 if (GeneratedCode[j].first == 1) { // predicate.
1713 mightNotMatch = true;
1718 // If this pattern definitely matches, and if it isn't the last one, the
1719 // patterns after it CANNOT ever match. Error out.
1720 if (mightNotMatch == false && i != CodeForPatterns.size()-1) {
1721 cerr << "Pattern '";
1722 CodeForPatterns[i].first->getSrcPattern()->print(*cerr.stream());
1723 cerr << "' is impossible to select!\n";
1728 // Factor target node emission code (emitted by EmitResultCode) into
1729 // separate functions. Uniquing and share them among all instruction
1730 // selection routines.
1731 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1732 CodeList &GeneratedCode = CodeForPatterns[i].second;
1733 std::vector<std::string> &TargetOpcodes = PatternOpcodes[i];
1734 std::vector<std::string> &TargetVTs = PatternVTs[i];
1735 std::set<std::string> Decls = PatternDecls[i];
1736 bool OutputIsVariadic = OutputIsVariadicFlags[i];
1737 unsigned NumInputRootOps = NumInputRootOpsCounts[i];
1738 std::vector<std::string> AddedInits;
1739 int CodeSize = (int)GeneratedCode.size();
1741 for (int j = CodeSize-1; j >= 0; --j) {
1742 if (LastPred == -1 && GeneratedCode[j].first == 1)
1744 else if (LastPred != -1 && GeneratedCode[j].first == 2)
1745 AddedInits.push_back(GeneratedCode[j].second);
1748 std::string CalleeCode = "(const SDOperand &N";
1749 std::string CallerCode = "(N";
1750 for (unsigned j = 0, e = TargetOpcodes.size(); j != e; ++j) {
1751 CalleeCode += ", unsigned Opc" + utostr(j);
1752 CallerCode += ", " + TargetOpcodes[j];
1754 for (unsigned j = 0, e = TargetVTs.size(); j != e; ++j) {
1755 CalleeCode += ", MVT VT" + utostr(j);
1756 CallerCode += ", " + TargetVTs[j];
1758 for (std::set<std::string>::iterator
1759 I = Decls.begin(), E = Decls.end(); I != E; ++I) {
1760 std::string Name = *I;
1761 CalleeCode += ", SDOperand &" + Name;
1762 CallerCode += ", " + Name;
1765 if (OutputIsVariadic) {
1766 CalleeCode += ", unsigned NumInputRootOps";
1767 CallerCode += ", " + utostr(NumInputRootOps);
1772 // Prevent emission routines from being inlined to reduce selection
1773 // routines stack frame sizes.
1774 CalleeCode += "DISABLE_INLINE ";
1775 CalleeCode += "{\n";
1777 for (std::vector<std::string>::const_reverse_iterator
1778 I = AddedInits.rbegin(), E = AddedInits.rend(); I != E; ++I)
1779 CalleeCode += " " + *I + "\n";
1781 for (int j = LastPred+1; j < CodeSize; ++j)
1782 CalleeCode += " " + GeneratedCode[j].second + "\n";
1783 for (int j = LastPred+1; j < CodeSize; ++j)
1784 GeneratedCode.pop_back();
1785 CalleeCode += "}\n";
1787 // Uniquing the emission routines.
1788 unsigned EmitFuncNum;
1789 std::map<std::string, unsigned>::iterator EFI =
1790 EmitFunctions.find(CalleeCode);
1791 if (EFI != EmitFunctions.end()) {
1792 EmitFuncNum = EFI->second;
1794 EmitFuncNum = EmitFunctions.size();
1795 EmitFunctions.insert(std::make_pair(CalleeCode, EmitFuncNum));
1796 OS << "SDNode *Emit_" << utostr(EmitFuncNum) << CalleeCode;
1799 // Replace the emission code within selection routines with calls to the
1800 // emission functions.
1801 CallerCode = "return Emit_" + utostr(EmitFuncNum) + CallerCode;
1802 GeneratedCode.push_back(std::make_pair(false, CallerCode));
1806 std::string OpVTStr;
1807 if (OpVT == MVT::iPTR) {
1809 } else if (OpVT == MVT::isVoid) {
1810 // Nodes with a void result actually have a first result type of either
1811 // Other (a chain) or Flag. Since there is no one-to-one mapping from
1812 // void to this case, we handle it specially here.
1814 OpVTStr = "_" + getEnumName(OpVT).substr(5); // Skip 'MVT::'
1816 std::map<std::string, std::vector<std::string> >::iterator OpVTI =
1817 OpcodeVTMap.find(OpName);
1818 if (OpVTI == OpcodeVTMap.end()) {
1819 std::vector<std::string> VTSet;
1820 VTSet.push_back(OpVTStr);
1821 OpcodeVTMap.insert(std::make_pair(OpName, VTSet));
1823 OpVTI->second.push_back(OpVTStr);
1825 OS << "SDNode *Select_" << getLegalCName(OpName)
1826 << OpVTStr << "(const SDOperand &N) {\n";
1828 // Loop through and reverse all of the CodeList vectors, as we will be
1829 // accessing them from their logical front, but accessing the end of a
1830 // vector is more efficient.
1831 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1832 CodeList &GeneratedCode = CodeForPatterns[i].second;
1833 std::reverse(GeneratedCode.begin(), GeneratedCode.end());
1836 // Next, reverse the list of patterns itself for the same reason.
1837 std::reverse(CodeForPatterns.begin(), CodeForPatterns.end());
1839 // Emit all of the patterns now, grouped together to share code.
1840 EmitPatterns(CodeForPatterns, 2, OS);
1842 // If the last pattern has predicates (which could fail) emit code to
1843 // catch the case where nothing handles a pattern.
1844 if (mightNotMatch) {
1845 OS << " cerr << \"Cannot yet select: \";\n";
1846 if (OpName != "ISD::INTRINSIC_W_CHAIN" &&
1847 OpName != "ISD::INTRINSIC_WO_CHAIN" &&
1848 OpName != "ISD::INTRINSIC_VOID") {
1849 OS << " N.Val->dump(CurDAG);\n";
1851 OS << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
1852 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
1853 << " cerr << \"intrinsic %\"<< "
1854 "Intrinsic::getName((Intrinsic::ID)iid);\n";
1856 OS << " cerr << '\\n';\n"
1858 << " return NULL;\n";
1864 // Emit boilerplate.
1865 OS << "SDNode *Select_INLINEASM(SDOperand N) {\n"
1866 << " std::vector<SDOperand> Ops(N.Val->op_begin(), N.Val->op_end());\n"
1867 << " SelectInlineAsmMemoryOperands(Ops, *CurDAG);\n\n"
1869 << " // Ensure that the asm operands are themselves selected.\n"
1870 << " for (unsigned j = 0, e = Ops.size(); j != e; ++j)\n"
1871 << " AddToISelQueue(Ops[j]);\n\n"
1873 << " std::vector<MVT> VTs;\n"
1874 << " VTs.push_back(MVT::Other);\n"
1875 << " VTs.push_back(MVT::Flag);\n"
1876 << " SDOperand New = CurDAG->getNode(ISD::INLINEASM, VTs, &Ops[0], "
1878 << " return New.Val;\n"
1881 OS << "SDNode *Select_UNDEF(const SDOperand &N) {\n"
1882 << " return CurDAG->SelectNodeTo(N.Val, TargetInstrInfo::IMPLICIT_DEF,\n"
1883 << " N.getValueType());\n"
1886 OS << "SDNode *Select_DBG_LABEL(const SDOperand &N) {\n"
1887 << " SDOperand Chain = N.getOperand(0);\n"
1888 << " unsigned C = cast<LabelSDNode>(N)->getLabelID();\n"
1889 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
1890 << " AddToISelQueue(Chain);\n"
1891 << " return CurDAG->SelectNodeTo(N.Val, TargetInstrInfo::DBG_LABEL,\n"
1892 << " MVT::Other, Tmp, Chain);\n"
1895 OS << "SDNode *Select_EH_LABEL(const SDOperand &N) {\n"
1896 << " SDOperand Chain = N.getOperand(0);\n"
1897 << " unsigned C = cast<LabelSDNode>(N)->getLabelID();\n"
1898 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
1899 << " AddToISelQueue(Chain);\n"
1900 << " return CurDAG->SelectNodeTo(N.Val, TargetInstrInfo::EH_LABEL,\n"
1901 << " MVT::Other, Tmp, Chain);\n"
1904 OS << "SDNode *Select_DECLARE(const SDOperand &N) {\n"
1905 << " SDOperand Chain = N.getOperand(0);\n"
1906 << " SDOperand N1 = N.getOperand(1);\n"
1907 << " SDOperand N2 = N.getOperand(2);\n"
1908 << " if (!isa<FrameIndexSDNode>(N1) || !isa<GlobalAddressSDNode>(N2)) {\n"
1909 << " cerr << \"Cannot yet select llvm.dbg.declare: \";\n"
1910 << " N.Val->dump(CurDAG);\n"
1913 << " int FI = cast<FrameIndexSDNode>(N1)->getIndex();\n"
1914 << " GlobalValue *GV = cast<GlobalAddressSDNode>(N2)->getGlobal();\n"
1915 << " SDOperand Tmp1 = "
1916 << "CurDAG->getTargetFrameIndex(FI, TLI.getPointerTy());\n"
1917 << " SDOperand Tmp2 = "
1918 << "CurDAG->getTargetGlobalAddress(GV, TLI.getPointerTy());\n"
1919 << " AddToISelQueue(Chain);\n"
1920 << " return CurDAG->SelectNodeTo(N.Val, TargetInstrInfo::DECLARE,\n"
1921 << " MVT::Other, Tmp1, Tmp2, Chain);\n"
1924 OS << "SDNode *Select_EXTRACT_SUBREG(const SDOperand &N) {\n"
1925 << " SDOperand N0 = N.getOperand(0);\n"
1926 << " SDOperand N1 = N.getOperand(1);\n"
1927 << " unsigned C = cast<ConstantSDNode>(N1)->getValue();\n"
1928 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
1929 << " AddToISelQueue(N0);\n"
1930 << " return CurDAG->SelectNodeTo(N.Val, TargetInstrInfo::EXTRACT_SUBREG,\n"
1931 << " N.getValueType(), N0, Tmp);\n"
1934 OS << "SDNode *Select_INSERT_SUBREG(const SDOperand &N) {\n"
1935 << " SDOperand N0 = N.getOperand(0);\n"
1936 << " SDOperand N1 = N.getOperand(1);\n"
1937 << " SDOperand N2 = N.getOperand(2);\n"
1938 << " unsigned C = cast<ConstantSDNode>(N2)->getValue();\n"
1939 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
1940 << " AddToISelQueue(N1);\n"
1941 << " AddToISelQueue(N0);\n"
1942 << " return CurDAG->SelectNodeTo(N.Val, TargetInstrInfo::INSERT_SUBREG,\n"
1943 << " N.getValueType(), N0, N1, Tmp);\n"
1946 OS << "// The main instruction selector code.\n"
1947 << "SDNode *SelectCode(SDOperand N) {\n"
1948 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
1949 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
1950 << "INSTRUCTION_LIST_END)) {\n"
1951 << " return NULL; // Already selected.\n"
1953 << " MVT::SimpleValueType NVT = N.Val->getValueType(0).getSimpleVT();\n"
1954 << " switch (N.getOpcode()) {\n"
1955 << " default: break;\n"
1956 << " case ISD::EntryToken: // These leaves remain the same.\n"
1957 << " case ISD::BasicBlock:\n"
1958 << " case ISD::Register:\n"
1959 << " case ISD::HANDLENODE:\n"
1960 << " case ISD::TargetConstant:\n"
1961 << " case ISD::TargetConstantFP:\n"
1962 << " case ISD::TargetConstantPool:\n"
1963 << " case ISD::TargetFrameIndex:\n"
1964 << " case ISD::TargetExternalSymbol:\n"
1965 << " case ISD::TargetJumpTable:\n"
1966 << " case ISD::TargetGlobalTLSAddress:\n"
1967 << " case ISD::TargetGlobalAddress: {\n"
1968 << " return NULL;\n"
1970 << " case ISD::AssertSext:\n"
1971 << " case ISD::AssertZext: {\n"
1972 << " AddToISelQueue(N.getOperand(0));\n"
1973 << " ReplaceUses(N, N.getOperand(0));\n"
1974 << " return NULL;\n"
1976 << " case ISD::TokenFactor:\n"
1977 << " case ISD::CopyFromReg:\n"
1978 << " case ISD::CopyToReg: {\n"
1979 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)\n"
1980 << " AddToISelQueue(N.getOperand(i));\n"
1981 << " return NULL;\n"
1983 << " case ISD::INLINEASM: return Select_INLINEASM(N);\n"
1984 << " case ISD::DBG_LABEL: return Select_DBG_LABEL(N);\n"
1985 << " case ISD::EH_LABEL: return Select_EH_LABEL(N);\n"
1986 << " case ISD::DECLARE: return Select_DECLARE(N);\n"
1987 << " case ISD::EXTRACT_SUBREG: return Select_EXTRACT_SUBREG(N);\n"
1988 << " case ISD::INSERT_SUBREG: return Select_INSERT_SUBREG(N);\n"
1989 << " case ISD::UNDEF: return Select_UNDEF(N);\n";
1992 // Loop over all of the case statements, emiting a call to each method we
1994 for (std::map<std::string, std::vector<const PatternToMatch*> >::iterator
1995 PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end();
1996 PBOI != E; ++PBOI) {
1997 const std::string &OpName = PBOI->first;
1998 // Potentially multiple versions of select for this opcode. One for each
1999 // ValueType of the node (or its first true operand if it doesn't produce a
2001 std::map<std::string, std::vector<std::string> >::iterator OpVTI =
2002 OpcodeVTMap.find(OpName);
2003 std::vector<std::string> &OpVTs = OpVTI->second;
2004 OS << " case " << OpName << ": {\n";
2005 // Keep track of whether we see a pattern that has an iPtr result.
2006 bool HasPtrPattern = false;
2007 bool HasDefaultPattern = false;
2009 OS << " switch (NVT) {\n";
2010 for (unsigned i = 0, e = OpVTs.size(); i < e; ++i) {
2011 std::string &VTStr = OpVTs[i];
2012 if (VTStr.empty()) {
2013 HasDefaultPattern = true;
2017 // If this is a match on iPTR: don't emit it directly, we need special
2019 if (VTStr == "_iPTR") {
2020 HasPtrPattern = true;
2023 OS << " case MVT::" << VTStr.substr(1) << ":\n"
2024 << " return Select_" << getLegalCName(OpName)
2025 << VTStr << "(N);\n";
2027 OS << " default:\n";
2029 // If there is an iPTR result version of this pattern, emit it here.
2030 if (HasPtrPattern) {
2031 OS << " if (TLI.getPointerTy() == NVT)\n";
2032 OS << " return Select_" << getLegalCName(OpName) <<"_iPTR(N);\n";
2034 if (HasDefaultPattern) {
2035 OS << " return Select_" << getLegalCName(OpName) << "(N);\n";
2043 OS << " } // end of big switch.\n\n"
2044 << " cerr << \"Cannot yet select: \";\n"
2045 << " if (N.getOpcode() != ISD::INTRINSIC_W_CHAIN &&\n"
2046 << " N.getOpcode() != ISD::INTRINSIC_WO_CHAIN &&\n"
2047 << " N.getOpcode() != ISD::INTRINSIC_VOID) {\n"
2048 << " N.Val->dump(CurDAG);\n"
2050 << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
2051 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
2052 << " cerr << \"intrinsic %\"<< "
2053 "Intrinsic::getName((Intrinsic::ID)iid);\n"
2055 << " cerr << '\\n';\n"
2057 << " return NULL;\n"
2061 void DAGISelEmitter::run(std::ostream &OS) {
2062 EmitSourceFileHeader("DAG Instruction Selector for the " +
2063 CGP.getTargetInfo().getName() + " target", OS);
2065 OS << "// *** NOTE: This file is #included into the middle of the target\n"
2066 << "// *** instruction selector class. These functions are really "
2069 OS << "// Include standard, target-independent definitions and methods used\n"
2070 << "// by the instruction selector.\n";
2071 OS << "#include <llvm/CodeGen/DAGISelHeader.h>\n\n";
2073 EmitNodeTransforms(OS);
2074 EmitPredicateFunctions(OS);
2076 DOUT << "\n\nALL PATTERNS TO MATCH:\n\n";
2077 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), E = CGP.ptm_end();
2079 DOUT << "PATTERN: "; DEBUG(I->getSrcPattern()->dump());
2080 DOUT << "\nRESULT: "; DEBUG(I->getDstPattern()->dump());
2084 // At this point, we have full information about the 'Patterns' we need to
2085 // parse, both implicitly from instructions as well as from explicit pattern
2086 // definitions. Emit the resultant instruction selector.
2087 EmitInstructionSelector(OS);