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;
439 default: OS << ":" << getTypeNum(0); break;
443 if (getNumChildren() != 0) {
445 getChild(0)->print(OS);
446 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
448 getChild(i)->print(OS);
454 if (!PredicateFn.empty())
455 OS << "<<P:" << PredicateFn << ">>";
457 OS << "<<X:" << TransformFn->getName() << ">>";
458 if (!getName().empty())
459 OS << ":$" << getName();
462 void TreePatternNode::dump() const {
466 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
467 /// the specified node. For this comparison, all of the state of the node
468 /// is considered, except for the assigned name. Nodes with differing names
469 /// that are otherwise identical are considered isomorphic.
470 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N) const {
471 if (N == this) return true;
472 if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
473 getPredicateFn() != N->getPredicateFn() ||
474 getTransformFn() != N->getTransformFn())
478 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue()))
479 if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue()))
480 return DI->getDef() == NDI->getDef();
481 return getLeafValue() == N->getLeafValue();
484 if (N->getOperator() != getOperator() ||
485 N->getNumChildren() != getNumChildren()) return false;
486 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
487 if (!getChild(i)->isIsomorphicTo(N->getChild(i)))
492 /// clone - Make a copy of this tree and all of its children.
494 TreePatternNode *TreePatternNode::clone() const {
495 TreePatternNode *New;
497 New = new TreePatternNode(getLeafValue());
499 std::vector<TreePatternNode*> CChildren;
500 CChildren.reserve(Children.size());
501 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
502 CChildren.push_back(getChild(i)->clone());
503 New = new TreePatternNode(getOperator(), CChildren);
505 New->setName(getName());
506 New->setTypes(getExtTypes());
507 New->setPredicateFn(getPredicateFn());
508 New->setTransformFn(getTransformFn());
512 /// SubstituteFormalArguments - Replace the formal arguments in this tree
513 /// with actual values specified by ArgMap.
514 void TreePatternNode::
515 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
516 if (isLeaf()) return;
518 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
519 TreePatternNode *Child = getChild(i);
520 if (Child->isLeaf()) {
521 Init *Val = Child->getLeafValue();
522 if (dynamic_cast<DefInit*>(Val) &&
523 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
524 // We found a use of a formal argument, replace it with its value.
525 Child = ArgMap[Child->getName()];
526 assert(Child && "Couldn't find formal argument!");
530 getChild(i)->SubstituteFormalArguments(ArgMap);
536 /// InlinePatternFragments - If this pattern refers to any pattern
537 /// fragments, inline them into place, giving us a pattern without any
538 /// PatFrag references.
539 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
540 if (isLeaf()) return this; // nothing to do.
541 Record *Op = getOperator();
543 if (!Op->isSubClassOf("PatFrag")) {
544 // Just recursively inline children nodes.
545 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
546 setChild(i, getChild(i)->InlinePatternFragments(TP));
550 // Otherwise, we found a reference to a fragment. First, look up its
551 // TreePattern record.
552 TreePattern *Frag = TP.getDAGISelEmitter().getPatternFragment(Op);
554 // Verify that we are passing the right number of operands.
555 if (Frag->getNumArgs() != Children.size())
556 TP.error("'" + Op->getName() + "' fragment requires " +
557 utostr(Frag->getNumArgs()) + " operands!");
559 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
561 // Resolve formal arguments to their actual value.
562 if (Frag->getNumArgs()) {
563 // Compute the map of formal to actual arguments.
564 std::map<std::string, TreePatternNode*> ArgMap;
565 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
566 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
568 FragTree->SubstituteFormalArguments(ArgMap);
571 FragTree->setName(getName());
572 FragTree->UpdateNodeType(getExtTypes(), TP);
574 // Get a new copy of this fragment to stitch into here.
575 //delete this; // FIXME: implement refcounting!
579 /// getImplicitType - Check to see if the specified record has an implicit
580 /// type which should be applied to it. This infer the type of register
581 /// references from the register file information, for example.
583 static std::vector<unsigned char> getImplicitType(Record *R, bool NotRegisters,
585 // Some common return values
586 std::vector<unsigned char> Unknown(1, MVT::isUnknown);
587 std::vector<unsigned char> Other(1, MVT::Other);
589 // Check to see if this is a register or a register class...
590 if (R->isSubClassOf("RegisterClass")) {
593 const CodeGenRegisterClass &RC =
594 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(R);
595 return ConvertVTs(RC.getValueTypes());
596 } else if (R->isSubClassOf("PatFrag")) {
597 // Pattern fragment types will be resolved when they are inlined.
599 } else if (R->isSubClassOf("Register")) {
602 const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
603 return T.getRegisterVTs(R);
604 } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
605 // Using a VTSDNode or CondCodeSDNode.
607 } else if (R->isSubClassOf("ComplexPattern")) {
610 std::vector<unsigned char>
611 ComplexPat(1, TP.getDAGISelEmitter().getComplexPattern(R).getValueType());
613 } else if (R->getName() == "node" || R->getName() == "srcvalue") {
618 TP.error("Unknown node flavor used in pattern: " + R->getName());
622 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
623 /// this node and its children in the tree. This returns true if it makes a
624 /// change, false otherwise. If a type contradiction is found, throw an
626 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
627 DAGISelEmitter &ISE = TP.getDAGISelEmitter();
629 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
630 // If it's a regclass or something else known, include the type.
631 return UpdateNodeType(getImplicitType(DI->getDef(), NotRegisters, TP),TP);
632 } else if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
633 // Int inits are always integers. :)
634 bool MadeChange = UpdateNodeType(MVT::isInt, TP);
637 // At some point, it may make sense for this tree pattern to have
638 // multiple types. Assert here that it does not, so we revisit this
639 // code when appropriate.
640 assert(getExtTypes().size() >= 1 && "TreePattern doesn't have a type!");
641 MVT::ValueType VT = getTypeNum(0);
642 for (unsigned i = 1, e = getExtTypes().size(); i != e; ++i)
643 assert(getTypeNum(i) == VT && "TreePattern has too many types!");
646 if (VT != MVT::iPTR) {
647 unsigned Size = MVT::getSizeInBits(VT);
648 // Make sure that the value is representable for this type.
650 int Val = (II->getValue() << (32-Size)) >> (32-Size);
651 if (Val != II->getValue())
652 TP.error("Sign-extended integer value '" + itostr(II->getValue())+
653 "' is out of range for type '" +
654 getEnumName(getTypeNum(0)) + "'!");
664 // special handling for set, which isn't really an SDNode.
665 if (getOperator()->getName() == "set") {
666 assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!");
667 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
668 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
670 // Types of operands must match.
671 MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtTypes(), TP);
672 MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtTypes(), TP);
673 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
675 } else if (getOperator() == ISE.get_intrinsic_void_sdnode() ||
676 getOperator() == ISE.get_intrinsic_w_chain_sdnode() ||
677 getOperator() == ISE.get_intrinsic_wo_chain_sdnode()) {
679 dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
680 const CodeGenIntrinsic &Int = ISE.getIntrinsicInfo(IID);
681 bool MadeChange = false;
683 // Apply the result type to the node.
684 MadeChange = UpdateNodeType(Int.ArgVTs[0], TP);
686 if (getNumChildren() != Int.ArgVTs.size())
687 TP.error("Intrinsic '" + Int.Name + "' expects " +
688 utostr(Int.ArgVTs.size()-1) + " operands, not " +
689 utostr(getNumChildren()-1) + " operands!");
691 // Apply type info to the intrinsic ID.
692 MadeChange |= getChild(0)->UpdateNodeType(MVT::iPTR, TP);
694 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
695 MVT::ValueType OpVT = Int.ArgVTs[i];
696 MadeChange |= getChild(i)->UpdateNodeType(OpVT, TP);
697 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
700 } else if (getOperator()->isSubClassOf("SDNode")) {
701 const SDNodeInfo &NI = ISE.getSDNodeInfo(getOperator());
703 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
704 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
705 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
706 // Branch, etc. do not produce results and top-level forms in instr pattern
707 // must have void types.
708 if (NI.getNumResults() == 0)
709 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
711 // If this is a vector_shuffle operation, apply types to the build_vector
712 // operation. The types of the integers don't matter, but this ensures they
713 // won't get checked.
714 if (getOperator()->getName() == "vector_shuffle" &&
715 getChild(2)->getOperator()->getName() == "build_vector") {
716 TreePatternNode *BV = getChild(2);
717 const std::vector<MVT::ValueType> &LegalVTs
718 = ISE.getTargetInfo().getLegalValueTypes();
719 MVT::ValueType LegalIntVT = MVT::Other;
720 for (unsigned i = 0, e = LegalVTs.size(); i != e; ++i)
721 if (MVT::isInteger(LegalVTs[i]) && !MVT::isVector(LegalVTs[i])) {
722 LegalIntVT = LegalVTs[i];
725 assert(LegalIntVT != MVT::Other && "No legal integer VT?");
727 for (unsigned i = 0, e = BV->getNumChildren(); i != e; ++i)
728 MadeChange |= BV->getChild(i)->UpdateNodeType(LegalIntVT, TP);
731 } else if (getOperator()->isSubClassOf("Instruction")) {
732 const DAGInstruction &Inst = ISE.getInstruction(getOperator());
733 bool MadeChange = false;
734 unsigned NumResults = Inst.getNumResults();
736 assert(NumResults <= 1 &&
737 "Only supports zero or one result instrs!");
738 // Apply the result type to the node
739 if (NumResults == 0) {
740 MadeChange = UpdateNodeType(MVT::isVoid, TP);
742 Record *ResultNode = Inst.getResult(0);
743 assert(ResultNode->isSubClassOf("RegisterClass") &&
744 "Operands should be register classes!");
746 const CodeGenRegisterClass &RC =
747 ISE.getTargetInfo().getRegisterClass(ResultNode);
748 MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
751 if (getNumChildren() != Inst.getNumOperands())
752 TP.error("Instruction '" + getOperator()->getName() + " expects " +
753 utostr(Inst.getNumOperands()) + " operands, not " +
754 utostr(getNumChildren()) + " operands!");
755 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
756 Record *OperandNode = Inst.getOperand(i);
758 if (OperandNode->isSubClassOf("RegisterClass")) {
759 const CodeGenRegisterClass &RC =
760 ISE.getTargetInfo().getRegisterClass(OperandNode);
761 //VT = RC.getValueTypeNum(0);
762 MadeChange |=getChild(i)->UpdateNodeType(ConvertVTs(RC.getValueTypes()),
764 } else if (OperandNode->isSubClassOf("Operand")) {
765 VT = getValueType(OperandNode->getValueAsDef("Type"));
766 MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
768 assert(0 && "Unknown operand type!");
771 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
775 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
777 // Node transforms always take one operand.
778 if (getNumChildren() != 1)
779 TP.error("Node transform '" + getOperator()->getName() +
780 "' requires one operand!");
782 // If either the output or input of the xform does not have exact
783 // type info. We assume they must be the same. Otherwise, it is perfectly
784 // legal to transform from one type to a completely different type.
785 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
786 bool MadeChange = UpdateNodeType(getChild(0)->getExtTypes(), TP);
787 MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), TP);
794 /// canPatternMatch - If it is impossible for this pattern to match on this
795 /// target, fill in Reason and return false. Otherwise, return true. This is
796 /// used as a santity check for .td files (to prevent people from writing stuff
797 /// that can never possibly work), and to prevent the pattern permuter from
798 /// generating stuff that is useless.
799 bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){
800 if (isLeaf()) return true;
802 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
803 if (!getChild(i)->canPatternMatch(Reason, ISE))
806 // If this is an intrinsic, handle cases that would make it not match. For
807 // example, if an operand is required to be an immediate.
808 if (getOperator()->isSubClassOf("Intrinsic")) {
813 // If this node is a commutative operator, check that the LHS isn't an
815 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
816 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
817 // Scan all of the operands of the node and make sure that only the last one
818 // is a constant node.
819 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i)
820 if (!getChild(i)->isLeaf() &&
821 getChild(i)->getOperator()->getName() == "imm") {
822 Reason = "Immediate value must be on the RHS of commutative operators!";
830 //===----------------------------------------------------------------------===//
831 // TreePattern implementation
834 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
835 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
836 isInputPattern = isInput;
837 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
838 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
841 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
842 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
843 isInputPattern = isInput;
844 Trees.push_back(ParseTreePattern(Pat));
847 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
848 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
849 isInputPattern = isInput;
850 Trees.push_back(Pat);
855 void TreePattern::error(const std::string &Msg) const {
857 throw "In " + TheRecord->getName() + ": " + Msg;
860 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
861 DefInit *OpDef = dynamic_cast<DefInit*>(Dag->getOperator());
862 if (!OpDef) error("Pattern has unexpected operator type!");
863 Record *Operator = OpDef->getDef();
865 if (Operator->isSubClassOf("ValueType")) {
866 // If the operator is a ValueType, then this must be "type cast" of a leaf
868 if (Dag->getNumArgs() != 1)
869 error("Type cast only takes one operand!");
871 Init *Arg = Dag->getArg(0);
872 TreePatternNode *New;
873 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
874 Record *R = DI->getDef();
875 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
876 Dag->setArg(0, new DagInit(DI,
877 std::vector<std::pair<Init*, std::string> >()));
878 return ParseTreePattern(Dag);
880 New = new TreePatternNode(DI);
881 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
882 New = ParseTreePattern(DI);
883 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
884 New = new TreePatternNode(II);
885 if (!Dag->getArgName(0).empty())
886 error("Constant int argument should not have a name!");
887 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
888 // Turn this into an IntInit.
889 Init *II = BI->convertInitializerTo(new IntRecTy());
890 if (II == 0 || !dynamic_cast<IntInit*>(II))
891 error("Bits value must be constants!");
893 New = new TreePatternNode(dynamic_cast<IntInit*>(II));
894 if (!Dag->getArgName(0).empty())
895 error("Constant int argument should not have a name!");
898 error("Unknown leaf value for tree pattern!");
902 // Apply the type cast.
903 New->UpdateNodeType(getValueType(Operator), *this);
904 New->setName(Dag->getArgName(0));
908 // Verify that this is something that makes sense for an operator.
909 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
910 !Operator->isSubClassOf("Instruction") &&
911 !Operator->isSubClassOf("SDNodeXForm") &&
912 !Operator->isSubClassOf("Intrinsic") &&
913 Operator->getName() != "set")
914 error("Unrecognized node '" + Operator->getName() + "'!");
916 // Check to see if this is something that is illegal in an input pattern.
917 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
918 Operator->isSubClassOf("SDNodeXForm")))
919 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
921 std::vector<TreePatternNode*> Children;
923 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
924 Init *Arg = Dag->getArg(i);
925 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
926 Children.push_back(ParseTreePattern(DI));
927 if (Children.back()->getName().empty())
928 Children.back()->setName(Dag->getArgName(i));
929 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
930 Record *R = DefI->getDef();
931 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
932 // TreePatternNode if its own.
933 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
934 Dag->setArg(i, new DagInit(DefI,
935 std::vector<std::pair<Init*, std::string> >()));
936 --i; // Revisit this node...
938 TreePatternNode *Node = new TreePatternNode(DefI);
939 Node->setName(Dag->getArgName(i));
940 Children.push_back(Node);
943 if (R->getName() == "node") {
944 if (Dag->getArgName(i).empty())
945 error("'node' argument requires a name to match with operand list");
946 Args.push_back(Dag->getArgName(i));
949 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
950 TreePatternNode *Node = new TreePatternNode(II);
951 if (!Dag->getArgName(i).empty())
952 error("Constant int argument should not have a name!");
953 Children.push_back(Node);
954 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
955 // Turn this into an IntInit.
956 Init *II = BI->convertInitializerTo(new IntRecTy());
957 if (II == 0 || !dynamic_cast<IntInit*>(II))
958 error("Bits value must be constants!");
960 TreePatternNode *Node = new TreePatternNode(dynamic_cast<IntInit*>(II));
961 if (!Dag->getArgName(i).empty())
962 error("Constant int argument should not have a name!");
963 Children.push_back(Node);
968 error("Unknown leaf value for tree pattern!");
972 // If the operator is an intrinsic, then this is just syntactic sugar for for
973 // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
974 // convert the intrinsic name to a number.
975 if (Operator->isSubClassOf("Intrinsic")) {
976 const CodeGenIntrinsic &Int = getDAGISelEmitter().getIntrinsic(Operator);
977 unsigned IID = getDAGISelEmitter().getIntrinsicID(Operator)+1;
979 // If this intrinsic returns void, it must have side-effects and thus a
981 if (Int.ArgVTs[0] == MVT::isVoid) {
982 Operator = getDAGISelEmitter().get_intrinsic_void_sdnode();
983 } else if (Int.ModRef != CodeGenIntrinsic::NoMem) {
984 // Has side-effects, requires chain.
985 Operator = getDAGISelEmitter().get_intrinsic_w_chain_sdnode();
987 // Otherwise, no chain.
988 Operator = getDAGISelEmitter().get_intrinsic_wo_chain_sdnode();
991 TreePatternNode *IIDNode = new TreePatternNode(new IntInit(IID));
992 Children.insert(Children.begin(), IIDNode);
995 return new TreePatternNode(Operator, Children);
998 /// InferAllTypes - Infer/propagate as many types throughout the expression
999 /// patterns as possible. Return true if all types are infered, false
1000 /// otherwise. Throw an exception if a type contradiction is found.
1001 bool TreePattern::InferAllTypes() {
1002 bool MadeChange = true;
1003 while (MadeChange) {
1005 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1006 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
1009 bool HasUnresolvedTypes = false;
1010 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1011 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
1012 return !HasUnresolvedTypes;
1015 void TreePattern::print(std::ostream &OS) const {
1016 OS << getRecord()->getName();
1017 if (!Args.empty()) {
1018 OS << "(" << Args[0];
1019 for (unsigned i = 1, e = Args.size(); i != e; ++i)
1020 OS << ", " << Args[i];
1025 if (Trees.size() > 1)
1027 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
1029 Trees[i]->print(OS);
1033 if (Trees.size() > 1)
1037 void TreePattern::dump() const { print(std::cerr); }
1041 //===----------------------------------------------------------------------===//
1042 // DAGISelEmitter implementation
1045 // Parse all of the SDNode definitions for the target, populating SDNodes.
1046 void DAGISelEmitter::ParseNodeInfo() {
1047 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
1048 while (!Nodes.empty()) {
1049 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
1053 // Get the buildin intrinsic nodes.
1054 intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
1055 intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
1056 intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
1059 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
1060 /// map, and emit them to the file as functions.
1061 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
1062 OS << "\n// Node transformations.\n";
1063 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
1064 while (!Xforms.empty()) {
1065 Record *XFormNode = Xforms.back();
1066 Record *SDNode = XFormNode->getValueAsDef("Opcode");
1067 std::string Code = XFormNode->getValueAsCode("XFormFunction");
1068 SDNodeXForms.insert(std::make_pair(XFormNode,
1069 std::make_pair(SDNode, Code)));
1071 if (!Code.empty()) {
1072 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
1073 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
1075 OS << "inline SDOperand Transform_" << XFormNode->getName()
1076 << "(SDNode *" << C2 << ") {\n";
1077 if (ClassName != "SDNode")
1078 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
1079 OS << Code << "\n}\n";
1086 void DAGISelEmitter::ParseComplexPatterns() {
1087 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
1088 while (!AMs.empty()) {
1089 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
1095 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
1096 /// file, building up the PatternFragments map. After we've collected them all,
1097 /// inline fragments together as necessary, so that there are no references left
1098 /// inside a pattern fragment to a pattern fragment.
1100 /// This also emits all of the predicate functions to the output file.
1102 void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) {
1103 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
1105 // First step, parse all of the fragments and emit predicate functions.
1106 OS << "\n// Predicate functions.\n";
1107 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1108 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
1109 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
1110 PatternFragments[Fragments[i]] = P;
1112 // Validate the argument list, converting it to map, to discard duplicates.
1113 std::vector<std::string> &Args = P->getArgList();
1114 std::set<std::string> OperandsMap(Args.begin(), Args.end());
1116 if (OperandsMap.count(""))
1117 P->error("Cannot have unnamed 'node' values in pattern fragment!");
1119 // Parse the operands list.
1120 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
1121 DefInit *OpsOp = dynamic_cast<DefInit*>(OpsList->getOperator());
1122 if (!OpsOp || OpsOp->getDef()->getName() != "ops")
1123 P->error("Operands list should start with '(ops ... '!");
1125 // Copy over the arguments.
1127 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
1128 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
1129 static_cast<DefInit*>(OpsList->getArg(j))->
1130 getDef()->getName() != "node")
1131 P->error("Operands list should all be 'node' values.");
1132 if (OpsList->getArgName(j).empty())
1133 P->error("Operands list should have names for each operand!");
1134 if (!OperandsMap.count(OpsList->getArgName(j)))
1135 P->error("'" + OpsList->getArgName(j) +
1136 "' does not occur in pattern or was multiply specified!");
1137 OperandsMap.erase(OpsList->getArgName(j));
1138 Args.push_back(OpsList->getArgName(j));
1141 if (!OperandsMap.empty())
1142 P->error("Operands list does not contain an entry for operand '" +
1143 *OperandsMap.begin() + "'!");
1145 // If there is a code init for this fragment, emit the predicate code and
1146 // keep track of the fact that this fragment uses it.
1147 std::string Code = Fragments[i]->getValueAsCode("Predicate");
1148 if (!Code.empty()) {
1149 assert(!P->getOnlyTree()->isLeaf() && "Can't be a leaf!");
1150 std::string ClassName =
1151 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
1152 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
1154 OS << "inline bool Predicate_" << Fragments[i]->getName()
1155 << "(SDNode *" << C2 << ") {\n";
1156 if (ClassName != "SDNode")
1157 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
1158 OS << Code << "\n}\n";
1159 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
1162 // If there is a node transformation corresponding to this, keep track of
1164 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
1165 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
1166 P->getOnlyTree()->setTransformFn(Transform);
1171 // Now that we've parsed all of the tree fragments, do a closure on them so
1172 // that there are not references to PatFrags left inside of them.
1173 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
1174 E = PatternFragments.end(); I != E; ++I) {
1175 TreePattern *ThePat = I->second;
1176 ThePat->InlinePatternFragments();
1178 // Infer as many types as possible. Don't worry about it if we don't infer
1179 // all of them, some may depend on the inputs of the pattern.
1181 ThePat->InferAllTypes();
1183 // If this pattern fragment is not supported by this target (no types can
1184 // satisfy its constraints), just ignore it. If the bogus pattern is
1185 // actually used by instructions, the type consistency error will be
1189 // If debugging, print out the pattern fragment result.
1190 DEBUG(ThePat->dump());
1194 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1195 /// instruction input. Return true if this is a real use.
1196 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1197 std::map<std::string, TreePatternNode*> &InstInputs,
1198 std::vector<Record*> &InstImpInputs) {
1199 // No name -> not interesting.
1200 if (Pat->getName().empty()) {
1201 if (Pat->isLeaf()) {
1202 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1203 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1204 I->error("Input " + DI->getDef()->getName() + " must be named!");
1205 else if (DI && DI->getDef()->isSubClassOf("Register"))
1206 InstImpInputs.push_back(DI->getDef());
1212 if (Pat->isLeaf()) {
1213 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1214 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1217 assert(Pat->getNumChildren() == 0 && "can't be a use with children!");
1218 Rec = Pat->getOperator();
1221 // SRCVALUE nodes are ignored.
1222 if (Rec->getName() == "srcvalue")
1225 TreePatternNode *&Slot = InstInputs[Pat->getName()];
1230 if (Slot->isLeaf()) {
1231 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1233 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1234 SlotRec = Slot->getOperator();
1237 // Ensure that the inputs agree if we've already seen this input.
1239 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1240 if (Slot->getExtTypes() != Pat->getExtTypes())
1241 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1246 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1247 /// part of "I", the instruction), computing the set of inputs and outputs of
1248 /// the pattern. Report errors if we see anything naughty.
1249 void DAGISelEmitter::
1250 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1251 std::map<std::string, TreePatternNode*> &InstInputs,
1252 std::map<std::string, TreePatternNode*>&InstResults,
1253 std::vector<Record*> &InstImpInputs,
1254 std::vector<Record*> &InstImpResults) {
1255 if (Pat->isLeaf()) {
1256 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1257 if (!isUse && Pat->getTransformFn())
1258 I->error("Cannot specify a transform function for a non-input value!");
1260 } else if (Pat->getOperator()->getName() != "set") {
1261 // If this is not a set, verify that the children nodes are not void typed,
1263 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1264 if (Pat->getChild(i)->getExtTypeNum(0) == MVT::isVoid)
1265 I->error("Cannot have void nodes inside of patterns!");
1266 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
1267 InstImpInputs, InstImpResults);
1270 // If this is a non-leaf node with no children, treat it basically as if
1271 // it were a leaf. This handles nodes like (imm).
1273 if (Pat->getNumChildren() == 0)
1274 isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1276 if (!isUse && Pat->getTransformFn())
1277 I->error("Cannot specify a transform function for a non-input value!");
1281 // Otherwise, this is a set, validate and collect instruction results.
1282 if (Pat->getNumChildren() == 0)
1283 I->error("set requires operands!");
1284 else if (Pat->getNumChildren() & 1)
1285 I->error("set requires an even number of operands");
1287 if (Pat->getTransformFn())
1288 I->error("Cannot specify a transform function on a set node!");
1290 // Check the set destinations.
1291 unsigned NumValues = Pat->getNumChildren()/2;
1292 for (unsigned i = 0; i != NumValues; ++i) {
1293 TreePatternNode *Dest = Pat->getChild(i);
1294 if (!Dest->isLeaf())
1295 I->error("set destination should be a register!");
1297 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1299 I->error("set destination should be a register!");
1301 if (Val->getDef()->isSubClassOf("RegisterClass")) {
1302 if (Dest->getName().empty())
1303 I->error("set destination must have a name!");
1304 if (InstResults.count(Dest->getName()))
1305 I->error("cannot set '" + Dest->getName() +"' multiple times");
1306 InstResults[Dest->getName()] = Dest;
1307 } else if (Val->getDef()->isSubClassOf("Register")) {
1308 InstImpResults.push_back(Val->getDef());
1310 I->error("set destination should be a register!");
1313 // Verify and collect info from the computation.
1314 FindPatternInputsAndOutputs(I, Pat->getChild(i+NumValues),
1315 InstInputs, InstResults,
1316 InstImpInputs, InstImpResults);
1320 /// ParseInstructions - Parse all of the instructions, inlining and resolving
1321 /// any fragments involved. This populates the Instructions list with fully
1322 /// resolved instructions.
1323 void DAGISelEmitter::ParseInstructions() {
1324 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1326 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1329 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1330 LI = Instrs[i]->getValueAsListInit("Pattern");
1332 // If there is no pattern, only collect minimal information about the
1333 // instruction for its operand list. We have to assume that there is one
1334 // result, as we have no detailed info.
1335 if (!LI || LI->getSize() == 0) {
1336 std::vector<Record*> Results;
1337 std::vector<Record*> Operands;
1339 CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1341 if (InstInfo.OperandList.size() != 0) {
1342 // FIXME: temporary hack...
1343 if (InstInfo.noResults) {
1344 // These produce no results
1345 for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
1346 Operands.push_back(InstInfo.OperandList[j].Rec);
1348 // Assume the first operand is the result.
1349 Results.push_back(InstInfo.OperandList[0].Rec);
1351 // The rest are inputs.
1352 for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
1353 Operands.push_back(InstInfo.OperandList[j].Rec);
1357 // Create and insert the instruction.
1358 std::vector<Record*> ImpResults;
1359 std::vector<Record*> ImpOperands;
1360 Instructions.insert(std::make_pair(Instrs[i],
1361 DAGInstruction(0, Results, Operands, ImpResults,
1363 continue; // no pattern.
1366 // Parse the instruction.
1367 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1368 // Inline pattern fragments into it.
1369 I->InlinePatternFragments();
1371 // Infer as many types as possible. If we cannot infer all of them, we can
1372 // never do anything with this instruction pattern: report it to the user.
1373 if (!I->InferAllTypes())
1374 I->error("Could not infer all types in pattern!");
1376 // InstInputs - Keep track of all of the inputs of the instruction, along
1377 // with the record they are declared as.
1378 std::map<std::string, TreePatternNode*> InstInputs;
1380 // InstResults - Keep track of all the virtual registers that are 'set'
1381 // in the instruction, including what reg class they are.
1382 std::map<std::string, TreePatternNode*> InstResults;
1384 std::vector<Record*> InstImpInputs;
1385 std::vector<Record*> InstImpResults;
1387 // Verify that the top-level forms in the instruction are of void type, and
1388 // fill in the InstResults map.
1389 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1390 TreePatternNode *Pat = I->getTree(j);
1391 if (Pat->getExtTypeNum(0) != MVT::isVoid)
1392 I->error("Top-level forms in instruction pattern should have"
1395 // Find inputs and outputs, and verify the structure of the uses/defs.
1396 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
1397 InstImpInputs, InstImpResults);
1400 // Now that we have inputs and outputs of the pattern, inspect the operands
1401 // list for the instruction. This determines the order that operands are
1402 // added to the machine instruction the node corresponds to.
1403 unsigned NumResults = InstResults.size();
1405 // Parse the operands list from the (ops) list, validating it.
1406 std::vector<std::string> &Args = I->getArgList();
1407 assert(Args.empty() && "Args list should still be empty here!");
1408 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1410 // Check that all of the results occur first in the list.
1411 std::vector<Record*> Results;
1412 TreePatternNode *Res0Node = NULL;
1413 for (unsigned i = 0; i != NumResults; ++i) {
1414 if (i == CGI.OperandList.size())
1415 I->error("'" + InstResults.begin()->first +
1416 "' set but does not appear in operand list!");
1417 const std::string &OpName = CGI.OperandList[i].Name;
1419 // Check that it exists in InstResults.
1420 TreePatternNode *RNode = InstResults[OpName];
1422 I->error("Operand $" + OpName + " does not exist in operand list!");
1426 Record *R = dynamic_cast<DefInit*>(RNode->getLeafValue())->getDef();
1428 I->error("Operand $" + OpName + " should be a set destination: all "
1429 "outputs must occur before inputs in operand list!");
1431 if (CGI.OperandList[i].Rec != R)
1432 I->error("Operand $" + OpName + " class mismatch!");
1434 // Remember the return type.
1435 Results.push_back(CGI.OperandList[i].Rec);
1437 // Okay, this one checks out.
1438 InstResults.erase(OpName);
1441 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
1442 // the copy while we're checking the inputs.
1443 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
1445 std::vector<TreePatternNode*> ResultNodeOperands;
1446 std::vector<Record*> Operands;
1447 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
1448 const std::string &OpName = CGI.OperandList[i].Name;
1450 I->error("Operand #" + utostr(i) + " in operands list has no name!");
1452 if (!InstInputsCheck.count(OpName))
1453 I->error("Operand $" + OpName +
1454 " does not appear in the instruction pattern");
1455 TreePatternNode *InVal = InstInputsCheck[OpName];
1456 InstInputsCheck.erase(OpName); // It occurred, remove from map.
1458 if (InVal->isLeaf() &&
1459 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
1460 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
1461 if (CGI.OperandList[i].Rec != InRec &&
1462 !InRec->isSubClassOf("ComplexPattern"))
1463 I->error("Operand $" + OpName + "'s register class disagrees"
1464 " between the operand and pattern");
1466 Operands.push_back(CGI.OperandList[i].Rec);
1468 // Construct the result for the dest-pattern operand list.
1469 TreePatternNode *OpNode = InVal->clone();
1471 // No predicate is useful on the result.
1472 OpNode->setPredicateFn("");
1474 // Promote the xform function to be an explicit node if set.
1475 if (Record *Xform = OpNode->getTransformFn()) {
1476 OpNode->setTransformFn(0);
1477 std::vector<TreePatternNode*> Children;
1478 Children.push_back(OpNode);
1479 OpNode = new TreePatternNode(Xform, Children);
1482 ResultNodeOperands.push_back(OpNode);
1485 if (!InstInputsCheck.empty())
1486 I->error("Input operand $" + InstInputsCheck.begin()->first +
1487 " occurs in pattern but not in operands list!");
1489 TreePatternNode *ResultPattern =
1490 new TreePatternNode(I->getRecord(), ResultNodeOperands);
1491 // Copy fully inferred output node type to instruction result pattern.
1493 ResultPattern->setTypes(Res0Node->getExtTypes());
1495 // Create and insert the instruction.
1496 DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
1497 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
1499 // Use a temporary tree pattern to infer all types and make sure that the
1500 // constructed result is correct. This depends on the instruction already
1501 // being inserted into the Instructions map.
1502 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
1503 Temp.InferAllTypes();
1505 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
1506 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
1511 // If we can, convert the instructions to be patterns that are matched!
1512 for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
1513 E = Instructions.end(); II != E; ++II) {
1514 DAGInstruction &TheInst = II->second;
1515 TreePattern *I = TheInst.getPattern();
1516 if (I == 0) continue; // No pattern.
1518 if (I->getNumTrees() != 1) {
1519 std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
1522 TreePatternNode *Pattern = I->getTree(0);
1523 TreePatternNode *SrcPattern;
1524 if (Pattern->getOperator()->getName() == "set") {
1525 if (Pattern->getNumChildren() != 2)
1526 continue; // Not a set of a single value (not handled so far)
1528 SrcPattern = Pattern->getChild(1)->clone();
1530 // Not a set (store or something?)
1531 SrcPattern = Pattern;
1535 if (!SrcPattern->canPatternMatch(Reason, *this))
1536 I->error("Instruction can never match: " + Reason);
1538 Record *Instr = II->first;
1539 TreePatternNode *DstPattern = TheInst.getResultPattern();
1541 push_back(PatternToMatch(Instr->getValueAsListInit("Predicates"),
1542 SrcPattern, DstPattern,
1543 Instr->getValueAsInt("AddedComplexity")));
1547 void DAGISelEmitter::ParsePatterns() {
1548 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
1550 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1551 DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
1552 TreePattern *Pattern = new TreePattern(Patterns[i], Tree, true, *this);
1554 // Inline pattern fragments into it.
1555 Pattern->InlinePatternFragments();
1557 ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
1558 if (LI->getSize() == 0) continue; // no pattern.
1560 // Parse the instruction.
1561 TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
1563 // Inline pattern fragments into it.
1564 Result->InlinePatternFragments();
1566 if (Result->getNumTrees() != 1)
1567 Result->error("Cannot handle instructions producing instructions "
1568 "with temporaries yet!");
1570 bool IterateInference;
1571 bool InferredAllPatternTypes, InferredAllResultTypes;
1573 // Infer as many types as possible. If we cannot infer all of them, we
1574 // can never do anything with this pattern: report it to the user.
1575 InferredAllPatternTypes = Pattern->InferAllTypes();
1577 // Infer as many types as possible. If we cannot infer all of them, we can
1578 // never do anything with this pattern: report it to the user.
1579 InferredAllResultTypes = Result->InferAllTypes();
1581 // Apply the type of the result to the source pattern. This helps us
1582 // resolve cases where the input type is known to be a pointer type (which
1583 // is considered resolved), but the result knows it needs to be 32- or
1584 // 64-bits. Infer the other way for good measure.
1585 IterateInference = Pattern->getOnlyTree()->
1586 UpdateNodeType(Result->getOnlyTree()->getExtTypes(), *Result);
1587 IterateInference |= Result->getOnlyTree()->
1588 UpdateNodeType(Pattern->getOnlyTree()->getExtTypes(), *Result);
1589 } while (IterateInference);
1591 // Verify that we inferred enough types that we can do something with the
1592 // pattern and result. If these fire the user has to add type casts.
1593 if (!InferredAllPatternTypes)
1594 Pattern->error("Could not infer all types in pattern!");
1595 if (!InferredAllResultTypes)
1596 Result->error("Could not infer all types in pattern result!");
1598 // Validate that the input pattern is correct.
1600 std::map<std::string, TreePatternNode*> InstInputs;
1601 std::map<std::string, TreePatternNode*> InstResults;
1602 std::vector<Record*> InstImpInputs;
1603 std::vector<Record*> InstImpResults;
1604 FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(),
1605 InstInputs, InstResults,
1606 InstImpInputs, InstImpResults);
1609 // Promote the xform function to be an explicit node if set.
1610 std::vector<TreePatternNode*> ResultNodeOperands;
1611 TreePatternNode *DstPattern = Result->getOnlyTree();
1612 for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
1613 TreePatternNode *OpNode = DstPattern->getChild(ii);
1614 if (Record *Xform = OpNode->getTransformFn()) {
1615 OpNode->setTransformFn(0);
1616 std::vector<TreePatternNode*> Children;
1617 Children.push_back(OpNode);
1618 OpNode = new TreePatternNode(Xform, Children);
1620 ResultNodeOperands.push_back(OpNode);
1622 DstPattern = Result->getOnlyTree();
1623 if (!DstPattern->isLeaf())
1624 DstPattern = new TreePatternNode(DstPattern->getOperator(),
1625 ResultNodeOperands);
1626 DstPattern->setTypes(Result->getOnlyTree()->getExtTypes());
1627 TreePattern Temp(Result->getRecord(), DstPattern, false, *this);
1628 Temp.InferAllTypes();
1631 if (!Pattern->getOnlyTree()->canPatternMatch(Reason, *this))
1632 Pattern->error("Pattern can never match: " + Reason);
1635 push_back(PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"),
1636 Pattern->getOnlyTree(),
1638 Patterns[i]->getValueAsInt("AddedComplexity")));
1642 /// CombineChildVariants - Given a bunch of permutations of each child of the
1643 /// 'operator' node, put them together in all possible ways.
1644 static void CombineChildVariants(TreePatternNode *Orig,
1645 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
1646 std::vector<TreePatternNode*> &OutVariants,
1647 DAGISelEmitter &ISE) {
1648 // Make sure that each operand has at least one variant to choose from.
1649 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1650 if (ChildVariants[i].empty())
1653 // The end result is an all-pairs construction of the resultant pattern.
1654 std::vector<unsigned> Idxs;
1655 Idxs.resize(ChildVariants.size());
1656 bool NotDone = true;
1658 // Create the variant and add it to the output list.
1659 std::vector<TreePatternNode*> NewChildren;
1660 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1661 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
1662 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
1664 // Copy over properties.
1665 R->setName(Orig->getName());
1666 R->setPredicateFn(Orig->getPredicateFn());
1667 R->setTransformFn(Orig->getTransformFn());
1668 R->setTypes(Orig->getExtTypes());
1670 // If this pattern cannot every match, do not include it as a variant.
1671 std::string ErrString;
1672 if (!R->canPatternMatch(ErrString, ISE)) {
1675 bool AlreadyExists = false;
1677 // Scan to see if this pattern has already been emitted. We can get
1678 // duplication due to things like commuting:
1679 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
1680 // which are the same pattern. Ignore the dups.
1681 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
1682 if (R->isIsomorphicTo(OutVariants[i])) {
1683 AlreadyExists = true;
1690 OutVariants.push_back(R);
1693 // Increment indices to the next permutation.
1695 // Look for something we can increment without causing a wrap-around.
1696 for (unsigned IdxsIdx = 0; IdxsIdx != Idxs.size(); ++IdxsIdx) {
1697 if (++Idxs[IdxsIdx] < ChildVariants[IdxsIdx].size()) {
1698 NotDone = true; // Found something to increment.
1706 /// CombineChildVariants - A helper function for binary operators.
1708 static void CombineChildVariants(TreePatternNode *Orig,
1709 const std::vector<TreePatternNode*> &LHS,
1710 const std::vector<TreePatternNode*> &RHS,
1711 std::vector<TreePatternNode*> &OutVariants,
1712 DAGISelEmitter &ISE) {
1713 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1714 ChildVariants.push_back(LHS);
1715 ChildVariants.push_back(RHS);
1716 CombineChildVariants(Orig, ChildVariants, OutVariants, ISE);
1720 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
1721 std::vector<TreePatternNode *> &Children) {
1722 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
1723 Record *Operator = N->getOperator();
1725 // Only permit raw nodes.
1726 if (!N->getName().empty() || !N->getPredicateFn().empty() ||
1727 N->getTransformFn()) {
1728 Children.push_back(N);
1732 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
1733 Children.push_back(N->getChild(0));
1735 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
1737 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
1738 Children.push_back(N->getChild(1));
1740 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
1743 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
1744 /// the (potentially recursive) pattern by using algebraic laws.
1746 static void GenerateVariantsOf(TreePatternNode *N,
1747 std::vector<TreePatternNode*> &OutVariants,
1748 DAGISelEmitter &ISE) {
1749 // We cannot permute leaves.
1751 OutVariants.push_back(N);
1755 // Look up interesting info about the node.
1756 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1758 // If this node is associative, reassociate.
1759 if (NodeInfo.hasProperty(SDNodeInfo::SDNPAssociative)) {
1760 // Reassociate by pulling together all of the linked operators
1761 std::vector<TreePatternNode*> MaximalChildren;
1762 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
1764 // Only handle child sizes of 3. Otherwise we'll end up trying too many
1766 if (MaximalChildren.size() == 3) {
1767 // Find the variants of all of our maximal children.
1768 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
1769 GenerateVariantsOf(MaximalChildren[0], AVariants, ISE);
1770 GenerateVariantsOf(MaximalChildren[1], BVariants, ISE);
1771 GenerateVariantsOf(MaximalChildren[2], CVariants, ISE);
1773 // There are only two ways we can permute the tree:
1774 // (A op B) op C and A op (B op C)
1775 // Within these forms, we can also permute A/B/C.
1777 // Generate legal pair permutations of A/B/C.
1778 std::vector<TreePatternNode*> ABVariants;
1779 std::vector<TreePatternNode*> BAVariants;
1780 std::vector<TreePatternNode*> ACVariants;
1781 std::vector<TreePatternNode*> CAVariants;
1782 std::vector<TreePatternNode*> BCVariants;
1783 std::vector<TreePatternNode*> CBVariants;
1784 CombineChildVariants(N, AVariants, BVariants, ABVariants, ISE);
1785 CombineChildVariants(N, BVariants, AVariants, BAVariants, ISE);
1786 CombineChildVariants(N, AVariants, CVariants, ACVariants, ISE);
1787 CombineChildVariants(N, CVariants, AVariants, CAVariants, ISE);
1788 CombineChildVariants(N, BVariants, CVariants, BCVariants, ISE);
1789 CombineChildVariants(N, CVariants, BVariants, CBVariants, ISE);
1791 // Combine those into the result: (x op x) op x
1792 CombineChildVariants(N, ABVariants, CVariants, OutVariants, ISE);
1793 CombineChildVariants(N, BAVariants, CVariants, OutVariants, ISE);
1794 CombineChildVariants(N, ACVariants, BVariants, OutVariants, ISE);
1795 CombineChildVariants(N, CAVariants, BVariants, OutVariants, ISE);
1796 CombineChildVariants(N, BCVariants, AVariants, OutVariants, ISE);
1797 CombineChildVariants(N, CBVariants, AVariants, OutVariants, ISE);
1799 // Combine those into the result: x op (x op x)
1800 CombineChildVariants(N, CVariants, ABVariants, OutVariants, ISE);
1801 CombineChildVariants(N, CVariants, BAVariants, OutVariants, ISE);
1802 CombineChildVariants(N, BVariants, ACVariants, OutVariants, ISE);
1803 CombineChildVariants(N, BVariants, CAVariants, OutVariants, ISE);
1804 CombineChildVariants(N, AVariants, BCVariants, OutVariants, ISE);
1805 CombineChildVariants(N, AVariants, CBVariants, OutVariants, ISE);
1810 // Compute permutations of all children.
1811 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1812 ChildVariants.resize(N->getNumChildren());
1813 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1814 GenerateVariantsOf(N->getChild(i), ChildVariants[i], ISE);
1816 // Build all permutations based on how the children were formed.
1817 CombineChildVariants(N, ChildVariants, OutVariants, ISE);
1819 // If this node is commutative, consider the commuted order.
1820 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
1821 assert(N->getNumChildren()==2 &&"Commutative but doesn't have 2 children!");
1822 // Consider the commuted order.
1823 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
1829 // GenerateVariants - Generate variants. For example, commutative patterns can
1830 // match multiple ways. Add them to PatternsToMatch as well.
1831 void DAGISelEmitter::GenerateVariants() {
1833 DEBUG(std::cerr << "Generating instruction variants.\n");
1835 // Loop over all of the patterns we've collected, checking to see if we can
1836 // generate variants of the instruction, through the exploitation of
1837 // identities. This permits the target to provide agressive matching without
1838 // the .td file having to contain tons of variants of instructions.
1840 // Note that this loop adds new patterns to the PatternsToMatch list, but we
1841 // intentionally do not reconsider these. Any variants of added patterns have
1842 // already been added.
1844 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
1845 std::vector<TreePatternNode*> Variants;
1846 GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this);
1848 assert(!Variants.empty() && "Must create at least original variant!");
1849 Variants.erase(Variants.begin()); // Remove the original pattern.
1851 if (Variants.empty()) // No variants for this pattern.
1854 DEBUG(std::cerr << "FOUND VARIANTS OF: ";
1855 PatternsToMatch[i].getSrcPattern()->dump();
1858 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
1859 TreePatternNode *Variant = Variants[v];
1861 DEBUG(std::cerr << " VAR#" << v << ": ";
1865 // Scan to see if an instruction or explicit pattern already matches this.
1866 bool AlreadyExists = false;
1867 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
1868 // Check to see if this variant already exists.
1869 if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern())) {
1870 DEBUG(std::cerr << " *** ALREADY EXISTS, ignoring variant.\n");
1871 AlreadyExists = true;
1875 // If we already have it, ignore the variant.
1876 if (AlreadyExists) continue;
1878 // Otherwise, add it to the list of patterns we have.
1880 push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
1881 Variant, PatternsToMatch[i].getDstPattern(),
1882 PatternsToMatch[i].getAddedComplexity()));
1885 DEBUG(std::cerr << "\n");
1890 // NodeIsComplexPattern - return true if N is a leaf node and a subclass of
1892 static bool NodeIsComplexPattern(TreePatternNode *N)
1894 return (N->isLeaf() &&
1895 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1896 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1897 isSubClassOf("ComplexPattern"));
1900 // NodeGetComplexPattern - return the pointer to the ComplexPattern if N
1901 // is a leaf node and a subclass of ComplexPattern, else it returns NULL.
1902 static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
1903 DAGISelEmitter &ISE)
1906 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1907 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1908 isSubClassOf("ComplexPattern")) {
1909 return &ISE.getComplexPattern(static_cast<DefInit*>(N->getLeafValue())
1915 /// getPatternSize - Return the 'size' of this pattern. We want to match large
1916 /// patterns before small ones. This is used to determine the size of a
1918 static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
1919 assert((isExtIntegerInVTs(P->getExtTypes()) ||
1920 isExtFloatingPointInVTs(P->getExtTypes()) ||
1921 P->getExtTypeNum(0) == MVT::isVoid ||
1922 P->getExtTypeNum(0) == MVT::Flag ||
1923 P->getExtTypeNum(0) == MVT::iPTR) &&
1924 "Not a valid pattern node to size!");
1925 unsigned Size = 2; // The node itself.
1926 // If the root node is a ConstantSDNode, increases its size.
1927 // e.g. (set R32:$dst, 0).
1928 if (P->isLeaf() && dynamic_cast<IntInit*>(P->getLeafValue()))
1931 // FIXME: This is a hack to statically increase the priority of patterns
1932 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
1933 // Later we can allow complexity / cost for each pattern to be (optionally)
1934 // specified. To get best possible pattern match we'll need to dynamically
1935 // calculate the complexity of all patterns a dag can potentially map to.
1936 const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
1938 Size += AM->getNumOperands() * 2;
1940 // If this node has some predicate function that must match, it adds to the
1941 // complexity of this node.
1942 if (!P->getPredicateFn().empty())
1945 // Count children in the count if they are also nodes.
1946 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
1947 TreePatternNode *Child = P->getChild(i);
1948 if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
1949 Size += getPatternSize(Child, ISE);
1950 else if (Child->isLeaf()) {
1951 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
1952 Size += 3; // Matches a ConstantSDNode (+2) and a specific value (+1).
1953 else if (NodeIsComplexPattern(Child))
1954 Size += getPatternSize(Child, ISE);
1955 else if (!Child->getPredicateFn().empty())
1963 /// getResultPatternCost - Compute the number of instructions for this pattern.
1964 /// This is a temporary hack. We should really include the instruction
1965 /// latencies in this calculation.
1966 static unsigned getResultPatternCost(TreePatternNode *P, DAGISelEmitter &ISE) {
1967 if (P->isLeaf()) return 0;
1970 Record *Op = P->getOperator();
1971 if (Op->isSubClassOf("Instruction")) {
1973 CodeGenInstruction &II = ISE.getTargetInfo().getInstruction(Op->getName());
1974 if (II.usesCustomDAGSchedInserter)
1977 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
1978 Cost += getResultPatternCost(P->getChild(i), ISE);
1982 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
1983 // In particular, we want to match maximal patterns first and lowest cost within
1984 // a particular complexity first.
1985 struct PatternSortingPredicate {
1986 PatternSortingPredicate(DAGISelEmitter &ise) : ISE(ise) {};
1987 DAGISelEmitter &ISE;
1989 bool operator()(PatternToMatch *LHS,
1990 PatternToMatch *RHS) {
1991 unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), ISE);
1992 unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), ISE);
1993 LHSSize += LHS->getAddedComplexity();
1994 RHSSize += RHS->getAddedComplexity();
1995 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
1996 if (LHSSize < RHSSize) return false;
1998 // If the patterns have equal complexity, compare generated instruction cost
1999 return getResultPatternCost(LHS->getDstPattern(), ISE) <
2000 getResultPatternCost(RHS->getDstPattern(), ISE);
2004 /// getRegisterValueType - Look up and return the first ValueType of specified
2005 /// RegisterClass record
2006 static MVT::ValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
2007 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
2008 return RC->getValueTypeNum(0);
2013 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
2014 /// type information from it.
2015 static void RemoveAllTypes(TreePatternNode *N) {
2018 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2019 RemoveAllTypes(N->getChild(i));
2022 Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
2023 Record *N = Records.getDef(Name);
2024 if (!N || !N->isSubClassOf("SDNode")) {
2025 std::cerr << "Error getting SDNode '" << Name << "'!\n";
2031 /// NodeHasProperty - return true if TreePatternNode has the specified
2033 static bool NodeHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
2034 DAGISelEmitter &ISE)
2036 if (N->isLeaf()) return false;
2037 Record *Operator = N->getOperator();
2038 if (!Operator->isSubClassOf("SDNode")) return false;
2040 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(Operator);
2041 return NodeInfo.hasProperty(Property);
2044 static bool PatternHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
2045 DAGISelEmitter &ISE)
2047 if (NodeHasProperty(N, Property, ISE))
2050 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2051 TreePatternNode *Child = N->getChild(i);
2052 if (PatternHasProperty(Child, Property, ISE))
2059 class PatternCodeEmitter {
2061 DAGISelEmitter &ISE;
2064 ListInit *Predicates;
2067 // Instruction selector pattern.
2068 TreePatternNode *Pattern;
2069 // Matched instruction.
2070 TreePatternNode *Instruction;
2072 // Node to name mapping
2073 std::map<std::string, std::string> VariableMap;
2074 // Node to operator mapping
2075 std::map<std::string, Record*> OperatorMap;
2076 // Names of all the folded nodes which produce chains.
2077 std::vector<std::pair<std::string, unsigned> > FoldedChains;
2078 std::set<std::string> Duplicates;
2079 /// These nodes are being marked "in-flight" so they cannot be folded.
2080 std::vector<std::string> InflightNodes;
2082 /// GeneratedCode - This is the buffer that we emit code to. The first bool
2083 /// indicates whether this is an exit predicate (something that should be
2084 /// tested, and if true, the match fails) [when true] or normal code to emit
2086 std::vector<std::pair<bool, std::string> > &GeneratedCode;
2087 /// GeneratedDecl - This is the set of all SDOperand declarations needed for
2088 /// the set of patterns for each top-level opcode.
2089 std::set<std::pair<bool, std::string> > &GeneratedDecl;
2091 std::string ChainName;
2096 void emitCheck(const std::string &S) {
2098 GeneratedCode.push_back(std::make_pair(true, S));
2100 void emitCode(const std::string &S) {
2102 GeneratedCode.push_back(std::make_pair(false, S));
2104 void emitDecl(const std::string &S, bool isSDNode=false) {
2105 assert(!S.empty() && "Invalid declaration");
2106 GeneratedDecl.insert(std::make_pair(isSDNode, S));
2109 PatternCodeEmitter(DAGISelEmitter &ise, ListInit *preds,
2110 TreePatternNode *pattern, TreePatternNode *instr,
2111 std::vector<std::pair<bool, std::string> > &gc,
2112 std::set<std::pair<bool, std::string> > &gd,
2114 : ISE(ise), Predicates(preds), Pattern(pattern), Instruction(instr),
2115 GeneratedCode(gc), GeneratedDecl(gd),
2116 NewTF(false), DoReplace(dorep), TmpNo(0) {}
2118 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
2119 /// if the match fails. At this point, we already know that the opcode for N
2120 /// matches, and the SDNode for the result has the RootName specified name.
2121 void EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
2122 const std::string &RootName, const std::string &ParentName,
2123 const std::string &ChainSuffix, bool &FoundChain) {
2124 bool isRoot = (P == NULL);
2125 // Emit instruction predicates. Each predicate is just a string for now.
2127 std::string PredicateCheck;
2128 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
2129 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
2130 Record *Def = Pred->getDef();
2131 if (!Def->isSubClassOf("Predicate")) {
2133 assert(0 && "Unknown predicate type!");
2135 if (!PredicateCheck.empty())
2136 PredicateCheck += " || ";
2137 PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
2141 emitCheck(PredicateCheck);
2145 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2146 emitCheck("cast<ConstantSDNode>(" + RootName +
2147 ")->getSignExtended() == " + itostr(II->getValue()));
2149 } else if (!NodeIsComplexPattern(N)) {
2150 assert(0 && "Cannot match this as a leaf value!");
2155 // If this node has a name associated with it, capture it in VariableMap. If
2156 // we already saw this in the pattern, emit code to verify dagness.
2157 if (!N->getName().empty()) {
2158 std::string &VarMapEntry = VariableMap[N->getName()];
2159 if (VarMapEntry.empty()) {
2160 VarMapEntry = RootName;
2162 // If we get here, this is a second reference to a specific name. Since
2163 // we already have checked that the first reference is valid, we don't
2164 // have to recursively match it, just check that it's the same as the
2165 // previously named thing.
2166 emitCheck(VarMapEntry + " == " + RootName);
2171 OperatorMap[N->getName()] = N->getOperator();
2175 // Emit code to load the child nodes and match their contents recursively.
2177 bool NodeHasChain = NodeHasProperty (N, SDNodeInfo::SDNPHasChain, ISE);
2178 bool HasChain = PatternHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
2179 bool HasOutFlag = PatternHasProperty(N, SDNodeInfo::SDNPOutFlag, ISE);
2180 bool EmittedUseCheck = false;
2181 bool EmittedSlctedCheck = false;
2186 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
2188 emitCheck("InFlightSet.count(" + RootName + ".Val) == 0");
2189 // Multiple uses of actual result?
2190 emitCheck(RootName + ".hasOneUse()");
2191 EmittedUseCheck = true;
2192 // hasOneUse() check is not strong enough. If the original node has
2193 // already been selected, it may have been replaced with another.
2194 for (unsigned j = 0; j != CInfo.getNumResults(); j++)
2195 emitCheck("!CodeGenMap.count(" + RootName + ".getValue(" + utostr(j) +
2198 EmittedSlctedCheck = true;
2200 // FIXME: Don't fold if 1) the parent node writes a flag, 2) the node
2202 // This a workaround for this problem:
2207 // [XX]--/ \- [flag : cmp]
2212 // cmp + br should be considered as a single node as they are flagged
2213 // together. So, if the ld is folded into the cmp, the XX node in the
2214 // graph is now both an operand and a use of the ld/cmp/br node.
2215 if (NodeHasProperty(P, SDNodeInfo::SDNPOutFlag, ISE))
2216 emitCheck(ParentName + ".Val->isOnlyUse(" + RootName + ".Val)");
2218 // If the immediate use can somehow reach this node through another
2219 // path, then can't fold it either or it will create a cycle.
2220 // e.g. In the following diagram, XX can reach ld through YY. If
2221 // ld is folded into XX, then YY is both a predecessor and a successor
2231 const SDNodeInfo &PInfo = ISE.getSDNodeInfo(P->getOperator());
2232 if (PInfo.getNumOperands() > 1 ||
2233 PInfo.hasProperty(SDNodeInfo::SDNPHasChain) ||
2234 PInfo.hasProperty(SDNodeInfo::SDNPInFlag) ||
2235 PInfo.hasProperty(SDNodeInfo::SDNPOptInFlag))
2236 if (PInfo.getNumOperands() > 1) {
2237 emitCheck("!isNonImmUse(" + ParentName + ".Val, " + RootName +
2240 emitCheck("(" + ParentName + ".getNumOperands() == 1 || !" +
2241 "isNonImmUse(" + ParentName + ".Val, " + RootName +
2248 ChainName = "Chain" + ChainSuffix;
2249 emitDecl(ChainName);
2251 // FIXME: temporary workaround for a common case where chain
2252 // is a TokenFactor and the previous "inner" chain is an operand.
2254 emitDecl("OldTF", true);
2255 emitCheck("(" + ChainName + " = UpdateFoldedChain(CurDAG, " +
2256 RootName + ".Val, Chain.Val, OldTF)).Val");
2259 emitCode(ChainName + " = " + RootName + ".getOperand(0);");
2264 // Don't fold any node which reads or writes a flag and has multiple uses.
2265 // FIXME: We really need to separate the concepts of flag and "glue". Those
2266 // real flag results, e.g. X86CMP output, can have multiple uses.
2267 // FIXME: If the optional incoming flag does not exist. Then it is ok to
2270 (PatternHasProperty(N, SDNodeInfo::SDNPInFlag, ISE) ||
2271 PatternHasProperty(N, SDNodeInfo::SDNPOptInFlag, ISE) ||
2272 PatternHasProperty(N, SDNodeInfo::SDNPOutFlag, ISE))) {
2273 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
2274 if (!EmittedUseCheck) {
2275 // Multiple uses of actual result?
2276 emitCheck(RootName + ".hasOneUse()");
2278 if (!EmittedSlctedCheck)
2279 // hasOneUse() check is not strong enough. If the original node has
2280 // already been selected, it may have been replaced with another.
2281 for (unsigned j = 0; j < CInfo.getNumResults(); j++)
2282 emitCheck("!CodeGenMap.count(" + RootName + ".getValue(" + utostr(j) +
2286 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2287 emitDecl(RootName + utostr(OpNo));
2288 emitCode(RootName + utostr(OpNo) + " = " +
2289 RootName + ".getOperand(" +utostr(OpNo) + ");");
2290 TreePatternNode *Child = N->getChild(i);
2292 if (!Child->isLeaf()) {
2293 // If it's not a leaf, recursively match.
2294 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(Child->getOperator());
2295 emitCheck(RootName + utostr(OpNo) + ".getOpcode() == " +
2296 CInfo.getEnumName());
2297 EmitMatchCode(Child, N, RootName + utostr(OpNo), RootName,
2298 ChainSuffix + utostr(OpNo), FoundChain);
2299 if (NodeHasProperty(Child, SDNodeInfo::SDNPHasChain, ISE))
2300 FoldedChains.push_back(std::make_pair(RootName + utostr(OpNo),
2301 CInfo.getNumResults()));
2303 // If this child has a name associated with it, capture it in VarMap. If
2304 // we already saw this in the pattern, emit code to verify dagness.
2305 if (!Child->getName().empty()) {
2306 std::string &VarMapEntry = VariableMap[Child->getName()];
2307 if (VarMapEntry.empty()) {
2308 VarMapEntry = RootName + utostr(OpNo);
2310 // If we get here, this is a second reference to a specific name.
2311 // Since we already have checked that the first reference is valid,
2312 // we don't have to recursively match it, just check that it's the
2313 // same as the previously named thing.
2314 emitCheck(VarMapEntry + " == " + RootName + utostr(OpNo));
2315 Duplicates.insert(RootName + utostr(OpNo));
2320 // Handle leaves of various types.
2321 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2322 Record *LeafRec = DI->getDef();
2323 if (LeafRec->isSubClassOf("RegisterClass")) {
2324 // Handle register references. Nothing to do here.
2325 } else if (LeafRec->isSubClassOf("Register")) {
2326 // Handle register references.
2327 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
2328 // Handle complex pattern. Nothing to do here.
2329 } else if (LeafRec->getName() == "srcvalue") {
2330 // Place holder for SRCVALUE nodes. Nothing to do here.
2331 } else if (LeafRec->isSubClassOf("ValueType")) {
2332 // Make sure this is the specified value type.
2333 emitCheck("cast<VTSDNode>(" + RootName + utostr(OpNo) +
2334 ")->getVT() == MVT::" + LeafRec->getName());
2335 } else if (LeafRec->isSubClassOf("CondCode")) {
2336 // Make sure this is the specified cond code.
2337 emitCheck("cast<CondCodeSDNode>(" + RootName + utostr(OpNo) +
2338 ")->get() == ISD::" + LeafRec->getName());
2342 assert(0 && "Unknown leaf type!");
2344 } else if (IntInit *II =
2345 dynamic_cast<IntInit*>(Child->getLeafValue())) {
2346 emitCheck("isa<ConstantSDNode>(" + RootName + utostr(OpNo) + ")");
2347 unsigned CTmp = TmpNo++;
2348 emitCode("int64_t CN"+utostr(CTmp)+" = cast<ConstantSDNode>("+
2349 RootName + utostr(OpNo) + ")->getSignExtended();");
2351 emitCheck("CN" + utostr(CTmp) + " == " +itostr(II->getValue()));
2354 assert(0 && "Unknown leaf type!");
2359 // If there is a node predicate for this, emit the call.
2360 if (!N->getPredicateFn().empty())
2361 emitCheck(N->getPredicateFn() + "(" + RootName + ".Val)");
2364 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
2365 /// we actually have to build a DAG!
2366 std::pair<unsigned, unsigned>
2367 EmitResultCode(TreePatternNode *N, bool LikeLeaf = false,
2368 bool isRoot = false) {
2369 // This is something selected from the pattern we matched.
2370 if (!N->getName().empty()) {
2371 std::string &Val = VariableMap[N->getName()];
2372 assert(!Val.empty() &&
2373 "Variable referenced but not defined and not caught earlier!");
2374 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
2375 // Already selected this operand, just return the tmpval.
2376 return std::make_pair(1, atoi(Val.c_str()+3));
2379 const ComplexPattern *CP;
2380 unsigned ResNo = TmpNo++;
2381 unsigned NumRes = 1;
2382 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
2383 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2384 std::string CastType;
2385 switch (N->getTypeNum(0)) {
2386 default: assert(0 && "Unknown type for constant node!");
2387 case MVT::i1: CastType = "bool"; break;
2388 case MVT::i8: CastType = "unsigned char"; break;
2389 case MVT::i16: CastType = "unsigned short"; break;
2390 case MVT::i32: CastType = "unsigned"; break;
2391 case MVT::i64: CastType = "uint64_t"; break;
2393 emitCode(CastType + " Tmp" + utostr(ResNo) + "C = (" + CastType +
2394 ")cast<ConstantSDNode>(" + Val + ")->getValue();");
2395 emitDecl("Tmp" + utostr(ResNo));
2396 emitCode("Tmp" + utostr(ResNo) +
2397 " = CurDAG->getTargetConstant(Tmp" + utostr(ResNo) +
2398 "C, " + getEnumName(N->getTypeNum(0)) + ");");
2399 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2400 Record *Op = OperatorMap[N->getName()];
2401 // Transform ExternalSymbol to TargetExternalSymbol
2402 if (Op && Op->getName() == "externalsym") {
2403 emitDecl("Tmp" + utostr(ResNo));
2404 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
2405 "ExternalSymbol(cast<ExternalSymbolSDNode>(" +
2406 Val + ")->getSymbol(), " +
2407 getEnumName(N->getTypeNum(0)) + ");");
2409 emitDecl("Tmp" + utostr(ResNo));
2410 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2412 } else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") {
2413 Record *Op = OperatorMap[N->getName()];
2414 // Transform GlobalAddress to TargetGlobalAddress
2415 if (Op && Op->getName() == "globaladdr") {
2416 emitDecl("Tmp" + utostr(ResNo));
2417 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
2418 "GlobalAddress(cast<GlobalAddressSDNode>(" + Val +
2419 ")->getGlobal(), " + getEnumName(N->getTypeNum(0)) +
2422 emitDecl("Tmp" + utostr(ResNo));
2423 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2425 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2426 emitDecl("Tmp" + utostr(ResNo));
2427 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2428 } else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") {
2429 emitDecl("Tmp" + utostr(ResNo));
2430 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2431 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, ISE))) {
2432 std::string Fn = CP->getSelectFunc();
2433 NumRes = CP->getNumOperands();
2434 for (unsigned i = 0; i < NumRes; ++i)
2435 emitDecl("CPTmp" + utostr(i+ResNo));
2437 std::string Code = "bool Match = " + Fn + "(" + Val;
2438 for (unsigned i = 0; i < NumRes; i++)
2439 Code += ", CPTmp" + utostr(i + ResNo);
2440 emitCode(Code + ");");
2441 if (InflightNodes.size()) {
2442 // Remove the in-flight nodes if the ComplexPattern does not match!
2443 emitCode("if (!Match) {");
2444 for (std::vector<std::string>::iterator AI = InflightNodes.begin(),
2445 AE = InflightNodes.end(); AI != AE; ++AI)
2446 emitCode(" InFlightSet.erase(" + *AI + ".Val);");
2452 for (unsigned i = 0; i < NumRes; ++i) {
2453 emitCode("InFlightSet.insert(CPTmp" + utostr(i+ResNo) + ".Val);");
2454 InflightNodes.push_back("CPTmp" + utostr(i+ResNo));
2456 for (unsigned i = 0; i < NumRes; ++i) {
2457 emitDecl("Tmp" + utostr(i+ResNo));
2458 emitCode("Select(Tmp" + utostr(i+ResNo) + ", CPTmp" +
2459 utostr(i+ResNo) + ");");
2462 TmpNo = ResNo + NumRes;
2464 emitDecl("Tmp" + utostr(ResNo));
2465 // This node, probably wrapped in a SDNodeXForms, behaves like a leaf
2466 // node even if it isn't one. Don't select it.
2468 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2470 emitCode("Select(Tmp" + utostr(ResNo) + ", " + Val + ");");
2473 if (isRoot && N->isLeaf()) {
2474 emitCode("Result = Tmp" + utostr(ResNo) + ";");
2475 emitCode("return;");
2478 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
2479 // value if used multiple times by this pattern result.
2480 Val = "Tmp"+utostr(ResNo);
2481 return std::make_pair(NumRes, ResNo);
2484 // If this is an explicit register reference, handle it.
2485 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
2486 unsigned ResNo = TmpNo++;
2487 if (DI->getDef()->isSubClassOf("Register")) {
2488 emitDecl("Tmp" + utostr(ResNo));
2489 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" +
2490 ISE.getQualifiedName(DI->getDef()) + ", " +
2491 getEnumName(N->getTypeNum(0)) + ");");
2492 return std::make_pair(1, ResNo);
2494 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2495 unsigned ResNo = TmpNo++;
2496 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2497 emitDecl("Tmp" + utostr(ResNo));
2498 emitCode("Tmp" + utostr(ResNo) +
2499 " = CurDAG->getTargetConstant(" + itostr(II->getValue()) +
2500 ", " + getEnumName(N->getTypeNum(0)) + ");");
2501 return std::make_pair(1, ResNo);
2505 assert(0 && "Unknown leaf type!");
2506 return std::make_pair(1, ~0U);
2509 Record *Op = N->getOperator();
2510 if (Op->isSubClassOf("Instruction")) {
2511 const CodeGenTarget &CGT = ISE.getTargetInfo();
2512 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
2513 const DAGInstruction &Inst = ISE.getInstruction(Op);
2514 TreePattern *InstPat = Inst.getPattern();
2515 TreePatternNode *InstPatNode =
2516 isRoot ? (InstPat ? InstPat->getOnlyTree() : Pattern)
2517 : (InstPat ? InstPat->getOnlyTree() : NULL);
2518 if (InstPatNode && InstPatNode->getOperator()->getName() == "set") {
2519 InstPatNode = InstPatNode->getChild(1);
2521 bool HasVarOps = isRoot && II.hasVariableNumberOfOperands;
2522 bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0;
2523 bool HasImpResults = isRoot && Inst.getNumImpResults() > 0;
2524 bool NodeHasOptInFlag = isRoot &&
2525 PatternHasProperty(Pattern, SDNodeInfo::SDNPOptInFlag, ISE);
2526 bool NodeHasInFlag = isRoot &&
2527 PatternHasProperty(Pattern, SDNodeInfo::SDNPInFlag, ISE);
2528 bool NodeHasOutFlag = HasImpResults || (isRoot &&
2529 PatternHasProperty(Pattern, SDNodeInfo::SDNPOutFlag, ISE));
2530 bool NodeHasChain = InstPatNode &&
2531 PatternHasProperty(InstPatNode, SDNodeInfo::SDNPHasChain, ISE);
2532 bool InputHasChain = isRoot &&
2533 NodeHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE);
2535 if (NodeHasInFlag || NodeHasOutFlag || NodeHasOptInFlag || HasImpInputs)
2537 if (NodeHasOptInFlag)
2538 emitCode("bool HasInFlag = "
2539 "N.getOperand(N.getNumOperands()-1).getValueType() == MVT::Flag;");
2541 emitCode("std::vector<SDOperand> Ops;");
2543 // How many results is this pattern expected to produce?
2544 unsigned PatResults = 0;
2545 for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
2546 MVT::ValueType VT = Pattern->getTypeNum(i);
2547 if (VT != MVT::isVoid && VT != MVT::Flag)
2551 // Determine operand emission order. Complex pattern first.
2552 std::vector<std::pair<unsigned, TreePatternNode*> > EmitOrder;
2553 std::vector<std::pair<unsigned, TreePatternNode*> >::iterator OI;
2554 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2555 TreePatternNode *Child = N->getChild(i);
2557 EmitOrder.push_back(std::make_pair(i, Child));
2558 OI = EmitOrder.begin();
2559 } else if (NodeIsComplexPattern(Child)) {
2560 OI = EmitOrder.insert(OI, std::make_pair(i, Child));
2562 EmitOrder.push_back(std::make_pair(i, Child));
2566 // Make sure these operands which would be selected won't be folded while
2567 // the isel traverses the DAG upward.
2568 for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) {
2569 TreePatternNode *Child = EmitOrder[i].second;
2570 if (!Child->getName().empty()) {
2571 std::string &Val = VariableMap[Child->getName()];
2572 assert(!Val.empty() &&
2573 "Variable referenced but not defined and not caught earlier!");
2574 if (Child->isLeaf() && !NodeGetComplexPattern(Child, ISE)) {
2575 emitCode("InFlightSet.insert(" + Val + ".Val);");
2576 InflightNodes.push_back(Val);
2581 // Emit all of the operands.
2582 std::vector<std::pair<unsigned, unsigned> > NumTemps(EmitOrder.size());
2583 for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) {
2584 unsigned OpOrder = EmitOrder[i].first;
2585 TreePatternNode *Child = EmitOrder[i].second;
2586 std::pair<unsigned, unsigned> NumTemp = EmitResultCode(Child);
2587 NumTemps[OpOrder] = NumTemp;
2590 // List all the operands in the right order.
2591 std::vector<unsigned> Ops;
2592 for (unsigned i = 0, e = NumTemps.size(); i != e; i++) {
2593 for (unsigned j = 0; j < NumTemps[i].first; j++)
2594 Ops.push_back(NumTemps[i].second + j);
2597 // Emit all the chain and CopyToReg stuff.
2598 bool ChainEmitted = NodeHasChain;
2600 emitCode("Select(" + ChainName + ", " + ChainName + ");");
2601 if (NodeHasInFlag || HasImpInputs)
2602 EmitInFlagSelectCode(Pattern, "N", ChainEmitted, true);
2603 if (NodeHasOptInFlag) {
2604 emitCode("if (HasInFlag)");
2605 emitCode(" Select(InFlag, N.getOperand(N.getNumOperands()-1));");
2609 // The operands have been selected. Remove them from InFlightSet.
2610 for (std::vector<std::string>::iterator AI = InflightNodes.begin(),
2611 AE = InflightNodes.end(); AI != AE; ++AI)
2612 emitCode("InFlightSet.erase(" + *AI + ".Val);");
2615 unsigned NumResults = Inst.getNumResults();
2616 unsigned ResNo = TmpNo++;
2617 if (!isRoot || InputHasChain || NodeHasChain || NodeHasOutFlag ||
2621 std::string NodeName;
2623 NodeName = "Tmp" + utostr(ResNo);
2625 Code2 = NodeName + " = SDOperand(";
2627 NodeName = "ResNode";
2628 emitDecl(NodeName, true);
2629 Code2 = NodeName + " = ";
2631 Code = "CurDAG->getTargetNode(" +
2632 II.Namespace + "::" + II.TheDef->getName();
2634 // Output order: results, chain, flags
2636 if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid)
2637 Code += ", " + getEnumName(N->getTypeNum(0));
2639 Code += ", MVT::Other";
2641 Code += ", MVT::Flag";
2644 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
2646 emitCode("Ops.push_back(Tmp" + utostr(Ops[i]) + ");");
2648 Code += ", Tmp" + utostr(Ops[i]);
2652 if (NodeHasInFlag || HasImpInputs)
2653 emitCode("for (unsigned i = 2, e = N.getNumOperands()-1; "
2655 else if (NodeHasOptInFlag)
2656 emitCode("for (unsigned i = 2, e = N.getNumOperands()-HasInFlag; "
2659 emitCode("for (unsigned i = 2, e = N.getNumOperands(); "
2661 emitCode(" SDOperand VarOp(0, 0);");
2662 emitCode(" Select(VarOp, N.getOperand(i));");
2663 emitCode(" Ops.push_back(VarOp);");
2669 emitCode("Ops.push_back(" + ChainName + ");");
2671 Code += ", " + ChainName;
2673 if (NodeHasInFlag || HasImpInputs) {
2675 emitCode("Ops.push_back(InFlag);");
2678 } else if (NodeHasOptInFlag && HasVarOps) {
2679 emitCode("if (HasInFlag)");
2680 emitCode(" Ops.push_back(InFlag);");
2685 else if (NodeHasOptInFlag)
2686 Code = "HasInFlag ? " + Code + ", InFlag) : " + Code;
2690 emitCode(Code2 + Code + ");");
2693 // Remember which op produces the chain.
2695 emitCode(ChainName + " = SDOperand(" + NodeName +
2696 ".Val, " + utostr(PatResults) + ");");
2698 emitCode(ChainName + " = SDOperand(" + NodeName +
2699 ", " + utostr(PatResults) + ");");
2702 return std::make_pair(1, ResNo);
2705 emitCode("if (OldTF) "
2706 "SelectionDAG::InsertISelMapEntry(CodeGenMap, OldTF, 0, " +
2707 ChainName + ".Val, 0);");
2709 for (unsigned i = 0; i < NumResults; i++)
2710 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2711 utostr(i) + ", ResNode, " + utostr(i) + ");");
2714 emitCode("InFlag = SDOperand(ResNode, " +
2715 utostr(NumResults + (unsigned)NodeHasChain) + ");");
2717 if (HasImpResults && EmitCopyFromRegs(N, ChainEmitted)) {
2718 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, "
2723 if (InputHasChain) {
2724 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2725 utostr(PatResults) + ", " + ChainName + ".Val, " +
2726 ChainName + ".ResNo" + ");");
2728 emitCode("if (N.ResNo == 0) AddHandleReplacement(N.Val, " +
2729 utostr(PatResults) + ", " + ChainName + ".Val, " +
2730 ChainName + ".ResNo" + ");");
2733 if (FoldedChains.size() > 0) {
2735 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
2736 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, " +
2737 FoldedChains[j].first + ".Val, " +
2738 utostr(FoldedChains[j].second) + ", ResNode, " +
2739 utostr(NumResults) + ");");
2741 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++) {
2743 FoldedChains[j].first + ".Val, " +
2744 utostr(FoldedChains[j].second) + ", ";
2745 emitCode("AddHandleReplacement(" + Code + "ResNode, " +
2746 utostr(NumResults) + ");");
2751 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2752 utostr(PatResults + (unsigned)InputHasChain) +
2753 ", InFlag.Val, InFlag.ResNo);");
2755 // User does not expect the instruction would produce a chain!
2756 bool AddedChain = NodeHasChain && !InputHasChain;
2757 if (AddedChain && NodeHasOutFlag) {
2758 if (PatResults == 0) {
2759 emitCode("Result = SDOperand(ResNode, N.ResNo+1);");
2761 emitCode("if (N.ResNo < " + utostr(PatResults) + ")");
2762 emitCode(" Result = SDOperand(ResNode, N.ResNo);");
2764 emitCode(" Result = SDOperand(ResNode, N.ResNo+1);");
2766 } else if (InputHasChain && !NodeHasChain) {
2767 // One of the inner node produces a chain.
2768 emitCode("if (N.ResNo < " + utostr(PatResults) + ")");
2769 emitCode(" Result = SDOperand(ResNode, N.ResNo);");
2770 if (NodeHasOutFlag) {
2771 emitCode("else if (N.ResNo > " + utostr(PatResults) + ")");
2772 emitCode(" Result = SDOperand(ResNode, N.ResNo-1);");
2775 emitCode(" Result = SDOperand(" + ChainName + ".Val, " +
2776 ChainName + ".ResNo);");
2778 emitCode("Result = SDOperand(ResNode, N.ResNo);");
2781 // If this instruction is the root, and if there is only one use of it,
2782 // use SelectNodeTo instead of getTargetNode to avoid an allocation.
2783 emitCode("if (N.Val->hasOneUse()) {");
2784 std::string Code = " Result = CurDAG->SelectNodeTo(N.Val, " +
2785 II.Namespace + "::" + II.TheDef->getName();
2786 if (N->getTypeNum(0) != MVT::isVoid)
2787 Code += ", " + getEnumName(N->getTypeNum(0));
2789 Code += ", MVT::Flag";
2790 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2791 Code += ", Tmp" + utostr(Ops[i]);
2792 if (NodeHasInFlag || HasImpInputs)
2794 emitCode(Code + ");");
2795 emitCode("} else {");
2796 emitDecl("ResNode", true);
2797 Code = " ResNode = CurDAG->getTargetNode(" +
2798 II.Namespace + "::" + II.TheDef->getName();
2799 if (N->getTypeNum(0) != MVT::isVoid)
2800 Code += ", " + getEnumName(N->getTypeNum(0));
2802 Code += ", MVT::Flag";
2803 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2804 Code += ", Tmp" + utostr(Ops[i]);
2805 if (NodeHasInFlag || HasImpInputs)
2807 emitCode(Code + ");");
2808 emitCode(" SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo"
2810 emitCode(" Result = SDOperand(ResNode, 0);");
2815 emitCode("return;");
2816 return std::make_pair(1, ResNo);
2817 } else if (Op->isSubClassOf("SDNodeXForm")) {
2818 assert(N->getNumChildren() == 1 && "node xform should have one child!");
2819 // PatLeaf node - the operand may or may not be a leaf node. But it should
2821 unsigned OpVal = EmitResultCode(N->getChild(0), true).second;
2822 unsigned ResNo = TmpNo++;
2823 emitDecl("Tmp" + utostr(ResNo));
2824 emitCode("Tmp" + utostr(ResNo) + " = Transform_" + Op->getName()
2825 + "(Tmp" + utostr(OpVal) + ".Val);");
2827 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val,"
2828 "N.ResNo, Tmp" + utostr(ResNo) + ".Val, Tmp" +
2829 utostr(ResNo) + ".ResNo);");
2830 emitCode("Result = Tmp" + utostr(ResNo) + ";");
2831 emitCode("return;");
2833 return std::make_pair(1, ResNo);
2837 throw std::string("Unknown node in result pattern!");
2841 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat'
2842 /// and add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
2843 /// 'Pat' may be missing types. If we find an unresolved type to add a check
2844 /// for, this returns true otherwise false if Pat has all types.
2845 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
2846 const std::string &Prefix) {
2848 if (Pat->getExtTypes() != Other->getExtTypes()) {
2849 // Move a type over from 'other' to 'pat'.
2850 Pat->setTypes(Other->getExtTypes());
2851 emitCheck(Prefix + ".Val->getValueType(0) == " +
2852 getName(Pat->getTypeNum(0)));
2857 (unsigned) NodeHasProperty(Pat, SDNodeInfo::SDNPHasChain, ISE);
2858 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
2859 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
2860 Prefix + utostr(OpNo)))
2866 /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is
2868 void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName,
2869 bool &ChainEmitted, bool isRoot = false) {
2870 const CodeGenTarget &T = ISE.getTargetInfo();
2872 (unsigned) NodeHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
2873 bool HasInFlag = NodeHasProperty(N, SDNodeInfo::SDNPInFlag, ISE);
2874 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2875 TreePatternNode *Child = N->getChild(i);
2876 if (!Child->isLeaf()) {
2877 EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted);
2879 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2880 if (!Child->getName().empty()) {
2881 std::string Name = RootName + utostr(OpNo);
2882 if (Duplicates.find(Name) != Duplicates.end())
2883 // A duplicate! Do not emit a copy for this node.
2887 Record *RR = DI->getDef();
2888 if (RR->isSubClassOf("Register")) {
2889 MVT::ValueType RVT = getRegisterValueType(RR, T);
2890 if (RVT == MVT::Flag) {
2891 emitCode("Select(InFlag, " + RootName + utostr(OpNo) + ");");
2893 if (!ChainEmitted) {
2895 emitCode("Chain = CurDAG->getEntryNode();");
2896 ChainName = "Chain";
2897 ChainEmitted = true;
2899 emitCode("Select(" + RootName + utostr(OpNo) + ", " +
2900 RootName + utostr(OpNo) + ");");
2901 emitCode("ResNode = CurDAG->getCopyToReg(" + ChainName +
2902 ", CurDAG->getRegister(" + ISE.getQualifiedName(RR) +
2903 ", " + getEnumName(RVT) + "), " +
2904 RootName + utostr(OpNo) + ", InFlag).Val;");
2905 emitCode(ChainName + " = SDOperand(ResNode, 0);");
2906 emitCode("InFlag = SDOperand(ResNode, 1);");
2914 emitCode("Select(InFlag, " + RootName +
2915 ".getOperand(" + utostr(OpNo) + "));");
2918 /// EmitCopyFromRegs - Emit code to copy result to physical registers
2919 /// as specified by the instruction. It returns true if any copy is
2921 bool EmitCopyFromRegs(TreePatternNode *N, bool &ChainEmitted) {
2922 bool RetVal = false;
2923 Record *Op = N->getOperator();
2924 if (Op->isSubClassOf("Instruction")) {
2925 const DAGInstruction &Inst = ISE.getInstruction(Op);
2926 const CodeGenTarget &CGT = ISE.getTargetInfo();
2927 unsigned NumImpResults = Inst.getNumImpResults();
2928 for (unsigned i = 0; i < NumImpResults; i++) {
2929 Record *RR = Inst.getImpResult(i);
2930 if (RR->isSubClassOf("Register")) {
2931 MVT::ValueType RVT = getRegisterValueType(RR, CGT);
2932 if (RVT != MVT::Flag) {
2933 if (!ChainEmitted) {
2935 emitCode("Chain = CurDAG->getEntryNode();");
2936 ChainEmitted = true;
2937 ChainName = "Chain";
2939 emitCode("ResNode = CurDAG->getCopyFromReg(" + ChainName + ", " +
2940 ISE.getQualifiedName(RR) + ", " + getEnumName(RVT) +
2942 emitCode(ChainName + " = SDOperand(ResNode, 1);");
2943 emitCode("InFlag = SDOperand(ResNode, 2);");
2953 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
2954 /// stream to match the pattern, and generate the code for the match if it
2955 /// succeeds. Returns true if the pattern is not guaranteed to match.
2956 void DAGISelEmitter::GenerateCodeForPattern(PatternToMatch &Pattern,
2957 std::vector<std::pair<bool, std::string> > &GeneratedCode,
2958 std::set<std::pair<bool, std::string> > &GeneratedDecl,
2960 PatternCodeEmitter Emitter(*this, Pattern.getPredicates(),
2961 Pattern.getSrcPattern(), Pattern.getDstPattern(),
2962 GeneratedCode, GeneratedDecl, DoReplace);
2964 // Emit the matcher, capturing named arguments in VariableMap.
2965 bool FoundChain = false;
2966 Emitter.EmitMatchCode(Pattern.getSrcPattern(), NULL, "N", "", "", FoundChain);
2968 // TP - Get *SOME* tree pattern, we don't care which.
2969 TreePattern &TP = *PatternFragments.begin()->second;
2971 // At this point, we know that we structurally match the pattern, but the
2972 // types of the nodes may not match. Figure out the fewest number of type
2973 // comparisons we need to emit. For example, if there is only one integer
2974 // type supported by a target, there should be no type comparisons at all for
2975 // integer patterns!
2977 // To figure out the fewest number of type checks needed, clone the pattern,
2978 // remove the types, then perform type inference on the pattern as a whole.
2979 // If there are unresolved types, emit an explicit check for those types,
2980 // apply the type to the tree, then rerun type inference. Iterate until all
2981 // types are resolved.
2983 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
2984 RemoveAllTypes(Pat);
2987 // Resolve/propagate as many types as possible.
2989 bool MadeChange = true;
2991 MadeChange = Pat->ApplyTypeConstraints(TP,
2992 true/*Ignore reg constraints*/);
2994 assert(0 && "Error: could not find consistent types for something we"
2995 " already decided was ok!");
2999 // Insert a check for an unresolved type and add it to the tree. If we find
3000 // an unresolved type to add a check for, this returns true and we iterate,
3001 // otherwise we are done.
3002 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N"));
3004 Emitter.EmitResultCode(Pattern.getDstPattern(), false, true /*the root*/);
3008 /// EraseCodeLine - Erase one code line from all of the patterns. If removing
3009 /// a line causes any of them to be empty, remove them and return true when
3011 static bool EraseCodeLine(std::vector<std::pair<PatternToMatch*,
3012 std::vector<std::pair<bool, std::string> > > >
3014 bool ErasedPatterns = false;
3015 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
3016 Patterns[i].second.pop_back();
3017 if (Patterns[i].second.empty()) {
3018 Patterns.erase(Patterns.begin()+i);
3020 ErasedPatterns = true;
3023 return ErasedPatterns;
3026 /// EmitPatterns - Emit code for at least one pattern, but try to group common
3027 /// code together between the patterns.
3028 void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
3029 std::vector<std::pair<bool, std::string> > > >
3030 &Patterns, unsigned Indent,
3032 typedef std::pair<bool, std::string> CodeLine;
3033 typedef std::vector<CodeLine> CodeList;
3034 typedef std::vector<std::pair<PatternToMatch*, CodeList> > PatternList;
3036 if (Patterns.empty()) return;
3038 // Figure out how many patterns share the next code line. Explicitly copy
3039 // FirstCodeLine so that we don't invalidate a reference when changing
3041 const CodeLine FirstCodeLine = Patterns.back().second.back();
3042 unsigned LastMatch = Patterns.size()-1;
3043 while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
3046 // If not all patterns share this line, split the list into two pieces. The
3047 // first chunk will use this line, the second chunk won't.
3048 if (LastMatch != 0) {
3049 PatternList Shared(Patterns.begin()+LastMatch, Patterns.end());
3050 PatternList Other(Patterns.begin(), Patterns.begin()+LastMatch);
3052 // FIXME: Emit braces?
3053 if (Shared.size() == 1) {
3054 PatternToMatch &Pattern = *Shared.back().first;
3055 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
3056 Pattern.getSrcPattern()->print(OS);
3057 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
3058 Pattern.getDstPattern()->print(OS);
3060 unsigned AddedComplexity = Pattern.getAddedComplexity();
3061 OS << std::string(Indent, ' ') << "// Pattern complexity = "
3062 << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity
3064 << getResultPatternCost(Pattern.getDstPattern(), *this) << "\n";
3066 if (!FirstCodeLine.first) {
3067 OS << std::string(Indent, ' ') << "{\n";
3070 EmitPatterns(Shared, Indent, OS);
3071 if (!FirstCodeLine.first) {
3073 OS << std::string(Indent, ' ') << "}\n";
3076 if (Other.size() == 1) {
3077 PatternToMatch &Pattern = *Other.back().first;
3078 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
3079 Pattern.getSrcPattern()->print(OS);
3080 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
3081 Pattern.getDstPattern()->print(OS);
3083 unsigned AddedComplexity = Pattern.getAddedComplexity();
3084 OS << std::string(Indent, ' ') << "// Pattern complexity = "
3085 << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity
3087 << getResultPatternCost(Pattern.getDstPattern(), *this) << "\n";
3089 EmitPatterns(Other, Indent, OS);
3093 // Remove this code from all of the patterns that share it.
3094 bool ErasedPatterns = EraseCodeLine(Patterns);
3096 bool isPredicate = FirstCodeLine.first;
3098 // Otherwise, every pattern in the list has this line. Emit it.
3101 OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
3103 OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
3105 // If the next code line is another predicate, and if all of the pattern
3106 // in this group share the same next line, emit it inline now. Do this
3107 // until we run out of common predicates.
3108 while (!ErasedPatterns && Patterns.back().second.back().first) {
3109 // Check that all of fhe patterns in Patterns end with the same predicate.
3110 bool AllEndWithSamePredicate = true;
3111 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
3112 if (Patterns[i].second.back() != Patterns.back().second.back()) {
3113 AllEndWithSamePredicate = false;
3116 // If all of the predicates aren't the same, we can't share them.
3117 if (!AllEndWithSamePredicate) break;
3119 // Otherwise we can. Emit it shared now.
3120 OS << " &&\n" << std::string(Indent+4, ' ')
3121 << Patterns.back().second.back().second;
3122 ErasedPatterns = EraseCodeLine(Patterns);
3129 EmitPatterns(Patterns, Indent, OS);
3132 OS << std::string(Indent-2, ' ') << "}\n";
3138 /// CompareByRecordName - An ordering predicate that implements less-than by
3139 /// comparing the names records.
3140 struct CompareByRecordName {
3141 bool operator()(const Record *LHS, const Record *RHS) const {
3142 // Sort by name first.
3143 if (LHS->getName() < RHS->getName()) return true;
3144 // If both names are equal, sort by pointer.
3145 return LHS->getName() == RHS->getName() && LHS < RHS;
3150 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
3151 std::string InstNS = Target.inst_begin()->second.Namespace;
3152 if (!InstNS.empty()) InstNS += "::";
3154 // Group the patterns by their top-level opcodes.
3155 std::map<Record*, std::vector<PatternToMatch*>,
3156 CompareByRecordName> PatternsByOpcode;
3157 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
3158 TreePatternNode *Node = PatternsToMatch[i].getSrcPattern();
3159 if (!Node->isLeaf()) {
3160 PatternsByOpcode[Node->getOperator()].push_back(&PatternsToMatch[i]);
3162 const ComplexPattern *CP;
3164 dynamic_cast<IntInit*>(Node->getLeafValue())) {
3165 PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
3166 } else if ((CP = NodeGetComplexPattern(Node, *this))) {
3167 std::vector<Record*> OpNodes = CP->getRootNodes();
3168 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
3169 PatternsByOpcode[OpNodes[j]]
3170 .insert(PatternsByOpcode[OpNodes[j]].begin(), &PatternsToMatch[i]);
3173 std::cerr << "Unrecognized opcode '";
3175 std::cerr << "' on tree pattern '";
3177 PatternsToMatch[i].getDstPattern()->getOperator()->getName();
3178 std::cerr << "'!\n";
3184 // Emit one Select_* method for each top-level opcode. We do this instead of
3185 // emitting one giant switch statement to support compilers where this will
3186 // result in the recursive functions taking less stack space.
3187 for (std::map<Record*, std::vector<PatternToMatch*>,
3188 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
3189 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
3190 const std::string &OpName = PBOI->first->getName();
3191 OS << "void Select_" << OpName << "(SDOperand &Result, SDOperand N) {\n";
3193 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
3195 (OpcodeInfo.hasProperty(SDNodeInfo::SDNPHasChain) &&
3196 OpcodeInfo.getNumResults() > 0);
3199 OS << " if (N.ResNo == " << OpcodeInfo.getNumResults()
3200 << " && N.getValue(0).hasOneUse()) {\n"
3201 << " SDOperand Dummy = "
3202 << "CurDAG->getNode(ISD::HANDLENODE, MVT::Other, N);\n"
3203 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, "
3204 << OpcodeInfo.getNumResults() << ", Dummy.Val, 0);\n"
3205 << " SelectionDAG::InsertISelMapEntry(HandleMap, N.Val, "
3206 << OpcodeInfo.getNumResults() << ", Dummy.Val, 0);\n"
3207 << " Result = Dummy;\n"
3212 std::vector<PatternToMatch*> &Patterns = PBOI->second;
3213 assert(!Patterns.empty() && "No patterns but map has entry?");
3215 // We want to emit all of the matching code now. However, we want to emit
3216 // the matches in order of minimal cost. Sort the patterns so the least
3217 // cost one is at the start.
3218 std::stable_sort(Patterns.begin(), Patterns.end(),
3219 PatternSortingPredicate(*this));
3221 typedef std::vector<std::pair<bool, std::string> > CodeList;
3222 typedef std::set<std::string> DeclSet;
3224 std::vector<std::pair<PatternToMatch*, CodeList> > CodeForPatterns;
3225 std::set<std::pair<bool, std::string> > GeneratedDecl;
3226 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
3227 CodeList GeneratedCode;
3228 GenerateCodeForPattern(*Patterns[i], GeneratedCode, GeneratedDecl,
3230 CodeForPatterns.push_back(std::make_pair(Patterns[i], GeneratedCode));
3233 // Scan the code to see if all of the patterns are reachable and if it is
3234 // possible that the last one might not match.
3235 bool mightNotMatch = true;
3236 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3237 CodeList &GeneratedCode = CodeForPatterns[i].second;
3238 mightNotMatch = false;
3240 for (unsigned j = 0, e = GeneratedCode.size(); j != e; ++j) {
3241 if (GeneratedCode[j].first) { // predicate.
3242 mightNotMatch = true;
3247 // If this pattern definitely matches, and if it isn't the last one, the
3248 // patterns after it CANNOT ever match. Error out.
3249 if (mightNotMatch == false && i != CodeForPatterns.size()-1) {
3250 std::cerr << "Pattern '";
3251 CodeForPatterns[i+1].first->getSrcPattern()->print(OS);
3252 std::cerr << "' is impossible to select!\n";
3257 // Print all declarations.
3258 for (std::set<std::pair<bool, std::string> >::iterator
3259 I = GeneratedDecl.begin(), E = GeneratedDecl.end(); I != E; ++I)
3261 OS << " SDNode *" << I->second << ";\n";
3263 OS << " SDOperand " << I->second << "(0, 0);\n";
3265 // Loop through and reverse all of the CodeList vectors, as we will be
3266 // accessing them from their logical front, but accessing the end of a
3267 // vector is more efficient.
3268 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3269 CodeList &GeneratedCode = CodeForPatterns[i].second;
3270 std::reverse(GeneratedCode.begin(), GeneratedCode.end());
3273 // Next, reverse the list of patterns itself for the same reason.
3274 std::reverse(CodeForPatterns.begin(), CodeForPatterns.end());
3276 // Emit all of the patterns now, grouped together to share code.
3277 EmitPatterns(CodeForPatterns, 2, OS);
3279 // If the last pattern has predicates (which could fail) emit code to catch
3280 // the case where nothing handles a pattern.
3281 if (mightNotMatch) {
3282 OS << " std::cerr << \"Cannot yet select: \";\n";
3283 if (OpcodeInfo.getEnumName() != "ISD::INTRINSIC_W_CHAIN" &&
3284 OpcodeInfo.getEnumName() != "ISD::INTRINSIC_WO_CHAIN" &&
3285 OpcodeInfo.getEnumName() != "ISD::INTRINSIC_VOID") {
3286 OS << " N.Val->dump(CurDAG);\n";
3288 OS << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
3289 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
3290 << " std::cerr << \"intrinsic %\"<< "
3291 "Intrinsic::getName((Intrinsic::ID)iid);\n";
3293 OS << " std::cerr << '\\n';\n"
3299 // Emit boilerplate.
3300 OS << "void Select_INLINEASM(SDOperand& Result, SDOperand N) {\n"
3301 << " std::vector<SDOperand> Ops(N.Val->op_begin(), N.Val->op_end());\n"
3302 << " Select(Ops[0], N.getOperand(0)); // Select the chain.\n\n"
3303 << " // Select the flag operand.\n"
3304 << " if (Ops.back().getValueType() == MVT::Flag)\n"
3305 << " Select(Ops.back(), Ops.back());\n"
3306 << " SelectInlineAsmMemoryOperands(Ops, *CurDAG);\n"
3307 << " std::vector<MVT::ValueType> VTs;\n"
3308 << " VTs.push_back(MVT::Other);\n"
3309 << " VTs.push_back(MVT::Flag);\n"
3310 << " SDOperand New = CurDAG->getNode(ISD::INLINEASM, VTs, Ops);\n"
3311 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, New.Val, 0);\n"
3312 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, New.Val, 1);\n"
3313 << " Result = New.getValue(N.ResNo);\n"
3317 OS << "// The main instruction selector code.\n"
3318 << "void SelectCode(SDOperand &Result, SDOperand N) {\n"
3319 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
3320 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
3321 << "INSTRUCTION_LIST_END)) {\n"
3323 << " return; // Already selected.\n"
3325 << " std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);\n"
3326 << " if (CGMI != CodeGenMap.end()) {\n"
3327 << " Result = CGMI->second;\n"
3330 << " switch (N.getOpcode()) {\n"
3331 << " default: break;\n"
3332 << " case ISD::EntryToken: // These leaves remain the same.\n"
3333 << " case ISD::BasicBlock:\n"
3334 << " case ISD::Register:\n"
3335 << " case ISD::HANDLENODE:\n"
3336 << " case ISD::TargetConstant:\n"
3337 << " case ISD::TargetConstantPool:\n"
3338 << " case ISD::TargetFrameIndex:\n"
3339 << " case ISD::TargetJumpTable:\n"
3340 << " case ISD::TargetGlobalAddress: {\n"
3344 << " case ISD::AssertSext:\n"
3345 << " case ISD::AssertZext: {\n"
3346 << " SDOperand Tmp0;\n"
3347 << " Select(Tmp0, N.getOperand(0));\n"
3348 << " if (!N.Val->hasOneUse())\n"
3349 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3350 << "Tmp0.Val, Tmp0.ResNo);\n"
3351 << " Result = Tmp0;\n"
3354 << " case ISD::TokenFactor:\n"
3355 << " if (N.getNumOperands() == 2) {\n"
3356 << " SDOperand Op0, Op1;\n"
3357 << " Select(Op0, N.getOperand(0));\n"
3358 << " Select(Op1, N.getOperand(1));\n"
3360 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);\n"
3361 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3362 << "Result.Val, Result.ResNo);\n"
3364 << " std::vector<SDOperand> Ops;\n"
3365 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i) {\n"
3366 << " SDOperand Val;\n"
3367 << " Select(Val, N.getOperand(i));\n"
3368 << " Ops.push_back(Val);\n"
3371 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
3372 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3373 << "Result.Val, Result.ResNo);\n"
3376 << " case ISD::CopyFromReg: {\n"
3377 << " SDOperand Chain;\n"
3378 << " Select(Chain, N.getOperand(0));\n"
3379 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
3380 << " MVT::ValueType VT = N.Val->getValueType(0);\n"
3381 << " if (N.Val->getNumValues() == 2) {\n"
3382 << " if (Chain == N.getOperand(0)) {\n"
3383 << " Result = N; // No change\n"
3386 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT);\n"
3387 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3389 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3391 << " Result = New.getValue(N.ResNo);\n"
3394 << " SDOperand Flag;\n"
3395 << " if (N.getNumOperands() == 3) Select(Flag, N.getOperand(2));\n"
3396 << " if (Chain == N.getOperand(0) &&\n"
3397 << " (N.getNumOperands() == 2 || Flag == N.getOperand(2))) {\n"
3398 << " Result = N; // No change\n"
3401 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT, Flag);\n"
3402 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3404 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3406 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 2, "
3408 << " Result = New.getValue(N.ResNo);\n"
3412 << " case ISD::CopyToReg: {\n"
3413 << " SDOperand Chain;\n"
3414 << " Select(Chain, N.getOperand(0));\n"
3415 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
3416 << " SDOperand Val;\n"
3417 << " Select(Val, N.getOperand(2));\n"
3419 << " if (N.Val->getNumValues() == 1) {\n"
3420 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2))\n"
3421 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val);\n"
3422 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3423 << "Result.Val, 0);\n"
3425 << " SDOperand Flag(0, 0);\n"
3426 << " if (N.getNumOperands() == 4) Select(Flag, N.getOperand(3));\n"
3427 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2) ||\n"
3428 << " (N.getNumOperands() == 4 && Flag != N.getOperand(3)))\n"
3429 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val, Flag);\n"
3430 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3431 << "Result.Val, 0);\n"
3432 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3433 << "Result.Val, 1);\n"
3434 << " Result = Result.getValue(N.ResNo);\n"
3438 << " case ISD::INLINEASM: Select_INLINEASM(Result, N); return;\n";
3441 // Loop over all of the case statements, emiting a call to each method we
3443 for (std::map<Record*, std::vector<PatternToMatch*>,
3444 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
3445 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
3446 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
3447 OS << " case " << OpcodeInfo.getEnumName() << ": "
3448 << std::string(std::max(0, int(24-OpcodeInfo.getEnumName().size())), ' ')
3449 << "Select_" << PBOI->first->getName() << "(Result, N); return;\n";
3452 OS << " } // end of big switch.\n\n"
3453 << " std::cerr << \"Cannot yet select: \";\n"
3454 << " if (N.getOpcode() != ISD::INTRINSIC_W_CHAIN &&\n"
3455 << " N.getOpcode() != ISD::INTRINSIC_WO_CHAIN &&\n"
3456 << " N.getOpcode() != ISD::INTRINSIC_VOID) {\n"
3457 << " N.Val->dump(CurDAG);\n"
3459 << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
3460 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
3461 << " std::cerr << \"intrinsic %\"<< "
3462 "Intrinsic::getName((Intrinsic::ID)iid);\n"
3464 << " std::cerr << '\\n';\n"
3469 void DAGISelEmitter::run(std::ostream &OS) {
3470 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
3473 OS << "// *** NOTE: This file is #included into the middle of the target\n"
3474 << "// *** instruction selector class. These functions are really "
3477 OS << "// Instance var to keep track of multiply used nodes that have \n"
3478 << "// already been selected.\n"
3479 << "std::map<SDOperand, SDOperand> CodeGenMap;\n";
3481 OS << "// Instance var to keep track of mapping of chain generating nodes\n"
3482 << "// and their place handle nodes.\n";
3483 OS << "std::map<SDOperand, SDOperand> HandleMap;\n";
3484 OS << "// Instance var to keep track of mapping of place handle nodes\n"
3485 << "// and their replacement nodes.\n";
3486 OS << "std::map<SDOperand, SDOperand> ReplaceMap;\n";
3487 OS << "// Keep track of nodes that are currently being selecte and therefore\n"
3488 << "// should not be folded.\n";
3489 OS << "std::set<SDNode*> InFlightSet;\n";
3492 OS << "static void findNonImmUse(SDNode* Use, SDNode* Def, bool &found, "
3493 << "std::set<SDNode *> &Visited) {\n";
3494 OS << " if (found || !Visited.insert(Use).second) return;\n";
3495 OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {\n";
3496 OS << " SDNode *N = Use->getOperand(i).Val;\n";
3497 OS << " if (N != Def) {\n";
3498 OS << " findNonImmUse(N, Def, found, Visited);\n";
3499 OS << " } else {\n";
3500 OS << " found = true;\n";
3507 OS << "static bool isNonImmUse(SDNode* Use, SDNode* Def) {\n";
3508 OS << " std::set<SDNode *> Visited;\n";
3509 OS << " bool found = false;\n";
3510 OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {\n";
3511 OS << " SDNode *N = Use->getOperand(i).Val;\n";
3512 OS << " if (N != Def) {\n";
3513 OS << " findNonImmUse(N, Def, found, Visited);\n";
3514 OS << " if (found) break;\n";
3517 OS << " return found;\n";
3521 OS << "// AddHandleReplacement - Note the pending replacement node for a\n"
3522 << "// handle node in ReplaceMap.\n";
3523 OS << "void AddHandleReplacement(SDNode *H, unsigned HNum, SDNode *R, "
3524 << "unsigned RNum) {\n";
3525 OS << " SDOperand N(H, HNum);\n";
3526 OS << " std::map<SDOperand, SDOperand>::iterator HMI = HandleMap.find(N);\n";
3527 OS << " if (HMI != HandleMap.end()) {\n";
3528 OS << " ReplaceMap[HMI->second] = SDOperand(R, RNum);\n";
3529 OS << " HandleMap.erase(N);\n";
3534 OS << "// SelectDanglingHandles - Select replacements for all `dangling`\n";
3535 OS << "// handles.Some handles do not yet have replacements because the\n";
3536 OS << "// nodes they replacements have only dead readers.\n";
3537 OS << "void SelectDanglingHandles() {\n";
3538 OS << " for (std::map<SDOperand, SDOperand>::iterator I = "
3539 << "HandleMap.begin(),\n"
3540 << " E = HandleMap.end(); I != E; ++I) {\n";
3541 OS << " SDOperand N = I->first;\n";
3542 OS << " SDOperand R;\n";
3543 OS << " Select(R, N.getValue(0));\n";
3544 OS << " AddHandleReplacement(N.Val, N.ResNo, R.Val, R.ResNo);\n";
3548 OS << "// ReplaceHandles - Replace all the handles with the real target\n";
3549 OS << "// specific nodes.\n";
3550 OS << "void ReplaceHandles() {\n";
3551 OS << " for (std::map<SDOperand, SDOperand>::iterator I = "
3552 << "ReplaceMap.begin(),\n"
3553 << " E = ReplaceMap.end(); I != E; ++I) {\n";
3554 OS << " SDOperand From = I->first;\n";
3555 OS << " SDOperand To = I->second;\n";
3556 OS << " for (SDNode::use_iterator UI = From.Val->use_begin(), "
3557 << "E = From.Val->use_end(); UI != E; ++UI) {\n";
3558 OS << " SDNode *Use = *UI;\n";
3559 OS << " std::vector<SDOperand> Ops;\n";
3560 OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i){\n";
3561 OS << " SDOperand O = Use->getOperand(i);\n";
3562 OS << " if (O.Val == From.Val)\n";
3563 OS << " Ops.push_back(To);\n";
3565 OS << " Ops.push_back(O);\n";
3567 OS << " SDOperand U = SDOperand(Use, 0);\n";
3568 OS << " CurDAG->UpdateNodeOperands(U, Ops);\n";
3574 OS << "// UpdateFoldedChain - return a SDOperand of the new chain created\n";
3575 OS << "// if the folding were to happen. This is called when, for example,\n";
3576 OS << "// a load is folded into a store. If the store's chain is the load,\n";
3577 OS << "// then the resulting node's input chain would be the load's input\n";
3578 OS << "// chain. If the store's chain is a TokenFactor and the load's\n";
3579 OS << "// output chain feeds into in, then the new chain is a TokenFactor\n";
3580 OS << "// with the other operands along with the input chain of the load.\n";
3581 OS << "SDOperand UpdateFoldedChain(SelectionDAG *DAG, SDNode *N, "
3582 << "SDNode *Chain, SDNode* &OldTF) {\n";
3583 OS << " OldTF = NULL;\n";
3584 OS << " if (N == Chain) {\n";
3585 OS << " return N->getOperand(0);\n";
3586 OS << " } else if (Chain->getOpcode() == ISD::TokenFactor &&\n";
3587 OS << " N->isOperand(Chain)) {\n";
3588 OS << " SDOperand Ch = SDOperand(Chain, 0);\n";
3589 OS << " std::map<SDOperand, SDOperand>::iterator CGMI = "
3590 << "CodeGenMap.find(Ch);\n";
3591 OS << " if (CGMI != CodeGenMap.end())\n";
3592 OS << " return SDOperand(0, 0);\n";
3593 OS << " OldTF = Chain;\n";
3594 OS << " std::vector<SDOperand> Ops;\n";
3595 OS << " for (unsigned i = 0; i < Chain->getNumOperands(); ++i) {\n";
3596 OS << " SDOperand Op = Chain->getOperand(i);\n";
3597 OS << " if (Op.Val == N)\n";
3598 OS << " Ops.push_back(N->getOperand(0));\n";
3600 OS << " Ops.push_back(Op);\n";
3602 OS << " return DAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n";
3604 OS << " return SDOperand(0, 0);\n";
3608 OS << "// SelectRoot - Top level entry to DAG isel.\n";
3609 OS << "SDOperand SelectRoot(SDOperand N) {\n";
3610 OS << " SDOperand ResNode;\n";
3611 OS << " Select(ResNode, N);\n";
3612 OS << " SelectDanglingHandles();\n";
3613 OS << " ReplaceHandles();\n";
3614 OS << " ReplaceMap.clear();\n";
3615 OS << " return ResNode;\n";
3618 Intrinsics = LoadIntrinsics(Records);
3620 ParseNodeTransforms(OS);
3621 ParseComplexPatterns();
3622 ParsePatternFragments(OS);
3623 ParseInstructions();
3626 // Generate variants. For example, commutative patterns can match
3627 // multiple ways. Add them to PatternsToMatch as well.
3631 DEBUG(std::cerr << "\n\nALL PATTERNS TO MATCH:\n\n";
3632 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
3633 std::cerr << "PATTERN: "; PatternsToMatch[i].getSrcPattern()->dump();
3634 std::cerr << "\nRESULT: ";PatternsToMatch[i].getDstPattern()->dump();
3638 // At this point, we have full information about the 'Patterns' we need to
3639 // parse, both implicitly from instructions as well as from explicit pattern
3640 // definitions. Emit the resultant instruction selector.
3641 EmitInstructionSelector(OS);
3643 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
3644 E = PatternFragments.end(); I != E; ++I)
3646 PatternFragments.clear();
3648 Instructions.clear();