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]);
38 static std::vector<unsigned char>
39 FilterEVTs(const std::vector<unsigned char> &InVTs, T Filter) {
40 std::vector<unsigned char> Result;
41 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
42 if (Filter((MVT::ValueType)InVTs[i]))
43 Result.push_back(InVTs[i]);
47 static std::vector<unsigned char>
48 ConvertVTs(const std::vector<MVT::ValueType> &InVTs) {
49 std::vector<unsigned char> Result;
50 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
51 Result.push_back(InVTs[i]);
55 static bool LHSIsSubsetOfRHS(const std::vector<unsigned char> &LHS,
56 const std::vector<unsigned char> &RHS) {
57 if (LHS.size() > RHS.size()) return false;
58 for (unsigned i = 0, e = LHS.size(); i != e; ++i)
59 if (std::find(RHS.begin(), RHS.end(), LHS[i]) == RHS.end())
64 /// isExtIntegerVT - Return true if the specified extended value type vector
65 /// contains isInt or an integer value type.
66 static bool isExtIntegerInVTs(const std::vector<unsigned char> &EVTs) {
67 assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
68 return EVTs[0] == MVT::isInt || !(FilterEVTs(EVTs, MVT::isInteger).empty());
71 /// isExtFloatingPointVT - Return true if the specified extended value type
72 /// vector contains isFP or a FP value type.
73 static bool isExtFloatingPointInVTs(const std::vector<unsigned char> &EVTs) {
74 assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
75 return EVTs[0] == MVT::isFP ||
76 !(FilterEVTs(EVTs, MVT::isFloatingPoint).empty());
79 //===----------------------------------------------------------------------===//
80 // SDTypeConstraint implementation
83 SDTypeConstraint::SDTypeConstraint(Record *R) {
84 OperandNo = R->getValueAsInt("OperandNum");
86 if (R->isSubClassOf("SDTCisVT")) {
87 ConstraintType = SDTCisVT;
88 x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT"));
89 } else if (R->isSubClassOf("SDTCisPtrTy")) {
90 ConstraintType = SDTCisPtrTy;
91 } else if (R->isSubClassOf("SDTCisInt")) {
92 ConstraintType = SDTCisInt;
93 } else if (R->isSubClassOf("SDTCisFP")) {
94 ConstraintType = SDTCisFP;
95 } else if (R->isSubClassOf("SDTCisSameAs")) {
96 ConstraintType = SDTCisSameAs;
97 x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
98 } else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
99 ConstraintType = SDTCisVTSmallerThanOp;
100 x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
101 R->getValueAsInt("OtherOperandNum");
102 } else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) {
103 ConstraintType = SDTCisOpSmallerThanOp;
104 x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
105 R->getValueAsInt("BigOperandNum");
106 } else if (R->isSubClassOf("SDTCisIntVectorOfSameSize")) {
107 ConstraintType = SDTCisIntVectorOfSameSize;
108 x.SDTCisIntVectorOfSameSize_Info.OtherOperandNum =
109 R->getValueAsInt("OtherOpNum");
111 std::cerr << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
116 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
117 /// N, which has NumResults results.
118 TreePatternNode *SDTypeConstraint::getOperandNum(unsigned OpNo,
120 unsigned NumResults) const {
121 assert(NumResults <= 1 &&
122 "We only work with nodes with zero or one result so far!");
124 if (OpNo >= (NumResults + N->getNumChildren())) {
125 std::cerr << "Invalid operand number " << OpNo << " ";
131 if (OpNo < NumResults)
132 return N; // FIXME: need value #
134 return N->getChild(OpNo-NumResults);
137 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
138 /// constraint to the nodes operands. This returns true if it makes a
139 /// change, false otherwise. If a type contradiction is found, throw an
141 bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
142 const SDNodeInfo &NodeInfo,
143 TreePattern &TP) const {
144 unsigned NumResults = NodeInfo.getNumResults();
145 assert(NumResults <= 1 &&
146 "We only work with nodes with zero or one result so far!");
148 // Check that the number of operands is sane. Negative operands -> varargs.
149 if (NodeInfo.getNumOperands() >= 0) {
150 if (N->getNumChildren() != (unsigned)NodeInfo.getNumOperands())
151 TP.error(N->getOperator()->getName() + " node requires exactly " +
152 itostr(NodeInfo.getNumOperands()) + " operands!");
155 const CodeGenTarget &CGT = TP.getDAGISelEmitter().getTargetInfo();
157 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NumResults);
159 switch (ConstraintType) {
160 default: assert(0 && "Unknown constraint type!");
162 // Operand must be a particular type.
163 return NodeToApply->UpdateNodeType(x.SDTCisVT_Info.VT, TP);
165 // Operand must be same as target pointer type.
166 return NodeToApply->UpdateNodeType(MVT::iPTR, TP);
169 // If there is only one integer type supported, this must be it.
170 std::vector<MVT::ValueType> IntVTs =
171 FilterVTs(CGT.getLegalValueTypes(), MVT::isInteger);
173 // If we found exactly one supported integer type, apply it.
174 if (IntVTs.size() == 1)
175 return NodeToApply->UpdateNodeType(IntVTs[0], TP);
176 return NodeToApply->UpdateNodeType(MVT::isInt, TP);
179 // If there is only one FP type supported, this must be it.
180 std::vector<MVT::ValueType> FPVTs =
181 FilterVTs(CGT.getLegalValueTypes(), MVT::isFloatingPoint);
183 // If we found exactly one supported FP type, apply it.
184 if (FPVTs.size() == 1)
185 return NodeToApply->UpdateNodeType(FPVTs[0], TP);
186 return NodeToApply->UpdateNodeType(MVT::isFP, TP);
189 TreePatternNode *OtherNode =
190 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NumResults);
191 return NodeToApply->UpdateNodeType(OtherNode->getExtTypes(), TP) |
192 OtherNode->UpdateNodeType(NodeToApply->getExtTypes(), TP);
194 case SDTCisVTSmallerThanOp: {
195 // The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
196 // have an integer type that is smaller than the VT.
197 if (!NodeToApply->isLeaf() ||
198 !dynamic_cast<DefInit*>(NodeToApply->getLeafValue()) ||
199 !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
200 ->isSubClassOf("ValueType"))
201 TP.error(N->getOperator()->getName() + " expects a VT operand!");
203 getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef());
204 if (!MVT::isInteger(VT))
205 TP.error(N->getOperator()->getName() + " VT operand must be integer!");
207 TreePatternNode *OtherNode =
208 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N,NumResults);
210 // It must be integer.
211 bool MadeChange = false;
212 MadeChange |= OtherNode->UpdateNodeType(MVT::isInt, TP);
214 // This code only handles nodes that have one type set. Assert here so
215 // that we can change this if we ever need to deal with multiple value
216 // types at this point.
217 assert(OtherNode->getExtTypes().size() == 1 && "Node has too many types!");
218 if (OtherNode->hasTypeSet() && OtherNode->getTypeNum(0) <= VT)
219 OtherNode->UpdateNodeType(MVT::Other, TP); // Throw an error.
222 case SDTCisOpSmallerThanOp: {
223 TreePatternNode *BigOperand =
224 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NumResults);
226 // Both operands must be integer or FP, but we don't care which.
227 bool MadeChange = false;
229 // This code does not currently handle nodes which have multiple types,
230 // where some types are integer, and some are fp. Assert that this is not
232 assert(!(isExtIntegerInVTs(NodeToApply->getExtTypes()) &&
233 isExtFloatingPointInVTs(NodeToApply->getExtTypes())) &&
234 !(isExtIntegerInVTs(BigOperand->getExtTypes()) &&
235 isExtFloatingPointInVTs(BigOperand->getExtTypes())) &&
236 "SDTCisOpSmallerThanOp does not handle mixed int/fp types!");
237 if (isExtIntegerInVTs(NodeToApply->getExtTypes()))
238 MadeChange |= BigOperand->UpdateNodeType(MVT::isInt, TP);
239 else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes()))
240 MadeChange |= BigOperand->UpdateNodeType(MVT::isFP, TP);
241 if (isExtIntegerInVTs(BigOperand->getExtTypes()))
242 MadeChange |= NodeToApply->UpdateNodeType(MVT::isInt, TP);
243 else if (isExtFloatingPointInVTs(BigOperand->getExtTypes()))
244 MadeChange |= NodeToApply->UpdateNodeType(MVT::isFP, TP);
246 std::vector<MVT::ValueType> VTs = CGT.getLegalValueTypes();
248 if (isExtIntegerInVTs(NodeToApply->getExtTypes())) {
249 VTs = FilterVTs(VTs, MVT::isInteger);
250 } else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes())) {
251 VTs = FilterVTs(VTs, MVT::isFloatingPoint);
256 switch (VTs.size()) {
257 default: // Too many VT's to pick from.
258 case 0: break; // No info yet.
260 // Only one VT of this flavor. Cannot ever satisify the constraints.
261 return NodeToApply->UpdateNodeType(MVT::Other, TP); // throw
263 // If we have exactly two possible types, the little operand must be the
264 // small one, the big operand should be the big one. Common with
265 // float/double for example.
266 assert(VTs[0] < VTs[1] && "Should be sorted!");
267 MadeChange |= NodeToApply->UpdateNodeType(VTs[0], TP);
268 MadeChange |= BigOperand->UpdateNodeType(VTs[1], TP);
273 case SDTCisIntVectorOfSameSize: {
274 TreePatternNode *OtherOperand =
275 getOperandNum(x.SDTCisIntVectorOfSameSize_Info.OtherOperandNum,
277 if (OtherOperand->hasTypeSet()) {
278 if (!MVT::isVector(OtherOperand->getTypeNum(0)))
279 TP.error(N->getOperator()->getName() + " VT operand must be a vector!");
280 MVT::ValueType IVT = OtherOperand->getTypeNum(0);
281 IVT = MVT::getIntVectorWithNumElements(MVT::getVectorNumElements(IVT));
282 return NodeToApply->UpdateNodeType(IVT, TP);
291 //===----------------------------------------------------------------------===//
292 // SDNodeInfo implementation
294 SDNodeInfo::SDNodeInfo(Record *R) : Def(R) {
295 EnumName = R->getValueAsString("Opcode");
296 SDClassName = R->getValueAsString("SDClass");
297 Record *TypeProfile = R->getValueAsDef("TypeProfile");
298 NumResults = TypeProfile->getValueAsInt("NumResults");
299 NumOperands = TypeProfile->getValueAsInt("NumOperands");
301 // Parse the properties.
303 std::vector<Record*> PropList = R->getValueAsListOfDefs("Properties");
304 for (unsigned i = 0, e = PropList.size(); i != e; ++i) {
305 if (PropList[i]->getName() == "SDNPCommutative") {
306 Properties |= 1 << SDNPCommutative;
307 } else if (PropList[i]->getName() == "SDNPAssociative") {
308 Properties |= 1 << SDNPAssociative;
309 } else if (PropList[i]->getName() == "SDNPHasChain") {
310 Properties |= 1 << SDNPHasChain;
311 } else if (PropList[i]->getName() == "SDNPOutFlag") {
312 Properties |= 1 << SDNPOutFlag;
313 } else if (PropList[i]->getName() == "SDNPInFlag") {
314 Properties |= 1 << SDNPInFlag;
315 } else if (PropList[i]->getName() == "SDNPOptInFlag") {
316 Properties |= 1 << SDNPOptInFlag;
318 std::cerr << "Unknown SD Node property '" << PropList[i]->getName()
319 << "' on node '" << R->getName() << "'!\n";
325 // Parse the type constraints.
326 std::vector<Record*> ConstraintList =
327 TypeProfile->getValueAsListOfDefs("Constraints");
328 TypeConstraints.assign(ConstraintList.begin(), ConstraintList.end());
331 //===----------------------------------------------------------------------===//
332 // TreePatternNode implementation
335 TreePatternNode::~TreePatternNode() {
336 #if 0 // FIXME: implement refcounted tree nodes!
337 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
342 /// UpdateNodeType - Set the node type of N to VT if VT contains
343 /// information. If N already contains a conflicting type, then throw an
344 /// exception. This returns true if any information was updated.
346 bool TreePatternNode::UpdateNodeType(const std::vector<unsigned char> &ExtVTs,
348 assert(!ExtVTs.empty() && "Cannot update node type with empty type vector!");
350 if (ExtVTs[0] == MVT::isUnknown || LHSIsSubsetOfRHS(getExtTypes(), ExtVTs))
352 if (isTypeCompletelyUnknown() || LHSIsSubsetOfRHS(ExtVTs, getExtTypes())) {
357 if (getExtTypeNum(0) == MVT::iPTR) {
358 if (ExtVTs[0] == MVT::iPTR || ExtVTs[0] == MVT::isInt)
360 if (isExtIntegerInVTs(ExtVTs)) {
361 std::vector<unsigned char> FVTs = FilterEVTs(ExtVTs, MVT::isInteger);
369 if (ExtVTs[0] == MVT::isInt && isExtIntegerInVTs(getExtTypes())) {
370 assert(hasTypeSet() && "should be handled above!");
371 std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), MVT::isInteger);
372 if (getExtTypes() == FVTs)
377 if (ExtVTs[0] == MVT::iPTR && isExtIntegerInVTs(getExtTypes())) {
378 //assert(hasTypeSet() && "should be handled above!");
379 std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), MVT::isInteger);
380 if (getExtTypes() == FVTs)
387 if (ExtVTs[0] == MVT::isFP && isExtFloatingPointInVTs(getExtTypes())) {
388 assert(hasTypeSet() && "should be handled above!");
389 std::vector<unsigned char> FVTs =
390 FilterEVTs(getExtTypes(), MVT::isFloatingPoint);
391 if (getExtTypes() == FVTs)
397 // If we know this is an int or fp type, and we are told it is a specific one,
400 // Similarly, we should probably set the type here to the intersection of
401 // {isInt|isFP} and ExtVTs
402 if ((getExtTypeNum(0) == MVT::isInt && isExtIntegerInVTs(ExtVTs)) ||
403 (getExtTypeNum(0) == MVT::isFP && isExtFloatingPointInVTs(ExtVTs))) {
407 if (getExtTypeNum(0) == MVT::isInt && ExtVTs[0] == MVT::iPTR) {
415 TP.error("Type inference contradiction found in node!");
417 TP.error("Type inference contradiction found in node " +
418 getOperator()->getName() + "!");
420 return true; // unreachable
424 void TreePatternNode::print(std::ostream &OS) const {
426 OS << *getLeafValue();
428 OS << "(" << getOperator()->getName();
431 // FIXME: At some point we should handle printing all the value types for
432 // nodes that are multiply typed.
433 switch (getExtTypeNum(0)) {
434 case MVT::Other: OS << ":Other"; break;
435 case MVT::isInt: OS << ":isInt"; break;
436 case MVT::isFP : OS << ":isFP"; break;
437 case MVT::isUnknown: ; /*OS << ":?";*/ break;
438 case MVT::iPTR: OS << ":iPTR"; break;
440 std::string VTName = llvm::getName(getTypeNum(0));
441 // Strip off MVT:: prefix if present.
442 if (VTName.substr(0,5) == "MVT::")
443 VTName = VTName.substr(5);
450 if (getNumChildren() != 0) {
452 getChild(0)->print(OS);
453 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
455 getChild(i)->print(OS);
461 if (!PredicateFn.empty())
462 OS << "<<P:" << PredicateFn << ">>";
464 OS << "<<X:" << TransformFn->getName() << ">>";
465 if (!getName().empty())
466 OS << ":$" << getName();
469 void TreePatternNode::dump() const {
473 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
474 /// the specified node. For this comparison, all of the state of the node
475 /// is considered, except for the assigned name. Nodes with differing names
476 /// that are otherwise identical are considered isomorphic.
477 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N) const {
478 if (N == this) return true;
479 if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
480 getPredicateFn() != N->getPredicateFn() ||
481 getTransformFn() != N->getTransformFn())
485 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue()))
486 if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue()))
487 return DI->getDef() == NDI->getDef();
488 return getLeafValue() == N->getLeafValue();
491 if (N->getOperator() != getOperator() ||
492 N->getNumChildren() != getNumChildren()) return false;
493 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
494 if (!getChild(i)->isIsomorphicTo(N->getChild(i)))
499 /// clone - Make a copy of this tree and all of its children.
501 TreePatternNode *TreePatternNode::clone() const {
502 TreePatternNode *New;
504 New = new TreePatternNode(getLeafValue());
506 std::vector<TreePatternNode*> CChildren;
507 CChildren.reserve(Children.size());
508 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
509 CChildren.push_back(getChild(i)->clone());
510 New = new TreePatternNode(getOperator(), CChildren);
512 New->setName(getName());
513 New->setTypes(getExtTypes());
514 New->setPredicateFn(getPredicateFn());
515 New->setTransformFn(getTransformFn());
519 /// SubstituteFormalArguments - Replace the formal arguments in this tree
520 /// with actual values specified by ArgMap.
521 void TreePatternNode::
522 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
523 if (isLeaf()) return;
525 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
526 TreePatternNode *Child = getChild(i);
527 if (Child->isLeaf()) {
528 Init *Val = Child->getLeafValue();
529 if (dynamic_cast<DefInit*>(Val) &&
530 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
531 // We found a use of a formal argument, replace it with its value.
532 Child = ArgMap[Child->getName()];
533 assert(Child && "Couldn't find formal argument!");
537 getChild(i)->SubstituteFormalArguments(ArgMap);
543 /// InlinePatternFragments - If this pattern refers to any pattern
544 /// fragments, inline them into place, giving us a pattern without any
545 /// PatFrag references.
546 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
547 if (isLeaf()) return this; // nothing to do.
548 Record *Op = getOperator();
550 if (!Op->isSubClassOf("PatFrag")) {
551 // Just recursively inline children nodes.
552 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
553 setChild(i, getChild(i)->InlinePatternFragments(TP));
557 // Otherwise, we found a reference to a fragment. First, look up its
558 // TreePattern record.
559 TreePattern *Frag = TP.getDAGISelEmitter().getPatternFragment(Op);
561 // Verify that we are passing the right number of operands.
562 if (Frag->getNumArgs() != Children.size())
563 TP.error("'" + Op->getName() + "' fragment requires " +
564 utostr(Frag->getNumArgs()) + " operands!");
566 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
568 // Resolve formal arguments to their actual value.
569 if (Frag->getNumArgs()) {
570 // Compute the map of formal to actual arguments.
571 std::map<std::string, TreePatternNode*> ArgMap;
572 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
573 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
575 FragTree->SubstituteFormalArguments(ArgMap);
578 FragTree->setName(getName());
579 FragTree->UpdateNodeType(getExtTypes(), TP);
581 // Get a new copy of this fragment to stitch into here.
582 //delete this; // FIXME: implement refcounting!
586 /// getImplicitType - Check to see if the specified record has an implicit
587 /// type which should be applied to it. This infer the type of register
588 /// references from the register file information, for example.
590 static std::vector<unsigned char> getImplicitType(Record *R, bool NotRegisters,
592 // Some common return values
593 std::vector<unsigned char> Unknown(1, MVT::isUnknown);
594 std::vector<unsigned char> Other(1, MVT::Other);
596 // Check to see if this is a register or a register class...
597 if (R->isSubClassOf("RegisterClass")) {
600 const CodeGenRegisterClass &RC =
601 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(R);
602 return ConvertVTs(RC.getValueTypes());
603 } else if (R->isSubClassOf("PatFrag")) {
604 // Pattern fragment types will be resolved when they are inlined.
606 } else if (R->isSubClassOf("Register")) {
609 const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
610 return T.getRegisterVTs(R);
611 } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
612 // Using a VTSDNode or CondCodeSDNode.
614 } else if (R->isSubClassOf("ComplexPattern")) {
617 std::vector<unsigned char>
618 ComplexPat(1, TP.getDAGISelEmitter().getComplexPattern(R).getValueType());
620 } else if (R->getName() == "node" || R->getName() == "srcvalue") {
625 TP.error("Unknown node flavor used in pattern: " + R->getName());
629 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
630 /// this node and its children in the tree. This returns true if it makes a
631 /// change, false otherwise. If a type contradiction is found, throw an
633 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
634 DAGISelEmitter &ISE = TP.getDAGISelEmitter();
636 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
637 // If it's a regclass or something else known, include the type.
638 return UpdateNodeType(getImplicitType(DI->getDef(), NotRegisters, TP),TP);
639 } else if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
640 // Int inits are always integers. :)
641 bool MadeChange = UpdateNodeType(MVT::isInt, TP);
644 // At some point, it may make sense for this tree pattern to have
645 // multiple types. Assert here that it does not, so we revisit this
646 // code when appropriate.
647 assert(getExtTypes().size() >= 1 && "TreePattern doesn't have a type!");
648 MVT::ValueType VT = getTypeNum(0);
649 for (unsigned i = 1, e = getExtTypes().size(); i != e; ++i)
650 assert(getTypeNum(i) == VT && "TreePattern has too many types!");
653 if (VT != MVT::iPTR) {
654 unsigned Size = MVT::getSizeInBits(VT);
655 // Make sure that the value is representable for this type.
657 int Val = (II->getValue() << (32-Size)) >> (32-Size);
658 if (Val != II->getValue())
659 TP.error("Sign-extended integer value '" + itostr(II->getValue())+
660 "' is out of range for type '" +
661 getEnumName(getTypeNum(0)) + "'!");
671 // special handling for set, which isn't really an SDNode.
672 if (getOperator()->getName() == "set") {
673 assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!");
674 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
675 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
677 // Types of operands must match.
678 MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtTypes(), TP);
679 MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtTypes(), TP);
680 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
682 } else if (getOperator() == ISE.get_intrinsic_void_sdnode() ||
683 getOperator() == ISE.get_intrinsic_w_chain_sdnode() ||
684 getOperator() == ISE.get_intrinsic_wo_chain_sdnode()) {
686 dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
687 const CodeGenIntrinsic &Int = ISE.getIntrinsicInfo(IID);
688 bool MadeChange = false;
690 // Apply the result type to the node.
691 MadeChange = UpdateNodeType(Int.ArgVTs[0], TP);
693 if (getNumChildren() != Int.ArgVTs.size())
694 TP.error("Intrinsic '" + Int.Name + "' expects " +
695 utostr(Int.ArgVTs.size()-1) + " operands, not " +
696 utostr(getNumChildren()-1) + " operands!");
698 // Apply type info to the intrinsic ID.
699 MadeChange |= getChild(0)->UpdateNodeType(MVT::iPTR, TP);
701 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
702 MVT::ValueType OpVT = Int.ArgVTs[i];
703 MadeChange |= getChild(i)->UpdateNodeType(OpVT, TP);
704 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
707 } else if (getOperator()->isSubClassOf("SDNode")) {
708 const SDNodeInfo &NI = ISE.getSDNodeInfo(getOperator());
710 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
711 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
712 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
713 // Branch, etc. do not produce results and top-level forms in instr pattern
714 // must have void types.
715 if (NI.getNumResults() == 0)
716 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
718 // If this is a vector_shuffle operation, apply types to the build_vector
719 // operation. The types of the integers don't matter, but this ensures they
720 // won't get checked.
721 if (getOperator()->getName() == "vector_shuffle" &&
722 getChild(2)->getOperator()->getName() == "build_vector") {
723 TreePatternNode *BV = getChild(2);
724 const std::vector<MVT::ValueType> &LegalVTs
725 = ISE.getTargetInfo().getLegalValueTypes();
726 MVT::ValueType LegalIntVT = MVT::Other;
727 for (unsigned i = 0, e = LegalVTs.size(); i != e; ++i)
728 if (MVT::isInteger(LegalVTs[i]) && !MVT::isVector(LegalVTs[i])) {
729 LegalIntVT = LegalVTs[i];
732 assert(LegalIntVT != MVT::Other && "No legal integer VT?");
734 for (unsigned i = 0, e = BV->getNumChildren(); i != e; ++i)
735 MadeChange |= BV->getChild(i)->UpdateNodeType(LegalIntVT, TP);
738 } else if (getOperator()->isSubClassOf("Instruction")) {
739 const DAGInstruction &Inst = ISE.getInstruction(getOperator());
740 bool MadeChange = false;
741 unsigned NumResults = Inst.getNumResults();
743 assert(NumResults <= 1 &&
744 "Only supports zero or one result instrs!");
746 CodeGenInstruction &InstInfo =
747 ISE.getTargetInfo().getInstruction(getOperator()->getName());
748 // Apply the result type to the node
749 if (NumResults == 0 || InstInfo.noResults) { // FIXME: temporary hack...
750 MadeChange = UpdateNodeType(MVT::isVoid, TP);
752 Record *ResultNode = Inst.getResult(0);
753 assert(ResultNode->isSubClassOf("RegisterClass") &&
754 "Operands should be register classes!");
756 const CodeGenRegisterClass &RC =
757 ISE.getTargetInfo().getRegisterClass(ResultNode);
758 MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
761 if (getNumChildren() != Inst.getNumOperands())
762 TP.error("Instruction '" + getOperator()->getName() + " expects " +
763 utostr(Inst.getNumOperands()) + " operands, not " +
764 utostr(getNumChildren()) + " operands!");
765 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
766 Record *OperandNode = Inst.getOperand(i);
768 if (OperandNode->isSubClassOf("RegisterClass")) {
769 const CodeGenRegisterClass &RC =
770 ISE.getTargetInfo().getRegisterClass(OperandNode);
771 //VT = RC.getValueTypeNum(0);
772 MadeChange |=getChild(i)->UpdateNodeType(ConvertVTs(RC.getValueTypes()),
774 } else if (OperandNode->isSubClassOf("Operand")) {
775 VT = getValueType(OperandNode->getValueAsDef("Type"));
776 MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
778 assert(0 && "Unknown operand type!");
781 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
785 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
787 // Node transforms always take one operand.
788 if (getNumChildren() != 1)
789 TP.error("Node transform '" + getOperator()->getName() +
790 "' requires one operand!");
792 // If either the output or input of the xform does not have exact
793 // type info. We assume they must be the same. Otherwise, it is perfectly
794 // legal to transform from one type to a completely different type.
795 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
796 bool MadeChange = UpdateNodeType(getChild(0)->getExtTypes(), TP);
797 MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), TP);
804 /// canPatternMatch - If it is impossible for this pattern to match on this
805 /// target, fill in Reason and return false. Otherwise, return true. This is
806 /// used as a santity check for .td files (to prevent people from writing stuff
807 /// that can never possibly work), and to prevent the pattern permuter from
808 /// generating stuff that is useless.
809 bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){
810 if (isLeaf()) return true;
812 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
813 if (!getChild(i)->canPatternMatch(Reason, ISE))
816 // If this is an intrinsic, handle cases that would make it not match. For
817 // example, if an operand is required to be an immediate.
818 if (getOperator()->isSubClassOf("Intrinsic")) {
823 // If this node is a commutative operator, check that the LHS isn't an
825 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
826 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
827 // Scan all of the operands of the node and make sure that only the last one
828 // is a constant node.
829 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i)
830 if (!getChild(i)->isLeaf() &&
831 getChild(i)->getOperator()->getName() == "imm") {
832 Reason = "Immediate value must be on the RHS of commutative operators!";
840 //===----------------------------------------------------------------------===//
841 // TreePattern implementation
844 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
845 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
846 isInputPattern = isInput;
847 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
848 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
851 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
852 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
853 isInputPattern = isInput;
854 Trees.push_back(ParseTreePattern(Pat));
857 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
858 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
859 isInputPattern = isInput;
860 Trees.push_back(Pat);
865 void TreePattern::error(const std::string &Msg) const {
867 throw "In " + TheRecord->getName() + ": " + Msg;
870 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
871 DefInit *OpDef = dynamic_cast<DefInit*>(Dag->getOperator());
872 if (!OpDef) error("Pattern has unexpected operator type!");
873 Record *Operator = OpDef->getDef();
875 if (Operator->isSubClassOf("ValueType")) {
876 // If the operator is a ValueType, then this must be "type cast" of a leaf
878 if (Dag->getNumArgs() != 1)
879 error("Type cast only takes one operand!");
881 Init *Arg = Dag->getArg(0);
882 TreePatternNode *New;
883 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
884 Record *R = DI->getDef();
885 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
886 Dag->setArg(0, new DagInit(DI,
887 std::vector<std::pair<Init*, std::string> >()));
888 return ParseTreePattern(Dag);
890 New = new TreePatternNode(DI);
891 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
892 New = ParseTreePattern(DI);
893 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
894 New = new TreePatternNode(II);
895 if (!Dag->getArgName(0).empty())
896 error("Constant int argument should not have a name!");
897 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
898 // Turn this into an IntInit.
899 Init *II = BI->convertInitializerTo(new IntRecTy());
900 if (II == 0 || !dynamic_cast<IntInit*>(II))
901 error("Bits value must be constants!");
903 New = new TreePatternNode(dynamic_cast<IntInit*>(II));
904 if (!Dag->getArgName(0).empty())
905 error("Constant int argument should not have a name!");
908 error("Unknown leaf value for tree pattern!");
912 // Apply the type cast.
913 New->UpdateNodeType(getValueType(Operator), *this);
914 New->setName(Dag->getArgName(0));
918 // Verify that this is something that makes sense for an operator.
919 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
920 !Operator->isSubClassOf("Instruction") &&
921 !Operator->isSubClassOf("SDNodeXForm") &&
922 !Operator->isSubClassOf("Intrinsic") &&
923 Operator->getName() != "set")
924 error("Unrecognized node '" + Operator->getName() + "'!");
926 // Check to see if this is something that is illegal in an input pattern.
927 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
928 Operator->isSubClassOf("SDNodeXForm")))
929 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
931 std::vector<TreePatternNode*> Children;
933 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
934 Init *Arg = Dag->getArg(i);
935 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
936 Children.push_back(ParseTreePattern(DI));
937 if (Children.back()->getName().empty())
938 Children.back()->setName(Dag->getArgName(i));
939 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
940 Record *R = DefI->getDef();
941 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
942 // TreePatternNode if its own.
943 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
944 Dag->setArg(i, new DagInit(DefI,
945 std::vector<std::pair<Init*, std::string> >()));
946 --i; // Revisit this node...
948 TreePatternNode *Node = new TreePatternNode(DefI);
949 Node->setName(Dag->getArgName(i));
950 Children.push_back(Node);
953 if (R->getName() == "node") {
954 if (Dag->getArgName(i).empty())
955 error("'node' argument requires a name to match with operand list");
956 Args.push_back(Dag->getArgName(i));
959 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
960 TreePatternNode *Node = new TreePatternNode(II);
961 if (!Dag->getArgName(i).empty())
962 error("Constant int argument should not have a name!");
963 Children.push_back(Node);
964 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
965 // Turn this into an IntInit.
966 Init *II = BI->convertInitializerTo(new IntRecTy());
967 if (II == 0 || !dynamic_cast<IntInit*>(II))
968 error("Bits value must be constants!");
970 TreePatternNode *Node = new TreePatternNode(dynamic_cast<IntInit*>(II));
971 if (!Dag->getArgName(i).empty())
972 error("Constant int argument should not have a name!");
973 Children.push_back(Node);
978 error("Unknown leaf value for tree pattern!");
982 // If the operator is an intrinsic, then this is just syntactic sugar for for
983 // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
984 // convert the intrinsic name to a number.
985 if (Operator->isSubClassOf("Intrinsic")) {
986 const CodeGenIntrinsic &Int = getDAGISelEmitter().getIntrinsic(Operator);
987 unsigned IID = getDAGISelEmitter().getIntrinsicID(Operator)+1;
989 // If this intrinsic returns void, it must have side-effects and thus a
991 if (Int.ArgVTs[0] == MVT::isVoid) {
992 Operator = getDAGISelEmitter().get_intrinsic_void_sdnode();
993 } else if (Int.ModRef != CodeGenIntrinsic::NoMem) {
994 // Has side-effects, requires chain.
995 Operator = getDAGISelEmitter().get_intrinsic_w_chain_sdnode();
997 // Otherwise, no chain.
998 Operator = getDAGISelEmitter().get_intrinsic_wo_chain_sdnode();
1001 TreePatternNode *IIDNode = new TreePatternNode(new IntInit(IID));
1002 Children.insert(Children.begin(), IIDNode);
1005 return new TreePatternNode(Operator, Children);
1008 /// InferAllTypes - Infer/propagate as many types throughout the expression
1009 /// patterns as possible. Return true if all types are infered, false
1010 /// otherwise. Throw an exception if a type contradiction is found.
1011 bool TreePattern::InferAllTypes() {
1012 bool MadeChange = true;
1013 while (MadeChange) {
1015 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1016 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
1019 bool HasUnresolvedTypes = false;
1020 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1021 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
1022 return !HasUnresolvedTypes;
1025 void TreePattern::print(std::ostream &OS) const {
1026 OS << getRecord()->getName();
1027 if (!Args.empty()) {
1028 OS << "(" << Args[0];
1029 for (unsigned i = 1, e = Args.size(); i != e; ++i)
1030 OS << ", " << Args[i];
1035 if (Trees.size() > 1)
1037 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
1039 Trees[i]->print(OS);
1043 if (Trees.size() > 1)
1047 void TreePattern::dump() const { print(std::cerr); }
1051 //===----------------------------------------------------------------------===//
1052 // DAGISelEmitter implementation
1055 // Parse all of the SDNode definitions for the target, populating SDNodes.
1056 void DAGISelEmitter::ParseNodeInfo() {
1057 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
1058 while (!Nodes.empty()) {
1059 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
1063 // Get the buildin intrinsic nodes.
1064 intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
1065 intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
1066 intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
1069 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
1070 /// map, and emit them to the file as functions.
1071 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
1072 OS << "\n// Node transformations.\n";
1073 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
1074 while (!Xforms.empty()) {
1075 Record *XFormNode = Xforms.back();
1076 Record *SDNode = XFormNode->getValueAsDef("Opcode");
1077 std::string Code = XFormNode->getValueAsCode("XFormFunction");
1078 SDNodeXForms.insert(std::make_pair(XFormNode,
1079 std::make_pair(SDNode, Code)));
1081 if (!Code.empty()) {
1082 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
1083 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
1085 OS << "inline SDOperand Transform_" << XFormNode->getName()
1086 << "(SDNode *" << C2 << ") {\n";
1087 if (ClassName != "SDNode")
1088 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
1089 OS << Code << "\n}\n";
1096 void DAGISelEmitter::ParseComplexPatterns() {
1097 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
1098 while (!AMs.empty()) {
1099 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
1105 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
1106 /// file, building up the PatternFragments map. After we've collected them all,
1107 /// inline fragments together as necessary, so that there are no references left
1108 /// inside a pattern fragment to a pattern fragment.
1110 /// This also emits all of the predicate functions to the output file.
1112 void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) {
1113 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
1115 // First step, parse all of the fragments and emit predicate functions.
1116 OS << "\n// Predicate functions.\n";
1117 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1118 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
1119 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
1120 PatternFragments[Fragments[i]] = P;
1122 // Validate the argument list, converting it to map, to discard duplicates.
1123 std::vector<std::string> &Args = P->getArgList();
1124 std::set<std::string> OperandsMap(Args.begin(), Args.end());
1126 if (OperandsMap.count(""))
1127 P->error("Cannot have unnamed 'node' values in pattern fragment!");
1129 // Parse the operands list.
1130 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
1131 DefInit *OpsOp = dynamic_cast<DefInit*>(OpsList->getOperator());
1132 if (!OpsOp || OpsOp->getDef()->getName() != "ops")
1133 P->error("Operands list should start with '(ops ... '!");
1135 // Copy over the arguments.
1137 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
1138 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
1139 static_cast<DefInit*>(OpsList->getArg(j))->
1140 getDef()->getName() != "node")
1141 P->error("Operands list should all be 'node' values.");
1142 if (OpsList->getArgName(j).empty())
1143 P->error("Operands list should have names for each operand!");
1144 if (!OperandsMap.count(OpsList->getArgName(j)))
1145 P->error("'" + OpsList->getArgName(j) +
1146 "' does not occur in pattern or was multiply specified!");
1147 OperandsMap.erase(OpsList->getArgName(j));
1148 Args.push_back(OpsList->getArgName(j));
1151 if (!OperandsMap.empty())
1152 P->error("Operands list does not contain an entry for operand '" +
1153 *OperandsMap.begin() + "'!");
1155 // If there is a code init for this fragment, emit the predicate code and
1156 // keep track of the fact that this fragment uses it.
1157 std::string Code = Fragments[i]->getValueAsCode("Predicate");
1158 if (!Code.empty()) {
1159 assert(!P->getOnlyTree()->isLeaf() && "Can't be a leaf!");
1160 std::string ClassName =
1161 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
1162 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
1164 OS << "inline bool Predicate_" << Fragments[i]->getName()
1165 << "(SDNode *" << C2 << ") {\n";
1166 if (ClassName != "SDNode")
1167 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
1168 OS << Code << "\n}\n";
1169 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
1172 // If there is a node transformation corresponding to this, keep track of
1174 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
1175 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
1176 P->getOnlyTree()->setTransformFn(Transform);
1181 // Now that we've parsed all of the tree fragments, do a closure on them so
1182 // that there are not references to PatFrags left inside of them.
1183 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
1184 E = PatternFragments.end(); I != E; ++I) {
1185 TreePattern *ThePat = I->second;
1186 ThePat->InlinePatternFragments();
1188 // Infer as many types as possible. Don't worry about it if we don't infer
1189 // all of them, some may depend on the inputs of the pattern.
1191 ThePat->InferAllTypes();
1193 // If this pattern fragment is not supported by this target (no types can
1194 // satisfy its constraints), just ignore it. If the bogus pattern is
1195 // actually used by instructions, the type consistency error will be
1199 // If debugging, print out the pattern fragment result.
1200 DEBUG(ThePat->dump());
1204 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1205 /// instruction input. Return true if this is a real use.
1206 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1207 std::map<std::string, TreePatternNode*> &InstInputs,
1208 std::vector<Record*> &InstImpInputs) {
1209 // No name -> not interesting.
1210 if (Pat->getName().empty()) {
1211 if (Pat->isLeaf()) {
1212 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1213 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1214 I->error("Input " + DI->getDef()->getName() + " must be named!");
1215 else if (DI && DI->getDef()->isSubClassOf("Register"))
1216 InstImpInputs.push_back(DI->getDef());
1222 if (Pat->isLeaf()) {
1223 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1224 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1227 assert(Pat->getNumChildren() == 0 && "can't be a use with children!");
1228 Rec = Pat->getOperator();
1231 // SRCVALUE nodes are ignored.
1232 if (Rec->getName() == "srcvalue")
1235 TreePatternNode *&Slot = InstInputs[Pat->getName()];
1240 if (Slot->isLeaf()) {
1241 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1243 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1244 SlotRec = Slot->getOperator();
1247 // Ensure that the inputs agree if we've already seen this input.
1249 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1250 if (Slot->getExtTypes() != Pat->getExtTypes())
1251 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1256 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1257 /// part of "I", the instruction), computing the set of inputs and outputs of
1258 /// the pattern. Report errors if we see anything naughty.
1259 void DAGISelEmitter::
1260 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1261 std::map<std::string, TreePatternNode*> &InstInputs,
1262 std::map<std::string, TreePatternNode*>&InstResults,
1263 std::vector<Record*> &InstImpInputs,
1264 std::vector<Record*> &InstImpResults) {
1265 if (Pat->isLeaf()) {
1266 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1267 if (!isUse && Pat->getTransformFn())
1268 I->error("Cannot specify a transform function for a non-input value!");
1270 } else if (Pat->getOperator()->getName() != "set") {
1271 // If this is not a set, verify that the children nodes are not void typed,
1273 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1274 if (Pat->getChild(i)->getExtTypeNum(0) == MVT::isVoid)
1275 I->error("Cannot have void nodes inside of patterns!");
1276 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
1277 InstImpInputs, InstImpResults);
1280 // If this is a non-leaf node with no children, treat it basically as if
1281 // it were a leaf. This handles nodes like (imm).
1283 if (Pat->getNumChildren() == 0)
1284 isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1286 if (!isUse && Pat->getTransformFn())
1287 I->error("Cannot specify a transform function for a non-input value!");
1291 // Otherwise, this is a set, validate and collect instruction results.
1292 if (Pat->getNumChildren() == 0)
1293 I->error("set requires operands!");
1294 else if (Pat->getNumChildren() & 1)
1295 I->error("set requires an even number of operands");
1297 if (Pat->getTransformFn())
1298 I->error("Cannot specify a transform function on a set node!");
1300 // Check the set destinations.
1301 unsigned NumValues = Pat->getNumChildren()/2;
1302 for (unsigned i = 0; i != NumValues; ++i) {
1303 TreePatternNode *Dest = Pat->getChild(i);
1304 if (!Dest->isLeaf())
1305 I->error("set destination should be a register!");
1307 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1309 I->error("set destination should be a register!");
1311 if (Val->getDef()->isSubClassOf("RegisterClass")) {
1312 if (Dest->getName().empty())
1313 I->error("set destination must have a name!");
1314 if (InstResults.count(Dest->getName()))
1315 I->error("cannot set '" + Dest->getName() +"' multiple times");
1316 InstResults[Dest->getName()] = Dest;
1317 } else if (Val->getDef()->isSubClassOf("Register")) {
1318 InstImpResults.push_back(Val->getDef());
1320 I->error("set destination should be a register!");
1323 // Verify and collect info from the computation.
1324 FindPatternInputsAndOutputs(I, Pat->getChild(i+NumValues),
1325 InstInputs, InstResults,
1326 InstImpInputs, InstImpResults);
1330 /// ParseInstructions - Parse all of the instructions, inlining and resolving
1331 /// any fragments involved. This populates the Instructions list with fully
1332 /// resolved instructions.
1333 void DAGISelEmitter::ParseInstructions() {
1334 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1336 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1339 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1340 LI = Instrs[i]->getValueAsListInit("Pattern");
1342 // If there is no pattern, only collect minimal information about the
1343 // instruction for its operand list. We have to assume that there is one
1344 // result, as we have no detailed info.
1345 if (!LI || LI->getSize() == 0) {
1346 std::vector<Record*> Results;
1347 std::vector<Record*> Operands;
1349 CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1351 if (InstInfo.OperandList.size() != 0) {
1352 // FIXME: temporary hack...
1353 if (InstInfo.noResults) {
1354 // These produce no results
1355 for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
1356 Operands.push_back(InstInfo.OperandList[j].Rec);
1358 // Assume the first operand is the result.
1359 Results.push_back(InstInfo.OperandList[0].Rec);
1361 // The rest are inputs.
1362 for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
1363 Operands.push_back(InstInfo.OperandList[j].Rec);
1367 // Create and insert the instruction.
1368 std::vector<Record*> ImpResults;
1369 std::vector<Record*> ImpOperands;
1370 Instructions.insert(std::make_pair(Instrs[i],
1371 DAGInstruction(0, Results, Operands, ImpResults,
1373 continue; // no pattern.
1376 // Parse the instruction.
1377 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1378 // Inline pattern fragments into it.
1379 I->InlinePatternFragments();
1381 // Infer as many types as possible. If we cannot infer all of them, we can
1382 // never do anything with this instruction pattern: report it to the user.
1383 if (!I->InferAllTypes())
1384 I->error("Could not infer all types in pattern!");
1386 // InstInputs - Keep track of all of the inputs of the instruction, along
1387 // with the record they are declared as.
1388 std::map<std::string, TreePatternNode*> InstInputs;
1390 // InstResults - Keep track of all the virtual registers that are 'set'
1391 // in the instruction, including what reg class they are.
1392 std::map<std::string, TreePatternNode*> InstResults;
1394 std::vector<Record*> InstImpInputs;
1395 std::vector<Record*> InstImpResults;
1397 // Verify that the top-level forms in the instruction are of void type, and
1398 // fill in the InstResults map.
1399 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1400 TreePatternNode *Pat = I->getTree(j);
1401 if (Pat->getExtTypeNum(0) != MVT::isVoid)
1402 I->error("Top-level forms in instruction pattern should have"
1405 // Find inputs and outputs, and verify the structure of the uses/defs.
1406 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
1407 InstImpInputs, InstImpResults);
1410 // Now that we have inputs and outputs of the pattern, inspect the operands
1411 // list for the instruction. This determines the order that operands are
1412 // added to the machine instruction the node corresponds to.
1413 unsigned NumResults = InstResults.size();
1415 // Parse the operands list from the (ops) list, validating it.
1416 std::vector<std::string> &Args = I->getArgList();
1417 assert(Args.empty() && "Args list should still be empty here!");
1418 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1420 // Check that all of the results occur first in the list.
1421 std::vector<Record*> Results;
1422 TreePatternNode *Res0Node = NULL;
1423 for (unsigned i = 0; i != NumResults; ++i) {
1424 if (i == CGI.OperandList.size())
1425 I->error("'" + InstResults.begin()->first +
1426 "' set but does not appear in operand list!");
1427 const std::string &OpName = CGI.OperandList[i].Name;
1429 // Check that it exists in InstResults.
1430 TreePatternNode *RNode = InstResults[OpName];
1432 I->error("Operand $" + OpName + " does not exist in operand list!");
1436 Record *R = dynamic_cast<DefInit*>(RNode->getLeafValue())->getDef();
1438 I->error("Operand $" + OpName + " should be a set destination: all "
1439 "outputs must occur before inputs in operand list!");
1441 if (CGI.OperandList[i].Rec != R)
1442 I->error("Operand $" + OpName + " class mismatch!");
1444 // Remember the return type.
1445 Results.push_back(CGI.OperandList[i].Rec);
1447 // Okay, this one checks out.
1448 InstResults.erase(OpName);
1451 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
1452 // the copy while we're checking the inputs.
1453 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
1455 std::vector<TreePatternNode*> ResultNodeOperands;
1456 std::vector<Record*> Operands;
1457 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
1458 const std::string &OpName = CGI.OperandList[i].Name;
1460 I->error("Operand #" + utostr(i) + " in operands list has no name!");
1462 if (!InstInputsCheck.count(OpName))
1463 I->error("Operand $" + OpName +
1464 " does not appear in the instruction pattern");
1465 TreePatternNode *InVal = InstInputsCheck[OpName];
1466 InstInputsCheck.erase(OpName); // It occurred, remove from map.
1468 if (InVal->isLeaf() &&
1469 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
1470 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
1471 if (CGI.OperandList[i].Rec != InRec &&
1472 !InRec->isSubClassOf("ComplexPattern"))
1473 I->error("Operand $" + OpName + "'s register class disagrees"
1474 " between the operand and pattern");
1476 Operands.push_back(CGI.OperandList[i].Rec);
1478 // Construct the result for the dest-pattern operand list.
1479 TreePatternNode *OpNode = InVal->clone();
1481 // No predicate is useful on the result.
1482 OpNode->setPredicateFn("");
1484 // Promote the xform function to be an explicit node if set.
1485 if (Record *Xform = OpNode->getTransformFn()) {
1486 OpNode->setTransformFn(0);
1487 std::vector<TreePatternNode*> Children;
1488 Children.push_back(OpNode);
1489 OpNode = new TreePatternNode(Xform, Children);
1492 ResultNodeOperands.push_back(OpNode);
1495 if (!InstInputsCheck.empty())
1496 I->error("Input operand $" + InstInputsCheck.begin()->first +
1497 " occurs in pattern but not in operands list!");
1499 TreePatternNode *ResultPattern =
1500 new TreePatternNode(I->getRecord(), ResultNodeOperands);
1501 // Copy fully inferred output node type to instruction result pattern.
1503 ResultPattern->setTypes(Res0Node->getExtTypes());
1505 // Create and insert the instruction.
1506 DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
1507 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
1509 // Use a temporary tree pattern to infer all types and make sure that the
1510 // constructed result is correct. This depends on the instruction already
1511 // being inserted into the Instructions map.
1512 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
1513 Temp.InferAllTypes();
1515 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
1516 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
1521 // If we can, convert the instructions to be patterns that are matched!
1522 for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
1523 E = Instructions.end(); II != E; ++II) {
1524 DAGInstruction &TheInst = II->second;
1525 TreePattern *I = TheInst.getPattern();
1526 if (I == 0) continue; // No pattern.
1528 if (I->getNumTrees() != 1) {
1529 std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
1532 TreePatternNode *Pattern = I->getTree(0);
1533 TreePatternNode *SrcPattern;
1534 if (Pattern->getOperator()->getName() == "set") {
1535 if (Pattern->getNumChildren() != 2)
1536 continue; // Not a set of a single value (not handled so far)
1538 SrcPattern = Pattern->getChild(1)->clone();
1540 // Not a set (store or something?)
1541 SrcPattern = Pattern;
1545 if (!SrcPattern->canPatternMatch(Reason, *this))
1546 I->error("Instruction can never match: " + Reason);
1548 Record *Instr = II->first;
1549 TreePatternNode *DstPattern = TheInst.getResultPattern();
1551 push_back(PatternToMatch(Instr->getValueAsListInit("Predicates"),
1552 SrcPattern, DstPattern,
1553 Instr->getValueAsInt("AddedComplexity")));
1557 void DAGISelEmitter::ParsePatterns() {
1558 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
1560 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1561 DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
1562 TreePattern *Pattern = new TreePattern(Patterns[i], Tree, true, *this);
1564 // Inline pattern fragments into it.
1565 Pattern->InlinePatternFragments();
1567 ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
1568 if (LI->getSize() == 0) continue; // no pattern.
1570 // Parse the instruction.
1571 TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
1573 // Inline pattern fragments into it.
1574 Result->InlinePatternFragments();
1576 if (Result->getNumTrees() != 1)
1577 Result->error("Cannot handle instructions producing instructions "
1578 "with temporaries yet!");
1580 bool IterateInference;
1581 bool InferredAllPatternTypes, InferredAllResultTypes;
1583 // Infer as many types as possible. If we cannot infer all of them, we
1584 // can never do anything with this pattern: report it to the user.
1585 InferredAllPatternTypes = Pattern->InferAllTypes();
1587 // Infer as many types as possible. If we cannot infer all of them, we can
1588 // never do anything with this pattern: report it to the user.
1589 InferredAllResultTypes = Result->InferAllTypes();
1591 // Apply the type of the result to the source pattern. This helps us
1592 // resolve cases where the input type is known to be a pointer type (which
1593 // is considered resolved), but the result knows it needs to be 32- or
1594 // 64-bits. Infer the other way for good measure.
1595 IterateInference = Pattern->getOnlyTree()->
1596 UpdateNodeType(Result->getOnlyTree()->getExtTypes(), *Result);
1597 IterateInference |= Result->getOnlyTree()->
1598 UpdateNodeType(Pattern->getOnlyTree()->getExtTypes(), *Result);
1599 } while (IterateInference);
1601 // Verify that we inferred enough types that we can do something with the
1602 // pattern and result. If these fire the user has to add type casts.
1603 if (!InferredAllPatternTypes)
1604 Pattern->error("Could not infer all types in pattern!");
1605 if (!InferredAllResultTypes)
1606 Result->error("Could not infer all types in pattern result!");
1608 // Validate that the input pattern is correct.
1610 std::map<std::string, TreePatternNode*> InstInputs;
1611 std::map<std::string, TreePatternNode*> InstResults;
1612 std::vector<Record*> InstImpInputs;
1613 std::vector<Record*> InstImpResults;
1614 FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(),
1615 InstInputs, InstResults,
1616 InstImpInputs, InstImpResults);
1619 // Promote the xform function to be an explicit node if set.
1620 std::vector<TreePatternNode*> ResultNodeOperands;
1621 TreePatternNode *DstPattern = Result->getOnlyTree();
1622 for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
1623 TreePatternNode *OpNode = DstPattern->getChild(ii);
1624 if (Record *Xform = OpNode->getTransformFn()) {
1625 OpNode->setTransformFn(0);
1626 std::vector<TreePatternNode*> Children;
1627 Children.push_back(OpNode);
1628 OpNode = new TreePatternNode(Xform, Children);
1630 ResultNodeOperands.push_back(OpNode);
1632 DstPattern = Result->getOnlyTree();
1633 if (!DstPattern->isLeaf())
1634 DstPattern = new TreePatternNode(DstPattern->getOperator(),
1635 ResultNodeOperands);
1636 DstPattern->setTypes(Result->getOnlyTree()->getExtTypes());
1637 TreePattern Temp(Result->getRecord(), DstPattern, false, *this);
1638 Temp.InferAllTypes();
1641 if (!Pattern->getOnlyTree()->canPatternMatch(Reason, *this))
1642 Pattern->error("Pattern can never match: " + Reason);
1645 push_back(PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"),
1646 Pattern->getOnlyTree(),
1648 Patterns[i]->getValueAsInt("AddedComplexity")));
1652 /// CombineChildVariants - Given a bunch of permutations of each child of the
1653 /// 'operator' node, put them together in all possible ways.
1654 static void CombineChildVariants(TreePatternNode *Orig,
1655 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
1656 std::vector<TreePatternNode*> &OutVariants,
1657 DAGISelEmitter &ISE) {
1658 // Make sure that each operand has at least one variant to choose from.
1659 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1660 if (ChildVariants[i].empty())
1663 // The end result is an all-pairs construction of the resultant pattern.
1664 std::vector<unsigned> Idxs;
1665 Idxs.resize(ChildVariants.size());
1666 bool NotDone = true;
1668 // Create the variant and add it to the output list.
1669 std::vector<TreePatternNode*> NewChildren;
1670 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1671 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
1672 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
1674 // Copy over properties.
1675 R->setName(Orig->getName());
1676 R->setPredicateFn(Orig->getPredicateFn());
1677 R->setTransformFn(Orig->getTransformFn());
1678 R->setTypes(Orig->getExtTypes());
1680 // If this pattern cannot every match, do not include it as a variant.
1681 std::string ErrString;
1682 if (!R->canPatternMatch(ErrString, ISE)) {
1685 bool AlreadyExists = false;
1687 // Scan to see if this pattern has already been emitted. We can get
1688 // duplication due to things like commuting:
1689 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
1690 // which are the same pattern. Ignore the dups.
1691 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
1692 if (R->isIsomorphicTo(OutVariants[i])) {
1693 AlreadyExists = true;
1700 OutVariants.push_back(R);
1703 // Increment indices to the next permutation.
1705 // Look for something we can increment without causing a wrap-around.
1706 for (unsigned IdxsIdx = 0; IdxsIdx != Idxs.size(); ++IdxsIdx) {
1707 if (++Idxs[IdxsIdx] < ChildVariants[IdxsIdx].size()) {
1708 NotDone = true; // Found something to increment.
1716 /// CombineChildVariants - A helper function for binary operators.
1718 static void CombineChildVariants(TreePatternNode *Orig,
1719 const std::vector<TreePatternNode*> &LHS,
1720 const std::vector<TreePatternNode*> &RHS,
1721 std::vector<TreePatternNode*> &OutVariants,
1722 DAGISelEmitter &ISE) {
1723 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1724 ChildVariants.push_back(LHS);
1725 ChildVariants.push_back(RHS);
1726 CombineChildVariants(Orig, ChildVariants, OutVariants, ISE);
1730 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
1731 std::vector<TreePatternNode *> &Children) {
1732 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
1733 Record *Operator = N->getOperator();
1735 // Only permit raw nodes.
1736 if (!N->getName().empty() || !N->getPredicateFn().empty() ||
1737 N->getTransformFn()) {
1738 Children.push_back(N);
1742 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
1743 Children.push_back(N->getChild(0));
1745 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
1747 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
1748 Children.push_back(N->getChild(1));
1750 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
1753 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
1754 /// the (potentially recursive) pattern by using algebraic laws.
1756 static void GenerateVariantsOf(TreePatternNode *N,
1757 std::vector<TreePatternNode*> &OutVariants,
1758 DAGISelEmitter &ISE) {
1759 // We cannot permute leaves.
1761 OutVariants.push_back(N);
1765 // Look up interesting info about the node.
1766 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1768 // If this node is associative, reassociate.
1769 if (NodeInfo.hasProperty(SDNodeInfo::SDNPAssociative)) {
1770 // Reassociate by pulling together all of the linked operators
1771 std::vector<TreePatternNode*> MaximalChildren;
1772 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
1774 // Only handle child sizes of 3. Otherwise we'll end up trying too many
1776 if (MaximalChildren.size() == 3) {
1777 // Find the variants of all of our maximal children.
1778 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
1779 GenerateVariantsOf(MaximalChildren[0], AVariants, ISE);
1780 GenerateVariantsOf(MaximalChildren[1], BVariants, ISE);
1781 GenerateVariantsOf(MaximalChildren[2], CVariants, ISE);
1783 // There are only two ways we can permute the tree:
1784 // (A op B) op C and A op (B op C)
1785 // Within these forms, we can also permute A/B/C.
1787 // Generate legal pair permutations of A/B/C.
1788 std::vector<TreePatternNode*> ABVariants;
1789 std::vector<TreePatternNode*> BAVariants;
1790 std::vector<TreePatternNode*> ACVariants;
1791 std::vector<TreePatternNode*> CAVariants;
1792 std::vector<TreePatternNode*> BCVariants;
1793 std::vector<TreePatternNode*> CBVariants;
1794 CombineChildVariants(N, AVariants, BVariants, ABVariants, ISE);
1795 CombineChildVariants(N, BVariants, AVariants, BAVariants, ISE);
1796 CombineChildVariants(N, AVariants, CVariants, ACVariants, ISE);
1797 CombineChildVariants(N, CVariants, AVariants, CAVariants, ISE);
1798 CombineChildVariants(N, BVariants, CVariants, BCVariants, ISE);
1799 CombineChildVariants(N, CVariants, BVariants, CBVariants, ISE);
1801 // Combine those into the result: (x op x) op x
1802 CombineChildVariants(N, ABVariants, CVariants, OutVariants, ISE);
1803 CombineChildVariants(N, BAVariants, CVariants, OutVariants, ISE);
1804 CombineChildVariants(N, ACVariants, BVariants, OutVariants, ISE);
1805 CombineChildVariants(N, CAVariants, BVariants, OutVariants, ISE);
1806 CombineChildVariants(N, BCVariants, AVariants, OutVariants, ISE);
1807 CombineChildVariants(N, CBVariants, AVariants, OutVariants, ISE);
1809 // Combine those into the result: x op (x op x)
1810 CombineChildVariants(N, CVariants, ABVariants, OutVariants, ISE);
1811 CombineChildVariants(N, CVariants, BAVariants, OutVariants, ISE);
1812 CombineChildVariants(N, BVariants, ACVariants, OutVariants, ISE);
1813 CombineChildVariants(N, BVariants, CAVariants, OutVariants, ISE);
1814 CombineChildVariants(N, AVariants, BCVariants, OutVariants, ISE);
1815 CombineChildVariants(N, AVariants, CBVariants, OutVariants, ISE);
1820 // Compute permutations of all children.
1821 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1822 ChildVariants.resize(N->getNumChildren());
1823 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1824 GenerateVariantsOf(N->getChild(i), ChildVariants[i], ISE);
1826 // Build all permutations based on how the children were formed.
1827 CombineChildVariants(N, ChildVariants, OutVariants, ISE);
1829 // If this node is commutative, consider the commuted order.
1830 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
1831 assert(N->getNumChildren()==2 &&"Commutative but doesn't have 2 children!");
1832 // Consider the commuted order.
1833 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
1839 // GenerateVariants - Generate variants. For example, commutative patterns can
1840 // match multiple ways. Add them to PatternsToMatch as well.
1841 void DAGISelEmitter::GenerateVariants() {
1843 DEBUG(std::cerr << "Generating instruction variants.\n");
1845 // Loop over all of the patterns we've collected, checking to see if we can
1846 // generate variants of the instruction, through the exploitation of
1847 // identities. This permits the target to provide agressive matching without
1848 // the .td file having to contain tons of variants of instructions.
1850 // Note that this loop adds new patterns to the PatternsToMatch list, but we
1851 // intentionally do not reconsider these. Any variants of added patterns have
1852 // already been added.
1854 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
1855 std::vector<TreePatternNode*> Variants;
1856 GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this);
1858 assert(!Variants.empty() && "Must create at least original variant!");
1859 Variants.erase(Variants.begin()); // Remove the original pattern.
1861 if (Variants.empty()) // No variants for this pattern.
1864 DEBUG(std::cerr << "FOUND VARIANTS OF: ";
1865 PatternsToMatch[i].getSrcPattern()->dump();
1868 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
1869 TreePatternNode *Variant = Variants[v];
1871 DEBUG(std::cerr << " VAR#" << v << ": ";
1875 // Scan to see if an instruction or explicit pattern already matches this.
1876 bool AlreadyExists = false;
1877 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
1878 // Check to see if this variant already exists.
1879 if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern())) {
1880 DEBUG(std::cerr << " *** ALREADY EXISTS, ignoring variant.\n");
1881 AlreadyExists = true;
1885 // If we already have it, ignore the variant.
1886 if (AlreadyExists) continue;
1888 // Otherwise, add it to the list of patterns we have.
1890 push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
1891 Variant, PatternsToMatch[i].getDstPattern(),
1892 PatternsToMatch[i].getAddedComplexity()));
1895 DEBUG(std::cerr << "\n");
1900 // NodeIsComplexPattern - return true if N is a leaf node and a subclass of
1902 static bool NodeIsComplexPattern(TreePatternNode *N)
1904 return (N->isLeaf() &&
1905 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1906 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1907 isSubClassOf("ComplexPattern"));
1910 // NodeGetComplexPattern - return the pointer to the ComplexPattern if N
1911 // is a leaf node and a subclass of ComplexPattern, else it returns NULL.
1912 static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
1913 DAGISelEmitter &ISE)
1916 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1917 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1918 isSubClassOf("ComplexPattern")) {
1919 return &ISE.getComplexPattern(static_cast<DefInit*>(N->getLeafValue())
1925 /// getPatternSize - Return the 'size' of this pattern. We want to match large
1926 /// patterns before small ones. This is used to determine the size of a
1928 static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
1929 assert((isExtIntegerInVTs(P->getExtTypes()) ||
1930 isExtFloatingPointInVTs(P->getExtTypes()) ||
1931 P->getExtTypeNum(0) == MVT::isVoid ||
1932 P->getExtTypeNum(0) == MVT::Flag ||
1933 P->getExtTypeNum(0) == MVT::iPTR) &&
1934 "Not a valid pattern node to size!");
1935 unsigned Size = 2; // The node itself.
1936 // If the root node is a ConstantSDNode, increases its size.
1937 // e.g. (set R32:$dst, 0).
1938 if (P->isLeaf() && dynamic_cast<IntInit*>(P->getLeafValue()))
1941 // FIXME: This is a hack to statically increase the priority of patterns
1942 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
1943 // Later we can allow complexity / cost for each pattern to be (optionally)
1944 // specified. To get best possible pattern match we'll need to dynamically
1945 // calculate the complexity of all patterns a dag can potentially map to.
1946 const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
1948 Size += AM->getNumOperands() * 2;
1950 // If this node has some predicate function that must match, it adds to the
1951 // complexity of this node.
1952 if (!P->getPredicateFn().empty())
1955 // Count children in the count if they are also nodes.
1956 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
1957 TreePatternNode *Child = P->getChild(i);
1958 if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
1959 Size += getPatternSize(Child, ISE);
1960 else if (Child->isLeaf()) {
1961 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
1962 Size += 3; // Matches a ConstantSDNode (+2) and a specific value (+1).
1963 else if (NodeIsComplexPattern(Child))
1964 Size += getPatternSize(Child, ISE);
1965 else if (!Child->getPredicateFn().empty())
1973 /// getResultPatternCost - Compute the number of instructions for this pattern.
1974 /// This is a temporary hack. We should really include the instruction
1975 /// latencies in this calculation.
1976 static unsigned getResultPatternCost(TreePatternNode *P, DAGISelEmitter &ISE) {
1977 if (P->isLeaf()) return 0;
1980 Record *Op = P->getOperator();
1981 if (Op->isSubClassOf("Instruction")) {
1983 CodeGenInstruction &II = ISE.getTargetInfo().getInstruction(Op->getName());
1984 if (II.usesCustomDAGSchedInserter)
1987 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
1988 Cost += getResultPatternCost(P->getChild(i), ISE);
1992 /// getResultPatternCodeSize - Compute the code size of instructions for this
1994 static unsigned getResultPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
1995 if (P->isLeaf()) return 0;
1998 Record *Op = P->getOperator();
1999 if (Op->isSubClassOf("Instruction")) {
2000 Cost += Op->getValueAsInt("CodeSize");
2002 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
2003 Cost += getResultPatternSize(P->getChild(i), ISE);
2007 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
2008 // In particular, we want to match maximal patterns first and lowest cost within
2009 // a particular complexity first.
2010 struct PatternSortingPredicate {
2011 PatternSortingPredicate(DAGISelEmitter &ise) : ISE(ise) {};
2012 DAGISelEmitter &ISE;
2014 bool operator()(PatternToMatch *LHS,
2015 PatternToMatch *RHS) {
2016 unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), ISE);
2017 unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), ISE);
2018 LHSSize += LHS->getAddedComplexity();
2019 RHSSize += RHS->getAddedComplexity();
2020 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
2021 if (LHSSize < RHSSize) return false;
2023 // If the patterns have equal complexity, compare generated instruction cost
2024 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), ISE);
2025 unsigned RHSCost = getResultPatternCost(RHS->getDstPattern(), ISE);
2026 if (LHSCost < RHSCost) return true;
2027 if (LHSCost > RHSCost) return false;
2029 return getResultPatternSize(LHS->getDstPattern(), ISE) <
2030 getResultPatternSize(RHS->getDstPattern(), ISE);
2034 /// getRegisterValueType - Look up and return the first ValueType of specified
2035 /// RegisterClass record
2036 static MVT::ValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
2037 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
2038 return RC->getValueTypeNum(0);
2043 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
2044 /// type information from it.
2045 static void RemoveAllTypes(TreePatternNode *N) {
2048 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2049 RemoveAllTypes(N->getChild(i));
2052 Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
2053 Record *N = Records.getDef(Name);
2054 if (!N || !N->isSubClassOf("SDNode")) {
2055 std::cerr << "Error getting SDNode '" << Name << "'!\n";
2061 /// NodeHasProperty - return true if TreePatternNode has the specified
2063 static bool NodeHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
2064 DAGISelEmitter &ISE)
2066 if (N->isLeaf()) return false;
2067 Record *Operator = N->getOperator();
2068 if (!Operator->isSubClassOf("SDNode")) return false;
2070 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(Operator);
2071 return NodeInfo.hasProperty(Property);
2074 static bool PatternHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
2075 DAGISelEmitter &ISE)
2077 if (NodeHasProperty(N, Property, ISE))
2080 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2081 TreePatternNode *Child = N->getChild(i);
2082 if (PatternHasProperty(Child, Property, ISE))
2089 class PatternCodeEmitter {
2091 DAGISelEmitter &ISE;
2094 ListInit *Predicates;
2097 // Instruction selector pattern.
2098 TreePatternNode *Pattern;
2099 // Matched instruction.
2100 TreePatternNode *Instruction;
2102 // Node to name mapping
2103 std::map<std::string, std::string> VariableMap;
2104 // Node to operator mapping
2105 std::map<std::string, Record*> OperatorMap;
2106 // Names of all the folded nodes which produce chains.
2107 std::vector<std::pair<std::string, unsigned> > FoldedChains;
2108 std::set<std::string> Duplicates;
2109 /// These nodes are being marked "in-flight" so they cannot be folded.
2110 std::vector<std::string> InflightNodes;
2112 /// GeneratedCode - This is the buffer that we emit code to. The first bool
2113 /// indicates whether this is an exit predicate (something that should be
2114 /// tested, and if true, the match fails) [when true] or normal code to emit
2116 std::vector<std::pair<bool, std::string> > &GeneratedCode;
2117 /// GeneratedDecl - This is the set of all SDOperand declarations needed for
2118 /// the set of patterns for each top-level opcode.
2119 std::set<std::pair<unsigned, std::string> > &GeneratedDecl;
2120 /// TargetOpcodes - The target specific opcodes used by the resulting
2122 std::vector<std::string> &TargetOpcodes;
2123 std::vector<std::string> &TargetVTs;
2125 std::string ChainName;
2131 void emitCheck(const std::string &S) {
2133 GeneratedCode.push_back(std::make_pair(true, S));
2135 void emitCode(const std::string &S) {
2137 GeneratedCode.push_back(std::make_pair(false, S));
2139 void emitDecl(const std::string &S, unsigned T=0) {
2140 assert(!S.empty() && "Invalid declaration");
2141 GeneratedDecl.insert(std::make_pair(T, S));
2143 void emitOpcode(const std::string &Opc) {
2144 TargetOpcodes.push_back(Opc);
2147 void emitVT(const std::string &VT) {
2148 TargetVTs.push_back(VT);
2152 PatternCodeEmitter(DAGISelEmitter &ise, ListInit *preds,
2153 TreePatternNode *pattern, TreePatternNode *instr,
2154 std::vector<std::pair<bool, std::string> > &gc,
2155 std::set<std::pair<unsigned, std::string> > &gd,
2156 std::vector<std::string> &to,
2157 std::vector<std::string> &tv,
2159 : ISE(ise), Predicates(preds), Pattern(pattern), Instruction(instr),
2160 GeneratedCode(gc), GeneratedDecl(gd), TargetOpcodes(to), TargetVTs(tv),
2161 DoReplace(dorep), TmpNo(0), OpcNo(0), VTNo(0) {}
2163 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
2164 /// if the match fails. At this point, we already know that the opcode for N
2165 /// matches, and the SDNode for the result has the RootName specified name.
2166 void EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
2167 const std::string &RootName, const std::string &ParentName,
2168 const std::string &ChainSuffix, bool &FoundChain) {
2169 bool isRoot = (P == NULL);
2170 // Emit instruction predicates. Each predicate is just a string for now.
2172 std::string PredicateCheck;
2173 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
2174 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
2175 Record *Def = Pred->getDef();
2176 if (!Def->isSubClassOf("Predicate")) {
2180 assert(0 && "Unknown predicate type!");
2182 if (!PredicateCheck.empty())
2183 PredicateCheck += " || ";
2184 PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
2188 emitCheck(PredicateCheck);
2192 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2193 emitCheck("cast<ConstantSDNode>(" + RootName +
2194 ")->getSignExtended() == " + itostr(II->getValue()));
2196 } else if (!NodeIsComplexPattern(N)) {
2197 assert(0 && "Cannot match this as a leaf value!");
2202 // If this node has a name associated with it, capture it in VariableMap. If
2203 // we already saw this in the pattern, emit code to verify dagness.
2204 if (!N->getName().empty()) {
2205 std::string &VarMapEntry = VariableMap[N->getName()];
2206 if (VarMapEntry.empty()) {
2207 VarMapEntry = RootName;
2209 // If we get here, this is a second reference to a specific name. Since
2210 // we already have checked that the first reference is valid, we don't
2211 // have to recursively match it, just check that it's the same as the
2212 // previously named thing.
2213 emitCheck(VarMapEntry + " == " + RootName);
2218 OperatorMap[N->getName()] = N->getOperator();
2222 // Emit code to load the child nodes and match their contents recursively.
2224 bool NodeHasChain = NodeHasProperty (N, SDNodeInfo::SDNPHasChain, ISE);
2225 bool HasChain = PatternHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
2226 bool HasOutFlag = PatternHasProperty(N, SDNodeInfo::SDNPOutFlag, ISE);
2227 bool EmittedUseCheck = false;
2228 bool EmittedSlctedCheck = false;
2233 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
2235 emitCheck("InFlightSet.count(" + RootName + ".Val) == 0");
2236 // Multiple uses of actual result?
2237 emitCheck(RootName + ".hasOneUse()");
2238 EmittedUseCheck = true;
2239 // hasOneUse() check is not strong enough. If the original node has
2240 // already been selected, it may have been replaced with another.
2241 for (unsigned j = 0; j != CInfo.getNumResults(); j++)
2242 emitCheck("!CodeGenMap.count(" + RootName + ".getValue(" + utostr(j) +
2245 EmittedSlctedCheck = true;
2247 // FIXME: Don't fold if 1) the parent node writes a flag, 2) the node
2249 // This a workaround for this problem:
2254 // [XX]--/ \- [flag : cmp]
2259 // cmp + br should be considered as a single node as they are flagged
2260 // together. So, if the ld is folded into the cmp, the XX node in the
2261 // graph is now both an operand and a use of the ld/cmp/br node.
2262 if (NodeHasProperty(P, SDNodeInfo::SDNPOutFlag, ISE))
2263 emitCheck(ParentName + ".Val->isOnlyUse(" + RootName + ".Val)");
2265 // If the immediate use can somehow reach this node through another
2266 // path, then can't fold it either or it will create a cycle.
2267 // e.g. In the following diagram, XX can reach ld through YY. If
2268 // ld is folded into XX, then YY is both a predecessor and a successor
2278 const SDNodeInfo &PInfo = ISE.getSDNodeInfo(P->getOperator());
2279 if (PInfo.getNumOperands() > 1 ||
2280 PInfo.hasProperty(SDNodeInfo::SDNPHasChain) ||
2281 PInfo.hasProperty(SDNodeInfo::SDNPInFlag) ||
2282 PInfo.hasProperty(SDNodeInfo::SDNPOptInFlag))
2283 emitCheck("IsFoldableBy(" + RootName + ".Val, " + ParentName +
2290 emitCheck("Chain.Val == " + RootName + ".Val");
2293 ChainName = "Chain" + ChainSuffix;
2294 emitDecl(ChainName);
2295 emitCode(ChainName + " = " + RootName +
2300 // Don't fold any node which reads or writes a flag and has multiple uses.
2301 // FIXME: We really need to separate the concepts of flag and "glue". Those
2302 // real flag results, e.g. X86CMP output, can have multiple uses.
2303 // FIXME: If the optional incoming flag does not exist. Then it is ok to
2306 (PatternHasProperty(N, SDNodeInfo::SDNPInFlag, ISE) ||
2307 PatternHasProperty(N, SDNodeInfo::SDNPOptInFlag, ISE) ||
2308 PatternHasProperty(N, SDNodeInfo::SDNPOutFlag, ISE))) {
2309 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
2310 if (!EmittedUseCheck) {
2311 // Multiple uses of actual result?
2312 emitCheck(RootName + ".hasOneUse()");
2314 if (!EmittedSlctedCheck)
2315 // hasOneUse() check is not strong enough. If the original node has
2316 // already been selected, it may have been replaced with another.
2317 for (unsigned j = 0; j < CInfo.getNumResults(); j++)
2318 emitCheck("!CodeGenMap.count(" + RootName + ".getValue(" + utostr(j) +
2322 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2323 emitDecl(RootName + utostr(OpNo));
2324 emitCode(RootName + utostr(OpNo) + " = " +
2325 RootName + ".getOperand(" +utostr(OpNo) + ");");
2326 TreePatternNode *Child = N->getChild(i);
2328 if (!Child->isLeaf()) {
2329 // If it's not a leaf, recursively match.
2330 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(Child->getOperator());
2331 emitCheck(RootName + utostr(OpNo) + ".getOpcode() == " +
2332 CInfo.getEnumName());
2333 EmitMatchCode(Child, N, RootName + utostr(OpNo), RootName,
2334 ChainSuffix + utostr(OpNo), FoundChain);
2335 if (NodeHasProperty(Child, SDNodeInfo::SDNPHasChain, ISE))
2336 FoldedChains.push_back(std::make_pair(RootName + utostr(OpNo),
2337 CInfo.getNumResults()));
2339 // If this child has a name associated with it, capture it in VarMap. If
2340 // we already saw this in the pattern, emit code to verify dagness.
2341 if (!Child->getName().empty()) {
2342 std::string &VarMapEntry = VariableMap[Child->getName()];
2343 if (VarMapEntry.empty()) {
2344 VarMapEntry = RootName + utostr(OpNo);
2346 // If we get here, this is a second reference to a specific name.
2347 // Since we already have checked that the first reference is valid,
2348 // we don't have to recursively match it, just check that it's the
2349 // same as the previously named thing.
2350 emitCheck(VarMapEntry + " == " + RootName + utostr(OpNo));
2351 Duplicates.insert(RootName + utostr(OpNo));
2356 // Handle leaves of various types.
2357 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2358 Record *LeafRec = DI->getDef();
2359 if (LeafRec->isSubClassOf("RegisterClass")) {
2360 // Handle register references. Nothing to do here.
2361 } else if (LeafRec->isSubClassOf("Register")) {
2362 // Handle register references.
2363 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
2364 // Handle complex pattern. Nothing to do here.
2365 } else if (LeafRec->getName() == "srcvalue") {
2366 // Place holder for SRCVALUE nodes. Nothing to do here.
2367 } else if (LeafRec->isSubClassOf("ValueType")) {
2368 // Make sure this is the specified value type.
2369 emitCheck("cast<VTSDNode>(" + RootName + utostr(OpNo) +
2370 ")->getVT() == MVT::" + LeafRec->getName());
2371 } else if (LeafRec->isSubClassOf("CondCode")) {
2372 // Make sure this is the specified cond code.
2373 emitCheck("cast<CondCodeSDNode>(" + RootName + utostr(OpNo) +
2374 ")->get() == ISD::" + LeafRec->getName());
2380 assert(0 && "Unknown leaf type!");
2382 } else if (IntInit *II =
2383 dynamic_cast<IntInit*>(Child->getLeafValue())) {
2384 emitCheck("isa<ConstantSDNode>(" + RootName + utostr(OpNo) + ")");
2385 unsigned CTmp = TmpNo++;
2386 emitCode("int64_t CN"+utostr(CTmp)+" = cast<ConstantSDNode>("+
2387 RootName + utostr(OpNo) + ")->getSignExtended();");
2389 emitCheck("CN" + utostr(CTmp) + " == " +itostr(II->getValue()));
2394 assert(0 && "Unknown leaf type!");
2399 // If there is a node predicate for this, emit the call.
2400 if (!N->getPredicateFn().empty())
2401 emitCheck(N->getPredicateFn() + "(" + RootName + ".Val)");
2404 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
2405 /// we actually have to build a DAG!
2406 std::pair<unsigned, unsigned>
2407 EmitResultCode(TreePatternNode *N, bool LikeLeaf = false,
2408 bool isRoot = false) {
2409 // This is something selected from the pattern we matched.
2410 if (!N->getName().empty()) {
2411 std::string &Val = VariableMap[N->getName()];
2412 assert(!Val.empty() &&
2413 "Variable referenced but not defined and not caught earlier!");
2414 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
2415 // Already selected this operand, just return the tmpval.
2416 return std::make_pair(1, atoi(Val.c_str()+3));
2419 const ComplexPattern *CP;
2420 unsigned ResNo = TmpNo++;
2421 unsigned NumRes = 1;
2422 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
2423 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2424 std::string CastType;
2425 switch (N->getTypeNum(0)) {
2426 default: assert(0 && "Unknown type for constant node!");
2427 case MVT::i1: CastType = "bool"; break;
2428 case MVT::i8: CastType = "unsigned char"; break;
2429 case MVT::i16: CastType = "unsigned short"; break;
2430 case MVT::i32: CastType = "unsigned"; break;
2431 case MVT::i64: CastType = "uint64_t"; break;
2433 emitDecl("Tmp" + utostr(ResNo));
2434 emitCode("Tmp" + utostr(ResNo) +
2435 " = CurDAG->getTargetConstant(((" + CastType +
2436 ") cast<ConstantSDNode>(" + Val + ")->getValue()), " +
2437 getEnumName(N->getTypeNum(0)) + ");");
2438 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2439 Record *Op = OperatorMap[N->getName()];
2440 // Transform ExternalSymbol to TargetExternalSymbol
2441 if (Op && Op->getName() == "externalsym") {
2442 emitDecl("Tmp" + utostr(ResNo));
2443 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
2444 "ExternalSymbol(cast<ExternalSymbolSDNode>(" +
2445 Val + ")->getSymbol(), " +
2446 getEnumName(N->getTypeNum(0)) + ");");
2448 emitDecl("Tmp" + utostr(ResNo));
2449 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2451 } else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") {
2452 Record *Op = OperatorMap[N->getName()];
2453 // Transform GlobalAddress to TargetGlobalAddress
2454 if (Op && Op->getName() == "globaladdr") {
2455 emitDecl("Tmp" + utostr(ResNo));
2456 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
2457 "GlobalAddress(cast<GlobalAddressSDNode>(" + Val +
2458 ")->getGlobal(), " + getEnumName(N->getTypeNum(0)) +
2461 emitDecl("Tmp" + utostr(ResNo));
2462 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2464 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2465 emitDecl("Tmp" + utostr(ResNo));
2466 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2467 } else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") {
2468 emitDecl("Tmp" + utostr(ResNo));
2469 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2470 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, ISE))) {
2471 std::string Fn = CP->getSelectFunc();
2472 NumRes = CP->getNumOperands();
2473 for (unsigned i = 0; i < NumRes; ++i)
2474 emitDecl("CPTmp" + utostr(i+ResNo));
2476 std::string Code = "bool Match = " + Fn + "(" + Val;
2477 for (unsigned i = 0; i < NumRes; i++)
2478 Code += ", CPTmp" + utostr(i + ResNo);
2479 emitCode(Code + ");");
2480 if (InflightNodes.size()) {
2481 // Remove the in-flight nodes if the ComplexPattern does not match!
2482 emitCode("if (!Match) {");
2483 for (std::vector<std::string>::iterator AI = InflightNodes.begin(),
2484 AE = InflightNodes.end(); AI != AE; ++AI)
2485 emitCode(" SelectionDAG::RemoveInFlightSetEntry(InFlightSet, " +
2492 for (unsigned i = 0; i < NumRes; ++i) {
2493 emitCode("SelectionDAG::InsertInFlightSetEntry(InFlightSet, CPTmp" +
2494 utostr(i+ResNo) + ".Val);");
2495 InflightNodes.push_back("CPTmp" + utostr(i+ResNo));
2497 for (unsigned i = 0; i < NumRes; ++i) {
2498 emitDecl("Tmp" + utostr(i+ResNo));
2499 emitCode("Select(Tmp" + utostr(i+ResNo) + ", CPTmp" +
2500 utostr(i+ResNo) + ");");
2503 TmpNo = ResNo + NumRes;
2505 emitDecl("Tmp" + utostr(ResNo));
2506 // This node, probably wrapped in a SDNodeXForms, behaves like a leaf
2507 // node even if it isn't one. Don't select it.
2509 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2511 emitCode("Select(Tmp" + utostr(ResNo) + ", " + Val + ");");
2514 if (isRoot && N->isLeaf()) {
2515 emitCode("Result = Tmp" + utostr(ResNo) + ";");
2516 emitCode("return;");
2519 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
2520 // value if used multiple times by this pattern result.
2521 Val = "Tmp"+utostr(ResNo);
2522 return std::make_pair(NumRes, ResNo);
2525 // If this is an explicit register reference, handle it.
2526 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
2527 unsigned ResNo = TmpNo++;
2528 if (DI->getDef()->isSubClassOf("Register")) {
2529 emitDecl("Tmp" + utostr(ResNo));
2530 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" +
2531 ISE.getQualifiedName(DI->getDef()) + ", " +
2532 getEnumName(N->getTypeNum(0)) + ");");
2533 return std::make_pair(1, ResNo);
2535 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2536 unsigned ResNo = TmpNo++;
2537 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2538 emitDecl("Tmp" + utostr(ResNo));
2539 emitCode("Tmp" + utostr(ResNo) +
2540 " = CurDAG->getTargetConstant(" + itostr(II->getValue()) +
2541 ", " + getEnumName(N->getTypeNum(0)) + ");");
2542 return std::make_pair(1, ResNo);
2548 assert(0 && "Unknown leaf type!");
2549 return std::make_pair(1, ~0U);
2552 Record *Op = N->getOperator();
2553 if (Op->isSubClassOf("Instruction")) {
2554 const CodeGenTarget &CGT = ISE.getTargetInfo();
2555 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
2556 const DAGInstruction &Inst = ISE.getInstruction(Op);
2557 TreePattern *InstPat = Inst.getPattern();
2558 TreePatternNode *InstPatNode =
2559 isRoot ? (InstPat ? InstPat->getOnlyTree() : Pattern)
2560 : (InstPat ? InstPat->getOnlyTree() : NULL);
2561 if (InstPatNode && InstPatNode->getOperator()->getName() == "set") {
2562 InstPatNode = InstPatNode->getChild(1);
2564 bool HasVarOps = isRoot && II.hasVariableNumberOfOperands;
2565 bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0;
2566 bool HasImpResults = isRoot && Inst.getNumImpResults() > 0;
2567 bool NodeHasOptInFlag = isRoot &&
2568 PatternHasProperty(Pattern, SDNodeInfo::SDNPOptInFlag, ISE);
2569 bool NodeHasInFlag = isRoot &&
2570 PatternHasProperty(Pattern, SDNodeInfo::SDNPInFlag, ISE);
2571 bool NodeHasOutFlag = HasImpResults || (isRoot &&
2572 PatternHasProperty(Pattern, SDNodeInfo::SDNPOutFlag, ISE));
2573 bool NodeHasChain = InstPatNode &&
2574 PatternHasProperty(InstPatNode, SDNodeInfo::SDNPHasChain, ISE);
2575 bool InputHasChain = isRoot &&
2576 NodeHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE);
2578 if (NodeHasInFlag || NodeHasOutFlag || NodeHasOptInFlag || HasImpInputs)
2580 if (NodeHasOptInFlag) {
2581 emitDecl("HasInFlag", 2);
2582 emitCode("HasInFlag = "
2583 "(N.getOperand(N.getNumOperands()-1).getValueType() == MVT::Flag);");
2586 emitCode("std::vector<SDOperand> Ops;");
2588 // How many results is this pattern expected to produce?
2589 unsigned PatResults = 0;
2590 for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
2591 MVT::ValueType VT = Pattern->getTypeNum(i);
2592 if (VT != MVT::isVoid && VT != MVT::Flag)
2596 // Determine operand emission order. Complex pattern first.
2597 std::vector<std::pair<unsigned, TreePatternNode*> > EmitOrder;
2598 std::vector<std::pair<unsigned, TreePatternNode*> >::iterator OI;
2599 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2600 TreePatternNode *Child = N->getChild(i);
2602 EmitOrder.push_back(std::make_pair(i, Child));
2603 OI = EmitOrder.begin();
2604 } else if (NodeIsComplexPattern(Child)) {
2605 OI = EmitOrder.insert(OI, std::make_pair(i, Child));
2607 EmitOrder.push_back(std::make_pair(i, Child));
2611 // Make sure these operands which would be selected won't be folded while
2612 // the isel traverses the DAG upward.
2613 for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) {
2614 TreePatternNode *Child = EmitOrder[i].second;
2615 if (!Child->getName().empty()) {
2616 std::string &Val = VariableMap[Child->getName()];
2617 assert(!Val.empty() &&
2618 "Variable referenced but not defined and not caught earlier!");
2619 if (Child->isLeaf() && !NodeGetComplexPattern(Child, ISE)) {
2620 emitCode("SelectionDAG::InsertInFlightSetEntry(InFlightSet, " +
2622 InflightNodes.push_back(Val);
2627 // Emit all of the operands.
2628 std::vector<std::pair<unsigned, unsigned> > NumTemps(EmitOrder.size());
2629 for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) {
2630 unsigned OpOrder = EmitOrder[i].first;
2631 TreePatternNode *Child = EmitOrder[i].second;
2632 std::pair<unsigned, unsigned> NumTemp = EmitResultCode(Child);
2633 NumTemps[OpOrder] = NumTemp;
2636 // List all the operands in the right order.
2637 std::vector<unsigned> Ops;
2638 for (unsigned i = 0, e = NumTemps.size(); i != e; i++) {
2639 for (unsigned j = 0; j < NumTemps[i].first; j++)
2640 Ops.push_back(NumTemps[i].second + j);
2643 // Emit all the chain and CopyToReg stuff.
2644 bool ChainEmitted = NodeHasChain;
2646 emitCode("Select(" + ChainName + ", " + ChainName + ");");
2647 if (NodeHasInFlag || HasImpInputs)
2648 EmitInFlagSelectCode(Pattern, "N", ChainEmitted, true);
2649 if (NodeHasOptInFlag) {
2650 emitCode("if (HasInFlag)");
2651 emitCode(" Select(InFlag, N.getOperand(N.getNumOperands()-1));");
2655 // The operands have been selected. Remove them from InFlightSet.
2656 for (std::vector<std::string>::iterator AI = InflightNodes.begin(),
2657 AE = InflightNodes.end(); AI != AE; ++AI)
2658 emitCode("SelectionDAG::RemoveInFlightSetEntry(InFlightSet, " +
2662 unsigned NumResults = Inst.getNumResults();
2663 unsigned ResNo = TmpNo++;
2664 if (!isRoot || InputHasChain || NodeHasChain || NodeHasOutFlag ||
2668 std::string NodeName;
2670 NodeName = "Tmp" + utostr(ResNo);
2672 Code2 = NodeName + " = SDOperand(";
2674 NodeName = "ResNode";
2675 emitDecl(NodeName, true);
2676 Code2 = NodeName + " = ";
2678 Code = "CurDAG->getTargetNode(Opc" + utostr(OpcNo);
2679 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
2681 // Output order: results, chain, flags
2683 if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid) {
2684 Code += ", VT" + utostr(VTNo);
2685 emitVT(getEnumName(N->getTypeNum(0)));
2688 Code += ", MVT::Other";
2690 Code += ", MVT::Flag";
2693 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
2695 emitCode("Ops.push_back(Tmp" + utostr(Ops[i]) + ");");
2697 Code += ", Tmp" + utostr(Ops[i]);
2701 if (NodeHasInFlag || HasImpInputs)
2702 emitCode("for (unsigned i = 2, e = N.getNumOperands()-1; "
2704 else if (NodeHasOptInFlag)
2705 emitCode("for (unsigned i = 2, e = N.getNumOperands()-"
2706 "(HasInFlag?1:0); i != e; ++i) {");
2708 emitCode("for (unsigned i = 2, e = N.getNumOperands(); "
2710 emitCode(" SDOperand VarOp(0, 0);");
2711 emitCode(" Select(VarOp, N.getOperand(i));");
2712 emitCode(" Ops.push_back(VarOp);");
2718 emitCode("Ops.push_back(" + ChainName + ");");
2720 Code += ", " + ChainName;
2722 if (NodeHasInFlag || HasImpInputs) {
2724 emitCode("Ops.push_back(InFlag);");
2727 } else if (NodeHasOptInFlag && HasVarOps) {
2728 emitCode("if (HasInFlag)");
2729 emitCode(" Ops.push_back(InFlag);");
2734 else if (NodeHasOptInFlag)
2735 Code = "HasInFlag ? " + Code + ", InFlag) : " + Code;
2739 emitCode(Code2 + Code + ");");
2742 // Remember which op produces the chain.
2744 emitCode(ChainName + " = SDOperand(" + NodeName +
2745 ".Val, " + utostr(PatResults) + ");");
2747 emitCode(ChainName + " = SDOperand(" + NodeName +
2748 ", " + utostr(PatResults) + ");");
2751 return std::make_pair(1, ResNo);
2753 for (unsigned i = 0; i < NumResults; i++)
2754 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2755 utostr(i) + ", ResNode, " + utostr(i) + ");");
2758 emitCode("InFlag = SDOperand(ResNode, " +
2759 utostr(NumResults + (unsigned)NodeHasChain) + ");");
2761 if (HasImpResults && EmitCopyFromRegs(N, ChainEmitted)) {
2762 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, "
2767 if (InputHasChain) {
2768 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2769 utostr(PatResults) + ", " + ChainName + ".Val, " +
2770 ChainName + ".ResNo" + ");");
2772 emitCode("if (N.ResNo == 0) AddHandleReplacement(N.Val, " +
2773 utostr(PatResults) + ", " + ChainName + ".Val, " +
2774 ChainName + ".ResNo" + ");");
2777 if (FoldedChains.size() > 0) {
2779 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
2780 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, " +
2781 FoldedChains[j].first + ".Val, " +
2782 utostr(FoldedChains[j].second) + ", ResNode, " +
2783 utostr(NumResults) + ");");
2785 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++) {
2787 FoldedChains[j].first + ".Val, " +
2788 utostr(FoldedChains[j].second) + ", ";
2789 emitCode("AddHandleReplacement(" + Code + "ResNode, " +
2790 utostr(NumResults) + ");");
2795 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2796 utostr(PatResults + (unsigned)InputHasChain) +
2797 ", InFlag.Val, InFlag.ResNo);");
2799 // User does not expect the instruction would produce a chain!
2800 bool AddedChain = NodeHasChain && !InputHasChain;
2801 if (AddedChain && NodeHasOutFlag) {
2802 if (PatResults == 0) {
2803 emitCode("Result = SDOperand(ResNode, N.ResNo+1);");
2805 emitCode("if (N.ResNo < " + utostr(PatResults) + ")");
2806 emitCode(" Result = SDOperand(ResNode, N.ResNo);");
2808 emitCode(" Result = SDOperand(ResNode, N.ResNo+1);");
2810 } else if (InputHasChain && !NodeHasChain) {
2811 // One of the inner node produces a chain.
2812 emitCode("if (N.ResNo < " + utostr(PatResults) + ")");
2813 emitCode(" Result = SDOperand(ResNode, N.ResNo);");
2814 if (NodeHasOutFlag) {
2815 emitCode("else if (N.ResNo > " + utostr(PatResults) + ")");
2816 emitCode(" Result = SDOperand(ResNode, N.ResNo-1);");
2819 emitCode(" Result = SDOperand(" + ChainName + ".Val, " +
2820 ChainName + ".ResNo);");
2822 emitCode("Result = SDOperand(ResNode, N.ResNo);");
2825 // If this instruction is the root, and if there is only one use of it,
2826 // use SelectNodeTo instead of getTargetNode to avoid an allocation.
2827 emitCode("if (N.Val->hasOneUse()) {");
2828 std::string Code = " Result = CurDAG->SelectNodeTo(N.Val, Opc" +
2830 if (N->getTypeNum(0) != MVT::isVoid)
2831 Code += ", VT" + utostr(VTNo);
2833 Code += ", MVT::Flag";
2834 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2835 Code += ", Tmp" + utostr(Ops[i]);
2836 if (NodeHasInFlag || HasImpInputs)
2838 emitCode(Code + ");");
2839 emitCode("} else {");
2840 emitDecl("ResNode", 1);
2841 Code = " ResNode = CurDAG->getTargetNode(Opc" + utostr(OpcNo);
2842 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
2843 if (N->getTypeNum(0) != MVT::isVoid) {
2844 Code += ", VT" + utostr(VTNo);
2845 emitVT(getEnumName(N->getTypeNum(0)));
2848 Code += ", MVT::Flag";
2849 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2850 Code += ", Tmp" + utostr(Ops[i]);
2851 if (NodeHasInFlag || HasImpInputs)
2853 emitCode(Code + ");");
2854 emitCode(" SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo"
2856 emitCode(" Result = SDOperand(ResNode, 0);");
2861 emitCode("return;");
2862 return std::make_pair(1, ResNo);
2863 } else if (Op->isSubClassOf("SDNodeXForm")) {
2864 assert(N->getNumChildren() == 1 && "node xform should have one child!");
2865 // PatLeaf node - the operand may or may not be a leaf node. But it should
2867 unsigned OpVal = EmitResultCode(N->getChild(0), true).second;
2868 unsigned ResNo = TmpNo++;
2869 emitDecl("Tmp" + utostr(ResNo));
2870 emitCode("Tmp" + utostr(ResNo) + " = Transform_" + Op->getName()
2871 + "(Tmp" + utostr(OpVal) + ".Val);");
2873 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val,"
2874 "N.ResNo, Tmp" + utostr(ResNo) + ".Val, Tmp" +
2875 utostr(ResNo) + ".ResNo);");
2876 emitCode("Result = Tmp" + utostr(ResNo) + ";");
2877 emitCode("return;");
2879 return std::make_pair(1, ResNo);
2883 throw std::string("Unknown node in result pattern!");
2887 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat'
2888 /// and add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
2889 /// 'Pat' may be missing types. If we find an unresolved type to add a check
2890 /// for, this returns true otherwise false if Pat has all types.
2891 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
2892 const std::string &Prefix) {
2894 if (Pat->getExtTypes() != Other->getExtTypes()) {
2895 // Move a type over from 'other' to 'pat'.
2896 Pat->setTypes(Other->getExtTypes());
2897 emitCheck(Prefix + ".Val->getValueType(0) == " +
2898 getName(Pat->getTypeNum(0)));
2903 (unsigned) NodeHasProperty(Pat, SDNodeInfo::SDNPHasChain, ISE);
2904 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
2905 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
2906 Prefix + utostr(OpNo)))
2912 /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is
2914 void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName,
2915 bool &ChainEmitted, bool isRoot = false) {
2916 const CodeGenTarget &T = ISE.getTargetInfo();
2918 (unsigned) NodeHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
2919 bool HasInFlag = NodeHasProperty(N, SDNodeInfo::SDNPInFlag, ISE);
2920 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2921 TreePatternNode *Child = N->getChild(i);
2922 if (!Child->isLeaf()) {
2923 EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted);
2925 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2926 if (!Child->getName().empty()) {
2927 std::string Name = RootName + utostr(OpNo);
2928 if (Duplicates.find(Name) != Duplicates.end())
2929 // A duplicate! Do not emit a copy for this node.
2933 Record *RR = DI->getDef();
2934 if (RR->isSubClassOf("Register")) {
2935 MVT::ValueType RVT = getRegisterValueType(RR, T);
2936 if (RVT == MVT::Flag) {
2937 emitCode("Select(InFlag, " + RootName + utostr(OpNo) + ");");
2939 if (!ChainEmitted) {
2941 emitCode("Chain = CurDAG->getEntryNode();");
2942 ChainName = "Chain";
2943 ChainEmitted = true;
2945 emitCode("Select(" + RootName + utostr(OpNo) + ", " +
2946 RootName + utostr(OpNo) + ");");
2947 emitCode("ResNode = CurDAG->getCopyToReg(" + ChainName +
2948 ", CurDAG->getRegister(" + ISE.getQualifiedName(RR) +
2949 ", " + getEnumName(RVT) + "), " +
2950 RootName + utostr(OpNo) + ", InFlag).Val;");
2951 emitCode(ChainName + " = SDOperand(ResNode, 0);");
2952 emitCode("InFlag = SDOperand(ResNode, 1);");
2960 emitCode("Select(InFlag, " + RootName +
2961 ".getOperand(" + utostr(OpNo) + "));");
2964 /// EmitCopyFromRegs - Emit code to copy result to physical registers
2965 /// as specified by the instruction. It returns true if any copy is
2967 bool EmitCopyFromRegs(TreePatternNode *N, bool &ChainEmitted) {
2968 bool RetVal = false;
2969 Record *Op = N->getOperator();
2970 if (Op->isSubClassOf("Instruction")) {
2971 const DAGInstruction &Inst = ISE.getInstruction(Op);
2972 const CodeGenTarget &CGT = ISE.getTargetInfo();
2973 unsigned NumImpResults = Inst.getNumImpResults();
2974 for (unsigned i = 0; i < NumImpResults; i++) {
2975 Record *RR = Inst.getImpResult(i);
2976 if (RR->isSubClassOf("Register")) {
2977 MVT::ValueType RVT = getRegisterValueType(RR, CGT);
2978 if (RVT != MVT::Flag) {
2979 if (!ChainEmitted) {
2981 emitCode("Chain = CurDAG->getEntryNode();");
2982 ChainEmitted = true;
2983 ChainName = "Chain";
2985 emitCode("ResNode = CurDAG->getCopyFromReg(" + ChainName +
2986 ", " + ISE.getQualifiedName(RR) + ", " + getEnumName(RVT) +
2988 emitCode(ChainName + " = SDOperand(ResNode, 1);");
2989 emitCode("InFlag = SDOperand(ResNode, 2);");
2999 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
3000 /// stream to match the pattern, and generate the code for the match if it
3001 /// succeeds. Returns true if the pattern is not guaranteed to match.
3002 void DAGISelEmitter::GenerateCodeForPattern(PatternToMatch &Pattern,
3003 std::vector<std::pair<bool, std::string> > &GeneratedCode,
3004 std::set<std::pair<unsigned, std::string> > &GeneratedDecl,
3005 std::vector<std::string> &TargetOpcodes,
3006 std::vector<std::string> &TargetVTs,
3008 PatternCodeEmitter Emitter(*this, Pattern.getPredicates(),
3009 Pattern.getSrcPattern(), Pattern.getDstPattern(),
3010 GeneratedCode, GeneratedDecl,
3011 TargetOpcodes, TargetVTs,
3014 // Emit the matcher, capturing named arguments in VariableMap.
3015 bool FoundChain = false;
3016 Emitter.EmitMatchCode(Pattern.getSrcPattern(), NULL, "N", "", "", FoundChain);
3018 // TP - Get *SOME* tree pattern, we don't care which.
3019 TreePattern &TP = *PatternFragments.begin()->second;
3021 // At this point, we know that we structurally match the pattern, but the
3022 // types of the nodes may not match. Figure out the fewest number of type
3023 // comparisons we need to emit. For example, if there is only one integer
3024 // type supported by a target, there should be no type comparisons at all for
3025 // integer patterns!
3027 // To figure out the fewest number of type checks needed, clone the pattern,
3028 // remove the types, then perform type inference on the pattern as a whole.
3029 // If there are unresolved types, emit an explicit check for those types,
3030 // apply the type to the tree, then rerun type inference. Iterate until all
3031 // types are resolved.
3033 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
3034 RemoveAllTypes(Pat);
3037 // Resolve/propagate as many types as possible.
3039 bool MadeChange = true;
3041 MadeChange = Pat->ApplyTypeConstraints(TP,
3042 true/*Ignore reg constraints*/);
3044 assert(0 && "Error: could not find consistent types for something we"
3045 " already decided was ok!");
3049 // Insert a check for an unresolved type and add it to the tree. If we find
3050 // an unresolved type to add a check for, this returns true and we iterate,
3051 // otherwise we are done.
3052 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N"));
3054 Emitter.EmitResultCode(Pattern.getDstPattern(), false, true /*the root*/);
3058 /// EraseCodeLine - Erase one code line from all of the patterns. If removing
3059 /// a line causes any of them to be empty, remove them and return true when
3061 static bool EraseCodeLine(std::vector<std::pair<PatternToMatch*,
3062 std::vector<std::pair<bool, std::string> > > >
3064 bool ErasedPatterns = false;
3065 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
3066 Patterns[i].second.pop_back();
3067 if (Patterns[i].second.empty()) {
3068 Patterns.erase(Patterns.begin()+i);
3070 ErasedPatterns = true;
3073 return ErasedPatterns;
3076 /// EmitPatterns - Emit code for at least one pattern, but try to group common
3077 /// code together between the patterns.
3078 void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
3079 std::vector<std::pair<bool, std::string> > > >
3080 &Patterns, unsigned Indent,
3082 typedef std::pair<bool, std::string> CodeLine;
3083 typedef std::vector<CodeLine> CodeList;
3084 typedef std::vector<std::pair<PatternToMatch*, CodeList> > PatternList;
3086 if (Patterns.empty()) return;
3088 // Figure out how many patterns share the next code line. Explicitly copy
3089 // FirstCodeLine so that we don't invalidate a reference when changing
3091 const CodeLine FirstCodeLine = Patterns.back().second.back();
3092 unsigned LastMatch = Patterns.size()-1;
3093 while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
3096 // If not all patterns share this line, split the list into two pieces. The
3097 // first chunk will use this line, the second chunk won't.
3098 if (LastMatch != 0) {
3099 PatternList Shared(Patterns.begin()+LastMatch, Patterns.end());
3100 PatternList Other(Patterns.begin(), Patterns.begin()+LastMatch);
3102 // FIXME: Emit braces?
3103 if (Shared.size() == 1) {
3104 PatternToMatch &Pattern = *Shared.back().first;
3105 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
3106 Pattern.getSrcPattern()->print(OS);
3107 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
3108 Pattern.getDstPattern()->print(OS);
3110 unsigned AddedComplexity = Pattern.getAddedComplexity();
3111 OS << std::string(Indent, ' ') << "// Pattern complexity = "
3112 << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity
3114 << getResultPatternCost(Pattern.getDstPattern(), *this)
3116 << getResultPatternSize(Pattern.getDstPattern(), *this) << "\n";
3118 if (!FirstCodeLine.first) {
3119 OS << std::string(Indent, ' ') << "{\n";
3122 EmitPatterns(Shared, Indent, OS);
3123 if (!FirstCodeLine.first) {
3125 OS << std::string(Indent, ' ') << "}\n";
3128 if (Other.size() == 1) {
3129 PatternToMatch &Pattern = *Other.back().first;
3130 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
3131 Pattern.getSrcPattern()->print(OS);
3132 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
3133 Pattern.getDstPattern()->print(OS);
3135 unsigned AddedComplexity = Pattern.getAddedComplexity();
3136 OS << std::string(Indent, ' ') << "// Pattern complexity = "
3137 << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity
3139 << getResultPatternCost(Pattern.getDstPattern(), *this) << "\n";
3141 EmitPatterns(Other, Indent, OS);
3145 // Remove this code from all of the patterns that share it.
3146 bool ErasedPatterns = EraseCodeLine(Patterns);
3148 bool isPredicate = FirstCodeLine.first;
3150 // Otherwise, every pattern in the list has this line. Emit it.
3153 OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
3155 OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
3157 // If the next code line is another predicate, and if all of the pattern
3158 // in this group share the same next line, emit it inline now. Do this
3159 // until we run out of common predicates.
3160 while (!ErasedPatterns && Patterns.back().second.back().first) {
3161 // Check that all of fhe patterns in Patterns end with the same predicate.
3162 bool AllEndWithSamePredicate = true;
3163 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
3164 if (Patterns[i].second.back() != Patterns.back().second.back()) {
3165 AllEndWithSamePredicate = false;
3168 // If all of the predicates aren't the same, we can't share them.
3169 if (!AllEndWithSamePredicate) break;
3171 // Otherwise we can. Emit it shared now.
3172 OS << " &&\n" << std::string(Indent+4, ' ')
3173 << Patterns.back().second.back().second;
3174 ErasedPatterns = EraseCodeLine(Patterns);
3181 EmitPatterns(Patterns, Indent, OS);
3184 OS << std::string(Indent-2, ' ') << "}\n";
3190 /// CompareByRecordName - An ordering predicate that implements less-than by
3191 /// comparing the names records.
3192 struct CompareByRecordName {
3193 bool operator()(const Record *LHS, const Record *RHS) const {
3194 // Sort by name first.
3195 if (LHS->getName() < RHS->getName()) return true;
3196 // If both names are equal, sort by pointer.
3197 return LHS->getName() == RHS->getName() && LHS < RHS;
3202 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
3203 std::string InstNS = Target.inst_begin()->second.Namespace;
3204 if (!InstNS.empty()) InstNS += "::";
3206 // Group the patterns by their top-level opcodes.
3207 std::map<Record*, std::vector<PatternToMatch*>,
3208 CompareByRecordName> PatternsByOpcode;
3209 // All unique target node emission functions.
3210 std::map<std::string, unsigned> EmitFunctions;
3211 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
3212 TreePatternNode *Node = PatternsToMatch[i].getSrcPattern();
3213 if (!Node->isLeaf()) {
3214 PatternsByOpcode[Node->getOperator()].push_back(&PatternsToMatch[i]);
3216 const ComplexPattern *CP;
3218 dynamic_cast<IntInit*>(Node->getLeafValue())) {
3219 PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
3220 } else if ((CP = NodeGetComplexPattern(Node, *this))) {
3221 std::vector<Record*> OpNodes = CP->getRootNodes();
3222 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
3223 PatternsByOpcode[OpNodes[j]]
3224 .insert(PatternsByOpcode[OpNodes[j]].begin(), &PatternsToMatch[i]);
3227 std::cerr << "Unrecognized opcode '";
3229 std::cerr << "' on tree pattern '";
3231 PatternsToMatch[i].getDstPattern()->getOperator()->getName();
3232 std::cerr << "'!\n";
3238 // Emit one Select_* method for each top-level opcode. We do this instead of
3239 // emitting one giant switch statement to support compilers where this will
3240 // result in the recursive functions taking less stack space.
3241 for (std::map<Record*, std::vector<PatternToMatch*>,
3242 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
3243 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
3244 const std::string &OpName = PBOI->first->getName();
3245 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
3247 (OpcodeInfo.hasProperty(SDNodeInfo::SDNPHasChain) &&
3248 OpcodeInfo.getNumResults() > 0);
3249 std::vector<PatternToMatch*> &Patterns = PBOI->second;
3250 assert(!Patterns.empty() && "No patterns but map has entry?");
3252 // We want to emit all of the matching code now. However, we want to emit
3253 // the matches in order of minimal cost. Sort the patterns so the least
3254 // cost one is at the start.
3255 std::stable_sort(Patterns.begin(), Patterns.end(),
3256 PatternSortingPredicate(*this));
3258 typedef std::vector<std::pair<bool, std::string> > CodeList;
3259 typedef std::vector<std::pair<bool, std::string> >::iterator CodeListI;
3261 std::vector<std::pair<PatternToMatch*, CodeList> > CodeForPatterns;
3262 std::vector<std::vector<std::string> > PatternOpcodes;
3263 std::vector<std::vector<std::string> > PatternVTs;
3264 std::vector<std::set<std::pair<unsigned, std::string> > > PatternDecls;
3265 std::set<std::pair<unsigned, std::string> > AllGenDecls;
3266 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
3267 CodeList GeneratedCode;
3268 std::set<std::pair<unsigned, std::string> > GeneratedDecl;
3269 std::vector<std::string> TargetOpcodes;
3270 std::vector<std::string> TargetVTs;
3271 GenerateCodeForPattern(*Patterns[i], GeneratedCode, GeneratedDecl,
3272 TargetOpcodes, TargetVTs, OptSlctOrder);
3273 for (std::set<std::pair<unsigned, std::string> >::iterator
3274 si = GeneratedDecl.begin(), se = GeneratedDecl.end(); si!=se; ++si)
3275 AllGenDecls.insert(*si);
3276 CodeForPatterns.push_back(std::make_pair(Patterns[i], GeneratedCode));
3277 PatternDecls.push_back(GeneratedDecl);
3278 PatternOpcodes.push_back(TargetOpcodes);
3279 PatternVTs.push_back(TargetVTs);
3282 // Scan the code to see if all of the patterns are reachable and if it is
3283 // possible that the last one might not match.
3284 bool mightNotMatch = true;
3285 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3286 CodeList &GeneratedCode = CodeForPatterns[i].second;
3287 mightNotMatch = false;
3289 for (unsigned j = 0, e = GeneratedCode.size(); j != e; ++j) {
3290 if (GeneratedCode[j].first) { // predicate.
3291 mightNotMatch = true;
3296 // If this pattern definitely matches, and if it isn't the last one, the
3297 // patterns after it CANNOT ever match. Error out.
3298 if (mightNotMatch == false && i != CodeForPatterns.size()-1) {
3299 std::cerr << "Pattern '";
3300 CodeForPatterns[i+1].first->getSrcPattern()->print(OS);
3301 std::cerr << "' is impossible to select!\n";
3306 // Factor target node emission code (emitted by EmitResultCode) into
3307 // separate functions. Uniquing and share them among all instruction
3308 // selection routines.
3309 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3310 CodeList &GeneratedCode = CodeForPatterns[i].second;
3311 std::vector<std::string> &TargetOpcodes = PatternOpcodes[i];
3312 std::vector<std::string> &TargetVTs = PatternVTs[i];
3313 std::set<std::pair<unsigned, std::string> > Decls = PatternDecls[i];
3314 int CodeSize = (int)GeneratedCode.size();
3316 for (int j = CodeSize-1; j >= 0; --j) {
3317 if (GeneratedCode[j].first) {
3323 std::string CalleeDecls;
3324 std::string CalleeCode = "(SDOperand &Result, SDOperand &N";
3325 std::string CallerCode = "(Result, N";
3326 for (unsigned j = 0, e = TargetOpcodes.size(); j != e; ++j) {
3327 CalleeCode += ", unsigned Opc" + utostr(j);
3328 CallerCode += ", " + TargetOpcodes[j];
3330 for (unsigned j = 0, e = TargetVTs.size(); j != e; ++j) {
3331 CalleeCode += ", MVT::ValueType VT" + utostr(j);
3332 CallerCode += ", " + TargetVTs[j];
3334 for (std::set<std::pair<unsigned, std::string> >::iterator
3335 I = Decls.begin(), E = Decls.end(); I != E; ++I) {
3336 std::string Name = I->second;
3337 if (I->first == 0) {
3338 if (Name == "InFlag" ||
3340 Name[0] == 'T' && Name[1] == 'm' && Name[2] == 'p')) {
3341 CalleeDecls += " SDOperand " + Name + "(0, 0);\n";
3344 CalleeCode += ", SDOperand &" + Name;
3345 CallerCode += ", " + Name;
3346 } else if (I->first == 1) {
3347 if (Name == "ResNode") {
3348 CalleeDecls += " SDNode *" + Name + " = NULL;\n";
3351 CalleeCode += ", SDNode *" + Name;
3352 CallerCode += ", " + Name;
3354 CalleeCode += ", bool " + Name;
3355 CallerCode += ", " + Name;
3360 // Prevent emission routines from being inlined to reduce selection
3361 // routines stack frame sizes.
3362 CalleeCode += "NOINLINE ";
3363 CalleeCode += "{\n" + CalleeDecls;
3364 for (int j = LastPred+1; j < CodeSize; ++j)
3365 CalleeCode += " " + GeneratedCode[j].second + '\n';
3366 for (int j = LastPred+1; j < CodeSize; ++j)
3367 GeneratedCode.pop_back();
3368 CalleeCode += "}\n";
3370 // Uniquing the emission routines.
3371 unsigned EmitFuncNum;
3372 std::map<std::string, unsigned>::iterator EFI =
3373 EmitFunctions.find(CalleeCode);
3374 if (EFI != EmitFunctions.end()) {
3375 EmitFuncNum = EFI->second;
3377 EmitFuncNum = EmitFunctions.size();
3378 EmitFunctions.insert(std::make_pair(CalleeCode, EmitFuncNum));
3379 OS << "void " << "Emit_" << utostr(EmitFuncNum) << CalleeCode;
3382 // Replace the emission code within selection routines with calls to the
3383 // emission functions.
3384 CallerCode = "Emit_" + utostr(EmitFuncNum) + CallerCode;
3385 GeneratedCode.push_back(std::make_pair(false, CallerCode));
3386 GeneratedCode.push_back(std::make_pair(false, "return;"));
3390 OS << "void Select_" << OpName << "(SDOperand &Result, SDOperand N) {\n";
3392 OS << " if (N.ResNo == " << OpcodeInfo.getNumResults()
3393 << " && N.getValue(0).hasOneUse()) {\n"
3394 << " SDOperand Dummy = "
3395 << "CurDAG->getNode(ISD::HANDLENODE, MVT::Other, N);\n"
3396 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, "
3397 << OpcodeInfo.getNumResults() << ", Dummy.Val, 0);\n"
3398 << " SelectionDAG::InsertISelMapEntry(HandleMap, N.Val, "
3399 << OpcodeInfo.getNumResults() << ", Dummy.Val, 0);\n"
3400 << " Result = Dummy;\n"
3405 // Print all declarations.
3406 for (std::set<std::pair<unsigned, std::string> >::iterator
3407 I = AllGenDecls.begin(), E = AllGenDecls.end(); I != E; ++I)
3409 OS << " SDOperand " << I->second << "(0, 0);\n";
3410 else if (I->first == 1)
3411 OS << " SDNode *" << I->second << " = NULL;\n";
3413 OS << " bool " << I->second << " = false;\n";
3415 // Loop through and reverse all of the CodeList vectors, as we will be
3416 // accessing them from their logical front, but accessing the end of a
3417 // vector is more efficient.
3418 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3419 CodeList &GeneratedCode = CodeForPatterns[i].second;
3420 std::reverse(GeneratedCode.begin(), GeneratedCode.end());
3423 // Next, reverse the list of patterns itself for the same reason.
3424 std::reverse(CodeForPatterns.begin(), CodeForPatterns.end());
3426 // Emit all of the patterns now, grouped together to share code.
3427 EmitPatterns(CodeForPatterns, 2, OS);
3429 // If the last pattern has predicates (which could fail) emit code to catch
3430 // the case where nothing handles a pattern.
3431 if (mightNotMatch) {
3432 OS << " std::cerr << \"Cannot yet select: \";\n";
3433 if (OpcodeInfo.getEnumName() != "ISD::INTRINSIC_W_CHAIN" &&
3434 OpcodeInfo.getEnumName() != "ISD::INTRINSIC_WO_CHAIN" &&
3435 OpcodeInfo.getEnumName() != "ISD::INTRINSIC_VOID") {
3436 OS << " N.Val->dump(CurDAG);\n";
3438 OS << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
3439 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
3440 << " std::cerr << \"intrinsic %\"<< "
3441 "Intrinsic::getName((Intrinsic::ID)iid);\n";
3443 OS << " std::cerr << '\\n';\n"
3449 // Emit boilerplate.
3450 OS << "void Select_INLINEASM(SDOperand& Result, SDOperand N) {\n"
3451 << " std::vector<SDOperand> Ops(N.Val->op_begin(), N.Val->op_end());\n"
3452 << " Select(Ops[0], N.getOperand(0)); // Select the chain.\n\n"
3453 << " // Select the flag operand.\n"
3454 << " if (Ops.back().getValueType() == MVT::Flag)\n"
3455 << " Select(Ops.back(), Ops.back());\n"
3456 << " SelectInlineAsmMemoryOperands(Ops, *CurDAG);\n"
3457 << " std::vector<MVT::ValueType> VTs;\n"
3458 << " VTs.push_back(MVT::Other);\n"
3459 << " VTs.push_back(MVT::Flag);\n"
3460 << " SDOperand New = CurDAG->getNode(ISD::INLINEASM, VTs, Ops);\n"
3461 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, New.Val, 0);\n"
3462 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, New.Val, 1);\n"
3463 << " Result = New.getValue(N.ResNo);\n"
3467 OS << "// The main instruction selector code.\n"
3468 << "void SelectCode(SDOperand &Result, SDOperand N) {\n"
3469 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
3470 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
3471 << "INSTRUCTION_LIST_END)) {\n"
3473 << " return; // Already selected.\n"
3475 << " std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);\n"
3476 << " if (CGMI != CodeGenMap.end()) {\n"
3477 << " Result = CGMI->second;\n"
3480 << " switch (N.getOpcode()) {\n"
3481 << " default: break;\n"
3482 << " case ISD::EntryToken: // These leaves remain the same.\n"
3483 << " case ISD::BasicBlock:\n"
3484 << " case ISD::Register:\n"
3485 << " case ISD::HANDLENODE:\n"
3486 << " case ISD::TargetConstant:\n"
3487 << " case ISD::TargetConstantPool:\n"
3488 << " case ISD::TargetFrameIndex:\n"
3489 << " case ISD::TargetJumpTable:\n"
3490 << " case ISD::TargetGlobalAddress: {\n"
3494 << " case ISD::AssertSext:\n"
3495 << " case ISD::AssertZext: {\n"
3496 << " SDOperand Tmp0;\n"
3497 << " Select(Tmp0, N.getOperand(0));\n"
3498 << " if (!N.Val->hasOneUse())\n"
3499 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3500 << "Tmp0.Val, Tmp0.ResNo);\n"
3501 << " Result = Tmp0;\n"
3504 << " case ISD::TokenFactor:\n"
3505 << " if (N.getNumOperands() == 2) {\n"
3506 << " SDOperand Op0, Op1;\n"
3507 << " Select(Op0, N.getOperand(0));\n"
3508 << " Select(Op1, N.getOperand(1));\n"
3510 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);\n"
3511 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3512 << "Result.Val, Result.ResNo);\n"
3514 << " std::vector<SDOperand> Ops;\n"
3515 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i) {\n"
3516 << " SDOperand Val;\n"
3517 << " Select(Val, N.getOperand(i));\n"
3518 << " Ops.push_back(Val);\n"
3521 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
3522 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3523 << "Result.Val, Result.ResNo);\n"
3526 << " case ISD::CopyFromReg: {\n"
3527 << " SDOperand Chain;\n"
3528 << " Select(Chain, N.getOperand(0));\n"
3529 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
3530 << " MVT::ValueType VT = N.Val->getValueType(0);\n"
3531 << " if (N.Val->getNumValues() == 2) {\n"
3532 << " if (Chain == N.getOperand(0)) {\n"
3533 << " Result = N; // No change\n"
3536 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT);\n"
3537 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3539 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3541 << " Result = New.getValue(N.ResNo);\n"
3544 << " SDOperand Flag;\n"
3545 << " if (N.getNumOperands() == 3) Select(Flag, N.getOperand(2));\n"
3546 << " if (Chain == N.getOperand(0) &&\n"
3547 << " (N.getNumOperands() == 2 || Flag == N.getOperand(2))) {\n"
3548 << " Result = N; // No change\n"
3551 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT, Flag);\n"
3552 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3554 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3556 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 2, "
3558 << " Result = New.getValue(N.ResNo);\n"
3562 << " case ISD::CopyToReg: {\n"
3563 << " SDOperand Chain;\n"
3564 << " Select(Chain, N.getOperand(0));\n"
3565 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
3566 << " SDOperand Val;\n"
3567 << " Select(Val, N.getOperand(2));\n"
3569 << " if (N.Val->getNumValues() == 1) {\n"
3570 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2))\n"
3571 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val);\n"
3572 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3573 << "Result.Val, 0);\n"
3575 << " SDOperand Flag(0, 0);\n"
3576 << " if (N.getNumOperands() == 4) Select(Flag, N.getOperand(3));\n"
3577 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2) ||\n"
3578 << " (N.getNumOperands() == 4 && Flag != N.getOperand(3)))\n"
3579 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val, Flag);\n"
3580 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3581 << "Result.Val, 0);\n"
3582 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3583 << "Result.Val, 1);\n"
3584 << " Result = Result.getValue(N.ResNo);\n"
3588 << " case ISD::INLINEASM: Select_INLINEASM(Result, N); return;\n";
3591 // Loop over all of the case statements, emiting a call to each method we
3593 for (std::map<Record*, std::vector<PatternToMatch*>,
3594 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
3595 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
3596 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
3597 OS << " case " << OpcodeInfo.getEnumName() << ": "
3598 << std::string(std::max(0, int(24-OpcodeInfo.getEnumName().size())), ' ')
3599 << "Select_" << PBOI->first->getName() << "(Result, N); return;\n";
3602 OS << " } // end of big switch.\n\n"
3603 << " std::cerr << \"Cannot yet select: \";\n"
3604 << " if (N.getOpcode() != ISD::INTRINSIC_W_CHAIN &&\n"
3605 << " N.getOpcode() != ISD::INTRINSIC_WO_CHAIN &&\n"
3606 << " N.getOpcode() != ISD::INTRINSIC_VOID) {\n"
3607 << " N.Val->dump(CurDAG);\n"
3609 << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
3610 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
3611 << " std::cerr << \"intrinsic %\"<< "
3612 "Intrinsic::getName((Intrinsic::ID)iid);\n"
3614 << " std::cerr << '\\n';\n"
3619 void DAGISelEmitter::run(std::ostream &OS) {
3620 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
3623 OS << "// *** NOTE: This file is #included into the middle of the target\n"
3624 << "// *** instruction selector class. These functions are really "
3627 OS << "#if defined(__GNUC__) && \\\n";
3628 OS << " ((__GNUC__ > 3) || ((__GNUC__ == 3) && (__GNUC_MINOR__ >= 4)))\n";
3629 OS << "#define NOINLINE __attribute__((noinline))\n";
3632 OS << "// Instance var to keep track of multiply used nodes that have \n"
3633 << "// already been selected.\n"
3634 << "std::map<SDOperand, SDOperand> CodeGenMap;\n";
3636 OS << "// Instance var to keep track of mapping of chain generating nodes\n"
3637 << "// and their place handle nodes.\n";
3638 OS << "std::map<SDOperand, SDOperand> HandleMap;\n";
3639 OS << "// Instance var to keep track of mapping of place handle nodes\n"
3640 << "// and their replacement nodes.\n";
3641 OS << "std::map<SDOperand, SDOperand> ReplaceMap;\n";
3642 OS << "// Keep track of nodes that are currently being selecte and therefore\n"
3643 << "// should not be folded.\n";
3644 OS << "std::set<SDNode*> InFlightSet;\n";
3647 OS << "// AddHandleReplacement - Note the pending replacement node for a\n"
3648 << "// handle node in ReplaceMap.\n";
3649 OS << "void AddHandleReplacement(SDNode *H, unsigned HNum, SDNode *R, "
3650 << "unsigned RNum) {\n";
3651 OS << " SDOperand N(H, HNum);\n";
3652 OS << " std::map<SDOperand, SDOperand>::iterator HMI = HandleMap.find(N);\n";
3653 OS << " if (HMI != HandleMap.end()) {\n";
3654 OS << " ReplaceMap[HMI->second] = SDOperand(R, RNum);\n";
3655 OS << " HandleMap.erase(N);\n";
3660 OS << "// SelectDanglingHandles - Select replacements for all `dangling`\n";
3661 OS << "// handles.Some handles do not yet have replacements because the\n";
3662 OS << "// nodes they replacements have only dead readers.\n";
3663 OS << "void SelectDanglingHandles() {\n";
3664 OS << " for (std::map<SDOperand, SDOperand>::iterator I = "
3665 << "HandleMap.begin(),\n"
3666 << " E = HandleMap.end(); I != E; ++I) {\n";
3667 OS << " SDOperand N = I->first;\n";
3668 OS << " SDOperand R;\n";
3669 OS << " Select(R, N.getValue(0));\n";
3670 OS << " AddHandleReplacement(N.Val, N.ResNo, R.Val, R.ResNo);\n";
3674 OS << "// ReplaceHandles - Replace all the handles with the real target\n";
3675 OS << "// specific nodes.\n";
3676 OS << "void ReplaceHandles() {\n";
3677 OS << " for (std::map<SDOperand, SDOperand>::iterator I = "
3678 << "ReplaceMap.begin(),\n"
3679 << " E = ReplaceMap.end(); I != E; ++I) {\n";
3680 OS << " SDOperand From = I->first;\n";
3681 OS << " SDOperand To = I->second;\n";
3682 OS << " for (SDNode::use_iterator UI = From.Val->use_begin(), "
3683 << "E = From.Val->use_end(); UI != E; ++UI) {\n";
3684 OS << " SDNode *Use = *UI;\n";
3685 OS << " std::vector<SDOperand> Ops;\n";
3686 OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i){\n";
3687 OS << " SDOperand O = Use->getOperand(i);\n";
3688 OS << " if (O.Val == From.Val)\n";
3689 OS << " Ops.push_back(To);\n";
3691 OS << " Ops.push_back(O);\n";
3693 OS << " SDOperand U = SDOperand(Use, 0);\n";
3694 OS << " CurDAG->UpdateNodeOperands(U, Ops);\n";
3700 OS << "// SelectRoot - Top level entry to DAG isel.\n";
3701 OS << "SDOperand SelectRoot(SDOperand N) {\n";
3702 OS << " SDOperand ResNode;\n";
3703 OS << " Select(ResNode, N);\n";
3704 OS << " SelectDanglingHandles();\n";
3705 OS << " ReplaceHandles();\n";
3706 OS << " ReplaceMap.clear();\n";
3707 OS << " return ResNode;\n";
3710 Intrinsics = LoadIntrinsics(Records);
3712 ParseNodeTransforms(OS);
3713 ParseComplexPatterns();
3714 ParsePatternFragments(OS);
3715 ParseInstructions();
3718 // Generate variants. For example, commutative patterns can match
3719 // multiple ways. Add them to PatternsToMatch as well.
3723 DEBUG(std::cerr << "\n\nALL PATTERNS TO MATCH:\n\n";
3724 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
3725 std::cerr << "PATTERN: "; PatternsToMatch[i].getSrcPattern()->dump();
3726 std::cerr << "\nRESULT: ";PatternsToMatch[i].getDstPattern()->dump();
3730 // At this point, we have full information about the 'Patterns' we need to
3731 // parse, both implicitly from instructions as well as from explicit pattern
3732 // definitions. Emit the resultant instruction selector.
3733 EmitInstructionSelector(OS);
3735 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
3736 E = PatternFragments.end(); I != E; ++I)
3738 PatternFragments.clear();
3740 Instructions.clear();