1 //===- DAGISelEmitter.cpp - Generate an instruction selector --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Chris Lattner and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This tablegen backend emits a DAG instruction selector.
12 //===----------------------------------------------------------------------===//
14 #include "DAGISelEmitter.h"
16 #include "llvm/ADT/StringExtras.h"
17 #include "llvm/Support/Debug.h"
22 //===----------------------------------------------------------------------===//
23 // Helpers for working with extended types.
25 /// FilterVTs - Filter a list of VT's according to a predicate.
28 static std::vector<MVT::ValueType>
29 FilterVTs(const std::vector<MVT::ValueType> &InVTs, T Filter) {
30 std::vector<MVT::ValueType> Result;
31 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
33 Result.push_back(InVTs[i]);
38 static std::vector<unsigned char>
39 FilterEVTs(const std::vector<unsigned char> &InVTs, T Filter) {
40 std::vector<unsigned char> Result;
41 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
42 if (Filter((MVT::ValueType)InVTs[i]))
43 Result.push_back(InVTs[i]);
47 static std::vector<unsigned char>
48 ConvertVTs(const std::vector<MVT::ValueType> &InVTs) {
49 std::vector<unsigned char> Result;
50 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
51 Result.push_back(InVTs[i]);
55 static bool LHSIsSubsetOfRHS(const std::vector<unsigned char> &LHS,
56 const std::vector<unsigned char> &RHS) {
57 if (LHS.size() > RHS.size()) return false;
58 for (unsigned i = 0, e = LHS.size(); i != e; ++i)
59 if (std::find(RHS.begin(), RHS.end(), LHS[i]) == RHS.end())
64 /// isExtIntegerVT - Return true if the specified extended value type vector
65 /// contains isInt or an integer value type.
66 static bool isExtIntegerInVTs(std::vector<unsigned char> EVTs) {
67 assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
68 return EVTs[0] == MVT::isInt || !(FilterEVTs(EVTs, MVT::isInteger).empty());
71 /// isExtFloatingPointVT - Return true if the specified extended value type
72 /// vector contains isFP or a FP value type.
73 static bool isExtFloatingPointInVTs(std::vector<unsigned char> EVTs) {
74 assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
75 return EVTs[0] == MVT::isFP || !(FilterEVTs(EVTs, MVT::isFloatingPoint).empty());
78 //===----------------------------------------------------------------------===//
79 // SDTypeConstraint implementation
82 SDTypeConstraint::SDTypeConstraint(Record *R) {
83 OperandNo = R->getValueAsInt("OperandNum");
85 if (R->isSubClassOf("SDTCisVT")) {
86 ConstraintType = SDTCisVT;
87 x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT"));
88 } else if (R->isSubClassOf("SDTCisPtrTy")) {
89 ConstraintType = SDTCisPtrTy;
90 } else if (R->isSubClassOf("SDTCisInt")) {
91 ConstraintType = SDTCisInt;
92 } else if (R->isSubClassOf("SDTCisFP")) {
93 ConstraintType = SDTCisFP;
94 } else if (R->isSubClassOf("SDTCisSameAs")) {
95 ConstraintType = SDTCisSameAs;
96 x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
97 } else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
98 ConstraintType = SDTCisVTSmallerThanOp;
99 x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
100 R->getValueAsInt("OtherOperandNum");
101 } else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) {
102 ConstraintType = SDTCisOpSmallerThanOp;
103 x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
104 R->getValueAsInt("BigOperandNum");
106 std::cerr << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
111 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
112 /// N, which has NumResults results.
113 TreePatternNode *SDTypeConstraint::getOperandNum(unsigned OpNo,
115 unsigned NumResults) const {
116 assert(NumResults <= 1 &&
117 "We only work with nodes with zero or one result so far!");
119 if (OpNo < NumResults)
120 return N; // FIXME: need value #
122 return N->getChild(OpNo-NumResults);
125 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
126 /// constraint to the nodes operands. This returns true if it makes a
127 /// change, false otherwise. If a type contradiction is found, throw an
129 bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
130 const SDNodeInfo &NodeInfo,
131 TreePattern &TP) const {
132 unsigned NumResults = NodeInfo.getNumResults();
133 assert(NumResults <= 1 &&
134 "We only work with nodes with zero or one result so far!");
136 // Check that the number of operands is sane.
137 if (NodeInfo.getNumOperands() >= 0) {
138 if (N->getNumChildren() != (unsigned)NodeInfo.getNumOperands())
139 TP.error(N->getOperator()->getName() + " node requires exactly " +
140 itostr(NodeInfo.getNumOperands()) + " operands!");
143 const CodeGenTarget &CGT = TP.getDAGISelEmitter().getTargetInfo();
145 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NumResults);
147 switch (ConstraintType) {
148 default: assert(0 && "Unknown constraint type!");
150 // Operand must be a particular type.
151 return NodeToApply->UpdateNodeType(x.SDTCisVT_Info.VT, TP);
153 // Operand must be same as target pointer type.
154 return NodeToApply->UpdateNodeType(CGT.getPointerType(), TP);
157 // If there is only one integer type supported, this must be it.
158 std::vector<MVT::ValueType> IntVTs =
159 FilterVTs(CGT.getLegalValueTypes(), MVT::isInteger);
161 // If we found exactly one supported integer type, apply it.
162 if (IntVTs.size() == 1)
163 return NodeToApply->UpdateNodeType(IntVTs[0], TP);
164 return NodeToApply->UpdateNodeType(MVT::isInt, TP);
167 // If there is only one FP type supported, this must be it.
168 std::vector<MVT::ValueType> FPVTs =
169 FilterVTs(CGT.getLegalValueTypes(), MVT::isFloatingPoint);
171 // If we found exactly one supported FP type, apply it.
172 if (FPVTs.size() == 1)
173 return NodeToApply->UpdateNodeType(FPVTs[0], TP);
174 return NodeToApply->UpdateNodeType(MVT::isFP, TP);
177 TreePatternNode *OtherNode =
178 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NumResults);
179 return NodeToApply->UpdateNodeType(OtherNode->getExtTypes(), TP) |
180 OtherNode->UpdateNodeType(NodeToApply->getExtTypes(), TP);
182 case SDTCisVTSmallerThanOp: {
183 // The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
184 // have an integer type that is smaller than the VT.
185 if (!NodeToApply->isLeaf() ||
186 !dynamic_cast<DefInit*>(NodeToApply->getLeafValue()) ||
187 !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
188 ->isSubClassOf("ValueType"))
189 TP.error(N->getOperator()->getName() + " expects a VT operand!");
191 getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef());
192 if (!MVT::isInteger(VT))
193 TP.error(N->getOperator()->getName() + " VT operand must be integer!");
195 TreePatternNode *OtherNode =
196 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N,NumResults);
198 // It must be integer.
199 bool MadeChange = false;
200 MadeChange |= OtherNode->UpdateNodeType(MVT::isInt, TP);
202 // This code only handles nodes that have one type set. Assert here so
203 // that we can change this if we ever need to deal with multiple value
204 // types at this point.
205 assert(OtherNode->getExtTypes().size() == 1 && "Node has too many types!");
206 if (OtherNode->hasTypeSet() && OtherNode->getTypeNum(0) <= VT)
207 OtherNode->UpdateNodeType(MVT::Other, TP); // Throw an error.
210 case SDTCisOpSmallerThanOp: {
211 TreePatternNode *BigOperand =
212 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NumResults);
214 // Both operands must be integer or FP, but we don't care which.
215 bool MadeChange = false;
217 // This code does not currently handle nodes which have multiple types,
218 // where some types are integer, and some are fp. Assert that this is not
220 assert(!(isExtIntegerInVTs(NodeToApply->getExtTypes()) &&
221 isExtFloatingPointInVTs(NodeToApply->getExtTypes())) &&
222 !(isExtIntegerInVTs(BigOperand->getExtTypes()) &&
223 isExtFloatingPointInVTs(BigOperand->getExtTypes())) &&
224 "SDTCisOpSmallerThanOp does not handle mixed int/fp types!");
225 if (isExtIntegerInVTs(NodeToApply->getExtTypes()))
226 MadeChange |= BigOperand->UpdateNodeType(MVT::isInt, TP);
227 else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes()))
228 MadeChange |= BigOperand->UpdateNodeType(MVT::isFP, TP);
229 if (isExtIntegerInVTs(BigOperand->getExtTypes()))
230 MadeChange |= NodeToApply->UpdateNodeType(MVT::isInt, TP);
231 else if (isExtFloatingPointInVTs(BigOperand->getExtTypes()))
232 MadeChange |= NodeToApply->UpdateNodeType(MVT::isFP, TP);
234 std::vector<MVT::ValueType> VTs = CGT.getLegalValueTypes();
236 if (isExtIntegerInVTs(NodeToApply->getExtTypes())) {
237 VTs = FilterVTs(VTs, MVT::isInteger);
238 } else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes())) {
239 VTs = FilterVTs(VTs, MVT::isFloatingPoint);
244 switch (VTs.size()) {
245 default: // Too many VT's to pick from.
246 case 0: break; // No info yet.
248 // Only one VT of this flavor. Cannot ever satisify the constraints.
249 return NodeToApply->UpdateNodeType(MVT::Other, TP); // throw
251 // If we have exactly two possible types, the little operand must be the
252 // small one, the big operand should be the big one. Common with
253 // float/double for example.
254 assert(VTs[0] < VTs[1] && "Should be sorted!");
255 MadeChange |= NodeToApply->UpdateNodeType(VTs[0], TP);
256 MadeChange |= BigOperand->UpdateNodeType(VTs[1], TP);
266 //===----------------------------------------------------------------------===//
267 // SDNodeInfo implementation
269 SDNodeInfo::SDNodeInfo(Record *R) : Def(R) {
270 EnumName = R->getValueAsString("Opcode");
271 SDClassName = R->getValueAsString("SDClass");
272 Record *TypeProfile = R->getValueAsDef("TypeProfile");
273 NumResults = TypeProfile->getValueAsInt("NumResults");
274 NumOperands = TypeProfile->getValueAsInt("NumOperands");
276 // Parse the properties.
278 std::vector<Record*> PropList = R->getValueAsListOfDefs("Properties");
279 for (unsigned i = 0, e = PropList.size(); i != e; ++i) {
280 if (PropList[i]->getName() == "SDNPCommutative") {
281 Properties |= 1 << SDNPCommutative;
282 } else if (PropList[i]->getName() == "SDNPAssociative") {
283 Properties |= 1 << SDNPAssociative;
284 } else if (PropList[i]->getName() == "SDNPHasChain") {
285 Properties |= 1 << SDNPHasChain;
286 } else if (PropList[i]->getName() == "SDNPOutFlag") {
287 Properties |= 1 << SDNPOutFlag;
288 } else if (PropList[i]->getName() == "SDNPInFlag") {
289 Properties |= 1 << SDNPInFlag;
290 } else if (PropList[i]->getName() == "SDNPOptInFlag") {
291 Properties |= 1 << SDNPOptInFlag;
293 std::cerr << "Unknown SD Node property '" << PropList[i]->getName()
294 << "' on node '" << R->getName() << "'!\n";
300 // Parse the type constraints.
301 std::vector<Record*> ConstraintList =
302 TypeProfile->getValueAsListOfDefs("Constraints");
303 TypeConstraints.assign(ConstraintList.begin(), ConstraintList.end());
306 //===----------------------------------------------------------------------===//
307 // TreePatternNode implementation
310 TreePatternNode::~TreePatternNode() {
311 #if 0 // FIXME: implement refcounted tree nodes!
312 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
317 /// UpdateNodeType - Set the node type of N to VT if VT contains
318 /// information. If N already contains a conflicting type, then throw an
319 /// exception. This returns true if any information was updated.
321 bool TreePatternNode::UpdateNodeType(const std::vector<unsigned char> &ExtVTs,
323 assert(!ExtVTs.empty() && "Cannot update node type with empty type vector!");
325 if (ExtVTs[0] == MVT::isUnknown || LHSIsSubsetOfRHS(getExtTypes(), ExtVTs))
327 if (isTypeCompletelyUnknown() || LHSIsSubsetOfRHS(ExtVTs, getExtTypes())) {
332 if (ExtVTs[0] == MVT::isInt && isExtIntegerInVTs(getExtTypes())) {
333 assert(hasTypeSet() && "should be handled above!");
334 std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), MVT::isInteger);
335 if (getExtTypes() == FVTs)
340 if (ExtVTs[0] == MVT::isFP && isExtFloatingPointInVTs(getExtTypes())) {
341 assert(hasTypeSet() && "should be handled above!");
342 std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), MVT::isFloatingPoint);
343 if (getExtTypes() == FVTs)
349 // If we know this is an int or fp type, and we are told it is a specific one,
352 // Similarly, we should probably set the type here to the intersection of
353 // {isInt|isFP} and ExtVTs
354 if ((getExtTypeNum(0) == MVT::isInt && isExtIntegerInVTs(ExtVTs)) ||
355 (getExtTypeNum(0) == MVT::isFP && isExtFloatingPointInVTs(ExtVTs))) {
363 TP.error("Type inference contradiction found in node!");
365 TP.error("Type inference contradiction found in node " +
366 getOperator()->getName() + "!");
368 return true; // unreachable
372 void TreePatternNode::print(std::ostream &OS) const {
374 OS << *getLeafValue();
376 OS << "(" << getOperator()->getName();
379 // FIXME: At some point we should handle printing all the value types for
380 // nodes that are multiply typed.
381 switch (getExtTypeNum(0)) {
382 case MVT::Other: OS << ":Other"; break;
383 case MVT::isInt: OS << ":isInt"; break;
384 case MVT::isFP : OS << ":isFP"; break;
385 case MVT::isUnknown: ; /*OS << ":?";*/ break;
386 default: OS << ":" << getTypeNum(0); break;
390 if (getNumChildren() != 0) {
392 getChild(0)->print(OS);
393 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
395 getChild(i)->print(OS);
401 if (!PredicateFn.empty())
402 OS << "<<P:" << PredicateFn << ">>";
404 OS << "<<X:" << TransformFn->getName() << ">>";
405 if (!getName().empty())
406 OS << ":$" << getName();
409 void TreePatternNode::dump() const {
413 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
414 /// the specified node. For this comparison, all of the state of the node
415 /// is considered, except for the assigned name. Nodes with differing names
416 /// that are otherwise identical are considered isomorphic.
417 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N) const {
418 if (N == this) return true;
419 if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
420 getPredicateFn() != N->getPredicateFn() ||
421 getTransformFn() != N->getTransformFn())
425 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue()))
426 if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue()))
427 return DI->getDef() == NDI->getDef();
428 return getLeafValue() == N->getLeafValue();
431 if (N->getOperator() != getOperator() ||
432 N->getNumChildren() != getNumChildren()) return false;
433 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
434 if (!getChild(i)->isIsomorphicTo(N->getChild(i)))
439 /// clone - Make a copy of this tree and all of its children.
441 TreePatternNode *TreePatternNode::clone() const {
442 TreePatternNode *New;
444 New = new TreePatternNode(getLeafValue());
446 std::vector<TreePatternNode*> CChildren;
447 CChildren.reserve(Children.size());
448 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
449 CChildren.push_back(getChild(i)->clone());
450 New = new TreePatternNode(getOperator(), CChildren);
452 New->setName(getName());
453 New->setTypes(getExtTypes());
454 New->setPredicateFn(getPredicateFn());
455 New->setTransformFn(getTransformFn());
459 /// SubstituteFormalArguments - Replace the formal arguments in this tree
460 /// with actual values specified by ArgMap.
461 void TreePatternNode::
462 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
463 if (isLeaf()) return;
465 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
466 TreePatternNode *Child = getChild(i);
467 if (Child->isLeaf()) {
468 Init *Val = Child->getLeafValue();
469 if (dynamic_cast<DefInit*>(Val) &&
470 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
471 // We found a use of a formal argument, replace it with its value.
472 Child = ArgMap[Child->getName()];
473 assert(Child && "Couldn't find formal argument!");
477 getChild(i)->SubstituteFormalArguments(ArgMap);
483 /// InlinePatternFragments - If this pattern refers to any pattern
484 /// fragments, inline them into place, giving us a pattern without any
485 /// PatFrag references.
486 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
487 if (isLeaf()) return this; // nothing to do.
488 Record *Op = getOperator();
490 if (!Op->isSubClassOf("PatFrag")) {
491 // Just recursively inline children nodes.
492 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
493 setChild(i, getChild(i)->InlinePatternFragments(TP));
497 // Otherwise, we found a reference to a fragment. First, look up its
498 // TreePattern record.
499 TreePattern *Frag = TP.getDAGISelEmitter().getPatternFragment(Op);
501 // Verify that we are passing the right number of operands.
502 if (Frag->getNumArgs() != Children.size())
503 TP.error("'" + Op->getName() + "' fragment requires " +
504 utostr(Frag->getNumArgs()) + " operands!");
506 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
508 // Resolve formal arguments to their actual value.
509 if (Frag->getNumArgs()) {
510 // Compute the map of formal to actual arguments.
511 std::map<std::string, TreePatternNode*> ArgMap;
512 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
513 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
515 FragTree->SubstituteFormalArguments(ArgMap);
518 FragTree->setName(getName());
519 FragTree->UpdateNodeType(getExtTypes(), TP);
521 // Get a new copy of this fragment to stitch into here.
522 //delete this; // FIXME: implement refcounting!
526 /// getIntrinsicType - Check to see if the specified record has an intrinsic
527 /// type which should be applied to it. This infer the type of register
528 /// references from the register file information, for example.
530 static std::vector<unsigned char> getIntrinsicType(Record *R, bool NotRegisters,
532 // Some common return values
533 std::vector<unsigned char> Unknown(1, MVT::isUnknown);
534 std::vector<unsigned char> Other(1, MVT::Other);
536 // Check to see if this is a register or a register class...
537 if (R->isSubClassOf("RegisterClass")) {
540 const CodeGenRegisterClass &RC =
541 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(R);
542 return ConvertVTs(RC.getValueTypes());
543 } else if (R->isSubClassOf("PatFrag")) {
544 // Pattern fragment types will be resolved when they are inlined.
546 } else if (R->isSubClassOf("Register")) {
549 // If the register appears in exactly one regclass, and the regclass has one
550 // value type, use it as the known type.
551 const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
552 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
553 return ConvertVTs(RC->getValueTypes());
555 } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
556 // Using a VTSDNode or CondCodeSDNode.
558 } else if (R->isSubClassOf("ComplexPattern")) {
561 std::vector<unsigned char>
562 ComplexPat(1, TP.getDAGISelEmitter().getComplexPattern(R).getValueType());
564 } else if (R->getName() == "node" || R->getName() == "srcvalue") {
569 TP.error("Unknown node flavor used in pattern: " + R->getName());
573 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
574 /// this node and its children in the tree. This returns true if it makes a
575 /// change, false otherwise. If a type contradiction is found, throw an
577 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
579 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
580 // If it's a regclass or something else known, include the type.
581 return UpdateNodeType(getIntrinsicType(DI->getDef(), NotRegisters, TP),
583 } else if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
584 // Int inits are always integers. :)
585 bool MadeChange = UpdateNodeType(MVT::isInt, TP);
588 // At some point, it may make sense for this tree pattern to have
589 // multiple types. Assert here that it does not, so we revisit this
590 // code when appropriate.
591 assert(getExtTypes().size() == 1 && "TreePattern has too many types!");
593 unsigned Size = MVT::getSizeInBits(getTypeNum(0));
594 // Make sure that the value is representable for this type.
596 int Val = (II->getValue() << (32-Size)) >> (32-Size);
597 if (Val != II->getValue())
598 TP.error("Sign-extended integer value '" + itostr(II->getValue()) +
599 "' is out of range for type 'MVT::" +
600 getEnumName(getTypeNum(0)) + "'!");
609 // special handling for set, which isn't really an SDNode.
610 if (getOperator()->getName() == "set") {
611 assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!");
612 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
613 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
615 // Types of operands must match.
616 MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtTypes(), TP);
617 MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtTypes(), TP);
618 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
620 } else if (getOperator()->isSubClassOf("SDNode")) {
621 const SDNodeInfo &NI = TP.getDAGISelEmitter().getSDNodeInfo(getOperator());
623 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
624 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
625 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
626 // Branch, etc. do not produce results and top-level forms in instr pattern
627 // must have void types.
628 if (NI.getNumResults() == 0)
629 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
631 } else if (getOperator()->isSubClassOf("Instruction")) {
632 const DAGInstruction &Inst =
633 TP.getDAGISelEmitter().getInstruction(getOperator());
634 bool MadeChange = false;
635 unsigned NumResults = Inst.getNumResults();
637 assert(NumResults <= 1 &&
638 "Only supports zero or one result instrs!");
639 // Apply the result type to the node
640 if (NumResults == 0) {
641 MadeChange = UpdateNodeType(MVT::isVoid, TP);
643 Record *ResultNode = Inst.getResult(0);
644 assert(ResultNode->isSubClassOf("RegisterClass") &&
645 "Operands should be register classes!");
647 const CodeGenRegisterClass &RC =
648 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(ResultNode);
649 MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
652 if (getNumChildren() != Inst.getNumOperands())
653 TP.error("Instruction '" + getOperator()->getName() + " expects " +
654 utostr(Inst.getNumOperands()) + " operands, not " +
655 utostr(getNumChildren()) + " operands!");
656 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
657 Record *OperandNode = Inst.getOperand(i);
659 if (OperandNode->isSubClassOf("RegisterClass")) {
660 const CodeGenRegisterClass &RC =
661 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(OperandNode);
662 //VT = RC.getValueTypeNum(0);
663 MadeChange |=getChild(i)->UpdateNodeType(ConvertVTs(RC.getValueTypes()),
665 } else if (OperandNode->isSubClassOf("Operand")) {
666 VT = getValueType(OperandNode->getValueAsDef("Type"));
667 MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
669 assert(0 && "Unknown operand type!");
672 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
676 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
678 // Node transforms always take one operand, and take and return the same
680 if (getNumChildren() != 1)
681 TP.error("Node transform '" + getOperator()->getName() +
682 "' requires one operand!");
683 bool MadeChange = UpdateNodeType(getChild(0)->getExtTypes(), TP);
684 MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), TP);
689 /// canPatternMatch - If it is impossible for this pattern to match on this
690 /// target, fill in Reason and return false. Otherwise, return true. This is
691 /// used as a santity check for .td files (to prevent people from writing stuff
692 /// that can never possibly work), and to prevent the pattern permuter from
693 /// generating stuff that is useless.
694 bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){
695 if (isLeaf()) return true;
697 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
698 if (!getChild(i)->canPatternMatch(Reason, ISE))
701 // If this node is a commutative operator, check that the LHS isn't an
703 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
704 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
705 // Scan all of the operands of the node and make sure that only the last one
706 // is a constant node.
707 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i)
708 if (!getChild(i)->isLeaf() &&
709 getChild(i)->getOperator()->getName() == "imm") {
710 Reason = "Immediate value must be on the RHS of commutative operators!";
718 //===----------------------------------------------------------------------===//
719 // TreePattern implementation
722 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
723 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
724 isInputPattern = isInput;
725 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
726 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
729 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
730 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
731 isInputPattern = isInput;
732 Trees.push_back(ParseTreePattern(Pat));
735 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
736 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
737 isInputPattern = isInput;
738 Trees.push_back(Pat);
743 void TreePattern::error(const std::string &Msg) const {
745 throw "In " + TheRecord->getName() + ": " + Msg;
748 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
749 Record *Operator = Dag->getNodeType();
751 if (Operator->isSubClassOf("ValueType")) {
752 // If the operator is a ValueType, then this must be "type cast" of a leaf
754 if (Dag->getNumArgs() != 1)
755 error("Type cast only takes one operand!");
757 Init *Arg = Dag->getArg(0);
758 TreePatternNode *New;
759 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
760 Record *R = DI->getDef();
761 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
762 Dag->setArg(0, new DagInit(R,
763 std::vector<std::pair<Init*, std::string> >()));
764 return ParseTreePattern(Dag);
766 New = new TreePatternNode(DI);
767 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
768 New = ParseTreePattern(DI);
769 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
770 New = new TreePatternNode(II);
771 if (!Dag->getArgName(0).empty())
772 error("Constant int argument should not have a name!");
775 error("Unknown leaf value for tree pattern!");
779 // Apply the type cast.
780 New->UpdateNodeType(getValueType(Operator), *this);
781 New->setName(Dag->getArgName(0));
785 // Verify that this is something that makes sense for an operator.
786 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
787 !Operator->isSubClassOf("Instruction") &&
788 !Operator->isSubClassOf("SDNodeXForm") &&
789 Operator->getName() != "set")
790 error("Unrecognized node '" + Operator->getName() + "'!");
792 // Check to see if this is something that is illegal in an input pattern.
793 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
794 Operator->isSubClassOf("SDNodeXForm")))
795 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
797 std::vector<TreePatternNode*> Children;
799 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
800 Init *Arg = Dag->getArg(i);
801 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
802 Children.push_back(ParseTreePattern(DI));
803 if (Children.back()->getName().empty())
804 Children.back()->setName(Dag->getArgName(i));
805 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
806 Record *R = DefI->getDef();
807 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
808 // TreePatternNode if its own.
809 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
810 Dag->setArg(i, new DagInit(R,
811 std::vector<std::pair<Init*, std::string> >()));
812 --i; // Revisit this node...
814 TreePatternNode *Node = new TreePatternNode(DefI);
815 Node->setName(Dag->getArgName(i));
816 Children.push_back(Node);
819 if (R->getName() == "node") {
820 if (Dag->getArgName(i).empty())
821 error("'node' argument requires a name to match with operand list");
822 Args.push_back(Dag->getArgName(i));
825 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
826 TreePatternNode *Node = new TreePatternNode(II);
827 if (!Dag->getArgName(i).empty())
828 error("Constant int argument should not have a name!");
829 Children.push_back(Node);
834 error("Unknown leaf value for tree pattern!");
838 return new TreePatternNode(Operator, Children);
841 /// InferAllTypes - Infer/propagate as many types throughout the expression
842 /// patterns as possible. Return true if all types are infered, false
843 /// otherwise. Throw an exception if a type contradiction is found.
844 bool TreePattern::InferAllTypes() {
845 bool MadeChange = true;
848 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
849 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
852 bool HasUnresolvedTypes = false;
853 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
854 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
855 return !HasUnresolvedTypes;
858 void TreePattern::print(std::ostream &OS) const {
859 OS << getRecord()->getName();
861 OS << "(" << Args[0];
862 for (unsigned i = 1, e = Args.size(); i != e; ++i)
863 OS << ", " << Args[i];
868 if (Trees.size() > 1)
870 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
876 if (Trees.size() > 1)
880 void TreePattern::dump() const { print(std::cerr); }
884 //===----------------------------------------------------------------------===//
885 // DAGISelEmitter implementation
888 // Parse all of the SDNode definitions for the target, populating SDNodes.
889 void DAGISelEmitter::ParseNodeInfo() {
890 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
891 while (!Nodes.empty()) {
892 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
897 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
898 /// map, and emit them to the file as functions.
899 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
900 OS << "\n// Node transformations.\n";
901 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
902 while (!Xforms.empty()) {
903 Record *XFormNode = Xforms.back();
904 Record *SDNode = XFormNode->getValueAsDef("Opcode");
905 std::string Code = XFormNode->getValueAsCode("XFormFunction");
906 SDNodeXForms.insert(std::make_pair(XFormNode,
907 std::make_pair(SDNode, Code)));
910 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
911 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
913 OS << "inline SDOperand Transform_" << XFormNode->getName()
914 << "(SDNode *" << C2 << ") {\n";
915 if (ClassName != "SDNode")
916 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
917 OS << Code << "\n}\n";
924 void DAGISelEmitter::ParseComplexPatterns() {
925 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
926 while (!AMs.empty()) {
927 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
933 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
934 /// file, building up the PatternFragments map. After we've collected them all,
935 /// inline fragments together as necessary, so that there are no references left
936 /// inside a pattern fragment to a pattern fragment.
938 /// This also emits all of the predicate functions to the output file.
940 void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) {
941 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
943 // First step, parse all of the fragments and emit predicate functions.
944 OS << "\n// Predicate functions.\n";
945 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
946 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
947 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
948 PatternFragments[Fragments[i]] = P;
950 // Validate the argument list, converting it to map, to discard duplicates.
951 std::vector<std::string> &Args = P->getArgList();
952 std::set<std::string> OperandsMap(Args.begin(), Args.end());
954 if (OperandsMap.count(""))
955 P->error("Cannot have unnamed 'node' values in pattern fragment!");
957 // Parse the operands list.
958 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
959 if (OpsList->getNodeType()->getName() != "ops")
960 P->error("Operands list should start with '(ops ... '!");
962 // Copy over the arguments.
964 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
965 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
966 static_cast<DefInit*>(OpsList->getArg(j))->
967 getDef()->getName() != "node")
968 P->error("Operands list should all be 'node' values.");
969 if (OpsList->getArgName(j).empty())
970 P->error("Operands list should have names for each operand!");
971 if (!OperandsMap.count(OpsList->getArgName(j)))
972 P->error("'" + OpsList->getArgName(j) +
973 "' does not occur in pattern or was multiply specified!");
974 OperandsMap.erase(OpsList->getArgName(j));
975 Args.push_back(OpsList->getArgName(j));
978 if (!OperandsMap.empty())
979 P->error("Operands list does not contain an entry for operand '" +
980 *OperandsMap.begin() + "'!");
982 // If there is a code init for this fragment, emit the predicate code and
983 // keep track of the fact that this fragment uses it.
984 std::string Code = Fragments[i]->getValueAsCode("Predicate");
986 assert(!P->getOnlyTree()->isLeaf() && "Can't be a leaf!");
987 std::string ClassName =
988 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
989 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
991 OS << "inline bool Predicate_" << Fragments[i]->getName()
992 << "(SDNode *" << C2 << ") {\n";
993 if (ClassName != "SDNode")
994 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
995 OS << Code << "\n}\n";
996 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
999 // If there is a node transformation corresponding to this, keep track of
1001 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
1002 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
1003 P->getOnlyTree()->setTransformFn(Transform);
1008 // Now that we've parsed all of the tree fragments, do a closure on them so
1009 // that there are not references to PatFrags left inside of them.
1010 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
1011 E = PatternFragments.end(); I != E; ++I) {
1012 TreePattern *ThePat = I->second;
1013 ThePat->InlinePatternFragments();
1015 // Infer as many types as possible. Don't worry about it if we don't infer
1016 // all of them, some may depend on the inputs of the pattern.
1018 ThePat->InferAllTypes();
1020 // If this pattern fragment is not supported by this target (no types can
1021 // satisfy its constraints), just ignore it. If the bogus pattern is
1022 // actually used by instructions, the type consistency error will be
1026 // If debugging, print out the pattern fragment result.
1027 DEBUG(ThePat->dump());
1031 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1032 /// instruction input. Return true if this is a real use.
1033 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1034 std::map<std::string, TreePatternNode*> &InstInputs,
1035 std::vector<Record*> &InstImpInputs) {
1036 // No name -> not interesting.
1037 if (Pat->getName().empty()) {
1038 if (Pat->isLeaf()) {
1039 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1040 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1041 I->error("Input " + DI->getDef()->getName() + " must be named!");
1042 else if (DI && DI->getDef()->isSubClassOf("Register"))
1043 InstImpInputs.push_back(DI->getDef());
1049 if (Pat->isLeaf()) {
1050 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1051 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1054 assert(Pat->getNumChildren() == 0 && "can't be a use with children!");
1055 Rec = Pat->getOperator();
1058 // SRCVALUE nodes are ignored.
1059 if (Rec->getName() == "srcvalue")
1062 TreePatternNode *&Slot = InstInputs[Pat->getName()];
1067 if (Slot->isLeaf()) {
1068 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1070 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1071 SlotRec = Slot->getOperator();
1074 // Ensure that the inputs agree if we've already seen this input.
1076 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1077 if (Slot->getExtTypes() != Pat->getExtTypes())
1078 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1083 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1084 /// part of "I", the instruction), computing the set of inputs and outputs of
1085 /// the pattern. Report errors if we see anything naughty.
1086 void DAGISelEmitter::
1087 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1088 std::map<std::string, TreePatternNode*> &InstInputs,
1089 std::map<std::string, Record*> &InstResults,
1090 std::vector<Record*> &InstImpInputs,
1091 std::vector<Record*> &InstImpResults) {
1092 if (Pat->isLeaf()) {
1093 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1094 if (!isUse && Pat->getTransformFn())
1095 I->error("Cannot specify a transform function for a non-input value!");
1097 } else if (Pat->getOperator()->getName() != "set") {
1098 // If this is not a set, verify that the children nodes are not void typed,
1100 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1101 if (Pat->getChild(i)->getExtTypeNum(0) == MVT::isVoid)
1102 I->error("Cannot have void nodes inside of patterns!");
1103 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
1104 InstImpInputs, InstImpResults);
1107 // If this is a non-leaf node with no children, treat it basically as if
1108 // it were a leaf. This handles nodes like (imm).
1110 if (Pat->getNumChildren() == 0)
1111 isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1113 if (!isUse && Pat->getTransformFn())
1114 I->error("Cannot specify a transform function for a non-input value!");
1118 // Otherwise, this is a set, validate and collect instruction results.
1119 if (Pat->getNumChildren() == 0)
1120 I->error("set requires operands!");
1121 else if (Pat->getNumChildren() & 1)
1122 I->error("set requires an even number of operands");
1124 if (Pat->getTransformFn())
1125 I->error("Cannot specify a transform function on a set node!");
1127 // Check the set destinations.
1128 unsigned NumValues = Pat->getNumChildren()/2;
1129 for (unsigned i = 0; i != NumValues; ++i) {
1130 TreePatternNode *Dest = Pat->getChild(i);
1131 if (!Dest->isLeaf())
1132 I->error("set destination should be a register!");
1134 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1136 I->error("set destination should be a register!");
1138 if (Val->getDef()->isSubClassOf("RegisterClass")) {
1139 if (Dest->getName().empty())
1140 I->error("set destination must have a name!");
1141 if (InstResults.count(Dest->getName()))
1142 I->error("cannot set '" + Dest->getName() +"' multiple times");
1143 InstResults[Dest->getName()] = Val->getDef();
1144 } else if (Val->getDef()->isSubClassOf("Register")) {
1145 InstImpResults.push_back(Val->getDef());
1147 I->error("set destination should be a register!");
1150 // Verify and collect info from the computation.
1151 FindPatternInputsAndOutputs(I, Pat->getChild(i+NumValues),
1152 InstInputs, InstResults,
1153 InstImpInputs, InstImpResults);
1157 /// ParseInstructions - Parse all of the instructions, inlining and resolving
1158 /// any fragments involved. This populates the Instructions list with fully
1159 /// resolved instructions.
1160 void DAGISelEmitter::ParseInstructions() {
1161 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1163 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1166 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1167 LI = Instrs[i]->getValueAsListInit("Pattern");
1169 // If there is no pattern, only collect minimal information about the
1170 // instruction for its operand list. We have to assume that there is one
1171 // result, as we have no detailed info.
1172 if (!LI || LI->getSize() == 0) {
1173 std::vector<Record*> Results;
1174 std::vector<Record*> Operands;
1176 CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1178 if (InstInfo.OperandList.size() != 0) {
1179 // FIXME: temporary hack...
1180 if (InstInfo.noResults) {
1181 // These produce no results
1182 for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
1183 Operands.push_back(InstInfo.OperandList[j].Rec);
1185 // Assume the first operand is the result.
1186 Results.push_back(InstInfo.OperandList[0].Rec);
1188 // The rest are inputs.
1189 for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
1190 Operands.push_back(InstInfo.OperandList[j].Rec);
1194 // Create and insert the instruction.
1195 std::vector<Record*> ImpResults;
1196 std::vector<Record*> ImpOperands;
1197 Instructions.insert(std::make_pair(Instrs[i],
1198 DAGInstruction(0, Results, Operands, ImpResults,
1200 continue; // no pattern.
1203 // Parse the instruction.
1204 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1205 // Inline pattern fragments into it.
1206 I->InlinePatternFragments();
1208 // Infer as many types as possible. If we cannot infer all of them, we can
1209 // never do anything with this instruction pattern: report it to the user.
1210 if (!I->InferAllTypes())
1211 I->error("Could not infer all types in pattern!");
1213 // InstInputs - Keep track of all of the inputs of the instruction, along
1214 // with the record they are declared as.
1215 std::map<std::string, TreePatternNode*> InstInputs;
1217 // InstResults - Keep track of all the virtual registers that are 'set'
1218 // in the instruction, including what reg class they are.
1219 std::map<std::string, Record*> InstResults;
1221 std::vector<Record*> InstImpInputs;
1222 std::vector<Record*> InstImpResults;
1224 // Verify that the top-level forms in the instruction are of void type, and
1225 // fill in the InstResults map.
1226 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1227 TreePatternNode *Pat = I->getTree(j);
1228 if (Pat->getExtTypeNum(0) != MVT::isVoid)
1229 I->error("Top-level forms in instruction pattern should have"
1232 // Find inputs and outputs, and verify the structure of the uses/defs.
1233 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
1234 InstImpInputs, InstImpResults);
1237 // Now that we have inputs and outputs of the pattern, inspect the operands
1238 // list for the instruction. This determines the order that operands are
1239 // added to the machine instruction the node corresponds to.
1240 unsigned NumResults = InstResults.size();
1242 // Parse the operands list from the (ops) list, validating it.
1243 std::vector<std::string> &Args = I->getArgList();
1244 assert(Args.empty() && "Args list should still be empty here!");
1245 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1247 // Check that all of the results occur first in the list.
1248 std::vector<Record*> Results;
1249 for (unsigned i = 0; i != NumResults; ++i) {
1250 if (i == CGI.OperandList.size())
1251 I->error("'" + InstResults.begin()->first +
1252 "' set but does not appear in operand list!");
1253 const std::string &OpName = CGI.OperandList[i].Name;
1255 // Check that it exists in InstResults.
1256 Record *R = InstResults[OpName];
1258 I->error("Operand $" + OpName + " should be a set destination: all "
1259 "outputs must occur before inputs in operand list!");
1261 if (CGI.OperandList[i].Rec != R)
1262 I->error("Operand $" + OpName + " class mismatch!");
1264 // Remember the return type.
1265 Results.push_back(CGI.OperandList[i].Rec);
1267 // Okay, this one checks out.
1268 InstResults.erase(OpName);
1271 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
1272 // the copy while we're checking the inputs.
1273 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
1275 std::vector<TreePatternNode*> ResultNodeOperands;
1276 std::vector<Record*> Operands;
1277 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
1278 const std::string &OpName = CGI.OperandList[i].Name;
1280 I->error("Operand #" + utostr(i) + " in operands list has no name!");
1282 if (!InstInputsCheck.count(OpName))
1283 I->error("Operand $" + OpName +
1284 " does not appear in the instruction pattern");
1285 TreePatternNode *InVal = InstInputsCheck[OpName];
1286 InstInputsCheck.erase(OpName); // It occurred, remove from map.
1288 if (InVal->isLeaf() &&
1289 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
1290 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
1291 if (CGI.OperandList[i].Rec != InRec &&
1292 !InRec->isSubClassOf("ComplexPattern"))
1293 I->error("Operand $" + OpName +
1294 "'s register class disagrees between the operand and pattern");
1296 Operands.push_back(CGI.OperandList[i].Rec);
1298 // Construct the result for the dest-pattern operand list.
1299 TreePatternNode *OpNode = InVal->clone();
1301 // No predicate is useful on the result.
1302 OpNode->setPredicateFn("");
1304 // Promote the xform function to be an explicit node if set.
1305 if (Record *Xform = OpNode->getTransformFn()) {
1306 OpNode->setTransformFn(0);
1307 std::vector<TreePatternNode*> Children;
1308 Children.push_back(OpNode);
1309 OpNode = new TreePatternNode(Xform, Children);
1312 ResultNodeOperands.push_back(OpNode);
1315 if (!InstInputsCheck.empty())
1316 I->error("Input operand $" + InstInputsCheck.begin()->first +
1317 " occurs in pattern but not in operands list!");
1319 TreePatternNode *ResultPattern =
1320 new TreePatternNode(I->getRecord(), ResultNodeOperands);
1322 // Create and insert the instruction.
1323 DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
1324 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
1326 // Use a temporary tree pattern to infer all types and make sure that the
1327 // constructed result is correct. This depends on the instruction already
1328 // being inserted into the Instructions map.
1329 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
1330 Temp.InferAllTypes();
1332 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
1333 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
1338 // If we can, convert the instructions to be patterns that are matched!
1339 for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
1340 E = Instructions.end(); II != E; ++II) {
1341 DAGInstruction &TheInst = II->second;
1342 TreePattern *I = TheInst.getPattern();
1343 if (I == 0) continue; // No pattern.
1345 if (I->getNumTrees() != 1) {
1346 std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
1349 TreePatternNode *Pattern = I->getTree(0);
1350 TreePatternNode *SrcPattern;
1351 if (Pattern->getOperator()->getName() == "set") {
1352 if (Pattern->getNumChildren() != 2)
1353 continue; // Not a set of a single value (not handled so far)
1355 SrcPattern = Pattern->getChild(1)->clone();
1357 // Not a set (store or something?)
1358 SrcPattern = Pattern;
1362 if (!SrcPattern->canPatternMatch(Reason, *this))
1363 I->error("Instruction can never match: " + Reason);
1365 Record *Instr = II->first;
1366 TreePatternNode *DstPattern = TheInst.getResultPattern();
1368 push_back(PatternToMatch(Instr->getValueAsListInit("Predicates"),
1369 SrcPattern, DstPattern));
1373 void DAGISelEmitter::ParsePatterns() {
1374 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
1376 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1377 DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
1378 TreePattern *Pattern = new TreePattern(Patterns[i], Tree, true, *this);
1380 // Inline pattern fragments into it.
1381 Pattern->InlinePatternFragments();
1383 // Infer as many types as possible. If we cannot infer all of them, we can
1384 // never do anything with this pattern: report it to the user.
1385 if (!Pattern->InferAllTypes())
1386 Pattern->error("Could not infer all types in pattern!");
1388 // Validate that the input pattern is correct.
1390 std::map<std::string, TreePatternNode*> InstInputs;
1391 std::map<std::string, Record*> InstResults;
1392 std::vector<Record*> InstImpInputs;
1393 std::vector<Record*> InstImpResults;
1394 FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(),
1395 InstInputs, InstResults,
1396 InstImpInputs, InstImpResults);
1399 ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
1400 if (LI->getSize() == 0) continue; // no pattern.
1402 // Parse the instruction.
1403 TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
1405 // Inline pattern fragments into it.
1406 Result->InlinePatternFragments();
1408 // Infer as many types as possible. If we cannot infer all of them, we can
1409 // never do anything with this pattern: report it to the user.
1410 if (!Result->InferAllTypes())
1411 Result->error("Could not infer all types in pattern result!");
1413 if (Result->getNumTrees() != 1)
1414 Result->error("Cannot handle instructions producing instructions "
1415 "with temporaries yet!");
1418 if (!Pattern->getOnlyTree()->canPatternMatch(Reason, *this))
1419 Pattern->error("Pattern can never match: " + Reason);
1422 push_back(PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"),
1423 Pattern->getOnlyTree(),
1424 Result->getOnlyTree()));
1428 /// CombineChildVariants - Given a bunch of permutations of each child of the
1429 /// 'operator' node, put them together in all possible ways.
1430 static void CombineChildVariants(TreePatternNode *Orig,
1431 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
1432 std::vector<TreePatternNode*> &OutVariants,
1433 DAGISelEmitter &ISE) {
1434 // Make sure that each operand has at least one variant to choose from.
1435 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1436 if (ChildVariants[i].empty())
1439 // The end result is an all-pairs construction of the resultant pattern.
1440 std::vector<unsigned> Idxs;
1441 Idxs.resize(ChildVariants.size());
1442 bool NotDone = true;
1444 // Create the variant and add it to the output list.
1445 std::vector<TreePatternNode*> NewChildren;
1446 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1447 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
1448 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
1450 // Copy over properties.
1451 R->setName(Orig->getName());
1452 R->setPredicateFn(Orig->getPredicateFn());
1453 R->setTransformFn(Orig->getTransformFn());
1454 R->setTypes(Orig->getExtTypes());
1456 // If this pattern cannot every match, do not include it as a variant.
1457 std::string ErrString;
1458 if (!R->canPatternMatch(ErrString, ISE)) {
1461 bool AlreadyExists = false;
1463 // Scan to see if this pattern has already been emitted. We can get
1464 // duplication due to things like commuting:
1465 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
1466 // which are the same pattern. Ignore the dups.
1467 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
1468 if (R->isIsomorphicTo(OutVariants[i])) {
1469 AlreadyExists = true;
1476 OutVariants.push_back(R);
1479 // Increment indices to the next permutation.
1481 // Look for something we can increment without causing a wrap-around.
1482 for (unsigned IdxsIdx = 0; IdxsIdx != Idxs.size(); ++IdxsIdx) {
1483 if (++Idxs[IdxsIdx] < ChildVariants[IdxsIdx].size()) {
1484 NotDone = true; // Found something to increment.
1492 /// CombineChildVariants - A helper function for binary operators.
1494 static void CombineChildVariants(TreePatternNode *Orig,
1495 const std::vector<TreePatternNode*> &LHS,
1496 const std::vector<TreePatternNode*> &RHS,
1497 std::vector<TreePatternNode*> &OutVariants,
1498 DAGISelEmitter &ISE) {
1499 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1500 ChildVariants.push_back(LHS);
1501 ChildVariants.push_back(RHS);
1502 CombineChildVariants(Orig, ChildVariants, OutVariants, ISE);
1506 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
1507 std::vector<TreePatternNode *> &Children) {
1508 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
1509 Record *Operator = N->getOperator();
1511 // Only permit raw nodes.
1512 if (!N->getName().empty() || !N->getPredicateFn().empty() ||
1513 N->getTransformFn()) {
1514 Children.push_back(N);
1518 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
1519 Children.push_back(N->getChild(0));
1521 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
1523 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
1524 Children.push_back(N->getChild(1));
1526 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
1529 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
1530 /// the (potentially recursive) pattern by using algebraic laws.
1532 static void GenerateVariantsOf(TreePatternNode *N,
1533 std::vector<TreePatternNode*> &OutVariants,
1534 DAGISelEmitter &ISE) {
1535 // We cannot permute leaves.
1537 OutVariants.push_back(N);
1541 // Look up interesting info about the node.
1542 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1544 // If this node is associative, reassociate.
1545 if (NodeInfo.hasProperty(SDNodeInfo::SDNPAssociative)) {
1546 // Reassociate by pulling together all of the linked operators
1547 std::vector<TreePatternNode*> MaximalChildren;
1548 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
1550 // Only handle child sizes of 3. Otherwise we'll end up trying too many
1552 if (MaximalChildren.size() == 3) {
1553 // Find the variants of all of our maximal children.
1554 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
1555 GenerateVariantsOf(MaximalChildren[0], AVariants, ISE);
1556 GenerateVariantsOf(MaximalChildren[1], BVariants, ISE);
1557 GenerateVariantsOf(MaximalChildren[2], CVariants, ISE);
1559 // There are only two ways we can permute the tree:
1560 // (A op B) op C and A op (B op C)
1561 // Within these forms, we can also permute A/B/C.
1563 // Generate legal pair permutations of A/B/C.
1564 std::vector<TreePatternNode*> ABVariants;
1565 std::vector<TreePatternNode*> BAVariants;
1566 std::vector<TreePatternNode*> ACVariants;
1567 std::vector<TreePatternNode*> CAVariants;
1568 std::vector<TreePatternNode*> BCVariants;
1569 std::vector<TreePatternNode*> CBVariants;
1570 CombineChildVariants(N, AVariants, BVariants, ABVariants, ISE);
1571 CombineChildVariants(N, BVariants, AVariants, BAVariants, ISE);
1572 CombineChildVariants(N, AVariants, CVariants, ACVariants, ISE);
1573 CombineChildVariants(N, CVariants, AVariants, CAVariants, ISE);
1574 CombineChildVariants(N, BVariants, CVariants, BCVariants, ISE);
1575 CombineChildVariants(N, CVariants, BVariants, CBVariants, ISE);
1577 // Combine those into the result: (x op x) op x
1578 CombineChildVariants(N, ABVariants, CVariants, OutVariants, ISE);
1579 CombineChildVariants(N, BAVariants, CVariants, OutVariants, ISE);
1580 CombineChildVariants(N, ACVariants, BVariants, OutVariants, ISE);
1581 CombineChildVariants(N, CAVariants, BVariants, OutVariants, ISE);
1582 CombineChildVariants(N, BCVariants, AVariants, OutVariants, ISE);
1583 CombineChildVariants(N, CBVariants, AVariants, OutVariants, ISE);
1585 // Combine those into the result: x op (x op x)
1586 CombineChildVariants(N, CVariants, ABVariants, OutVariants, ISE);
1587 CombineChildVariants(N, CVariants, BAVariants, OutVariants, ISE);
1588 CombineChildVariants(N, BVariants, ACVariants, OutVariants, ISE);
1589 CombineChildVariants(N, BVariants, CAVariants, OutVariants, ISE);
1590 CombineChildVariants(N, AVariants, BCVariants, OutVariants, ISE);
1591 CombineChildVariants(N, AVariants, CBVariants, OutVariants, ISE);
1596 // Compute permutations of all children.
1597 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1598 ChildVariants.resize(N->getNumChildren());
1599 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1600 GenerateVariantsOf(N->getChild(i), ChildVariants[i], ISE);
1602 // Build all permutations based on how the children were formed.
1603 CombineChildVariants(N, ChildVariants, OutVariants, ISE);
1605 // If this node is commutative, consider the commuted order.
1606 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
1607 assert(N->getNumChildren()==2 &&"Commutative but doesn't have 2 children!");
1608 // Consider the commuted order.
1609 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
1615 // GenerateVariants - Generate variants. For example, commutative patterns can
1616 // match multiple ways. Add them to PatternsToMatch as well.
1617 void DAGISelEmitter::GenerateVariants() {
1619 DEBUG(std::cerr << "Generating instruction variants.\n");
1621 // Loop over all of the patterns we've collected, checking to see if we can
1622 // generate variants of the instruction, through the exploitation of
1623 // identities. This permits the target to provide agressive matching without
1624 // the .td file having to contain tons of variants of instructions.
1626 // Note that this loop adds new patterns to the PatternsToMatch list, but we
1627 // intentionally do not reconsider these. Any variants of added patterns have
1628 // already been added.
1630 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
1631 std::vector<TreePatternNode*> Variants;
1632 GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this);
1634 assert(!Variants.empty() && "Must create at least original variant!");
1635 Variants.erase(Variants.begin()); // Remove the original pattern.
1637 if (Variants.empty()) // No variants for this pattern.
1640 DEBUG(std::cerr << "FOUND VARIANTS OF: ";
1641 PatternsToMatch[i].getSrcPattern()->dump();
1644 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
1645 TreePatternNode *Variant = Variants[v];
1647 DEBUG(std::cerr << " VAR#" << v << ": ";
1651 // Scan to see if an instruction or explicit pattern already matches this.
1652 bool AlreadyExists = false;
1653 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
1654 // Check to see if this variant already exists.
1655 if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern())) {
1656 DEBUG(std::cerr << " *** ALREADY EXISTS, ignoring variant.\n");
1657 AlreadyExists = true;
1661 // If we already have it, ignore the variant.
1662 if (AlreadyExists) continue;
1664 // Otherwise, add it to the list of patterns we have.
1666 push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
1667 Variant, PatternsToMatch[i].getDstPattern()));
1670 DEBUG(std::cerr << "\n");
1675 // NodeIsComplexPattern - return true if N is a leaf node and a subclass of
1677 static bool NodeIsComplexPattern(TreePatternNode *N)
1679 return (N->isLeaf() &&
1680 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1681 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1682 isSubClassOf("ComplexPattern"));
1685 // NodeGetComplexPattern - return the pointer to the ComplexPattern if N
1686 // is a leaf node and a subclass of ComplexPattern, else it returns NULL.
1687 static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
1688 DAGISelEmitter &ISE)
1691 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1692 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1693 isSubClassOf("ComplexPattern")) {
1694 return &ISE.getComplexPattern(static_cast<DefInit*>(N->getLeafValue())
1700 /// getPatternSize - Return the 'size' of this pattern. We want to match large
1701 /// patterns before small ones. This is used to determine the size of a
1703 static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
1704 assert(isExtIntegerInVTs(P->getExtTypes()) ||
1705 isExtFloatingPointInVTs(P->getExtTypes()) ||
1706 P->getExtTypeNum(0) == MVT::isVoid ||
1707 P->getExtTypeNum(0) == MVT::Flag &&
1708 "Not a valid pattern node to size!");
1709 unsigned Size = 2; // The node itself.
1711 // FIXME: This is a hack to statically increase the priority of patterns
1712 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
1713 // Later we can allow complexity / cost for each pattern to be (optionally)
1714 // specified. To get best possible pattern match we'll need to dynamically
1715 // calculate the complexity of all patterns a dag can potentially map to.
1716 const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
1718 Size += AM->getNumOperands() * 2;
1720 // Count children in the count if they are also nodes.
1721 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
1722 TreePatternNode *Child = P->getChild(i);
1723 if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
1724 Size += getPatternSize(Child, ISE);
1725 else if (Child->isLeaf()) {
1726 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
1727 Size += 3; // Matches a ConstantSDNode.
1728 else if (NodeIsComplexPattern(Child))
1729 Size += getPatternSize(Child, ISE);
1736 /// getResultPatternCost - Compute the number of instructions for this pattern.
1737 /// This is a temporary hack. We should really include the instruction
1738 /// latencies in this calculation.
1739 static unsigned getResultPatternCost(TreePatternNode *P) {
1740 if (P->isLeaf()) return 0;
1742 unsigned Cost = P->getOperator()->isSubClassOf("Instruction");
1743 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
1744 Cost += getResultPatternCost(P->getChild(i));
1748 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
1749 // In particular, we want to match maximal patterns first and lowest cost within
1750 // a particular complexity first.
1751 struct PatternSortingPredicate {
1752 PatternSortingPredicate(DAGISelEmitter &ise) : ISE(ise) {};
1753 DAGISelEmitter &ISE;
1755 bool operator()(PatternToMatch *LHS,
1756 PatternToMatch *RHS) {
1757 unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), ISE);
1758 unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), ISE);
1759 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
1760 if (LHSSize < RHSSize) return false;
1762 // If the patterns have equal complexity, compare generated instruction cost
1763 return getResultPatternCost(LHS->getDstPattern()) <
1764 getResultPatternCost(RHS->getDstPattern());
1768 /// getRegisterValueType - Look up and return the first ValueType of specified
1769 /// RegisterClass record
1770 static MVT::ValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
1771 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
1772 return RC->getValueTypeNum(0);
1777 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
1778 /// type information from it.
1779 static void RemoveAllTypes(TreePatternNode *N) {
1782 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1783 RemoveAllTypes(N->getChild(i));
1786 Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
1787 Record *N = Records.getDef(Name);
1788 assert(N && N->isSubClassOf("SDNode") && "Bad argument");
1792 /// NodeHasProperty - return true if TreePatternNode has the specified
1794 static bool NodeHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
1795 DAGISelEmitter &ISE)
1797 if (N->isLeaf()) return false;
1798 Record *Operator = N->getOperator();
1799 if (!Operator->isSubClassOf("SDNode")) return false;
1801 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(Operator);
1802 return NodeInfo.hasProperty(Property);
1805 static bool PatternHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
1806 DAGISelEmitter &ISE)
1808 if (NodeHasProperty(N, Property, ISE))
1811 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
1812 TreePatternNode *Child = N->getChild(i);
1813 if (PatternHasProperty(Child, Property, ISE))
1820 class PatternCodeEmitter {
1822 DAGISelEmitter &ISE;
1825 ListInit *Predicates;
1826 // Instruction selector pattern.
1827 TreePatternNode *Pattern;
1828 // Matched instruction.
1829 TreePatternNode *Instruction;
1832 // Node to name mapping
1833 std::map<std::string, std::string> VariableMap;
1834 // Node to operator mapping
1835 std::map<std::string, Record*> OperatorMap;
1836 // Names of all the folded nodes which produce chains.
1837 std::vector<std::pair<std::string, unsigned> > FoldedChains;
1838 std::set<std::string> Duplicates;
1842 PatternCodeEmitter(DAGISelEmitter &ise, ListInit *preds,
1843 TreePatternNode *pattern, TreePatternNode *instr,
1844 unsigned PatNum, std::ostream &os) :
1845 ISE(ise), Predicates(preds), Pattern(pattern), Instruction(instr),
1846 PatternNo(PatNum), OS(os), TmpNo(0) {}
1848 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
1849 /// if the match fails. At this point, we already know that the opcode for N
1850 /// matches, and the SDNode for the result has the RootName specified name.
1851 void EmitMatchCode(TreePatternNode *N, const std::string &RootName,
1852 bool &FoundChain, bool isRoot = false) {
1854 // Emit instruction predicates. Each predicate is just a string for now.
1856 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
1857 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
1858 Record *Def = Pred->getDef();
1859 if (Def->isSubClassOf("Predicate")) {
1864 OS << "!(" << Def->getValueAsString("CondString") << ")";
1866 OS << ") goto P" << PatternNo << "Fail;\n";
1869 assert(0 && "Unknown predicate type!");
1876 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
1877 OS << " if (cast<ConstantSDNode>(" << RootName
1878 << ")->getSignExtended() != " << II->getValue() << ")\n"
1879 << " goto P" << PatternNo << "Fail;\n";
1881 } else if (!NodeIsComplexPattern(N)) {
1882 assert(0 && "Cannot match this as a leaf value!");
1887 // If this node has a name associated with it, capture it in VariableMap. If
1888 // we already saw this in the pattern, emit code to verify dagness.
1889 if (!N->getName().empty()) {
1890 std::string &VarMapEntry = VariableMap[N->getName()];
1891 if (VarMapEntry.empty()) {
1892 VarMapEntry = RootName;
1894 // If we get here, this is a second reference to a specific name. Since
1895 // we already have checked that the first reference is valid, we don't
1896 // have to recursively match it, just check that it's the same as the
1897 // previously named thing.
1898 OS << " if (" << VarMapEntry << " != " << RootName
1899 << ") goto P" << PatternNo << "Fail;\n";
1904 OperatorMap[N->getName()] = N->getOperator();
1908 // Emit code to load the child nodes and match their contents recursively.
1910 bool NodeHasChain = NodeHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
1911 bool HasChain = PatternHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
1916 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
1917 OS << " if (!" << RootName << ".hasOneUse()) goto P"
1918 << PatternNo << "Fail; // Multiple uses of actual result?\n";
1920 OS << " if (CodeGenMap.count(" << RootName
1921 << ".getValue(" << CInfo.getNumResults() << "))) goto P"
1922 << PatternNo << "Fail; // Already selected for a chain use?\n";
1924 if (NodeHasChain && !FoundChain) {
1925 OS << " SDOperand Chain = " << RootName << ".getOperand(0);\n";
1930 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
1931 OS << " SDOperand " << RootName << OpNo << " = "
1932 << RootName << ".getOperand(" << OpNo << ");\n";
1933 TreePatternNode *Child = N->getChild(i);
1935 if (!Child->isLeaf()) {
1936 // If it's not a leaf, recursively match.
1937 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(Child->getOperator());
1938 OS << " if (" << RootName << OpNo << ".getOpcode() != "
1939 << CInfo.getEnumName() << ") goto P" << PatternNo << "Fail;\n";
1940 EmitMatchCode(Child, RootName + utostr(OpNo), FoundChain);
1941 if (NodeHasProperty(Child, SDNodeInfo::SDNPHasChain, ISE)) {
1942 FoldedChains.push_back(std::make_pair(RootName + utostr(OpNo),
1943 CInfo.getNumResults()));
1946 // If this child has a name associated with it, capture it in VarMap. If
1947 // we already saw this in the pattern, emit code to verify dagness.
1948 if (!Child->getName().empty()) {
1949 std::string &VarMapEntry = VariableMap[Child->getName()];
1950 if (VarMapEntry.empty()) {
1951 VarMapEntry = RootName + utostr(OpNo);
1953 // If we get here, this is a second reference to a specific name. Since
1954 // we already have checked that the first reference is valid, we don't
1955 // have to recursively match it, just check that it's the same as the
1956 // previously named thing.
1957 OS << " if (" << VarMapEntry << " != " << RootName << OpNo
1958 << ") goto P" << PatternNo << "Fail;\n";
1959 Duplicates.insert(RootName + utostr(OpNo));
1964 // Handle leaves of various types.
1965 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1966 Record *LeafRec = DI->getDef();
1967 if (LeafRec->isSubClassOf("RegisterClass")) {
1968 // Handle register references. Nothing to do here.
1969 } else if (LeafRec->isSubClassOf("Register")) {
1970 // Handle register references.
1971 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
1972 // Handle complex pattern. Nothing to do here.
1973 } else if (LeafRec->getName() == "srcvalue") {
1974 // Place holder for SRCVALUE nodes. Nothing to do here.
1975 } else if (LeafRec->isSubClassOf("ValueType")) {
1976 // Make sure this is the specified value type.
1977 OS << " if (cast<VTSDNode>(" << RootName << OpNo << ")->getVT() != "
1978 << "MVT::" << LeafRec->getName() << ") goto P" << PatternNo
1980 } else if (LeafRec->isSubClassOf("CondCode")) {
1981 // Make sure this is the specified cond code.
1982 OS << " if (cast<CondCodeSDNode>(" << RootName << OpNo
1983 << ")->get() != " << "ISD::" << LeafRec->getName()
1984 << ") goto P" << PatternNo << "Fail;\n";
1988 assert(0 && "Unknown leaf type!");
1990 } else if (IntInit *II = dynamic_cast<IntInit*>(Child->getLeafValue())) {
1991 OS << " if (!isa<ConstantSDNode>(" << RootName << OpNo << ") ||\n"
1992 << " cast<ConstantSDNode>(" << RootName << OpNo
1993 << ")->getSignExtended() != " << II->getValue() << ")\n"
1994 << " goto P" << PatternNo << "Fail;\n";
1997 assert(0 && "Unknown leaf type!");
2002 // If there is a node predicate for this, emit the call.
2003 if (!N->getPredicateFn().empty())
2004 OS << " if (!" << N->getPredicateFn() << "(" << RootName
2005 << ".Val)) goto P" << PatternNo << "Fail;\n";
2008 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
2009 /// we actually have to build a DAG!
2010 std::pair<unsigned, unsigned>
2011 EmitResultCode(TreePatternNode *N, bool isRoot = false) {
2012 // This is something selected from the pattern we matched.
2013 if (!N->getName().empty()) {
2014 assert(!isRoot && "Root of pattern cannot be a leaf!");
2015 std::string &Val = VariableMap[N->getName()];
2016 assert(!Val.empty() &&
2017 "Variable referenced but not defined and not caught earlier!");
2018 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
2019 // Already selected this operand, just return the tmpval.
2020 return std::make_pair(1, atoi(Val.c_str()+3));
2023 const ComplexPattern *CP;
2024 unsigned ResNo = TmpNo++;
2025 unsigned NumRes = 1;
2026 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
2027 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2028 switch (N->getTypeNum(0)) {
2029 default: assert(0 && "Unknown type for constant node!");
2030 case MVT::i1: OS << " bool Tmp"; break;
2031 case MVT::i8: OS << " unsigned char Tmp"; break;
2032 case MVT::i16: OS << " unsigned short Tmp"; break;
2033 case MVT::i32: OS << " unsigned Tmp"; break;
2034 case MVT::i64: OS << " uint64_t Tmp"; break;
2036 OS << ResNo << "C = cast<ConstantSDNode>(" << Val << ")->getValue();\n";
2037 OS << " SDOperand Tmp" << utostr(ResNo)
2038 << " = CurDAG->getTargetConstant(Tmp"
2039 << ResNo << "C, MVT::" << getEnumName(N->getTypeNum(0)) << ");\n";
2040 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2041 Record *Op = OperatorMap[N->getName()];
2042 // Transform ExternalSymbol to TargetExternalSymbol
2043 if (Op && Op->getName() == "externalsym") {
2044 OS << " SDOperand Tmp" << ResNo
2045 << " = CurDAG->getTargetExternalSymbol(cast<ExternalSymbolSDNode>("
2046 << Val << ")->getSymbol(), MVT::" << getEnumName(N->getTypeNum(0))
2049 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
2050 } else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") {
2051 Record *Op = OperatorMap[N->getName()];
2052 // Transform GlobalAddress to TargetGlobalAddress
2053 if (Op && Op->getName() == "globaladdr") {
2054 OS << " SDOperand Tmp" << ResNo
2055 << " = CurDAG->getTargetGlobalAddress(cast<GlobalAddressSDNode>("
2056 << Val << ")->getGlobal(), MVT::" << getEnumName(N->getTypeNum(0))
2059 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
2060 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2061 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
2062 } else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") {
2063 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
2064 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, ISE))) {
2065 std::string Fn = CP->getSelectFunc();
2066 NumRes = CP->getNumOperands();
2067 OS << " SDOperand ";
2068 for (unsigned i = 0; i < NumRes - 1; ++i)
2069 OS << "Tmp" << (i+ResNo) << ",";
2070 OS << "Tmp" << (NumRes - 1 + ResNo) << ";\n";
2072 OS << " if (!" << Fn << "(" << Val;
2073 for (unsigned i = 0; i < NumRes; i++)
2074 OS << ", Tmp" << i + ResNo;
2075 OS << ")) goto P" << PatternNo << "Fail;\n";
2076 TmpNo = ResNo + NumRes;
2078 OS << " SDOperand Tmp" << ResNo << " = Select(" << Val << ");\n";
2080 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
2081 // value if used multiple times by this pattern result.
2082 Val = "Tmp"+utostr(ResNo);
2083 return std::make_pair(NumRes, ResNo);
2087 // If this is an explicit register reference, handle it.
2088 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
2089 unsigned ResNo = TmpNo++;
2090 if (DI->getDef()->isSubClassOf("Register")) {
2091 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getRegister("
2092 << ISE.getQualifiedName(DI->getDef()) << ", MVT::"
2093 << getEnumName(N->getTypeNum(0))
2095 return std::make_pair(1, ResNo);
2097 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2098 unsigned ResNo = TmpNo++;
2099 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2100 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetConstant("
2101 << II->getValue() << ", MVT::"
2102 << getEnumName(N->getTypeNum(0))
2104 return std::make_pair(1, ResNo);
2108 assert(0 && "Unknown leaf type!");
2109 return std::make_pair(1, ~0U);
2112 Record *Op = N->getOperator();
2113 if (Op->isSubClassOf("Instruction")) {
2114 const CodeGenTarget &CGT = ISE.getTargetInfo();
2115 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
2116 const DAGInstruction &Inst = ISE.getInstruction(Op);
2117 bool HasImpInputs = Inst.getNumImpOperands() > 0;
2118 bool HasImpResults = Inst.getNumImpResults() > 0;
2119 bool HasOptInFlag = isRoot &&
2120 NodeHasProperty(Pattern, SDNodeInfo::SDNPOptInFlag, ISE);
2121 bool HasInFlag = isRoot &&
2122 NodeHasProperty(Pattern, SDNodeInfo::SDNPInFlag, ISE);
2123 bool HasOutFlag = HasImpResults ||
2124 (isRoot && PatternHasProperty(Pattern, SDNodeInfo::SDNPOutFlag, ISE));
2126 NodeHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE);
2127 bool HasChain = II.hasCtrlDep ||
2128 (isRoot && PatternHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE));
2130 if (HasOutFlag || HasInFlag || HasOptInFlag || HasImpInputs)
2131 OS << " SDOperand InFlag = SDOperand(0, 0);\n";
2133 // How many results is this pattern expected to produce?
2134 unsigned NumExpectedResults = 0;
2135 for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
2136 MVT::ValueType VT = Pattern->getTypeNum(i);
2137 if (VT != MVT::isVoid && VT != MVT::Flag)
2138 NumExpectedResults++;
2141 // Determine operand emission order. Complex pattern first.
2142 std::vector<std::pair<unsigned, TreePatternNode*> > EmitOrder;
2143 std::vector<std::pair<unsigned, TreePatternNode*> >::iterator OI;
2144 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2145 TreePatternNode *Child = N->getChild(i);
2147 EmitOrder.push_back(std::make_pair(i, Child));
2148 OI = EmitOrder.begin();
2149 } else if (NodeIsComplexPattern(Child)) {
2150 OI = EmitOrder.insert(OI, std::make_pair(i, Child));
2152 EmitOrder.push_back(std::make_pair(i, Child));
2156 // Emit all of the operands.
2157 std::vector<std::pair<unsigned, unsigned> > NumTemps(EmitOrder.size());
2158 for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) {
2159 unsigned OpOrder = EmitOrder[i].first;
2160 TreePatternNode *Child = EmitOrder[i].second;
2161 std::pair<unsigned, unsigned> NumTemp = EmitResultCode(Child);
2162 NumTemps[OpOrder] = NumTemp;
2165 // List all the operands in the right order.
2166 std::vector<unsigned> Ops;
2167 for (unsigned i = 0, e = NumTemps.size(); i != e; i++) {
2168 for (unsigned j = 0; j < NumTemps[i].first; j++)
2169 Ops.push_back(NumTemps[i].second + j);
2172 // Emit all the chain and CopyToReg stuff.
2173 bool ChainEmitted = HasChain;
2175 OS << " Chain = Select(Chain);\n";
2177 EmitCopyToRegs(Pattern, "N", ChainEmitted, true);
2178 if (HasInFlag || HasOptInFlag) {
2179 unsigned FlagNo = (unsigned) NodeHasChain + Pattern->getNumChildren();
2181 OS << " if (N.getNumOperands() == " << FlagNo+1 << ") ";
2184 OS << "InFlag = Select(N.getOperand(" << FlagNo << "));\n";
2187 unsigned NumResults = Inst.getNumResults();
2188 unsigned ResNo = TmpNo++;
2190 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetNode("
2191 << II.Namespace << "::" << II.TheDef->getName();
2192 if (N->getTypeNum(0) != MVT::isVoid)
2193 OS << ", MVT::" << getEnumName(N->getTypeNum(0));
2195 OS << ", MVT::Flag";
2197 unsigned LastOp = 0;
2198 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
2200 OS << ", Tmp" << LastOp;
2204 // Must have at least one result
2205 OS << " Chain = Tmp" << LastOp << ".getValue("
2206 << NumResults << ");\n";
2208 } else if (HasChain || HasOutFlag) {
2209 OS << " SDOperand Result = CurDAG->getTargetNode("
2210 << II.Namespace << "::" << II.TheDef->getName();
2212 // Output order: results, chain, flags
2214 if (NumResults > 0) {
2215 if (N->getTypeNum(0) != MVT::isVoid)
2216 OS << ", MVT::" << getEnumName(N->getTypeNum(0));
2219 OS << ", MVT::Other";
2221 OS << ", MVT::Flag";
2224 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2225 OS << ", Tmp" << Ops[i];
2226 if (HasChain) OS << ", Chain";
2227 if (HasInFlag || HasImpInputs) OS << ", InFlag";
2231 for (unsigned i = 0; i < NumResults; i++) {
2232 OS << " CodeGenMap[N.getValue(" << ValNo << ")] = Result"
2233 << ".getValue(" << ValNo << ");\n";
2238 OS << " Chain = Result.getValue(" << ValNo << ");\n";
2241 OS << " InFlag = Result.getValue("
2242 << ValNo + (unsigned)HasChain << ");\n";
2244 if (HasImpResults) {
2245 if (EmitCopyFromRegs(N, ChainEmitted)) {
2246 OS << " CodeGenMap[N.getValue(" << ValNo << ")] = "
2247 << "Result.getValue(" << ValNo << ");\n";
2252 // User does not expect that the instruction produces a chain!
2253 bool AddedChain = HasChain && !NodeHasChain;
2255 OS << " CodeGenMap[N.getValue(" << ValNo++ << ")] = Chain;\n";
2257 if (FoldedChains.size() > 0) {
2259 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
2260 OS << "CodeGenMap[" << FoldedChains[j].first << ".getValue("
2261 << FoldedChains[j].second << ")] = ";
2266 OS << " CodeGenMap[N.getValue(" << ValNo << ")] = InFlag;\n";
2268 if (AddedChain && HasOutFlag) {
2269 if (NumExpectedResults == 0) {
2270 OS << " return Result.getValue(N.ResNo+1);\n";
2272 OS << " if (N.ResNo < " << NumExpectedResults << ")\n";
2273 OS << " return Result.getValue(N.ResNo);\n";
2275 OS << " return Result.getValue(N.ResNo+1);\n";
2278 OS << " return Result.getValue(N.ResNo);\n";
2281 // If this instruction is the root, and if there is only one use of it,
2282 // use SelectNodeTo instead of getTargetNode to avoid an allocation.
2283 OS << " if (N.Val->hasOneUse()) {\n";
2284 OS << " return CurDAG->SelectNodeTo(N.Val, "
2285 << II.Namespace << "::" << II.TheDef->getName();
2286 if (N->getTypeNum(0) != MVT::isVoid)
2287 OS << ", MVT::" << getEnumName(N->getTypeNum(0));
2289 OS << ", MVT::Flag";
2290 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2291 OS << ", Tmp" << Ops[i];
2292 if (HasInFlag || HasImpInputs)
2295 OS << " } else {\n";
2296 OS << " return CodeGenMap[N] = CurDAG->getTargetNode("
2297 << II.Namespace << "::" << II.TheDef->getName();
2298 if (N->getTypeNum(0) != MVT::isVoid)
2299 OS << ", MVT::" << getEnumName(N->getTypeNum(0));
2301 OS << ", MVT::Flag";
2302 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2303 OS << ", Tmp" << Ops[i];
2304 if (HasInFlag || HasImpInputs)
2310 return std::make_pair(1, ResNo);
2311 } else if (Op->isSubClassOf("SDNodeXForm")) {
2312 assert(N->getNumChildren() == 1 && "node xform should have one child!");
2313 unsigned OpVal = EmitResultCode(N->getChild(0)).second;
2314 unsigned ResNo = TmpNo++;
2315 OS << " SDOperand Tmp" << ResNo << " = Transform_" << Op->getName()
2316 << "(Tmp" << OpVal << ".Val);\n";
2318 OS << " CodeGenMap[N] = Tmp" << ResNo << ";\n";
2319 OS << " return Tmp" << ResNo << ";\n";
2321 return std::make_pair(1, ResNo);
2325 throw std::string("Unknown node in result pattern!");
2329 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat' and
2330 /// add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
2331 /// 'Pat' may be missing types. If we find an unresolved type to add a check
2332 /// for, this returns true otherwise false if Pat has all types.
2333 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
2334 const std::string &Prefix) {
2336 if (!Pat->hasTypeSet()) {
2337 // Move a type over from 'other' to 'pat'.
2338 Pat->setTypes(Other->getExtTypes());
2339 OS << " if (" << Prefix << ".Val->getValueType(0) != MVT::"
2340 << getName(Pat->getTypeNum(0)) << ") goto P" << PatternNo << "Fail;\n";
2345 (unsigned) NodeHasProperty(Pat, SDNodeInfo::SDNPHasChain, ISE);
2346 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
2347 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
2348 Prefix + utostr(OpNo)))
2354 /// EmitCopyToRegs - Emit the flag operands for the DAG that is
2356 void EmitCopyToRegs(TreePatternNode *N, const std::string &RootName,
2357 bool &ChainEmitted, bool isRoot = false) {
2358 const CodeGenTarget &T = ISE.getTargetInfo();
2360 (unsigned) NodeHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
2361 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2362 TreePatternNode *Child = N->getChild(i);
2363 if (!Child->isLeaf()) {
2364 EmitCopyToRegs(Child, RootName + utostr(OpNo), ChainEmitted);
2366 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2367 if (!Child->getName().empty()) {
2368 std::string Name = RootName + utostr(OpNo);
2369 if (Duplicates.find(Name) != Duplicates.end())
2370 // A duplicate! Do not emit a copy for this node.
2374 Record *RR = DI->getDef();
2375 if (RR->isSubClassOf("Register")) {
2376 MVT::ValueType RVT = getRegisterValueType(RR, T);
2377 if (RVT == MVT::Flag) {
2378 OS << " InFlag = Select(" << RootName << OpNo << ");\n";
2380 if (!ChainEmitted) {
2381 OS << " SDOperand Chain = CurDAG->getEntryNode();\n";
2382 ChainEmitted = true;
2384 OS << " SDOperand " << RootName << "CR" << i << ";\n";
2385 OS << " " << RootName << "CR" << i
2386 << " = CurDAG->getCopyToReg(Chain, CurDAG->getRegister("
2387 << ISE.getQualifiedName(RR) << ", MVT::"
2388 << getEnumName(RVT) << ")"
2389 << ", Select(" << RootName << OpNo << "), InFlag);\n";
2390 OS << " Chain = " << RootName << "CR" << i
2391 << ".getValue(0);\n";
2392 OS << " InFlag = " << RootName << "CR" << i
2393 << ".getValue(1);\n";
2401 /// EmitCopyFromRegs - Emit code to copy result to physical registers
2402 /// as specified by the instruction. It returns true if any copy is
2404 bool EmitCopyFromRegs(TreePatternNode *N, bool &ChainEmitted) {
2405 bool RetVal = false;
2406 Record *Op = N->getOperator();
2407 if (Op->isSubClassOf("Instruction")) {
2408 const DAGInstruction &Inst = ISE.getInstruction(Op);
2409 const CodeGenTarget &CGT = ISE.getTargetInfo();
2410 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
2411 unsigned NumImpResults = Inst.getNumImpResults();
2412 for (unsigned i = 0; i < NumImpResults; i++) {
2413 Record *RR = Inst.getImpResult(i);
2414 if (RR->isSubClassOf("Register")) {
2415 MVT::ValueType RVT = getRegisterValueType(RR, CGT);
2416 if (RVT != MVT::Flag) {
2417 if (!ChainEmitted) {
2418 OS << " SDOperand Chain = CurDAG->getEntryNode();\n";
2419 ChainEmitted = true;
2421 OS << " Result = CurDAG->getCopyFromReg(Chain, "
2422 << ISE.getQualifiedName(RR)
2423 << ", MVT::" << getEnumName(RVT) << ", InFlag);\n";
2424 OS << " Chain = Result.getValue(1);\n";
2425 OS << " InFlag = Result.getValue(2);\n";
2435 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
2436 /// stream to match the pattern, and generate the code for the match if it
2438 void DAGISelEmitter::EmitCodeForPattern(PatternToMatch &Pattern,
2440 static unsigned PatternCount = 0;
2441 unsigned PatternNo = PatternCount++;
2442 OS << " { // Pattern #" << PatternNo << ": ";
2443 Pattern.getSrcPattern()->print(OS);
2444 OS << "\n // Emits: ";
2445 Pattern.getDstPattern()->print(OS);
2447 OS << " // Pattern complexity = "
2448 << getPatternSize(Pattern.getSrcPattern(), *this)
2450 << getResultPatternCost(Pattern.getDstPattern()) << "\n";
2452 PatternCodeEmitter Emitter(*this, Pattern.getPredicates(),
2453 Pattern.getSrcPattern(), Pattern.getDstPattern(),
2456 // Emit the matcher, capturing named arguments in VariableMap.
2457 bool FoundChain = false;
2458 Emitter.EmitMatchCode(Pattern.getSrcPattern(), "N", FoundChain,
2461 // TP - Get *SOME* tree pattern, we don't care which.
2462 TreePattern &TP = *PatternFragments.begin()->second;
2464 // At this point, we know that we structurally match the pattern, but the
2465 // types of the nodes may not match. Figure out the fewest number of type
2466 // comparisons we need to emit. For example, if there is only one integer
2467 // type supported by a target, there should be no type comparisons at all for
2468 // integer patterns!
2470 // To figure out the fewest number of type checks needed, clone the pattern,
2471 // remove the types, then perform type inference on the pattern as a whole.
2472 // If there are unresolved types, emit an explicit check for those types,
2473 // apply the type to the tree, then rerun type inference. Iterate until all
2474 // types are resolved.
2476 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
2477 RemoveAllTypes(Pat);
2480 // Resolve/propagate as many types as possible.
2482 bool MadeChange = true;
2484 MadeChange = Pat->ApplyTypeConstraints(TP,true/*Ignore reg constraints*/);
2486 assert(0 && "Error: could not find consistent types for something we"
2487 " already decided was ok!");
2491 // Insert a check for an unresolved type and add it to the tree. If we find
2492 // an unresolved type to add a check for, this returns true and we iterate,
2493 // otherwise we are done.
2494 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N"));
2496 Emitter.EmitResultCode(Pattern.getDstPattern(), true /*the root*/);
2500 OS << " }\n P" << PatternNo << "Fail:\n";
2505 /// CompareByRecordName - An ordering predicate that implements less-than by
2506 /// comparing the names records.
2507 struct CompareByRecordName {
2508 bool operator()(const Record *LHS, const Record *RHS) const {
2509 // Sort by name first.
2510 if (LHS->getName() < RHS->getName()) return true;
2511 // If both names are equal, sort by pointer.
2512 return LHS->getName() == RHS->getName() && LHS < RHS;
2517 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
2518 std::string InstNS = Target.inst_begin()->second.Namespace;
2519 if (!InstNS.empty()) InstNS += "::";
2521 // Group the patterns by their top-level opcodes.
2522 std::map<Record*, std::vector<PatternToMatch*>,
2523 CompareByRecordName> PatternsByOpcode;
2524 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2525 TreePatternNode *Node = PatternsToMatch[i].getSrcPattern();
2526 if (!Node->isLeaf()) {
2527 PatternsByOpcode[Node->getOperator()].push_back(&PatternsToMatch[i]);
2529 const ComplexPattern *CP;
2531 dynamic_cast<IntInit*>(Node->getLeafValue())) {
2532 PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
2533 } else if ((CP = NodeGetComplexPattern(Node, *this))) {
2534 std::vector<Record*> OpNodes = CP->getRootNodes();
2535 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
2536 PatternsByOpcode[OpNodes[j]].insert(PatternsByOpcode[OpNodes[j]].begin(),
2537 &PatternsToMatch[i]);
2540 std::cerr << "Unrecognized opcode '";
2542 std::cerr << "' on tree pattern '";
2543 std::cerr << PatternsToMatch[i].getDstPattern()->getOperator()->getName();
2544 std::cerr << "'!\n";
2550 // Emit one Select_* method for each top-level opcode. We do this instead of
2551 // emitting one giant switch statement to support compilers where this will
2552 // result in the recursive functions taking less stack space.
2553 for (std::map<Record*, std::vector<PatternToMatch*>,
2554 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
2555 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
2556 OS << "SDOperand Select_" << PBOI->first->getName() << "(SDOperand N) {\n";
2558 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
2559 std::vector<PatternToMatch*> &Patterns = PBOI->second;
2561 // We want to emit all of the matching code now. However, we want to emit
2562 // the matches in order of minimal cost. Sort the patterns so the least
2563 // cost one is at the start.
2564 std::stable_sort(Patterns.begin(), Patterns.end(),
2565 PatternSortingPredicate(*this));
2567 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
2568 EmitCodeForPattern(*Patterns[i], OS);
2570 OS << " std::cerr << \"Cannot yet select: \";\n"
2571 << " N.Val->dump(CurDAG);\n"
2572 << " std::cerr << '\\n';\n"
2577 // Emit boilerplate.
2578 OS << "// The main instruction selector code.\n"
2579 << "SDOperand SelectCode(SDOperand N) {\n"
2580 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
2581 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
2582 << "INSTRUCTION_LIST_END))\n"
2583 << " return N; // Already selected.\n\n"
2584 << " std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);\n"
2585 << " if (CGMI != CodeGenMap.end()) return CGMI->second;\n"
2586 << " switch (N.getOpcode()) {\n"
2587 << " default: break;\n"
2588 << " case ISD::EntryToken: // These leaves remain the same.\n"
2589 << " case ISD::BasicBlock:\n"
2590 << " case ISD::Register:\n"
2592 << " case ISD::AssertSext:\n"
2593 << " case ISD::AssertZext: {\n"
2594 << " SDOperand Tmp0 = Select(N.getOperand(0));\n"
2595 << " if (!N.Val->hasOneUse()) CodeGenMap[N] = Tmp0;\n"
2596 << " return Tmp0;\n"
2598 << " case ISD::TokenFactor:\n"
2599 << " if (N.getNumOperands() == 2) {\n"
2600 << " SDOperand Op0 = Select(N.getOperand(0));\n"
2601 << " SDOperand Op1 = Select(N.getOperand(1));\n"
2602 << " return CodeGenMap[N] =\n"
2603 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);\n"
2605 << " std::vector<SDOperand> Ops;\n"
2606 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)\n"
2607 << " Ops.push_back(Select(N.getOperand(i)));\n"
2608 << " return CodeGenMap[N] = \n"
2609 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
2611 << " case ISD::CopyFromReg: {\n"
2612 << " SDOperand Chain = Select(N.getOperand(0));\n"
2613 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
2614 << " MVT::ValueType VT = N.Val->getValueType(0);\n"
2615 << " if (N.Val->getNumValues() == 2) {\n"
2616 << " if (Chain == N.getOperand(0)) return N; // No change\n"
2617 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT);\n"
2618 << " CodeGenMap[N.getValue(0)] = New;\n"
2619 << " CodeGenMap[N.getValue(1)] = New.getValue(1);\n"
2620 << " return New.getValue(N.ResNo);\n"
2622 << " SDOperand Flag(0, 0);\n"
2623 << " if (N.getNumOperands() == 3) Flag = Select(N.getOperand(2));\n"
2624 << " if (Chain == N.getOperand(0) &&\n"
2625 << " (N.getNumOperands() == 2 || Flag == N.getOperand(2)))\n"
2626 << " return N; // No change\n"
2627 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT, Flag);\n"
2628 << " CodeGenMap[N.getValue(0)] = New;\n"
2629 << " CodeGenMap[N.getValue(1)] = New.getValue(1);\n"
2630 << " CodeGenMap[N.getValue(2)] = New.getValue(2);\n"
2631 << " return New.getValue(N.ResNo);\n"
2634 << " case ISD::CopyToReg: {\n"
2635 << " SDOperand Chain = Select(N.getOperand(0));\n"
2636 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
2637 << " SDOperand Val = Select(N.getOperand(2));\n"
2638 << " SDOperand Result = N;\n"
2639 << " if (N.Val->getNumValues() == 1) {\n"
2640 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2))\n"
2641 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val);\n"
2642 << " return CodeGenMap[N] = Result;\n"
2644 << " SDOperand Flag(0, 0);\n"
2645 << " if (N.getNumOperands() == 4) Flag = Select(N.getOperand(3));\n"
2646 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2) ||\n"
2647 << " (N.getNumOperands() == 4 && Flag != N.getOperand(3)))\n"
2648 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val, Flag);\n"
2649 << " CodeGenMap[N.getValue(0)] = Result;\n"
2650 << " CodeGenMap[N.getValue(1)] = Result.getValue(1);\n"
2651 << " return Result.getValue(N.ResNo);\n"
2655 // Loop over all of the case statements, emiting a call to each method we
2657 for (std::map<Record*, std::vector<PatternToMatch*>,
2658 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
2659 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
2660 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
2661 OS << " case " << OpcodeInfo.getEnumName() << ": "
2662 << std::string(std::max(0, int(24-OpcodeInfo.getEnumName().size())), ' ')
2663 << "return Select_" << PBOI->first->getName() << "(N);\n";
2666 OS << " } // end of big switch.\n\n"
2667 << " std::cerr << \"Cannot yet select: \";\n"
2668 << " N.Val->dump(CurDAG);\n"
2669 << " std::cerr << '\\n';\n"
2674 void DAGISelEmitter::run(std::ostream &OS) {
2675 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
2678 OS << "// *** NOTE: This file is #included into the middle of the target\n"
2679 << "// *** instruction selector class. These functions are really "
2682 OS << "// Instance var to keep track of multiply used nodes that have \n"
2683 << "// already been selected.\n"
2684 << "std::map<SDOperand, SDOperand> CodeGenMap;\n";
2687 ParseNodeTransforms(OS);
2688 ParseComplexPatterns();
2689 ParsePatternFragments(OS);
2690 ParseInstructions();
2693 // Generate variants. For example, commutative patterns can match
2694 // multiple ways. Add them to PatternsToMatch as well.
2698 DEBUG(std::cerr << "\n\nALL PATTERNS TO MATCH:\n\n";
2699 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2700 std::cerr << "PATTERN: "; PatternsToMatch[i].getSrcPattern()->dump();
2701 std::cerr << "\nRESULT: ";PatternsToMatch[i].getDstPattern()->dump();
2705 // At this point, we have full information about the 'Patterns' we need to
2706 // parse, both implicitly from instructions as well as from explicit pattern
2707 // definitions. Emit the resultant instruction selector.
2708 EmitInstructionSelector(OS);
2710 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
2711 E = PatternFragments.end(); I != E; ++I)
2713 PatternFragments.clear();
2715 Instructions.clear();