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"
18 #include "llvm/Support/MathExtras.h"
19 #include "llvm/Support/Streams.h"
24 //===----------------------------------------------------------------------===//
25 // Helpers for working with extended types.
27 /// FilterVTs - Filter a list of VT's according to a predicate.
30 static std::vector<MVT::ValueType>
31 FilterVTs(const std::vector<MVT::ValueType> &InVTs, T Filter) {
32 std::vector<MVT::ValueType> Result;
33 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
35 Result.push_back(InVTs[i]);
40 static std::vector<unsigned char>
41 FilterEVTs(const std::vector<unsigned char> &InVTs, T Filter) {
42 std::vector<unsigned char> Result;
43 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
44 if (Filter((MVT::ValueType)InVTs[i]))
45 Result.push_back(InVTs[i]);
49 static std::vector<unsigned char>
50 ConvertVTs(const std::vector<MVT::ValueType> &InVTs) {
51 std::vector<unsigned char> Result;
52 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
53 Result.push_back(InVTs[i]);
57 static bool LHSIsSubsetOfRHS(const std::vector<unsigned char> &LHS,
58 const std::vector<unsigned char> &RHS) {
59 if (LHS.size() > RHS.size()) return false;
60 for (unsigned i = 0, e = LHS.size(); i != e; ++i)
61 if (std::find(RHS.begin(), RHS.end(), LHS[i]) == RHS.end())
66 /// isExtIntegerVT - Return true if the specified extended value type vector
67 /// contains isInt or an integer value type.
68 static bool isExtIntegerInVTs(const std::vector<unsigned char> &EVTs) {
69 assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
70 return EVTs[0] == MVT::isInt || !(FilterEVTs(EVTs, MVT::isInteger).empty());
73 /// isExtFloatingPointVT - Return true if the specified extended value type
74 /// vector contains isFP or a FP value type.
75 static bool isExtFloatingPointInVTs(const std::vector<unsigned char> &EVTs) {
76 assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
77 return EVTs[0] == MVT::isFP ||
78 !(FilterEVTs(EVTs, MVT::isFloatingPoint).empty());
81 //===----------------------------------------------------------------------===//
82 // SDTypeConstraint implementation
85 SDTypeConstraint::SDTypeConstraint(Record *R) {
86 OperandNo = R->getValueAsInt("OperandNum");
88 if (R->isSubClassOf("SDTCisVT")) {
89 ConstraintType = SDTCisVT;
90 x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT"));
91 } else if (R->isSubClassOf("SDTCisPtrTy")) {
92 ConstraintType = SDTCisPtrTy;
93 } else if (R->isSubClassOf("SDTCisInt")) {
94 ConstraintType = SDTCisInt;
95 } else if (R->isSubClassOf("SDTCisFP")) {
96 ConstraintType = SDTCisFP;
97 } else if (R->isSubClassOf("SDTCisSameAs")) {
98 ConstraintType = SDTCisSameAs;
99 x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
100 } else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
101 ConstraintType = SDTCisVTSmallerThanOp;
102 x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
103 R->getValueAsInt("OtherOperandNum");
104 } else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) {
105 ConstraintType = SDTCisOpSmallerThanOp;
106 x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
107 R->getValueAsInt("BigOperandNum");
108 } else if (R->isSubClassOf("SDTCisIntVectorOfSameSize")) {
109 ConstraintType = SDTCisIntVectorOfSameSize;
110 x.SDTCisIntVectorOfSameSize_Info.OtherOperandNum =
111 R->getValueAsInt("OtherOpNum");
113 cerr << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
118 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
119 /// N, which has NumResults results.
120 TreePatternNode *SDTypeConstraint::getOperandNum(unsigned OpNo,
122 unsigned NumResults) const {
123 assert(NumResults <= 1 &&
124 "We only work with nodes with zero or one result so far!");
126 if (OpNo >= (NumResults + N->getNumChildren())) {
127 cerr << "Invalid operand number " << OpNo << " ";
133 if (OpNo < NumResults)
134 return N; // FIXME: need value #
136 return N->getChild(OpNo-NumResults);
139 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
140 /// constraint to the nodes operands. This returns true if it makes a
141 /// change, false otherwise. If a type contradiction is found, throw an
143 bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
144 const SDNodeInfo &NodeInfo,
145 TreePattern &TP) const {
146 unsigned NumResults = NodeInfo.getNumResults();
147 assert(NumResults <= 1 &&
148 "We only work with nodes with zero or one result so far!");
150 // Check that the number of operands is sane. Negative operands -> varargs.
151 if (NodeInfo.getNumOperands() >= 0) {
152 if (N->getNumChildren() != (unsigned)NodeInfo.getNumOperands())
153 TP.error(N->getOperator()->getName() + " node requires exactly " +
154 itostr(NodeInfo.getNumOperands()) + " operands!");
157 const CodeGenTarget &CGT = TP.getDAGISelEmitter().getTargetInfo();
159 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NumResults);
161 switch (ConstraintType) {
162 default: assert(0 && "Unknown constraint type!");
164 // Operand must be a particular type.
165 return NodeToApply->UpdateNodeType(x.SDTCisVT_Info.VT, TP);
167 // Operand must be same as target pointer type.
168 return NodeToApply->UpdateNodeType(MVT::iPTR, TP);
171 // If there is only one integer type supported, this must be it.
172 std::vector<MVT::ValueType> IntVTs =
173 FilterVTs(CGT.getLegalValueTypes(), MVT::isInteger);
175 // If we found exactly one supported integer type, apply it.
176 if (IntVTs.size() == 1)
177 return NodeToApply->UpdateNodeType(IntVTs[0], TP);
178 return NodeToApply->UpdateNodeType(MVT::isInt, TP);
181 // If there is only one FP type supported, this must be it.
182 std::vector<MVT::ValueType> FPVTs =
183 FilterVTs(CGT.getLegalValueTypes(), MVT::isFloatingPoint);
185 // If we found exactly one supported FP type, apply it.
186 if (FPVTs.size() == 1)
187 return NodeToApply->UpdateNodeType(FPVTs[0], TP);
188 return NodeToApply->UpdateNodeType(MVT::isFP, TP);
191 TreePatternNode *OtherNode =
192 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NumResults);
193 return NodeToApply->UpdateNodeType(OtherNode->getExtTypes(), TP) |
194 OtherNode->UpdateNodeType(NodeToApply->getExtTypes(), TP);
196 case SDTCisVTSmallerThanOp: {
197 // The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
198 // have an integer type that is smaller than the VT.
199 if (!NodeToApply->isLeaf() ||
200 !dynamic_cast<DefInit*>(NodeToApply->getLeafValue()) ||
201 !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
202 ->isSubClassOf("ValueType"))
203 TP.error(N->getOperator()->getName() + " expects a VT operand!");
205 getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef());
206 if (!MVT::isInteger(VT))
207 TP.error(N->getOperator()->getName() + " VT operand must be integer!");
209 TreePatternNode *OtherNode =
210 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N,NumResults);
212 // It must be integer.
213 bool MadeChange = false;
214 MadeChange |= OtherNode->UpdateNodeType(MVT::isInt, TP);
216 // This code only handles nodes that have one type set. Assert here so
217 // that we can change this if we ever need to deal with multiple value
218 // types at this point.
219 assert(OtherNode->getExtTypes().size() == 1 && "Node has too many types!");
220 if (OtherNode->hasTypeSet() && OtherNode->getTypeNum(0) <= VT)
221 OtherNode->UpdateNodeType(MVT::Other, TP); // Throw an error.
224 case SDTCisOpSmallerThanOp: {
225 TreePatternNode *BigOperand =
226 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NumResults);
228 // Both operands must be integer or FP, but we don't care which.
229 bool MadeChange = false;
231 // This code does not currently handle nodes which have multiple types,
232 // where some types are integer, and some are fp. Assert that this is not
234 assert(!(isExtIntegerInVTs(NodeToApply->getExtTypes()) &&
235 isExtFloatingPointInVTs(NodeToApply->getExtTypes())) &&
236 !(isExtIntegerInVTs(BigOperand->getExtTypes()) &&
237 isExtFloatingPointInVTs(BigOperand->getExtTypes())) &&
238 "SDTCisOpSmallerThanOp does not handle mixed int/fp types!");
239 if (isExtIntegerInVTs(NodeToApply->getExtTypes()))
240 MadeChange |= BigOperand->UpdateNodeType(MVT::isInt, TP);
241 else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes()))
242 MadeChange |= BigOperand->UpdateNodeType(MVT::isFP, TP);
243 if (isExtIntegerInVTs(BigOperand->getExtTypes()))
244 MadeChange |= NodeToApply->UpdateNodeType(MVT::isInt, TP);
245 else if (isExtFloatingPointInVTs(BigOperand->getExtTypes()))
246 MadeChange |= NodeToApply->UpdateNodeType(MVT::isFP, TP);
248 std::vector<MVT::ValueType> VTs = CGT.getLegalValueTypes();
250 if (isExtIntegerInVTs(NodeToApply->getExtTypes())) {
251 VTs = FilterVTs(VTs, MVT::isInteger);
252 } else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes())) {
253 VTs = FilterVTs(VTs, MVT::isFloatingPoint);
258 switch (VTs.size()) {
259 default: // Too many VT's to pick from.
260 case 0: break; // No info yet.
262 // Only one VT of this flavor. Cannot ever satisify the constraints.
263 return NodeToApply->UpdateNodeType(MVT::Other, TP); // throw
265 // If we have exactly two possible types, the little operand must be the
266 // small one, the big operand should be the big one. Common with
267 // float/double for example.
268 assert(VTs[0] < VTs[1] && "Should be sorted!");
269 MadeChange |= NodeToApply->UpdateNodeType(VTs[0], TP);
270 MadeChange |= BigOperand->UpdateNodeType(VTs[1], TP);
275 case SDTCisIntVectorOfSameSize: {
276 TreePatternNode *OtherOperand =
277 getOperandNum(x.SDTCisIntVectorOfSameSize_Info.OtherOperandNum,
279 if (OtherOperand->hasTypeSet()) {
280 if (!MVT::isVector(OtherOperand->getTypeNum(0)))
281 TP.error(N->getOperator()->getName() + " VT operand must be a vector!");
282 MVT::ValueType IVT = OtherOperand->getTypeNum(0);
283 IVT = MVT::getIntVectorWithNumElements(MVT::getVectorNumElements(IVT));
284 return NodeToApply->UpdateNodeType(IVT, TP);
293 //===----------------------------------------------------------------------===//
294 // SDNodeInfo implementation
296 SDNodeInfo::SDNodeInfo(Record *R) : Def(R) {
297 EnumName = R->getValueAsString("Opcode");
298 SDClassName = R->getValueAsString("SDClass");
299 Record *TypeProfile = R->getValueAsDef("TypeProfile");
300 NumResults = TypeProfile->getValueAsInt("NumResults");
301 NumOperands = TypeProfile->getValueAsInt("NumOperands");
303 // Parse the properties.
305 std::vector<Record*> PropList = R->getValueAsListOfDefs("Properties");
306 for (unsigned i = 0, e = PropList.size(); i != e; ++i) {
307 if (PropList[i]->getName() == "SDNPCommutative") {
308 Properties |= 1 << SDNPCommutative;
309 } else if (PropList[i]->getName() == "SDNPAssociative") {
310 Properties |= 1 << SDNPAssociative;
311 } else if (PropList[i]->getName() == "SDNPHasChain") {
312 Properties |= 1 << SDNPHasChain;
313 } else if (PropList[i]->getName() == "SDNPOutFlag") {
314 Properties |= 1 << SDNPOutFlag;
315 } else if (PropList[i]->getName() == "SDNPInFlag") {
316 Properties |= 1 << SDNPInFlag;
317 } else if (PropList[i]->getName() == "SDNPOptInFlag") {
318 Properties |= 1 << SDNPOptInFlag;
320 cerr << "Unknown SD Node property '" << PropList[i]->getName()
321 << "' on node '" << R->getName() << "'!\n";
327 // Parse the type constraints.
328 std::vector<Record*> ConstraintList =
329 TypeProfile->getValueAsListOfDefs("Constraints");
330 TypeConstraints.assign(ConstraintList.begin(), ConstraintList.end());
333 //===----------------------------------------------------------------------===//
334 // TreePatternNode implementation
337 TreePatternNode::~TreePatternNode() {
338 #if 0 // FIXME: implement refcounted tree nodes!
339 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
344 /// UpdateNodeType - Set the node type of N to VT if VT contains
345 /// information. If N already contains a conflicting type, then throw an
346 /// exception. This returns true if any information was updated.
348 bool TreePatternNode::UpdateNodeType(const std::vector<unsigned char> &ExtVTs,
350 assert(!ExtVTs.empty() && "Cannot update node type with empty type vector!");
352 if (ExtVTs[0] == MVT::isUnknown || LHSIsSubsetOfRHS(getExtTypes(), ExtVTs))
354 if (isTypeCompletelyUnknown() || LHSIsSubsetOfRHS(ExtVTs, getExtTypes())) {
359 if (getExtTypeNum(0) == MVT::iPTR) {
360 if (ExtVTs[0] == MVT::iPTR || ExtVTs[0] == MVT::isInt)
362 if (isExtIntegerInVTs(ExtVTs)) {
363 std::vector<unsigned char> FVTs = FilterEVTs(ExtVTs, MVT::isInteger);
371 if (ExtVTs[0] == MVT::isInt && isExtIntegerInVTs(getExtTypes())) {
372 assert(hasTypeSet() && "should be handled above!");
373 std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), MVT::isInteger);
374 if (getExtTypes() == FVTs)
379 if (ExtVTs[0] == MVT::iPTR && isExtIntegerInVTs(getExtTypes())) {
380 //assert(hasTypeSet() && "should be handled above!");
381 std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), MVT::isInteger);
382 if (getExtTypes() == FVTs)
389 if (ExtVTs[0] == MVT::isFP && isExtFloatingPointInVTs(getExtTypes())) {
390 assert(hasTypeSet() && "should be handled above!");
391 std::vector<unsigned char> FVTs =
392 FilterEVTs(getExtTypes(), MVT::isFloatingPoint);
393 if (getExtTypes() == FVTs)
399 // If we know this is an int or fp type, and we are told it is a specific one,
402 // Similarly, we should probably set the type here to the intersection of
403 // {isInt|isFP} and ExtVTs
404 if ((getExtTypeNum(0) == MVT::isInt && isExtIntegerInVTs(ExtVTs)) ||
405 (getExtTypeNum(0) == MVT::isFP && isExtFloatingPointInVTs(ExtVTs))) {
409 if (getExtTypeNum(0) == MVT::isInt && ExtVTs[0] == MVT::iPTR) {
417 TP.error("Type inference contradiction found in node!");
419 TP.error("Type inference contradiction found in node " +
420 getOperator()->getName() + "!");
422 return true; // unreachable
426 void TreePatternNode::print(std::ostream &OS) const {
428 OS << *getLeafValue();
430 OS << "(" << getOperator()->getName();
433 // FIXME: At some point we should handle printing all the value types for
434 // nodes that are multiply typed.
435 switch (getExtTypeNum(0)) {
436 case MVT::Other: OS << ":Other"; break;
437 case MVT::isInt: OS << ":isInt"; break;
438 case MVT::isFP : OS << ":isFP"; break;
439 case MVT::isUnknown: ; /*OS << ":?";*/ break;
440 case MVT::iPTR: OS << ":iPTR"; break;
442 std::string VTName = llvm::getName(getTypeNum(0));
443 // Strip off MVT:: prefix if present.
444 if (VTName.substr(0,5) == "MVT::")
445 VTName = VTName.substr(5);
452 if (getNumChildren() != 0) {
454 getChild(0)->print(OS);
455 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
457 getChild(i)->print(OS);
463 if (!PredicateFn.empty())
464 OS << "<<P:" << PredicateFn << ">>";
466 OS << "<<X:" << TransformFn->getName() << ">>";
467 if (!getName().empty())
468 OS << ":$" << getName();
471 void TreePatternNode::dump() const {
472 print(*cerr.stream());
475 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
476 /// the specified node. For this comparison, all of the state of the node
477 /// is considered, except for the assigned name. Nodes with differing names
478 /// that are otherwise identical are considered isomorphic.
479 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N) const {
480 if (N == this) return true;
481 if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
482 getPredicateFn() != N->getPredicateFn() ||
483 getTransformFn() != N->getTransformFn())
487 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue()))
488 if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue()))
489 return DI->getDef() == NDI->getDef();
490 return getLeafValue() == N->getLeafValue();
493 if (N->getOperator() != getOperator() ||
494 N->getNumChildren() != getNumChildren()) return false;
495 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
496 if (!getChild(i)->isIsomorphicTo(N->getChild(i)))
501 /// clone - Make a copy of this tree and all of its children.
503 TreePatternNode *TreePatternNode::clone() const {
504 TreePatternNode *New;
506 New = new TreePatternNode(getLeafValue());
508 std::vector<TreePatternNode*> CChildren;
509 CChildren.reserve(Children.size());
510 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
511 CChildren.push_back(getChild(i)->clone());
512 New = new TreePatternNode(getOperator(), CChildren);
514 New->setName(getName());
515 New->setTypes(getExtTypes());
516 New->setPredicateFn(getPredicateFn());
517 New->setTransformFn(getTransformFn());
521 /// SubstituteFormalArguments - Replace the formal arguments in this tree
522 /// with actual values specified by ArgMap.
523 void TreePatternNode::
524 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
525 if (isLeaf()) return;
527 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
528 TreePatternNode *Child = getChild(i);
529 if (Child->isLeaf()) {
530 Init *Val = Child->getLeafValue();
531 if (dynamic_cast<DefInit*>(Val) &&
532 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
533 // We found a use of a formal argument, replace it with its value.
534 Child = ArgMap[Child->getName()];
535 assert(Child && "Couldn't find formal argument!");
539 getChild(i)->SubstituteFormalArguments(ArgMap);
545 /// InlinePatternFragments - If this pattern refers to any pattern
546 /// fragments, inline them into place, giving us a pattern without any
547 /// PatFrag references.
548 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
549 if (isLeaf()) return this; // nothing to do.
550 Record *Op = getOperator();
552 if (!Op->isSubClassOf("PatFrag")) {
553 // Just recursively inline children nodes.
554 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
555 setChild(i, getChild(i)->InlinePatternFragments(TP));
559 // Otherwise, we found a reference to a fragment. First, look up its
560 // TreePattern record.
561 TreePattern *Frag = TP.getDAGISelEmitter().getPatternFragment(Op);
563 // Verify that we are passing the right number of operands.
564 if (Frag->getNumArgs() != Children.size())
565 TP.error("'" + Op->getName() + "' fragment requires " +
566 utostr(Frag->getNumArgs()) + " operands!");
568 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
570 // Resolve formal arguments to their actual value.
571 if (Frag->getNumArgs()) {
572 // Compute the map of formal to actual arguments.
573 std::map<std::string, TreePatternNode*> ArgMap;
574 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
575 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
577 FragTree->SubstituteFormalArguments(ArgMap);
580 FragTree->setName(getName());
581 FragTree->UpdateNodeType(getExtTypes(), TP);
583 // Get a new copy of this fragment to stitch into here.
584 //delete this; // FIXME: implement refcounting!
588 /// getImplicitType - Check to see if the specified record has an implicit
589 /// type which should be applied to it. This infer the type of register
590 /// references from the register file information, for example.
592 static std::vector<unsigned char> getImplicitType(Record *R, bool NotRegisters,
594 // Some common return values
595 std::vector<unsigned char> Unknown(1, MVT::isUnknown);
596 std::vector<unsigned char> Other(1, MVT::Other);
598 // Check to see if this is a register or a register class...
599 if (R->isSubClassOf("RegisterClass")) {
602 const CodeGenRegisterClass &RC =
603 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(R);
604 return ConvertVTs(RC.getValueTypes());
605 } else if (R->isSubClassOf("PatFrag")) {
606 // Pattern fragment types will be resolved when they are inlined.
608 } else if (R->isSubClassOf("Register")) {
611 const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
612 return T.getRegisterVTs(R);
613 } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
614 // Using a VTSDNode or CondCodeSDNode.
616 } else if (R->isSubClassOf("ComplexPattern")) {
619 std::vector<unsigned char>
620 ComplexPat(1, TP.getDAGISelEmitter().getComplexPattern(R).getValueType());
622 } else if (R->getName() == "ptr_rc") {
623 Other[0] = MVT::iPTR;
625 } else if (R->getName() == "node" || R->getName() == "srcvalue" ||
626 R->getName() == "zero_reg") {
631 TP.error("Unknown node flavor used in pattern: " + R->getName());
635 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
636 /// this node and its children in the tree. This returns true if it makes a
637 /// change, false otherwise. If a type contradiction is found, throw an
639 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
640 DAGISelEmitter &ISE = TP.getDAGISelEmitter();
642 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
643 // If it's a regclass or something else known, include the type.
644 return UpdateNodeType(getImplicitType(DI->getDef(), NotRegisters, TP),TP);
645 } else if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
646 // Int inits are always integers. :)
647 bool MadeChange = UpdateNodeType(MVT::isInt, TP);
650 // At some point, it may make sense for this tree pattern to have
651 // multiple types. Assert here that it does not, so we revisit this
652 // code when appropriate.
653 assert(getExtTypes().size() >= 1 && "TreePattern doesn't have a type!");
654 MVT::ValueType VT = getTypeNum(0);
655 for (unsigned i = 1, e = getExtTypes().size(); i != e; ++i)
656 assert(getTypeNum(i) == VT && "TreePattern has too many types!");
659 if (VT != MVT::iPTR) {
660 unsigned Size = MVT::getSizeInBits(VT);
661 // Make sure that the value is representable for this type.
663 int Val = (II->getValue() << (32-Size)) >> (32-Size);
664 if (Val != II->getValue())
665 TP.error("Sign-extended integer value '" + itostr(II->getValue())+
666 "' is out of range for type '" +
667 getEnumName(getTypeNum(0)) + "'!");
677 // special handling for set, which isn't really an SDNode.
678 if (getOperator()->getName() == "set") {
679 assert (getNumChildren() >= 2 && "Missing RHS of a set?");
680 unsigned NC = getNumChildren();
681 bool MadeChange = false;
682 for (unsigned i = 0; i < NC-1; ++i) {
683 MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
684 MadeChange |= getChild(NC-1)->ApplyTypeConstraints(TP, NotRegisters);
686 // Types of operands must match.
687 MadeChange |= getChild(i)->UpdateNodeType(getChild(NC-1)->getExtTypes(),
689 MadeChange |= getChild(NC-1)->UpdateNodeType(getChild(i)->getExtTypes(),
691 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
694 } else if (getOperator()->getName() == "implicit" ||
695 getOperator()->getName() == "parallel") {
696 bool MadeChange = false;
697 for (unsigned i = 0; i < getNumChildren(); ++i)
698 MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
699 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
701 } else if (getOperator() == ISE.get_intrinsic_void_sdnode() ||
702 getOperator() == ISE.get_intrinsic_w_chain_sdnode() ||
703 getOperator() == ISE.get_intrinsic_wo_chain_sdnode()) {
705 dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
706 const CodeGenIntrinsic &Int = ISE.getIntrinsicInfo(IID);
707 bool MadeChange = false;
709 // Apply the result type to the node.
710 MadeChange = UpdateNodeType(Int.ArgVTs[0], TP);
712 if (getNumChildren() != Int.ArgVTs.size())
713 TP.error("Intrinsic '" + Int.Name + "' expects " +
714 utostr(Int.ArgVTs.size()-1) + " operands, not " +
715 utostr(getNumChildren()-1) + " operands!");
717 // Apply type info to the intrinsic ID.
718 MadeChange |= getChild(0)->UpdateNodeType(MVT::iPTR, TP);
720 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
721 MVT::ValueType OpVT = Int.ArgVTs[i];
722 MadeChange |= getChild(i)->UpdateNodeType(OpVT, TP);
723 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
726 } else if (getOperator()->isSubClassOf("SDNode")) {
727 const SDNodeInfo &NI = ISE.getSDNodeInfo(getOperator());
729 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
730 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
731 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
732 // Branch, etc. do not produce results and top-level forms in instr pattern
733 // must have void types.
734 if (NI.getNumResults() == 0)
735 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
737 // If this is a vector_shuffle operation, apply types to the build_vector
738 // operation. The types of the integers don't matter, but this ensures they
739 // won't get checked.
740 if (getOperator()->getName() == "vector_shuffle" &&
741 getChild(2)->getOperator()->getName() == "build_vector") {
742 TreePatternNode *BV = getChild(2);
743 const std::vector<MVT::ValueType> &LegalVTs
744 = ISE.getTargetInfo().getLegalValueTypes();
745 MVT::ValueType LegalIntVT = MVT::Other;
746 for (unsigned i = 0, e = LegalVTs.size(); i != e; ++i)
747 if (MVT::isInteger(LegalVTs[i]) && !MVT::isVector(LegalVTs[i])) {
748 LegalIntVT = LegalVTs[i];
751 assert(LegalIntVT != MVT::Other && "No legal integer VT?");
753 for (unsigned i = 0, e = BV->getNumChildren(); i != e; ++i)
754 MadeChange |= BV->getChild(i)->UpdateNodeType(LegalIntVT, TP);
757 } else if (getOperator()->isSubClassOf("Instruction")) {
758 const DAGInstruction &Inst = ISE.getInstruction(getOperator());
759 bool MadeChange = false;
760 unsigned NumResults = Inst.getNumResults();
762 assert(NumResults <= 1 &&
763 "Only supports zero or one result instrs!");
765 CodeGenInstruction &InstInfo =
766 ISE.getTargetInfo().getInstruction(getOperator()->getName());
767 // Apply the result type to the node
768 if (NumResults == 0 || InstInfo.NumDefs == 0) {
769 MadeChange = UpdateNodeType(MVT::isVoid, TP);
771 Record *ResultNode = Inst.getResult(0);
773 if (ResultNode->getName() == "ptr_rc") {
774 std::vector<unsigned char> VT;
775 VT.push_back(MVT::iPTR);
776 MadeChange = UpdateNodeType(VT, TP);
778 assert(ResultNode->isSubClassOf("RegisterClass") &&
779 "Operands should be register classes!");
781 const CodeGenRegisterClass &RC =
782 ISE.getTargetInfo().getRegisterClass(ResultNode);
783 MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
787 unsigned ChildNo = 0;
788 for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i) {
789 Record *OperandNode = Inst.getOperand(i);
791 // If the instruction expects a predicate or optional def operand, we
792 // codegen this by setting the operand to it's default value if it has a
793 // non-empty DefaultOps field.
794 if ((OperandNode->isSubClassOf("PredicateOperand") ||
795 OperandNode->isSubClassOf("OptionalDefOperand")) &&
796 !ISE.getDefaultOperand(OperandNode).DefaultOps.empty())
799 // Verify that we didn't run out of provided operands.
800 if (ChildNo >= getNumChildren())
801 TP.error("Instruction '" + getOperator()->getName() +
802 "' expects more operands than were provided.");
805 TreePatternNode *Child = getChild(ChildNo++);
806 if (OperandNode->isSubClassOf("RegisterClass")) {
807 const CodeGenRegisterClass &RC =
808 ISE.getTargetInfo().getRegisterClass(OperandNode);
809 MadeChange |= Child->UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
810 } else if (OperandNode->isSubClassOf("Operand")) {
811 VT = getValueType(OperandNode->getValueAsDef("Type"));
812 MadeChange |= Child->UpdateNodeType(VT, TP);
813 } else if (OperandNode->getName() == "ptr_rc") {
814 MadeChange |= Child->UpdateNodeType(MVT::iPTR, TP);
816 assert(0 && "Unknown operand type!");
819 MadeChange |= Child->ApplyTypeConstraints(TP, NotRegisters);
822 if (ChildNo != getNumChildren())
823 TP.error("Instruction '" + getOperator()->getName() +
824 "' was provided too many operands!");
828 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
830 // Node transforms always take one operand.
831 if (getNumChildren() != 1)
832 TP.error("Node transform '" + getOperator()->getName() +
833 "' requires one operand!");
835 // If either the output or input of the xform does not have exact
836 // type info. We assume they must be the same. Otherwise, it is perfectly
837 // legal to transform from one type to a completely different type.
838 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
839 bool MadeChange = UpdateNodeType(getChild(0)->getExtTypes(), TP);
840 MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), TP);
847 /// OnlyOnRHSOfCommutative - Return true if this value is only allowed on the
848 /// RHS of a commutative operation, not the on LHS.
849 static bool OnlyOnRHSOfCommutative(TreePatternNode *N) {
850 if (!N->isLeaf() && N->getOperator()->getName() == "imm")
852 if (N->isLeaf() && dynamic_cast<IntInit*>(N->getLeafValue()))
858 /// canPatternMatch - If it is impossible for this pattern to match on this
859 /// target, fill in Reason and return false. Otherwise, return true. This is
860 /// used as a santity check for .td files (to prevent people from writing stuff
861 /// that can never possibly work), and to prevent the pattern permuter from
862 /// generating stuff that is useless.
863 bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){
864 if (isLeaf()) return true;
866 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
867 if (!getChild(i)->canPatternMatch(Reason, ISE))
870 // If this is an intrinsic, handle cases that would make it not match. For
871 // example, if an operand is required to be an immediate.
872 if (getOperator()->isSubClassOf("Intrinsic")) {
877 // If this node is a commutative operator, check that the LHS isn't an
879 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
880 if (NodeInfo.hasProperty(SDNPCommutative)) {
881 // Scan all of the operands of the node and make sure that only the last one
882 // is a constant node, unless the RHS also is.
883 if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
884 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i)
885 if (OnlyOnRHSOfCommutative(getChild(i))) {
886 Reason="Immediate value must be on the RHS of commutative operators!";
895 //===----------------------------------------------------------------------===//
896 // TreePattern implementation
899 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
900 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
901 isInputPattern = isInput;
902 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
903 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
906 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
907 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
908 isInputPattern = isInput;
909 Trees.push_back(ParseTreePattern(Pat));
912 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
913 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
914 isInputPattern = isInput;
915 Trees.push_back(Pat);
920 void TreePattern::error(const std::string &Msg) const {
922 throw "In " + TheRecord->getName() + ": " + Msg;
925 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
926 DefInit *OpDef = dynamic_cast<DefInit*>(Dag->getOperator());
927 if (!OpDef) error("Pattern has unexpected operator type!");
928 Record *Operator = OpDef->getDef();
930 if (Operator->isSubClassOf("ValueType")) {
931 // If the operator is a ValueType, then this must be "type cast" of a leaf
933 if (Dag->getNumArgs() != 1)
934 error("Type cast only takes one operand!");
936 Init *Arg = Dag->getArg(0);
937 TreePatternNode *New;
938 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
939 Record *R = DI->getDef();
940 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
941 Dag->setArg(0, new DagInit(DI,
942 std::vector<std::pair<Init*, std::string> >()));
943 return ParseTreePattern(Dag);
945 New = new TreePatternNode(DI);
946 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
947 New = ParseTreePattern(DI);
948 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
949 New = new TreePatternNode(II);
950 if (!Dag->getArgName(0).empty())
951 error("Constant int argument should not have a name!");
952 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
953 // Turn this into an IntInit.
954 Init *II = BI->convertInitializerTo(new IntRecTy());
955 if (II == 0 || !dynamic_cast<IntInit*>(II))
956 error("Bits value must be constants!");
958 New = new TreePatternNode(dynamic_cast<IntInit*>(II));
959 if (!Dag->getArgName(0).empty())
960 error("Constant int argument should not have a name!");
963 error("Unknown leaf value for tree pattern!");
967 // Apply the type cast.
968 New->UpdateNodeType(getValueType(Operator), *this);
969 New->setName(Dag->getArgName(0));
973 // Verify that this is something that makes sense for an operator.
974 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
975 !Operator->isSubClassOf("Instruction") &&
976 !Operator->isSubClassOf("SDNodeXForm") &&
977 !Operator->isSubClassOf("Intrinsic") &&
978 Operator->getName() != "set" &&
979 Operator->getName() != "implicit" &&
980 Operator->getName() != "parallel")
981 error("Unrecognized node '" + Operator->getName() + "'!");
983 // Check to see if this is something that is illegal in an input pattern.
984 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
985 Operator->isSubClassOf("SDNodeXForm")))
986 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
988 std::vector<TreePatternNode*> Children;
990 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
991 Init *Arg = Dag->getArg(i);
992 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
993 Children.push_back(ParseTreePattern(DI));
994 if (Children.back()->getName().empty())
995 Children.back()->setName(Dag->getArgName(i));
996 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
997 Record *R = DefI->getDef();
998 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
999 // TreePatternNode if its own.
1000 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
1001 Dag->setArg(i, new DagInit(DefI,
1002 std::vector<std::pair<Init*, std::string> >()));
1003 --i; // Revisit this node...
1005 TreePatternNode *Node = new TreePatternNode(DefI);
1006 Node->setName(Dag->getArgName(i));
1007 Children.push_back(Node);
1010 if (R->getName() == "node") {
1011 if (Dag->getArgName(i).empty())
1012 error("'node' argument requires a name to match with operand list");
1013 Args.push_back(Dag->getArgName(i));
1016 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
1017 TreePatternNode *Node = new TreePatternNode(II);
1018 if (!Dag->getArgName(i).empty())
1019 error("Constant int argument should not have a name!");
1020 Children.push_back(Node);
1021 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
1022 // Turn this into an IntInit.
1023 Init *II = BI->convertInitializerTo(new IntRecTy());
1024 if (II == 0 || !dynamic_cast<IntInit*>(II))
1025 error("Bits value must be constants!");
1027 TreePatternNode *Node = new TreePatternNode(dynamic_cast<IntInit*>(II));
1028 if (!Dag->getArgName(i).empty())
1029 error("Constant int argument should not have a name!");
1030 Children.push_back(Node);
1035 error("Unknown leaf value for tree pattern!");
1039 // If the operator is an intrinsic, then this is just syntactic sugar for for
1040 // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
1041 // convert the intrinsic name to a number.
1042 if (Operator->isSubClassOf("Intrinsic")) {
1043 const CodeGenIntrinsic &Int = getDAGISelEmitter().getIntrinsic(Operator);
1044 unsigned IID = getDAGISelEmitter().getIntrinsicID(Operator)+1;
1046 // If this intrinsic returns void, it must have side-effects and thus a
1048 if (Int.ArgVTs[0] == MVT::isVoid) {
1049 Operator = getDAGISelEmitter().get_intrinsic_void_sdnode();
1050 } else if (Int.ModRef != CodeGenIntrinsic::NoMem) {
1051 // Has side-effects, requires chain.
1052 Operator = getDAGISelEmitter().get_intrinsic_w_chain_sdnode();
1054 // Otherwise, no chain.
1055 Operator = getDAGISelEmitter().get_intrinsic_wo_chain_sdnode();
1058 TreePatternNode *IIDNode = new TreePatternNode(new IntInit(IID));
1059 Children.insert(Children.begin(), IIDNode);
1062 return new TreePatternNode(Operator, Children);
1065 /// InferAllTypes - Infer/propagate as many types throughout the expression
1066 /// patterns as possible. Return true if all types are infered, false
1067 /// otherwise. Throw an exception if a type contradiction is found.
1068 bool TreePattern::InferAllTypes() {
1069 bool MadeChange = true;
1070 while (MadeChange) {
1072 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1073 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
1076 bool HasUnresolvedTypes = false;
1077 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1078 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
1079 return !HasUnresolvedTypes;
1082 void TreePattern::print(std::ostream &OS) const {
1083 OS << getRecord()->getName();
1084 if (!Args.empty()) {
1085 OS << "(" << Args[0];
1086 for (unsigned i = 1, e = Args.size(); i != e; ++i)
1087 OS << ", " << Args[i];
1092 if (Trees.size() > 1)
1094 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
1096 Trees[i]->print(OS);
1100 if (Trees.size() > 1)
1104 void TreePattern::dump() const { print(*cerr.stream()); }
1108 //===----------------------------------------------------------------------===//
1109 // DAGISelEmitter implementation
1112 // Parse all of the SDNode definitions for the target, populating SDNodes.
1113 void DAGISelEmitter::ParseNodeInfo() {
1114 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
1115 while (!Nodes.empty()) {
1116 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
1120 // Get the buildin intrinsic nodes.
1121 intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
1122 intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
1123 intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
1126 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
1127 /// map, and emit them to the file as functions.
1128 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
1129 OS << "\n// Node transformations.\n";
1130 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
1131 while (!Xforms.empty()) {
1132 Record *XFormNode = Xforms.back();
1133 Record *SDNode = XFormNode->getValueAsDef("Opcode");
1134 std::string Code = XFormNode->getValueAsCode("XFormFunction");
1135 SDNodeXForms.insert(std::make_pair(XFormNode,
1136 std::make_pair(SDNode, Code)));
1138 if (!Code.empty()) {
1139 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
1140 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
1142 OS << "inline SDOperand Transform_" << XFormNode->getName()
1143 << "(SDNode *" << C2 << ") {\n";
1144 if (ClassName != "SDNode")
1145 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
1146 OS << Code << "\n}\n";
1153 void DAGISelEmitter::ParseComplexPatterns() {
1154 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
1155 while (!AMs.empty()) {
1156 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
1162 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
1163 /// file, building up the PatternFragments map. After we've collected them all,
1164 /// inline fragments together as necessary, so that there are no references left
1165 /// inside a pattern fragment to a pattern fragment.
1167 /// This also emits all of the predicate functions to the output file.
1169 void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) {
1170 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
1172 // First step, parse all of the fragments and emit predicate functions.
1173 OS << "\n// Predicate functions.\n";
1174 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1175 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
1176 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
1177 PatternFragments[Fragments[i]] = P;
1179 // Validate the argument list, converting it to map, to discard duplicates.
1180 std::vector<std::string> &Args = P->getArgList();
1181 std::set<std::string> OperandsMap(Args.begin(), Args.end());
1183 if (OperandsMap.count(""))
1184 P->error("Cannot have unnamed 'node' values in pattern fragment!");
1186 // Parse the operands list.
1187 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
1188 DefInit *OpsOp = dynamic_cast<DefInit*>(OpsList->getOperator());
1189 // Special cases: ops == outs == ins. Different names are used to
1190 // improve readibility.
1192 (OpsOp->getDef()->getName() != "ops" &&
1193 OpsOp->getDef()->getName() != "outs" &&
1194 OpsOp->getDef()->getName() != "ins"))
1195 P->error("Operands list should start with '(ops ... '!");
1197 // Copy over the arguments.
1199 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
1200 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
1201 static_cast<DefInit*>(OpsList->getArg(j))->
1202 getDef()->getName() != "node")
1203 P->error("Operands list should all be 'node' values.");
1204 if (OpsList->getArgName(j).empty())
1205 P->error("Operands list should have names for each operand!");
1206 if (!OperandsMap.count(OpsList->getArgName(j)))
1207 P->error("'" + OpsList->getArgName(j) +
1208 "' does not occur in pattern or was multiply specified!");
1209 OperandsMap.erase(OpsList->getArgName(j));
1210 Args.push_back(OpsList->getArgName(j));
1213 if (!OperandsMap.empty())
1214 P->error("Operands list does not contain an entry for operand '" +
1215 *OperandsMap.begin() + "'!");
1217 // If there is a code init for this fragment, emit the predicate code and
1218 // keep track of the fact that this fragment uses it.
1219 std::string Code = Fragments[i]->getValueAsCode("Predicate");
1220 if (!Code.empty()) {
1221 if (P->getOnlyTree()->isLeaf())
1222 OS << "inline bool Predicate_" << Fragments[i]->getName()
1223 << "(SDNode *N) {\n";
1225 std::string ClassName =
1226 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
1227 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
1229 OS << "inline bool Predicate_" << Fragments[i]->getName()
1230 << "(SDNode *" << C2 << ") {\n";
1231 if (ClassName != "SDNode")
1232 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
1234 OS << Code << "\n}\n";
1235 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
1238 // If there is a node transformation corresponding to this, keep track of
1240 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
1241 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
1242 P->getOnlyTree()->setTransformFn(Transform);
1247 // Now that we've parsed all of the tree fragments, do a closure on them so
1248 // that there are not references to PatFrags left inside of them.
1249 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
1250 E = PatternFragments.end(); I != E; ++I) {
1251 TreePattern *ThePat = I->second;
1252 ThePat->InlinePatternFragments();
1254 // Infer as many types as possible. Don't worry about it if we don't infer
1255 // all of them, some may depend on the inputs of the pattern.
1257 ThePat->InferAllTypes();
1259 // If this pattern fragment is not supported by this target (no types can
1260 // satisfy its constraints), just ignore it. If the bogus pattern is
1261 // actually used by instructions, the type consistency error will be
1265 // If debugging, print out the pattern fragment result.
1266 DEBUG(ThePat->dump());
1270 void DAGISelEmitter::ParseDefaultOperands() {
1271 std::vector<Record*> DefaultOps[2];
1272 DefaultOps[0] = Records.getAllDerivedDefinitions("PredicateOperand");
1273 DefaultOps[1] = Records.getAllDerivedDefinitions("OptionalDefOperand");
1275 // Find some SDNode.
1276 assert(!SDNodes.empty() && "No SDNodes parsed?");
1277 Init *SomeSDNode = new DefInit(SDNodes.begin()->first);
1279 for (unsigned iter = 0; iter != 2; ++iter) {
1280 for (unsigned i = 0, e = DefaultOps[iter].size(); i != e; ++i) {
1281 DagInit *DefaultInfo = DefaultOps[iter][i]->getValueAsDag("DefaultOps");
1283 // Clone the DefaultInfo dag node, changing the operator from 'ops' to
1284 // SomeSDnode so that we can parse this.
1285 std::vector<std::pair<Init*, std::string> > Ops;
1286 for (unsigned op = 0, e = DefaultInfo->getNumArgs(); op != e; ++op)
1287 Ops.push_back(std::make_pair(DefaultInfo->getArg(op),
1288 DefaultInfo->getArgName(op)));
1289 DagInit *DI = new DagInit(SomeSDNode, Ops);
1291 // Create a TreePattern to parse this.
1292 TreePattern P(DefaultOps[iter][i], DI, false, *this);
1293 assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!");
1295 // Copy the operands over into a DAGDefaultOperand.
1296 DAGDefaultOperand DefaultOpInfo;
1298 TreePatternNode *T = P.getTree(0);
1299 for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {
1300 TreePatternNode *TPN = T->getChild(op);
1301 while (TPN->ApplyTypeConstraints(P, false))
1302 /* Resolve all types */;
1304 if (TPN->ContainsUnresolvedType())
1306 throw "Value #" + utostr(i) + " of PredicateOperand '" +
1307 DefaultOps[iter][i]->getName() + "' doesn't have a concrete type!";
1309 throw "Value #" + utostr(i) + " of OptionalDefOperand '" +
1310 DefaultOps[iter][i]->getName() + "' doesn't have a concrete type!";
1312 DefaultOpInfo.DefaultOps.push_back(TPN);
1315 // Insert it into the DefaultOperands map so we can find it later.
1316 DefaultOperands[DefaultOps[iter][i]] = DefaultOpInfo;
1321 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1322 /// instruction input. Return true if this is a real use.
1323 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1324 std::map<std::string, TreePatternNode*> &InstInputs,
1325 std::vector<Record*> &InstImpInputs) {
1326 // No name -> not interesting.
1327 if (Pat->getName().empty()) {
1328 if (Pat->isLeaf()) {
1329 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1330 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1331 I->error("Input " + DI->getDef()->getName() + " must be named!");
1332 else if (DI && DI->getDef()->isSubClassOf("Register"))
1333 InstImpInputs.push_back(DI->getDef());
1340 if (Pat->isLeaf()) {
1341 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1342 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1345 assert(Pat->getNumChildren() == 0 && "can't be a use with children!");
1346 Rec = Pat->getOperator();
1349 // SRCVALUE nodes are ignored.
1350 if (Rec->getName() == "srcvalue")
1353 TreePatternNode *&Slot = InstInputs[Pat->getName()];
1358 if (Slot->isLeaf()) {
1359 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1361 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1362 SlotRec = Slot->getOperator();
1365 // Ensure that the inputs agree if we've already seen this input.
1367 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1368 if (Slot->getExtTypes() != Pat->getExtTypes())
1369 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1374 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1375 /// part of "I", the instruction), computing the set of inputs and outputs of
1376 /// the pattern. Report errors if we see anything naughty.
1377 void DAGISelEmitter::
1378 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1379 std::map<std::string, TreePatternNode*> &InstInputs,
1380 std::map<std::string, TreePatternNode*>&InstResults,
1381 std::vector<Record*> &InstImpInputs,
1382 std::vector<Record*> &InstImpResults) {
1383 if (Pat->isLeaf()) {
1384 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1385 if (!isUse && Pat->getTransformFn())
1386 I->error("Cannot specify a transform function for a non-input value!");
1388 } else if (Pat->getOperator()->getName() == "implicit") {
1389 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1390 TreePatternNode *Dest = Pat->getChild(i);
1391 if (!Dest->isLeaf())
1392 I->error("implicitly defined value should be a register!");
1394 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1395 if (!Val || !Val->getDef()->isSubClassOf("Register"))
1396 I->error("implicitly defined value should be a register!");
1397 InstImpResults.push_back(Val->getDef());
1400 } else if (Pat->getOperator()->getName() != "set") {
1401 // If this is not a set, verify that the children nodes are not void typed,
1403 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1404 if (Pat->getChild(i)->getExtTypeNum(0) == MVT::isVoid)
1405 I->error("Cannot have void nodes inside of patterns!");
1406 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
1407 InstImpInputs, InstImpResults);
1410 // If this is a non-leaf node with no children, treat it basically as if
1411 // it were a leaf. This handles nodes like (imm).
1413 if (Pat->getNumChildren() == 0)
1414 isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1416 if (!isUse && Pat->getTransformFn())
1417 I->error("Cannot specify a transform function for a non-input value!");
1421 // Otherwise, this is a set, validate and collect instruction results.
1422 if (Pat->getNumChildren() == 0)
1423 I->error("set requires operands!");
1425 if (Pat->getTransformFn())
1426 I->error("Cannot specify a transform function on a set node!");
1428 // Check the set destinations.
1429 unsigned NumDests = Pat->getNumChildren()-1;
1430 for (unsigned i = 0; i != NumDests; ++i) {
1431 TreePatternNode *Dest = Pat->getChild(i);
1432 if (!Dest->isLeaf())
1433 I->error("set destination should be a register!");
1435 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1437 I->error("set destination should be a register!");
1439 if (Val->getDef()->isSubClassOf("RegisterClass") ||
1440 Val->getDef()->getName() == "ptr_rc") {
1441 if (Dest->getName().empty())
1442 I->error("set destination must have a name!");
1443 if (InstResults.count(Dest->getName()))
1444 I->error("cannot set '" + Dest->getName() +"' multiple times");
1445 InstResults[Dest->getName()] = Dest;
1446 } else if (Val->getDef()->isSubClassOf("Register")) {
1447 InstImpResults.push_back(Val->getDef());
1449 I->error("set destination should be a register!");
1453 // Verify and collect info from the computation.
1454 FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
1455 InstInputs, InstResults,
1456 InstImpInputs, InstImpResults);
1459 /// ParseInstructions - Parse all of the instructions, inlining and resolving
1460 /// any fragments involved. This populates the Instructions list with fully
1461 /// resolved instructions.
1462 void DAGISelEmitter::ParseInstructions() {
1463 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1465 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1468 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1469 LI = Instrs[i]->getValueAsListInit("Pattern");
1471 // If there is no pattern, only collect minimal information about the
1472 // instruction for its operand list. We have to assume that there is one
1473 // result, as we have no detailed info.
1474 if (!LI || LI->getSize() == 0) {
1475 std::vector<Record*> Results;
1476 std::vector<Record*> Operands;
1478 CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1480 if (InstInfo.OperandList.size() != 0) {
1481 if (InstInfo.NumDefs == 0) {
1482 // These produce no results
1483 for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
1484 Operands.push_back(InstInfo.OperandList[j].Rec);
1486 // Assume the first operand is the result.
1487 Results.push_back(InstInfo.OperandList[0].Rec);
1489 // The rest are inputs.
1490 for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
1491 Operands.push_back(InstInfo.OperandList[j].Rec);
1495 // Create and insert the instruction.
1496 std::vector<Record*> ImpResults;
1497 std::vector<Record*> ImpOperands;
1498 Instructions.insert(std::make_pair(Instrs[i],
1499 DAGInstruction(0, Results, Operands, ImpResults,
1501 continue; // no pattern.
1504 // Parse the instruction.
1505 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1506 // Inline pattern fragments into it.
1507 I->InlinePatternFragments();
1509 // Infer as many types as possible. If we cannot infer all of them, we can
1510 // never do anything with this instruction pattern: report it to the user.
1511 if (!I->InferAllTypes())
1512 I->error("Could not infer all types in pattern!");
1514 // InstInputs - Keep track of all of the inputs of the instruction, along
1515 // with the record they are declared as.
1516 std::map<std::string, TreePatternNode*> InstInputs;
1518 // InstResults - Keep track of all the virtual registers that are 'set'
1519 // in the instruction, including what reg class they are.
1520 std::map<std::string, TreePatternNode*> InstResults;
1522 std::vector<Record*> InstImpInputs;
1523 std::vector<Record*> InstImpResults;
1525 // Verify that the top-level forms in the instruction are of void type, and
1526 // fill in the InstResults map.
1527 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1528 TreePatternNode *Pat = I->getTree(j);
1529 if (Pat->getExtTypeNum(0) != MVT::isVoid)
1530 I->error("Top-level forms in instruction pattern should have"
1533 // Find inputs and outputs, and verify the structure of the uses/defs.
1534 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
1535 InstImpInputs, InstImpResults);
1538 // Now that we have inputs and outputs of the pattern, inspect the operands
1539 // list for the instruction. This determines the order that operands are
1540 // added to the machine instruction the node corresponds to.
1541 unsigned NumResults = InstResults.size();
1543 // Parse the operands list from the (ops) list, validating it.
1544 assert(I->getArgList().empty() && "Args list should still be empty here!");
1545 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1547 // Check that all of the results occur first in the list.
1548 std::vector<Record*> Results;
1549 TreePatternNode *Res0Node = NULL;
1550 for (unsigned i = 0; i != NumResults; ++i) {
1551 if (i == CGI.OperandList.size())
1552 I->error("'" + InstResults.begin()->first +
1553 "' set but does not appear in operand list!");
1554 const std::string &OpName = CGI.OperandList[i].Name;
1556 // Check that it exists in InstResults.
1557 TreePatternNode *RNode = InstResults[OpName];
1559 I->error("Operand $" + OpName + " does not exist in operand list!");
1563 Record *R = dynamic_cast<DefInit*>(RNode->getLeafValue())->getDef();
1565 I->error("Operand $" + OpName + " should be a set destination: all "
1566 "outputs must occur before inputs in operand list!");
1568 if (CGI.OperandList[i].Rec != R)
1569 I->error("Operand $" + OpName + " class mismatch!");
1571 // Remember the return type.
1572 Results.push_back(CGI.OperandList[i].Rec);
1574 // Okay, this one checks out.
1575 InstResults.erase(OpName);
1578 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
1579 // the copy while we're checking the inputs.
1580 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
1582 std::vector<TreePatternNode*> ResultNodeOperands;
1583 std::vector<Record*> Operands;
1584 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
1585 CodeGenInstruction::OperandInfo &Op = CGI.OperandList[i];
1586 const std::string &OpName = Op.Name;
1588 I->error("Operand #" + utostr(i) + " in operands list has no name!");
1590 if (!InstInputsCheck.count(OpName)) {
1591 // If this is an predicate operand or optional def operand with an
1592 // DefaultOps set filled in, we can ignore this. When we codegen it,
1593 // we will do so as always executed.
1594 if (Op.Rec->isSubClassOf("PredicateOperand") ||
1595 Op.Rec->isSubClassOf("OptionalDefOperand")) {
1596 // Does it have a non-empty DefaultOps field? If so, ignore this
1598 if (!getDefaultOperand(Op.Rec).DefaultOps.empty())
1601 I->error("Operand $" + OpName +
1602 " does not appear in the instruction pattern");
1604 TreePatternNode *InVal = InstInputsCheck[OpName];
1605 InstInputsCheck.erase(OpName); // It occurred, remove from map.
1607 if (InVal->isLeaf() &&
1608 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
1609 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
1610 if (Op.Rec != InRec && !InRec->isSubClassOf("ComplexPattern"))
1611 I->error("Operand $" + OpName + "'s register class disagrees"
1612 " between the operand and pattern");
1614 Operands.push_back(Op.Rec);
1616 // Construct the result for the dest-pattern operand list.
1617 TreePatternNode *OpNode = InVal->clone();
1619 // No predicate is useful on the result.
1620 OpNode->setPredicateFn("");
1622 // Promote the xform function to be an explicit node if set.
1623 if (Record *Xform = OpNode->getTransformFn()) {
1624 OpNode->setTransformFn(0);
1625 std::vector<TreePatternNode*> Children;
1626 Children.push_back(OpNode);
1627 OpNode = new TreePatternNode(Xform, Children);
1630 ResultNodeOperands.push_back(OpNode);
1633 if (!InstInputsCheck.empty())
1634 I->error("Input operand $" + InstInputsCheck.begin()->first +
1635 " occurs in pattern but not in operands list!");
1637 TreePatternNode *ResultPattern =
1638 new TreePatternNode(I->getRecord(), ResultNodeOperands);
1639 // Copy fully inferred output node type to instruction result pattern.
1641 ResultPattern->setTypes(Res0Node->getExtTypes());
1643 // Create and insert the instruction.
1644 // FIXME: InstImpResults and InstImpInputs should not be part of
1646 DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
1647 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
1649 // Use a temporary tree pattern to infer all types and make sure that the
1650 // constructed result is correct. This depends on the instruction already
1651 // being inserted into the Instructions map.
1652 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
1653 Temp.InferAllTypes();
1655 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
1656 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
1661 // If we can, convert the instructions to be patterns that are matched!
1662 for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
1663 E = Instructions.end(); II != E; ++II) {
1664 DAGInstruction &TheInst = II->second;
1665 TreePattern *I = TheInst.getPattern();
1666 if (I == 0) continue; // No pattern.
1668 // FIXME: Assume only the first tree is the pattern. The others are clobber
1670 TreePatternNode *Pattern = I->getTree(0);
1671 TreePatternNode *SrcPattern;
1672 if (Pattern->getOperator()->getName() == "set") {
1673 SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
1675 // Not a set (store or something?)
1676 SrcPattern = Pattern;
1680 if (!SrcPattern->canPatternMatch(Reason, *this))
1681 I->error("Instruction can never match: " + Reason);
1683 Record *Instr = II->first;
1684 TreePatternNode *DstPattern = TheInst.getResultPattern();
1686 push_back(PatternToMatch(Instr->getValueAsListInit("Predicates"),
1687 SrcPattern, DstPattern, TheInst.getImpResults(),
1688 Instr->getValueAsInt("AddedComplexity")));
1692 void DAGISelEmitter::ParsePatterns() {
1693 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
1695 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1696 DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
1697 DefInit *OpDef = dynamic_cast<DefInit*>(Tree->getOperator());
1698 Record *Operator = OpDef->getDef();
1699 TreePattern *Pattern;
1700 if (Operator->getName() != "parallel")
1701 Pattern = new TreePattern(Patterns[i], Tree, true, *this);
1703 std::vector<Init*> Values;
1704 for (unsigned j = 0, ee = Tree->getNumArgs(); j != ee; ++j)
1705 Values.push_back(Tree->getArg(j));
1706 ListInit *LI = new ListInit(Values);
1707 Pattern = new TreePattern(Patterns[i], LI, true, *this);
1710 // Inline pattern fragments into it.
1711 Pattern->InlinePatternFragments();
1713 ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
1714 if (LI->getSize() == 0) continue; // no pattern.
1716 // Parse the instruction.
1717 TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
1719 // Inline pattern fragments into it.
1720 Result->InlinePatternFragments();
1722 if (Result->getNumTrees() != 1)
1723 Result->error("Cannot handle instructions producing instructions "
1724 "with temporaries yet!");
1726 bool IterateInference;
1727 bool InferredAllPatternTypes, InferredAllResultTypes;
1729 // Infer as many types as possible. If we cannot infer all of them, we
1730 // can never do anything with this pattern: report it to the user.
1731 InferredAllPatternTypes = Pattern->InferAllTypes();
1733 // Infer as many types as possible. If we cannot infer all of them, we
1734 // can never do anything with this pattern: report it to the user.
1735 InferredAllResultTypes = Result->InferAllTypes();
1737 // Apply the type of the result to the source pattern. This helps us
1738 // resolve cases where the input type is known to be a pointer type (which
1739 // is considered resolved), but the result knows it needs to be 32- or
1740 // 64-bits. Infer the other way for good measure.
1741 IterateInference = Pattern->getTree(0)->
1742 UpdateNodeType(Result->getTree(0)->getExtTypes(), *Result);
1743 IterateInference |= Result->getTree(0)->
1744 UpdateNodeType(Pattern->getTree(0)->getExtTypes(), *Result);
1745 } while (IterateInference);
1747 // Verify that we inferred enough types that we can do something with the
1748 // pattern and result. If these fire the user has to add type casts.
1749 if (!InferredAllPatternTypes)
1750 Pattern->error("Could not infer all types in pattern!");
1751 if (!InferredAllResultTypes)
1752 Result->error("Could not infer all types in pattern result!");
1754 // Validate that the input pattern is correct.
1755 std::map<std::string, TreePatternNode*> InstInputs;
1756 std::map<std::string, TreePatternNode*> InstResults;
1757 std::vector<Record*> InstImpInputs;
1758 std::vector<Record*> InstImpResults;
1759 for (unsigned j = 0, ee = Pattern->getNumTrees(); j != ee; ++j)
1760 FindPatternInputsAndOutputs(Pattern, Pattern->getTree(j),
1761 InstInputs, InstResults,
1762 InstImpInputs, InstImpResults);
1764 // Promote the xform function to be an explicit node if set.
1765 TreePatternNode *DstPattern = Result->getOnlyTree();
1766 std::vector<TreePatternNode*> ResultNodeOperands;
1767 for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
1768 TreePatternNode *OpNode = DstPattern->getChild(ii);
1769 if (Record *Xform = OpNode->getTransformFn()) {
1770 OpNode->setTransformFn(0);
1771 std::vector<TreePatternNode*> Children;
1772 Children.push_back(OpNode);
1773 OpNode = new TreePatternNode(Xform, Children);
1775 ResultNodeOperands.push_back(OpNode);
1777 DstPattern = Result->getOnlyTree();
1778 if (!DstPattern->isLeaf())
1779 DstPattern = new TreePatternNode(DstPattern->getOperator(),
1780 ResultNodeOperands);
1781 DstPattern->setTypes(Result->getOnlyTree()->getExtTypes());
1782 TreePattern Temp(Result->getRecord(), DstPattern, false, *this);
1783 Temp.InferAllTypes();
1786 if (!Pattern->getTree(0)->canPatternMatch(Reason, *this))
1787 Pattern->error("Pattern can never match: " + Reason);
1790 push_back(PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"),
1791 Pattern->getTree(0),
1792 Temp.getOnlyTree(), InstImpResults,
1793 Patterns[i]->getValueAsInt("AddedComplexity")));
1797 /// CombineChildVariants - Given a bunch of permutations of each child of the
1798 /// 'operator' node, put them together in all possible ways.
1799 static void CombineChildVariants(TreePatternNode *Orig,
1800 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
1801 std::vector<TreePatternNode*> &OutVariants,
1802 DAGISelEmitter &ISE) {
1803 // Make sure that each operand has at least one variant to choose from.
1804 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1805 if (ChildVariants[i].empty())
1808 // The end result is an all-pairs construction of the resultant pattern.
1809 std::vector<unsigned> Idxs;
1810 Idxs.resize(ChildVariants.size());
1811 bool NotDone = true;
1813 // Create the variant and add it to the output list.
1814 std::vector<TreePatternNode*> NewChildren;
1815 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1816 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
1817 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
1819 // Copy over properties.
1820 R->setName(Orig->getName());
1821 R->setPredicateFn(Orig->getPredicateFn());
1822 R->setTransformFn(Orig->getTransformFn());
1823 R->setTypes(Orig->getExtTypes());
1825 // If this pattern cannot every match, do not include it as a variant.
1826 std::string ErrString;
1827 if (!R->canPatternMatch(ErrString, ISE)) {
1830 bool AlreadyExists = false;
1832 // Scan to see if this pattern has already been emitted. We can get
1833 // duplication due to things like commuting:
1834 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
1835 // which are the same pattern. Ignore the dups.
1836 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
1837 if (R->isIsomorphicTo(OutVariants[i])) {
1838 AlreadyExists = true;
1845 OutVariants.push_back(R);
1848 // Increment indices to the next permutation.
1850 // Look for something we can increment without causing a wrap-around.
1851 for (unsigned IdxsIdx = 0; IdxsIdx != Idxs.size(); ++IdxsIdx) {
1852 if (++Idxs[IdxsIdx] < ChildVariants[IdxsIdx].size()) {
1853 NotDone = true; // Found something to increment.
1861 /// CombineChildVariants - A helper function for binary operators.
1863 static void CombineChildVariants(TreePatternNode *Orig,
1864 const std::vector<TreePatternNode*> &LHS,
1865 const std::vector<TreePatternNode*> &RHS,
1866 std::vector<TreePatternNode*> &OutVariants,
1867 DAGISelEmitter &ISE) {
1868 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1869 ChildVariants.push_back(LHS);
1870 ChildVariants.push_back(RHS);
1871 CombineChildVariants(Orig, ChildVariants, OutVariants, ISE);
1875 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
1876 std::vector<TreePatternNode *> &Children) {
1877 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
1878 Record *Operator = N->getOperator();
1880 // Only permit raw nodes.
1881 if (!N->getName().empty() || !N->getPredicateFn().empty() ||
1882 N->getTransformFn()) {
1883 Children.push_back(N);
1887 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
1888 Children.push_back(N->getChild(0));
1890 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
1892 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
1893 Children.push_back(N->getChild(1));
1895 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
1898 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
1899 /// the (potentially recursive) pattern by using algebraic laws.
1901 static void GenerateVariantsOf(TreePatternNode *N,
1902 std::vector<TreePatternNode*> &OutVariants,
1903 DAGISelEmitter &ISE) {
1904 // We cannot permute leaves.
1906 OutVariants.push_back(N);
1910 // Look up interesting info about the node.
1911 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1913 // If this node is associative, reassociate.
1914 if (NodeInfo.hasProperty(SDNPAssociative)) {
1915 // Reassociate by pulling together all of the linked operators
1916 std::vector<TreePatternNode*> MaximalChildren;
1917 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
1919 // Only handle child sizes of 3. Otherwise we'll end up trying too many
1921 if (MaximalChildren.size() == 3) {
1922 // Find the variants of all of our maximal children.
1923 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
1924 GenerateVariantsOf(MaximalChildren[0], AVariants, ISE);
1925 GenerateVariantsOf(MaximalChildren[1], BVariants, ISE);
1926 GenerateVariantsOf(MaximalChildren[2], CVariants, ISE);
1928 // There are only two ways we can permute the tree:
1929 // (A op B) op C and A op (B op C)
1930 // Within these forms, we can also permute A/B/C.
1932 // Generate legal pair permutations of A/B/C.
1933 std::vector<TreePatternNode*> ABVariants;
1934 std::vector<TreePatternNode*> BAVariants;
1935 std::vector<TreePatternNode*> ACVariants;
1936 std::vector<TreePatternNode*> CAVariants;
1937 std::vector<TreePatternNode*> BCVariants;
1938 std::vector<TreePatternNode*> CBVariants;
1939 CombineChildVariants(N, AVariants, BVariants, ABVariants, ISE);
1940 CombineChildVariants(N, BVariants, AVariants, BAVariants, ISE);
1941 CombineChildVariants(N, AVariants, CVariants, ACVariants, ISE);
1942 CombineChildVariants(N, CVariants, AVariants, CAVariants, ISE);
1943 CombineChildVariants(N, BVariants, CVariants, BCVariants, ISE);
1944 CombineChildVariants(N, CVariants, BVariants, CBVariants, ISE);
1946 // Combine those into the result: (x op x) op x
1947 CombineChildVariants(N, ABVariants, CVariants, OutVariants, ISE);
1948 CombineChildVariants(N, BAVariants, CVariants, OutVariants, ISE);
1949 CombineChildVariants(N, ACVariants, BVariants, OutVariants, ISE);
1950 CombineChildVariants(N, CAVariants, BVariants, OutVariants, ISE);
1951 CombineChildVariants(N, BCVariants, AVariants, OutVariants, ISE);
1952 CombineChildVariants(N, CBVariants, AVariants, OutVariants, ISE);
1954 // Combine those into the result: x op (x op x)
1955 CombineChildVariants(N, CVariants, ABVariants, OutVariants, ISE);
1956 CombineChildVariants(N, CVariants, BAVariants, OutVariants, ISE);
1957 CombineChildVariants(N, BVariants, ACVariants, OutVariants, ISE);
1958 CombineChildVariants(N, BVariants, CAVariants, OutVariants, ISE);
1959 CombineChildVariants(N, AVariants, BCVariants, OutVariants, ISE);
1960 CombineChildVariants(N, AVariants, CBVariants, OutVariants, ISE);
1965 // Compute permutations of all children.
1966 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1967 ChildVariants.resize(N->getNumChildren());
1968 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1969 GenerateVariantsOf(N->getChild(i), ChildVariants[i], ISE);
1971 // Build all permutations based on how the children were formed.
1972 CombineChildVariants(N, ChildVariants, OutVariants, ISE);
1974 // If this node is commutative, consider the commuted order.
1975 if (NodeInfo.hasProperty(SDNPCommutative)) {
1976 assert(N->getNumChildren()==2 &&"Commutative but doesn't have 2 children!");
1977 // Don't count children which are actually register references.
1979 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
1980 TreePatternNode *Child = N->getChild(i);
1981 if (Child->isLeaf())
1982 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1983 Record *RR = DI->getDef();
1984 if (RR->isSubClassOf("Register"))
1989 // Consider the commuted order.
1991 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
1997 // GenerateVariants - Generate variants. For example, commutative patterns can
1998 // match multiple ways. Add them to PatternsToMatch as well.
1999 void DAGISelEmitter::GenerateVariants() {
2001 DOUT << "Generating instruction variants.\n";
2003 // Loop over all of the patterns we've collected, checking to see if we can
2004 // generate variants of the instruction, through the exploitation of
2005 // identities. This permits the target to provide agressive matching without
2006 // the .td file having to contain tons of variants of instructions.
2008 // Note that this loop adds new patterns to the PatternsToMatch list, but we
2009 // intentionally do not reconsider these. Any variants of added patterns have
2010 // already been added.
2012 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2013 std::vector<TreePatternNode*> Variants;
2014 GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this);
2016 assert(!Variants.empty() && "Must create at least original variant!");
2017 Variants.erase(Variants.begin()); // Remove the original pattern.
2019 if (Variants.empty()) // No variants for this pattern.
2022 DOUT << "FOUND VARIANTS OF: ";
2023 DEBUG(PatternsToMatch[i].getSrcPattern()->dump());
2026 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
2027 TreePatternNode *Variant = Variants[v];
2029 DOUT << " VAR#" << v << ": ";
2030 DEBUG(Variant->dump());
2033 // Scan to see if an instruction or explicit pattern already matches this.
2034 bool AlreadyExists = false;
2035 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
2036 // Check to see if this variant already exists.
2037 if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern())) {
2038 DOUT << " *** ALREADY EXISTS, ignoring variant.\n";
2039 AlreadyExists = true;
2043 // If we already have it, ignore the variant.
2044 if (AlreadyExists) continue;
2046 // Otherwise, add it to the list of patterns we have.
2048 push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
2049 Variant, PatternsToMatch[i].getDstPattern(),
2050 PatternsToMatch[i].getDstRegs(),
2051 PatternsToMatch[i].getAddedComplexity()));
2058 // NodeIsComplexPattern - return true if N is a leaf node and a subclass of
2060 static bool NodeIsComplexPattern(TreePatternNode *N)
2062 return (N->isLeaf() &&
2063 dynamic_cast<DefInit*>(N->getLeafValue()) &&
2064 static_cast<DefInit*>(N->getLeafValue())->getDef()->
2065 isSubClassOf("ComplexPattern"));
2068 // NodeGetComplexPattern - return the pointer to the ComplexPattern if N
2069 // is a leaf node and a subclass of ComplexPattern, else it returns NULL.
2070 static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
2071 DAGISelEmitter &ISE)
2074 dynamic_cast<DefInit*>(N->getLeafValue()) &&
2075 static_cast<DefInit*>(N->getLeafValue())->getDef()->
2076 isSubClassOf("ComplexPattern")) {
2077 return &ISE.getComplexPattern(static_cast<DefInit*>(N->getLeafValue())
2083 /// getPatternSize - Return the 'size' of this pattern. We want to match large
2084 /// patterns before small ones. This is used to determine the size of a
2086 static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
2087 assert((isExtIntegerInVTs(P->getExtTypes()) ||
2088 isExtFloatingPointInVTs(P->getExtTypes()) ||
2089 P->getExtTypeNum(0) == MVT::isVoid ||
2090 P->getExtTypeNum(0) == MVT::Flag ||
2091 P->getExtTypeNum(0) == MVT::iPTR) &&
2092 "Not a valid pattern node to size!");
2093 unsigned Size = 3; // The node itself.
2094 // If the root node is a ConstantSDNode, increases its size.
2095 // e.g. (set R32:$dst, 0).
2096 if (P->isLeaf() && dynamic_cast<IntInit*>(P->getLeafValue()))
2099 // FIXME: This is a hack to statically increase the priority of patterns
2100 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
2101 // Later we can allow complexity / cost for each pattern to be (optionally)
2102 // specified. To get best possible pattern match we'll need to dynamically
2103 // calculate the complexity of all patterns a dag can potentially map to.
2104 const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
2106 Size += AM->getNumOperands() * 3;
2108 // If this node has some predicate function that must match, it adds to the
2109 // complexity of this node.
2110 if (!P->getPredicateFn().empty())
2113 // Count children in the count if they are also nodes.
2114 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
2115 TreePatternNode *Child = P->getChild(i);
2116 if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
2117 Size += getPatternSize(Child, ISE);
2118 else if (Child->isLeaf()) {
2119 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
2120 Size += 5; // Matches a ConstantSDNode (+3) and a specific value (+2).
2121 else if (NodeIsComplexPattern(Child))
2122 Size += getPatternSize(Child, ISE);
2123 else if (!Child->getPredicateFn().empty())
2131 /// getResultPatternCost - Compute the number of instructions for this pattern.
2132 /// This is a temporary hack. We should really include the instruction
2133 /// latencies in this calculation.
2134 static unsigned getResultPatternCost(TreePatternNode *P, DAGISelEmitter &ISE) {
2135 if (P->isLeaf()) return 0;
2138 Record *Op = P->getOperator();
2139 if (Op->isSubClassOf("Instruction")) {
2141 CodeGenInstruction &II = ISE.getTargetInfo().getInstruction(Op->getName());
2142 if (II.usesCustomDAGSchedInserter)
2145 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
2146 Cost += getResultPatternCost(P->getChild(i), ISE);
2150 /// getResultPatternCodeSize - Compute the code size of instructions for this
2152 static unsigned getResultPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
2153 if (P->isLeaf()) return 0;
2156 Record *Op = P->getOperator();
2157 if (Op->isSubClassOf("Instruction")) {
2158 Cost += Op->getValueAsInt("CodeSize");
2160 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
2161 Cost += getResultPatternSize(P->getChild(i), ISE);
2165 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
2166 // In particular, we want to match maximal patterns first and lowest cost within
2167 // a particular complexity first.
2168 struct PatternSortingPredicate {
2169 PatternSortingPredicate(DAGISelEmitter &ise) : ISE(ise) {};
2170 DAGISelEmitter &ISE;
2172 bool operator()(PatternToMatch *LHS,
2173 PatternToMatch *RHS) {
2174 unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), ISE);
2175 unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), ISE);
2176 LHSSize += LHS->getAddedComplexity();
2177 RHSSize += RHS->getAddedComplexity();
2178 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
2179 if (LHSSize < RHSSize) return false;
2181 // If the patterns have equal complexity, compare generated instruction cost
2182 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), ISE);
2183 unsigned RHSCost = getResultPatternCost(RHS->getDstPattern(), ISE);
2184 if (LHSCost < RHSCost) return true;
2185 if (LHSCost > RHSCost) return false;
2187 return getResultPatternSize(LHS->getDstPattern(), ISE) <
2188 getResultPatternSize(RHS->getDstPattern(), ISE);
2192 /// getRegisterValueType - Look up and return the first ValueType of specified
2193 /// RegisterClass record
2194 static MVT::ValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
2195 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
2196 return RC->getValueTypeNum(0);
2201 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
2202 /// type information from it.
2203 static void RemoveAllTypes(TreePatternNode *N) {
2206 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2207 RemoveAllTypes(N->getChild(i));
2210 Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
2211 Record *N = Records.getDef(Name);
2212 if (!N || !N->isSubClassOf("SDNode")) {
2213 cerr << "Error getting SDNode '" << Name << "'!\n";
2219 /// NodeHasProperty - return true if TreePatternNode has the specified
2221 static bool NodeHasProperty(TreePatternNode *N, SDNP Property,
2222 DAGISelEmitter &ISE)
2225 const ComplexPattern *CP = NodeGetComplexPattern(N, ISE);
2227 return CP->hasProperty(Property);
2230 Record *Operator = N->getOperator();
2231 if (!Operator->isSubClassOf("SDNode")) return false;
2233 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(Operator);
2234 return NodeInfo.hasProperty(Property);
2237 static bool PatternHasProperty(TreePatternNode *N, SDNP Property,
2238 DAGISelEmitter &ISE)
2240 if (NodeHasProperty(N, Property, ISE))
2243 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2244 TreePatternNode *Child = N->getChild(i);
2245 if (PatternHasProperty(Child, Property, ISE))
2252 class PatternCodeEmitter {
2254 DAGISelEmitter &ISE;
2257 ListInit *Predicates;
2260 // Instruction selector pattern.
2261 TreePatternNode *Pattern;
2262 // Matched instruction.
2263 TreePatternNode *Instruction;
2265 // Node to name mapping
2266 std::map<std::string, std::string> VariableMap;
2267 // Node to operator mapping
2268 std::map<std::string, Record*> OperatorMap;
2269 // Names of all the folded nodes which produce chains.
2270 std::vector<std::pair<std::string, unsigned> > FoldedChains;
2271 // Original input chain(s).
2272 std::vector<std::pair<std::string, std::string> > OrigChains;
2273 std::set<std::string> Duplicates;
2275 /// GeneratedCode - This is the buffer that we emit code to. The first int
2276 /// indicates whether this is an exit predicate (something that should be
2277 /// tested, and if true, the match fails) [when 1], or normal code to emit
2278 /// [when 0], or initialization code to emit [when 2].
2279 std::vector<std::pair<unsigned, std::string> > &GeneratedCode;
2280 /// GeneratedDecl - This is the set of all SDOperand declarations needed for
2281 /// the set of patterns for each top-level opcode.
2282 std::set<std::string> &GeneratedDecl;
2283 /// TargetOpcodes - The target specific opcodes used by the resulting
2285 std::vector<std::string> &TargetOpcodes;
2286 std::vector<std::string> &TargetVTs;
2288 std::string ChainName;
2293 void emitCheck(const std::string &S) {
2295 GeneratedCode.push_back(std::make_pair(1, S));
2297 void emitCode(const std::string &S) {
2299 GeneratedCode.push_back(std::make_pair(0, S));
2301 void emitInit(const std::string &S) {
2303 GeneratedCode.push_back(std::make_pair(2, S));
2305 void emitDecl(const std::string &S) {
2306 assert(!S.empty() && "Invalid declaration");
2307 GeneratedDecl.insert(S);
2309 void emitOpcode(const std::string &Opc) {
2310 TargetOpcodes.push_back(Opc);
2313 void emitVT(const std::string &VT) {
2314 TargetVTs.push_back(VT);
2318 PatternCodeEmitter(DAGISelEmitter &ise, ListInit *preds,
2319 TreePatternNode *pattern, TreePatternNode *instr,
2320 std::vector<std::pair<unsigned, std::string> > &gc,
2321 std::set<std::string> &gd,
2322 std::vector<std::string> &to,
2323 std::vector<std::string> &tv)
2324 : ISE(ise), Predicates(preds), Pattern(pattern), Instruction(instr),
2325 GeneratedCode(gc), GeneratedDecl(gd),
2326 TargetOpcodes(to), TargetVTs(tv),
2327 TmpNo(0), OpcNo(0), VTNo(0) {}
2329 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
2330 /// if the match fails. At this point, we already know that the opcode for N
2331 /// matches, and the SDNode for the result has the RootName specified name.
2332 void EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
2333 const std::string &RootName, const std::string &ChainSuffix,
2335 bool isRoot = (P == NULL);
2336 // Emit instruction predicates. Each predicate is just a string for now.
2338 std::string PredicateCheck;
2339 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
2340 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
2341 Record *Def = Pred->getDef();
2342 if (!Def->isSubClassOf("Predicate")) {
2346 assert(0 && "Unknown predicate type!");
2348 if (!PredicateCheck.empty())
2349 PredicateCheck += " && ";
2350 PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
2354 emitCheck(PredicateCheck);
2358 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2359 emitCheck("cast<ConstantSDNode>(" + RootName +
2360 ")->getSignExtended() == " + itostr(II->getValue()));
2362 } else if (!NodeIsComplexPattern(N)) {
2363 assert(0 && "Cannot match this as a leaf value!");
2368 // If this node has a name associated with it, capture it in VariableMap. If
2369 // we already saw this in the pattern, emit code to verify dagness.
2370 if (!N->getName().empty()) {
2371 std::string &VarMapEntry = VariableMap[N->getName()];
2372 if (VarMapEntry.empty()) {
2373 VarMapEntry = RootName;
2375 // If we get here, this is a second reference to a specific name. Since
2376 // we already have checked that the first reference is valid, we don't
2377 // have to recursively match it, just check that it's the same as the
2378 // previously named thing.
2379 emitCheck(VarMapEntry + " == " + RootName);
2384 OperatorMap[N->getName()] = N->getOperator();
2388 // Emit code to load the child nodes and match their contents recursively.
2390 bool NodeHasChain = NodeHasProperty (N, SDNPHasChain, ISE);
2391 bool HasChain = PatternHasProperty(N, SDNPHasChain, ISE);
2392 bool EmittedUseCheck = false;
2397 // Multiple uses of actual result?
2398 emitCheck(RootName + ".hasOneUse()");
2399 EmittedUseCheck = true;
2401 // If the immediate use can somehow reach this node through another
2402 // path, then can't fold it either or it will create a cycle.
2403 // e.g. In the following diagram, XX can reach ld through YY. If
2404 // ld is folded into XX, then YY is both a predecessor and a successor
2414 bool NeedCheck = false;
2418 const SDNodeInfo &PInfo = ISE.getSDNodeInfo(P->getOperator());
2420 P->getOperator() == ISE.get_intrinsic_void_sdnode() ||
2421 P->getOperator() == ISE.get_intrinsic_w_chain_sdnode() ||
2422 P->getOperator() == ISE.get_intrinsic_wo_chain_sdnode() ||
2423 PInfo.getNumOperands() > 1 ||
2424 PInfo.hasProperty(SDNPHasChain) ||
2425 PInfo.hasProperty(SDNPInFlag) ||
2426 PInfo.hasProperty(SDNPOptInFlag);
2430 std::string ParentName(RootName.begin(), RootName.end()-1);
2431 emitCheck("CanBeFoldedBy(" + RootName + ".Val, " + ParentName +
2439 emitCheck("(" + ChainName + ".Val == " + RootName + ".Val || "
2440 "IsChainCompatible(" + ChainName + ".Val, " +
2441 RootName + ".Val))");
2442 OrigChains.push_back(std::make_pair(ChainName, RootName));
2445 ChainName = "Chain" + ChainSuffix;
2446 emitInit("SDOperand " + ChainName + " = " + RootName +
2451 // Don't fold any node which reads or writes a flag and has multiple uses.
2452 // FIXME: We really need to separate the concepts of flag and "glue". Those
2453 // real flag results, e.g. X86CMP output, can have multiple uses.
2454 // FIXME: If the optional incoming flag does not exist. Then it is ok to
2457 (PatternHasProperty(N, SDNPInFlag, ISE) ||
2458 PatternHasProperty(N, SDNPOptInFlag, ISE) ||
2459 PatternHasProperty(N, SDNPOutFlag, ISE))) {
2460 if (!EmittedUseCheck) {
2461 // Multiple uses of actual result?
2462 emitCheck(RootName + ".hasOneUse()");
2466 // If there is a node predicate for this, emit the call.
2467 if (!N->getPredicateFn().empty())
2468 emitCheck(N->getPredicateFn() + "(" + RootName + ".Val)");
2471 // If this is an 'and R, 1234' where the operation is AND/OR and the RHS is
2472 // a constant without a predicate fn that has more that one bit set, handle
2473 // this as a special case. This is usually for targets that have special
2474 // handling of certain large constants (e.g. alpha with it's 8/16/32-bit
2475 // handling stuff). Using these instructions is often far more efficient
2476 // than materializing the constant. Unfortunately, both the instcombiner
2477 // and the dag combiner can often infer that bits are dead, and thus drop
2478 // them from the mask in the dag. For example, it might turn 'AND X, 255'
2479 // into 'AND X, 254' if it knows the low bit is set. Emit code that checks
2482 (N->getOperator()->getName() == "and" ||
2483 N->getOperator()->getName() == "or") &&
2484 N->getChild(1)->isLeaf() &&
2485 N->getChild(1)->getPredicateFn().empty()) {
2486 if (IntInit *II = dynamic_cast<IntInit*>(N->getChild(1)->getLeafValue())) {
2487 if (!isPowerOf2_32(II->getValue())) { // Don't bother with single bits.
2488 emitInit("SDOperand " + RootName + "0" + " = " +
2489 RootName + ".getOperand(" + utostr(0) + ");");
2490 emitInit("SDOperand " + RootName + "1" + " = " +
2491 RootName + ".getOperand(" + utostr(1) + ");");
2493 emitCheck("isa<ConstantSDNode>(" + RootName + "1)");
2494 const char *MaskPredicate = N->getOperator()->getName() == "or"
2495 ? "CheckOrMask(" : "CheckAndMask(";
2496 emitCheck(MaskPredicate + RootName + "0, cast<ConstantSDNode>(" +
2497 RootName + "1), " + itostr(II->getValue()) + ")");
2499 EmitChildMatchCode(N->getChild(0), N, RootName + utostr(0),
2500 ChainSuffix + utostr(0), FoundChain);
2506 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2507 emitInit("SDOperand " + RootName + utostr(OpNo) + " = " +
2508 RootName + ".getOperand(" +utostr(OpNo) + ");");
2510 EmitChildMatchCode(N->getChild(i), N, RootName + utostr(OpNo),
2511 ChainSuffix + utostr(OpNo), FoundChain);
2514 // Handle cases when root is a complex pattern.
2515 const ComplexPattern *CP;
2516 if (isRoot && N->isLeaf() && (CP = NodeGetComplexPattern(N, ISE))) {
2517 std::string Fn = CP->getSelectFunc();
2518 unsigned NumOps = CP->getNumOperands();
2519 for (unsigned i = 0; i < NumOps; ++i) {
2520 emitDecl("CPTmp" + utostr(i));
2521 emitCode("SDOperand CPTmp" + utostr(i) + ";");
2523 if (CP->hasProperty(SDNPHasChain)) {
2524 emitDecl("CPInChain");
2525 emitDecl("Chain" + ChainSuffix);
2526 emitCode("SDOperand CPInChain;");
2527 emitCode("SDOperand Chain" + ChainSuffix + ";");
2530 std::string Code = Fn + "(" + RootName + ", " + RootName;
2531 for (unsigned i = 0; i < NumOps; i++)
2532 Code += ", CPTmp" + utostr(i);
2533 if (CP->hasProperty(SDNPHasChain)) {
2534 ChainName = "Chain" + ChainSuffix;
2535 Code += ", CPInChain, Chain" + ChainSuffix;
2537 emitCheck(Code + ")");
2541 void EmitChildMatchCode(TreePatternNode *Child, TreePatternNode *Parent,
2542 const std::string &RootName,
2543 const std::string &ChainSuffix, bool &FoundChain) {
2544 if (!Child->isLeaf()) {
2545 // If it's not a leaf, recursively match.
2546 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(Child->getOperator());
2547 emitCheck(RootName + ".getOpcode() == " +
2548 CInfo.getEnumName());
2549 EmitMatchCode(Child, Parent, RootName, ChainSuffix, FoundChain);
2550 if (NodeHasProperty(Child, SDNPHasChain, ISE))
2551 FoldedChains.push_back(std::make_pair(RootName, CInfo.getNumResults()));
2553 // If this child has a name associated with it, capture it in VarMap. If
2554 // we already saw this in the pattern, emit code to verify dagness.
2555 if (!Child->getName().empty()) {
2556 std::string &VarMapEntry = VariableMap[Child->getName()];
2557 if (VarMapEntry.empty()) {
2558 VarMapEntry = RootName;
2560 // If we get here, this is a second reference to a specific name.
2561 // Since we already have checked that the first reference is valid,
2562 // we don't have to recursively match it, just check that it's the
2563 // same as the previously named thing.
2564 emitCheck(VarMapEntry + " == " + RootName);
2565 Duplicates.insert(RootName);
2570 // Handle leaves of various types.
2571 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2572 Record *LeafRec = DI->getDef();
2573 if (LeafRec->isSubClassOf("RegisterClass") ||
2574 LeafRec->getName() == "ptr_rc") {
2575 // Handle register references. Nothing to do here.
2576 } else if (LeafRec->isSubClassOf("Register")) {
2577 // Handle register references.
2578 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
2579 // Handle complex pattern.
2580 const ComplexPattern *CP = NodeGetComplexPattern(Child, ISE);
2581 std::string Fn = CP->getSelectFunc();
2582 unsigned NumOps = CP->getNumOperands();
2583 for (unsigned i = 0; i < NumOps; ++i) {
2584 emitDecl("CPTmp" + utostr(i));
2585 emitCode("SDOperand CPTmp" + utostr(i) + ";");
2587 if (CP->hasProperty(SDNPHasChain)) {
2588 const SDNodeInfo &PInfo = ISE.getSDNodeInfo(Parent->getOperator());
2589 FoldedChains.push_back(std::make_pair("CPInChain",
2590 PInfo.getNumResults()));
2591 ChainName = "Chain" + ChainSuffix;
2592 emitDecl("CPInChain");
2593 emitDecl(ChainName);
2594 emitCode("SDOperand CPInChain;");
2595 emitCode("SDOperand " + ChainName + ";");
2598 std::string Code = Fn + "(N, ";
2599 if (CP->hasProperty(SDNPHasChain)) {
2600 std::string ParentName(RootName.begin(), RootName.end()-1);
2601 Code += ParentName + ", ";
2604 for (unsigned i = 0; i < NumOps; i++)
2605 Code += ", CPTmp" + utostr(i);
2606 if (CP->hasProperty(SDNPHasChain))
2607 Code += ", CPInChain, Chain" + ChainSuffix;
2608 emitCheck(Code + ")");
2609 } else if (LeafRec->getName() == "srcvalue") {
2610 // Place holder for SRCVALUE nodes. Nothing to do here.
2611 } else if (LeafRec->isSubClassOf("ValueType")) {
2612 // Make sure this is the specified value type.
2613 emitCheck("cast<VTSDNode>(" + RootName +
2614 ")->getVT() == MVT::" + LeafRec->getName());
2615 } else if (LeafRec->isSubClassOf("CondCode")) {
2616 // Make sure this is the specified cond code.
2617 emitCheck("cast<CondCodeSDNode>(" + RootName +
2618 ")->get() == ISD::" + LeafRec->getName());
2624 assert(0 && "Unknown leaf type!");
2627 // If there is a node predicate for this, emit the call.
2628 if (!Child->getPredicateFn().empty())
2629 emitCheck(Child->getPredicateFn() + "(" + RootName +
2631 } else if (IntInit *II =
2632 dynamic_cast<IntInit*>(Child->getLeafValue())) {
2633 emitCheck("isa<ConstantSDNode>(" + RootName + ")");
2634 unsigned CTmp = TmpNo++;
2635 emitCode("int64_t CN"+utostr(CTmp)+" = cast<ConstantSDNode>("+
2636 RootName + ")->getSignExtended();");
2638 emitCheck("CN" + utostr(CTmp) + " == " +itostr(II->getValue()));
2643 assert(0 && "Unknown leaf type!");
2648 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
2649 /// we actually have to build a DAG!
2650 std::vector<std::string>
2651 EmitResultCode(TreePatternNode *N, std::vector<Record*> DstRegs,
2652 bool InFlagDecled, bool ResNodeDecled,
2653 bool LikeLeaf = false, bool isRoot = false) {
2654 // List of arguments of getTargetNode() or SelectNodeTo().
2655 std::vector<std::string> NodeOps;
2656 // This is something selected from the pattern we matched.
2657 if (!N->getName().empty()) {
2658 std::string &Val = VariableMap[N->getName()];
2659 assert(!Val.empty() &&
2660 "Variable referenced but not defined and not caught earlier!");
2661 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
2662 // Already selected this operand, just return the tmpval.
2663 NodeOps.push_back(Val);
2667 const ComplexPattern *CP;
2668 unsigned ResNo = TmpNo++;
2669 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
2670 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2671 std::string CastType;
2672 switch (N->getTypeNum(0)) {
2674 cerr << "Cannot handle " << getEnumName(N->getTypeNum(0))
2675 << " type as an immediate constant. Aborting\n";
2677 case MVT::i1: CastType = "bool"; break;
2678 case MVT::i8: CastType = "unsigned char"; break;
2679 case MVT::i16: CastType = "unsigned short"; break;
2680 case MVT::i32: CastType = "unsigned"; break;
2681 case MVT::i64: CastType = "uint64_t"; break;
2683 emitCode("SDOperand Tmp" + utostr(ResNo) +
2684 " = CurDAG->getTargetConstant(((" + CastType +
2685 ") cast<ConstantSDNode>(" + Val + ")->getValue()), " +
2686 getEnumName(N->getTypeNum(0)) + ");");
2687 NodeOps.push_back("Tmp" + utostr(ResNo));
2688 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
2689 // value if used multiple times by this pattern result.
2690 Val = "Tmp"+utostr(ResNo);
2691 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2692 Record *Op = OperatorMap[N->getName()];
2693 // Transform ExternalSymbol to TargetExternalSymbol
2694 if (Op && Op->getName() == "externalsym") {
2695 emitCode("SDOperand Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
2696 "ExternalSymbol(cast<ExternalSymbolSDNode>(" +
2697 Val + ")->getSymbol(), " +
2698 getEnumName(N->getTypeNum(0)) + ");");
2699 NodeOps.push_back("Tmp" + utostr(ResNo));
2700 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select
2701 // this value if used multiple times by this pattern result.
2702 Val = "Tmp"+utostr(ResNo);
2704 NodeOps.push_back(Val);
2706 } else if (!N->isLeaf() && (N->getOperator()->getName() == "tglobaladdr"
2707 || N->getOperator()->getName() == "tglobaltlsaddr")) {
2708 Record *Op = OperatorMap[N->getName()];
2709 // Transform GlobalAddress to TargetGlobalAddress
2710 if (Op && (Op->getName() == "globaladdr" ||
2711 Op->getName() == "globaltlsaddr")) {
2712 emitCode("SDOperand Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
2713 "GlobalAddress(cast<GlobalAddressSDNode>(" + Val +
2714 ")->getGlobal(), " + getEnumName(N->getTypeNum(0)) +
2716 NodeOps.push_back("Tmp" + utostr(ResNo));
2717 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select
2718 // this value if used multiple times by this pattern result.
2719 Val = "Tmp"+utostr(ResNo);
2721 NodeOps.push_back(Val);
2723 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2724 NodeOps.push_back(Val);
2725 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
2726 // value if used multiple times by this pattern result.
2727 Val = "Tmp"+utostr(ResNo);
2728 } else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") {
2729 NodeOps.push_back(Val);
2730 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
2731 // value if used multiple times by this pattern result.
2732 Val = "Tmp"+utostr(ResNo);
2733 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, ISE))) {
2734 for (unsigned i = 0; i < CP->getNumOperands(); ++i) {
2735 emitCode("AddToISelQueue(CPTmp" + utostr(i) + ");");
2736 NodeOps.push_back("CPTmp" + utostr(i));
2739 // This node, probably wrapped in a SDNodeXForm, behaves like a leaf
2740 // node even if it isn't one. Don't select it.
2742 emitCode("AddToISelQueue(" + Val + ");");
2743 if (isRoot && N->isLeaf()) {
2744 emitCode("ReplaceUses(N, " + Val + ");");
2745 emitCode("return NULL;");
2748 NodeOps.push_back(Val);
2753 // If this is an explicit register reference, handle it.
2754 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
2755 unsigned ResNo = TmpNo++;
2756 if (DI->getDef()->isSubClassOf("Register")) {
2757 emitCode("SDOperand Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" +
2758 ISE.getQualifiedName(DI->getDef()) + ", " +
2759 getEnumName(N->getTypeNum(0)) + ");");
2760 NodeOps.push_back("Tmp" + utostr(ResNo));
2762 } else if (DI->getDef()->getName() == "zero_reg") {
2763 emitCode("SDOperand Tmp" + utostr(ResNo) +
2764 " = CurDAG->getRegister(0, " +
2765 getEnumName(N->getTypeNum(0)) + ");");
2766 NodeOps.push_back("Tmp" + utostr(ResNo));
2769 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2770 unsigned ResNo = TmpNo++;
2771 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2772 emitCode("SDOperand Tmp" + utostr(ResNo) +
2773 " = CurDAG->getTargetConstant(" + itostr(II->getValue()) +
2774 ", " + getEnumName(N->getTypeNum(0)) + ");");
2775 NodeOps.push_back("Tmp" + utostr(ResNo));
2782 assert(0 && "Unknown leaf type!");
2786 Record *Op = N->getOperator();
2787 if (Op->isSubClassOf("Instruction")) {
2788 const CodeGenTarget &CGT = ISE.getTargetInfo();
2789 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
2790 const DAGInstruction &Inst = ISE.getInstruction(Op);
2791 TreePattern *InstPat = Inst.getPattern();
2792 // FIXME: Assume actual pattern comes before "implicit".
2793 TreePatternNode *InstPatNode =
2794 isRoot ? (InstPat ? InstPat->getTree(0) : Pattern)
2795 : (InstPat ? InstPat->getTree(0) : NULL);
2796 if (InstPatNode && InstPatNode->getOperator()->getName() == "set") {
2797 InstPatNode = InstPatNode->getChild(InstPatNode->getNumChildren()-1);
2799 bool HasVarOps = isRoot && II.hasVariableNumberOfOperands;
2800 // FIXME: fix how we deal with physical register operands.
2801 bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0;
2802 bool HasImpResults = isRoot && DstRegs.size() > 0;
2803 bool NodeHasOptInFlag = isRoot &&
2804 PatternHasProperty(Pattern, SDNPOptInFlag, ISE);
2805 bool NodeHasInFlag = isRoot &&
2806 PatternHasProperty(Pattern, SDNPInFlag, ISE);
2807 bool NodeHasOutFlag = isRoot &&
2808 PatternHasProperty(Pattern, SDNPOutFlag, ISE);
2809 bool NodeHasChain = InstPatNode &&
2810 PatternHasProperty(InstPatNode, SDNPHasChain, ISE);
2811 bool InputHasChain = isRoot &&
2812 NodeHasProperty(Pattern, SDNPHasChain, ISE);
2813 unsigned NumResults = Inst.getNumResults();
2814 unsigned NumDstRegs = HasImpResults ? DstRegs.size() : 0;
2816 if (NodeHasOptInFlag) {
2817 emitCode("bool HasInFlag = "
2818 "(N.getOperand(N.getNumOperands()-1).getValueType() == MVT::Flag);");
2821 emitCode("SmallVector<SDOperand, 8> Ops" + utostr(OpcNo) + ";");
2823 // How many results is this pattern expected to produce?
2824 unsigned NumPatResults = 0;
2825 for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
2826 MVT::ValueType VT = Pattern->getTypeNum(i);
2827 if (VT != MVT::isVoid && VT != MVT::Flag)
2831 if (OrigChains.size() > 0) {
2832 // The original input chain is being ignored. If it is not just
2833 // pointing to the op that's being folded, we should create a
2834 // TokenFactor with it and the chain of the folded op as the new chain.
2835 // We could potentially be doing multiple levels of folding, in that
2836 // case, the TokenFactor can have more operands.
2837 emitCode("SmallVector<SDOperand, 8> InChains;");
2838 for (unsigned i = 0, e = OrigChains.size(); i < e; ++i) {
2839 emitCode("if (" + OrigChains[i].first + ".Val != " +
2840 OrigChains[i].second + ".Val) {");
2841 emitCode(" AddToISelQueue(" + OrigChains[i].first + ");");
2842 emitCode(" InChains.push_back(" + OrigChains[i].first + ");");
2845 emitCode("AddToISelQueue(" + ChainName + ");");
2846 emitCode("InChains.push_back(" + ChainName + ");");
2847 emitCode(ChainName + " = CurDAG->getNode(ISD::TokenFactor, MVT::Other, "
2848 "&InChains[0], InChains.size());");
2851 // Loop over all of the operands of the instruction pattern, emitting code
2852 // to fill them all in. The node 'N' usually has number children equal to
2853 // the number of input operands of the instruction. However, in cases
2854 // where there are predicate operands for an instruction, we need to fill
2855 // in the 'execute always' values. Match up the node operands to the
2856 // instruction operands to do this.
2857 std::vector<std::string> AllOps;
2858 unsigned NumEAInputs = 0; // # of synthesized 'execute always' inputs.
2859 for (unsigned ChildNo = 0, InstOpNo = NumResults;
2860 InstOpNo != II.OperandList.size(); ++InstOpNo) {
2861 std::vector<std::string> Ops;
2863 // If this is a normal operand or a predicate operand without
2864 // 'execute always', emit it.
2865 Record *OperandNode = II.OperandList[InstOpNo].Rec;
2866 if ((!OperandNode->isSubClassOf("PredicateOperand") &&
2867 !OperandNode->isSubClassOf("OptionalDefOperand")) ||
2868 ISE.getDefaultOperand(OperandNode).DefaultOps.empty()) {
2869 Ops = EmitResultCode(N->getChild(ChildNo), DstRegs,
2870 InFlagDecled, ResNodeDecled);
2871 AllOps.insert(AllOps.end(), Ops.begin(), Ops.end());
2874 // Otherwise, this is a predicate or optional def operand, emit the
2875 // 'default ops' operands.
2876 const DAGDefaultOperand &DefaultOp =
2877 ISE.getDefaultOperand(II.OperandList[InstOpNo].Rec);
2878 for (unsigned i = 0, e = DefaultOp.DefaultOps.size(); i != e; ++i) {
2879 Ops = EmitResultCode(DefaultOp.DefaultOps[i], DstRegs,
2880 InFlagDecled, ResNodeDecled);
2881 AllOps.insert(AllOps.end(), Ops.begin(), Ops.end());
2882 NumEAInputs += Ops.size();
2887 // Emit all the chain and CopyToReg stuff.
2888 bool ChainEmitted = NodeHasChain;
2890 emitCode("AddToISelQueue(" + ChainName + ");");
2891 if (NodeHasInFlag || HasImpInputs)
2892 EmitInFlagSelectCode(Pattern, "N", ChainEmitted,
2893 InFlagDecled, ResNodeDecled, true);
2894 if (NodeHasOptInFlag || NodeHasInFlag || HasImpInputs) {
2895 if (!InFlagDecled) {
2896 emitCode("SDOperand InFlag(0, 0);");
2897 InFlagDecled = true;
2899 if (NodeHasOptInFlag) {
2900 emitCode("if (HasInFlag) {");
2901 emitCode(" InFlag = N.getOperand(N.getNumOperands()-1);");
2902 emitCode(" AddToISelQueue(InFlag);");
2907 unsigned ResNo = TmpNo++;
2908 if (!isRoot || InputHasChain || NodeHasChain || NodeHasOutFlag ||
2909 NodeHasOptInFlag || HasImpResults) {
2912 std::string NodeName;
2914 NodeName = "Tmp" + utostr(ResNo);
2915 Code2 = "SDOperand " + NodeName + "(";
2917 NodeName = "ResNode";
2918 if (!ResNodeDecled) {
2919 Code2 = "SDNode *" + NodeName + " = ";
2920 ResNodeDecled = true;
2922 Code2 = NodeName + " = ";
2925 Code += "CurDAG->getTargetNode(Opc" + utostr(OpcNo);
2926 unsigned OpsNo = OpcNo;
2927 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
2929 // Output order: results, chain, flags
2931 if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid) {
2932 Code += ", VT" + utostr(VTNo);
2933 emitVT(getEnumName(N->getTypeNum(0)));
2935 // Add types for implicit results in physical registers, scheduler will
2936 // care of adding copyfromreg nodes.
2937 for (unsigned i = 0; i < NumDstRegs; i++) {
2938 Record *RR = DstRegs[i];
2939 if (RR->isSubClassOf("Register")) {
2940 MVT::ValueType RVT = getRegisterValueType(RR, CGT);
2941 Code += ", " + getEnumName(RVT);
2945 Code += ", MVT::Other";
2947 Code += ", MVT::Flag";
2949 // Figure out how many fixed inputs the node has. This is important to
2950 // know which inputs are the variable ones if present.
2951 unsigned NumInputs = AllOps.size();
2952 NumInputs += NodeHasChain;
2956 for (unsigned i = 0, e = AllOps.size(); i != e; ++i)
2957 emitCode("Ops" + utostr(OpsNo) + ".push_back(" + AllOps[i] + ");");
2962 // Figure out whether any operands at the end of the op list are not
2963 // part of the variable section.
2964 std::string EndAdjust;
2965 if (NodeHasInFlag || HasImpInputs)
2966 EndAdjust = "-1"; // Always has one flag.
2967 else if (NodeHasOptInFlag)
2968 EndAdjust = "-(HasInFlag?1:0)"; // May have a flag.
2970 emitCode("for (unsigned i = " + utostr(NumInputs - NumEAInputs) +
2971 ", e = N.getNumOperands()" + EndAdjust + "; i != e; ++i) {");
2973 emitCode(" AddToISelQueue(N.getOperand(i));");
2974 emitCode(" Ops" + utostr(OpsNo) + ".push_back(N.getOperand(i));");
2980 emitCode("Ops" + utostr(OpsNo) + ".push_back(" + ChainName + ");");
2982 AllOps.push_back(ChainName);
2986 if (NodeHasInFlag || HasImpInputs)
2987 emitCode("Ops" + utostr(OpsNo) + ".push_back(InFlag);");
2988 else if (NodeHasOptInFlag) {
2989 emitCode("if (HasInFlag)");
2990 emitCode(" Ops" + utostr(OpsNo) + ".push_back(InFlag);");
2992 Code += ", &Ops" + utostr(OpsNo) + "[0], Ops" + utostr(OpsNo) +
2994 } else if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs)
2995 AllOps.push_back("InFlag");
2997 unsigned NumOps = AllOps.size();
2999 if (!NodeHasOptInFlag && NumOps < 4) {
3000 for (unsigned i = 0; i != NumOps; ++i)
3001 Code += ", " + AllOps[i];
3003 std::string OpsCode = "SDOperand Ops" + utostr(OpsNo) + "[] = { ";
3004 for (unsigned i = 0; i != NumOps; ++i) {
3005 OpsCode += AllOps[i];
3009 emitCode(OpsCode + " };");
3010 Code += ", Ops" + utostr(OpsNo) + ", ";
3011 if (NodeHasOptInFlag) {
3012 Code += "HasInFlag ? ";
3013 Code += utostr(NumOps) + " : " + utostr(NumOps-1);
3015 Code += utostr(NumOps);
3021 emitCode(Code2 + Code + ");");
3024 // Remember which op produces the chain.
3026 emitCode(ChainName + " = SDOperand(" + NodeName +
3027 ".Val, " + utostr(NumResults+NumDstRegs) + ");");
3029 emitCode(ChainName + " = SDOperand(" + NodeName +
3030 ", " + utostr(NumResults+NumDstRegs) + ");");
3033 NodeOps.push_back("Tmp" + utostr(ResNo));
3037 bool NeedReplace = false;
3038 if (NodeHasOutFlag) {
3039 if (!InFlagDecled) {
3040 emitCode("SDOperand InFlag(ResNode, " +
3041 utostr(NumResults+NumDstRegs+(unsigned)NodeHasChain) + ");");
3042 InFlagDecled = true;
3044 emitCode("InFlag = SDOperand(ResNode, " +
3045 utostr(NumResults+NumDstRegs+(unsigned)NodeHasChain) + ");");
3048 if (FoldedChains.size() > 0) {
3050 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
3051 emitCode("ReplaceUses(SDOperand(" +
3052 FoldedChains[j].first + ".Val, " +
3053 utostr(FoldedChains[j].second) + "), SDOperand(ResNode, " +
3054 utostr(NumResults+NumDstRegs) + "));");
3058 if (NodeHasOutFlag) {
3059 emitCode("ReplaceUses(SDOperand(N.Val, " +
3060 utostr(NumPatResults + (unsigned)InputHasChain)
3065 if (NeedReplace && InputHasChain)
3066 emitCode("ReplaceUses(SDOperand(N.Val, " +
3067 utostr(NumPatResults) + "), SDOperand(" + ChainName
3068 + ".Val, " + ChainName + ".ResNo" + "));");
3070 // User does not expect the instruction would produce a chain!
3071 if ((!InputHasChain && NodeHasChain) && NodeHasOutFlag) {
3073 } else if (InputHasChain && !NodeHasChain) {
3074 // One of the inner node produces a chain.
3076 emitCode("ReplaceUses(SDOperand(N.Val, " + utostr(NumPatResults+1) +
3077 "), SDOperand(ResNode, N.ResNo-1));");
3078 emitCode("ReplaceUses(SDOperand(N.Val, " + utostr(NumPatResults) +
3079 "), " + ChainName + ");");
3082 emitCode("return ResNode;");
3084 std::string Code = "return CurDAG->SelectNodeTo(N.Val, Opc" +
3086 if (N->getTypeNum(0) != MVT::isVoid)
3087 Code += ", VT" + utostr(VTNo);
3089 Code += ", MVT::Flag";
3091 if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs)
3092 AllOps.push_back("InFlag");
3094 unsigned NumOps = AllOps.size();
3096 if (!NodeHasOptInFlag && NumOps < 4) {
3097 for (unsigned i = 0; i != NumOps; ++i)
3098 Code += ", " + AllOps[i];
3100 std::string OpsCode = "SDOperand Ops" + utostr(OpcNo) + "[] = { ";
3101 for (unsigned i = 0; i != NumOps; ++i) {
3102 OpsCode += AllOps[i];
3106 emitCode(OpsCode + " };");
3107 Code += ", Ops" + utostr(OpcNo) + ", ";
3108 Code += utostr(NumOps);
3111 emitCode(Code + ");");
3112 emitOpcode(II.Namespace + "::" + II.TheDef->getName());
3113 if (N->getTypeNum(0) != MVT::isVoid)
3114 emitVT(getEnumName(N->getTypeNum(0)));
3118 } else if (Op->isSubClassOf("SDNodeXForm")) {
3119 assert(N->getNumChildren() == 1 && "node xform should have one child!");
3120 // PatLeaf node - the operand may or may not be a leaf node. But it should
3122 std::vector<std::string> Ops =
3123 EmitResultCode(N->getChild(0), DstRegs, InFlagDecled,
3124 ResNodeDecled, true);
3125 unsigned ResNo = TmpNo++;
3126 emitCode("SDOperand Tmp" + utostr(ResNo) + " = Transform_" + Op->getName()
3127 + "(" + Ops.back() + ".Val);");
3128 NodeOps.push_back("Tmp" + utostr(ResNo));
3130 emitCode("return Tmp" + utostr(ResNo) + ".Val;");
3135 throw std::string("Unknown node in result pattern!");
3139 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat'
3140 /// and add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
3141 /// 'Pat' may be missing types. If we find an unresolved type to add a check
3142 /// for, this returns true otherwise false if Pat has all types.
3143 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
3144 const std::string &Prefix, bool isRoot = false) {
3146 if (Pat->getExtTypes() != Other->getExtTypes()) {
3147 // Move a type over from 'other' to 'pat'.
3148 Pat->setTypes(Other->getExtTypes());
3149 // The top level node type is checked outside of the select function.
3151 emitCheck(Prefix + ".Val->getValueType(0) == " +
3152 getName(Pat->getTypeNum(0)));
3157 (unsigned) NodeHasProperty(Pat, SDNPHasChain, ISE);
3158 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
3159 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
3160 Prefix + utostr(OpNo)))
3166 /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is
3168 void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName,
3169 bool &ChainEmitted, bool &InFlagDecled,
3170 bool &ResNodeDecled, bool isRoot = false) {
3171 const CodeGenTarget &T = ISE.getTargetInfo();
3173 (unsigned) NodeHasProperty(N, SDNPHasChain, ISE);
3174 bool HasInFlag = NodeHasProperty(N, SDNPInFlag, ISE);
3175 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
3176 TreePatternNode *Child = N->getChild(i);
3177 if (!Child->isLeaf()) {
3178 EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted,
3179 InFlagDecled, ResNodeDecled);
3181 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
3182 if (!Child->getName().empty()) {
3183 std::string Name = RootName + utostr(OpNo);
3184 if (Duplicates.find(Name) != Duplicates.end())
3185 // A duplicate! Do not emit a copy for this node.
3189 Record *RR = DI->getDef();
3190 if (RR->isSubClassOf("Register")) {
3191 MVT::ValueType RVT = getRegisterValueType(RR, T);
3192 if (RVT == MVT::Flag) {
3193 if (!InFlagDecled) {
3194 emitCode("SDOperand InFlag = " + RootName + utostr(OpNo) + ";");
3195 InFlagDecled = true;
3197 emitCode("InFlag = " + RootName + utostr(OpNo) + ";");
3198 emitCode("AddToISelQueue(InFlag);");
3200 if (!ChainEmitted) {
3201 emitCode("SDOperand Chain = CurDAG->getEntryNode();");
3202 ChainName = "Chain";
3203 ChainEmitted = true;
3205 emitCode("AddToISelQueue(" + RootName + utostr(OpNo) + ");");
3206 if (!InFlagDecled) {
3207 emitCode("SDOperand InFlag(0, 0);");
3208 InFlagDecled = true;
3210 std::string Decl = (!ResNodeDecled) ? "SDNode *" : "";
3211 emitCode(Decl + "ResNode = CurDAG->getCopyToReg(" + ChainName +
3212 ", " + ISE.getQualifiedName(RR) +
3213 ", " + RootName + utostr(OpNo) + ", InFlag).Val;");
3214 ResNodeDecled = true;
3215 emitCode(ChainName + " = SDOperand(ResNode, 0);");
3216 emitCode("InFlag = SDOperand(ResNode, 1);");
3224 if (!InFlagDecled) {
3225 emitCode("SDOperand InFlag = " + RootName +
3226 ".getOperand(" + utostr(OpNo) + ");");
3227 InFlagDecled = true;
3229 emitCode("InFlag = " + RootName +
3230 ".getOperand(" + utostr(OpNo) + ");");
3231 emitCode("AddToISelQueue(InFlag);");
3236 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
3237 /// stream to match the pattern, and generate the code for the match if it
3238 /// succeeds. Returns true if the pattern is not guaranteed to match.
3239 void DAGISelEmitter::GenerateCodeForPattern(PatternToMatch &Pattern,
3240 std::vector<std::pair<unsigned, std::string> > &GeneratedCode,
3241 std::set<std::string> &GeneratedDecl,
3242 std::vector<std::string> &TargetOpcodes,
3243 std::vector<std::string> &TargetVTs) {
3244 PatternCodeEmitter Emitter(*this, Pattern.getPredicates(),
3245 Pattern.getSrcPattern(), Pattern.getDstPattern(),
3246 GeneratedCode, GeneratedDecl,
3247 TargetOpcodes, TargetVTs);
3249 // Emit the matcher, capturing named arguments in VariableMap.
3250 bool FoundChain = false;
3251 Emitter.EmitMatchCode(Pattern.getSrcPattern(), NULL, "N", "", FoundChain);
3253 // TP - Get *SOME* tree pattern, we don't care which.
3254 TreePattern &TP = *PatternFragments.begin()->second;
3256 // At this point, we know that we structurally match the pattern, but the
3257 // types of the nodes may not match. Figure out the fewest number of type
3258 // comparisons we need to emit. For example, if there is only one integer
3259 // type supported by a target, there should be no type comparisons at all for
3260 // integer patterns!
3262 // To figure out the fewest number of type checks needed, clone the pattern,
3263 // remove the types, then perform type inference on the pattern as a whole.
3264 // If there are unresolved types, emit an explicit check for those types,
3265 // apply the type to the tree, then rerun type inference. Iterate until all
3266 // types are resolved.
3268 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
3269 RemoveAllTypes(Pat);
3272 // Resolve/propagate as many types as possible.
3274 bool MadeChange = true;
3276 MadeChange = Pat->ApplyTypeConstraints(TP,
3277 true/*Ignore reg constraints*/);
3279 assert(0 && "Error: could not find consistent types for something we"
3280 " already decided was ok!");
3284 // Insert a check for an unresolved type and add it to the tree. If we find
3285 // an unresolved type to add a check for, this returns true and we iterate,
3286 // otherwise we are done.
3287 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N", true));
3289 Emitter.EmitResultCode(Pattern.getDstPattern(), Pattern.getDstRegs(),
3290 false, false, false, true);
3294 /// EraseCodeLine - Erase one code line from all of the patterns. If removing
3295 /// a line causes any of them to be empty, remove them and return true when
3297 static bool EraseCodeLine(std::vector<std::pair<PatternToMatch*,
3298 std::vector<std::pair<unsigned, std::string> > > >
3300 bool ErasedPatterns = false;
3301 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
3302 Patterns[i].second.pop_back();
3303 if (Patterns[i].second.empty()) {
3304 Patterns.erase(Patterns.begin()+i);
3306 ErasedPatterns = true;
3309 return ErasedPatterns;
3312 /// EmitPatterns - Emit code for at least one pattern, but try to group common
3313 /// code together between the patterns.
3314 void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
3315 std::vector<std::pair<unsigned, std::string> > > >
3316 &Patterns, unsigned Indent,
3318 typedef std::pair<unsigned, std::string> CodeLine;
3319 typedef std::vector<CodeLine> CodeList;
3320 typedef std::vector<std::pair<PatternToMatch*, CodeList> > PatternList;
3322 if (Patterns.empty()) return;
3324 // Figure out how many patterns share the next code line. Explicitly copy
3325 // FirstCodeLine so that we don't invalidate a reference when changing
3327 const CodeLine FirstCodeLine = Patterns.back().second.back();
3328 unsigned LastMatch = Patterns.size()-1;
3329 while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
3332 // If not all patterns share this line, split the list into two pieces. The
3333 // first chunk will use this line, the second chunk won't.
3334 if (LastMatch != 0) {
3335 PatternList Shared(Patterns.begin()+LastMatch, Patterns.end());
3336 PatternList Other(Patterns.begin(), Patterns.begin()+LastMatch);
3338 // FIXME: Emit braces?
3339 if (Shared.size() == 1) {
3340 PatternToMatch &Pattern = *Shared.back().first;
3341 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
3342 Pattern.getSrcPattern()->print(OS);
3343 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
3344 Pattern.getDstPattern()->print(OS);
3346 unsigned AddedComplexity = Pattern.getAddedComplexity();
3347 OS << std::string(Indent, ' ') << "// Pattern complexity = "
3348 << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity
3350 << getResultPatternCost(Pattern.getDstPattern(), *this)
3352 << getResultPatternSize(Pattern.getDstPattern(), *this) << "\n";
3354 if (FirstCodeLine.first != 1) {
3355 OS << std::string(Indent, ' ') << "{\n";
3358 EmitPatterns(Shared, Indent, OS);
3359 if (FirstCodeLine.first != 1) {
3361 OS << std::string(Indent, ' ') << "}\n";
3364 if (Other.size() == 1) {
3365 PatternToMatch &Pattern = *Other.back().first;
3366 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
3367 Pattern.getSrcPattern()->print(OS);
3368 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
3369 Pattern.getDstPattern()->print(OS);
3371 unsigned AddedComplexity = Pattern.getAddedComplexity();
3372 OS << std::string(Indent, ' ') << "// Pattern complexity = "
3373 << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity
3375 << getResultPatternCost(Pattern.getDstPattern(), *this)
3377 << getResultPatternSize(Pattern.getDstPattern(), *this) << "\n";
3379 EmitPatterns(Other, Indent, OS);
3383 // Remove this code from all of the patterns that share it.
3384 bool ErasedPatterns = EraseCodeLine(Patterns);
3386 bool isPredicate = FirstCodeLine.first == 1;
3388 // Otherwise, every pattern in the list has this line. Emit it.
3391 OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
3393 OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
3395 // If the next code line is another predicate, and if all of the pattern
3396 // in this group share the same next line, emit it inline now. Do this
3397 // until we run out of common predicates.
3398 while (!ErasedPatterns && Patterns.back().second.back().first == 1) {
3399 // Check that all of fhe patterns in Patterns end with the same predicate.
3400 bool AllEndWithSamePredicate = true;
3401 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
3402 if (Patterns[i].second.back() != Patterns.back().second.back()) {
3403 AllEndWithSamePredicate = false;
3406 // If all of the predicates aren't the same, we can't share them.
3407 if (!AllEndWithSamePredicate) break;
3409 // Otherwise we can. Emit it shared now.
3410 OS << " &&\n" << std::string(Indent+4, ' ')
3411 << Patterns.back().second.back().second;
3412 ErasedPatterns = EraseCodeLine(Patterns);
3419 EmitPatterns(Patterns, Indent, OS);
3422 OS << std::string(Indent-2, ' ') << "}\n";
3425 static std::string getOpcodeName(Record *Op, DAGISelEmitter &ISE) {
3426 const SDNodeInfo &OpcodeInfo = ISE.getSDNodeInfo(Op);
3427 return OpcodeInfo.getEnumName();
3430 static std::string getLegalCName(std::string OpName) {
3431 std::string::size_type pos = OpName.find("::");
3432 if (pos != std::string::npos)
3433 OpName.replace(pos, 2, "_");
3437 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
3438 // Get the namespace to insert instructions into. Make sure not to pick up
3439 // "TargetInstrInfo" by accidentally getting the namespace off the PHI
3440 // instruction or something.
3442 for (CodeGenTarget::inst_iterator i = Target.inst_begin(),
3443 e = Target.inst_end(); i != e; ++i) {
3444 InstNS = i->second.Namespace;
3445 if (InstNS != "TargetInstrInfo")
3449 if (!InstNS.empty()) InstNS += "::";
3451 // Group the patterns by their top-level opcodes.
3452 std::map<std::string, std::vector<PatternToMatch*> > PatternsByOpcode;
3453 // All unique target node emission functions.
3454 std::map<std::string, unsigned> EmitFunctions;
3455 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
3456 TreePatternNode *Node = PatternsToMatch[i].getSrcPattern();
3457 if (!Node->isLeaf()) {
3458 PatternsByOpcode[getOpcodeName(Node->getOperator(), *this)].
3459 push_back(&PatternsToMatch[i]);
3461 const ComplexPattern *CP;
3462 if (dynamic_cast<IntInit*>(Node->getLeafValue())) {
3463 PatternsByOpcode[getOpcodeName(getSDNodeNamed("imm"), *this)].
3464 push_back(&PatternsToMatch[i]);
3465 } else if ((CP = NodeGetComplexPattern(Node, *this))) {
3466 std::vector<Record*> OpNodes = CP->getRootNodes();
3467 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
3468 PatternsByOpcode[getOpcodeName(OpNodes[j], *this)]
3469 .insert(PatternsByOpcode[getOpcodeName(OpNodes[j], *this)].begin(),
3470 &PatternsToMatch[i]);
3473 cerr << "Unrecognized opcode '";
3475 cerr << "' on tree pattern '";
3476 cerr << PatternsToMatch[i].getDstPattern()->getOperator()->getName();
3483 // For each opcode, there might be multiple select functions, one per
3484 // ValueType of the node (or its first operand if it doesn't produce a
3485 // non-chain result.
3486 std::map<std::string, std::vector<std::string> > OpcodeVTMap;
3488 // Emit one Select_* method for each top-level opcode. We do this instead of
3489 // emitting one giant switch statement to support compilers where this will
3490 // result in the recursive functions taking less stack space.
3491 for (std::map<std::string, std::vector<PatternToMatch*> >::iterator
3492 PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end();
3493 PBOI != E; ++PBOI) {
3494 const std::string &OpName = PBOI->first;
3495 std::vector<PatternToMatch*> &PatternsOfOp = PBOI->second;
3496 assert(!PatternsOfOp.empty() && "No patterns but map has entry?");
3498 // We want to emit all of the matching code now. However, we want to emit
3499 // the matches in order of minimal cost. Sort the patterns so the least
3500 // cost one is at the start.
3501 std::stable_sort(PatternsOfOp.begin(), PatternsOfOp.end(),
3502 PatternSortingPredicate(*this));
3504 // Split them into groups by type.
3505 std::map<MVT::ValueType, std::vector<PatternToMatch*> > PatternsByType;
3506 for (unsigned i = 0, e = PatternsOfOp.size(); i != e; ++i) {
3507 PatternToMatch *Pat = PatternsOfOp[i];
3508 TreePatternNode *SrcPat = Pat->getSrcPattern();
3509 MVT::ValueType VT = SrcPat->getTypeNum(0);
3510 std::map<MVT::ValueType, std::vector<PatternToMatch*> >::iterator TI =
3511 PatternsByType.find(VT);
3512 if (TI != PatternsByType.end())
3513 TI->second.push_back(Pat);
3515 std::vector<PatternToMatch*> PVec;
3516 PVec.push_back(Pat);
3517 PatternsByType.insert(std::make_pair(VT, PVec));
3521 for (std::map<MVT::ValueType, std::vector<PatternToMatch*> >::iterator
3522 II = PatternsByType.begin(), EE = PatternsByType.end(); II != EE;
3524 MVT::ValueType OpVT = II->first;
3525 std::vector<PatternToMatch*> &Patterns = II->second;
3526 typedef std::vector<std::pair<unsigned,std::string> > CodeList;
3527 typedef std::vector<std::pair<unsigned,std::string> >::iterator CodeListI;
3529 std::vector<std::pair<PatternToMatch*, CodeList> > CodeForPatterns;
3530 std::vector<std::vector<std::string> > PatternOpcodes;
3531 std::vector<std::vector<std::string> > PatternVTs;
3532 std::vector<std::set<std::string> > PatternDecls;
3533 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
3534 CodeList GeneratedCode;
3535 std::set<std::string> GeneratedDecl;
3536 std::vector<std::string> TargetOpcodes;
3537 std::vector<std::string> TargetVTs;
3538 GenerateCodeForPattern(*Patterns[i], GeneratedCode, GeneratedDecl,
3539 TargetOpcodes, TargetVTs);
3540 CodeForPatterns.push_back(std::make_pair(Patterns[i], GeneratedCode));
3541 PatternDecls.push_back(GeneratedDecl);
3542 PatternOpcodes.push_back(TargetOpcodes);
3543 PatternVTs.push_back(TargetVTs);
3546 // Scan the code to see if all of the patterns are reachable and if it is
3547 // possible that the last one might not match.
3548 bool mightNotMatch = true;
3549 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3550 CodeList &GeneratedCode = CodeForPatterns[i].second;
3551 mightNotMatch = false;
3553 for (unsigned j = 0, e = GeneratedCode.size(); j != e; ++j) {
3554 if (GeneratedCode[j].first == 1) { // predicate.
3555 mightNotMatch = true;
3560 // If this pattern definitely matches, and if it isn't the last one, the
3561 // patterns after it CANNOT ever match. Error out.
3562 if (mightNotMatch == false && i != CodeForPatterns.size()-1) {
3563 cerr << "Pattern '";
3564 CodeForPatterns[i].first->getSrcPattern()->print(*cerr.stream());
3565 cerr << "' is impossible to select!\n";
3570 // Factor target node emission code (emitted by EmitResultCode) into
3571 // separate functions. Uniquing and share them among all instruction
3572 // selection routines.
3573 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3574 CodeList &GeneratedCode = CodeForPatterns[i].second;
3575 std::vector<std::string> &TargetOpcodes = PatternOpcodes[i];
3576 std::vector<std::string> &TargetVTs = PatternVTs[i];
3577 std::set<std::string> Decls = PatternDecls[i];
3578 std::vector<std::string> AddedInits;
3579 int CodeSize = (int)GeneratedCode.size();
3581 for (int j = CodeSize-1; j >= 0; --j) {
3582 if (LastPred == -1 && GeneratedCode[j].first == 1)
3584 else if (LastPred != -1 && GeneratedCode[j].first == 2)
3585 AddedInits.push_back(GeneratedCode[j].second);
3588 std::string CalleeCode = "(const SDOperand &N";
3589 std::string CallerCode = "(N";
3590 for (unsigned j = 0, e = TargetOpcodes.size(); j != e; ++j) {
3591 CalleeCode += ", unsigned Opc" + utostr(j);
3592 CallerCode += ", " + TargetOpcodes[j];
3594 for (unsigned j = 0, e = TargetVTs.size(); j != e; ++j) {
3595 CalleeCode += ", MVT::ValueType VT" + utostr(j);
3596 CallerCode += ", " + TargetVTs[j];
3598 for (std::set<std::string>::iterator
3599 I = Decls.begin(), E = Decls.end(); I != E; ++I) {
3600 std::string Name = *I;
3601 CalleeCode += ", SDOperand &" + Name;
3602 CallerCode += ", " + Name;
3606 // Prevent emission routines from being inlined to reduce selection
3607 // routines stack frame sizes.
3608 CalleeCode += "DISABLE_INLINE ";
3609 CalleeCode += "{\n";
3611 for (std::vector<std::string>::const_reverse_iterator
3612 I = AddedInits.rbegin(), E = AddedInits.rend(); I != E; ++I)
3613 CalleeCode += " " + *I + "\n";
3615 for (int j = LastPred+1; j < CodeSize; ++j)
3616 CalleeCode += " " + GeneratedCode[j].second + "\n";
3617 for (int j = LastPred+1; j < CodeSize; ++j)
3618 GeneratedCode.pop_back();
3619 CalleeCode += "}\n";
3621 // Uniquing the emission routines.
3622 unsigned EmitFuncNum;
3623 std::map<std::string, unsigned>::iterator EFI =
3624 EmitFunctions.find(CalleeCode);
3625 if (EFI != EmitFunctions.end()) {
3626 EmitFuncNum = EFI->second;
3628 EmitFuncNum = EmitFunctions.size();
3629 EmitFunctions.insert(std::make_pair(CalleeCode, EmitFuncNum));
3630 OS << "SDNode *Emit_" << utostr(EmitFuncNum) << CalleeCode;
3633 // Replace the emission code within selection routines with calls to the
3634 // emission functions.
3635 CallerCode = "return Emit_" + utostr(EmitFuncNum) + CallerCode;
3636 GeneratedCode.push_back(std::make_pair(false, CallerCode));
3640 std::string OpVTStr;
3641 if (OpVT == MVT::iPTR) {
3643 } else if (OpVT == MVT::isVoid) {
3644 // Nodes with a void result actually have a first result type of either
3645 // Other (a chain) or Flag. Since there is no one-to-one mapping from
3646 // void to this case, we handle it specially here.
3648 OpVTStr = "_" + getEnumName(OpVT).substr(5); // Skip 'MVT::'
3650 std::map<std::string, std::vector<std::string> >::iterator OpVTI =
3651 OpcodeVTMap.find(OpName);
3652 if (OpVTI == OpcodeVTMap.end()) {
3653 std::vector<std::string> VTSet;
3654 VTSet.push_back(OpVTStr);
3655 OpcodeVTMap.insert(std::make_pair(OpName, VTSet));
3657 OpVTI->second.push_back(OpVTStr);
3659 OS << "SDNode *Select_" << getLegalCName(OpName)
3660 << OpVTStr << "(const SDOperand &N) {\n";
3662 // Loop through and reverse all of the CodeList vectors, as we will be
3663 // accessing them from their logical front, but accessing the end of a
3664 // vector is more efficient.
3665 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3666 CodeList &GeneratedCode = CodeForPatterns[i].second;
3667 std::reverse(GeneratedCode.begin(), GeneratedCode.end());
3670 // Next, reverse the list of patterns itself for the same reason.
3671 std::reverse(CodeForPatterns.begin(), CodeForPatterns.end());
3673 // Emit all of the patterns now, grouped together to share code.
3674 EmitPatterns(CodeForPatterns, 2, OS);
3676 // If the last pattern has predicates (which could fail) emit code to
3677 // catch the case where nothing handles a pattern.
3678 if (mightNotMatch) {
3679 OS << " cerr << \"Cannot yet select: \";\n";
3680 if (OpName != "ISD::INTRINSIC_W_CHAIN" &&
3681 OpName != "ISD::INTRINSIC_WO_CHAIN" &&
3682 OpName != "ISD::INTRINSIC_VOID") {
3683 OS << " N.Val->dump(CurDAG);\n";
3685 OS << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
3686 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
3687 << " cerr << \"intrinsic %\"<< "
3688 "Intrinsic::getName((Intrinsic::ID)iid);\n";
3690 OS << " cerr << '\\n';\n"
3692 << " return NULL;\n";
3698 // Emit boilerplate.
3699 OS << "SDNode *Select_INLINEASM(SDOperand N) {\n"
3700 << " std::vector<SDOperand> Ops(N.Val->op_begin(), N.Val->op_end());\n"
3701 << " SelectInlineAsmMemoryOperands(Ops, *CurDAG);\n\n"
3703 << " // Ensure that the asm operands are themselves selected.\n"
3704 << " for (unsigned j = 0, e = Ops.size(); j != e; ++j)\n"
3705 << " AddToISelQueue(Ops[j]);\n\n"
3707 << " std::vector<MVT::ValueType> VTs;\n"
3708 << " VTs.push_back(MVT::Other);\n"
3709 << " VTs.push_back(MVT::Flag);\n"
3710 << " SDOperand New = CurDAG->getNode(ISD::INLINEASM, VTs, &Ops[0], "
3712 << " return New.Val;\n"
3715 OS << "SDNode *Select_LABEL(const SDOperand &N) {\n"
3716 << " SDOperand Chain = N.getOperand(0);\n"
3717 << " SDOperand N1 = N.getOperand(1);\n"
3718 << " unsigned C = cast<ConstantSDNode>(N1)->getValue();\n"
3719 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
3720 << " AddToISelQueue(Chain);\n"
3721 << " return CurDAG->getTargetNode(TargetInstrInfo::LABEL,\n"
3722 << " MVT::Other, Tmp, Chain);\n"
3725 OS << "SDNode *Select_EXTRACT_SUBREG(const SDOperand &N) {\n"
3726 << " SDOperand N0 = N.getOperand(0);\n"
3727 << " SDOperand N1 = N.getOperand(1);\n"
3728 << " unsigned C = cast<ConstantSDNode>(N1)->getValue();\n"
3729 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
3730 << " AddToISelQueue(N0);\n"
3731 << " return CurDAG->getTargetNode(TargetInstrInfo::EXTRACT_SUBREG,\n"
3732 << " N.getValueType(), N0, Tmp);\n"
3735 OS << "SDNode *Select_INSERT_SUBREG(const SDOperand &N) {\n"
3736 << " SDOperand N0 = N.getOperand(0);\n"
3737 << " SDOperand N1 = N.getOperand(1);\n"
3738 << " SDOperand N2 = N.getOperand(2);\n"
3739 << " unsigned C = cast<ConstantSDNode>(N2)->getValue();\n"
3740 << " SDOperand Tmp = CurDAG->getTargetConstant(C, MVT::i32);\n"
3741 << " AddToISelQueue(N1);\n"
3742 << " if (N0.getOpcode() == ISD::UNDEF) {\n"
3743 << " return CurDAG->getTargetNode(TargetInstrInfo::INSERT_SUBREG,\n"
3744 << " N.getValueType(), N1, Tmp);\n"
3746 << " AddToISelQueue(N0);\n"
3747 << " return CurDAG->getTargetNode(TargetInstrInfo::INSERT_SUBREG,\n"
3748 << " N.getValueType(), N0, N1, Tmp);\n"
3752 OS << "// The main instruction selector code.\n"
3753 << "SDNode *SelectCode(SDOperand N) {\n"
3754 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
3755 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
3756 << "INSTRUCTION_LIST_END)) {\n"
3757 << " return NULL; // Already selected.\n"
3759 << " MVT::ValueType NVT = N.Val->getValueType(0);\n"
3760 << " switch (N.getOpcode()) {\n"
3761 << " default: break;\n"
3762 << " case ISD::EntryToken: // These leaves remain the same.\n"
3763 << " case ISD::BasicBlock:\n"
3764 << " case ISD::Register:\n"
3765 << " case ISD::HANDLENODE:\n"
3766 << " case ISD::TargetConstant:\n"
3767 << " case ISD::TargetConstantPool:\n"
3768 << " case ISD::TargetFrameIndex:\n"
3769 << " case ISD::TargetExternalSymbol:\n"
3770 << " case ISD::TargetJumpTable:\n"
3771 << " case ISD::TargetGlobalTLSAddress:\n"
3772 << " case ISD::TargetGlobalAddress: {\n"
3773 << " return NULL;\n"
3775 << " case ISD::AssertSext:\n"
3776 << " case ISD::AssertZext: {\n"
3777 << " AddToISelQueue(N.getOperand(0));\n"
3778 << " ReplaceUses(N, N.getOperand(0));\n"
3779 << " return NULL;\n"
3781 << " case ISD::TokenFactor:\n"
3782 << " case ISD::CopyFromReg:\n"
3783 << " case ISD::CopyToReg: {\n"
3784 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)\n"
3785 << " AddToISelQueue(N.getOperand(i));\n"
3786 << " return NULL;\n"
3788 << " case ISD::INLINEASM: return Select_INLINEASM(N);\n"
3789 << " case ISD::LABEL: return Select_LABEL(N);\n"
3790 << " case ISD::EXTRACT_SUBREG: return Select_EXTRACT_SUBREG(N);\n"
3791 << " case ISD::INSERT_SUBREG: return Select_INSERT_SUBREG(N);\n";
3794 // Loop over all of the case statements, emiting a call to each method we
3796 for (std::map<std::string, std::vector<PatternToMatch*> >::iterator
3797 PBOI = PatternsByOpcode.begin(), E = PatternsByOpcode.end();
3798 PBOI != E; ++PBOI) {
3799 const std::string &OpName = PBOI->first;
3800 // Potentially multiple versions of select for this opcode. One for each
3801 // ValueType of the node (or its first true operand if it doesn't produce a
3803 std::map<std::string, std::vector<std::string> >::iterator OpVTI =
3804 OpcodeVTMap.find(OpName);
3805 std::vector<std::string> &OpVTs = OpVTI->second;
3806 OS << " case " << OpName << ": {\n";
3807 // Keep track of whether we see a pattern that has an iPtr result.
3808 bool HasPtrPattern = false;
3809 bool HasDefaultPattern = false;
3811 OS << " switch (NVT) {\n";
3812 for (unsigned i = 0, e = OpVTs.size(); i < e; ++i) {
3813 std::string &VTStr = OpVTs[i];
3814 if (VTStr.empty()) {
3815 HasDefaultPattern = true;
3819 // If this is a match on iPTR: don't emit it directly, we need special
3821 if (VTStr == "_iPTR") {
3822 HasPtrPattern = true;
3825 OS << " case MVT::" << VTStr.substr(1) << ":\n"
3826 << " return Select_" << getLegalCName(OpName)
3827 << VTStr << "(N);\n";
3829 OS << " default:\n";
3831 // If there is an iPTR result version of this pattern, emit it here.
3832 if (HasPtrPattern) {
3833 OS << " if (NVT == TLI.getPointerTy())\n";
3834 OS << " return Select_" << getLegalCName(OpName) <<"_iPTR(N);\n";
3836 if (HasDefaultPattern) {
3837 OS << " return Select_" << getLegalCName(OpName) << "(N);\n";
3845 OS << " } // end of big switch.\n\n"
3846 << " cerr << \"Cannot yet select: \";\n"
3847 << " if (N.getOpcode() != ISD::INTRINSIC_W_CHAIN &&\n"
3848 << " N.getOpcode() != ISD::INTRINSIC_WO_CHAIN &&\n"
3849 << " N.getOpcode() != ISD::INTRINSIC_VOID) {\n"
3850 << " N.Val->dump(CurDAG);\n"
3852 << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
3853 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
3854 << " cerr << \"intrinsic %\"<< "
3855 "Intrinsic::getName((Intrinsic::ID)iid);\n"
3857 << " cerr << '\\n';\n"
3859 << " return NULL;\n"
3863 void DAGISelEmitter::run(std::ostream &OS) {
3864 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
3867 OS << "// *** NOTE: This file is #included into the middle of the target\n"
3868 << "// *** instruction selector class. These functions are really "
3871 OS << "#include \"llvm/Support/Compiler.h\"\n";
3873 OS << "// Instruction selector priority queue:\n"
3874 << "std::vector<SDNode*> ISelQueue;\n";
3875 OS << "/// Keep track of nodes which have already been added to queue.\n"
3876 << "unsigned char *ISelQueued;\n";
3877 OS << "/// Keep track of nodes which have already been selected.\n"
3878 << "unsigned char *ISelSelected;\n";
3879 OS << "/// Dummy parameter to ReplaceAllUsesOfValueWith().\n"
3880 << "std::vector<SDNode*> ISelKilled;\n\n";
3882 OS << "/// IsChainCompatible - Returns true if Chain is Op or Chain does\n";
3883 OS << "/// not reach Op.\n";
3884 OS << "static bool IsChainCompatible(SDNode *Chain, SDNode *Op) {\n";
3885 OS << " if (Chain->getOpcode() == ISD::EntryToken)\n";
3886 OS << " return true;\n";
3887 OS << " else if (Chain->getOpcode() == ISD::TokenFactor)\n";
3888 OS << " return false;\n";
3889 OS << " else if (Chain->getNumOperands() > 0) {\n";
3890 OS << " SDOperand C0 = Chain->getOperand(0);\n";
3891 OS << " if (C0.getValueType() == MVT::Other)\n";
3892 OS << " return C0.Val != Op && IsChainCompatible(C0.Val, Op);\n";
3894 OS << " return true;\n";
3897 OS << "/// Sorting functions for the selection queue.\n"
3898 << "struct isel_sort : public std::binary_function"
3899 << "<SDNode*, SDNode*, bool> {\n"
3900 << " bool operator()(const SDNode* left, const SDNode* right) "
3902 << " return (left->getNodeId() > right->getNodeId());\n"
3906 OS << "inline void setQueued(int Id) {\n";
3907 OS << " ISelQueued[Id / 8] |= 1 << (Id % 8);\n";
3909 OS << "inline bool isQueued(int Id) {\n";
3910 OS << " return ISelQueued[Id / 8] & (1 << (Id % 8));\n";
3912 OS << "inline void setSelected(int Id) {\n";
3913 OS << " ISelSelected[Id / 8] |= 1 << (Id % 8);\n";
3915 OS << "inline bool isSelected(int Id) {\n";
3916 OS << " return ISelSelected[Id / 8] & (1 << (Id % 8));\n";
3919 OS << "void AddToISelQueue(SDOperand N) DISABLE_INLINE {\n";
3920 OS << " int Id = N.Val->getNodeId();\n";
3921 OS << " if (Id != -1 && !isQueued(Id)) {\n";
3922 OS << " ISelQueue.push_back(N.Val);\n";
3923 OS << " std::push_heap(ISelQueue.begin(), ISelQueue.end(), isel_sort());\n";
3924 OS << " setQueued(Id);\n";
3928 OS << "inline void RemoveKilled() {\n";
3929 OS << " unsigned NumKilled = ISelKilled.size();\n";
3930 OS << " if (NumKilled) {\n";
3931 OS << " for (unsigned i = 0; i != NumKilled; ++i) {\n";
3932 OS << " SDNode *Temp = ISelKilled[i];\n";
3933 OS << " ISelQueue.erase(std::remove(ISelQueue.begin(), ISelQueue.end(), "
3934 << "Temp), ISelQueue.end());\n";
3936 OS << " std::make_heap(ISelQueue.begin(), ISelQueue.end(), isel_sort());\n";
3937 OS << " ISelKilled.clear();\n";
3941 OS << "void ReplaceUses(SDOperand F, SDOperand T) DISABLE_INLINE {\n";
3942 OS << " CurDAG->ReplaceAllUsesOfValueWith(F, T, ISelKilled);\n";
3943 OS << " setSelected(F.Val->getNodeId());\n";
3944 OS << " RemoveKilled();\n";
3946 OS << "void ReplaceUses(SDNode *F, SDNode *T) DISABLE_INLINE {\n";
3947 OS << " unsigned FNumVals = F->getNumValues();\n";
3948 OS << " unsigned TNumVals = T->getNumValues();\n";
3949 OS << " if (FNumVals != TNumVals) {\n";
3950 OS << " for (unsigned i = 0, e = std::min(FNumVals, TNumVals); "
3952 OS << " CurDAG->ReplaceAllUsesOfValueWith(SDOperand(F, i), "
3953 << "SDOperand(T, i), ISelKilled);\n";
3954 OS << " } else {\n";
3955 OS << " CurDAG->ReplaceAllUsesWith(F, T, &ISelKilled);\n";
3957 OS << " setSelected(F->getNodeId());\n";
3958 OS << " RemoveKilled();\n";
3961 OS << "// SelectRoot - Top level entry to DAG isel.\n";
3962 OS << "SDOperand SelectRoot(SDOperand Root) {\n";
3963 OS << " SelectRootInit();\n";
3964 OS << " unsigned NumBytes = (DAGSize + 7) / 8;\n";
3965 OS << " ISelQueued = new unsigned char[NumBytes];\n";
3966 OS << " ISelSelected = new unsigned char[NumBytes];\n";
3967 OS << " memset(ISelQueued, 0, NumBytes);\n";
3968 OS << " memset(ISelSelected, 0, NumBytes);\n";
3970 OS << " // Create a dummy node (which is not added to allnodes), that adds\n"
3971 << " // a reference to the root node, preventing it from being deleted,\n"
3972 << " // and tracking any changes of the root.\n"
3973 << " HandleSDNode Dummy(CurDAG->getRoot());\n"
3974 << " ISelQueue.push_back(CurDAG->getRoot().Val);\n";
3975 OS << " while (!ISelQueue.empty()) {\n";
3976 OS << " SDNode *Node = ISelQueue.front();\n";
3977 OS << " std::pop_heap(ISelQueue.begin(), ISelQueue.end(), isel_sort());\n";
3978 OS << " ISelQueue.pop_back();\n";
3979 OS << " if (!isSelected(Node->getNodeId())) {\n";
3980 OS << " SDNode *ResNode = Select(SDOperand(Node, 0));\n";
3981 OS << " if (ResNode != Node) {\n";
3982 OS << " if (ResNode)\n";
3983 OS << " ReplaceUses(Node, ResNode);\n";
3984 OS << " if (Node->use_empty()) { // Don't delete EntryToken, etc.\n";
3985 OS << " CurDAG->RemoveDeadNode(Node, ISelKilled);\n";
3986 OS << " RemoveKilled();\n";
3992 OS << " delete[] ISelQueued;\n";
3993 OS << " ISelQueued = NULL;\n";
3994 OS << " delete[] ISelSelected;\n";
3995 OS << " ISelSelected = NULL;\n";
3996 OS << " return Dummy.getValue();\n";
3999 Intrinsics = LoadIntrinsics(Records);
4001 ParseNodeTransforms(OS);
4002 ParseComplexPatterns();
4003 ParsePatternFragments(OS);
4004 ParseDefaultOperands();
4005 ParseInstructions();
4008 // Generate variants. For example, commutative patterns can match
4009 // multiple ways. Add them to PatternsToMatch as well.
4012 DOUT << "\n\nALL PATTERNS TO MATCH:\n\n";
4013 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
4014 DOUT << "PATTERN: "; DEBUG(PatternsToMatch[i].getSrcPattern()->dump());
4015 DOUT << "\nRESULT: "; DEBUG(PatternsToMatch[i].getDstPattern()->dump());
4019 // At this point, we have full information about the 'Patterns' we need to
4020 // parse, both implicitly from instructions as well as from explicit pattern
4021 // definitions. Emit the resultant instruction selector.
4022 EmitInstructionSelector(OS);
4024 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
4025 E = PatternFragments.end(); I != E; ++I)
4027 PatternFragments.clear();
4029 Instructions.clear();