1 //===- DAGISelEmitter.cpp - Generate an instruction selector --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Chris Lattner and is distributed under
6 // the University of Illinois Open Source 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"
22 //===----------------------------------------------------------------------===//
23 // Helpers for working with extended types.
25 /// FilterVTs - Filter a list of VT's according to a predicate.
28 static std::vector<MVT::ValueType>
29 FilterVTs(const std::vector<MVT::ValueType> &InVTs, T Filter) {
30 std::vector<MVT::ValueType> Result;
31 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
33 Result.push_back(InVTs[i]);
37 /// isExtIntegerVT - Return true if the specified extended value type is
38 /// integer, or isInt.
39 static bool isExtIntegerVT(unsigned char VT) {
40 return VT == MVT::isInt ||
41 (VT < MVT::LAST_VALUETYPE && MVT::isInteger((MVT::ValueType)VT));
44 /// isExtFloatingPointVT - Return true if the specified extended value type is
45 /// floating point, or isFP.
46 static bool isExtFloatingPointVT(unsigned char VT) {
47 return VT == MVT::isFP ||
48 (VT < MVT::LAST_VALUETYPE && MVT::isFloatingPoint((MVT::ValueType)VT));
51 //===----------------------------------------------------------------------===//
52 // SDTypeConstraint implementation
55 SDTypeConstraint::SDTypeConstraint(Record *R) {
56 OperandNo = R->getValueAsInt("OperandNum");
58 if (R->isSubClassOf("SDTCisVT")) {
59 ConstraintType = SDTCisVT;
60 x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT"));
61 } else if (R->isSubClassOf("SDTCisInt")) {
62 ConstraintType = SDTCisInt;
63 } else if (R->isSubClassOf("SDTCisFP")) {
64 ConstraintType = SDTCisFP;
65 } else if (R->isSubClassOf("SDTCisSameAs")) {
66 ConstraintType = SDTCisSameAs;
67 x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
68 } else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
69 ConstraintType = SDTCisVTSmallerThanOp;
70 x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
71 R->getValueAsInt("OtherOperandNum");
72 } else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) {
73 ConstraintType = SDTCisOpSmallerThanOp;
74 x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
75 R->getValueAsInt("BigOperandNum");
77 std::cerr << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
82 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
83 /// N, which has NumResults results.
84 TreePatternNode *SDTypeConstraint::getOperandNum(unsigned OpNo,
86 unsigned NumResults) const {
87 assert(NumResults <= 1 &&
88 "We only work with nodes with zero or one result so far!");
90 if (OpNo < NumResults)
91 return N; // FIXME: need value #
93 return N->getChild(OpNo-NumResults);
96 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
97 /// constraint to the nodes operands. This returns true if it makes a
98 /// change, false otherwise. If a type contradiction is found, throw an
100 bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
101 const SDNodeInfo &NodeInfo,
102 TreePattern &TP) const {
103 unsigned NumResults = NodeInfo.getNumResults();
104 assert(NumResults <= 1 &&
105 "We only work with nodes with zero or one result so far!");
107 // Check that the number of operands is sane.
108 if (NodeInfo.getNumOperands() >= 0) {
109 if (N->getNumChildren() != (unsigned)NodeInfo.getNumOperands())
110 TP.error(N->getOperator()->getName() + " node requires exactly " +
111 itostr(NodeInfo.getNumOperands()) + " operands!");
114 const CodeGenTarget &CGT = TP.getDAGISelEmitter().getTargetInfo();
116 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NumResults);
118 switch (ConstraintType) {
119 default: assert(0 && "Unknown constraint type!");
121 // Operand must be a particular type.
122 return NodeToApply->UpdateNodeType(x.SDTCisVT_Info.VT, TP);
124 // If there is only one integer type supported, this must be it.
125 std::vector<MVT::ValueType> IntVTs =
126 FilterVTs(CGT.getLegalValueTypes(), MVT::isInteger);
128 // If we found exactly one supported integer type, apply it.
129 if (IntVTs.size() == 1)
130 return NodeToApply->UpdateNodeType(IntVTs[0], TP);
131 return NodeToApply->UpdateNodeType(MVT::isInt, TP);
134 // If there is only one FP type supported, this must be it.
135 std::vector<MVT::ValueType> FPVTs =
136 FilterVTs(CGT.getLegalValueTypes(), MVT::isFloatingPoint);
138 // If we found exactly one supported FP type, apply it.
139 if (FPVTs.size() == 1)
140 return NodeToApply->UpdateNodeType(FPVTs[0], TP);
141 return NodeToApply->UpdateNodeType(MVT::isFP, TP);
144 TreePatternNode *OtherNode =
145 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NumResults);
146 return NodeToApply->UpdateNodeType(OtherNode->getExtType(), TP) |
147 OtherNode->UpdateNodeType(NodeToApply->getExtType(), TP);
149 case SDTCisVTSmallerThanOp: {
150 // The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
151 // have an integer type that is smaller than the VT.
152 if (!NodeToApply->isLeaf() ||
153 !dynamic_cast<DefInit*>(NodeToApply->getLeafValue()) ||
154 !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
155 ->isSubClassOf("ValueType"))
156 TP.error(N->getOperator()->getName() + " expects a VT operand!");
158 getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef());
159 if (!MVT::isInteger(VT))
160 TP.error(N->getOperator()->getName() + " VT operand must be integer!");
162 TreePatternNode *OtherNode =
163 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N,NumResults);
165 // It must be integer.
166 bool MadeChange = false;
167 MadeChange |= OtherNode->UpdateNodeType(MVT::isInt, TP);
169 if (OtherNode->hasTypeSet() && OtherNode->getType() <= VT)
170 OtherNode->UpdateNodeType(MVT::Other, TP); // Throw an error.
173 case SDTCisOpSmallerThanOp: {
174 TreePatternNode *BigOperand =
175 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NumResults);
177 // Both operands must be integer or FP, but we don't care which.
178 bool MadeChange = false;
180 if (isExtIntegerVT(NodeToApply->getExtType()))
181 MadeChange |= BigOperand->UpdateNodeType(MVT::isInt, TP);
182 else if (isExtFloatingPointVT(NodeToApply->getExtType()))
183 MadeChange |= BigOperand->UpdateNodeType(MVT::isFP, TP);
184 if (isExtIntegerVT(BigOperand->getExtType()))
185 MadeChange |= NodeToApply->UpdateNodeType(MVT::isInt, TP);
186 else if (isExtFloatingPointVT(BigOperand->getExtType()))
187 MadeChange |= NodeToApply->UpdateNodeType(MVT::isFP, TP);
189 std::vector<MVT::ValueType> VTs = CGT.getLegalValueTypes();
191 if (isExtIntegerVT(NodeToApply->getExtType())) {
192 VTs = FilterVTs(VTs, MVT::isInteger);
193 } else if (isExtFloatingPointVT(NodeToApply->getExtType())) {
194 VTs = FilterVTs(VTs, MVT::isFloatingPoint);
199 switch (VTs.size()) {
200 default: // Too many VT's to pick from.
201 case 0: break; // No info yet.
203 // Only one VT of this flavor. Cannot ever satisify the constraints.
204 return NodeToApply->UpdateNodeType(MVT::Other, TP); // throw
206 // If we have exactly two possible types, the little operand must be the
207 // small one, the big operand should be the big one. Common with
208 // float/double for example.
209 assert(VTs[0] < VTs[1] && "Should be sorted!");
210 MadeChange |= NodeToApply->UpdateNodeType(VTs[0], TP);
211 MadeChange |= BigOperand->UpdateNodeType(VTs[1], TP);
221 //===----------------------------------------------------------------------===//
222 // SDNodeInfo implementation
224 SDNodeInfo::SDNodeInfo(Record *R) : Def(R) {
225 EnumName = R->getValueAsString("Opcode");
226 SDClassName = R->getValueAsString("SDClass");
227 Record *TypeProfile = R->getValueAsDef("TypeProfile");
228 NumResults = TypeProfile->getValueAsInt("NumResults");
229 NumOperands = TypeProfile->getValueAsInt("NumOperands");
231 // Parse the properties.
233 std::vector<Record*> PropList = R->getValueAsListOfDefs("Properties");
234 for (unsigned i = 0, e = PropList.size(); i != e; ++i) {
235 if (PropList[i]->getName() == "SDNPCommutative") {
236 Properties |= 1 << SDNPCommutative;
237 } else if (PropList[i]->getName() == "SDNPAssociative") {
238 Properties |= 1 << SDNPAssociative;
239 } else if (PropList[i]->getName() == "SDNPHasChain") {
240 Properties |= 1 << SDNPHasChain;
242 std::cerr << "Unknown SD Node property '" << PropList[i]->getName()
243 << "' on node '" << R->getName() << "'!\n";
249 // Parse the type constraints.
250 std::vector<Record*> ConstraintList =
251 TypeProfile->getValueAsListOfDefs("Constraints");
252 TypeConstraints.assign(ConstraintList.begin(), ConstraintList.end());
255 //===----------------------------------------------------------------------===//
256 // TreePatternNode implementation
259 TreePatternNode::~TreePatternNode() {
260 #if 0 // FIXME: implement refcounted tree nodes!
261 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
266 /// UpdateNodeType - Set the node type of N to VT if VT contains
267 /// information. If N already contains a conflicting type, then throw an
268 /// exception. This returns true if any information was updated.
270 bool TreePatternNode::UpdateNodeType(unsigned char VT, TreePattern &TP) {
271 if (VT == MVT::isUnknown || getExtType() == VT) return false;
272 if (getExtType() == MVT::isUnknown) {
277 // If we are told this is to be an int or FP type, and it already is, ignore
279 if ((VT == MVT::isInt && isExtIntegerVT(getExtType())) ||
280 (VT == MVT::isFP && isExtFloatingPointVT(getExtType())))
283 // If we know this is an int or fp type, and we are told it is a specific one,
285 if ((getExtType() == MVT::isInt && isExtIntegerVT(VT)) ||
286 (getExtType() == MVT::isFP && isExtFloatingPointVT(VT))) {
293 TP.error("Type inference contradiction found in node!");
295 TP.error("Type inference contradiction found in node " +
296 getOperator()->getName() + "!");
298 return true; // unreachable
302 void TreePatternNode::print(std::ostream &OS) const {
304 OS << *getLeafValue();
306 OS << "(" << getOperator()->getName();
309 switch (getExtType()) {
310 case MVT::Other: OS << ":Other"; break;
311 case MVT::isInt: OS << ":isInt"; break;
312 case MVT::isFP : OS << ":isFP"; break;
313 case MVT::isUnknown: ; /*OS << ":?";*/ break;
314 default: OS << ":" << getType(); break;
318 if (getNumChildren() != 0) {
320 getChild(0)->print(OS);
321 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
323 getChild(i)->print(OS);
329 if (!PredicateFn.empty())
330 OS << "<<P:" << PredicateFn << ">>";
332 OS << "<<X:" << TransformFn->getName() << ">>";
333 if (!getName().empty())
334 OS << ":$" << getName();
337 void TreePatternNode::dump() const {
341 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
342 /// the specified node. For this comparison, all of the state of the node
343 /// is considered, except for the assigned name. Nodes with differing names
344 /// that are otherwise identical are considered isomorphic.
345 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N) const {
346 if (N == this) return true;
347 if (N->isLeaf() != isLeaf() || getExtType() != N->getExtType() ||
348 getPredicateFn() != N->getPredicateFn() ||
349 getTransformFn() != N->getTransformFn())
353 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue()))
354 if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue()))
355 return DI->getDef() == NDI->getDef();
356 return getLeafValue() == N->getLeafValue();
359 if (N->getOperator() != getOperator() ||
360 N->getNumChildren() != getNumChildren()) return false;
361 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
362 if (!getChild(i)->isIsomorphicTo(N->getChild(i)))
367 /// clone - Make a copy of this tree and all of its children.
369 TreePatternNode *TreePatternNode::clone() const {
370 TreePatternNode *New;
372 New = new TreePatternNode(getLeafValue());
374 std::vector<TreePatternNode*> CChildren;
375 CChildren.reserve(Children.size());
376 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
377 CChildren.push_back(getChild(i)->clone());
378 New = new TreePatternNode(getOperator(), CChildren);
380 New->setName(getName());
381 New->setType(getExtType());
382 New->setPredicateFn(getPredicateFn());
383 New->setTransformFn(getTransformFn());
387 /// SubstituteFormalArguments - Replace the formal arguments in this tree
388 /// with actual values specified by ArgMap.
389 void TreePatternNode::
390 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
391 if (isLeaf()) return;
393 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
394 TreePatternNode *Child = getChild(i);
395 if (Child->isLeaf()) {
396 Init *Val = Child->getLeafValue();
397 if (dynamic_cast<DefInit*>(Val) &&
398 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
399 // We found a use of a formal argument, replace it with its value.
400 Child = ArgMap[Child->getName()];
401 assert(Child && "Couldn't find formal argument!");
405 getChild(i)->SubstituteFormalArguments(ArgMap);
411 /// InlinePatternFragments - If this pattern refers to any pattern
412 /// fragments, inline them into place, giving us a pattern without any
413 /// PatFrag references.
414 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
415 if (isLeaf()) return this; // nothing to do.
416 Record *Op = getOperator();
418 if (!Op->isSubClassOf("PatFrag")) {
419 // Just recursively inline children nodes.
420 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
421 setChild(i, getChild(i)->InlinePatternFragments(TP));
425 // Otherwise, we found a reference to a fragment. First, look up its
426 // TreePattern record.
427 TreePattern *Frag = TP.getDAGISelEmitter().getPatternFragment(Op);
429 // Verify that we are passing the right number of operands.
430 if (Frag->getNumArgs() != Children.size())
431 TP.error("'" + Op->getName() + "' fragment requires " +
432 utostr(Frag->getNumArgs()) + " operands!");
434 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
436 // Resolve formal arguments to their actual value.
437 if (Frag->getNumArgs()) {
438 // Compute the map of formal to actual arguments.
439 std::map<std::string, TreePatternNode*> ArgMap;
440 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
441 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
443 FragTree->SubstituteFormalArguments(ArgMap);
446 FragTree->setName(getName());
447 FragTree->UpdateNodeType(getExtType(), TP);
449 // Get a new copy of this fragment to stitch into here.
450 //delete this; // FIXME: implement refcounting!
454 /// getIntrinsicType - Check to see if the specified record has an intrinsic
455 /// type which should be applied to it. This infer the type of register
456 /// references from the register file information, for example.
458 static unsigned char getIntrinsicType(Record *R, bool NotRegisters,
460 // Check to see if this is a register or a register class...
461 if (R->isSubClassOf("RegisterClass")) {
462 if (NotRegisters) return MVT::isUnknown;
463 const CodeGenRegisterClass &RC =
464 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(R);
465 return RC.getValueTypeNum(0);
466 } else if (R->isSubClassOf("PatFrag")) {
467 // Pattern fragment types will be resolved when they are inlined.
468 return MVT::isUnknown;
469 } else if (R->isSubClassOf("Register")) {
470 //const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
471 // TODO: if a register appears in exactly one regclass, we could use that
473 return MVT::isUnknown;
474 } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
475 // Using a VTSDNode or CondCodeSDNode.
477 } else if (R->getName() == "node") {
479 return MVT::isUnknown;
482 TP.error("Unknown node flavor used in pattern: " + R->getName());
486 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
487 /// this node and its children in the tree. This returns true if it makes a
488 /// change, false otherwise. If a type contradiction is found, throw an
490 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
492 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
493 // If it's a regclass or something else known, include the type.
494 return UpdateNodeType(getIntrinsicType(DI->getDef(), NotRegisters, TP),
496 } else if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
497 // Int inits are always integers. :)
498 bool MadeChange = UpdateNodeType(MVT::isInt, TP);
501 unsigned Size = MVT::getSizeInBits(getType());
502 // Make sure that the value is representable for this type.
504 int Val = (II->getValue() << (32-Size)) >> (32-Size);
505 if (Val != II->getValue())
506 TP.error("Sign-extended integer value '" + itostr(II->getValue()) +
507 "' is out of range for type 'MVT::" +
508 getEnumName(getType()) + "'!");
517 // special handling for set, which isn't really an SDNode.
518 if (getOperator()->getName() == "set") {
519 assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!");
520 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
521 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
523 // Types of operands must match.
524 MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtType(), TP);
525 MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtType(), TP);
526 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
528 } else if (getOperator()->isSubClassOf("SDNode")) {
529 const SDNodeInfo &NI = TP.getDAGISelEmitter().getSDNodeInfo(getOperator());
531 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
532 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
533 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
534 // Branch, etc. do not produce results and top-level forms in instr pattern
535 // must have void types.
536 if (NI.getNumResults() == 0)
537 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
539 } else if (getOperator()->isSubClassOf("Instruction")) {
540 const DAGInstruction &Inst =
541 TP.getDAGISelEmitter().getInstruction(getOperator());
542 bool MadeChange = false;
543 unsigned NumResults = Inst.getNumResults();
545 assert(NumResults <= 1 &&
546 "Only supports zero or one result instrs!");
547 // Apply the result type to the node
548 if (NumResults == 0) {
549 MadeChange = UpdateNodeType(MVT::isVoid, TP);
551 Record *ResultNode = Inst.getResult(0);
552 assert(ResultNode->isSubClassOf("RegisterClass") &&
553 "Operands should be register classes!");
555 const CodeGenRegisterClass &RC =
556 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(ResultNode);
558 // Get the first ValueType in the RegClass, it's as good as any.
559 MadeChange = UpdateNodeType(RC.getValueTypeNum(0), TP);
562 if (getNumChildren() != Inst.getNumOperands())
563 TP.error("Instruction '" + getOperator()->getName() + " expects " +
564 utostr(Inst.getNumOperands()) + " operands, not " +
565 utostr(getNumChildren()) + " operands!");
566 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
567 Record *OperandNode = Inst.getOperand(i);
569 if (OperandNode->isSubClassOf("RegisterClass")) {
570 const CodeGenRegisterClass &RC =
571 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(OperandNode);
572 VT = RC.getValueTypeNum(0);
573 } else if (OperandNode->isSubClassOf("Operand")) {
574 VT = getValueType(OperandNode->getValueAsDef("Type"));
576 assert(0 && "Unknown operand type!");
580 MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
581 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
585 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
587 // Node transforms always take one operand, and take and return the same
589 if (getNumChildren() != 1)
590 TP.error("Node transform '" + getOperator()->getName() +
591 "' requires one operand!");
592 bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
593 MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
598 /// canPatternMatch - If it is impossible for this pattern to match on this
599 /// target, fill in Reason and return false. Otherwise, return true. This is
600 /// used as a santity check for .td files (to prevent people from writing stuff
601 /// that can never possibly work), and to prevent the pattern permuter from
602 /// generating stuff that is useless.
603 bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){
604 if (isLeaf()) return true;
606 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
607 if (!getChild(i)->canPatternMatch(Reason, ISE))
610 // If this node is a commutative operator, check that the LHS isn't an
612 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
613 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
614 // Scan all of the operands of the node and make sure that only the last one
615 // is a constant node.
616 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i)
617 if (!getChild(i)->isLeaf() &&
618 getChild(i)->getOperator()->getName() == "imm") {
619 Reason = "Immediate value must be on the RHS of commutative operators!";
627 //===----------------------------------------------------------------------===//
628 // TreePattern implementation
631 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
632 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
633 isInputPattern = isInput;
634 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
635 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
638 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
639 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
640 isInputPattern = isInput;
641 Trees.push_back(ParseTreePattern(Pat));
644 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
645 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
646 isInputPattern = isInput;
647 Trees.push_back(Pat);
652 void TreePattern::error(const std::string &Msg) const {
654 throw "In " + TheRecord->getName() + ": " + Msg;
657 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
658 Record *Operator = Dag->getNodeType();
660 if (Operator->isSubClassOf("ValueType")) {
661 // If the operator is a ValueType, then this must be "type cast" of a leaf
663 if (Dag->getNumArgs() != 1)
664 error("Type cast only takes one operand!");
666 Init *Arg = Dag->getArg(0);
667 TreePatternNode *New;
668 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
669 Record *R = DI->getDef();
670 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
671 Dag->setArg(0, new DagInit(R,
672 std::vector<std::pair<Init*, std::string> >()));
673 return ParseTreePattern(Dag);
675 New = new TreePatternNode(DI);
676 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
677 New = ParseTreePattern(DI);
678 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
679 New = new TreePatternNode(II);
680 if (!Dag->getArgName(0).empty())
681 error("Constant int argument should not have a name!");
684 error("Unknown leaf value for tree pattern!");
688 // Apply the type cast.
689 New->UpdateNodeType(getValueType(Operator), *this);
690 New->setName(Dag->getArgName(0));
694 // Verify that this is something that makes sense for an operator.
695 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
696 !Operator->isSubClassOf("Instruction") &&
697 !Operator->isSubClassOf("SDNodeXForm") &&
698 Operator->getName() != "set")
699 error("Unrecognized node '" + Operator->getName() + "'!");
701 // Check to see if this is something that is illegal in an input pattern.
702 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
703 Operator->isSubClassOf("SDNodeXForm")))
704 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
706 std::vector<TreePatternNode*> Children;
708 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
709 Init *Arg = Dag->getArg(i);
710 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
711 Children.push_back(ParseTreePattern(DI));
712 if (Children.back()->getName().empty())
713 Children.back()->setName(Dag->getArgName(i));
714 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
715 Record *R = DefI->getDef();
716 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
717 // TreePatternNode if its own.
718 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
719 Dag->setArg(i, new DagInit(R,
720 std::vector<std::pair<Init*, std::string> >()));
721 --i; // Revisit this node...
723 TreePatternNode *Node = new TreePatternNode(DefI);
724 Node->setName(Dag->getArgName(i));
725 Children.push_back(Node);
728 if (R->getName() == "node") {
729 if (Dag->getArgName(i).empty())
730 error("'node' argument requires a name to match with operand list");
731 Args.push_back(Dag->getArgName(i));
734 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
735 TreePatternNode *Node = new TreePatternNode(II);
736 if (!Dag->getArgName(i).empty())
737 error("Constant int argument should not have a name!");
738 Children.push_back(Node);
743 error("Unknown leaf value for tree pattern!");
747 return new TreePatternNode(Operator, Children);
750 /// InferAllTypes - Infer/propagate as many types throughout the expression
751 /// patterns as possible. Return true if all types are infered, false
752 /// otherwise. Throw an exception if a type contradiction is found.
753 bool TreePattern::InferAllTypes() {
754 bool MadeChange = true;
757 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
758 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
761 bool HasUnresolvedTypes = false;
762 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
763 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
764 return !HasUnresolvedTypes;
767 void TreePattern::print(std::ostream &OS) const {
768 OS << getRecord()->getName();
770 OS << "(" << Args[0];
771 for (unsigned i = 1, e = Args.size(); i != e; ++i)
772 OS << ", " << Args[i];
777 if (Trees.size() > 1)
779 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
785 if (Trees.size() > 1)
789 void TreePattern::dump() const { print(std::cerr); }
793 //===----------------------------------------------------------------------===//
794 // DAGISelEmitter implementation
797 // Parse all of the SDNode definitions for the target, populating SDNodes.
798 void DAGISelEmitter::ParseNodeInfo() {
799 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
800 while (!Nodes.empty()) {
801 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
806 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
807 /// map, and emit them to the file as functions.
808 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
809 OS << "\n// Node transformations.\n";
810 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
811 while (!Xforms.empty()) {
812 Record *XFormNode = Xforms.back();
813 Record *SDNode = XFormNode->getValueAsDef("Opcode");
814 std::string Code = XFormNode->getValueAsCode("XFormFunction");
815 SDNodeXForms.insert(std::make_pair(XFormNode,
816 std::make_pair(SDNode, Code)));
819 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
820 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
822 OS << "inline SDOperand Transform_" << XFormNode->getName()
823 << "(SDNode *" << C2 << ") {\n";
824 if (ClassName != "SDNode")
825 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
826 OS << Code << "\n}\n";
835 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
836 /// file, building up the PatternFragments map. After we've collected them all,
837 /// inline fragments together as necessary, so that there are no references left
838 /// inside a pattern fragment to a pattern fragment.
840 /// This also emits all of the predicate functions to the output file.
842 void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) {
843 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
845 // First step, parse all of the fragments and emit predicate functions.
846 OS << "\n// Predicate functions.\n";
847 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
848 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
849 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
850 PatternFragments[Fragments[i]] = P;
852 // Validate the argument list, converting it to map, to discard duplicates.
853 std::vector<std::string> &Args = P->getArgList();
854 std::set<std::string> OperandsMap(Args.begin(), Args.end());
856 if (OperandsMap.count(""))
857 P->error("Cannot have unnamed 'node' values in pattern fragment!");
859 // Parse the operands list.
860 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
861 if (OpsList->getNodeType()->getName() != "ops")
862 P->error("Operands list should start with '(ops ... '!");
864 // Copy over the arguments.
866 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
867 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
868 static_cast<DefInit*>(OpsList->getArg(j))->
869 getDef()->getName() != "node")
870 P->error("Operands list should all be 'node' values.");
871 if (OpsList->getArgName(j).empty())
872 P->error("Operands list should have names for each operand!");
873 if (!OperandsMap.count(OpsList->getArgName(j)))
874 P->error("'" + OpsList->getArgName(j) +
875 "' does not occur in pattern or was multiply specified!");
876 OperandsMap.erase(OpsList->getArgName(j));
877 Args.push_back(OpsList->getArgName(j));
880 if (!OperandsMap.empty())
881 P->error("Operands list does not contain an entry for operand '" +
882 *OperandsMap.begin() + "'!");
884 // If there is a code init for this fragment, emit the predicate code and
885 // keep track of the fact that this fragment uses it.
886 std::string Code = Fragments[i]->getValueAsCode("Predicate");
888 assert(!P->getOnlyTree()->isLeaf() && "Can't be a leaf!");
889 std::string ClassName =
890 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
891 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
893 OS << "inline bool Predicate_" << Fragments[i]->getName()
894 << "(SDNode *" << C2 << ") {\n";
895 if (ClassName != "SDNode")
896 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
897 OS << Code << "\n}\n";
898 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
901 // If there is a node transformation corresponding to this, keep track of
903 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
904 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
905 P->getOnlyTree()->setTransformFn(Transform);
910 // Now that we've parsed all of the tree fragments, do a closure on them so
911 // that there are not references to PatFrags left inside of them.
912 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
913 E = PatternFragments.end(); I != E; ++I) {
914 TreePattern *ThePat = I->second;
915 ThePat->InlinePatternFragments();
917 // Infer as many types as possible. Don't worry about it if we don't infer
918 // all of them, some may depend on the inputs of the pattern.
920 ThePat->InferAllTypes();
922 // If this pattern fragment is not supported by this target (no types can
923 // satisfy its constraints), just ignore it. If the bogus pattern is
924 // actually used by instructions, the type consistency error will be
928 // If debugging, print out the pattern fragment result.
929 DEBUG(ThePat->dump());
933 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
934 /// instruction input. Return true if this is a real use.
935 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
936 std::map<std::string, TreePatternNode*> &InstInputs) {
937 // No name -> not interesting.
938 if (Pat->getName().empty()) {
940 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
941 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
942 I->error("Input " + DI->getDef()->getName() + " must be named!");
950 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
951 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
954 assert(Pat->getNumChildren() == 0 && "can't be a use with children!");
955 Rec = Pat->getOperator();
958 TreePatternNode *&Slot = InstInputs[Pat->getName()];
963 if (Slot->isLeaf()) {
964 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
966 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
967 SlotRec = Slot->getOperator();
970 // Ensure that the inputs agree if we've already seen this input.
972 I->error("All $" + Pat->getName() + " inputs must agree with each other");
973 if (Slot->getExtType() != Pat->getExtType())
974 I->error("All $" + Pat->getName() + " inputs must agree with each other");
979 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
980 /// part of "I", the instruction), computing the set of inputs and outputs of
981 /// the pattern. Report errors if we see anything naughty.
982 void DAGISelEmitter::
983 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
984 std::map<std::string, TreePatternNode*> &InstInputs,
985 std::map<std::string, Record*> &InstResults) {
987 bool isUse = HandleUse(I, Pat, InstInputs);
988 if (!isUse && Pat->getTransformFn())
989 I->error("Cannot specify a transform function for a non-input value!");
991 } else if (Pat->getOperator()->getName() != "set") {
992 // If this is not a set, verify that the children nodes are not void typed,
994 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
995 if (Pat->getChild(i)->getExtType() == MVT::isVoid)
996 I->error("Cannot have void nodes inside of patterns!");
997 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults);
1000 // If this is a non-leaf node with no children, treat it basically as if
1001 // it were a leaf. This handles nodes like (imm).
1003 if (Pat->getNumChildren() == 0)
1004 isUse = HandleUse(I, Pat, InstInputs);
1006 if (!isUse && Pat->getTransformFn())
1007 I->error("Cannot specify a transform function for a non-input value!");
1011 // Otherwise, this is a set, validate and collect instruction results.
1012 if (Pat->getNumChildren() == 0)
1013 I->error("set requires operands!");
1014 else if (Pat->getNumChildren() & 1)
1015 I->error("set requires an even number of operands");
1017 if (Pat->getTransformFn())
1018 I->error("Cannot specify a transform function on a set node!");
1020 // Check the set destinations.
1021 unsigned NumValues = Pat->getNumChildren()/2;
1022 for (unsigned i = 0; i != NumValues; ++i) {
1023 TreePatternNode *Dest = Pat->getChild(i);
1024 if (!Dest->isLeaf())
1025 I->error("set destination should be a virtual register!");
1027 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1029 I->error("set destination should be a virtual register!");
1031 if (!Val->getDef()->isSubClassOf("RegisterClass"))
1032 I->error("set destination should be a virtual register!");
1033 if (Dest->getName().empty())
1034 I->error("set destination must have a name!");
1035 if (InstResults.count(Dest->getName()))
1036 I->error("cannot set '" + Dest->getName() +"' multiple times");
1037 InstResults[Dest->getName()] = Val->getDef();
1039 // Verify and collect info from the computation.
1040 FindPatternInputsAndOutputs(I, Pat->getChild(i+NumValues),
1041 InstInputs, InstResults);
1046 /// ParseInstructions - Parse all of the instructions, inlining and resolving
1047 /// any fragments involved. This populates the Instructions list with fully
1048 /// resolved instructions.
1049 void DAGISelEmitter::ParseInstructions() {
1050 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1052 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1055 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1056 LI = Instrs[i]->getValueAsListInit("Pattern");
1058 // If there is no pattern, only collect minimal information about the
1059 // instruction for its operand list. We have to assume that there is one
1060 // result, as we have no detailed info.
1061 if (!LI || LI->getSize() == 0) {
1062 std::vector<Record*> Results;
1063 std::vector<Record*> Operands;
1065 CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1067 // Doesn't even define a result?
1068 if (InstInfo.OperandList.size() == 0)
1071 // FIXME: temporary hack...
1072 if (InstInfo.isReturn || InstInfo.isBranch || InstInfo.isCall ||
1074 // These produce no results
1075 for (unsigned j = 0, e = InstInfo.OperandList.size(); j != e; ++j)
1076 Operands.push_back(InstInfo.OperandList[j].Rec);
1078 // Assume the first operand is the result.
1079 Results.push_back(InstInfo.OperandList[0].Rec);
1081 // The rest are inputs.
1082 for (unsigned j = 1, e = InstInfo.OperandList.size(); j != e; ++j)
1083 Operands.push_back(InstInfo.OperandList[j].Rec);
1086 // Create and insert the instruction.
1087 Instructions.insert(std::make_pair(Instrs[i],
1088 DAGInstruction(0, Results, Operands)));
1089 continue; // no pattern.
1092 // Parse the instruction.
1093 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1094 // Inline pattern fragments into it.
1095 I->InlinePatternFragments();
1097 // Infer as many types as possible. If we cannot infer all of them, we can
1098 // never do anything with this instruction pattern: report it to the user.
1099 if (!I->InferAllTypes())
1100 I->error("Could not infer all types in pattern!");
1102 // InstInputs - Keep track of all of the inputs of the instruction, along
1103 // with the record they are declared as.
1104 std::map<std::string, TreePatternNode*> InstInputs;
1106 // InstResults - Keep track of all the virtual registers that are 'set'
1107 // in the instruction, including what reg class they are.
1108 std::map<std::string, Record*> InstResults;
1110 // Verify that the top-level forms in the instruction are of void type, and
1111 // fill in the InstResults map.
1112 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1113 TreePatternNode *Pat = I->getTree(j);
1114 if (Pat->getExtType() != MVT::isVoid)
1115 I->error("Top-level forms in instruction pattern should have"
1118 // Find inputs and outputs, and verify the structure of the uses/defs.
1119 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults);
1122 // Now that we have inputs and outputs of the pattern, inspect the operands
1123 // list for the instruction. This determines the order that operands are
1124 // added to the machine instruction the node corresponds to.
1125 unsigned NumResults = InstResults.size();
1127 // Parse the operands list from the (ops) list, validating it.
1128 std::vector<std::string> &Args = I->getArgList();
1129 assert(Args.empty() && "Args list should still be empty here!");
1130 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1132 // Check that all of the results occur first in the list.
1133 std::vector<Record*> Results;
1134 for (unsigned i = 0; i != NumResults; ++i) {
1135 if (i == CGI.OperandList.size())
1136 I->error("'" + InstResults.begin()->first +
1137 "' set but does not appear in operand list!");
1138 const std::string &OpName = CGI.OperandList[i].Name;
1140 // Check that it exists in InstResults.
1141 Record *R = InstResults[OpName];
1143 I->error("Operand $" + OpName + " should be a set destination: all "
1144 "outputs must occur before inputs in operand list!");
1146 if (CGI.OperandList[i].Rec != R)
1147 I->error("Operand $" + OpName + " class mismatch!");
1149 // Remember the return type.
1150 Results.push_back(CGI.OperandList[i].Rec);
1152 // Okay, this one checks out.
1153 InstResults.erase(OpName);
1156 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
1157 // the copy while we're checking the inputs.
1158 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
1160 std::vector<TreePatternNode*> ResultNodeOperands;
1161 std::vector<Record*> Operands;
1162 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
1163 const std::string &OpName = CGI.OperandList[i].Name;
1165 I->error("Operand #" + utostr(i) + " in operands list has no name!");
1167 if (!InstInputsCheck.count(OpName))
1168 I->error("Operand $" + OpName +
1169 " does not appear in the instruction pattern");
1170 TreePatternNode *InVal = InstInputsCheck[OpName];
1171 InstInputsCheck.erase(OpName); // It occurred, remove from map.
1173 if (InVal->isLeaf() &&
1174 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
1175 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
1176 if (CGI.OperandList[i].Rec != InRec)
1177 I->error("Operand $" + OpName +
1178 "'s register class disagrees between the operand and pattern");
1180 Operands.push_back(CGI.OperandList[i].Rec);
1182 // Construct the result for the dest-pattern operand list.
1183 TreePatternNode *OpNode = InVal->clone();
1185 // No predicate is useful on the result.
1186 OpNode->setPredicateFn("");
1188 // Promote the xform function to be an explicit node if set.
1189 if (Record *Xform = OpNode->getTransformFn()) {
1190 OpNode->setTransformFn(0);
1191 std::vector<TreePatternNode*> Children;
1192 Children.push_back(OpNode);
1193 OpNode = new TreePatternNode(Xform, Children);
1196 ResultNodeOperands.push_back(OpNode);
1199 if (!InstInputsCheck.empty())
1200 I->error("Input operand $" + InstInputsCheck.begin()->first +
1201 " occurs in pattern but not in operands list!");
1203 TreePatternNode *ResultPattern =
1204 new TreePatternNode(I->getRecord(), ResultNodeOperands);
1206 // Create and insert the instruction.
1207 DAGInstruction TheInst(I, Results, Operands);
1208 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
1210 // Use a temporary tree pattern to infer all types and make sure that the
1211 // constructed result is correct. This depends on the instruction already
1212 // being inserted into the Instructions map.
1213 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
1214 Temp.InferAllTypes();
1216 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
1217 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
1222 // If we can, convert the instructions to be patterns that are matched!
1223 for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
1224 E = Instructions.end(); II != E; ++II) {
1225 DAGInstruction &TheInst = II->second;
1226 TreePattern *I = TheInst.getPattern();
1227 if (I == 0) continue; // No pattern.
1229 if (I->getNumTrees() != 1) {
1230 std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
1233 TreePatternNode *Pattern = I->getTree(0);
1234 TreePatternNode *SrcPattern;
1235 if (TheInst.getNumResults() == 0) {
1236 SrcPattern = Pattern;
1238 if (Pattern->getOperator()->getName() != "set")
1239 continue; // Not a set (store or something?)
1241 if (Pattern->getNumChildren() != 2)
1242 continue; // Not a set of a single value (not handled so far)
1244 SrcPattern = Pattern->getChild(1)->clone();
1248 if (!SrcPattern->canPatternMatch(Reason, *this))
1249 I->error("Instruction can never match: " + Reason);
1251 TreePatternNode *DstPattern = TheInst.getResultPattern();
1252 PatternsToMatch.push_back(std::make_pair(SrcPattern, DstPattern));
1256 void DAGISelEmitter::ParsePatterns() {
1257 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
1259 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1260 DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
1261 TreePattern *Pattern = new TreePattern(Patterns[i], Tree, true, *this);
1263 // Inline pattern fragments into it.
1264 Pattern->InlinePatternFragments();
1266 // Infer as many types as possible. If we cannot infer all of them, we can
1267 // never do anything with this pattern: report it to the user.
1268 if (!Pattern->InferAllTypes())
1269 Pattern->error("Could not infer all types in pattern!");
1271 // Validate that the input pattern is correct.
1273 std::map<std::string, TreePatternNode*> InstInputs;
1274 std::map<std::string, Record*> InstResults;
1275 FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(),
1276 InstInputs, InstResults);
1279 ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
1280 if (LI->getSize() == 0) continue; // no pattern.
1282 // Parse the instruction.
1283 TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
1285 // Inline pattern fragments into it.
1286 Result->InlinePatternFragments();
1288 // Infer as many types as possible. If we cannot infer all of them, we can
1289 // never do anything with this pattern: report it to the user.
1290 if (!Result->InferAllTypes())
1291 Result->error("Could not infer all types in pattern result!");
1293 if (Result->getNumTrees() != 1)
1294 Result->error("Cannot handle instructions producing instructions "
1295 "with temporaries yet!");
1298 if (!Pattern->getOnlyTree()->canPatternMatch(Reason, *this))
1299 Pattern->error("Pattern can never match: " + Reason);
1301 PatternsToMatch.push_back(std::make_pair(Pattern->getOnlyTree(),
1302 Result->getOnlyTree()));
1306 /// CombineChildVariants - Given a bunch of permutations of each child of the
1307 /// 'operator' node, put them together in all possible ways.
1308 static void CombineChildVariants(TreePatternNode *Orig,
1309 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
1310 std::vector<TreePatternNode*> &OutVariants,
1311 DAGISelEmitter &ISE) {
1312 // Make sure that each operand has at least one variant to choose from.
1313 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1314 if (ChildVariants[i].empty())
1317 // The end result is an all-pairs construction of the resultant pattern.
1318 std::vector<unsigned> Idxs;
1319 Idxs.resize(ChildVariants.size());
1320 bool NotDone = true;
1322 // Create the variant and add it to the output list.
1323 std::vector<TreePatternNode*> NewChildren;
1324 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1325 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
1326 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
1328 // Copy over properties.
1329 R->setName(Orig->getName());
1330 R->setPredicateFn(Orig->getPredicateFn());
1331 R->setTransformFn(Orig->getTransformFn());
1332 R->setType(Orig->getExtType());
1334 // If this pattern cannot every match, do not include it as a variant.
1335 std::string ErrString;
1336 if (!R->canPatternMatch(ErrString, ISE)) {
1339 bool AlreadyExists = false;
1341 // Scan to see if this pattern has already been emitted. We can get
1342 // duplication due to things like commuting:
1343 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
1344 // which are the same pattern. Ignore the dups.
1345 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
1346 if (R->isIsomorphicTo(OutVariants[i])) {
1347 AlreadyExists = true;
1354 OutVariants.push_back(R);
1357 // Increment indices to the next permutation.
1359 // Look for something we can increment without causing a wrap-around.
1360 for (unsigned IdxsIdx = 0; IdxsIdx != Idxs.size(); ++IdxsIdx) {
1361 if (++Idxs[IdxsIdx] < ChildVariants[IdxsIdx].size()) {
1362 NotDone = true; // Found something to increment.
1370 /// CombineChildVariants - A helper function for binary operators.
1372 static void CombineChildVariants(TreePatternNode *Orig,
1373 const std::vector<TreePatternNode*> &LHS,
1374 const std::vector<TreePatternNode*> &RHS,
1375 std::vector<TreePatternNode*> &OutVariants,
1376 DAGISelEmitter &ISE) {
1377 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1378 ChildVariants.push_back(LHS);
1379 ChildVariants.push_back(RHS);
1380 CombineChildVariants(Orig, ChildVariants, OutVariants, ISE);
1384 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
1385 std::vector<TreePatternNode *> &Children) {
1386 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
1387 Record *Operator = N->getOperator();
1389 // Only permit raw nodes.
1390 if (!N->getName().empty() || !N->getPredicateFn().empty() ||
1391 N->getTransformFn()) {
1392 Children.push_back(N);
1396 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
1397 Children.push_back(N->getChild(0));
1399 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
1401 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
1402 Children.push_back(N->getChild(1));
1404 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
1407 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
1408 /// the (potentially recursive) pattern by using algebraic laws.
1410 static void GenerateVariantsOf(TreePatternNode *N,
1411 std::vector<TreePatternNode*> &OutVariants,
1412 DAGISelEmitter &ISE) {
1413 // We cannot permute leaves.
1415 OutVariants.push_back(N);
1419 // Look up interesting info about the node.
1420 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1422 // If this node is associative, reassociate.
1423 if (NodeInfo.hasProperty(SDNodeInfo::SDNPAssociative)) {
1424 // Reassociate by pulling together all of the linked operators
1425 std::vector<TreePatternNode*> MaximalChildren;
1426 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
1428 // Only handle child sizes of 3. Otherwise we'll end up trying too many
1430 if (MaximalChildren.size() == 3) {
1431 // Find the variants of all of our maximal children.
1432 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
1433 GenerateVariantsOf(MaximalChildren[0], AVariants, ISE);
1434 GenerateVariantsOf(MaximalChildren[1], BVariants, ISE);
1435 GenerateVariantsOf(MaximalChildren[2], CVariants, ISE);
1437 // There are only two ways we can permute the tree:
1438 // (A op B) op C and A op (B op C)
1439 // Within these forms, we can also permute A/B/C.
1441 // Generate legal pair permutations of A/B/C.
1442 std::vector<TreePatternNode*> ABVariants;
1443 std::vector<TreePatternNode*> BAVariants;
1444 std::vector<TreePatternNode*> ACVariants;
1445 std::vector<TreePatternNode*> CAVariants;
1446 std::vector<TreePatternNode*> BCVariants;
1447 std::vector<TreePatternNode*> CBVariants;
1448 CombineChildVariants(N, AVariants, BVariants, ABVariants, ISE);
1449 CombineChildVariants(N, BVariants, AVariants, BAVariants, ISE);
1450 CombineChildVariants(N, AVariants, CVariants, ACVariants, ISE);
1451 CombineChildVariants(N, CVariants, AVariants, CAVariants, ISE);
1452 CombineChildVariants(N, BVariants, CVariants, BCVariants, ISE);
1453 CombineChildVariants(N, CVariants, BVariants, CBVariants, ISE);
1455 // Combine those into the result: (x op x) op x
1456 CombineChildVariants(N, ABVariants, CVariants, OutVariants, ISE);
1457 CombineChildVariants(N, BAVariants, CVariants, OutVariants, ISE);
1458 CombineChildVariants(N, ACVariants, BVariants, OutVariants, ISE);
1459 CombineChildVariants(N, CAVariants, BVariants, OutVariants, ISE);
1460 CombineChildVariants(N, BCVariants, AVariants, OutVariants, ISE);
1461 CombineChildVariants(N, CBVariants, AVariants, OutVariants, ISE);
1463 // Combine those into the result: x op (x op x)
1464 CombineChildVariants(N, CVariants, ABVariants, OutVariants, ISE);
1465 CombineChildVariants(N, CVariants, BAVariants, OutVariants, ISE);
1466 CombineChildVariants(N, BVariants, ACVariants, OutVariants, ISE);
1467 CombineChildVariants(N, BVariants, CAVariants, OutVariants, ISE);
1468 CombineChildVariants(N, AVariants, BCVariants, OutVariants, ISE);
1469 CombineChildVariants(N, AVariants, CBVariants, OutVariants, ISE);
1474 // Compute permutations of all children.
1475 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1476 ChildVariants.resize(N->getNumChildren());
1477 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1478 GenerateVariantsOf(N->getChild(i), ChildVariants[i], ISE);
1480 // Build all permutations based on how the children were formed.
1481 CombineChildVariants(N, ChildVariants, OutVariants, ISE);
1483 // If this node is commutative, consider the commuted order.
1484 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
1485 assert(N->getNumChildren()==2 &&"Commutative but doesn't have 2 children!");
1486 // Consider the commuted order.
1487 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
1493 // GenerateVariants - Generate variants. For example, commutative patterns can
1494 // match multiple ways. Add them to PatternsToMatch as well.
1495 void DAGISelEmitter::GenerateVariants() {
1497 DEBUG(std::cerr << "Generating instruction variants.\n");
1499 // Loop over all of the patterns we've collected, checking to see if we can
1500 // generate variants of the instruction, through the exploitation of
1501 // identities. This permits the target to provide agressive matching without
1502 // the .td file having to contain tons of variants of instructions.
1504 // Note that this loop adds new patterns to the PatternsToMatch list, but we
1505 // intentionally do not reconsider these. Any variants of added patterns have
1506 // already been added.
1508 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
1509 std::vector<TreePatternNode*> Variants;
1510 GenerateVariantsOf(PatternsToMatch[i].first, Variants, *this);
1512 assert(!Variants.empty() && "Must create at least original variant!");
1513 Variants.erase(Variants.begin()); // Remove the original pattern.
1515 if (Variants.empty()) // No variants for this pattern.
1518 DEBUG(std::cerr << "FOUND VARIANTS OF: ";
1519 PatternsToMatch[i].first->dump();
1522 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
1523 TreePatternNode *Variant = Variants[v];
1525 DEBUG(std::cerr << " VAR#" << v << ": ";
1529 // Scan to see if an instruction or explicit pattern already matches this.
1530 bool AlreadyExists = false;
1531 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
1532 // Check to see if this variant already exists.
1533 if (Variant->isIsomorphicTo(PatternsToMatch[p].first)) {
1534 DEBUG(std::cerr << " *** ALREADY EXISTS, ignoring variant.\n");
1535 AlreadyExists = true;
1539 // If we already have it, ignore the variant.
1540 if (AlreadyExists) continue;
1542 // Otherwise, add it to the list of patterns we have.
1543 PatternsToMatch.push_back(std::make_pair(Variant,
1544 PatternsToMatch[i].second));
1547 DEBUG(std::cerr << "\n");
1552 /// getPatternSize - Return the 'size' of this pattern. We want to match large
1553 /// patterns before small ones. This is used to determine the size of a
1555 static unsigned getPatternSize(TreePatternNode *P) {
1556 assert(isExtIntegerVT(P->getExtType()) ||
1557 isExtFloatingPointVT(P->getExtType()) ||
1558 P->getExtType() == MVT::isVoid && "Not a valid pattern node to size!");
1559 unsigned Size = 1; // The node itself.
1561 // Count children in the count if they are also nodes.
1562 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
1563 TreePatternNode *Child = P->getChild(i);
1564 if (!Child->isLeaf() && Child->getExtType() != MVT::Other)
1565 Size += getPatternSize(Child);
1566 else if (Child->isLeaf() && dynamic_cast<IntInit*>(Child->getLeafValue())) {
1567 ++Size; // Matches a ConstantSDNode.
1574 /// getResultPatternCost - Compute the number of instructions for this pattern.
1575 /// This is a temporary hack. We should really include the instruction
1576 /// latencies in this calculation.
1577 static unsigned getResultPatternCost(TreePatternNode *P) {
1578 if (P->isLeaf()) return 0;
1580 unsigned Cost = P->getOperator()->isSubClassOf("Instruction");
1581 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
1582 Cost += getResultPatternCost(P->getChild(i));
1586 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
1587 // In particular, we want to match maximal patterns first and lowest cost within
1588 // a particular complexity first.
1589 struct PatternSortingPredicate {
1590 bool operator()(DAGISelEmitter::PatternToMatch *LHS,
1591 DAGISelEmitter::PatternToMatch *RHS) {
1592 unsigned LHSSize = getPatternSize(LHS->first);
1593 unsigned RHSSize = getPatternSize(RHS->first);
1594 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
1595 if (LHSSize < RHSSize) return false;
1597 // If the patterns have equal complexity, compare generated instruction cost
1598 return getResultPatternCost(LHS->second) <getResultPatternCost(RHS->second);
1602 /// nodeHasChain - return true if TreePatternNode has the property
1603 /// 'hasChain', meaning it reads a ctrl-flow chain operand and writes
1605 static bool nodeHasChain(TreePatternNode *N, DAGISelEmitter &ISE)
1607 if (N->isLeaf()) return false;
1609 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1610 return NodeInfo.hasProperty(SDNodeInfo::SDNPHasChain);
1613 /// EmitMatchForPattern - Emit a matcher for N, going to the label for PatternNo
1614 /// if the match fails. At this point, we already know that the opcode for N
1615 /// matches, and the SDNode for the result has the RootName specified name.
1616 void DAGISelEmitter::EmitMatchForPattern(TreePatternNode *N,
1617 const std::string &RootName,
1618 std::map<std::string,std::string> &VarMap,
1619 unsigned PatternNo,std::ostream &OS) {
1621 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
1622 OS << " if (cast<ConstantSDNode>(" << RootName
1623 << ")->getSignExtended() != " << II->getValue() << ")\n"
1624 << " goto P" << PatternNo << "Fail;\n";
1627 assert(0 && "Cannot match this as a leaf value!");
1631 // If this node has a name associated with it, capture it in VarMap. If
1632 // we already saw this in the pattern, emit code to verify dagness.
1633 if (!N->getName().empty()) {
1634 std::string &VarMapEntry = VarMap[N->getName()];
1635 if (VarMapEntry.empty()) {
1636 VarMapEntry = RootName;
1638 // If we get here, this is a second reference to a specific name. Since
1639 // we already have checked that the first reference is valid, we don't
1640 // have to recursively match it, just check that it's the same as the
1641 // previously named thing.
1642 OS << " if (" << VarMapEntry << " != " << RootName
1643 << ") goto P" << PatternNo << "Fail;\n";
1649 // Emit code to load the child nodes and match their contents recursively.
1650 unsigned OpNo = (unsigned) nodeHasChain(N, *this);
1651 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
1652 OS << " SDOperand " << RootName << OpNo <<" = " << RootName
1653 << ".getOperand(" << OpNo << ");\n";
1654 TreePatternNode *Child = N->getChild(i);
1656 if (!Child->isLeaf()) {
1657 // If it's not a leaf, recursively match.
1658 const SDNodeInfo &CInfo = getSDNodeInfo(Child->getOperator());
1659 OS << " if (" << RootName << OpNo << ".getOpcode() != "
1660 << CInfo.getEnumName() << ") goto P" << PatternNo << "Fail;\n";
1661 EmitMatchForPattern(Child, RootName + utostr(OpNo), VarMap, PatternNo,
1664 // If this child has a name associated with it, capture it in VarMap. If
1665 // we already saw this in the pattern, emit code to verify dagness.
1666 if (!Child->getName().empty()) {
1667 std::string &VarMapEntry = VarMap[Child->getName()];
1668 if (VarMapEntry.empty()) {
1669 VarMapEntry = RootName + utostr(OpNo);
1671 // If we get here, this is a second reference to a specific name. Since
1672 // we already have checked that the first reference is valid, we don't
1673 // have to recursively match it, just check that it's the same as the
1674 // previously named thing.
1675 OS << " if (" << VarMapEntry << " != " << RootName << OpNo
1676 << ") goto P" << PatternNo << "Fail;\n";
1681 // Handle leaves of various types.
1682 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1683 Record *LeafRec = DI->getDef();
1684 if (LeafRec->isSubClassOf("RegisterClass") ||
1685 LeafRec->isSubClassOf("Register")) {
1686 // Handle register references. Nothing to do here.
1687 } else if (LeafRec->isSubClassOf("ValueType")) {
1688 // Make sure this is the specified value type.
1689 OS << " if (cast<VTSDNode>(" << RootName << OpNo << ")->getVT() != "
1690 << "MVT::" << LeafRec->getName() << ") goto P" << PatternNo
1692 } else if (LeafRec->isSubClassOf("CondCode")) {
1693 // Make sure this is the specified cond code.
1694 OS << " if (cast<CondCodeSDNode>(" << RootName << OpNo
1695 << ")->get() != " << "ISD::" << LeafRec->getName()
1696 << ") goto P" << PatternNo << "Fail;\n";
1699 assert(0 && "Unknown leaf type!");
1701 } else if (IntInit *II = dynamic_cast<IntInit*>(Child->getLeafValue())) {
1702 OS << " if (!isa<ConstantSDNode>(" << RootName << OpNo << ") ||\n"
1703 << " cast<ConstantSDNode>(" << RootName << OpNo
1704 << ")->getSignExtended() != " << II->getValue() << ")\n"
1705 << " goto P" << PatternNo << "Fail;\n";
1708 assert(0 && "Unknown leaf type!");
1713 // If there is a node predicate for this, emit the call.
1714 if (!N->getPredicateFn().empty())
1715 OS << " if (!" << N->getPredicateFn() << "(" << RootName
1716 << ".Val)) goto P" << PatternNo << "Fail;\n";
1719 /// getRegisterValueType - Look up and return the first ValueType of specified
1720 /// RegisterClass record
1721 static MVT::ValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
1722 const std::vector<CodeGenRegisterClass> &RegisterClasses =
1723 T.getRegisterClasses();
1725 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i) {
1726 const CodeGenRegisterClass &RC = RegisterClasses[i];
1727 for (unsigned ei = 0, ee = RC.Elements.size(); ei != ee; ++ei) {
1728 if (R == RC.Elements[ei]) {
1729 return RC.getValueTypeNum(0);
1738 /// EmitLeadChainForPattern - Emit the flag operands for the DAG that will be
1739 /// built in CodeGenPatternResult.
1740 void DAGISelEmitter::EmitLeadChainForPattern(TreePatternNode *N,
1741 const std::string &RootName,
1745 Record *Op = N->getOperator();
1746 if (Op->isSubClassOf("Instruction")) {
1747 bool HasCtrlDep = Op->getValueAsBit("hasCtrlDep");
1748 unsigned OpNo = (unsigned) HasCtrlDep;
1749 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1750 EmitLeadChainForPattern(N->getChild(i), RootName + utostr(OpNo),
1753 if (!HasChain && HasCtrlDep) {
1754 OS << " SDOperand Chain = Select("
1755 << RootName << ".getOperand(0));\n";
1762 /// EmitCopyToRegsForPattern - Emit the flag operands for the DAG that will be
1763 /// built in CodeGenPatternResult.
1764 void DAGISelEmitter::EmitCopyToRegsForPattern(TreePatternNode *N,
1765 const std::string &RootName,
1767 bool &HasChain, bool &InFlag) {
1768 const CodeGenTarget &T = getTargetInfo();
1769 unsigned OpNo = (unsigned) nodeHasChain(N, *this);
1770 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
1771 TreePatternNode *Child = N->getChild(i);
1772 if (!Child->isLeaf()) {
1773 EmitCopyToRegsForPattern(Child, RootName + utostr(OpNo), OS, HasChain,
1776 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1777 Record *RR = DI->getDef();
1778 if (RR->isSubClassOf("Register")) {
1779 MVT::ValueType RVT = getRegisterValueType(RR, T);
1781 OS << " SDOperand InFlag = SDOperand(0,0);\n";
1785 OS << " SDOperand " << RootName << "CR" << i << ";\n";
1786 OS << " " << RootName << "CR" << i
1787 << " = CurDAG->getCopyToReg(Chain, CurDAG->getRegister("
1788 << getQualifiedName(RR) << ", MVT::" << getEnumName(RVT) << ")"
1789 << ", Select(" << RootName << OpNo << "), InFlag);\n";
1790 OS << " Chain = " << RootName << "CR" << i
1791 << ".getValue(0);\n";
1792 OS << " InFlag = " << RootName << "CR" << i
1793 << ".getValue(1);\n";
1795 OS << " InFlag = CurDAG->getCopyToReg(CurDAG->getEntryNode()"
1796 << ", CurDAG->getRegister(" << getQualifiedName(RR)
1797 << ", MVT::" << getEnumName(RVT) << ")"
1798 << ", Select(" << RootName << OpNo
1799 << "), InFlag).getValue(1);\n";
1807 /// CodeGenPatternResult - Emit the action for a pattern. Now that it has
1808 /// matched, we actually have to build a DAG!
1809 unsigned DAGISelEmitter::
1810 CodeGenPatternResult(TreePatternNode *N, unsigned &Ctr,
1811 std::map<std::string,std::string> &VariableMap,
1812 std::ostream &OS, bool &HasChain, bool InFlag,
1814 // This is something selected from the pattern we matched.
1815 if (!N->getName().empty()) {
1816 assert(!isRoot && "Root of pattern cannot be a leaf!");
1817 std::string &Val = VariableMap[N->getName()];
1818 assert(!Val.empty() &&
1819 "Variable referenced but not defined and not caught earlier!");
1820 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
1821 // Already selected this operand, just return the tmpval.
1822 return atoi(Val.c_str()+3);
1825 unsigned ResNo = Ctr++;
1826 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
1827 switch (N->getType()) {
1828 default: assert(0 && "Unknown type for constant node!");
1829 case MVT::i1: OS << " bool Tmp"; break;
1830 case MVT::i8: OS << " unsigned char Tmp"; break;
1831 case MVT::i16: OS << " unsigned short Tmp"; break;
1832 case MVT::i32: OS << " unsigned Tmp"; break;
1833 case MVT::i64: OS << " uint64_t Tmp"; break;
1835 OS << ResNo << "C = cast<ConstantSDNode>(" << Val << ")->getValue();\n";
1836 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetConstant(Tmp"
1837 << ResNo << "C, MVT::" << getEnumName(N->getType()) << ");\n";
1838 } else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") {
1839 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
1841 OS << " SDOperand Tmp" << ResNo << " = Select(" << Val << ");\n";
1843 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
1844 // value if used multiple times by this pattern result.
1845 Val = "Tmp"+utostr(ResNo);
1850 // If this is an explicit register reference, handle it.
1851 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
1852 unsigned ResNo = Ctr++;
1853 if (DI->getDef()->isSubClassOf("Register")) {
1854 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getRegister("
1855 << getQualifiedName(DI->getDef()) << ", MVT::"
1856 << getEnumName(N->getType())
1860 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
1861 unsigned ResNo = Ctr++;
1862 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetConstant("
1863 << II->getValue() << ", MVT::"
1864 << getEnumName(N->getType())
1870 assert(0 && "Unknown leaf type!");
1874 Record *Op = N->getOperator();
1875 if (Op->isSubClassOf("Instruction")) {
1876 bool HasCtrlDep = Op->getValueAsBit("hasCtrlDep");
1878 // Emit all of the operands.
1879 std::vector<unsigned> Ops;
1880 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1881 Ops.push_back(CodeGenPatternResult(N->getChild(i), Ctr,
1882 VariableMap, OS, HasChain, InFlag));
1884 CodeGenInstruction &II = Target.getInstruction(Op->getName());
1885 unsigned ResNo = Ctr++;
1887 const DAGInstruction &Inst = getInstruction(Op);
1888 unsigned NumResults = Inst.getNumResults();
1891 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetNode("
1892 << II.Namespace << "::" << II.TheDef->getName() << ", MVT::"
1893 << getEnumName(N->getType());
1894 unsigned LastOp = 0;
1895 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
1897 OS << ", Tmp" << LastOp;
1901 // Must have at least one result
1902 OS << " Chain = Tmp" << LastOp << ".getValue("
1903 << NumResults << ");\n";
1905 } else if (HasCtrlDep) {
1907 OS << " SDOperand Result = ";
1909 OS << " Chain = CodeGenMap[N] = ";
1910 OS << "CurDAG->getTargetNode("
1911 << II.Namespace << "::" << II.TheDef->getName();
1913 OS << ", MVT::" << getEnumName(N->getType()); // TODO: multiple results?
1914 OS << ", MVT::Other";
1915 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
1916 OS << ", Tmp" << Ops[i];
1921 if (NumResults > 0) {
1922 OS << " CodeGenMap[N.getValue(0)] = Result;\n";
1923 OS << " CodeGenMap[N.getValue(" << NumResults
1924 << ")] = Result.getValue(" << NumResults << ");\n";
1925 OS << " Chain = CodeGenMap[N].getValue(" << NumResults << ");\n";
1927 if (NumResults == 0)
1928 OS << " return Chain;\n";
1930 OS << " return (N.ResNo) ? Chain : CodeGenMap[N];\n";
1932 // If this instruction is the root, and if there is only one use of it,
1933 // use SelectNodeTo instead of getTargetNode to avoid an allocation.
1934 OS << " if (N.Val->hasOneUse()) {\n";
1935 OS << " return CurDAG->SelectNodeTo(N.Val, "
1936 << II.Namespace << "::" << II.TheDef->getName() << ", MVT::"
1937 << getEnumName(N->getType());
1938 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
1939 OS << ", Tmp" << Ops[i];
1943 OS << " } else {\n";
1944 OS << " return CodeGenMap[N] = CurDAG->getTargetNode("
1945 << II.Namespace << "::" << II.TheDef->getName() << ", MVT::"
1946 << getEnumName(N->getType());
1947 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
1948 OS << ", Tmp" << Ops[i];
1955 } else if (Op->isSubClassOf("SDNodeXForm")) {
1956 assert(N->getNumChildren() == 1 && "node xform should have one child!");
1957 unsigned OpVal = CodeGenPatternResult(N->getChild(0), Ctr,
1958 VariableMap, OS, HasChain, InFlag);
1960 unsigned ResNo = Ctr++;
1961 OS << " SDOperand Tmp" << ResNo << " = Transform_" << Op->getName()
1962 << "(Tmp" << OpVal << ".Val);\n";
1964 OS << " CodeGenMap[N] = Tmp" << ResNo << ";\n";
1965 OS << " return Tmp" << ResNo << ";\n";
1970 assert(0 && "Unknown node in result pattern!");
1975 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
1976 /// type information from it.
1977 static void RemoveAllTypes(TreePatternNode *N) {
1978 N->setType(MVT::isUnknown);
1980 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1981 RemoveAllTypes(N->getChild(i));
1984 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat' and
1985 /// add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
1986 /// 'Pat' may be missing types. If we find an unresolved type to add a check
1987 /// for, this returns true otherwise false if Pat has all types.
1988 static bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
1989 DAGISelEmitter &ISE,
1990 const std::string &Prefix, unsigned PatternNo,
1993 if (!Pat->hasTypeSet()) {
1994 // Move a type over from 'other' to 'pat'.
1995 Pat->setType(Other->getType());
1996 OS << " if (" << Prefix << ".getValueType() != MVT::"
1997 << getName(Pat->getType()) << ") goto P" << PatternNo << "Fail;\n";
1999 } else if (Pat->isLeaf()) {
2003 unsigned OpNo = (unsigned) nodeHasChain(Pat, ISE);
2004 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
2005 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
2006 ISE, Prefix + utostr(OpNo), PatternNo, OS))
2011 Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
2012 Record *N = Records.getDef(Name);
2013 assert(N && N->isSubClassOf("SDNode") && "Bad argument");
2017 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
2018 /// stream to match the pattern, and generate the code for the match if it
2020 void DAGISelEmitter::EmitCodeForPattern(PatternToMatch &Pattern,
2022 static unsigned PatternCount = 0;
2023 unsigned PatternNo = PatternCount++;
2024 OS << " { // Pattern #" << PatternNo << ": ";
2025 Pattern.first->print(OS);
2026 OS << "\n // Emits: ";
2027 Pattern.second->print(OS);
2029 OS << " // Pattern complexity = " << getPatternSize(Pattern.first)
2030 << " cost = " << getResultPatternCost(Pattern.second) << "\n";
2032 // Emit the matcher, capturing named arguments in VariableMap.
2033 std::map<std::string,std::string> VariableMap;
2034 EmitMatchForPattern(Pattern.first, "N", VariableMap, PatternNo, OS);
2036 // TP - Get *SOME* tree pattern, we don't care which.
2037 TreePattern &TP = *PatternFragments.begin()->second;
2039 // At this point, we know that we structurally match the pattern, but the
2040 // types of the nodes may not match. Figure out the fewest number of type
2041 // comparisons we need to emit. For example, if there is only one integer
2042 // type supported by a target, there should be no type comparisons at all for
2043 // integer patterns!
2045 // To figure out the fewest number of type checks needed, clone the pattern,
2046 // remove the types, then perform type inference on the pattern as a whole.
2047 // If there are unresolved types, emit an explicit check for those types,
2048 // apply the type to the tree, then rerun type inference. Iterate until all
2049 // types are resolved.
2051 TreePatternNode *Pat = Pattern.first->clone();
2052 RemoveAllTypes(Pat);
2055 // Resolve/propagate as many types as possible.
2057 bool MadeChange = true;
2059 MadeChange = Pat->ApplyTypeConstraints(TP,true/*Ignore reg constraints*/);
2061 assert(0 && "Error: could not find consistent types for something we"
2062 " already decided was ok!");
2066 // Insert a check for an unresolved type and add it to the tree. If we find
2067 // an unresolved type to add a check for, this returns true and we iterate,
2068 // otherwise we are done.
2069 } while (InsertOneTypeCheck(Pat, Pattern.first, *this, "N", PatternNo, OS));
2071 bool HasChain = false;
2072 EmitLeadChainForPattern(Pattern.second, "N", OS, HasChain);
2074 bool InFlag = false;
2075 EmitCopyToRegsForPattern(Pattern.first, "N", OS, HasChain, InFlag);
2078 CodeGenPatternResult(Pattern.second,
2079 TmpNo, VariableMap, OS, HasChain, InFlag, true /*the root*/);
2082 OS << " }\n P" << PatternNo << "Fail:\n";
2087 /// CompareByRecordName - An ordering predicate that implements less-than by
2088 /// comparing the names records.
2089 struct CompareByRecordName {
2090 bool operator()(const Record *LHS, const Record *RHS) const {
2091 // Sort by name first.
2092 if (LHS->getName() < RHS->getName()) return true;
2093 // If both names are equal, sort by pointer.
2094 return LHS->getName() == RHS->getName() && LHS < RHS;
2099 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
2100 std::string InstNS = Target.inst_begin()->second.Namespace;
2101 if (!InstNS.empty()) InstNS += "::";
2103 // Emit boilerplate.
2104 OS << "// The main instruction selector code.\n"
2105 << "SDOperand SelectCode(SDOperand N) {\n"
2106 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
2107 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
2108 << "INSTRUCTION_LIST_END))\n"
2109 << " return N; // Already selected.\n\n"
2110 << " if (!N.Val->hasOneUse()) {\n"
2111 << " std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);\n"
2112 << " if (CGMI != CodeGenMap.end()) return CGMI->second;\n"
2114 << " switch (N.getOpcode()) {\n"
2115 << " default: break;\n"
2116 << " case ISD::EntryToken: // These leaves remain the same.\n"
2118 << " case ISD::AssertSext:\n"
2119 << " case ISD::AssertZext: {\n"
2120 << " SDOperand Tmp0 = Select(N.getOperand(0));\n"
2121 << " if (!N.Val->hasOneUse()) CodeGenMap[N] = Tmp0;\n"
2122 << " return Tmp0;\n"
2124 << " case ISD::TokenFactor:\n"
2125 << " if (N.getNumOperands() == 2) {\n"
2126 << " SDOperand Op0 = Select(N.getOperand(0));\n"
2127 << " SDOperand Op1 = Select(N.getOperand(1));\n"
2128 << " return CodeGenMap[N] =\n"
2129 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);\n"
2131 << " std::vector<SDOperand> Ops;\n"
2132 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)\n"
2133 << " Ops.push_back(Select(N.getOperand(i)));\n"
2134 << " return CodeGenMap[N] = \n"
2135 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
2137 << " case ISD::CopyFromReg: {\n"
2138 << " SDOperand Chain = Select(N.getOperand(0));\n"
2139 << " if (Chain == N.getOperand(0)) return N; // No change\n"
2140 << " SDOperand New = CurDAG->getCopyFromReg(Chain,\n"
2141 << " cast<RegisterSDNode>(N.getOperand(1))->getReg(),\n"
2142 << " N.Val->getValueType(0));\n"
2143 << " return New.getValue(N.ResNo);\n"
2145 << " case ISD::CopyToReg: {\n"
2146 << " SDOperand Chain = Select(N.getOperand(0));\n"
2147 << " SDOperand Reg = N.getOperand(1);\n"
2148 << " SDOperand Val = Select(N.getOperand(2));\n"
2149 << " return CodeGenMap[N] = \n"
2150 << " CurDAG->getNode(ISD::CopyToReg, MVT::Other,\n"
2151 << " Chain, Reg, Val);\n"
2154 // Group the patterns by their top-level opcodes.
2155 std::map<Record*, std::vector<PatternToMatch*>,
2156 CompareByRecordName> PatternsByOpcode;
2157 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i)
2158 if (!PatternsToMatch[i].first->isLeaf()) {
2159 PatternsByOpcode[PatternsToMatch[i].first->getOperator()]
2160 .push_back(&PatternsToMatch[i]);
2163 dynamic_cast<IntInit*>(PatternsToMatch[i].first->getLeafValue())) {
2164 PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
2166 std::cerr << "Unrecognized opcode '";
2167 PatternsToMatch[i].first->dump();
2168 std::cerr << "' on tree pattern '";
2169 std::cerr << PatternsToMatch[i].second->getOperator()->getName();
2170 std::cerr << "'!\n";
2175 // Loop over all of the case statements.
2176 for (std::map<Record*, std::vector<PatternToMatch*>,
2177 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
2178 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
2179 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
2180 std::vector<PatternToMatch*> &Patterns = PBOI->second;
2182 OS << " case " << OpcodeInfo.getEnumName() << ":\n";
2184 // We want to emit all of the matching code now. However, we want to emit
2185 // the matches in order of minimal cost. Sort the patterns so the least
2186 // cost one is at the start.
2187 std::stable_sort(Patterns.begin(), Patterns.end(),
2188 PatternSortingPredicate());
2190 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
2191 EmitCodeForPattern(*Patterns[i], OS);
2192 OS << " break;\n\n";
2196 OS << " } // end of big switch.\n\n"
2197 << " std::cerr << \"Cannot yet select: \";\n"
2198 << " N.Val->dump();\n"
2199 << " std::cerr << '\\n';\n"
2204 void DAGISelEmitter::run(std::ostream &OS) {
2205 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
2208 OS << "// *** NOTE: This file is #included into the middle of the target\n"
2209 << "// *** instruction selector class. These functions are really "
2212 OS << "// Instance var to keep track of multiply used nodes that have \n"
2213 << "// already been selected.\n"
2214 << "std::map<SDOperand, SDOperand> CodeGenMap;\n";
2217 ParseNodeTransforms(OS);
2218 ParsePatternFragments(OS);
2219 ParseInstructions();
2222 // Generate variants. For example, commutative patterns can match
2223 // multiple ways. Add them to PatternsToMatch as well.
2227 DEBUG(std::cerr << "\n\nALL PATTERNS TO MATCH:\n\n";
2228 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2229 std::cerr << "PATTERN: "; PatternsToMatch[i].first->dump();
2230 std::cerr << "\nRESULT: ";PatternsToMatch[i].second->dump();
2234 // At this point, we have full information about the 'Patterns' we need to
2235 // parse, both implicitly from instructions as well as from explicit pattern
2236 // definitions. Emit the resultant instruction selector.
2237 EmitInstructionSelector(OS);
2239 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
2240 E = PatternFragments.end(); I != E; ++I)
2242 PatternFragments.clear();
2244 Instructions.clear();