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"
15 #include "DAGISelMatcher.h"
17 #include "llvm/ADT/StringExtras.h"
18 #include "llvm/Support/CommandLine.h"
19 #include "llvm/Support/Debug.h"
20 #include "llvm/Support/MathExtras.h"
21 #include "llvm/Support/Debug.h"
28 GenDebug("gen-debug", cl::desc("Generate debug code"), cl::init(false));
30 //===----------------------------------------------------------------------===//
31 // DAGISelEmitter Helper methods
34 /// getNodeName - The top level Select_* functions have an "SDNode* N"
35 /// argument. When expanding the pattern-matching code, the intermediate
36 /// variables have type SDValue. This function provides a uniform way to
37 /// reference the underlying "SDNode *" for both cases.
38 static std::string getNodeName(const std::string &S) {
39 if (S == "N") return S;
40 return S + ".getNode()";
43 /// getNodeValue - Similar to getNodeName, except it provides a uniform
44 /// way to access the SDValue for both cases.
45 static std::string getValueName(const std::string &S) {
46 if (S == "N") return "SDValue(N, 0)";
50 /// NodeIsComplexPattern - return true if N is a leaf node and a subclass of
52 static bool NodeIsComplexPattern(TreePatternNode *N) {
53 return (N->isLeaf() &&
54 dynamic_cast<DefInit*>(N->getLeafValue()) &&
55 static_cast<DefInit*>(N->getLeafValue())->getDef()->
56 isSubClassOf("ComplexPattern"));
60 /// getPatternSize - Return the 'size' of this pattern. We want to match large
61 /// patterns before small ones. This is used to determine the size of a
63 static unsigned getPatternSize(TreePatternNode *P, CodeGenDAGPatterns &CGP) {
64 assert((EEVT::isExtIntegerInVTs(P->getExtTypes()) ||
65 EEVT::isExtFloatingPointInVTs(P->getExtTypes()) ||
66 P->getExtTypeNum(0) == MVT::isVoid ||
67 P->getExtTypeNum(0) == MVT::Flag ||
68 P->getExtTypeNum(0) == MVT::iPTR ||
69 P->getExtTypeNum(0) == MVT::iPTRAny) &&
70 "Not a valid pattern node to size!");
71 unsigned Size = 3; // The node itself.
72 // If the root node is a ConstantSDNode, increases its size.
73 // e.g. (set R32:$dst, 0).
74 if (P->isLeaf() && dynamic_cast<IntInit*>(P->getLeafValue()))
77 // FIXME: This is a hack to statically increase the priority of patterns
78 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
79 // Later we can allow complexity / cost for each pattern to be (optionally)
80 // specified. To get best possible pattern match we'll need to dynamically
81 // calculate the complexity of all patterns a dag can potentially map to.
82 const ComplexPattern *AM = P->getComplexPatternInfo(CGP);
84 Size += AM->getNumOperands() * 3;
86 // If this node has some predicate function that must match, it adds to the
87 // complexity of this node.
88 if (!P->getPredicateFns().empty())
91 // Count children in the count if they are also nodes.
92 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
93 TreePatternNode *Child = P->getChild(i);
94 if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
95 Size += getPatternSize(Child, CGP);
96 else if (Child->isLeaf()) {
97 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
98 Size += 5; // Matches a ConstantSDNode (+3) and a specific value (+2).
99 else if (NodeIsComplexPattern(Child))
100 Size += getPatternSize(Child, CGP);
101 else if (!Child->getPredicateFns().empty())
109 /// getResultPatternCost - Compute the number of instructions for this pattern.
110 /// This is a temporary hack. We should really include the instruction
111 /// latencies in this calculation.
112 static unsigned getResultPatternCost(TreePatternNode *P,
113 CodeGenDAGPatterns &CGP) {
114 if (P->isLeaf()) return 0;
117 Record *Op = P->getOperator();
118 if (Op->isSubClassOf("Instruction")) {
120 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op->getName());
121 if (II.usesCustomInserter)
124 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
125 Cost += getResultPatternCost(P->getChild(i), CGP);
129 /// getResultPatternCodeSize - Compute the code size of instructions for this
131 static unsigned getResultPatternSize(TreePatternNode *P,
132 CodeGenDAGPatterns &CGP) {
133 if (P->isLeaf()) return 0;
136 Record *Op = P->getOperator();
137 if (Op->isSubClassOf("Instruction")) {
138 Cost += Op->getValueAsInt("CodeSize");
140 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
141 Cost += getResultPatternSize(P->getChild(i), CGP);
145 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
146 // In particular, we want to match maximal patterns first and lowest cost within
147 // a particular complexity first.
148 struct PatternSortingPredicate {
149 PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {}
150 CodeGenDAGPatterns &CGP;
152 typedef std::pair<unsigned, std::string> CodeLine;
153 typedef std::vector<CodeLine> CodeList;
154 typedef std::vector<std::pair<const PatternToMatch*, CodeList> > PatternList;
156 bool operator()(const std::pair<const PatternToMatch*, CodeList> &LHSPair,
157 const std::pair<const PatternToMatch*, CodeList> &RHSPair) {
158 const PatternToMatch *LHS = LHSPair.first;
159 const PatternToMatch *RHS = RHSPair.first;
161 unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), CGP);
162 unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), CGP);
163 LHSSize += LHS->getAddedComplexity();
164 RHSSize += RHS->getAddedComplexity();
165 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
166 if (LHSSize < RHSSize) return false;
168 // If the patterns have equal complexity, compare generated instruction cost
169 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP);
170 unsigned RHSCost = getResultPatternCost(RHS->getDstPattern(), CGP);
171 if (LHSCost < RHSCost) return true;
172 if (LHSCost > RHSCost) return false;
174 return getResultPatternSize(LHS->getDstPattern(), CGP) <
175 getResultPatternSize(RHS->getDstPattern(), CGP);
179 /// getRegisterValueType - Look up and return the ValueType of the specified
180 /// register. If the register is a member of multiple register classes which
181 /// have different associated types, return MVT::Other.
182 static MVT::SimpleValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
183 bool FoundRC = false;
184 MVT::SimpleValueType VT = MVT::Other;
185 const std::vector<CodeGenRegisterClass> &RCs = T.getRegisterClasses();
186 std::vector<CodeGenRegisterClass>::const_iterator RC;
187 std::vector<Record*>::const_iterator Element;
189 for (RC = RCs.begin() ; RC != RCs.end() ; RC++) {
190 Element = find((*RC).Elements.begin(), (*RC).Elements.end(), R);
191 if (Element != (*RC).Elements.end()) {
194 VT = (*RC).getValueTypeNum(0);
197 if (VT != (*RC).getValueTypeNum(0)) {
198 // Types of the RC's do not agree. Return MVT::Other. The
199 // target is responsible for handling this.
208 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) {
209 return CGP.getSDNodeInfo(Op).getEnumName();
212 //===----------------------------------------------------------------------===//
213 // Node Transformation emitter implementation.
215 void DAGISelEmitter::EmitNodeTransforms(raw_ostream &OS) {
216 // Walk the pattern fragments, adding them to a map, which sorts them by
218 typedef std::map<std::string, CodeGenDAGPatterns::NodeXForm> NXsByNameTy;
219 NXsByNameTy NXsByName;
221 for (CodeGenDAGPatterns::nx_iterator I = CGP.nx_begin(), E = CGP.nx_end();
223 NXsByName.insert(std::make_pair(I->first->getName(), I->second));
225 OS << "\n// Node transformations.\n";
227 for (NXsByNameTy::iterator I = NXsByName.begin(), E = NXsByName.end();
229 Record *SDNode = I->second.first;
230 std::string Code = I->second.second;
232 if (Code.empty()) continue; // Empty code? Skip it.
234 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName();
235 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
237 OS << "inline SDValue Transform_" << I->first << "(SDNode *" << C2
239 if (ClassName != "SDNode")
240 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
241 OS << Code << "\n}\n";
245 //===----------------------------------------------------------------------===//
246 // Predicate emitter implementation.
249 void DAGISelEmitter::EmitPredicateFunctions(raw_ostream &OS) {
250 OS << "\n// Predicate functions.\n";
252 // Walk the pattern fragments, adding them to a map, which sorts them by
254 typedef std::map<std::string, std::pair<Record*, TreePattern*> > PFsByNameTy;
255 PFsByNameTy PFsByName;
257 for (CodeGenDAGPatterns::pf_iterator I = CGP.pf_begin(), E = CGP.pf_end();
259 PFsByName.insert(std::make_pair(I->first->getName(), *I));
262 for (PFsByNameTy::iterator I = PFsByName.begin(), E = PFsByName.end();
264 Record *PatFragRecord = I->second.first;// Record that derives from PatFrag.
265 TreePattern *P = I->second.second;
267 // If there is a code init for this fragment, emit the predicate code.
268 std::string Code = PatFragRecord->getValueAsCode("Predicate");
269 if (Code.empty()) continue;
271 if (P->getOnlyTree()->isLeaf())
272 OS << "inline bool Predicate_" << PatFragRecord->getName()
273 << "(SDNode *N) {\n";
275 std::string ClassName =
276 CGP.getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
277 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
279 OS << "inline bool Predicate_" << PatFragRecord->getName()
280 << "(SDNode *" << C2 << ") {\n";
281 if (ClassName != "SDNode")
282 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
284 OS << Code << "\n}\n";
291 //===----------------------------------------------------------------------===//
292 // PatternCodeEmitter implementation.
294 class PatternCodeEmitter {
296 CodeGenDAGPatterns &CGP;
299 std::string PredicateCheck;
302 // Instruction selector pattern.
303 TreePatternNode *Pattern;
304 // Matched instruction.
305 TreePatternNode *Instruction;
307 // Node to name mapping
308 std::map<std::string, std::string> VariableMap;
309 // Node to operator mapping
310 std::map<std::string, Record*> OperatorMap;
311 // Name of the folded node which produces a flag.
312 std::pair<std::string, unsigned> FoldedFlag;
313 // Names of all the folded nodes which produce chains.
314 std::vector<std::pair<std::string, unsigned> > FoldedChains;
315 // Original input chain(s).
316 std::vector<std::pair<std::string, std::string> > OrigChains;
317 std::set<std::string> Duplicates;
319 /// LSI - Load/Store information.
320 /// Save loads/stores matched by a pattern, and generate a MemOperandSDNode
321 /// for each memory access. This facilitates the use of AliasAnalysis in
323 std::vector<std::string> LSI;
325 /// GeneratedCode - This is the buffer that we emit code to. The first int
326 /// indicates whether this is an exit predicate (something that should be
327 /// tested, and if true, the match fails) [when 1], or normal code to emit
328 /// [when 0], or initialization code to emit [when 2].
329 std::vector<std::pair<unsigned, std::string> > &GeneratedCode;
330 /// GeneratedDecl - This is the set of all SDValue declarations needed for
331 /// the set of patterns for each top-level opcode.
332 std::set<std::string> &GeneratedDecl;
333 /// TargetOpcodes - The target specific opcodes used by the resulting
335 std::vector<std::string> &TargetOpcodes;
336 std::vector<std::string> &TargetVTs;
337 /// OutputIsVariadic - Records whether the instruction output pattern uses
338 /// variable_ops. This requires that the Emit function be passed an
339 /// additional argument to indicate where the input varargs operands
341 bool &OutputIsVariadic;
342 /// NumInputRootOps - Records the number of operands the root node of the
343 /// input pattern has. This information is used in the generated code to
344 /// pass to Emit functions when variable_ops processing is needed.
345 unsigned &NumInputRootOps;
347 std::string ChainName;
352 void emitCheck(const std::string &S) {
354 GeneratedCode.push_back(std::make_pair(1, S));
356 void emitCode(const std::string &S) {
358 GeneratedCode.push_back(std::make_pair(0, S));
360 void emitInit(const std::string &S) {
362 GeneratedCode.push_back(std::make_pair(2, S));
364 void emitDecl(const std::string &S) {
365 assert(!S.empty() && "Invalid declaration");
366 GeneratedDecl.insert(S);
368 void emitOpcode(const std::string &Opc) {
369 TargetOpcodes.push_back(Opc);
372 void emitVT(const std::string &VT) {
373 TargetVTs.push_back(VT);
377 PatternCodeEmitter(CodeGenDAGPatterns &cgp, std::string predcheck,
378 TreePatternNode *pattern, TreePatternNode *instr,
379 std::vector<std::pair<unsigned, std::string> > &gc,
380 std::set<std::string> &gd,
381 std::vector<std::string> &to,
382 std::vector<std::string> &tv,
385 : CGP(cgp), PredicateCheck(predcheck), Pattern(pattern), Instruction(instr),
386 GeneratedCode(gc), GeneratedDecl(gd),
387 TargetOpcodes(to), TargetVTs(tv),
388 OutputIsVariadic(oiv), NumInputRootOps(niro),
389 TmpNo(0), OpcNo(0), VTNo(0) {}
391 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
392 /// if the match fails. At this point, we already know that the opcode for N
393 /// matches, and the SDNode for the result has the RootName specified name.
394 void EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
395 const std::string &RootName, const std::string &ChainSuffix,
398 void EmitChildMatchCode(TreePatternNode *Child, TreePatternNode *Parent,
399 const std::string &RootName,
400 const std::string &ChainSuffix, bool &FoundChain);
402 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
403 /// we actually have to build a DAG!
404 std::vector<std::string>
405 EmitResultCode(TreePatternNode *N, std::vector<Record*> DstRegs,
406 bool InFlagDecled, bool ResNodeDecled,
407 bool LikeLeaf = false, bool isRoot = false);
409 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat'
410 /// and add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
411 /// 'Pat' may be missing types. If we find an unresolved type to add a check
412 /// for, this returns true otherwise false if Pat has all types.
413 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
414 const std::string &Prefix, bool isRoot = false) {
416 if (Pat->getExtTypes() != Other->getExtTypes()) {
417 // Move a type over from 'other' to 'pat'.
418 Pat->setTypes(Other->getExtTypes());
419 // The top level node type is checked outside of the select function.
421 emitCheck(Prefix + ".getValueType() == " +
422 getName(Pat->getTypeNum(0)));
426 unsigned OpNo = (unsigned)Pat->NodeHasProperty(SDNPHasChain, CGP);
427 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
428 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
429 Prefix + utostr(OpNo)))
435 /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is
437 void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName,
438 bool &ChainEmitted, bool &InFlagDecled,
439 bool &ResNodeDecled, bool isRoot = false) {
440 const CodeGenTarget &T = CGP.getTargetInfo();
441 unsigned OpNo = (unsigned)N->NodeHasProperty(SDNPHasChain, CGP);
442 bool HasInFlag = N->NodeHasProperty(SDNPInFlag, CGP);
443 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
444 TreePatternNode *Child = N->getChild(i);
445 if (!Child->isLeaf()) {
446 EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted,
447 InFlagDecled, ResNodeDecled);
449 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
450 if (!Child->getName().empty()) {
451 std::string Name = RootName + utostr(OpNo);
452 if (Duplicates.find(Name) != Duplicates.end())
453 // A duplicate! Do not emit a copy for this node.
457 Record *RR = DI->getDef();
458 if (RR->isSubClassOf("Register")) {
459 MVT::SimpleValueType RVT = getRegisterValueType(RR, T);
460 if (RVT == MVT::Flag) {
462 emitCode("SDValue InFlag = " +
463 getValueName(RootName + utostr(OpNo)) + ";");
466 emitCode("InFlag = " +
467 getValueName(RootName + utostr(OpNo)) + ";");
470 emitCode("SDValue Chain = CurDAG->getEntryNode();");
475 emitCode("SDValue InFlag(0, 0);");
478 std::string Decl = (!ResNodeDecled) ? "SDNode *" : "";
479 emitCode(Decl + "ResNode = CurDAG->getCopyToReg(" + ChainName +
480 ", " + getNodeName(RootName) + "->getDebugLoc()" +
481 ", " + getQualifiedName(RR) +
482 ", " + getValueName(RootName + utostr(OpNo)) +
483 ", InFlag).getNode();");
484 ResNodeDecled = true;
485 emitCode(ChainName + " = SDValue(ResNode, 0);");
486 emitCode("InFlag = SDValue(ResNode, 1);");
495 emitCode("SDValue InFlag = " + getNodeName(RootName) +
496 "->getOperand(" + utostr(OpNo) + ");");
499 emitCode("InFlag = " + getNodeName(RootName) +
500 "->getOperand(" + utostr(OpNo) + ");");
506 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
507 /// if the match fails. At this point, we already know that the opcode for N
508 /// matches, and the SDNode for the result has the RootName specified name.
509 void PatternCodeEmitter::EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
510 const std::string &RootName,
511 const std::string &ChainSuffix,
514 // Save loads/stores matched by a pattern.
515 if (!N->isLeaf() && N->getName().empty()) {
516 if (N->NodeHasProperty(SDNPMemOperand, CGP))
517 LSI.push_back(getNodeName(RootName));
520 bool isRoot = (P == NULL);
521 // Emit instruction predicates. Each predicate is just a string for now.
523 // Record input varargs info.
524 NumInputRootOps = N->getNumChildren();
525 emitCheck(PredicateCheck);
529 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
530 emitCheck("cast<ConstantSDNode>(" + getNodeName(RootName) +
531 ")->getSExtValue() == INT64_C(" +
532 itostr(II->getValue()) + ")");
534 } else if (!NodeIsComplexPattern(N)) {
535 assert(0 && "Cannot match this as a leaf value!");
540 // If this node has a name associated with it, capture it in VariableMap. If
541 // we already saw this in the pattern, emit code to verify dagness.
542 if (!N->getName().empty()) {
543 std::string &VarMapEntry = VariableMap[N->getName()];
544 if (VarMapEntry.empty()) {
545 VarMapEntry = RootName;
547 // If we get here, this is a second reference to a specific name. Since
548 // we already have checked that the first reference is valid, we don't
549 // have to recursively match it, just check that it's the same as the
550 // previously named thing.
551 emitCheck(VarMapEntry + " == " + RootName);
556 OperatorMap[N->getName()] = N->getOperator();
560 // Emit code to load the child nodes and match their contents recursively.
562 bool NodeHasChain = N->NodeHasProperty(SDNPHasChain, CGP);
563 bool HasChain = N->TreeHasProperty(SDNPHasChain, CGP);
564 bool EmittedUseCheck = false;
569 // Check if it's profitable to fold the node. e.g. Check for multiple uses
571 std::string ParentName(RootName.begin(), RootName.end()-1);
572 emitCheck("IsProfitableToFold(" + getValueName(RootName) +
573 ", " + getNodeName(ParentName) + ", N)");
574 EmittedUseCheck = true;
576 // If the immediate use can somehow reach this node through another
577 // path, then can't fold it either or it will create a cycle.
578 // e.g. In the following diagram, XX can reach ld through YY. If
579 // ld is folded into XX, then YY is both a predecessor and a successor
589 bool NeedCheck = P != Pattern;
591 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(P->getOperator());
593 P->getOperator() == CGP.get_intrinsic_void_sdnode() ||
594 P->getOperator() == CGP.get_intrinsic_w_chain_sdnode() ||
595 P->getOperator() == CGP.get_intrinsic_wo_chain_sdnode() ||
596 PInfo.getNumOperands() > 1 ||
597 PInfo.hasProperty(SDNPHasChain) ||
598 PInfo.hasProperty(SDNPInFlag) ||
599 PInfo.hasProperty(SDNPOptInFlag);
603 emitCheck("IsLegalToFold(" + getValueName(RootName) +
604 ", " + getNodeName(ParentName) + ", N)");
611 emitCheck("(" + ChainName + ".getNode() == " +
612 getNodeName(RootName) + " || "
613 "IsChainCompatible(" + ChainName + ".getNode(), " +
614 getNodeName(RootName) + "))");
615 OrigChains.push_back(std::make_pair(ChainName,
616 getValueName(RootName)));
619 ChainName = "Chain" + ChainSuffix;
620 emitInit("SDValue " + ChainName + " = " + getNodeName(RootName) +
625 // Don't fold any node which reads or writes a flag and has multiple uses.
626 // FIXME: We really need to separate the concepts of flag and "glue". Those
627 // real flag results, e.g. X86CMP output, can have multiple uses.
628 // FIXME: If the optional incoming flag does not exist. Then it is ok to
631 (N->TreeHasProperty(SDNPInFlag, CGP) ||
632 N->TreeHasProperty(SDNPOptInFlag, CGP) ||
633 N->TreeHasProperty(SDNPOutFlag, CGP))) {
634 if (!EmittedUseCheck) {
635 // Multiple uses of actual result?
636 emitCheck(getValueName(RootName) + ".hasOneUse()");
640 // If there are node predicates for this, emit the calls.
641 for (unsigned i = 0, e = N->getPredicateFns().size(); i != e; ++i)
642 emitCheck(N->getPredicateFns()[i] + "(" + getNodeName(RootName) + ")");
644 // If this is an 'and R, 1234' where the operation is AND/OR and the RHS is
645 // a constant without a predicate fn that has more that one bit set, handle
646 // this as a special case. This is usually for targets that have special
647 // handling of certain large constants (e.g. alpha with it's 8/16/32-bit
648 // handling stuff). Using these instructions is often far more efficient
649 // than materializing the constant. Unfortunately, both the instcombiner
650 // and the dag combiner can often infer that bits are dead, and thus drop
651 // them from the mask in the dag. For example, it might turn 'AND X, 255'
652 // into 'AND X, 254' if it knows the low bit is set. Emit code that checks
655 (N->getOperator()->getName() == "and" ||
656 N->getOperator()->getName() == "or") &&
657 N->getChild(1)->isLeaf() &&
658 N->getChild(1)->getPredicateFns().empty()) {
659 if (IntInit *II = dynamic_cast<IntInit*>(N->getChild(1)->getLeafValue())) {
660 if (!isPowerOf2_32(II->getValue())) { // Don't bother with single bits.
661 emitInit("SDValue " + RootName + "0" + " = " +
662 getNodeName(RootName) + "->getOperand(" + utostr(0) + ");");
663 emitInit("SDValue " + RootName + "1" + " = " +
664 getNodeName(RootName) + "->getOperand(" + utostr(1) + ");");
666 unsigned NTmp = TmpNo++;
667 emitCode("ConstantSDNode *Tmp" + utostr(NTmp) +
668 " = dyn_cast<ConstantSDNode>(" +
669 getNodeName(RootName + "1") + ");");
670 emitCheck("Tmp" + utostr(NTmp));
671 const char *MaskPredicate = N->getOperator()->getName() == "or"
672 ? "CheckOrMask(" : "CheckAndMask(";
673 emitCheck(MaskPredicate + getValueName(RootName + "0") +
674 ", Tmp" + utostr(NTmp) +
675 ", INT64_C(" + itostr(II->getValue()) + "))");
677 EmitChildMatchCode(N->getChild(0), N, RootName + utostr(0),
678 ChainSuffix + utostr(0), FoundChain);
684 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
685 emitInit("SDValue " + getValueName(RootName + utostr(OpNo)) + " = " +
686 getNodeName(RootName) + "->getOperand(" + utostr(OpNo) + ");");
688 EmitChildMatchCode(N->getChild(i), N, RootName + utostr(OpNo),
689 ChainSuffix + utostr(OpNo), FoundChain);
692 // Handle cases when root is a complex pattern.
693 const ComplexPattern *CP;
694 if (isRoot && N->isLeaf() && (CP = N->getComplexPatternInfo(CGP))) {
695 std::string Fn = CP->getSelectFunc();
696 unsigned NumOps = CP->getNumOperands();
697 for (unsigned i = 0; i < NumOps; ++i) {
698 emitDecl("CPTmp" + RootName + "_" + utostr(i));
699 emitCode("SDValue CPTmp" + RootName + "_" + utostr(i) + ";");
701 if (CP->hasProperty(SDNPHasChain)) {
702 emitDecl("CPInChain");
703 emitDecl("Chain" + ChainSuffix);
704 emitCode("SDValue CPInChain;");
705 emitCode("SDValue Chain" + ChainSuffix + ";");
708 std::string Code = Fn + "(" +
709 getNodeName(RootName) + ", " +
710 getValueName(RootName);
711 for (unsigned i = 0; i < NumOps; i++)
712 Code += ", CPTmp" + RootName + "_" + utostr(i);
713 if (CP->hasProperty(SDNPHasChain)) {
714 ChainName = "Chain" + ChainSuffix;
715 Code += ", CPInChain, Chain" + ChainSuffix;
717 emitCheck(Code + ")");
721 void PatternCodeEmitter::EmitChildMatchCode(TreePatternNode *Child,
722 TreePatternNode *Parent,
723 const std::string &RootName,
724 const std::string &ChainSuffix,
726 if (!Child->isLeaf()) {
727 // If it's not a leaf, recursively match.
728 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(Child->getOperator());
729 emitCheck(getNodeName(RootName) + "->getOpcode() == " +
730 CInfo.getEnumName());
731 EmitMatchCode(Child, Parent, RootName, ChainSuffix, FoundChain);
732 bool HasChain = false;
733 if (Child->NodeHasProperty(SDNPHasChain, CGP)) {
735 FoldedChains.push_back(std::make_pair(getValueName(RootName),
736 CInfo.getNumResults()));
738 if (Child->NodeHasProperty(SDNPOutFlag, CGP)) {
739 assert(FoldedFlag.first == "" && FoldedFlag.second == 0 &&
740 "Pattern folded multiple nodes which produce flags?");
741 FoldedFlag = std::make_pair(getValueName(RootName),
742 CInfo.getNumResults() + (unsigned)HasChain);
745 // If this child has a name associated with it, capture it in VarMap. If
746 // we already saw this in the pattern, emit code to verify dagness.
747 if (!Child->getName().empty()) {
748 std::string &VarMapEntry = VariableMap[Child->getName()];
749 if (VarMapEntry.empty()) {
750 VarMapEntry = getValueName(RootName);
752 // If we get here, this is a second reference to a specific name.
753 // Since we already have checked that the first reference is valid,
754 // we don't have to recursively match it, just check that it's the
755 // same as the previously named thing.
756 emitCheck(VarMapEntry + " == " + getValueName(RootName));
757 Duplicates.insert(getValueName(RootName));
762 // Handle leaves of various types.
763 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
764 Record *LeafRec = DI->getDef();
765 if (LeafRec->isSubClassOf("RegisterClass") ||
766 LeafRec->isSubClassOf("PointerLikeRegClass")) {
767 // Handle register references. Nothing to do here.
768 } else if (LeafRec->isSubClassOf("Register")) {
769 // Handle register references.
770 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
771 // Handle complex pattern.
772 const ComplexPattern *CP = Child->getComplexPatternInfo(CGP);
773 std::string Fn = CP->getSelectFunc();
774 unsigned NumOps = CP->getNumOperands();
775 for (unsigned i = 0; i < NumOps; ++i) {
776 emitDecl("CPTmp" + RootName + "_" + utostr(i));
777 emitCode("SDValue CPTmp" + RootName + "_" + utostr(i) + ";");
779 if (CP->hasProperty(SDNPHasChain)) {
780 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Parent->getOperator());
781 FoldedChains.push_back(std::make_pair("CPInChain",
782 PInfo.getNumResults()));
783 ChainName = "Chain" + ChainSuffix;
784 emitDecl("CPInChain");
786 emitCode("SDValue CPInChain;");
787 emitCode("SDValue " + ChainName + ";");
790 std::string Code = Fn + "(N, ";
791 if (CP->hasProperty(SDNPHasChain)) {
792 std::string ParentName(RootName.begin(), RootName.end()-1);
793 Code += getValueName(ParentName) + ", ";
795 Code += getValueName(RootName);
796 for (unsigned i = 0; i < NumOps; i++)
797 Code += ", CPTmp" + RootName + "_" + utostr(i);
798 if (CP->hasProperty(SDNPHasChain))
799 Code += ", CPInChain, Chain" + ChainSuffix;
800 emitCheck(Code + ")");
801 } else if (LeafRec->getName() == "srcvalue") {
802 // Place holder for SRCVALUE nodes. Nothing to do here.
803 } else if (LeafRec->isSubClassOf("ValueType")) {
804 // Make sure this is the specified value type.
805 emitCheck("cast<VTSDNode>(" + getNodeName(RootName) +
806 ")->getVT() == MVT::" + LeafRec->getName());
807 } else if (LeafRec->isSubClassOf("CondCode")) {
808 // Make sure this is the specified cond code.
809 emitCheck("cast<CondCodeSDNode>(" + getNodeName(RootName) +
810 ")->get() == ISD::" + LeafRec->getName());
816 assert(0 && "Unknown leaf type!");
819 // If there are node predicates for this, emit the calls.
820 for (unsigned i = 0, e = Child->getPredicateFns().size(); i != e; ++i)
821 emitCheck(Child->getPredicateFns()[i] + "(" + getNodeName(RootName) +
823 } else if (IntInit *II =
824 dynamic_cast<IntInit*>(Child->getLeafValue())) {
825 unsigned NTmp = TmpNo++;
826 emitCode("ConstantSDNode *Tmp"+ utostr(NTmp) +
827 " = dyn_cast<ConstantSDNode>("+
828 getNodeName(RootName) + ");");
829 emitCheck("Tmp" + utostr(NTmp));
830 unsigned CTmp = TmpNo++;
831 emitCode("int64_t CN"+ utostr(CTmp) +
832 " = Tmp" + utostr(NTmp) + "->getSExtValue();");
833 emitCheck("CN" + utostr(CTmp) + " == "
834 "INT64_C(" +itostr(II->getValue()) + ")");
839 assert(0 && "Unknown leaf type!");
844 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
845 /// we actually have to build a DAG!
846 std::vector<std::string>
847 PatternCodeEmitter::EmitResultCode(TreePatternNode *N,
848 std::vector<Record*> DstRegs,
849 bool InFlagDecled, bool ResNodeDecled,
850 bool LikeLeaf, bool isRoot) {
851 // List of arguments of getMachineNode() or SelectNodeTo().
852 std::vector<std::string> NodeOps;
853 // This is something selected from the pattern we matched.
854 if (!N->getName().empty()) {
855 const std::string &VarName = N->getName();
856 std::string Val = VariableMap[VarName];
857 bool ModifiedVal = false;
859 errs() << "Variable '" << VarName << " referenced but not defined "
860 << "and not caught earlier!\n";
863 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
864 // Already selected this operand, just return the tmpval.
865 NodeOps.push_back(getValueName(Val));
869 const ComplexPattern *CP;
870 unsigned ResNo = TmpNo++;
871 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
872 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
873 std::string CastType;
874 std::string TmpVar = "Tmp" + utostr(ResNo);
875 switch (N->getTypeNum(0)) {
877 errs() << "Cannot handle " << getEnumName(N->getTypeNum(0))
878 << " type as an immediate constant. Aborting\n";
880 case MVT::i1: CastType = "bool"; break;
881 case MVT::i8: CastType = "unsigned char"; break;
882 case MVT::i16: CastType = "unsigned short"; break;
883 case MVT::i32: CastType = "unsigned"; break;
884 case MVT::i64: CastType = "uint64_t"; break;
886 emitCode("SDValue " + TmpVar +
887 " = CurDAG->getTargetConstant(((" + CastType +
888 ") cast<ConstantSDNode>(" + Val + ")->getZExtValue()), " +
889 getEnumName(N->getTypeNum(0)) + ");");
890 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
891 // value if used multiple times by this pattern result.
894 NodeOps.push_back(getValueName(Val));
895 } else if (!N->isLeaf() && N->getOperator()->getName() == "fpimm") {
896 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
897 std::string TmpVar = "Tmp" + utostr(ResNo);
898 emitCode("SDValue " + TmpVar +
899 " = CurDAG->getTargetConstantFP(*cast<ConstantFPSDNode>(" +
900 Val + ")->getConstantFPValue(), cast<ConstantFPSDNode>(" +
901 Val + ")->getValueType(0));");
902 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
903 // value if used multiple times by this pattern result.
906 NodeOps.push_back(getValueName(Val));
907 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
908 Record *Op = OperatorMap[N->getName()];
909 // Transform ExternalSymbol to TargetExternalSymbol
910 if (Op && Op->getName() == "externalsym") {
911 std::string TmpVar = "Tmp"+utostr(ResNo);
912 emitCode("SDValue " + TmpVar + " = CurDAG->getTarget"
913 "ExternalSymbol(cast<ExternalSymbolSDNode>(" +
914 Val + ")->getSymbol(), " +
915 getEnumName(N->getTypeNum(0)) + ");");
916 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select
917 // this value if used multiple times by this pattern result.
921 NodeOps.push_back(getValueName(Val));
922 } else if (!N->isLeaf() && (N->getOperator()->getName() == "tglobaladdr"
923 || N->getOperator()->getName() == "tglobaltlsaddr")) {
924 Record *Op = OperatorMap[N->getName()];
925 // Transform GlobalAddress to TargetGlobalAddress
926 if (Op && (Op->getName() == "globaladdr" ||
927 Op->getName() == "globaltlsaddr")) {
928 std::string TmpVar = "Tmp" + utostr(ResNo);
929 emitCode("SDValue " + TmpVar + " = CurDAG->getTarget"
930 "GlobalAddress(cast<GlobalAddressSDNode>(" + Val +
931 ")->getGlobal(), " + getEnumName(N->getTypeNum(0)) +
933 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select
934 // this value if used multiple times by this pattern result.
938 NodeOps.push_back(getValueName(Val));
939 } else if (!N->isLeaf()
940 && (N->getOperator()->getName() == "texternalsym" ||
941 N->getOperator()->getName() == "tconstpool")) {
942 // Do not rewrite the variable name, since we don't generate a new
944 NodeOps.push_back(getValueName(Val));
945 } else if (N->isLeaf() && (CP = N->getComplexPatternInfo(CGP))) {
946 for (unsigned i = 0; i < CP->getNumOperands(); ++i) {
947 NodeOps.push_back(getValueName("CPTmp" + Val + "_" + utostr(i)));
950 // This node, probably wrapped in a SDNodeXForm, behaves like a leaf
951 // node even if it isn't one. Don't select it.
953 if (isRoot && N->isLeaf()) {
954 emitCode("ReplaceUses(SDValue(N, 0), " + Val + ");");
955 emitCode("return NULL;");
958 NodeOps.push_back(getValueName(Val));
962 VariableMap[VarName] = Val;
966 // If this is an explicit register reference, handle it.
967 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
968 unsigned ResNo = TmpNo++;
969 if (DI->getDef()->isSubClassOf("Register")) {
970 emitCode("SDValue Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" +
971 getQualifiedName(DI->getDef()) + ", " +
972 getEnumName(N->getTypeNum(0)) + ");");
973 NodeOps.push_back(getValueName("Tmp" + utostr(ResNo)));
975 } else if (DI->getDef()->getName() == "zero_reg") {
976 emitCode("SDValue Tmp" + utostr(ResNo) +
977 " = CurDAG->getRegister(0, " +
978 getEnumName(N->getTypeNum(0)) + ");");
979 NodeOps.push_back(getValueName("Tmp" + utostr(ResNo)));
981 } else if (DI->getDef()->isSubClassOf("RegisterClass")) {
982 // Handle a reference to a register class. This is used
983 // in COPY_TO_SUBREG instructions.
984 emitCode("SDValue Tmp" + utostr(ResNo) +
985 " = CurDAG->getTargetConstant(" +
986 getQualifiedName(DI->getDef()) + "RegClassID, " +
988 NodeOps.push_back(getValueName("Tmp" + utostr(ResNo)));
991 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
992 unsigned ResNo = TmpNo++;
993 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
994 emitCode("SDValue Tmp" + utostr(ResNo) +
995 " = CurDAG->getTargetConstant(0x" +
996 utohexstr((uint64_t) II->getValue()) +
997 "ULL, " + getEnumName(N->getTypeNum(0)) + ");");
998 NodeOps.push_back(getValueName("Tmp" + utostr(ResNo)));
1005 assert(0 && "Unknown leaf type!");
1009 Record *Op = N->getOperator();
1010 if (Op->isSubClassOf("Instruction")) {
1011 const CodeGenTarget &CGT = CGP.getTargetInfo();
1012 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
1013 const DAGInstruction &Inst = CGP.getInstruction(Op);
1014 const TreePattern *InstPat = Inst.getPattern();
1015 // FIXME: Assume actual pattern comes before "implicit".
1016 TreePatternNode *InstPatNode =
1017 isRoot ? (InstPat ? InstPat->getTree(0) : Pattern)
1018 : (InstPat ? InstPat->getTree(0) : NULL);
1019 if (InstPatNode && !InstPatNode->isLeaf() &&
1020 InstPatNode->getOperator()->getName() == "set") {
1021 InstPatNode = InstPatNode->getChild(InstPatNode->getNumChildren()-1);
1023 bool IsVariadic = isRoot && II.isVariadic;
1024 // FIXME: fix how we deal with physical register operands.
1025 bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0;
1026 bool HasImpResults = isRoot && DstRegs.size() > 0;
1027 bool NodeHasOptInFlag = isRoot &&
1028 Pattern->TreeHasProperty(SDNPOptInFlag, CGP);
1029 bool NodeHasInFlag = isRoot &&
1030 Pattern->TreeHasProperty(SDNPInFlag, CGP);
1031 bool NodeHasOutFlag = isRoot &&
1032 Pattern->TreeHasProperty(SDNPOutFlag, CGP);
1033 bool NodeHasChain = InstPatNode &&
1034 InstPatNode->TreeHasProperty(SDNPHasChain, CGP);
1035 bool InputHasChain = isRoot && Pattern->NodeHasProperty(SDNPHasChain, CGP);
1036 unsigned NumResults = Inst.getNumResults();
1037 unsigned NumDstRegs = HasImpResults ? DstRegs.size() : 0;
1039 // Record output varargs info.
1040 OutputIsVariadic = IsVariadic;
1042 if (NodeHasOptInFlag) {
1043 emitCode("bool HasInFlag = "
1044 "(N->getOperand(N->getNumOperands()-1).getValueType() == "
1048 emitCode("SmallVector<SDValue, 8> Ops" + utostr(OpcNo) + ";");
1050 // How many results is this pattern expected to produce?
1051 unsigned NumPatResults = 0;
1052 for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
1053 MVT::SimpleValueType VT = Pattern->getTypeNum(i);
1054 if (VT != MVT::isVoid && VT != MVT::Flag)
1058 if (OrigChains.size() > 0) {
1059 // The original input chain is being ignored. If it is not just
1060 // pointing to the op that's being folded, we should create a
1061 // TokenFactor with it and the chain of the folded op as the new chain.
1062 // We could potentially be doing multiple levels of folding, in that
1063 // case, the TokenFactor can have more operands.
1064 emitCode("SmallVector<SDValue, 8> InChains;");
1065 for (unsigned i = 0, e = OrigChains.size(); i < e; ++i) {
1066 emitCode("if (" + OrigChains[i].first + ".getNode() != " +
1067 OrigChains[i].second + ".getNode()) {");
1068 emitCode(" InChains.push_back(" + OrigChains[i].first + ");");
1071 emitCode("InChains.push_back(" + ChainName + ");");
1072 emitCode(ChainName + " = CurDAG->getNode(ISD::TokenFactor, "
1073 "N->getDebugLoc(), MVT::Other, "
1074 "&InChains[0], InChains.size());");
1076 emitCode("CurDAG->setSubgraphColor(" + ChainName +".getNode(), \"yellow\");");
1077 emitCode("CurDAG->setSubgraphColor(" + ChainName +".getNode(), \"black\");");
1081 // Loop over all of the operands of the instruction pattern, emitting code
1082 // to fill them all in. The node 'N' usually has number children equal to
1083 // the number of input operands of the instruction. However, in cases
1084 // where there are predicate operands for an instruction, we need to fill
1085 // in the 'execute always' values. Match up the node operands to the
1086 // instruction operands to do this.
1087 std::vector<std::string> AllOps;
1088 for (unsigned ChildNo = 0, InstOpNo = NumResults;
1089 InstOpNo != II.OperandList.size(); ++InstOpNo) {
1090 std::vector<std::string> Ops;
1092 // Determine what to emit for this operand.
1093 Record *OperandNode = II.OperandList[InstOpNo].Rec;
1094 if ((OperandNode->isSubClassOf("PredicateOperand") ||
1095 OperandNode->isSubClassOf("OptionalDefOperand")) &&
1096 !CGP.getDefaultOperand(OperandNode).DefaultOps.empty()) {
1097 // This is a predicate or optional def operand; emit the
1098 // 'default ops' operands.
1099 const DAGDefaultOperand &DefaultOp =
1100 CGP.getDefaultOperand(II.OperandList[InstOpNo].Rec);
1101 for (unsigned i = 0, e = DefaultOp.DefaultOps.size(); i != e; ++i) {
1102 Ops = EmitResultCode(DefaultOp.DefaultOps[i], DstRegs,
1103 InFlagDecled, ResNodeDecled);
1104 AllOps.insert(AllOps.end(), Ops.begin(), Ops.end());
1107 // Otherwise this is a normal operand or a predicate operand without
1108 // 'execute always'; emit it.
1109 Ops = EmitResultCode(N->getChild(ChildNo), DstRegs,
1110 InFlagDecled, ResNodeDecled);
1111 AllOps.insert(AllOps.end(), Ops.begin(), Ops.end());
1116 // Emit all the chain and CopyToReg stuff.
1117 bool ChainEmitted = NodeHasChain;
1118 if (NodeHasInFlag || HasImpInputs)
1119 EmitInFlagSelectCode(Pattern, "N", ChainEmitted,
1120 InFlagDecled, ResNodeDecled, true);
1121 if (NodeHasOptInFlag || NodeHasInFlag || HasImpInputs) {
1122 if (!InFlagDecled) {
1123 emitCode("SDValue InFlag(0, 0);");
1124 InFlagDecled = true;
1126 if (NodeHasOptInFlag) {
1127 emitCode("if (HasInFlag) {");
1128 emitCode(" InFlag = N->getOperand(N->getNumOperands()-1);");
1133 unsigned ResNo = TmpNo++;
1135 unsigned OpsNo = OpcNo;
1136 std::string CodePrefix;
1137 bool ChainAssignmentNeeded = NodeHasChain && !isRoot;
1138 std::deque<std::string> After;
1139 std::string NodeName;
1141 NodeName = "Tmp" + utostr(ResNo);
1142 CodePrefix = "SDValue " + NodeName + "(";
1144 NodeName = "ResNode";
1145 if (!ResNodeDecled) {
1146 CodePrefix = "SDNode *" + NodeName + " = ";
1147 ResNodeDecled = true;
1149 CodePrefix = NodeName + " = ";
1152 std::string Code = "Opc" + utostr(OpcNo);
1154 if (!isRoot || (InputHasChain && !NodeHasChain))
1155 // For call to "getMachineNode()".
1156 Code += ", N->getDebugLoc()";
1158 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
1160 // Output order: results, chain, flags
1162 if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid) {
1163 Code += ", VT" + utostr(VTNo);
1164 emitVT(getEnumName(N->getTypeNum(0)));
1166 // Add types for implicit results in physical registers, scheduler will
1167 // care of adding copyfromreg nodes.
1168 for (unsigned i = 0; i < NumDstRegs; i++) {
1169 Record *RR = DstRegs[i];
1170 if (RR->isSubClassOf("Register")) {
1171 MVT::SimpleValueType RVT = getRegisterValueType(RR, CGT);
1172 Code += ", " + getEnumName(RVT);
1176 Code += ", MVT::Other";
1178 Code += ", MVT::Flag";
1182 for (unsigned i = 0, e = AllOps.size(); i != e; ++i)
1183 emitCode("Ops" + utostr(OpsNo) + ".push_back(" + AllOps[i] + ");");
1186 // Figure out whether any operands at the end of the op list are not
1187 // part of the variable section.
1188 std::string EndAdjust;
1189 if (NodeHasInFlag || HasImpInputs)
1190 EndAdjust = "-1"; // Always has one flag.
1191 else if (NodeHasOptInFlag)
1192 EndAdjust = "-(HasInFlag?1:0)"; // May have a flag.
1194 emitCode("for (unsigned i = NumInputRootOps + " + utostr(NodeHasChain) +
1195 ", e = N->getNumOperands()" + EndAdjust + "; i != e; ++i) {");
1197 emitCode(" Ops" + utostr(OpsNo) + ".push_back(N->getOperand(i));");
1201 // Populate MemRefs with entries for each memory accesses covered by
1203 if (isRoot && !LSI.empty()) {
1204 std::string MemRefs = "MemRefs" + utostr(OpsNo);
1205 emitCode("MachineSDNode::mmo_iterator " + MemRefs + " = "
1206 "MF->allocateMemRefsArray(" + utostr(LSI.size()) + ");");
1207 for (unsigned i = 0, e = LSI.size(); i != e; ++i)
1208 emitCode(MemRefs + "[" + utostr(i) + "] = "
1209 "cast<MemSDNode>(" + LSI[i] + ")->getMemOperand();");
1210 After.push_back("cast<MachineSDNode>(ResNode)->setMemRefs(" +
1211 MemRefs + ", " + MemRefs + " + " + utostr(LSI.size()) +
1217 emitCode("Ops" + utostr(OpsNo) + ".push_back(" + ChainName + ");");
1219 AllOps.push_back(ChainName);
1223 if (NodeHasInFlag || HasImpInputs)
1224 emitCode("Ops" + utostr(OpsNo) + ".push_back(InFlag);");
1225 else if (NodeHasOptInFlag) {
1226 emitCode("if (HasInFlag)");
1227 emitCode(" Ops" + utostr(OpsNo) + ".push_back(InFlag);");
1229 Code += ", &Ops" + utostr(OpsNo) + "[0], Ops" + utostr(OpsNo) +
1231 } else if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs)
1232 AllOps.push_back("InFlag");
1234 unsigned NumOps = AllOps.size();
1236 if (!NodeHasOptInFlag && NumOps < 4) {
1237 for (unsigned i = 0; i != NumOps; ++i)
1238 Code += ", " + AllOps[i];
1240 std::string OpsCode = "SDValue Ops" + utostr(OpsNo) + "[] = { ";
1241 for (unsigned i = 0; i != NumOps; ++i) {
1242 OpsCode += AllOps[i];
1246 emitCode(OpsCode + " };");
1247 Code += ", Ops" + utostr(OpsNo) + ", ";
1248 if (NodeHasOptInFlag) {
1249 Code += "HasInFlag ? ";
1250 Code += utostr(NumOps) + " : " + utostr(NumOps-1);
1252 Code += utostr(NumOps);
1259 std::vector<std::string> ReplaceFroms;
1260 std::vector<std::string> ReplaceTos;
1262 NodeOps.push_back("Tmp" + utostr(ResNo));
1265 if (NodeHasOutFlag) {
1266 if (!InFlagDecled) {
1267 After.push_back("SDValue InFlag(ResNode, " +
1268 utostr(NumResults+NumDstRegs+(unsigned)NodeHasChain) +
1270 InFlagDecled = true;
1272 After.push_back("InFlag = SDValue(ResNode, " +
1273 utostr(NumResults+NumDstRegs+(unsigned)NodeHasChain) +
1277 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++) {
1278 ReplaceFroms.push_back("SDValue(" +
1279 FoldedChains[j].first + ".getNode(), " +
1280 utostr(FoldedChains[j].second) +
1282 ReplaceTos.push_back("SDValue(ResNode, " +
1283 utostr(NumResults+NumDstRegs) + ")");
1286 if (NodeHasOutFlag) {
1287 if (FoldedFlag.first != "") {
1288 ReplaceFroms.push_back("SDValue(" + FoldedFlag.first + ".getNode(), " +
1289 utostr(FoldedFlag.second) + ")");
1290 ReplaceTos.push_back("InFlag");
1292 assert(Pattern->NodeHasProperty(SDNPOutFlag, CGP));
1293 ReplaceFroms.push_back("SDValue(N, " +
1294 utostr(NumPatResults + (unsigned)InputHasChain)
1296 ReplaceTos.push_back("InFlag");
1300 if (!ReplaceFroms.empty() && InputHasChain) {
1301 ReplaceFroms.push_back("SDValue(N, " +
1302 utostr(NumPatResults) + ")");
1303 ReplaceTos.push_back("SDValue(" + ChainName + ".getNode(), " +
1304 ChainName + ".getResNo()" + ")");
1305 ChainAssignmentNeeded |= NodeHasChain;
1308 // User does not expect the instruction would produce a chain!
1309 if ((!InputHasChain && NodeHasChain) && NodeHasOutFlag) {
1311 } else if (InputHasChain && !NodeHasChain) {
1312 // One of the inner node produces a chain.
1313 assert(!NodeHasOutFlag && "Node has flag but not chain!");
1314 ReplaceFroms.push_back("SDValue(N, " +
1315 utostr(NumPatResults) + ")");
1316 ReplaceTos.push_back(ChainName);
1320 if (ChainAssignmentNeeded) {
1321 // Remember which op produces the chain.
1322 std::string ChainAssign;
1324 ChainAssign = ChainName + " = SDValue(" + NodeName +
1325 ".getNode(), " + utostr(NumResults+NumDstRegs) + ");";
1327 ChainAssign = ChainName + " = SDValue(" + NodeName +
1328 ", " + utostr(NumResults+NumDstRegs) + ");";
1330 After.push_front(ChainAssign);
1333 if (ReplaceFroms.size() == 1) {
1334 After.push_back("ReplaceUses(" + ReplaceFroms[0] + ", " +
1335 ReplaceTos[0] + ");");
1336 } else if (!ReplaceFroms.empty()) {
1337 After.push_back("const SDValue Froms[] = {");
1338 for (unsigned i = 0, e = ReplaceFroms.size(); i != e; ++i)
1339 After.push_back(" " + ReplaceFroms[i] + (i + 1 != e ? "," : ""));
1340 After.push_back("};");
1341 After.push_back("const SDValue Tos[] = {");
1342 for (unsigned i = 0, e = ReplaceFroms.size(); i != e; ++i)
1343 After.push_back(" " + ReplaceTos[i] + (i + 1 != e ? "," : ""));
1344 After.push_back("};");
1345 After.push_back("ReplaceUses(Froms, Tos, " +
1346 itostr(ReplaceFroms.size()) + ");");
1349 // We prefer to use SelectNodeTo since it avoids allocation when
1350 // possible and it avoids CSE map recalculation for the node's
1351 // users, however it's tricky to use in a non-root context.
1353 // We also don't use SelectNodeTo if the pattern replacement is being
1354 // used to jettison a chain result, since morphing the node in place
1355 // would leave users of the chain dangling.
1357 if (!isRoot || (InputHasChain && !NodeHasChain)) {
1358 Code = "CurDAG->getMachineNode(" + Code;
1360 Code = "CurDAG->SelectNodeTo(N, " + Code;
1364 CodePrefix = "return ";
1366 After.push_back("return ResNode;");
1369 emitCode(CodePrefix + Code + ");");
1373 emitCode("CurDAG->setSubgraphColor(" +
1374 NodeName +".getNode(), \"yellow\");");
1375 emitCode("CurDAG->setSubgraphColor(" +
1376 NodeName +".getNode(), \"black\");");
1378 emitCode("CurDAG->setSubgraphColor(" + NodeName +", \"yellow\");");
1379 emitCode("CurDAG->setSubgraphColor(" + NodeName +", \"black\");");
1383 for (unsigned i = 0, e = After.size(); i != e; ++i)
1388 if (Op->isSubClassOf("SDNodeXForm")) {
1389 assert(N->getNumChildren() == 1 && "node xform should have one child!");
1390 // PatLeaf node - the operand may or may not be a leaf node. But it should
1392 std::vector<std::string> Ops =
1393 EmitResultCode(N->getChild(0), DstRegs, InFlagDecled,
1394 ResNodeDecled, true);
1395 unsigned ResNo = TmpNo++;
1396 emitCode("SDValue Tmp" + utostr(ResNo) + " = Transform_" + Op->getName()
1397 + "(" + Ops.back() + ".getNode());");
1398 NodeOps.push_back("Tmp" + utostr(ResNo));
1400 emitCode("return Tmp" + utostr(ResNo) + ".getNode();");
1406 throw std::string("Unknown node in result pattern!");
1410 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
1411 /// stream to match the pattern, and generate the code for the match if it
1412 /// succeeds. Returns true if the pattern is not guaranteed to match.
1413 void DAGISelEmitter::GenerateCodeForPattern(const PatternToMatch &Pattern,
1414 std::vector<std::pair<unsigned, std::string> > &GeneratedCode,
1415 std::set<std::string> &GeneratedDecl,
1416 std::vector<std::string> &TargetOpcodes,
1417 std::vector<std::string> &TargetVTs,
1418 bool &OutputIsVariadic,
1419 unsigned &NumInputRootOps) {
1420 OutputIsVariadic = false;
1421 NumInputRootOps = 0;
1423 PatternCodeEmitter Emitter(CGP, Pattern.getPredicateCheck(),
1424 Pattern.getSrcPattern(), Pattern.getDstPattern(),
1425 GeneratedCode, GeneratedDecl,
1426 TargetOpcodes, TargetVTs,
1427 OutputIsVariadic, NumInputRootOps);
1429 // Emit the matcher, capturing named arguments in VariableMap.
1430 bool FoundChain = false;
1431 Emitter.EmitMatchCode(Pattern.getSrcPattern(), NULL, "N", "", FoundChain);
1433 // TP - Get *SOME* tree pattern, we don't care which. It is only used for
1434 // diagnostics, which we know are impossible at this point.
1435 TreePattern &TP = *CGP.pf_begin()->second;
1437 // At this point, we know that we structurally match the pattern, but the
1438 // types of the nodes may not match. Figure out the fewest number of type
1439 // comparisons we need to emit. For example, if there is only one integer
1440 // type supported by a target, there should be no type comparisons at all for
1441 // integer patterns!
1443 // To figure out the fewest number of type checks needed, clone the pattern,
1444 // remove the types, then perform type inference on the pattern as a whole.
1445 // If there are unresolved types, emit an explicit check for those types,
1446 // apply the type to the tree, then rerun type inference. Iterate until all
1447 // types are resolved.
1449 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
1450 Pat->RemoveAllTypes();
1453 // Resolve/propagate as many types as possible.
1455 bool MadeChange = true;
1457 MadeChange = Pat->ApplyTypeConstraints(TP,
1458 true/*Ignore reg constraints*/);
1460 assert(0 && "Error: could not find consistent types for something we"
1461 " already decided was ok!");
1465 // Insert a check for an unresolved type and add it to the tree. If we find
1466 // an unresolved type to add a check for, this returns true and we iterate,
1467 // otherwise we are done.
1468 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N", true));
1470 Emitter.EmitResultCode(Pattern.getDstPattern(), Pattern.getDstRegs(),
1471 false, false, false, true);
1475 /// EraseCodeLine - Erase one code line from all of the patterns. If removing
1476 /// a line causes any of them to be empty, remove them and return true when
1478 static bool EraseCodeLine(std::vector<std::pair<const PatternToMatch*,
1479 std::vector<std::pair<unsigned, std::string> > > >
1481 bool ErasedPatterns = false;
1482 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1483 Patterns[i].second.pop_back();
1484 if (Patterns[i].second.empty()) {
1485 Patterns.erase(Patterns.begin()+i);
1487 ErasedPatterns = true;
1490 return ErasedPatterns;
1493 /// EmitPatterns - Emit code for at least one pattern, but try to group common
1494 /// code together between the patterns.
1495 void DAGISelEmitter::EmitPatterns(std::vector<std::pair<const PatternToMatch*,
1496 std::vector<std::pair<unsigned, std::string> > > >
1497 &Patterns, unsigned Indent,
1499 typedef std::pair<unsigned, std::string> CodeLine;
1500 typedef std::vector<CodeLine> CodeList;
1501 typedef std::vector<std::pair<const PatternToMatch*, CodeList> > PatternList;
1503 if (Patterns.empty()) return;
1505 // Figure out how many patterns share the next code line. Explicitly copy
1506 // FirstCodeLine so that we don't invalidate a reference when changing
1508 const CodeLine FirstCodeLine = Patterns.back().second.back();
1509 unsigned LastMatch = Patterns.size()-1;
1510 while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
1513 // If not all patterns share this line, split the list into two pieces. The
1514 // first chunk will use this line, the second chunk won't.
1515 if (LastMatch != 0) {
1516 PatternList Shared(Patterns.begin()+LastMatch, Patterns.end());
1517 PatternList Other(Patterns.begin(), Patterns.begin()+LastMatch);
1519 // FIXME: Emit braces?
1520 if (Shared.size() == 1) {
1521 const PatternToMatch &Pattern = *Shared.back().first;
1522 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
1523 Pattern.getSrcPattern()->print(OS);
1524 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
1525 Pattern.getDstPattern()->print(OS);
1527 unsigned AddedComplexity = Pattern.getAddedComplexity();
1528 OS << std::string(Indent, ' ') << "// Pattern complexity = "
1529 << getPatternSize(Pattern.getSrcPattern(), CGP) + AddedComplexity
1531 << getResultPatternCost(Pattern.getDstPattern(), CGP)
1533 << getResultPatternSize(Pattern.getDstPattern(), CGP) << "\n";
1535 if (FirstCodeLine.first != 1) {
1536 OS << std::string(Indent, ' ') << "{\n";
1539 EmitPatterns(Shared, Indent, OS);
1540 if (FirstCodeLine.first != 1) {
1542 OS << std::string(Indent, ' ') << "}\n";
1545 if (Other.size() == 1) {
1546 const PatternToMatch &Pattern = *Other.back().first;
1547 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
1548 Pattern.getSrcPattern()->print(OS);
1549 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
1550 Pattern.getDstPattern()->print(OS);
1552 unsigned AddedComplexity = Pattern.getAddedComplexity();
1553 OS << std::string(Indent, ' ') << "// Pattern complexity = "
1554 << getPatternSize(Pattern.getSrcPattern(), CGP) + AddedComplexity
1556 << getResultPatternCost(Pattern.getDstPattern(), CGP)
1558 << getResultPatternSize(Pattern.getDstPattern(), CGP) << "\n";
1560 EmitPatterns(Other, Indent, OS);
1564 // Remove this code from all of the patterns that share it.
1565 bool ErasedPatterns = EraseCodeLine(Patterns);
1567 bool isPredicate = FirstCodeLine.first == 1;
1569 // Otherwise, every pattern in the list has this line. Emit it.
1572 OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
1574 OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
1576 // If the next code line is another predicate, and if all of the pattern
1577 // in this group share the same next line, emit it inline now. Do this
1578 // until we run out of common predicates.
1579 while (!ErasedPatterns && Patterns.back().second.back().first == 1) {
1580 // Check that all of the patterns in Patterns end with the same predicate.
1581 bool AllEndWithSamePredicate = true;
1582 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
1583 if (Patterns[i].second.back() != Patterns.back().second.back()) {
1584 AllEndWithSamePredicate = false;
1587 // If all of the predicates aren't the same, we can't share them.
1588 if (!AllEndWithSamePredicate) break;
1590 // Otherwise we can. Emit it shared now.
1591 OS << " &&\n" << std::string(Indent+4, ' ')
1592 << Patterns.back().second.back().second;
1593 ErasedPatterns = EraseCodeLine(Patterns);
1600 EmitPatterns(Patterns, Indent, OS);
1603 OS << std::string(Indent-2, ' ') << "}\n";
1606 static std::string getLegalCName(std::string OpName) {
1607 std::string::size_type pos = OpName.find("::");
1608 if (pos != std::string::npos)
1609 OpName.replace(pos, 2, "_");
1613 void DAGISelEmitter::EmitInstructionSelector(raw_ostream &OS) {
1614 const CodeGenTarget &Target = CGP.getTargetInfo();
1616 // Get the namespace to insert instructions into.
1617 std::string InstNS = Target.getInstNamespace();
1618 if (!InstNS.empty()) InstNS += "::";
1620 // Group the patterns by their top-level opcodes.
1621 std::map<std::string, std::vector<const PatternToMatch*> > PatternsByOpcode;
1622 // All unique target node emission functions.
1623 std::map<std::string, unsigned> EmitFunctions;
1624 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
1625 E = CGP.ptm_end(); I != E; ++I) {
1626 const PatternToMatch &Pattern = *I;
1627 TreePatternNode *Node = Pattern.getSrcPattern();
1628 if (!Node->isLeaf()) {
1629 PatternsByOpcode[getOpcodeName(Node->getOperator(), CGP)].
1630 push_back(&Pattern);
1632 const ComplexPattern *CP;
1633 if (dynamic_cast<IntInit*>(Node->getLeafValue())) {
1634 PatternsByOpcode[getOpcodeName(CGP.getSDNodeNamed("imm"), CGP)].
1635 push_back(&Pattern);
1636 } else if ((CP = Node->getComplexPatternInfo(CGP))) {
1637 std::vector<Record*> OpNodes = CP->getRootNodes();
1638 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
1639 PatternsByOpcode[getOpcodeName(OpNodes[j], CGP)]
1640 .insert(PatternsByOpcode[getOpcodeName(OpNodes[j], CGP)].begin(),
1644 errs() << "Unrecognized opcode '";
1646 errs() << "' on tree pattern '";
1647 errs() << Pattern.getDstPattern()->getOperator()->getName() << "'!\n";
1653 // For each opcode, there might be multiple select functions, one per
1654 // ValueType of the node (or its first operand if it doesn't produce a
1655 // non-chain result.
1656 std::map<std::string, std::vector<std::string> > OpcodeVTMap;
1658 // Emit one Select_* method for each top-level opcode. We do this instead of
1659 // emitting one giant switch statement to support compilers where this will
1660 // result in the recursive functions taking less stack space.
1661 for (std::map<std::string, std::vector<const PatternToMatch*> >::iterator
1662 PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end();
1663 PBOI != E; ++PBOI) {
1664 const std::string &OpName = PBOI->first;
1665 std::vector<const PatternToMatch*> &PatternsOfOp = PBOI->second;
1666 assert(!PatternsOfOp.empty() && "No patterns but map has entry?");
1668 // Split them into groups by type.
1669 std::map<MVT::SimpleValueType,
1670 std::vector<const PatternToMatch*> > PatternsByType;
1671 for (unsigned i = 0, e = PatternsOfOp.size(); i != e; ++i) {
1672 const PatternToMatch *Pat = PatternsOfOp[i];
1673 TreePatternNode *SrcPat = Pat->getSrcPattern();
1674 PatternsByType[SrcPat->getTypeNum(0)].push_back(Pat);
1677 for (std::map<MVT::SimpleValueType,
1678 std::vector<const PatternToMatch*> >::iterator
1679 II = PatternsByType.begin(), EE = PatternsByType.end(); II != EE;
1681 MVT::SimpleValueType OpVT = II->first;
1682 std::vector<const PatternToMatch*> &Patterns = II->second;
1683 typedef std::pair<unsigned, std::string> CodeLine;
1684 typedef std::vector<CodeLine> CodeList;
1685 typedef CodeList::iterator CodeListI;
1687 std::vector<std::pair<const PatternToMatch*, CodeList> > CodeForPatterns;
1688 std::vector<std::vector<std::string> > PatternOpcodes;
1689 std::vector<std::vector<std::string> > PatternVTs;
1690 std::vector<std::set<std::string> > PatternDecls;
1691 std::vector<bool> OutputIsVariadicFlags;
1692 std::vector<unsigned> NumInputRootOpsCounts;
1693 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1694 CodeList GeneratedCode;
1695 std::set<std::string> GeneratedDecl;
1696 std::vector<std::string> TargetOpcodes;
1697 std::vector<std::string> TargetVTs;
1698 bool OutputIsVariadic;
1699 unsigned NumInputRootOps;
1700 GenerateCodeForPattern(*Patterns[i], GeneratedCode, GeneratedDecl,
1701 TargetOpcodes, TargetVTs,
1702 OutputIsVariadic, NumInputRootOps);
1703 CodeForPatterns.push_back(std::make_pair(Patterns[i], GeneratedCode));
1704 PatternDecls.push_back(GeneratedDecl);
1705 PatternOpcodes.push_back(TargetOpcodes);
1706 PatternVTs.push_back(TargetVTs);
1707 OutputIsVariadicFlags.push_back(OutputIsVariadic);
1708 NumInputRootOpsCounts.push_back(NumInputRootOps);
1711 // Factor target node emission code (emitted by EmitResultCode) into
1712 // separate functions. Uniquing and share them among all instruction
1713 // selection routines.
1714 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1715 CodeList &GeneratedCode = CodeForPatterns[i].second;
1716 std::vector<std::string> &TargetOpcodes = PatternOpcodes[i];
1717 std::vector<std::string> &TargetVTs = PatternVTs[i];
1718 std::set<std::string> Decls = PatternDecls[i];
1719 bool OutputIsVariadic = OutputIsVariadicFlags[i];
1720 unsigned NumInputRootOps = NumInputRootOpsCounts[i];
1721 std::vector<std::string> AddedInits;
1722 int CodeSize = (int)GeneratedCode.size();
1724 for (int j = CodeSize-1; j >= 0; --j) {
1725 if (LastPred == -1 && GeneratedCode[j].first == 1)
1727 else if (LastPred != -1 && GeneratedCode[j].first == 2)
1728 AddedInits.push_back(GeneratedCode[j].second);
1731 std::string CalleeCode = "(SDNode *N";
1732 std::string CallerCode = "(N";
1733 for (unsigned j = 0, e = TargetOpcodes.size(); j != e; ++j) {
1734 CalleeCode += ", unsigned Opc" + utostr(j);
1735 CallerCode += ", " + TargetOpcodes[j];
1737 for (unsigned j = 0, e = TargetVTs.size(); j != e; ++j) {
1738 CalleeCode += ", MVT::SimpleValueType VT" + utostr(j);
1739 CallerCode += ", " + TargetVTs[j];
1741 for (std::set<std::string>::iterator
1742 I = Decls.begin(), E = Decls.end(); I != E; ++I) {
1743 std::string Name = *I;
1744 CalleeCode += ", SDValue &" + Name;
1745 CallerCode += ", " + Name;
1748 if (OutputIsVariadic) {
1749 CalleeCode += ", unsigned NumInputRootOps";
1750 CallerCode += ", " + utostr(NumInputRootOps);
1754 CalleeCode += ") {\n";
1756 for (std::vector<std::string>::const_reverse_iterator
1757 I = AddedInits.rbegin(), E = AddedInits.rend(); I != E; ++I)
1758 CalleeCode += " " + *I + "\n";
1760 for (int j = LastPred+1; j < CodeSize; ++j)
1761 CalleeCode += " " + GeneratedCode[j].second + "\n";
1762 for (int j = LastPred+1; j < CodeSize; ++j)
1763 GeneratedCode.pop_back();
1764 CalleeCode += "}\n";
1766 // Uniquing the emission routines.
1767 unsigned EmitFuncNum;
1768 std::map<std::string, unsigned>::iterator EFI =
1769 EmitFunctions.find(CalleeCode);
1770 if (EFI != EmitFunctions.end()) {
1771 EmitFuncNum = EFI->second;
1773 EmitFuncNum = EmitFunctions.size();
1774 EmitFunctions.insert(std::make_pair(CalleeCode, EmitFuncNum));
1775 // Prevent emission routines from being inlined to reduce selection
1776 // routines stack frame sizes.
1777 OS << "DISABLE_INLINE ";
1778 OS << "SDNode *Emit_" << utostr(EmitFuncNum) << CalleeCode;
1781 // Replace the emission code within selection routines with calls to the
1782 // emission functions.
1784 GeneratedCode.push_back(std::make_pair(0, "CurDAG->setSubgraphColor(N, \"red\");"));
1785 CallerCode = "SDNode *Result = Emit_" + utostr(EmitFuncNum) + CallerCode;
1786 GeneratedCode.push_back(std::make_pair(3, CallerCode));
1788 GeneratedCode.push_back(std::make_pair(0, "if(Result) {"));
1789 GeneratedCode.push_back(std::make_pair(0, " CurDAG->setSubgraphColor(Result, \"yellow\");"));
1790 GeneratedCode.push_back(std::make_pair(0, " CurDAG->setSubgraphColor(Result, \"black\");"));
1791 GeneratedCode.push_back(std::make_pair(0, "}"));
1792 //GeneratedCode.push_back(std::make_pair(0, "CurDAG->setSubgraphColor(N, \"black\");"));
1794 GeneratedCode.push_back(std::make_pair(0, "return Result;"));
1798 std::string OpVTStr;
1799 if (OpVT == MVT::iPTR) {
1801 } else if (OpVT == MVT::iPTRAny) {
1802 OpVTStr = "_iPTRAny";
1803 } else if (OpVT == MVT::isVoid) {
1804 // Nodes with a void result actually have a first result type of either
1805 // Other (a chain) or Flag. Since there is no one-to-one mapping from
1806 // void to this case, we handle it specially here.
1808 OpVTStr = "_" + getEnumName(OpVT).substr(5); // Skip 'MVT::'
1810 std::map<std::string, std::vector<std::string> >::iterator OpVTI =
1811 OpcodeVTMap.find(OpName);
1812 if (OpVTI == OpcodeVTMap.end()) {
1813 std::vector<std::string> VTSet;
1814 VTSet.push_back(OpVTStr);
1815 OpcodeVTMap.insert(std::make_pair(OpName, VTSet));
1817 OpVTI->second.push_back(OpVTStr);
1819 // We want to emit all of the matching code now. However, we want to emit
1820 // the matches in order of minimal cost. Sort the patterns so the least
1821 // cost one is at the start.
1822 std::stable_sort(CodeForPatterns.begin(), CodeForPatterns.end(),
1823 PatternSortingPredicate(CGP));
1825 // Scan the code to see if all of the patterns are reachable and if it is
1826 // possible that the last one might not match.
1827 bool mightNotMatch = true;
1828 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1829 CodeList &GeneratedCode = CodeForPatterns[i].second;
1830 mightNotMatch = false;
1832 for (unsigned j = 0, e = GeneratedCode.size(); j != e; ++j) {
1833 if (GeneratedCode[j].first == 1) { // predicate.
1834 mightNotMatch = true;
1839 // If this pattern definitely matches, and if it isn't the last one, the
1840 // patterns after it CANNOT ever match. Error out.
1841 if (mightNotMatch == false && i != CodeForPatterns.size()-1) {
1842 errs() << "Pattern '";
1843 CodeForPatterns[i].first->getSrcPattern()->print(errs());
1844 errs() << "' is impossible to select!\n";
1849 // Loop through and reverse all of the CodeList vectors, as we will be
1850 // accessing them from their logical front, but accessing the end of a
1851 // vector is more efficient.
1852 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
1853 CodeList &GeneratedCode = CodeForPatterns[i].second;
1854 std::reverse(GeneratedCode.begin(), GeneratedCode.end());
1857 // Next, reverse the list of patterns itself for the same reason.
1858 std::reverse(CodeForPatterns.begin(), CodeForPatterns.end());
1860 OS << "SDNode *Select_" << getLegalCName(OpName)
1861 << OpVTStr << "(SDNode *N) {\n";
1863 // Emit all of the patterns now, grouped together to share code.
1864 EmitPatterns(CodeForPatterns, 2, OS);
1866 // If the last pattern has predicates (which could fail) emit code to
1867 // catch the case where nothing handles a pattern.
1868 if (mightNotMatch) {
1870 if (OpName != "ISD::INTRINSIC_W_CHAIN" &&
1871 OpName != "ISD::INTRINSIC_WO_CHAIN" &&
1872 OpName != "ISD::INTRINSIC_VOID")
1873 OS << " CannotYetSelect(N);\n";
1875 OS << " CannotYetSelectIntrinsic(N);\n";
1877 OS << " return NULL;\n";
1883 OS << "// The main instruction selector code.\n"
1884 << "SDNode *SelectCode(SDNode *N) {\n"
1885 << " MVT::SimpleValueType NVT = N->getValueType(0).getSimpleVT().SimpleTy;\n"
1886 << " switch (N->getOpcode()) {\n"
1888 << " assert(!N->isMachineOpcode() && \"Node already selected!\");\n"
1890 << " case ISD::EntryToken: // These nodes remain the same.\n"
1891 << " case ISD::BasicBlock:\n"
1892 << " case ISD::Register:\n"
1893 << " case ISD::HANDLENODE:\n"
1894 << " case ISD::TargetConstant:\n"
1895 << " case ISD::TargetConstantFP:\n"
1896 << " case ISD::TargetConstantPool:\n"
1897 << " case ISD::TargetFrameIndex:\n"
1898 << " case ISD::TargetExternalSymbol:\n"
1899 << " case ISD::TargetBlockAddress:\n"
1900 << " case ISD::TargetJumpTable:\n"
1901 << " case ISD::TargetGlobalTLSAddress:\n"
1902 << " case ISD::TargetGlobalAddress:\n"
1903 << " case ISD::TokenFactor:\n"
1904 << " case ISD::CopyFromReg:\n"
1905 << " case ISD::CopyToReg: {\n"
1906 << " return NULL;\n"
1908 << " case ISD::AssertSext:\n"
1909 << " case ISD::AssertZext: {\n"
1910 << " ReplaceUses(SDValue(N, 0), N->getOperand(0));\n"
1911 << " return NULL;\n"
1913 << " case ISD::INLINEASM: return Select_INLINEASM(N);\n"
1914 << " case ISD::EH_LABEL: return Select_EH_LABEL(N);\n"
1915 << " case ISD::UNDEF: return Select_UNDEF(N);\n";
1917 // Loop over all of the case statements, emiting a call to each method we
1919 for (std::map<std::string, std::vector<const PatternToMatch*> >::iterator
1920 PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end();
1921 PBOI != E; ++PBOI) {
1922 const std::string &OpName = PBOI->first;
1923 // Potentially multiple versions of select for this opcode. One for each
1924 // ValueType of the node (or its first true operand if it doesn't produce a
1926 std::map<std::string, std::vector<std::string> >::iterator OpVTI =
1927 OpcodeVTMap.find(OpName);
1928 std::vector<std::string> &OpVTs = OpVTI->second;
1929 OS << " case " << OpName << ": {\n";
1930 // If we have only one variant and it's the default, elide the
1931 // switch. Marginally faster, and makes MSVC happier.
1932 if (OpVTs.size()==1 && OpVTs[0].empty()) {
1933 OS << " return Select_" << getLegalCName(OpName) << "(N);\n";
1938 // Keep track of whether we see a pattern that has an iPtr result.
1939 bool HasPtrPattern = false;
1940 bool HasDefaultPattern = false;
1942 OS << " switch (NVT) {\n";
1943 for (unsigned i = 0, e = OpVTs.size(); i < e; ++i) {
1944 std::string &VTStr = OpVTs[i];
1945 if (VTStr.empty()) {
1946 HasDefaultPattern = true;
1950 // If this is a match on iPTR: don't emit it directly, we need special
1952 if (VTStr == "_iPTR") {
1953 HasPtrPattern = true;
1956 OS << " case MVT::" << VTStr.substr(1) << ":\n"
1957 << " return Select_" << getLegalCName(OpName)
1958 << VTStr << "(N);\n";
1960 OS << " default:\n";
1962 // If there is an iPTR result version of this pattern, emit it here.
1963 if (HasPtrPattern) {
1964 OS << " if (TLI.getPointerTy() == NVT)\n";
1965 OS << " return Select_" << getLegalCName(OpName) <<"_iPTR(N);\n";
1967 if (HasDefaultPattern) {
1968 OS << " return Select_" << getLegalCName(OpName) << "(N);\n";
1976 OS << " } // end of big switch.\n\n"
1977 << " if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&\n"
1978 << " N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&\n"
1979 << " N->getOpcode() != ISD::INTRINSIC_VOID) {\n"
1980 << " CannotYetSelect(N);\n"
1982 << " CannotYetSelectIntrinsic(N);\n"
1984 << " return NULL;\n"
1988 void DAGISelEmitter::run(raw_ostream &OS) {
1989 EmitSourceFileHeader("DAG Instruction Selector for the " +
1990 CGP.getTargetInfo().getName() + " target", OS);
1992 OS << "// *** NOTE: This file is #included into the middle of the target\n"
1993 << "// *** instruction selector class. These functions are really "
1996 OS << "// Include standard, target-independent definitions and methods used\n"
1997 << "// by the instruction selector.\n";
1998 OS << "#include \"llvm/CodeGen/DAGISelHeader.h\"\n\n";
2000 EmitNodeTransforms(OS);
2001 EmitPredicateFunctions(OS);
2003 DEBUG(errs() << "\n\nALL PATTERNS TO MATCH:\n\n");
2004 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), E = CGP.ptm_end();
2006 DEBUG(errs() << "PATTERN: "; I->getSrcPattern()->dump());
2007 DEBUG(errs() << "\nRESULT: "; I->getDstPattern()->dump());
2008 DEBUG(errs() << "\n");
2011 // At this point, we have full information about the 'Patterns' we need to
2012 // parse, both implicitly from instructions as well as from explicit pattern
2013 // definitions. Emit the resultant instruction selector.
2014 EmitInstructionSelector(OS);
2017 MatcherNode *Matcher = 0;
2018 // Walk the patterns backwards, building a matcher for each and adding it to
2019 // the matcher for the whole target.
2020 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
2021 E = CGP.ptm_end(); I != E;) {
2022 const PatternToMatch &Pattern = *--E;
2023 MatcherNode *N = ConvertPatternToMatcher(Pattern, CGP);
2028 Matcher = new PushMatcherNode(N, Matcher);
2032 EmitMatcherTable(Matcher, OS);