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 //===----------------------------------------------------------------------===//
210 // Node Transformation emitter implementation.
212 void DAGISelEmitter::EmitNodeTransforms(std::ostream &OS) {
213 // Walk the pattern fragments, adding them to a map, which sorts them by
215 typedef std::map<std::string, CodeGenDAGPatterns::NodeXForm> NXsByNameTy;
216 NXsByNameTy NXsByName;
218 for (CodeGenDAGPatterns::nx_iterator I = CGP.nx_begin(), E = CGP.nx_end();
220 NXsByName.insert(std::make_pair(I->first->getName(), I->second));
222 OS << "\n// Node transformations.\n";
224 for (NXsByNameTy::iterator I = NXsByName.begin(), E = NXsByName.end();
226 Record *SDNode = I->second.first;
227 std::string Code = I->second.second;
229 if (Code.empty()) continue; // Empty code? Skip it.
231 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName();
232 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
234 OS << "inline SDOperand Transform_" << I->first << "(SDNode *" << C2
236 if (ClassName != "SDNode")
237 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
238 OS << Code << "\n}\n";
242 //===----------------------------------------------------------------------===//
243 // Predicate emitter implementation.
246 void DAGISelEmitter::EmitPredicateFunctions(std::ostream &OS) {
247 OS << "\n// Predicate functions.\n";
249 // Walk the pattern fragments, adding them to a map, which sorts them by
251 typedef std::map<std::string, std::pair<Record*, TreePattern*> > PFsByNameTy;
252 PFsByNameTy PFsByName;
254 for (CodeGenDAGPatterns::pf_iterator I = CGP.pf_begin(), E = CGP.pf_end();
256 PFsByName.insert(std::make_pair(I->first->getName(), *I));
259 for (PFsByNameTy::iterator I = PFsByName.begin(), E = PFsByName.end();
261 Record *PatFragRecord = I->second.first;// Record that derives from PatFrag.
262 TreePattern *P = I->second.second;
264 // If there is a code init for this fragment, emit the predicate code.
265 std::string Code = PatFragRecord->getValueAsCode("Predicate");
266 if (Code.empty()) continue;
268 if (P->getOnlyTree()->isLeaf())
269 OS << "inline bool Predicate_" << PatFragRecord->getName()
270 << "(SDNode *N) {\n";
272 std::string ClassName =
273 CGP.getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
274 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
276 OS << "inline bool Predicate_" << PatFragRecord->getName()
277 << "(SDNode *" << C2 << ") {\n";
278 if (ClassName != "SDNode")
279 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
281 OS << Code << "\n}\n";
288 //===----------------------------------------------------------------------===//
289 // PatternCodeEmitter implementation.
291 class PatternCodeEmitter {
293 CodeGenDAGPatterns &CGP;
296 ListInit *Predicates;
299 // Instruction selector pattern.
300 TreePatternNode *Pattern;
301 // Matched instruction.
302 TreePatternNode *Instruction;
304 // Node to name mapping
305 std::map<std::string, std::string> VariableMap;
306 // Node to operator mapping
307 std::map<std::string, Record*> OperatorMap;
308 // Name of the folded node which produces a flag.
309 std::pair<std::string, unsigned> FoldedFlag;
310 // Names of all the folded nodes which produce chains.
311 std::vector<std::pair<std::string, unsigned> > FoldedChains;
312 // Original input chain(s).
313 std::vector<std::pair<std::string, std::string> > OrigChains;
314 std::set<std::string> Duplicates;
316 /// LSI - Load/Store information.
317 /// Save loads/stores matched by a pattern, and generate a MemOperandSDNode
318 /// for each memory access. This facilitates the use of AliasAnalysis in
320 std::vector<std::string> LSI;
322 /// GeneratedCode - This is the buffer that we emit code to. The first int
323 /// indicates whether this is an exit predicate (something that should be
324 /// tested, and if true, the match fails) [when 1], or normal code to emit
325 /// [when 0], or initialization code to emit [when 2].
326 std::vector<std::pair<unsigned, std::string> > &GeneratedCode;
327 /// GeneratedDecl - This is the set of all SDOperand declarations needed for
328 /// the set of patterns for each top-level opcode.
329 std::set<std::string> &GeneratedDecl;
330 /// TargetOpcodes - The target specific opcodes used by the resulting
332 std::vector<std::string> &TargetOpcodes;
333 std::vector<std::string> &TargetVTs;
334 /// OutputIsVariadic - Records whether the instruction output pattern uses
335 /// variable_ops. This requires that the Emit function be passed an
336 /// additional argument to indicate where the input varargs operands
338 bool &OutputIsVariadic;
339 /// NumInputRootOps - Records the number of operands the root node of the
340 /// input pattern has. This information is used in the generated code to
341 /// pass to Emit functions when variable_ops processing is needed.
342 unsigned &NumInputRootOps;
344 std::string ChainName;
349 void emitCheck(const std::string &S) {
351 GeneratedCode.push_back(std::make_pair(1, S));
353 void emitCode(const std::string &S) {
355 GeneratedCode.push_back(std::make_pair(0, S));
357 void emitInit(const std::string &S) {
359 GeneratedCode.push_back(std::make_pair(2, S));
361 void emitDecl(const std::string &S) {
362 assert(!S.empty() && "Invalid declaration");
363 GeneratedDecl.insert(S);
365 void emitOpcode(const std::string &Opc) {
366 TargetOpcodes.push_back(Opc);
369 void emitVT(const std::string &VT) {
370 TargetVTs.push_back(VT);
374 PatternCodeEmitter(CodeGenDAGPatterns &cgp, ListInit *preds,
375 TreePatternNode *pattern, TreePatternNode *instr,
376 std::vector<std::pair<unsigned, std::string> > &gc,
377 std::set<std::string> &gd,
378 std::vector<std::string> &to,
379 std::vector<std::string> &tv,
382 : CGP(cgp), Predicates(preds), Pattern(pattern), Instruction(instr),
383 GeneratedCode(gc), GeneratedDecl(gd),
384 TargetOpcodes(to), TargetVTs(tv),
385 OutputIsVariadic(oiv), NumInputRootOps(niro),
386 TmpNo(0), OpcNo(0), VTNo(0) {}
388 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
389 /// if the match fails. At this point, we already know that the opcode for N
390 /// matches, and the SDNode for the result has the RootName specified name.
391 void EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
392 const std::string &RootName, const std::string &ChainSuffix,
395 // Save loads/stores matched by a pattern.
396 if (!N->isLeaf() && N->getName().empty()) {
397 if (NodeHasProperty(N, SDNPMemOperand, CGP))
398 LSI.push_back(RootName);
401 bool isRoot = (P == NULL);
402 // Emit instruction predicates. Each predicate is just a string for now.
404 // Record input varargs info.
405 NumInputRootOps = N->getNumChildren();
407 std::string PredicateCheck;
408 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
409 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
410 Record *Def = Pred->getDef();
411 if (!Def->isSubClassOf("Predicate")) {
415 assert(0 && "Unknown predicate type!");
417 if (!PredicateCheck.empty())
418 PredicateCheck += " && ";
419 PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
423 emitCheck(PredicateCheck);
427 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
428 emitCheck("cast<ConstantSDNode>(" + RootName +
429 ")->getSignExtended() == " + itostr(II->getValue()));
431 } else if (!NodeIsComplexPattern(N)) {
432 assert(0 && "Cannot match this as a leaf value!");
437 // If this node has a name associated with it, capture it in VariableMap. If
438 // we already saw this in the pattern, emit code to verify dagness.
439 if (!N->getName().empty()) {
440 std::string &VarMapEntry = VariableMap[N->getName()];
441 if (VarMapEntry.empty()) {
442 VarMapEntry = RootName;
444 // If we get here, this is a second reference to a specific name. Since
445 // we already have checked that the first reference is valid, we don't
446 // have to recursively match it, just check that it's the same as the
447 // previously named thing.
448 emitCheck(VarMapEntry + " == " + RootName);
453 OperatorMap[N->getName()] = N->getOperator();
457 // Emit code to load the child nodes and match their contents recursively.
459 bool NodeHasChain = NodeHasProperty (N, SDNPHasChain, CGP);
460 bool HasChain = PatternHasProperty(N, SDNPHasChain, CGP);
461 bool EmittedUseCheck = false;
466 // Multiple uses of actual result?
467 emitCheck(RootName + ".hasOneUse()");
468 EmittedUseCheck = true;
470 // If the immediate use can somehow reach this node through another
471 // path, then can't fold it either or it will create a cycle.
472 // e.g. In the following diagram, XX can reach ld through YY. If
473 // ld is folded into XX, then YY is both a predecessor and a successor
483 bool NeedCheck = false;
487 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(P->getOperator());
489 P->getOperator() == CGP.get_intrinsic_void_sdnode() ||
490 P->getOperator() == CGP.get_intrinsic_w_chain_sdnode() ||
491 P->getOperator() == CGP.get_intrinsic_wo_chain_sdnode() ||
492 PInfo.getNumOperands() > 1 ||
493 PInfo.hasProperty(SDNPHasChain) ||
494 PInfo.hasProperty(SDNPInFlag) ||
495 PInfo.hasProperty(SDNPOptInFlag);
499 std::string ParentName(RootName.begin(), RootName.end()-1);
500 emitCheck("CanBeFoldedBy(" + RootName + ".Val, " + ParentName +
508 emitCheck("(" + ChainName + ".Val == " + RootName + ".Val || "
509 "IsChainCompatible(" + ChainName + ".Val, " +
510 RootName + ".Val))");
511 OrigChains.push_back(std::make_pair(ChainName, RootName));
514 ChainName = "Chain" + ChainSuffix;
515 emitInit("SDOperand " + ChainName + " = " + RootName +
520 // Don't fold any node which reads or writes a flag and has multiple uses.
521 // FIXME: We really need to separate the concepts of flag and "glue". Those
522 // real flag results, e.g. X86CMP output, can have multiple uses.
523 // FIXME: If the optional incoming flag does not exist. Then it is ok to
526 (PatternHasProperty(N, SDNPInFlag, CGP) ||
527 PatternHasProperty(N, SDNPOptInFlag, CGP) ||
528 PatternHasProperty(N, SDNPOutFlag, CGP))) {
529 if (!EmittedUseCheck) {
530 // Multiple uses of actual result?
531 emitCheck(RootName + ".hasOneUse()");
535 // If there is a node predicate for this, emit the call.
536 if (!N->getPredicateFn().empty())
537 emitCheck(N->getPredicateFn() + "(" + RootName + ".Val)");
540 // If this is an 'and R, 1234' where the operation is AND/OR and the RHS is
541 // a constant without a predicate fn that has more that one bit set, handle
542 // this as a special case. This is usually for targets that have special
543 // handling of certain large constants (e.g. alpha with it's 8/16/32-bit
544 // handling stuff). Using these instructions is often far more efficient
545 // than materializing the constant. Unfortunately, both the instcombiner
546 // and the dag combiner can often infer that bits are dead, and thus drop
547 // them from the mask in the dag. For example, it might turn 'AND X, 255'
548 // into 'AND X, 254' if it knows the low bit is set. Emit code that checks
551 (N->getOperator()->getName() == "and" ||
552 N->getOperator()->getName() == "or") &&
553 N->getChild(1)->isLeaf() &&
554 N->getChild(1)->getPredicateFn().empty()) {
555 if (IntInit *II = dynamic_cast<IntInit*>(N->getChild(1)->getLeafValue())) {
556 if (!isPowerOf2_32(II->getValue())) { // Don't bother with single bits.
557 emitInit("SDOperand " + RootName + "0" + " = " +
558 RootName + ".getOperand(" + utostr(0) + ");");
559 emitInit("SDOperand " + RootName + "1" + " = " +
560 RootName + ".getOperand(" + utostr(1) + ");");
562 emitCheck("isa<ConstantSDNode>(" + RootName + "1)");
563 const char *MaskPredicate = N->getOperator()->getName() == "or"
564 ? "CheckOrMask(" : "CheckAndMask(";
565 emitCheck(MaskPredicate + RootName + "0, cast<ConstantSDNode>(" +
566 RootName + "1), " + itostr(II->getValue()) + ")");
568 EmitChildMatchCode(N->getChild(0), N, RootName + utostr(0), RootName,
569 ChainSuffix + utostr(0), FoundChain);
575 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
576 emitInit("SDOperand " + RootName + utostr(OpNo) + " = " +
577 RootName + ".getOperand(" +utostr(OpNo) + ");");
579 EmitChildMatchCode(N->getChild(i), N, RootName + utostr(OpNo), RootName,
580 ChainSuffix + utostr(OpNo), FoundChain);
583 // Handle cases when root is a complex pattern.
584 const ComplexPattern *CP;
585 if (isRoot && N->isLeaf() && (CP = NodeGetComplexPattern(N, CGP))) {
586 std::string Fn = CP->getSelectFunc();
587 unsigned NumOps = CP->getNumOperands();
588 for (unsigned i = 0; i < NumOps; ++i) {
589 emitDecl("CPTmp" + utostr(i));
590 emitCode("SDOperand CPTmp" + utostr(i) + ";");
592 if (CP->hasProperty(SDNPHasChain)) {
593 emitDecl("CPInChain");
594 emitDecl("Chain" + ChainSuffix);
595 emitCode("SDOperand CPInChain;");
596 emitCode("SDOperand Chain" + ChainSuffix + ";");
599 std::string Code = Fn + "(" + RootName + ", " + RootName;
600 for (unsigned i = 0; i < NumOps; i++)
601 Code += ", CPTmp" + utostr(i);
602 if (CP->hasProperty(SDNPHasChain)) {
603 ChainName = "Chain" + ChainSuffix;
604 Code += ", CPInChain, Chain" + ChainSuffix;
606 emitCheck(Code + ")");
610 void EmitChildMatchCode(TreePatternNode *Child, TreePatternNode *Parent,
611 const std::string &RootName,
612 const std::string &ParentRootName,
613 const std::string &ChainSuffix, bool &FoundChain) {
614 if (!Child->isLeaf()) {
615 // If it's not a leaf, recursively match.
616 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(Child->getOperator());
617 emitCheck(RootName + ".getOpcode() == " +
618 CInfo.getEnumName());
619 EmitMatchCode(Child, Parent, RootName, ChainSuffix, FoundChain);
620 bool HasChain = false;
621 if (NodeHasProperty(Child, SDNPHasChain, CGP)) {
623 FoldedChains.push_back(std::make_pair(RootName, CInfo.getNumResults()));
625 if (NodeHasProperty(Child, SDNPOutFlag, CGP)) {
626 assert(FoldedFlag.first == "" && FoldedFlag.second == 0 &&
627 "Pattern folded multiple nodes which produce flags?");
628 FoldedFlag = std::make_pair(RootName,
629 CInfo.getNumResults() + (unsigned)HasChain);
632 // If this child has a name associated with it, capture it in VarMap. If
633 // we already saw this in the pattern, emit code to verify dagness.
634 if (!Child->getName().empty()) {
635 std::string &VarMapEntry = VariableMap[Child->getName()];
636 if (VarMapEntry.empty()) {
637 VarMapEntry = RootName;
639 // If we get here, this is a second reference to a specific name.
640 // Since we already have checked that the first reference is valid,
641 // we don't have to recursively match it, just check that it's the
642 // same as the previously named thing.
643 emitCheck(VarMapEntry + " == " + RootName);
644 Duplicates.insert(RootName);
649 // Handle leaves of various types.
650 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
651 Record *LeafRec = DI->getDef();
652 if (LeafRec->isSubClassOf("RegisterClass") ||
653 LeafRec->getName() == "ptr_rc") {
654 // Handle register references. Nothing to do here.
655 } else if (LeafRec->isSubClassOf("Register")) {
656 // Handle register references.
657 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
658 // Handle complex pattern.
659 const ComplexPattern *CP = NodeGetComplexPattern(Child, CGP);
660 std::string Fn = CP->getSelectFunc();
661 unsigned NumOps = CP->getNumOperands();
662 for (unsigned i = 0; i < NumOps; ++i) {
663 emitDecl("CPTmp" + utostr(i));
664 emitCode("SDOperand CPTmp" + utostr(i) + ";");
666 if (CP->hasProperty(SDNPHasChain)) {
667 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Parent->getOperator());
668 FoldedChains.push_back(std::make_pair("CPInChain",
669 PInfo.getNumResults()));
670 ChainName = "Chain" + ChainSuffix;
671 emitDecl("CPInChain");
673 emitCode("SDOperand CPInChain;");
674 emitCode("SDOperand " + ChainName + ";");
677 std::string Code = Fn + "(";
678 if (CP->hasAttribute(CPAttrParentAsRoot)) {
679 Code += ParentRootName + ", ";
683 if (CP->hasProperty(SDNPHasChain)) {
684 std::string ParentName(RootName.begin(), RootName.end()-1);
685 Code += ParentName + ", ";
688 for (unsigned i = 0; i < NumOps; i++)
689 Code += ", CPTmp" + utostr(i);
690 if (CP->hasProperty(SDNPHasChain))
691 Code += ", CPInChain, Chain" + ChainSuffix;
692 emitCheck(Code + ")");
693 } else if (LeafRec->getName() == "srcvalue") {
694 // Place holder for SRCVALUE nodes. Nothing to do here.
695 } else if (LeafRec->isSubClassOf("ValueType")) {
696 // Make sure this is the specified value type.
697 emitCheck("cast<VTSDNode>(" + RootName +
698 ")->getVT() == MVT::" + LeafRec->getName());
699 } else if (LeafRec->isSubClassOf("CondCode")) {
700 // Make sure this is the specified cond code.
701 emitCheck("cast<CondCodeSDNode>(" + RootName +
702 ")->get() == ISD::" + LeafRec->getName());
708 assert(0 && "Unknown leaf type!");
711 // If there is a node predicate for this, emit the call.
712 if (!Child->getPredicateFn().empty())
713 emitCheck(Child->getPredicateFn() + "(" + RootName +
715 } else if (IntInit *II =
716 dynamic_cast<IntInit*>(Child->getLeafValue())) {
717 emitCheck("isa<ConstantSDNode>(" + RootName + ")");
718 unsigned CTmp = TmpNo++;
719 emitCode("int64_t CN"+utostr(CTmp)+" = cast<ConstantSDNode>("+
720 RootName + ")->getSignExtended();");
722 emitCheck("CN" + utostr(CTmp) + " == " +itostr(II->getValue()));
727 assert(0 && "Unknown leaf type!");
732 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
733 /// we actually have to build a DAG!
734 std::vector<std::string>
735 EmitResultCode(TreePatternNode *N, std::vector<Record*> DstRegs,
736 bool InFlagDecled, bool ResNodeDecled,
737 bool LikeLeaf = false, bool isRoot = false) {
738 // List of arguments of getTargetNode() or SelectNodeTo().
739 std::vector<std::string> NodeOps;
740 // This is something selected from the pattern we matched.
741 if (!N->getName().empty()) {
742 const std::string &VarName = N->getName();
743 std::string Val = VariableMap[VarName];
744 bool ModifiedVal = false;
746 cerr << "Variable '" << VarName << " referenced but not defined "
747 << "and not caught earlier!\n";
750 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
751 // Already selected this operand, just return the tmpval.
752 NodeOps.push_back(Val);
756 const ComplexPattern *CP;
757 unsigned ResNo = TmpNo++;
758 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
759 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
760 std::string CastType;
761 std::string TmpVar = "Tmp" + utostr(ResNo);
762 switch (N->getTypeNum(0)) {
764 cerr << "Cannot handle " << getEnumName(N->getTypeNum(0))
765 << " type as an immediate constant. Aborting\n";
767 case MVT::i1: CastType = "bool"; break;
768 case MVT::i8: CastType = "unsigned char"; break;
769 case MVT::i16: CastType = "unsigned short"; break;
770 case MVT::i32: CastType = "unsigned"; break;
771 case MVT::i64: CastType = "uint64_t"; break;
773 emitCode("SDOperand " + TmpVar +
774 " = CurDAG->getTargetConstant(((" + CastType +
775 ") cast<ConstantSDNode>(" + Val + ")->getValue()), " +
776 getEnumName(N->getTypeNum(0)) + ");");
777 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
778 // value if used multiple times by this pattern result.
781 NodeOps.push_back(Val);
782 } else if (!N->isLeaf() && N->getOperator()->getName() == "fpimm") {
783 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
784 std::string TmpVar = "Tmp" + utostr(ResNo);
785 emitCode("SDOperand " + TmpVar +
786 " = CurDAG->getTargetConstantFP(cast<ConstantFPSDNode>(" +
787 Val + ")->getValueAPF(), cast<ConstantFPSDNode>(" + Val +
788 ")->getValueType(0));");
789 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
790 // value if used multiple times by this pattern result.
793 NodeOps.push_back(Val);
794 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
795 Record *Op = OperatorMap[N->getName()];
796 // Transform ExternalSymbol to TargetExternalSymbol
797 if (Op && Op->getName() == "externalsym") {
798 std::string TmpVar = "Tmp"+utostr(ResNo);
799 emitCode("SDOperand " + TmpVar + " = CurDAG->getTarget"
800 "ExternalSymbol(cast<ExternalSymbolSDNode>(" +
801 Val + ")->getSymbol(), " +
802 getEnumName(N->getTypeNum(0)) + ");");
803 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select
804 // this value if used multiple times by this pattern result.
808 NodeOps.push_back(Val);
809 } else if (!N->isLeaf() && (N->getOperator()->getName() == "tglobaladdr"
810 || N->getOperator()->getName() == "tglobaltlsaddr")) {
811 Record *Op = OperatorMap[N->getName()];
812 // Transform GlobalAddress to TargetGlobalAddress
813 if (Op && (Op->getName() == "globaladdr" ||
814 Op->getName() == "globaltlsaddr")) {
815 std::string TmpVar = "Tmp" + utostr(ResNo);
816 emitCode("SDOperand " + TmpVar + " = CurDAG->getTarget"
817 "GlobalAddress(cast<GlobalAddressSDNode>(" + Val +
818 ")->getGlobal(), " + getEnumName(N->getTypeNum(0)) +
820 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select
821 // this value if used multiple times by this pattern result.
825 NodeOps.push_back(Val);
826 } else if (!N->isLeaf()
827 && (N->getOperator()->getName() == "texternalsym"
828 || N->getOperator()->getName() == "tconstpool")) {
829 // Do not rewrite the variable name, since we don't generate a new
831 NodeOps.push_back(Val);
832 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, CGP))) {
833 for (unsigned i = 0; i < CP->getNumOperands(); ++i) {
834 emitCode("AddToISelQueue(CPTmp" + utostr(i) + ");");
835 NodeOps.push_back("CPTmp" + utostr(i));
838 // This node, probably wrapped in a SDNodeXForm, behaves like a leaf
839 // node even if it isn't one. Don't select it.
841 emitCode("AddToISelQueue(" + Val + ");");
842 if (isRoot && N->isLeaf()) {
843 emitCode("ReplaceUses(N, " + Val + ");");
844 emitCode("return NULL;");
847 NodeOps.push_back(Val);
851 VariableMap[VarName] = Val;
856 // If this is an explicit register reference, handle it.
857 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
858 unsigned ResNo = TmpNo++;
859 if (DI->getDef()->isSubClassOf("Register")) {
860 emitCode("SDOperand Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" +
861 getQualifiedName(DI->getDef()) + ", " +
862 getEnumName(N->getTypeNum(0)) + ");");
863 NodeOps.push_back("Tmp" + utostr(ResNo));
865 } else if (DI->getDef()->getName() == "zero_reg") {
866 emitCode("SDOperand Tmp" + utostr(ResNo) +
867 " = CurDAG->getRegister(0, " +
868 getEnumName(N->getTypeNum(0)) + ");");
869 NodeOps.push_back("Tmp" + utostr(ResNo));
872 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
873 unsigned ResNo = TmpNo++;
874 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
875 emitCode("SDOperand Tmp" + utostr(ResNo) +
876 " = CurDAG->getTargetConstant(0x" + itohexstr(II->getValue()) +
877 "ULL, " + getEnumName(N->getTypeNum(0)) + ");");
878 NodeOps.push_back("Tmp" + utostr(ResNo));
885 assert(0 && "Unknown leaf type!");
889 Record *Op = N->getOperator();
890 if (Op->isSubClassOf("Instruction")) {
891 const CodeGenTarget &CGT = CGP.getTargetInfo();
892 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
893 const DAGInstruction &Inst = CGP.getInstruction(Op);
894 const TreePattern *InstPat = Inst.getPattern();
895 // FIXME: Assume actual pattern comes before "implicit".
896 TreePatternNode *InstPatNode =
897 isRoot ? (InstPat ? InstPat->getTree(0) : Pattern)
898 : (InstPat ? InstPat->getTree(0) : NULL);
899 if (InstPatNode && InstPatNode->getOperator()->getName() == "set") {
900 InstPatNode = InstPatNode->getChild(InstPatNode->getNumChildren()-1);
902 bool IsVariadic = isRoot && II.isVariadic;
903 // FIXME: fix how we deal with physical register operands.
904 bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0;
905 bool HasImpResults = isRoot && DstRegs.size() > 0;
906 bool NodeHasOptInFlag = isRoot &&
907 PatternHasProperty(Pattern, SDNPOptInFlag, CGP);
908 bool NodeHasInFlag = isRoot &&
909 PatternHasProperty(Pattern, SDNPInFlag, CGP);
910 bool NodeHasOutFlag = isRoot &&
911 PatternHasProperty(Pattern, SDNPOutFlag, CGP);
912 bool NodeHasChain = InstPatNode &&
913 PatternHasProperty(InstPatNode, SDNPHasChain, CGP);
914 bool InputHasChain = isRoot &&
915 NodeHasProperty(Pattern, SDNPHasChain, CGP);
916 unsigned NumResults = Inst.getNumResults();
917 unsigned NumDstRegs = HasImpResults ? DstRegs.size() : 0;
919 // Record output varargs info.
920 OutputIsVariadic = IsVariadic;
922 if (NodeHasOptInFlag) {
923 emitCode("bool HasInFlag = "
924 "(N.getOperand(N.getNumOperands()-1).getValueType() == MVT::Flag);");
927 emitCode("SmallVector<SDOperand, 8> Ops" + utostr(OpcNo) + ";");
929 // How many results is this pattern expected to produce?
930 unsigned NumPatResults = 0;
931 for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
932 MVT::SimpleValueType VT = Pattern->getTypeNum(i);
933 if (VT != MVT::isVoid && VT != MVT::Flag)
937 if (OrigChains.size() > 0) {
938 // The original input chain is being ignored. If it is not just
939 // pointing to the op that's being folded, we should create a
940 // TokenFactor with it and the chain of the folded op as the new chain.
941 // We could potentially be doing multiple levels of folding, in that
942 // case, the TokenFactor can have more operands.
943 emitCode("SmallVector<SDOperand, 8> InChains;");
944 for (unsigned i = 0, e = OrigChains.size(); i < e; ++i) {
945 emitCode("if (" + OrigChains[i].first + ".Val != " +
946 OrigChains[i].second + ".Val) {");
947 emitCode(" AddToISelQueue(" + OrigChains[i].first + ");");
948 emitCode(" InChains.push_back(" + OrigChains[i].first + ");");
951 emitCode("AddToISelQueue(" + ChainName + ");");
952 emitCode("InChains.push_back(" + ChainName + ");");
953 emitCode(ChainName + " = CurDAG->getNode(ISD::TokenFactor, MVT::Other, "
954 "&InChains[0], InChains.size());");
957 // Loop over all of the operands of the instruction pattern, emitting code
958 // to fill them all in. The node 'N' usually has number children equal to
959 // the number of input operands of the instruction. However, in cases
960 // where there are predicate operands for an instruction, we need to fill
961 // in the 'execute always' values. Match up the node operands to the
962 // instruction operands to do this.
963 std::vector<std::string> AllOps;
964 for (unsigned ChildNo = 0, InstOpNo = NumResults;
965 InstOpNo != II.OperandList.size(); ++InstOpNo) {
966 std::vector<std::string> Ops;
968 // Determine what to emit for this operand.
969 Record *OperandNode = II.OperandList[InstOpNo].Rec;
970 if ((OperandNode->isSubClassOf("PredicateOperand") ||
971 OperandNode->isSubClassOf("OptionalDefOperand")) &&
972 !CGP.getDefaultOperand(OperandNode).DefaultOps.empty()) {
973 // This is a predicate or optional def operand; emit the
974 // 'default ops' operands.
975 const DAGDefaultOperand &DefaultOp =
976 CGP.getDefaultOperand(II.OperandList[InstOpNo].Rec);
977 for (unsigned i = 0, e = DefaultOp.DefaultOps.size(); i != e; ++i) {
978 Ops = EmitResultCode(DefaultOp.DefaultOps[i], DstRegs,
979 InFlagDecled, ResNodeDecled);
980 AllOps.insert(AllOps.end(), Ops.begin(), Ops.end());
983 // Otherwise this is a normal operand or a predicate operand without
984 // 'execute always'; emit it.
985 Ops = EmitResultCode(N->getChild(ChildNo), DstRegs,
986 InFlagDecled, ResNodeDecled);
987 AllOps.insert(AllOps.end(), Ops.begin(), Ops.end());
992 // Emit all the chain and CopyToReg stuff.
993 bool ChainEmitted = NodeHasChain;
995 emitCode("AddToISelQueue(" + ChainName + ");");
996 if (NodeHasInFlag || HasImpInputs)
997 EmitInFlagSelectCode(Pattern, "N", ChainEmitted,
998 InFlagDecled, ResNodeDecled, true);
999 if (NodeHasOptInFlag || NodeHasInFlag || HasImpInputs) {
1000 if (!InFlagDecled) {
1001 emitCode("SDOperand InFlag(0, 0);");
1002 InFlagDecled = true;
1004 if (NodeHasOptInFlag) {
1005 emitCode("if (HasInFlag) {");
1006 emitCode(" InFlag = N.getOperand(N.getNumOperands()-1);");
1007 emitCode(" AddToISelQueue(InFlag);");
1012 unsigned ResNo = TmpNo++;
1013 if (!isRoot || InputHasChain || NodeHasChain || NodeHasOutFlag ||
1014 NodeHasOptInFlag || HasImpResults) {
1017 std::string NodeName;
1019 NodeName = "Tmp" + utostr(ResNo);
1020 Code2 = "SDOperand " + NodeName + "(";
1022 NodeName = "ResNode";
1023 if (!ResNodeDecled) {
1024 Code2 = "SDNode *" + NodeName + " = ";
1025 ResNodeDecled = true;
1027 Code2 = NodeName + " = ";
1030 Code += "CurDAG->getTargetNode(Opc" + utostr(OpcNo);
1031 unsigned OpsNo = OpcNo;
1032 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
1034 // Output order: results, chain, flags
1036 if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid) {
1037 Code += ", VT" + utostr(VTNo);
1038 emitVT(getEnumName(N->getTypeNum(0)));
1040 // Add types for implicit results in physical registers, scheduler will
1041 // care of adding copyfromreg nodes.
1042 for (unsigned i = 0; i < NumDstRegs; i++) {
1043 Record *RR = DstRegs[i];
1044 if (RR->isSubClassOf("Register")) {
1045 MVT::SimpleValueType RVT = getRegisterValueType(RR, CGT);
1046 Code += ", " + getEnumName(RVT);
1050 Code += ", MVT::Other";
1052 Code += ", MVT::Flag";
1056 for (unsigned i = 0, e = AllOps.size(); i != e; ++i)
1057 emitCode("Ops" + utostr(OpsNo) + ".push_back(" + AllOps[i] + ");");
1060 // Figure out whether any operands at the end of the op list are not
1061 // part of the variable section.
1062 std::string EndAdjust;
1063 if (NodeHasInFlag || HasImpInputs)
1064 EndAdjust = "-1"; // Always has one flag.
1065 else if (NodeHasOptInFlag)
1066 EndAdjust = "-(HasInFlag?1:0)"; // May have a flag.
1068 emitCode("for (unsigned i = NumInputRootOps + " + utostr(NodeHasChain) +
1069 ", e = N.getNumOperands()" + EndAdjust + "; i != e; ++i) {");
1071 emitCode(" AddToISelQueue(N.getOperand(i));");
1072 emitCode(" Ops" + utostr(OpsNo) + ".push_back(N.getOperand(i));");
1076 // Generate MemOperandSDNodes nodes for each memory accesses covered by
1078 if (II.isSimpleLoad | II.mayLoad | II.mayStore) {
1079 std::vector<std::string>::const_iterator mi, mie;
1080 for (mi = LSI.begin(), mie = LSI.end(); mi != mie; ++mi) {
1081 emitCode("SDOperand LSI_" + *mi + " = "
1082 "CurDAG->getMemOperand(cast<MemSDNode>(" +
1083 *mi + ")->getMemOperand());");
1085 emitCode("Ops" + utostr(OpsNo) + ".push_back(LSI_" + *mi + ");");
1087 AllOps.push_back("LSI_" + *mi);
1093 emitCode("Ops" + utostr(OpsNo) + ".push_back(" + ChainName + ");");
1095 AllOps.push_back(ChainName);
1099 if (NodeHasInFlag || HasImpInputs)
1100 emitCode("Ops" + utostr(OpsNo) + ".push_back(InFlag);");
1101 else if (NodeHasOptInFlag) {
1102 emitCode("if (HasInFlag)");
1103 emitCode(" Ops" + utostr(OpsNo) + ".push_back(InFlag);");
1105 Code += ", &Ops" + utostr(OpsNo) + "[0], Ops" + utostr(OpsNo) +
1107 } else if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs)
1108 AllOps.push_back("InFlag");
1110 unsigned NumOps = AllOps.size();
1112 if (!NodeHasOptInFlag && NumOps < 4) {
1113 for (unsigned i = 0; i != NumOps; ++i)
1114 Code += ", " + AllOps[i];
1116 std::string OpsCode = "SDOperand Ops" + utostr(OpsNo) + "[] = { ";
1117 for (unsigned i = 0; i != NumOps; ++i) {
1118 OpsCode += AllOps[i];
1122 emitCode(OpsCode + " };");
1123 Code += ", Ops" + utostr(OpsNo) + ", ";
1124 if (NodeHasOptInFlag) {
1125 Code += "HasInFlag ? ";
1126 Code += utostr(NumOps) + " : " + utostr(NumOps-1);
1128 Code += utostr(NumOps);
1134 emitCode(Code2 + Code + ");");
1137 // Remember which op produces the chain.
1139 emitCode(ChainName + " = SDOperand(" + NodeName +
1140 ".Val, " + utostr(NumResults+NumDstRegs) + ");");
1142 emitCode(ChainName + " = SDOperand(" + NodeName +
1143 ", " + utostr(NumResults+NumDstRegs) + ");");
1147 NodeOps.push_back("Tmp" + utostr(ResNo));
1151 bool NeedReplace = false;
1152 if (NodeHasOutFlag) {
1153 if (!InFlagDecled) {
1154 emitCode("SDOperand InFlag(ResNode, " +
1155 utostr(NumResults+NumDstRegs+(unsigned)NodeHasChain) + ");");
1156 InFlagDecled = true;
1158 emitCode("InFlag = SDOperand(ResNode, " +
1159 utostr(NumResults+NumDstRegs+(unsigned)NodeHasChain) + ");");
1162 if (FoldedChains.size() > 0) {
1164 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
1165 emitCode("ReplaceUses(SDOperand(" +
1166 FoldedChains[j].first + ".Val, " +
1167 utostr(FoldedChains[j].second) + "), SDOperand(ResNode, " +
1168 utostr(NumResults+NumDstRegs) + "));");
1172 if (NodeHasOutFlag) {
1173 if (FoldedFlag.first != "") {
1174 emitCode("ReplaceUses(SDOperand(" + FoldedFlag.first + ".Val, " +
1175 utostr(FoldedFlag.second) + "), InFlag);");
1177 assert(NodeHasProperty(Pattern, SDNPOutFlag, CGP));
1178 emitCode("ReplaceUses(SDOperand(N.Val, " +
1179 utostr(NumPatResults + (unsigned)InputHasChain)
1185 if (NeedReplace && InputHasChain)
1186 emitCode("ReplaceUses(SDOperand(N.Val, " +
1187 utostr(NumPatResults) + "), SDOperand(" + ChainName
1188 + ".Val, " + ChainName + ".ResNo" + "));");
1190 // User does not expect the instruction would produce a chain!
1191 if ((!InputHasChain && NodeHasChain) && NodeHasOutFlag) {
1193 } else if (InputHasChain && !NodeHasChain) {
1194 // One of the inner node produces a chain.
1196 emitCode("ReplaceUses(SDOperand(N.Val, " + utostr(NumPatResults+1) +
1197 "), SDOperand(ResNode, N.ResNo-1));");
1198 emitCode("ReplaceUses(SDOperand(N.Val, " + utostr(NumPatResults) +
1199 "), " + ChainName + ");");
1202 emitCode("return ResNode;");
1204 std::string Code = "return CurDAG->SelectNodeTo(N.Val, Opc" +
1206 if (N->getTypeNum(0) != MVT::isVoid)
1207 Code += ", VT" + utostr(VTNo);
1209 Code += ", MVT::Flag";
1211 if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs)
1212 AllOps.push_back("InFlag");
1214 unsigned NumOps = AllOps.size();
1216 if (!NodeHasOptInFlag && NumOps < 4) {
1217 for (unsigned i = 0; i != NumOps; ++i)
1218 Code += ", " + AllOps[i];
1220 std::string OpsCode = "SDOperand Ops" + utostr(OpcNo) + "[] = { ";
1221 for (unsigned i = 0; i != NumOps; ++i) {
1222 OpsCode += AllOps[i];
1226 emitCode(OpsCode + " };");
1227 Code += ", Ops" + utostr(OpcNo) + ", ";
1228 Code += utostr(NumOps);
1231 emitCode(Code + ");");
1232 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
1233 if (N->getTypeNum(0) != MVT::isVoid)
1234 emitVT(getEnumName(N->getTypeNum(0)));
1238 } else if (Op->isSubClassOf("SDNodeXForm")) {
1239 assert(N->getNumChildren() == 1 && "node xform should have one child!");
1240 // PatLeaf node - the operand may or may not be a leaf node. But it should
1242 std::vector<std::string> Ops =
1243 EmitResultCode(N->getChild(0), DstRegs, InFlagDecled,
1244 ResNodeDecled, true);
1245 unsigned ResNo = TmpNo++;
1246 emitCode("SDOperand Tmp" + utostr(ResNo) + " = Transform_" + Op->getName()
1247 + "(" + Ops.back() + ".Val);");
1248 NodeOps.push_back("Tmp" + utostr(ResNo));
1250 emitCode("return Tmp" + utostr(ResNo) + ".Val;");
1255 throw std::string("Unknown node in result pattern!");
1259 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat'
1260 /// and add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
1261 /// 'Pat' may be missing types. If we find an unresolved type to add a check
1262 /// for, this returns true otherwise false if Pat has all types.
1263 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
1264 const std::string &Prefix, bool isRoot = false) {
1266 if (Pat->getExtTypes() != Other->getExtTypes()) {
1267 // Move a type over from 'other' to 'pat'.
1268 Pat->setTypes(Other->getExtTypes());
1269 // The top level node type is checked outside of the select function.
1271 emitCheck(Prefix + ".Val->getValueType(0) == " +
1272 getName(Pat->getTypeNum(0)));
1277 (unsigned) NodeHasProperty(Pat, SDNPHasChain, CGP);
1278 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
1279 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
1280 Prefix + utostr(OpNo)))
1286 /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is
1288 void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName,
1289 bool &ChainEmitted, bool &InFlagDecled,
1290 bool &ResNodeDecled, bool isRoot = false) {
1291 const CodeGenTarget &T = CGP.getTargetInfo();
1293 (unsigned) NodeHasProperty(N, SDNPHasChain, CGP);
1294 bool HasInFlag = NodeHasProperty(N, SDNPInFlag, CGP);
1295 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
1296 TreePatternNode *Child = N->getChild(i);
1297 if (!Child->isLeaf()) {
1298 EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted,
1299 InFlagDecled, ResNodeDecled);
1301 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1302 if (!Child->getName().empty()) {
1303 std::string Name = RootName + utostr(OpNo);
1304 if (Duplicates.find(Name) != Duplicates.end())
1305 // A duplicate! Do not emit a copy for this node.
1309 Record *RR = DI->getDef();
1310 if (RR->isSubClassOf("Register")) {
1311 MVT::SimpleValueType RVT = getRegisterValueType(RR, T);
1312 if (RVT == MVT::Flag) {
1313 if (!InFlagDecled) {
1314 emitCode("SDOperand InFlag = " + RootName + utostr(OpNo) + ";");
1315 InFlagDecled = true;
1317 emitCode("InFlag = " + RootName + utostr(OpNo) + ";");
1318 emitCode("AddToISelQueue(InFlag);");
1320 if (!ChainEmitted) {
1321 emitCode("SDOperand Chain = CurDAG->getEntryNode();");
1322 ChainName = "Chain";
1323 ChainEmitted = true;
1325 emitCode("AddToISelQueue(" + RootName + utostr(OpNo) + ");");
1326 if (!InFlagDecled) {
1327 emitCode("SDOperand InFlag(0, 0);");
1328 InFlagDecled = true;
1330 std::string Decl = (!ResNodeDecled) ? "SDNode *" : "";
1331 emitCode(Decl + "ResNode = CurDAG->getCopyToReg(" + ChainName +
1332 ", " + getQualifiedName(RR) +
1333 ", " + RootName + utostr(OpNo) + ", InFlag).Val;");
1334 ResNodeDecled = true;
1335 emitCode(ChainName + " = SDOperand(ResNode, 0);");
1336 emitCode("InFlag = SDOperand(ResNode, 1);");
1344 if (!InFlagDecled) {
1345 emitCode("SDOperand InFlag = " + RootName +
1346 ".getOperand(" + utostr(OpNo) + ");");
1347 InFlagDecled = true;
1349 emitCode("InFlag = " + RootName +
1350 ".getOperand(" + utostr(OpNo) + ");");
1351 emitCode("AddToISelQueue(InFlag);");
1356 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
1357 /// stream to match the pattern, and generate the code for the match if it
1358 /// succeeds. Returns true if the pattern is not guaranteed to match.
1359 void DAGISelEmitter::GenerateCodeForPattern(const PatternToMatch &Pattern,
1360 std::vector<std::pair<unsigned, std::string> > &GeneratedCode,
1361 std::set<std::string> &GeneratedDecl,
1362 std::vector<std::string> &TargetOpcodes,
1363 std::vector<std::string> &TargetVTs,
1364 bool &OutputIsVariadic,
1365 unsigned &NumInputRootOps) {
1366 OutputIsVariadic = false;
1367 NumInputRootOps = 0;
1369 PatternCodeEmitter Emitter(CGP, Pattern.getPredicates(),
1370 Pattern.getSrcPattern(), Pattern.getDstPattern(),
1371 GeneratedCode, GeneratedDecl,
1372 TargetOpcodes, TargetVTs,
1373 OutputIsVariadic, NumInputRootOps);
1375 // Emit the matcher, capturing named arguments in VariableMap.
1376 bool FoundChain = false;
1377 Emitter.EmitMatchCode(Pattern.getSrcPattern(), NULL, "N", "", FoundChain);
1379 // TP - Get *SOME* tree pattern, we don't care which.
1380 TreePattern &TP = *CGP.pf_begin()->second;
1382 // At this point, we know that we structurally match the pattern, but the
1383 // types of the nodes may not match. Figure out the fewest number of type
1384 // comparisons we need to emit. For example, if there is only one integer
1385 // type supported by a target, there should be no type comparisons at all for
1386 // integer patterns!
1388 // To figure out the fewest number of type checks needed, clone the pattern,
1389 // remove the types, then perform type inference on the pattern as a whole.
1390 // If there are unresolved types, emit an explicit check for those types,
1391 // apply the type to the tree, then rerun type inference. Iterate until all
1392 // types are resolved.
1394 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
1395 RemoveAllTypes(Pat);
1398 // Resolve/propagate as many types as possible.
1400 bool MadeChange = true;
1402 MadeChange = Pat->ApplyTypeConstraints(TP,
1403 true/*Ignore reg constraints*/);
1405 assert(0 && "Error: could not find consistent types for something we"
1406 " already decided was ok!");
1410 // Insert a check for an unresolved type and add it to the tree. If we find
1411 // an unresolved type to add a check for, this returns true and we iterate,
1412 // otherwise we are done.
1413 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N", true));
1415 Emitter.EmitResultCode(Pattern.getDstPattern(), Pattern.getDstRegs(),
1416 false, false, false, true);
1420 /// EraseCodeLine - Erase one code line from all of the patterns. If removing
1421 /// a line causes any of them to be empty, remove them and return true when
1423 static bool EraseCodeLine(std::vector<std::pair<const PatternToMatch*,
1424 std::vector<std::pair<unsigned, std::string> > > >
1426 bool ErasedPatterns = false;
1427 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1428 Patterns[i].second.pop_back();
1429 if (Patterns[i].second.empty()) {
1430 Patterns.erase(Patterns.begin()+i);
1432 ErasedPatterns = true;
1435 return ErasedPatterns;
1438 /// EmitPatterns - Emit code for at least one pattern, but try to group common
1439 /// code together between the patterns.
1440 void DAGISelEmitter::EmitPatterns(std::vector<std::pair<const PatternToMatch*,
1441 std::vector<std::pair<unsigned, std::string> > > >
1442 &Patterns, unsigned Indent,
1444 typedef std::pair<unsigned, std::string> CodeLine;
1445 typedef std::vector<CodeLine> CodeList;
1446 typedef std::vector<std::pair<const PatternToMatch*, CodeList> > PatternList;
1448 if (Patterns.empty()) return;
1450 // Figure out how many patterns share the next code line. Explicitly copy
1451 // FirstCodeLine so that we don't invalidate a reference when changing
1453 const CodeLine FirstCodeLine = Patterns.back().second.back();
1454 unsigned LastMatch = Patterns.size()-1;
1455 while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
1458 // If not all patterns share this line, split the list into two pieces. The
1459 // first chunk will use this line, the second chunk won't.
1460 if (LastMatch != 0) {
1461 PatternList Shared(Patterns.begin()+LastMatch, Patterns.end());
1462 PatternList Other(Patterns.begin(), Patterns.begin()+LastMatch);
1464 // FIXME: Emit braces?
1465 if (Shared.size() == 1) {
1466 const PatternToMatch &Pattern = *Shared.back().first;
1467 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
1468 Pattern.getSrcPattern()->print(OS);
1469 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
1470 Pattern.getDstPattern()->print(OS);
1472 unsigned AddedComplexity = Pattern.getAddedComplexity();
1473 OS << std::string(Indent, ' ') << "// Pattern complexity = "
1474 << getPatternSize(Pattern.getSrcPattern(), CGP) + AddedComplexity
1476 << getResultPatternCost(Pattern.getDstPattern(), CGP)
1478 << getResultPatternSize(Pattern.getDstPattern(), CGP) << "\n";
1480 if (FirstCodeLine.first != 1) {
1481 OS << std::string(Indent, ' ') << "{\n";
1484 EmitPatterns(Shared, Indent, OS);
1485 if (FirstCodeLine.first != 1) {
1487 OS << std::string(Indent, ' ') << "}\n";
1490 if (Other.size() == 1) {
1491 const PatternToMatch &Pattern = *Other.back().first;
1492 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
1493 Pattern.getSrcPattern()->print(OS);
1494 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
1495 Pattern.getDstPattern()->print(OS);
1497 unsigned AddedComplexity = Pattern.getAddedComplexity();
1498 OS << std::string(Indent, ' ') << "// Pattern complexity = "
1499 << getPatternSize(Pattern.getSrcPattern(), CGP) + AddedComplexity
1501 << getResultPatternCost(Pattern.getDstPattern(), CGP)
1503 << getResultPatternSize(Pattern.getDstPattern(), CGP) << "\n";
1505 EmitPatterns(Other, Indent, OS);
1509 // Remove this code from all of the patterns that share it.
1510 bool ErasedPatterns = EraseCodeLine(Patterns);
1512 bool isPredicate = FirstCodeLine.first == 1;
1514 // Otherwise, every pattern in the list has this line. Emit it.
1517 OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
1519 OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
1521 // If the next code line is another predicate, and if all of the pattern
1522 // in this group share the same next line, emit it inline now. Do this
1523 // until we run out of common predicates.
1524 while (!ErasedPatterns && Patterns.back().second.back().first == 1) {
1525 // Check that all of fhe patterns in Patterns end with the same predicate.
1526 bool AllEndWithSamePredicate = true;
1527 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
1528 if (Patterns[i].second.back() != Patterns.back().second.back()) {
1529 AllEndWithSamePredicate = false;
1532 // If all of the predicates aren't the same, we can't share them.
1533 if (!AllEndWithSamePredicate) break;
1535 // Otherwise we can. Emit it shared now.
1536 OS << " &&\n" << std::string(Indent+4, ' ')
1537 << Patterns.back().second.back().second;
1538 ErasedPatterns = EraseCodeLine(Patterns);
1545 EmitPatterns(Patterns, Indent, OS);
1548 OS << std::string(Indent-2, ' ') << "}\n";
1551 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) {
1552 return CGP.getSDNodeInfo(Op).getEnumName();
1555 static std::string getLegalCName(std::string OpName) {
1556 std::string::size_type pos = OpName.find("::");
1557 if (pos != std::string::npos)
1558 OpName.replace(pos, 2, "_");
1562 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
1563 const CodeGenTarget &Target = CGP.getTargetInfo();
1565 // Get the namespace to insert instructions into. Make sure not to pick up
1566 // "TargetInstrInfo" by accidentally getting the namespace off the PHI
1567 // instruction or something.
1569 for (CodeGenTarget::inst_iterator i = Target.inst_begin(),
1570 e = Target.inst_end(); i != e; ++i) {
1571 InstNS = i->second.Namespace;
1572 if (InstNS != "TargetInstrInfo")
1576 if (!InstNS.empty()) InstNS += "::";
1578 // Group the patterns by their top-level opcodes.
1579 std::map<std::string, std::vector<const PatternToMatch*> > PatternsByOpcode;
1580 // All unique target node emission functions.
1581 std::map<std::string, unsigned> EmitFunctions;
1582 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
1583 E = CGP.ptm_end(); I != E; ++I) {
1584 const PatternToMatch &Pattern = *I;
1586 TreePatternNode *Node = Pattern.getSrcPattern();
1587 if (!Node->isLeaf()) {
1588 PatternsByOpcode[getOpcodeName(Node->getOperator(), CGP)].
1589 push_back(&Pattern);
1591 const ComplexPattern *CP;
1592 if (dynamic_cast<IntInit*>(Node->getLeafValue())) {
1593 PatternsByOpcode[getOpcodeName(CGP.getSDNodeNamed("imm"), CGP)].
1594 push_back(&Pattern);
1595 } else if ((CP = NodeGetComplexPattern(Node, CGP))) {
1596 std::vector<Record*> OpNodes = CP->getRootNodes();
1597 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
1598 PatternsByOpcode[getOpcodeName(OpNodes[j], CGP)]
1599 .insert(PatternsByOpcode[getOpcodeName(OpNodes[j], CGP)].begin(),
1603 cerr << "Unrecognized opcode '";
1605 cerr << "' on tree pattern '";
1606 cerr << Pattern.getDstPattern()->getOperator()->getName() << "'!\n";
1612 // For each opcode, there might be multiple select functions, one per
1613 // ValueType of the node (or its first operand if it doesn't produce a
1614 // non-chain result.
1615 std::map<std::string, std::vector<std::string> > OpcodeVTMap;
1617 // Emit one Select_* method for each top-level opcode. We do this instead of
1618 // emitting one giant switch statement to support compilers where this will
1619 // result in the recursive functions taking less stack space.
1620 for (std::map<std::string, std::vector<const PatternToMatch*> >::iterator
1621 PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end();
1622 PBOI != E; ++PBOI) {
1623 const std::string &OpName = PBOI->first;
1624 std::vector<const PatternToMatch*> &PatternsOfOp = PBOI->second;
1625 assert(!PatternsOfOp.empty() && "No patterns but map has entry?");
1627 // We want to emit all of the matching code now. However, we want to emit
1628 // the matches in order of minimal cost. Sort the patterns so the least
1629 // cost one is at the start.
1630 std::stable_sort(PatternsOfOp.begin(), PatternsOfOp.end(),
1631 PatternSortingPredicate(CGP));
1633 // Split them into groups by type.
1634 std::map<MVT::SimpleValueType,
1635 std::vector<const PatternToMatch*> > PatternsByType;
1636 for (unsigned i = 0, e = PatternsOfOp.size(); i != e; ++i) {
1637 const PatternToMatch *Pat = PatternsOfOp[i];
1638 TreePatternNode *SrcPat = Pat->getSrcPattern();
1639 MVT::SimpleValueType VT = SrcPat->getTypeNum(0);
1640 std::map<MVT::SimpleValueType,
1641 std::vector<const PatternToMatch*> >::iterator TI =
1642 PatternsByType.find(VT);
1643 if (TI != PatternsByType.end())
1644 TI->second.push_back(Pat);
1646 std::vector<const PatternToMatch*> PVec;
1647 PVec.push_back(Pat);
1648 PatternsByType.insert(std::make_pair(VT, PVec));
1652 for (std::map<MVT::SimpleValueType,
1653 std::vector<const PatternToMatch*> >::iterator
1654 II = PatternsByType.begin(), EE = PatternsByType.end(); II != EE;
1656 MVT::SimpleValueType OpVT = II->first;
1657 std::vector<const PatternToMatch*> &Patterns = II->second;
1658 typedef std::vector<std::pair<unsigned,std::string> > CodeList;
1659 typedef std::vector<std::pair<unsigned,std::string> >::iterator CodeListI;
1661 std::vector<std::pair<const PatternToMatch*, CodeList> > CodeForPatterns;
1662 std::vector<std::vector<std::string> > PatternOpcodes;
1663 std::vector<std::vector<std::string> > PatternVTs;
1664 std::vector<std::set<std::string> > PatternDecls;
1665 std::vector<bool> OutputIsVariadicFlags;
1666 std::vector<unsigned> NumInputRootOpsCounts;
1667 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1668 CodeList GeneratedCode;
1669 std::set<std::string> GeneratedDecl;
1670 std::vector<std::string> TargetOpcodes;
1671 std::vector<std::string> TargetVTs;
1672 bool OutputIsVariadic;
1673 unsigned NumInputRootOps;
1674 GenerateCodeForPattern(*Patterns[i], GeneratedCode, GeneratedDecl,
1675 TargetOpcodes, TargetVTs,
1676 OutputIsVariadic, NumInputRootOps);
1677 CodeForPatterns.push_back(std::make_pair(Patterns[i], GeneratedCode));
1678 PatternDecls.push_back(GeneratedDecl);
1679 PatternOpcodes.push_back(TargetOpcodes);
1680 PatternVTs.push_back(TargetVTs);
1681 OutputIsVariadicFlags.push_back(OutputIsVariadic);
1682 NumInputRootOpsCounts.push_back(NumInputRootOps);
1685 // Scan the code to see if all of the patterns are reachable and if it is
1686 // possible that the last one might not match.
1687 bool mightNotMatch = true;
1688 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1689 CodeList &GeneratedCode = CodeForPatterns[i].second;
1690 mightNotMatch = false;
1692 for (unsigned j = 0, e = GeneratedCode.size(); j != e; ++j) {
1693 if (GeneratedCode[j].first == 1) { // predicate.
1694 mightNotMatch = true;
1699 // If this pattern definitely matches, and if it isn't the last one, the
1700 // patterns after it CANNOT ever match. Error out.
1701 if (mightNotMatch == false && i != CodeForPatterns.size()-1) {
1702 cerr << "Pattern '";
1703 CodeForPatterns[i].first->getSrcPattern()->print(*cerr.stream());
1704 cerr << "' is impossible to select!\n";
1709 // Factor target node emission code (emitted by EmitResultCode) into
1710 // separate functions. Uniquing and share them among all instruction
1711 // selection routines.
1712 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1713 CodeList &GeneratedCode = CodeForPatterns[i].second;
1714 std::vector<std::string> &TargetOpcodes = PatternOpcodes[i];
1715 std::vector<std::string> &TargetVTs = PatternVTs[i];
1716 std::set<std::string> Decls = PatternDecls[i];
1717 bool OutputIsVariadic = OutputIsVariadicFlags[i];
1718 unsigned NumInputRootOps = NumInputRootOpsCounts[i];
1719 std::vector<std::string> AddedInits;
1720 int CodeSize = (int)GeneratedCode.size();
1722 for (int j = CodeSize-1; j >= 0; --j) {
1723 if (LastPred == -1 && GeneratedCode[j].first == 1)
1725 else if (LastPred != -1 && GeneratedCode[j].first == 2)
1726 AddedInits.push_back(GeneratedCode[j].second);
1729 std::string CalleeCode = "(const SDOperand &N";
1730 std::string CallerCode = "(N";
1731 for (unsigned j = 0, e = TargetOpcodes.size(); j != e; ++j) {
1732 CalleeCode += ", unsigned Opc" + utostr(j);
1733 CallerCode += ", " + TargetOpcodes[j];
1735 for (unsigned j = 0, e = TargetVTs.size(); j != e; ++j) {
1736 CalleeCode += ", MVT VT" + utostr(j);
1737 CallerCode += ", " + TargetVTs[j];
1739 for (std::set<std::string>::iterator
1740 I = Decls.begin(), E = Decls.end(); I != E; ++I) {
1741 std::string Name = *I;
1742 CalleeCode += ", SDOperand &" + Name;
1743 CallerCode += ", " + Name;
1746 if (OutputIsVariadic) {
1747 CalleeCode += ", unsigned NumInputRootOps";
1748 CallerCode += ", " + utostr(NumInputRootOps);
1753 // Prevent emission routines from being inlined to reduce selection
1754 // routines stack frame sizes.
1755 CalleeCode += "DISABLE_INLINE ";
1756 CalleeCode += "{\n";
1758 for (std::vector<std::string>::const_reverse_iterator
1759 I = AddedInits.rbegin(), E = AddedInits.rend(); I != E; ++I)
1760 CalleeCode += " " + *I + "\n";
1762 for (int j = LastPred+1; j < CodeSize; ++j)
1763 CalleeCode += " " + GeneratedCode[j].second + "\n";
1764 for (int j = LastPred+1; j < CodeSize; ++j)
1765 GeneratedCode.pop_back();
1766 CalleeCode += "}\n";
1768 // Uniquing the emission routines.
1769 unsigned EmitFuncNum;
1770 std::map<std::string, unsigned>::iterator EFI =
1771 EmitFunctions.find(CalleeCode);
1772 if (EFI != EmitFunctions.end()) {
1773 EmitFuncNum = EFI->second;
1775 EmitFuncNum = EmitFunctions.size();
1776 EmitFunctions.insert(std::make_pair(CalleeCode, EmitFuncNum));
1777 OS << "SDNode *Emit_" << utostr(EmitFuncNum) << CalleeCode;
1780 // Replace the emission code within selection routines with calls to the
1781 // emission functions.
1782 CallerCode = "return Emit_" + utostr(EmitFuncNum) + CallerCode;
1783 GeneratedCode.push_back(std::make_pair(false, CallerCode));
1787 std::string OpVTStr;
1788 if (OpVT == MVT::iPTR) {
1790 } else if (OpVT == MVT::isVoid) {
1791 // Nodes with a void result actually have a first result type of either
1792 // Other (a chain) or Flag. Since there is no one-to-one mapping from
1793 // void to this case, we handle it specially here.
1795 OpVTStr = "_" + getEnumName(OpVT).substr(5); // Skip 'MVT::'
1797 std::map<std::string, std::vector<std::string> >::iterator OpVTI =
1798 OpcodeVTMap.find(OpName);
1799 if (OpVTI == OpcodeVTMap.end()) {
1800 std::vector<std::string> VTSet;
1801 VTSet.push_back(OpVTStr);
1802 OpcodeVTMap.insert(std::make_pair(OpName, VTSet));
1804 OpVTI->second.push_back(OpVTStr);
1806 OS << "SDNode *Select_" << getLegalCName(OpName)
1807 << OpVTStr << "(const SDOperand &N) {\n";
1809 // Loop through and reverse all of the CodeList vectors, as we will be
1810 // accessing them from their logical front, but accessing the end of a
1811 // vector is more efficient.
1812 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1813 CodeList &GeneratedCode = CodeForPatterns[i].second;
1814 std::reverse(GeneratedCode.begin(), GeneratedCode.end());
1817 // Next, reverse the list of patterns itself for the same reason.
1818 std::reverse(CodeForPatterns.begin(), CodeForPatterns.end());
1820 // Emit all of the patterns now, grouped together to share code.
1821 EmitPatterns(CodeForPatterns, 2, OS);
1823 // If the last pattern has predicates (which could fail) emit code to
1824 // catch the case where nothing handles a pattern.
1825 if (mightNotMatch) {
1826 OS << " cerr << \"Cannot yet select: \";\n";
1827 if (OpName != "ISD::INTRINSIC_W_CHAIN" &&
1828 OpName != "ISD::INTRINSIC_WO_CHAIN" &&
1829 OpName != "ISD::INTRINSIC_VOID") {
1830 OS << " N.Val->dump(CurDAG);\n";
1832 OS << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
1833 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
1834 << " cerr << \"intrinsic %\"<< "
1835 "Intrinsic::getName((Intrinsic::ID)iid);\n";
1837 OS << " cerr << '\\n';\n"
1839 << " return NULL;\n";
1845 // Emit boilerplate.
1846 OS << "SDNode *Select_INLINEASM(SDOperand N) {\n"
1847 << " std::vector<SDOperand> Ops(N.Val->op_begin(), N.Val->op_end());\n"
1848 << " SelectInlineAsmMemoryOperands(Ops, *CurDAG);\n\n"
1850 << " // Ensure that the asm operands are themselves selected.\n"
1851 << " for (unsigned j = 0, e = Ops.size(); j != e; ++j)\n"
1852 << " AddToISelQueue(Ops[j]);\n\n"
1854 << " std::vector<MVT> VTs;\n"
1855 << " VTs.push_back(MVT::Other);\n"
1856 << " VTs.push_back(MVT::Flag);\n"
1857 << " SDOperand New = CurDAG->getNode(ISD::INLINEASM, VTs, &Ops[0], "
1859 << " return New.Val;\n"
1862 OS << "SDNode *Select_UNDEF(const SDOperand &N) {\n"
1863 << " return CurDAG->getTargetNode(TargetInstrInfo::IMPLICIT_DEF,\n"
1864 << " N.getValueType());\n"
1867 OS << "SDNode *Select_DECLARE(const SDOperand &N) {\n"
1868 << " SDOperand Chain = N.getOperand(0);\n"
1869 << " SDOperand N1 = N.getOperand(1);\n"
1870 << " SDOperand N2 = N.getOperand(2);\n"
1871 << " if (!isa<FrameIndexSDNode>(N1) || !isa<GlobalAddressSDNode>(N2)) {\n"
1872 << " cerr << \"Cannot yet select llvm.dbg.declare: \";\n"
1873 << " N.Val->dump(CurDAG);\n"
1876 << " int FI = cast<FrameIndexSDNode>(N1)->getIndex();\n"
1877 << " GlobalValue *GV = cast<GlobalAddressSDNode>(N2)->getGlobal();\n"
1878 << " SDOperand Tmp1 = "
1879 << "CurDAG->getTargetFrameIndex(FI, TLI.getPointerTy());\n"
1880 << " SDOperand Tmp2 = "
1881 << "CurDAG->getTargetGlobalAddress(GV, TLI.getPointerTy());\n"
1882 << " AddToISelQueue(Chain);\n"
1883 << " SDOperand Ops[] = { Tmp1, Tmp2, Chain };\n"
1884 << " return CurDAG->getTargetNode(TargetInstrInfo::DECLARE,\n"
1885 << " MVT::Other, Ops, 3);\n"
1888 OS << "SDNode *Select_EXTRACT_SUBREG(const SDOperand &N) {\n"
1889 << " SDOperand N0 = N.getOperand(0);\n"
1890 << " SDOperand N1 = N.getOperand(1);\n"
1891 << " unsigned C = cast<ConstantSDNode>(N1)->getValue();\n"
1892 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
1893 << " AddToISelQueue(N0);\n"
1894 << " SDOperand Ops[] = { N0, Tmp };\n"
1895 << " return CurDAG->getTargetNode(TargetInstrInfo::EXTRACT_SUBREG,\n"
1896 << " N.getValueType(), Ops, 2);\n"
1899 OS << "SDNode *Select_INSERT_SUBREG(const SDOperand &N) {\n"
1900 << " SDOperand N0 = N.getOperand(0);\n"
1901 << " SDOperand N1 = N.getOperand(1);\n"
1902 << " SDOperand N2 = N.getOperand(2);\n"
1903 << " unsigned C = cast<ConstantSDNode>(N2)->getValue();\n"
1904 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
1905 << " AddToISelQueue(N1);\n"
1906 << " SDOperand Ops[] = { N0, N1, Tmp };\n"
1907 << " AddToISelQueue(N0);\n"
1908 << " return CurDAG->getTargetNode(TargetInstrInfo::INSERT_SUBREG,\n"
1909 << " N.getValueType(), Ops, 3);\n"
1912 OS << "// The main instruction selector code.\n"
1913 << "SDNode *SelectCode(SDOperand N) {\n"
1914 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
1915 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
1916 << "INSTRUCTION_LIST_END)) {\n"
1917 << " return NULL; // Already selected.\n"
1919 << " MVT::SimpleValueType NVT = N.Val->getValueType(0).getSimpleVT();\n"
1920 << " switch (N.getOpcode()) {\n"
1921 << " default: break;\n"
1922 << " case ISD::EntryToken: // These leaves remain the same.\n"
1923 << " case ISD::BasicBlock:\n"
1924 << " case ISD::Register:\n"
1925 << " case ISD::HANDLENODE:\n"
1926 << " case ISD::TargetConstant:\n"
1927 << " case ISD::TargetConstantFP:\n"
1928 << " case ISD::TargetConstantPool:\n"
1929 << " case ISD::TargetFrameIndex:\n"
1930 << " case ISD::TargetExternalSymbol:\n"
1931 << " case ISD::TargetJumpTable:\n"
1932 << " case ISD::TargetGlobalTLSAddress:\n"
1933 << " case ISD::TargetGlobalAddress: {\n"
1934 << " return NULL;\n"
1936 << " case ISD::AssertSext:\n"
1937 << " case ISD::AssertZext: {\n"
1938 << " AddToISelQueue(N.getOperand(0));\n"
1939 << " ReplaceUses(N, N.getOperand(0));\n"
1940 << " return NULL;\n"
1942 << " case ISD::TokenFactor:\n"
1943 << " case ISD::CopyFromReg:\n"
1944 << " case ISD::CopyToReg: {\n"
1945 << " case ISD::DBG_LABEL:\n"
1946 << " case ISD::EH_LABEL:\n"
1947 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)\n"
1948 << " AddToISelQueue(N.getOperand(i));\n"
1949 << " return NULL;\n"
1951 << " case ISD::INLINEASM: return Select_INLINEASM(N);\n"
1952 << " case ISD::DECLARE: return Select_DECLARE(N);\n"
1953 << " case ISD::EXTRACT_SUBREG: return Select_EXTRACT_SUBREG(N);\n"
1954 << " case ISD::INSERT_SUBREG: return Select_INSERT_SUBREG(N);\n"
1955 << " case ISD::UNDEF: return Select_UNDEF(N);\n";
1958 // Loop over all of the case statements, emiting a call to each method we
1960 for (std::map<std::string, std::vector<const PatternToMatch*> >::iterator
1961 PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end();
1962 PBOI != E; ++PBOI) {
1963 const std::string &OpName = PBOI->first;
1964 // Potentially multiple versions of select for this opcode. One for each
1965 // ValueType of the node (or its first true operand if it doesn't produce a
1967 std::map<std::string, std::vector<std::string> >::iterator OpVTI =
1968 OpcodeVTMap.find(OpName);
1969 std::vector<std::string> &OpVTs = OpVTI->second;
1970 OS << " case " << OpName << ": {\n";
1971 // Keep track of whether we see a pattern that has an iPtr result.
1972 bool HasPtrPattern = false;
1973 bool HasDefaultPattern = false;
1975 OS << " switch (NVT) {\n";
1976 for (unsigned i = 0, e = OpVTs.size(); i < e; ++i) {
1977 std::string &VTStr = OpVTs[i];
1978 if (VTStr.empty()) {
1979 HasDefaultPattern = true;
1983 // If this is a match on iPTR: don't emit it directly, we need special
1985 if (VTStr == "_iPTR") {
1986 HasPtrPattern = true;
1989 OS << " case MVT::" << VTStr.substr(1) << ":\n"
1990 << " return Select_" << getLegalCName(OpName)
1991 << VTStr << "(N);\n";
1993 OS << " default:\n";
1995 // If there is an iPTR result version of this pattern, emit it here.
1996 if (HasPtrPattern) {
1997 OS << " if (TLI.getPointerTy() == NVT)\n";
1998 OS << " return Select_" << getLegalCName(OpName) <<"_iPTR(N);\n";
2000 if (HasDefaultPattern) {
2001 OS << " return Select_" << getLegalCName(OpName) << "(N);\n";
2009 OS << " } // end of big switch.\n\n"
2010 << " cerr << \"Cannot yet select: \";\n"
2011 << " if (N.getOpcode() != ISD::INTRINSIC_W_CHAIN &&\n"
2012 << " N.getOpcode() != ISD::INTRINSIC_WO_CHAIN &&\n"
2013 << " N.getOpcode() != ISD::INTRINSIC_VOID) {\n"
2014 << " N.Val->dump(CurDAG);\n"
2016 << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
2017 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
2018 << " cerr << \"intrinsic %\"<< "
2019 "Intrinsic::getName((Intrinsic::ID)iid);\n"
2021 << " cerr << '\\n';\n"
2023 << " return NULL;\n"
2027 void DAGISelEmitter::run(std::ostream &OS) {
2028 EmitSourceFileHeader("DAG Instruction Selector for the " +
2029 CGP.getTargetInfo().getName() + " target", OS);
2031 OS << "// *** NOTE: This file is #included into the middle of the target\n"
2032 << "// *** instruction selector class. These functions are really "
2035 OS << "// Include standard, target-independent definitions and methods used\n"
2036 << "// by the instruction selector.\n";
2037 OS << "#include <llvm/CodeGen/DAGISelHeader.h>\n\n";
2039 EmitNodeTransforms(OS);
2040 EmitPredicateFunctions(OS);
2042 DOUT << "\n\nALL PATTERNS TO MATCH:\n\n";
2043 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), E = CGP.ptm_end();
2045 DOUT << "PATTERN: "; DEBUG(I->getSrcPattern()->dump());
2046 DOUT << "\nRESULT: "; DEBUG(I->getDstPattern()->dump());
2050 // At this point, we have full information about the 'Patterns' we need to
2051 // parse, both implicitly from instructions as well as from explicit pattern
2052 // definitions. Emit the resultant instruction selector.
2053 EmitInstructionSelector(OS);