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 // If the register appears in exactly one regclass, and the regclass has one
471 // value type, use it as the known type.
472 const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
473 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
474 if (RC->getNumValueTypes() == 1)
475 return RC->getValueTypeNum(0);
476 return MVT::isUnknown;
477 } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
478 // Using a VTSDNode or CondCodeSDNode.
480 } else if (R->isSubClassOf("ComplexPattern")) {
481 const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
482 return T.getPointerType();
483 } else if (R->getName() == "node") {
485 return MVT::isUnknown;
488 TP.error("Unknown node flavor used in pattern: " + R->getName());
492 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
493 /// this node and its children in the tree. This returns true if it makes a
494 /// change, false otherwise. If a type contradiction is found, throw an
496 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
498 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
499 // If it's a regclass or something else known, include the type.
500 return UpdateNodeType(getIntrinsicType(DI->getDef(), NotRegisters, TP),
502 } else if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
503 // Int inits are always integers. :)
504 bool MadeChange = UpdateNodeType(MVT::isInt, TP);
507 unsigned Size = MVT::getSizeInBits(getType());
508 // Make sure that the value is representable for this type.
510 int Val = (II->getValue() << (32-Size)) >> (32-Size);
511 if (Val != II->getValue())
512 TP.error("Sign-extended integer value '" + itostr(II->getValue()) +
513 "' is out of range for type 'MVT::" +
514 getEnumName(getType()) + "'!");
523 // special handling for set, which isn't really an SDNode.
524 if (getOperator()->getName() == "set") {
525 assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!");
526 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
527 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
529 // Types of operands must match.
530 MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtType(), TP);
531 MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtType(), TP);
532 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
534 } else if (getOperator()->isSubClassOf("SDNode")) {
535 const SDNodeInfo &NI = TP.getDAGISelEmitter().getSDNodeInfo(getOperator());
537 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
538 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
539 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
540 // Branch, etc. do not produce results and top-level forms in instr pattern
541 // must have void types.
542 if (NI.getNumResults() == 0)
543 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
545 } else if (getOperator()->isSubClassOf("Instruction")) {
546 const DAGInstruction &Inst =
547 TP.getDAGISelEmitter().getInstruction(getOperator());
548 bool MadeChange = false;
549 unsigned NumResults = Inst.getNumResults();
551 assert(NumResults <= 1 &&
552 "Only supports zero or one result instrs!");
553 // Apply the result type to the node
554 if (NumResults == 0) {
555 MadeChange = UpdateNodeType(MVT::isVoid, TP);
557 Record *ResultNode = Inst.getResult(0);
558 assert(ResultNode->isSubClassOf("RegisterClass") &&
559 "Operands should be register classes!");
561 const CodeGenRegisterClass &RC =
562 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(ResultNode);
564 // Get the first ValueType in the RegClass, it's as good as any.
565 MadeChange = UpdateNodeType(RC.getValueTypeNum(0), TP);
568 if (getNumChildren() != Inst.getNumOperands())
569 TP.error("Instruction '" + getOperator()->getName() + " expects " +
570 utostr(Inst.getNumOperands()) + " operands, not " +
571 utostr(getNumChildren()) + " operands!");
572 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
573 Record *OperandNode = Inst.getOperand(i);
575 if (OperandNode->isSubClassOf("RegisterClass")) {
576 const CodeGenRegisterClass &RC =
577 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(OperandNode);
578 VT = RC.getValueTypeNum(0);
579 } else if (OperandNode->isSubClassOf("Operand")) {
580 VT = getValueType(OperandNode->getValueAsDef("Type"));
582 assert(0 && "Unknown operand type!");
586 MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
587 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
591 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
593 // Node transforms always take one operand, and take and return the same
595 if (getNumChildren() != 1)
596 TP.error("Node transform '" + getOperator()->getName() +
597 "' requires one operand!");
598 bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
599 MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
604 /// canPatternMatch - If it is impossible for this pattern to match on this
605 /// target, fill in Reason and return false. Otherwise, return true. This is
606 /// used as a santity check for .td files (to prevent people from writing stuff
607 /// that can never possibly work), and to prevent the pattern permuter from
608 /// generating stuff that is useless.
609 bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){
610 if (isLeaf()) return true;
612 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
613 if (!getChild(i)->canPatternMatch(Reason, ISE))
616 // If this node is a commutative operator, check that the LHS isn't an
618 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
619 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
620 // Scan all of the operands of the node and make sure that only the last one
621 // is a constant node.
622 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i)
623 if (!getChild(i)->isLeaf() &&
624 getChild(i)->getOperator()->getName() == "imm") {
625 Reason = "Immediate value must be on the RHS of commutative operators!";
633 //===----------------------------------------------------------------------===//
634 // TreePattern implementation
637 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
638 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
639 isInputPattern = isInput;
640 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
641 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
644 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
645 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
646 isInputPattern = isInput;
647 Trees.push_back(ParseTreePattern(Pat));
650 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
651 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
652 isInputPattern = isInput;
653 Trees.push_back(Pat);
658 void TreePattern::error(const std::string &Msg) const {
660 throw "In " + TheRecord->getName() + ": " + Msg;
663 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
664 Record *Operator = Dag->getNodeType();
666 if (Operator->isSubClassOf("ValueType")) {
667 // If the operator is a ValueType, then this must be "type cast" of a leaf
669 if (Dag->getNumArgs() != 1)
670 error("Type cast only takes one operand!");
672 Init *Arg = Dag->getArg(0);
673 TreePatternNode *New;
674 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
675 Record *R = DI->getDef();
676 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
677 Dag->setArg(0, new DagInit(R,
678 std::vector<std::pair<Init*, std::string> >()));
679 return ParseTreePattern(Dag);
681 New = new TreePatternNode(DI);
682 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
683 New = ParseTreePattern(DI);
684 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
685 New = new TreePatternNode(II);
686 if (!Dag->getArgName(0).empty())
687 error("Constant int argument should not have a name!");
690 error("Unknown leaf value for tree pattern!");
694 // Apply the type cast.
695 New->UpdateNodeType(getValueType(Operator), *this);
696 New->setName(Dag->getArgName(0));
700 // Verify that this is something that makes sense for an operator.
701 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
702 !Operator->isSubClassOf("Instruction") &&
703 !Operator->isSubClassOf("SDNodeXForm") &&
704 Operator->getName() != "set")
705 error("Unrecognized node '" + Operator->getName() + "'!");
707 // Check to see if this is something that is illegal in an input pattern.
708 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
709 Operator->isSubClassOf("SDNodeXForm")))
710 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
712 std::vector<TreePatternNode*> Children;
714 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
715 Init *Arg = Dag->getArg(i);
716 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
717 Children.push_back(ParseTreePattern(DI));
718 if (Children.back()->getName().empty())
719 Children.back()->setName(Dag->getArgName(i));
720 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
721 Record *R = DefI->getDef();
722 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
723 // TreePatternNode if its own.
724 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
725 Dag->setArg(i, new DagInit(R,
726 std::vector<std::pair<Init*, std::string> >()));
727 --i; // Revisit this node...
729 TreePatternNode *Node = new TreePatternNode(DefI);
730 Node->setName(Dag->getArgName(i));
731 Children.push_back(Node);
734 if (R->getName() == "node") {
735 if (Dag->getArgName(i).empty())
736 error("'node' argument requires a name to match with operand list");
737 Args.push_back(Dag->getArgName(i));
740 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
741 TreePatternNode *Node = new TreePatternNode(II);
742 if (!Dag->getArgName(i).empty())
743 error("Constant int argument should not have a name!");
744 Children.push_back(Node);
749 error("Unknown leaf value for tree pattern!");
753 return new TreePatternNode(Operator, Children);
756 /// InferAllTypes - Infer/propagate as many types throughout the expression
757 /// patterns as possible. Return true if all types are infered, false
758 /// otherwise. Throw an exception if a type contradiction is found.
759 bool TreePattern::InferAllTypes() {
760 bool MadeChange = true;
763 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
764 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
767 bool HasUnresolvedTypes = false;
768 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
769 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
770 return !HasUnresolvedTypes;
773 void TreePattern::print(std::ostream &OS) const {
774 OS << getRecord()->getName();
776 OS << "(" << Args[0];
777 for (unsigned i = 1, e = Args.size(); i != e; ++i)
778 OS << ", " << Args[i];
783 if (Trees.size() > 1)
785 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
791 if (Trees.size() > 1)
795 void TreePattern::dump() const { print(std::cerr); }
799 //===----------------------------------------------------------------------===//
800 // DAGISelEmitter implementation
803 // Parse all of the SDNode definitions for the target, populating SDNodes.
804 void DAGISelEmitter::ParseNodeInfo() {
805 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
806 while (!Nodes.empty()) {
807 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
812 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
813 /// map, and emit them to the file as functions.
814 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
815 OS << "\n// Node transformations.\n";
816 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
817 while (!Xforms.empty()) {
818 Record *XFormNode = Xforms.back();
819 Record *SDNode = XFormNode->getValueAsDef("Opcode");
820 std::string Code = XFormNode->getValueAsCode("XFormFunction");
821 SDNodeXForms.insert(std::make_pair(XFormNode,
822 std::make_pair(SDNode, Code)));
825 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
826 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
828 OS << "inline SDOperand Transform_" << XFormNode->getName()
829 << "(SDNode *" << C2 << ") {\n";
830 if (ClassName != "SDNode")
831 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
832 OS << Code << "\n}\n";
839 void DAGISelEmitter::ParseComplexPatterns() {
840 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
841 while (!AMs.empty()) {
842 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
848 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
849 /// file, building up the PatternFragments map. After we've collected them all,
850 /// inline fragments together as necessary, so that there are no references left
851 /// inside a pattern fragment to a pattern fragment.
853 /// This also emits all of the predicate functions to the output file.
855 void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) {
856 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
858 // First step, parse all of the fragments and emit predicate functions.
859 OS << "\n// Predicate functions.\n";
860 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
861 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
862 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
863 PatternFragments[Fragments[i]] = P;
865 // Validate the argument list, converting it to map, to discard duplicates.
866 std::vector<std::string> &Args = P->getArgList();
867 std::set<std::string> OperandsMap(Args.begin(), Args.end());
869 if (OperandsMap.count(""))
870 P->error("Cannot have unnamed 'node' values in pattern fragment!");
872 // Parse the operands list.
873 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
874 if (OpsList->getNodeType()->getName() != "ops")
875 P->error("Operands list should start with '(ops ... '!");
877 // Copy over the arguments.
879 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
880 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
881 static_cast<DefInit*>(OpsList->getArg(j))->
882 getDef()->getName() != "node")
883 P->error("Operands list should all be 'node' values.");
884 if (OpsList->getArgName(j).empty())
885 P->error("Operands list should have names for each operand!");
886 if (!OperandsMap.count(OpsList->getArgName(j)))
887 P->error("'" + OpsList->getArgName(j) +
888 "' does not occur in pattern or was multiply specified!");
889 OperandsMap.erase(OpsList->getArgName(j));
890 Args.push_back(OpsList->getArgName(j));
893 if (!OperandsMap.empty())
894 P->error("Operands list does not contain an entry for operand '" +
895 *OperandsMap.begin() + "'!");
897 // If there is a code init for this fragment, emit the predicate code and
898 // keep track of the fact that this fragment uses it.
899 std::string Code = Fragments[i]->getValueAsCode("Predicate");
901 assert(!P->getOnlyTree()->isLeaf() && "Can't be a leaf!");
902 std::string ClassName =
903 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
904 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
906 OS << "inline bool Predicate_" << Fragments[i]->getName()
907 << "(SDNode *" << C2 << ") {\n";
908 if (ClassName != "SDNode")
909 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
910 OS << Code << "\n}\n";
911 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
914 // If there is a node transformation corresponding to this, keep track of
916 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
917 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
918 P->getOnlyTree()->setTransformFn(Transform);
923 // Now that we've parsed all of the tree fragments, do a closure on them so
924 // that there are not references to PatFrags left inside of them.
925 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
926 E = PatternFragments.end(); I != E; ++I) {
927 TreePattern *ThePat = I->second;
928 ThePat->InlinePatternFragments();
930 // Infer as many types as possible. Don't worry about it if we don't infer
931 // all of them, some may depend on the inputs of the pattern.
933 ThePat->InferAllTypes();
935 // If this pattern fragment is not supported by this target (no types can
936 // satisfy its constraints), just ignore it. If the bogus pattern is
937 // actually used by instructions, the type consistency error will be
941 // If debugging, print out the pattern fragment result.
942 DEBUG(ThePat->dump());
946 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
947 /// instruction input. Return true if this is a real use.
948 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
949 std::map<std::string, TreePatternNode*> &InstInputs) {
950 // No name -> not interesting.
951 if (Pat->getName().empty()) {
953 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
954 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
955 I->error("Input " + DI->getDef()->getName() + " must be named!");
963 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
964 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
967 assert(Pat->getNumChildren() == 0 && "can't be a use with children!");
968 Rec = Pat->getOperator();
971 TreePatternNode *&Slot = InstInputs[Pat->getName()];
976 if (Slot->isLeaf()) {
977 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
979 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
980 SlotRec = Slot->getOperator();
983 // Ensure that the inputs agree if we've already seen this input.
985 I->error("All $" + Pat->getName() + " inputs must agree with each other");
986 if (Slot->getExtType() != Pat->getExtType())
987 I->error("All $" + Pat->getName() + " inputs must agree with each other");
992 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
993 /// part of "I", the instruction), computing the set of inputs and outputs of
994 /// the pattern. Report errors if we see anything naughty.
995 void DAGISelEmitter::
996 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
997 std::map<std::string, TreePatternNode*> &InstInputs,
998 std::map<std::string, Record*> &InstResults) {
1000 bool isUse = HandleUse(I, Pat, InstInputs);
1001 if (!isUse && Pat->getTransformFn())
1002 I->error("Cannot specify a transform function for a non-input value!");
1004 } else if (Pat->getOperator()->getName() != "set") {
1005 // If this is not a set, verify that the children nodes are not void typed,
1007 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1008 if (Pat->getChild(i)->getExtType() == MVT::isVoid)
1009 I->error("Cannot have void nodes inside of patterns!");
1010 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults);
1013 // If this is a non-leaf node with no children, treat it basically as if
1014 // it were a leaf. This handles nodes like (imm).
1016 if (Pat->getNumChildren() == 0)
1017 isUse = HandleUse(I, Pat, InstInputs);
1019 if (!isUse && Pat->getTransformFn())
1020 I->error("Cannot specify a transform function for a non-input value!");
1024 // Otherwise, this is a set, validate and collect instruction results.
1025 if (Pat->getNumChildren() == 0)
1026 I->error("set requires operands!");
1027 else if (Pat->getNumChildren() & 1)
1028 I->error("set requires an even number of operands");
1030 if (Pat->getTransformFn())
1031 I->error("Cannot specify a transform function on a set node!");
1033 // Check the set destinations.
1034 unsigned NumValues = Pat->getNumChildren()/2;
1035 for (unsigned i = 0; i != NumValues; ++i) {
1036 TreePatternNode *Dest = Pat->getChild(i);
1037 if (!Dest->isLeaf())
1038 I->error("set destination should be a virtual register!");
1040 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1042 I->error("set destination should be a virtual register!");
1044 if (!Val->getDef()->isSubClassOf("RegisterClass"))
1045 I->error("set destination should be a virtual register!");
1046 if (Dest->getName().empty())
1047 I->error("set destination must have a name!");
1048 if (InstResults.count(Dest->getName()))
1049 I->error("cannot set '" + Dest->getName() +"' multiple times");
1050 InstResults[Dest->getName()] = Val->getDef();
1052 // Verify and collect info from the computation.
1053 FindPatternInputsAndOutputs(I, Pat->getChild(i+NumValues),
1054 InstInputs, InstResults);
1058 /// NodeHasChain - return true if TreePatternNode has the property
1059 /// 'hasChain', meaning it reads a ctrl-flow chain operand and writes
1061 static bool NodeHasChain(TreePatternNode *N, DAGISelEmitter &ISE)
1063 if (N->isLeaf()) return false;
1064 Record *Operator = N->getOperator();
1065 if (!Operator->isSubClassOf("SDNode")) return false;
1067 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(Operator);
1068 return NodeInfo.hasProperty(SDNodeInfo::SDNPHasChain);
1071 static bool PatternHasCtrlDep(TreePatternNode *N, DAGISelEmitter &ISE)
1073 if (NodeHasChain(N, ISE))
1076 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
1077 TreePatternNode *Child = N->getChild(i);
1078 if (PatternHasCtrlDep(Child, ISE))
1087 /// ParseInstructions - Parse all of the instructions, inlining and resolving
1088 /// any fragments involved. This populates the Instructions list with fully
1089 /// resolved instructions.
1090 void DAGISelEmitter::ParseInstructions() {
1091 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1093 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1096 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1097 LI = Instrs[i]->getValueAsListInit("Pattern");
1099 // If there is no pattern, only collect minimal information about the
1100 // instruction for its operand list. We have to assume that there is one
1101 // result, as we have no detailed info.
1102 if (!LI || LI->getSize() == 0) {
1103 std::vector<Record*> Results;
1104 std::vector<Record*> Operands;
1106 CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1108 // Doesn't even define a result?
1109 if (InstInfo.OperandList.size() == 0)
1112 // FIXME: temporary hack...
1113 if (InstInfo.isReturn || InstInfo.isBranch || InstInfo.isCall ||
1115 // These produce no results
1116 for (unsigned j = 0, e = InstInfo.OperandList.size(); j != e; ++j)
1117 Operands.push_back(InstInfo.OperandList[j].Rec);
1119 // Assume the first operand is the result.
1120 Results.push_back(InstInfo.OperandList[0].Rec);
1122 // The rest are inputs.
1123 for (unsigned j = 1, e = InstInfo.OperandList.size(); j != e; ++j)
1124 Operands.push_back(InstInfo.OperandList[j].Rec);
1127 // Create and insert the instruction.
1128 Instructions.insert(std::make_pair(Instrs[i],
1129 DAGInstruction(0, Results, Operands)));
1130 continue; // no pattern.
1133 // Parse the instruction.
1134 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1135 // Inline pattern fragments into it.
1136 I->InlinePatternFragments();
1138 // Infer as many types as possible. If we cannot infer all of them, we can
1139 // never do anything with this instruction pattern: report it to the user.
1140 if (!I->InferAllTypes())
1141 I->error("Could not infer all types in pattern!");
1143 // InstInputs - Keep track of all of the inputs of the instruction, along
1144 // with the record they are declared as.
1145 std::map<std::string, TreePatternNode*> InstInputs;
1147 // InstResults - Keep track of all the virtual registers that are 'set'
1148 // in the instruction, including what reg class they are.
1149 std::map<std::string, Record*> InstResults;
1151 // Verify that the top-level forms in the instruction are of void type, and
1152 // fill in the InstResults map.
1153 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1154 TreePatternNode *Pat = I->getTree(j);
1155 if (Pat->getExtType() != MVT::isVoid)
1156 I->error("Top-level forms in instruction pattern should have"
1159 // Find inputs and outputs, and verify the structure of the uses/defs.
1160 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults);
1163 // Now that we have inputs and outputs of the pattern, inspect the operands
1164 // list for the instruction. This determines the order that operands are
1165 // added to the machine instruction the node corresponds to.
1166 unsigned NumResults = InstResults.size();
1168 // Parse the operands list from the (ops) list, validating it.
1169 std::vector<std::string> &Args = I->getArgList();
1170 assert(Args.empty() && "Args list should still be empty here!");
1171 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1173 // Check that all of the results occur first in the list.
1174 std::vector<Record*> Results;
1175 for (unsigned i = 0; i != NumResults; ++i) {
1176 if (i == CGI.OperandList.size())
1177 I->error("'" + InstResults.begin()->first +
1178 "' set but does not appear in operand list!");
1179 const std::string &OpName = CGI.OperandList[i].Name;
1181 // Check that it exists in InstResults.
1182 Record *R = InstResults[OpName];
1184 I->error("Operand $" + OpName + " should be a set destination: all "
1185 "outputs must occur before inputs in operand list!");
1187 if (CGI.OperandList[i].Rec != R)
1188 I->error("Operand $" + OpName + " class mismatch!");
1190 // Remember the return type.
1191 Results.push_back(CGI.OperandList[i].Rec);
1193 // Okay, this one checks out.
1194 InstResults.erase(OpName);
1197 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
1198 // the copy while we're checking the inputs.
1199 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
1201 std::vector<TreePatternNode*> ResultNodeOperands;
1202 std::vector<Record*> Operands;
1203 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
1204 const std::string &OpName = CGI.OperandList[i].Name;
1206 I->error("Operand #" + utostr(i) + " in operands list has no name!");
1208 if (!InstInputsCheck.count(OpName))
1209 I->error("Operand $" + OpName +
1210 " does not appear in the instruction pattern");
1211 TreePatternNode *InVal = InstInputsCheck[OpName];
1212 InstInputsCheck.erase(OpName); // It occurred, remove from map.
1214 if (InVal->isLeaf() &&
1215 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
1216 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
1217 if (CGI.OperandList[i].Rec != InRec &&
1218 !InRec->isSubClassOf("ComplexPattern"))
1219 I->error("Operand $" + OpName +
1220 "'s register class disagrees between the operand and pattern");
1222 Operands.push_back(CGI.OperandList[i].Rec);
1224 // Construct the result for the dest-pattern operand list.
1225 TreePatternNode *OpNode = InVal->clone();
1227 // No predicate is useful on the result.
1228 OpNode->setPredicateFn("");
1230 // Promote the xform function to be an explicit node if set.
1231 if (Record *Xform = OpNode->getTransformFn()) {
1232 OpNode->setTransformFn(0);
1233 std::vector<TreePatternNode*> Children;
1234 Children.push_back(OpNode);
1235 OpNode = new TreePatternNode(Xform, Children);
1238 ResultNodeOperands.push_back(OpNode);
1241 if (!InstInputsCheck.empty())
1242 I->error("Input operand $" + InstInputsCheck.begin()->first +
1243 " occurs in pattern but not in operands list!");
1245 TreePatternNode *ResultPattern =
1246 new TreePatternNode(I->getRecord(), ResultNodeOperands);
1248 // Create and insert the instruction.
1249 DAGInstruction TheInst(I, Results, Operands);
1250 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
1252 // Use a temporary tree pattern to infer all types and make sure that the
1253 // constructed result is correct. This depends on the instruction already
1254 // being inserted into the Instructions map.
1255 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
1256 Temp.InferAllTypes();
1258 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
1259 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
1264 // If we can, convert the instructions to be patterns that are matched!
1265 for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
1266 E = Instructions.end(); II != E; ++II) {
1267 DAGInstruction &TheInst = II->second;
1268 TreePattern *I = TheInst.getPattern();
1269 if (I == 0) continue; // No pattern.
1271 if (I->getNumTrees() != 1) {
1272 std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
1275 TreePatternNode *Pattern = I->getTree(0);
1276 TreePatternNode *SrcPattern;
1277 if (TheInst.getNumResults() == 0) {
1278 SrcPattern = Pattern;
1280 if (Pattern->getOperator()->getName() != "set")
1281 continue; // Not a set (store or something?)
1283 if (Pattern->getNumChildren() != 2)
1284 continue; // Not a set of a single value (not handled so far)
1286 SrcPattern = Pattern->getChild(1)->clone();
1290 if (!SrcPattern->canPatternMatch(Reason, *this))
1291 I->error("Instruction can never match: " + Reason);
1293 TreePatternNode *DstPattern = TheInst.getResultPattern();
1294 PatternsToMatch.push_back(std::make_pair(SrcPattern, DstPattern));
1296 if (PatternHasCtrlDep(Pattern, *this)) {
1297 Record *Instr = II->first;
1298 CodeGenInstruction &InstInfo = Target.getInstruction(Instr->getName());
1299 InstInfo.hasCtrlDep = true;
1304 void DAGISelEmitter::ParsePatterns() {
1305 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
1307 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1308 DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
1309 TreePattern *Pattern = new TreePattern(Patterns[i], Tree, true, *this);
1311 // Inline pattern fragments into it.
1312 Pattern->InlinePatternFragments();
1314 // Infer as many types as possible. If we cannot infer all of them, we can
1315 // never do anything with this pattern: report it to the user.
1316 if (!Pattern->InferAllTypes())
1317 Pattern->error("Could not infer all types in pattern!");
1319 // Validate that the input pattern is correct.
1321 std::map<std::string, TreePatternNode*> InstInputs;
1322 std::map<std::string, Record*> InstResults;
1323 FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(),
1324 InstInputs, InstResults);
1327 ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
1328 if (LI->getSize() == 0) continue; // no pattern.
1330 // Parse the instruction.
1331 TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
1333 // Inline pattern fragments into it.
1334 Result->InlinePatternFragments();
1336 // Infer as many types as possible. If we cannot infer all of them, we can
1337 // never do anything with this pattern: report it to the user.
1338 if (!Result->InferAllTypes())
1339 Result->error("Could not infer all types in pattern result!");
1341 if (Result->getNumTrees() != 1)
1342 Result->error("Cannot handle instructions producing instructions "
1343 "with temporaries yet!");
1346 if (!Pattern->getOnlyTree()->canPatternMatch(Reason, *this))
1347 Pattern->error("Pattern can never match: " + Reason);
1349 PatternsToMatch.push_back(std::make_pair(Pattern->getOnlyTree(),
1350 Result->getOnlyTree()));
1354 /// CombineChildVariants - Given a bunch of permutations of each child of the
1355 /// 'operator' node, put them together in all possible ways.
1356 static void CombineChildVariants(TreePatternNode *Orig,
1357 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
1358 std::vector<TreePatternNode*> &OutVariants,
1359 DAGISelEmitter &ISE) {
1360 // Make sure that each operand has at least one variant to choose from.
1361 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1362 if (ChildVariants[i].empty())
1365 // The end result is an all-pairs construction of the resultant pattern.
1366 std::vector<unsigned> Idxs;
1367 Idxs.resize(ChildVariants.size());
1368 bool NotDone = true;
1370 // Create the variant and add it to the output list.
1371 std::vector<TreePatternNode*> NewChildren;
1372 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1373 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
1374 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
1376 // Copy over properties.
1377 R->setName(Orig->getName());
1378 R->setPredicateFn(Orig->getPredicateFn());
1379 R->setTransformFn(Orig->getTransformFn());
1380 R->setType(Orig->getExtType());
1382 // If this pattern cannot every match, do not include it as a variant.
1383 std::string ErrString;
1384 if (!R->canPatternMatch(ErrString, ISE)) {
1387 bool AlreadyExists = false;
1389 // Scan to see if this pattern has already been emitted. We can get
1390 // duplication due to things like commuting:
1391 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
1392 // which are the same pattern. Ignore the dups.
1393 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
1394 if (R->isIsomorphicTo(OutVariants[i])) {
1395 AlreadyExists = true;
1402 OutVariants.push_back(R);
1405 // Increment indices to the next permutation.
1407 // Look for something we can increment without causing a wrap-around.
1408 for (unsigned IdxsIdx = 0; IdxsIdx != Idxs.size(); ++IdxsIdx) {
1409 if (++Idxs[IdxsIdx] < ChildVariants[IdxsIdx].size()) {
1410 NotDone = true; // Found something to increment.
1418 /// CombineChildVariants - A helper function for binary operators.
1420 static void CombineChildVariants(TreePatternNode *Orig,
1421 const std::vector<TreePatternNode*> &LHS,
1422 const std::vector<TreePatternNode*> &RHS,
1423 std::vector<TreePatternNode*> &OutVariants,
1424 DAGISelEmitter &ISE) {
1425 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1426 ChildVariants.push_back(LHS);
1427 ChildVariants.push_back(RHS);
1428 CombineChildVariants(Orig, ChildVariants, OutVariants, ISE);
1432 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
1433 std::vector<TreePatternNode *> &Children) {
1434 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
1435 Record *Operator = N->getOperator();
1437 // Only permit raw nodes.
1438 if (!N->getName().empty() || !N->getPredicateFn().empty() ||
1439 N->getTransformFn()) {
1440 Children.push_back(N);
1444 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
1445 Children.push_back(N->getChild(0));
1447 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
1449 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
1450 Children.push_back(N->getChild(1));
1452 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
1455 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
1456 /// the (potentially recursive) pattern by using algebraic laws.
1458 static void GenerateVariantsOf(TreePatternNode *N,
1459 std::vector<TreePatternNode*> &OutVariants,
1460 DAGISelEmitter &ISE) {
1461 // We cannot permute leaves.
1463 OutVariants.push_back(N);
1467 // Look up interesting info about the node.
1468 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1470 // If this node is associative, reassociate.
1471 if (NodeInfo.hasProperty(SDNodeInfo::SDNPAssociative)) {
1472 // Reassociate by pulling together all of the linked operators
1473 std::vector<TreePatternNode*> MaximalChildren;
1474 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
1476 // Only handle child sizes of 3. Otherwise we'll end up trying too many
1478 if (MaximalChildren.size() == 3) {
1479 // Find the variants of all of our maximal children.
1480 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
1481 GenerateVariantsOf(MaximalChildren[0], AVariants, ISE);
1482 GenerateVariantsOf(MaximalChildren[1], BVariants, ISE);
1483 GenerateVariantsOf(MaximalChildren[2], CVariants, ISE);
1485 // There are only two ways we can permute the tree:
1486 // (A op B) op C and A op (B op C)
1487 // Within these forms, we can also permute A/B/C.
1489 // Generate legal pair permutations of A/B/C.
1490 std::vector<TreePatternNode*> ABVariants;
1491 std::vector<TreePatternNode*> BAVariants;
1492 std::vector<TreePatternNode*> ACVariants;
1493 std::vector<TreePatternNode*> CAVariants;
1494 std::vector<TreePatternNode*> BCVariants;
1495 std::vector<TreePatternNode*> CBVariants;
1496 CombineChildVariants(N, AVariants, BVariants, ABVariants, ISE);
1497 CombineChildVariants(N, BVariants, AVariants, BAVariants, ISE);
1498 CombineChildVariants(N, AVariants, CVariants, ACVariants, ISE);
1499 CombineChildVariants(N, CVariants, AVariants, CAVariants, ISE);
1500 CombineChildVariants(N, BVariants, CVariants, BCVariants, ISE);
1501 CombineChildVariants(N, CVariants, BVariants, CBVariants, ISE);
1503 // Combine those into the result: (x op x) op x
1504 CombineChildVariants(N, ABVariants, CVariants, OutVariants, ISE);
1505 CombineChildVariants(N, BAVariants, CVariants, OutVariants, ISE);
1506 CombineChildVariants(N, ACVariants, BVariants, OutVariants, ISE);
1507 CombineChildVariants(N, CAVariants, BVariants, OutVariants, ISE);
1508 CombineChildVariants(N, BCVariants, AVariants, OutVariants, ISE);
1509 CombineChildVariants(N, CBVariants, AVariants, OutVariants, ISE);
1511 // Combine those into the result: x op (x op x)
1512 CombineChildVariants(N, CVariants, ABVariants, OutVariants, ISE);
1513 CombineChildVariants(N, CVariants, BAVariants, OutVariants, ISE);
1514 CombineChildVariants(N, BVariants, ACVariants, OutVariants, ISE);
1515 CombineChildVariants(N, BVariants, CAVariants, OutVariants, ISE);
1516 CombineChildVariants(N, AVariants, BCVariants, OutVariants, ISE);
1517 CombineChildVariants(N, AVariants, CBVariants, OutVariants, ISE);
1522 // Compute permutations of all children.
1523 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1524 ChildVariants.resize(N->getNumChildren());
1525 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1526 GenerateVariantsOf(N->getChild(i), ChildVariants[i], ISE);
1528 // Build all permutations based on how the children were formed.
1529 CombineChildVariants(N, ChildVariants, OutVariants, ISE);
1531 // If this node is commutative, consider the commuted order.
1532 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
1533 assert(N->getNumChildren()==2 &&"Commutative but doesn't have 2 children!");
1534 // Consider the commuted order.
1535 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
1541 // GenerateVariants - Generate variants. For example, commutative patterns can
1542 // match multiple ways. Add them to PatternsToMatch as well.
1543 void DAGISelEmitter::GenerateVariants() {
1545 DEBUG(std::cerr << "Generating instruction variants.\n");
1547 // Loop over all of the patterns we've collected, checking to see if we can
1548 // generate variants of the instruction, through the exploitation of
1549 // identities. This permits the target to provide agressive matching without
1550 // the .td file having to contain tons of variants of instructions.
1552 // Note that this loop adds new patterns to the PatternsToMatch list, but we
1553 // intentionally do not reconsider these. Any variants of added patterns have
1554 // already been added.
1556 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
1557 std::vector<TreePatternNode*> Variants;
1558 GenerateVariantsOf(PatternsToMatch[i].first, Variants, *this);
1560 assert(!Variants.empty() && "Must create at least original variant!");
1561 Variants.erase(Variants.begin()); // Remove the original pattern.
1563 if (Variants.empty()) // No variants for this pattern.
1566 DEBUG(std::cerr << "FOUND VARIANTS OF: ";
1567 PatternsToMatch[i].first->dump();
1570 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
1571 TreePatternNode *Variant = Variants[v];
1573 DEBUG(std::cerr << " VAR#" << v << ": ";
1577 // Scan to see if an instruction or explicit pattern already matches this.
1578 bool AlreadyExists = false;
1579 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
1580 // Check to see if this variant already exists.
1581 if (Variant->isIsomorphicTo(PatternsToMatch[p].first)) {
1582 DEBUG(std::cerr << " *** ALREADY EXISTS, ignoring variant.\n");
1583 AlreadyExists = true;
1587 // If we already have it, ignore the variant.
1588 if (AlreadyExists) continue;
1590 // Otherwise, add it to the list of patterns we have.
1591 PatternsToMatch.push_back(std::make_pair(Variant,
1592 PatternsToMatch[i].second));
1595 DEBUG(std::cerr << "\n");
1600 // NodeIsComplexPattern - return true if N is a leaf node and a subclass of
1602 static bool NodeIsComplexPattern(TreePatternNode *N)
1604 return (N->isLeaf() &&
1605 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1606 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1607 isSubClassOf("ComplexPattern"));
1610 // NodeGetComplexPattern - return the pointer to the ComplexPattern if N
1611 // is a leaf node and a subclass of ComplexPattern, else it returns NULL.
1612 static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
1613 DAGISelEmitter &ISE)
1616 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1617 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1618 isSubClassOf("ComplexPattern")) {
1619 return &ISE.getComplexPattern(static_cast<DefInit*>(N->getLeafValue())
1625 /// getPatternSize - Return the 'size' of this pattern. We want to match large
1626 /// patterns before small ones. This is used to determine the size of a
1628 static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
1629 assert(isExtIntegerVT(P->getExtType()) ||
1630 isExtFloatingPointVT(P->getExtType()) ||
1631 P->getExtType() == MVT::isVoid && "Not a valid pattern node to size!");
1632 unsigned Size = 1; // The node itself.
1634 // FIXME: This is a hack to statically increase the priority of patterns
1635 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
1636 // Later we can allow complexity / cost for each pattern to be (optionally)
1637 // specified. To get best possible pattern match we'll need to dynamically
1638 // calculate the complexity of all patterns a dag can potentially map to.
1639 const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
1641 Size += AM->getNumOperands();
1643 // Count children in the count if they are also nodes.
1644 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
1645 TreePatternNode *Child = P->getChild(i);
1646 if (!Child->isLeaf() && Child->getExtType() != MVT::Other)
1647 Size += getPatternSize(Child, ISE);
1648 else if (Child->isLeaf()) {
1649 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
1650 ++Size; // Matches a ConstantSDNode.
1651 else if (NodeIsComplexPattern(Child))
1652 Size += getPatternSize(Child, ISE);
1659 /// getResultPatternCost - Compute the number of instructions for this pattern.
1660 /// This is a temporary hack. We should really include the instruction
1661 /// latencies in this calculation.
1662 static unsigned getResultPatternCost(TreePatternNode *P) {
1663 if (P->isLeaf()) return 0;
1665 unsigned Cost = P->getOperator()->isSubClassOf("Instruction");
1666 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
1667 Cost += getResultPatternCost(P->getChild(i));
1671 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
1672 // In particular, we want to match maximal patterns first and lowest cost within
1673 // a particular complexity first.
1674 struct PatternSortingPredicate {
1675 PatternSortingPredicate(DAGISelEmitter &ise) : ISE(ise) {};
1676 DAGISelEmitter &ISE;
1678 bool operator()(DAGISelEmitter::PatternToMatch *LHS,
1679 DAGISelEmitter::PatternToMatch *RHS) {
1680 unsigned LHSSize = getPatternSize(LHS->first, ISE);
1681 unsigned RHSSize = getPatternSize(RHS->first, ISE);
1682 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
1683 if (LHSSize < RHSSize) return false;
1685 // If the patterns have equal complexity, compare generated instruction cost
1686 return getResultPatternCost(LHS->second) <getResultPatternCost(RHS->second);
1690 /// EmitMatchForPattern - Emit a matcher for N, going to the label for PatternNo
1691 /// if the match fails. At this point, we already know that the opcode for N
1692 /// matches, and the SDNode for the result has the RootName specified name.
1693 void DAGISelEmitter::EmitMatchForPattern(TreePatternNode *N,
1694 const std::string &RootName,
1695 std::map<std::string,std::string> &VarMap,
1696 unsigned PatternNo,std::ostream &OS) {
1698 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
1699 OS << " if (cast<ConstantSDNode>(" << RootName
1700 << ")->getSignExtended() != " << II->getValue() << ")\n"
1701 << " goto P" << PatternNo << "Fail;\n";
1703 } else if (!NodeIsComplexPattern(N)) {
1704 assert(0 && "Cannot match this as a leaf value!");
1709 // If this node has a name associated with it, capture it in VarMap. If
1710 // we already saw this in the pattern, emit code to verify dagness.
1711 if (!N->getName().empty()) {
1712 std::string &VarMapEntry = VarMap[N->getName()];
1713 if (VarMapEntry.empty()) {
1714 VarMapEntry = RootName;
1716 // If we get here, this is a second reference to a specific name. Since
1717 // we already have checked that the first reference is valid, we don't
1718 // have to recursively match it, just check that it's the same as the
1719 // previously named thing.
1720 OS << " if (" << VarMapEntry << " != " << RootName
1721 << ") goto P" << PatternNo << "Fail;\n";
1727 // Emit code to load the child nodes and match their contents recursively.
1728 unsigned OpNo = (unsigned) NodeHasChain(N, *this);
1729 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
1730 OS << " SDOperand " << RootName << OpNo <<" = " << RootName
1731 << ".getOperand(" << OpNo << ");\n";
1732 TreePatternNode *Child = N->getChild(i);
1734 if (!Child->isLeaf()) {
1735 // If it's not a leaf, recursively match.
1736 const SDNodeInfo &CInfo = getSDNodeInfo(Child->getOperator());
1737 OS << " if (" << RootName << OpNo << ".getOpcode() != "
1738 << CInfo.getEnumName() << ") goto P" << PatternNo << "Fail;\n";
1739 EmitMatchForPattern(Child, RootName + utostr(OpNo), VarMap, PatternNo,
1742 // If this child has a name associated with it, capture it in VarMap. If
1743 // we already saw this in the pattern, emit code to verify dagness.
1744 if (!Child->getName().empty()) {
1745 std::string &VarMapEntry = VarMap[Child->getName()];
1746 if (VarMapEntry.empty()) {
1747 VarMapEntry = RootName + utostr(OpNo);
1749 // If we get here, this is a second reference to a specific name. Since
1750 // we already have checked that the first reference is valid, we don't
1751 // have to recursively match it, just check that it's the same as the
1752 // previously named thing.
1753 OS << " if (" << VarMapEntry << " != " << RootName << OpNo
1754 << ") goto P" << PatternNo << "Fail;\n";
1759 // Handle leaves of various types.
1760 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1761 Record *LeafRec = DI->getDef();
1762 if (LeafRec->isSubClassOf("RegisterClass") ||
1763 LeafRec->isSubClassOf("Register")) {
1764 // Handle register references. Nothing to do here.
1765 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
1766 // Handle complex pattern. Nothing to do here.
1767 } else if (LeafRec->isSubClassOf("ValueType")) {
1768 // Make sure this is the specified value type.
1769 OS << " if (cast<VTSDNode>(" << RootName << OpNo << ")->getVT() != "
1770 << "MVT::" << LeafRec->getName() << ") goto P" << PatternNo
1772 } else if (LeafRec->isSubClassOf("CondCode")) {
1773 // Make sure this is the specified cond code.
1774 OS << " if (cast<CondCodeSDNode>(" << RootName << OpNo
1775 << ")->get() != " << "ISD::" << LeafRec->getName()
1776 << ") goto P" << PatternNo << "Fail;\n";
1779 assert(0 && "Unknown leaf type!");
1781 } else if (IntInit *II = dynamic_cast<IntInit*>(Child->getLeafValue())) {
1782 OS << " if (!isa<ConstantSDNode>(" << RootName << OpNo << ") ||\n"
1783 << " cast<ConstantSDNode>(" << RootName << OpNo
1784 << ")->getSignExtended() != " << II->getValue() << ")\n"
1785 << " goto P" << PatternNo << "Fail;\n";
1788 assert(0 && "Unknown leaf type!");
1793 // If there is a node predicate for this, emit the call.
1794 if (!N->getPredicateFn().empty())
1795 OS << " if (!" << N->getPredicateFn() << "(" << RootName
1796 << ".Val)) goto P" << PatternNo << "Fail;\n";
1799 /// getRegisterValueType - Look up and return the first ValueType of specified
1800 /// RegisterClass record
1801 static MVT::ValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
1802 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
1803 return RC->getValueTypeNum(0);
1808 /// EmitLeadChainForPattern - Emit the flag operands for the DAG that will be
1809 /// built in CodeGenPatternResult.
1810 void DAGISelEmitter::EmitLeadChainForPattern(TreePatternNode *N,
1811 const std::string &RootName,
1815 bool hc = NodeHasChain(N, *this);
1816 unsigned OpNo = (unsigned) hc;
1817 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1818 EmitLeadChainForPattern(N->getChild(i), RootName + utostr(OpNo),
1821 if (!HasChain && hc) {
1822 OS << " SDOperand Chain = Select("
1823 << RootName << ".getOperand(0));\n";
1829 /// EmitCopyToRegsForPattern - Emit the flag operands for the DAG that will be
1830 /// built in CodeGenPatternResult.
1831 void DAGISelEmitter::EmitCopyToRegsForPattern(TreePatternNode *N,
1832 const std::string &RootName,
1834 bool &HasChain, bool &InFlag) {
1835 const CodeGenTarget &T = getTargetInfo();
1836 unsigned OpNo = (unsigned) NodeHasChain(N, *this);
1837 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
1838 TreePatternNode *Child = N->getChild(i);
1839 if (!Child->isLeaf()) {
1840 EmitCopyToRegsForPattern(Child, RootName + utostr(OpNo), OS, HasChain,
1843 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1844 Record *RR = DI->getDef();
1845 if (RR->isSubClassOf("Register")) {
1846 MVT::ValueType RVT = getRegisterValueType(RR, T);
1848 OS << " SDOperand InFlag = SDOperand(0,0);\n";
1852 OS << " SDOperand " << RootName << "CR" << i << ";\n";
1853 OS << " " << RootName << "CR" << i
1854 << " = CurDAG->getCopyToReg(Chain, CurDAG->getRegister("
1855 << getQualifiedName(RR) << ", MVT::" << getEnumName(RVT) << ")"
1856 << ", Select(" << RootName << OpNo << "), InFlag);\n";
1857 OS << " Chain = " << RootName << "CR" << i
1858 << ".getValue(0);\n";
1859 OS << " InFlag = " << RootName << "CR" << i
1860 << ".getValue(1);\n";
1862 OS << " InFlag = CurDAG->getCopyToReg(CurDAG->getEntryNode()"
1863 << ", CurDAG->getRegister(" << getQualifiedName(RR)
1864 << ", MVT::" << getEnumName(RVT) << ")"
1865 << ", Select(" << RootName << OpNo
1866 << "), InFlag).getValue(1);\n";
1874 /// CodeGenPatternResult - Emit the action for a pattern. Now that it has
1875 /// matched, we actually have to build a DAG!
1876 std::pair<unsigned, unsigned> DAGISelEmitter::
1877 CodeGenPatternResult(TreePatternNode *N, unsigned &Ctr,
1878 std::map<std::string,std::string> &VariableMap,
1880 std::ostream &OS, bool &HasChain, bool InFlag,
1882 // This is something selected from the pattern we matched.
1883 if (!N->getName().empty()) {
1884 assert(!isRoot && "Root of pattern cannot be a leaf!");
1885 std::string &Val = VariableMap[N->getName()];
1886 assert(!Val.empty() &&
1887 "Variable referenced but not defined and not caught earlier!");
1888 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
1889 // Already selected this operand, just return the tmpval.
1890 return std::make_pair(1, atoi(Val.c_str()+3));
1893 const ComplexPattern *CP;
1894 unsigned ResNo = Ctr++;
1895 unsigned NumRes = 1;
1896 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
1897 switch (N->getType()) {
1898 default: assert(0 && "Unknown type for constant node!");
1899 case MVT::i1: OS << " bool Tmp"; break;
1900 case MVT::i8: OS << " unsigned char Tmp"; break;
1901 case MVT::i16: OS << " unsigned short Tmp"; break;
1902 case MVT::i32: OS << " unsigned Tmp"; break;
1903 case MVT::i64: OS << " uint64_t Tmp"; break;
1905 OS << ResNo << "C = cast<ConstantSDNode>(" << Val << ")->getValue();\n";
1906 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetConstant(Tmp"
1907 << ResNo << "C, MVT::" << getEnumName(N->getType()) << ");\n";
1908 } else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") {
1909 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
1910 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, *this))) {
1911 std::string Fn = CP->getSelectFunc();
1912 NumRes = CP->getNumOperands();
1913 OS << " SDOperand ";
1914 for (unsigned i = 0; i < NumRes; i++) {
1915 if (i != 0) OS << ", ";
1916 OS << "Tmp" << i + ResNo;
1919 OS << " if (!" << Fn << "(" << Val;
1920 for (unsigned i = 0; i < NumRes; i++)
1921 OS << " , Tmp" << i + ResNo;
1922 OS << ")) goto P" << PatternNo << "Fail;\n";
1923 Ctr = ResNo + NumRes;
1925 OS << " SDOperand Tmp" << ResNo << " = Select(" << Val << ");\n";
1927 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
1928 // value if used multiple times by this pattern result.
1929 Val = "Tmp"+utostr(ResNo);
1930 return std::make_pair(NumRes, ResNo);
1934 // If this is an explicit register reference, handle it.
1935 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
1936 unsigned ResNo = Ctr++;
1937 if (DI->getDef()->isSubClassOf("Register")) {
1938 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getRegister("
1939 << getQualifiedName(DI->getDef()) << ", MVT::"
1940 << getEnumName(N->getType())
1942 return std::make_pair(1, ResNo);
1944 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
1945 unsigned ResNo = Ctr++;
1946 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetConstant("
1947 << II->getValue() << ", MVT::"
1948 << getEnumName(N->getType())
1950 return std::make_pair(1, ResNo);
1954 assert(0 && "Unknown leaf type!");
1955 return std::make_pair(1, ~0U);
1958 Record *Op = N->getOperator();
1959 if (Op->isSubClassOf("Instruction")) {
1960 // Emit all of the operands.
1961 std::vector<unsigned> Ops;
1962 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
1963 TreePatternNode *Child = N->getChild(i);
1964 std::pair<unsigned, unsigned> NOPair =
1965 CodeGenPatternResult(Child, Ctr,
1966 VariableMap, PatternNo, OS, HasChain, InFlag);
1967 for (unsigned j = 0; j < NOPair.first; j++)
1968 Ops.push_back(NOPair.second + j);
1971 CodeGenInstruction &II = Target.getInstruction(Op->getName());
1972 bool HasCtrlDep = II.hasCtrlDep;
1973 unsigned ResNo = Ctr++;
1975 const DAGInstruction &Inst = getInstruction(Op);
1976 unsigned NumResults = Inst.getNumResults();
1979 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetNode("
1980 << II.Namespace << "::" << II.TheDef->getName() << ", MVT::"
1981 << getEnumName(N->getType());
1982 unsigned LastOp = 0;
1983 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
1985 OS << ", Tmp" << LastOp;
1989 // Must have at least one result
1990 OS << " Chain = Tmp" << LastOp << ".getValue("
1991 << NumResults << ");\n";
1993 } else if (HasCtrlDep) {
1995 OS << " SDOperand Result = ";
1997 OS << " Chain = CodeGenMap[N] = ";
1998 OS << "CurDAG->getTargetNode("
1999 << II.Namespace << "::" << II.TheDef->getName();
2001 OS << ", MVT::" << getEnumName(N->getType()); // TODO: multiple results?
2002 OS << ", MVT::Other";
2003 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2004 OS << ", Tmp" << Ops[i];
2009 if (NumResults > 0) {
2010 OS << " CodeGenMap[N.getValue(0)] = Result;\n";
2011 OS << " CodeGenMap[N.getValue(" << NumResults
2012 << ")] = Result.getValue(" << NumResults << ");\n";
2013 OS << " Chain = Result.getValue(" << NumResults << ");\n";
2015 if (NumResults == 0)
2016 OS << " return Chain;\n";
2018 OS << " return (N.ResNo) ? Chain : Result.getValue(0);\n";
2020 // If this instruction is the root, and if there is only one use of it,
2021 // use SelectNodeTo instead of getTargetNode to avoid an allocation.
2022 OS << " if (N.Val->hasOneUse()) {\n";
2023 OS << " return CurDAG->SelectNodeTo(N.Val, "
2024 << II.Namespace << "::" << II.TheDef->getName() << ", MVT::"
2025 << getEnumName(N->getType());
2026 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2027 OS << ", Tmp" << Ops[i];
2031 OS << " } else {\n";
2032 OS << " return CodeGenMap[N] = CurDAG->getTargetNode("
2033 << II.Namespace << "::" << II.TheDef->getName() << ", MVT::"
2034 << getEnumName(N->getType());
2035 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2036 OS << ", Tmp" << Ops[i];
2042 return std::make_pair(1, ResNo);
2043 } else if (Op->isSubClassOf("SDNodeXForm")) {
2044 assert(N->getNumChildren() == 1 && "node xform should have one child!");
2045 unsigned OpVal = CodeGenPatternResult(N->getChild(0), Ctr,
2046 VariableMap, PatternNo, OS, HasChain, InFlag)
2049 unsigned ResNo = Ctr++;
2050 OS << " SDOperand Tmp" << ResNo << " = Transform_" << Op->getName()
2051 << "(Tmp" << OpVal << ".Val);\n";
2053 OS << " CodeGenMap[N] = Tmp" << ResNo << ";\n";
2054 OS << " return Tmp" << ResNo << ";\n";
2056 return std::make_pair(1, ResNo);
2059 assert(0 && "Unknown node in result pattern!");
2060 return std::make_pair(1, ~0U);
2064 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
2065 /// type information from it.
2066 static void RemoveAllTypes(TreePatternNode *N) {
2067 N->setType(MVT::isUnknown);
2069 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2070 RemoveAllTypes(N->getChild(i));
2073 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat' and
2074 /// add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
2075 /// 'Pat' may be missing types. If we find an unresolved type to add a check
2076 /// for, this returns true otherwise false if Pat has all types.
2077 static bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
2078 DAGISelEmitter &ISE,
2079 const std::string &Prefix, unsigned PatternNo,
2082 if (!Pat->hasTypeSet()) {
2083 // Move a type over from 'other' to 'pat'.
2084 Pat->setType(Other->getType());
2085 OS << " if (" << Prefix << ".Val->getValueType(0) != MVT::"
2086 << getName(Pat->getType()) << ") goto P" << PatternNo << "Fail;\n";
2088 } else if (Pat->isLeaf()) {
2089 if (NodeIsComplexPattern(Pat))
2090 OS << " if (" << Prefix << ".Val->getValueType(0) != MVT::"
2091 << getName(Pat->getType()) << ") goto P" << PatternNo << "Fail;\n";
2095 unsigned OpNo = (unsigned) NodeHasChain(Pat, ISE);
2096 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
2097 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
2098 ISE, Prefix + utostr(OpNo), PatternNo, OS))
2103 Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
2104 Record *N = Records.getDef(Name);
2105 assert(N && N->isSubClassOf("SDNode") && "Bad argument");
2109 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
2110 /// stream to match the pattern, and generate the code for the match if it
2112 void DAGISelEmitter::EmitCodeForPattern(PatternToMatch &Pattern,
2114 static unsigned PatternCount = 0;
2115 unsigned PatternNo = PatternCount++;
2116 OS << " { // Pattern #" << PatternNo << ": ";
2117 Pattern.first->print(OS);
2118 OS << "\n // Emits: ";
2119 Pattern.second->print(OS);
2121 OS << " // Pattern complexity = " << getPatternSize(Pattern.first, *this)
2122 << " cost = " << getResultPatternCost(Pattern.second) << "\n";
2124 // Emit the matcher, capturing named arguments in VariableMap.
2125 std::map<std::string,std::string> VariableMap;
2126 EmitMatchForPattern(Pattern.first, "N", VariableMap, PatternNo, OS);
2128 // TP - Get *SOME* tree pattern, we don't care which.
2129 TreePattern &TP = *PatternFragments.begin()->second;
2131 // At this point, we know that we structurally match the pattern, but the
2132 // types of the nodes may not match. Figure out the fewest number of type
2133 // comparisons we need to emit. For example, if there is only one integer
2134 // type supported by a target, there should be no type comparisons at all for
2135 // integer patterns!
2137 // To figure out the fewest number of type checks needed, clone the pattern,
2138 // remove the types, then perform type inference on the pattern as a whole.
2139 // If there are unresolved types, emit an explicit check for those types,
2140 // apply the type to the tree, then rerun type inference. Iterate until all
2141 // types are resolved.
2143 TreePatternNode *Pat = Pattern.first->clone();
2144 RemoveAllTypes(Pat);
2147 // Resolve/propagate as many types as possible.
2149 bool MadeChange = true;
2151 MadeChange = Pat->ApplyTypeConstraints(TP,true/*Ignore reg constraints*/);
2153 assert(0 && "Error: could not find consistent types for something we"
2154 " already decided was ok!");
2158 // Insert a check for an unresolved type and add it to the tree. If we find
2159 // an unresolved type to add a check for, this returns true and we iterate,
2160 // otherwise we are done.
2161 } while (InsertOneTypeCheck(Pat, Pattern.first, *this, "N", PatternNo, OS));
2163 bool HasChain = false;
2164 EmitLeadChainForPattern(Pattern.first, "N", OS, HasChain);
2166 bool InFlag = false;
2167 EmitCopyToRegsForPattern(Pattern.first, "N", OS, HasChain, InFlag);
2170 CodeGenPatternResult(Pattern.second,
2171 TmpNo, VariableMap, PatternNo, OS, HasChain, InFlag, true /*the root*/);
2174 OS << " }\n P" << PatternNo << "Fail:\n";
2179 /// CompareByRecordName - An ordering predicate that implements less-than by
2180 /// comparing the names records.
2181 struct CompareByRecordName {
2182 bool operator()(const Record *LHS, const Record *RHS) const {
2183 // Sort by name first.
2184 if (LHS->getName() < RHS->getName()) return true;
2185 // If both names are equal, sort by pointer.
2186 return LHS->getName() == RHS->getName() && LHS < RHS;
2191 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
2192 std::string InstNS = Target.inst_begin()->second.Namespace;
2193 if (!InstNS.empty()) InstNS += "::";
2195 // Emit boilerplate.
2196 OS << "// The main instruction selector code.\n"
2197 << "SDOperand SelectCode(SDOperand N) {\n"
2198 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
2199 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
2200 << "INSTRUCTION_LIST_END))\n"
2201 << " return N; // Already selected.\n\n"
2202 << " if (!N.Val->hasOneUse()) {\n"
2203 << " std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);\n"
2204 << " if (CGMI != CodeGenMap.end()) return CGMI->second;\n"
2206 << " switch (N.getOpcode()) {\n"
2207 << " default: break;\n"
2208 << " case ISD::EntryToken: // These leaves remain the same.\n"
2210 << " case ISD::AssertSext:\n"
2211 << " case ISD::AssertZext: {\n"
2212 << " SDOperand Tmp0 = Select(N.getOperand(0));\n"
2213 << " if (!N.Val->hasOneUse()) CodeGenMap[N] = Tmp0;\n"
2214 << " return Tmp0;\n"
2216 << " case ISD::TokenFactor:\n"
2217 << " if (N.getNumOperands() == 2) {\n"
2218 << " SDOperand Op0 = Select(N.getOperand(0));\n"
2219 << " SDOperand Op1 = Select(N.getOperand(1));\n"
2220 << " return CodeGenMap[N] =\n"
2221 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);\n"
2223 << " std::vector<SDOperand> Ops;\n"
2224 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)\n"
2225 << " Ops.push_back(Select(N.getOperand(i)));\n"
2226 << " return CodeGenMap[N] = \n"
2227 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
2229 << " case ISD::CopyFromReg: {\n"
2230 << " SDOperand Chain = Select(N.getOperand(0));\n"
2231 << " if (Chain == N.getOperand(0)) return N; // No change\n"
2232 << " SDOperand New = CurDAG->getCopyFromReg(Chain,\n"
2233 << " cast<RegisterSDNode>(N.getOperand(1))->getReg(),\n"
2234 << " N.Val->getValueType(0));\n"
2235 << " return New.getValue(N.ResNo);\n"
2237 << " case ISD::CopyToReg: {\n"
2238 << " SDOperand Chain = Select(N.getOperand(0));\n"
2239 << " SDOperand Reg = N.getOperand(1);\n"
2240 << " SDOperand Val = Select(N.getOperand(2));\n"
2241 << " return CodeGenMap[N] = \n"
2242 << " CurDAG->getNode(ISD::CopyToReg, MVT::Other,\n"
2243 << " Chain, Reg, Val);\n"
2246 // Group the patterns by their top-level opcodes.
2247 std::map<Record*, std::vector<PatternToMatch*>,
2248 CompareByRecordName> PatternsByOpcode;
2249 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2250 TreePatternNode *Node = PatternsToMatch[i].first;
2251 if (!Node->isLeaf()) {
2252 PatternsByOpcode[Node->getOperator()].push_back(&PatternsToMatch[i]);
2254 const ComplexPattern *CP;
2256 dynamic_cast<IntInit*>(Node->getLeafValue())) {
2257 PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
2258 } else if ((CP = NodeGetComplexPattern(Node, *this))) {
2259 std::vector<Record*> OpNodes = CP->getMatchingNodes();
2260 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
2261 PatternsByOpcode[OpNodes[j]].insert(PatternsByOpcode[OpNodes[j]].begin(),
2262 &PatternsToMatch[i]);
2265 std::cerr << "Unrecognized opcode '";
2267 std::cerr << "' on tree pattern '";
2268 std::cerr << PatternsToMatch[i].second->getOperator()->getName();
2269 std::cerr << "'!\n";
2275 // Loop over all of the case statements.
2276 for (std::map<Record*, std::vector<PatternToMatch*>,
2277 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
2278 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
2279 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
2280 std::vector<PatternToMatch*> &Patterns = PBOI->second;
2282 OS << " case " << OpcodeInfo.getEnumName() << ":\n";
2284 // We want to emit all of the matching code now. However, we want to emit
2285 // the matches in order of minimal cost. Sort the patterns so the least
2286 // cost one is at the start.
2287 std::stable_sort(Patterns.begin(), Patterns.end(),
2288 PatternSortingPredicate(*this));
2290 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
2291 EmitCodeForPattern(*Patterns[i], OS);
2292 OS << " break;\n\n";
2296 OS << " } // end of big switch.\n\n"
2297 << " std::cerr << \"Cannot yet select: \";\n"
2298 << " N.Val->dump();\n"
2299 << " std::cerr << '\\n';\n"
2304 void DAGISelEmitter::run(std::ostream &OS) {
2305 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
2308 OS << "// *** NOTE: This file is #included into the middle of the target\n"
2309 << "// *** instruction selector class. These functions are really "
2312 OS << "// Instance var to keep track of multiply used nodes that have \n"
2313 << "// already been selected.\n"
2314 << "std::map<SDOperand, SDOperand> CodeGenMap;\n";
2317 ParseNodeTransforms(OS);
2318 ParseComplexPatterns();
2319 ParsePatternFragments(OS);
2320 ParseInstructions();
2323 // Generate variants. For example, commutative patterns can match
2324 // multiple ways. Add them to PatternsToMatch as well.
2328 DEBUG(std::cerr << "\n\nALL PATTERNS TO MATCH:\n\n";
2329 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2330 std::cerr << "PATTERN: "; PatternsToMatch[i].first->dump();
2331 std::cerr << "\nRESULT: ";PatternsToMatch[i].second->dump();
2335 // At this point, we have full information about the 'Patterns' we need to
2336 // parse, both implicitly from instructions as well as from explicit pattern
2337 // definitions. Emit the resultant instruction selector.
2338 EmitInstructionSelector(OS);
2340 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
2341 E = PatternFragments.end(); I != E; ++I)
2343 PatternFragments.clear();
2345 Instructions.clear();