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")) {
547 // If the register appears in exactly one regclass, and the regclass has one
548 // value type, use it as the known type.
549 const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
550 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
551 return ConvertVTs(RC->getValueTypes());
553 } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
554 // Using a VTSDNode or CondCodeSDNode.
556 } else if (R->isSubClassOf("ComplexPattern")) {
557 std::vector<unsigned char>
558 ComplexPat(1, TP.getDAGISelEmitter().getComplexPattern(R).getValueType());
560 } else if (R->getName() == "node" || R->getName() == "srcvalue") {
565 TP.error("Unknown node flavor used in pattern: " + R->getName());
569 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
570 /// this node and its children in the tree. This returns true if it makes a
571 /// change, false otherwise. If a type contradiction is found, throw an
573 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
575 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
576 // If it's a regclass or something else known, include the type.
577 return UpdateNodeType(getIntrinsicType(DI->getDef(), NotRegisters, TP),
579 } else if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
580 // Int inits are always integers. :)
581 bool MadeChange = UpdateNodeType(MVT::isInt, TP);
584 // At some point, it may make sense for this tree pattern to have
585 // multiple types. Assert here that it does not, so we revisit this
586 // code when appropriate.
587 assert(getExtTypes().size() == 1 && "TreePattern has too many types!");
589 unsigned Size = MVT::getSizeInBits(getTypeNum(0));
590 // Make sure that the value is representable for this type.
592 int Val = (II->getValue() << (32-Size)) >> (32-Size);
593 if (Val != II->getValue())
594 TP.error("Sign-extended integer value '" + itostr(II->getValue()) +
595 "' is out of range for type 'MVT::" +
596 getEnumName(getTypeNum(0)) + "'!");
605 // special handling for set, which isn't really an SDNode.
606 if (getOperator()->getName() == "set") {
607 assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!");
608 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
609 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
611 // Types of operands must match.
612 MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtTypes(), TP);
613 MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtTypes(), TP);
614 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
616 } else if (getOperator()->isSubClassOf("SDNode")) {
617 const SDNodeInfo &NI = TP.getDAGISelEmitter().getSDNodeInfo(getOperator());
619 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
620 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
621 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
622 // Branch, etc. do not produce results and top-level forms in instr pattern
623 // must have void types.
624 if (NI.getNumResults() == 0)
625 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
627 } else if (getOperator()->isSubClassOf("Instruction")) {
628 const DAGInstruction &Inst =
629 TP.getDAGISelEmitter().getInstruction(getOperator());
630 bool MadeChange = false;
631 unsigned NumResults = Inst.getNumResults();
633 assert(NumResults <= 1 &&
634 "Only supports zero or one result instrs!");
635 // Apply the result type to the node
636 if (NumResults == 0) {
637 MadeChange = UpdateNodeType(MVT::isVoid, TP);
639 Record *ResultNode = Inst.getResult(0);
640 assert(ResultNode->isSubClassOf("RegisterClass") &&
641 "Operands should be register classes!");
643 const CodeGenRegisterClass &RC =
644 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(ResultNode);
645 MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
648 if (getNumChildren() != Inst.getNumOperands())
649 TP.error("Instruction '" + getOperator()->getName() + " expects " +
650 utostr(Inst.getNumOperands()) + " operands, not " +
651 utostr(getNumChildren()) + " operands!");
652 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
653 Record *OperandNode = Inst.getOperand(i);
655 if (OperandNode->isSubClassOf("RegisterClass")) {
656 const CodeGenRegisterClass &RC =
657 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(OperandNode);
658 //VT = RC.getValueTypeNum(0);
659 MadeChange |=getChild(i)->UpdateNodeType(ConvertVTs(RC.getValueTypes()),
661 } else if (OperandNode->isSubClassOf("Operand")) {
662 VT = getValueType(OperandNode->getValueAsDef("Type"));
663 MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
665 assert(0 && "Unknown operand type!");
668 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
672 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
674 // Node transforms always take one operand, and take and return the same
676 if (getNumChildren() != 1)
677 TP.error("Node transform '" + getOperator()->getName() +
678 "' requires one operand!");
679 bool MadeChange = UpdateNodeType(getChild(0)->getExtTypes(), TP);
680 MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), TP);
685 /// canPatternMatch - If it is impossible for this pattern to match on this
686 /// target, fill in Reason and return false. Otherwise, return true. This is
687 /// used as a santity check for .td files (to prevent people from writing stuff
688 /// that can never possibly work), and to prevent the pattern permuter from
689 /// generating stuff that is useless.
690 bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){
691 if (isLeaf()) return true;
693 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
694 if (!getChild(i)->canPatternMatch(Reason, ISE))
697 // If this node is a commutative operator, check that the LHS isn't an
699 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
700 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
701 // Scan all of the operands of the node and make sure that only the last one
702 // is a constant node.
703 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i)
704 if (!getChild(i)->isLeaf() &&
705 getChild(i)->getOperator()->getName() == "imm") {
706 Reason = "Immediate value must be on the RHS of commutative operators!";
714 //===----------------------------------------------------------------------===//
715 // TreePattern implementation
718 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
719 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
720 isInputPattern = isInput;
721 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
722 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
725 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
726 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
727 isInputPattern = isInput;
728 Trees.push_back(ParseTreePattern(Pat));
731 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
732 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
733 isInputPattern = isInput;
734 Trees.push_back(Pat);
739 void TreePattern::error(const std::string &Msg) const {
741 throw "In " + TheRecord->getName() + ": " + Msg;
744 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
745 Record *Operator = Dag->getNodeType();
747 if (Operator->isSubClassOf("ValueType")) {
748 // If the operator is a ValueType, then this must be "type cast" of a leaf
750 if (Dag->getNumArgs() != 1)
751 error("Type cast only takes one operand!");
753 Init *Arg = Dag->getArg(0);
754 TreePatternNode *New;
755 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
756 Record *R = DI->getDef();
757 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
758 Dag->setArg(0, new DagInit(R,
759 std::vector<std::pair<Init*, std::string> >()));
760 return ParseTreePattern(Dag);
762 New = new TreePatternNode(DI);
763 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
764 New = ParseTreePattern(DI);
765 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
766 New = new TreePatternNode(II);
767 if (!Dag->getArgName(0).empty())
768 error("Constant int argument should not have a name!");
771 error("Unknown leaf value for tree pattern!");
775 // Apply the type cast.
776 New->UpdateNodeType(getValueType(Operator), *this);
777 New->setName(Dag->getArgName(0));
781 // Verify that this is something that makes sense for an operator.
782 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
783 !Operator->isSubClassOf("Instruction") &&
784 !Operator->isSubClassOf("SDNodeXForm") &&
785 Operator->getName() != "set")
786 error("Unrecognized node '" + Operator->getName() + "'!");
788 // Check to see if this is something that is illegal in an input pattern.
789 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
790 Operator->isSubClassOf("SDNodeXForm")))
791 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
793 std::vector<TreePatternNode*> Children;
795 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
796 Init *Arg = Dag->getArg(i);
797 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
798 Children.push_back(ParseTreePattern(DI));
799 if (Children.back()->getName().empty())
800 Children.back()->setName(Dag->getArgName(i));
801 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
802 Record *R = DefI->getDef();
803 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
804 // TreePatternNode if its own.
805 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
806 Dag->setArg(i, new DagInit(R,
807 std::vector<std::pair<Init*, std::string> >()));
808 --i; // Revisit this node...
810 TreePatternNode *Node = new TreePatternNode(DefI);
811 Node->setName(Dag->getArgName(i));
812 Children.push_back(Node);
815 if (R->getName() == "node") {
816 if (Dag->getArgName(i).empty())
817 error("'node' argument requires a name to match with operand list");
818 Args.push_back(Dag->getArgName(i));
821 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
822 TreePatternNode *Node = new TreePatternNode(II);
823 if (!Dag->getArgName(i).empty())
824 error("Constant int argument should not have a name!");
825 Children.push_back(Node);
830 error("Unknown leaf value for tree pattern!");
834 return new TreePatternNode(Operator, Children);
837 /// InferAllTypes - Infer/propagate as many types throughout the expression
838 /// patterns as possible. Return true if all types are infered, false
839 /// otherwise. Throw an exception if a type contradiction is found.
840 bool TreePattern::InferAllTypes() {
841 bool MadeChange = true;
844 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
845 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
848 bool HasUnresolvedTypes = false;
849 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
850 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
851 return !HasUnresolvedTypes;
854 void TreePattern::print(std::ostream &OS) const {
855 OS << getRecord()->getName();
857 OS << "(" << Args[0];
858 for (unsigned i = 1, e = Args.size(); i != e; ++i)
859 OS << ", " << Args[i];
864 if (Trees.size() > 1)
866 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
872 if (Trees.size() > 1)
876 void TreePattern::dump() const { print(std::cerr); }
880 //===----------------------------------------------------------------------===//
881 // DAGISelEmitter implementation
884 // Parse all of the SDNode definitions for the target, populating SDNodes.
885 void DAGISelEmitter::ParseNodeInfo() {
886 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
887 while (!Nodes.empty()) {
888 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
893 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
894 /// map, and emit them to the file as functions.
895 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
896 OS << "\n// Node transformations.\n";
897 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
898 while (!Xforms.empty()) {
899 Record *XFormNode = Xforms.back();
900 Record *SDNode = XFormNode->getValueAsDef("Opcode");
901 std::string Code = XFormNode->getValueAsCode("XFormFunction");
902 SDNodeXForms.insert(std::make_pair(XFormNode,
903 std::make_pair(SDNode, Code)));
906 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
907 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
909 OS << "inline SDOperand Transform_" << XFormNode->getName()
910 << "(SDNode *" << C2 << ") {\n";
911 if (ClassName != "SDNode")
912 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
913 OS << Code << "\n}\n";
920 void DAGISelEmitter::ParseComplexPatterns() {
921 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
922 while (!AMs.empty()) {
923 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
929 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
930 /// file, building up the PatternFragments map. After we've collected them all,
931 /// inline fragments together as necessary, so that there are no references left
932 /// inside a pattern fragment to a pattern fragment.
934 /// This also emits all of the predicate functions to the output file.
936 void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) {
937 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
939 // First step, parse all of the fragments and emit predicate functions.
940 OS << "\n// Predicate functions.\n";
941 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
942 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
943 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
944 PatternFragments[Fragments[i]] = P;
946 // Validate the argument list, converting it to map, to discard duplicates.
947 std::vector<std::string> &Args = P->getArgList();
948 std::set<std::string> OperandsMap(Args.begin(), Args.end());
950 if (OperandsMap.count(""))
951 P->error("Cannot have unnamed 'node' values in pattern fragment!");
953 // Parse the operands list.
954 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
955 if (OpsList->getNodeType()->getName() != "ops")
956 P->error("Operands list should start with '(ops ... '!");
958 // Copy over the arguments.
960 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
961 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
962 static_cast<DefInit*>(OpsList->getArg(j))->
963 getDef()->getName() != "node")
964 P->error("Operands list should all be 'node' values.");
965 if (OpsList->getArgName(j).empty())
966 P->error("Operands list should have names for each operand!");
967 if (!OperandsMap.count(OpsList->getArgName(j)))
968 P->error("'" + OpsList->getArgName(j) +
969 "' does not occur in pattern or was multiply specified!");
970 OperandsMap.erase(OpsList->getArgName(j));
971 Args.push_back(OpsList->getArgName(j));
974 if (!OperandsMap.empty())
975 P->error("Operands list does not contain an entry for operand '" +
976 *OperandsMap.begin() + "'!");
978 // If there is a code init for this fragment, emit the predicate code and
979 // keep track of the fact that this fragment uses it.
980 std::string Code = Fragments[i]->getValueAsCode("Predicate");
982 assert(!P->getOnlyTree()->isLeaf() && "Can't be a leaf!");
983 std::string ClassName =
984 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
985 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
987 OS << "inline bool Predicate_" << Fragments[i]->getName()
988 << "(SDNode *" << C2 << ") {\n";
989 if (ClassName != "SDNode")
990 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
991 OS << Code << "\n}\n";
992 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
995 // If there is a node transformation corresponding to this, keep track of
997 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
998 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
999 P->getOnlyTree()->setTransformFn(Transform);
1004 // Now that we've parsed all of the tree fragments, do a closure on them so
1005 // that there are not references to PatFrags left inside of them.
1006 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
1007 E = PatternFragments.end(); I != E; ++I) {
1008 TreePattern *ThePat = I->second;
1009 ThePat->InlinePatternFragments();
1011 // Infer as many types as possible. Don't worry about it if we don't infer
1012 // all of them, some may depend on the inputs of the pattern.
1014 ThePat->InferAllTypes();
1016 // If this pattern fragment is not supported by this target (no types can
1017 // satisfy its constraints), just ignore it. If the bogus pattern is
1018 // actually used by instructions, the type consistency error will be
1022 // If debugging, print out the pattern fragment result.
1023 DEBUG(ThePat->dump());
1027 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1028 /// instruction input. Return true if this is a real use.
1029 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1030 std::map<std::string, TreePatternNode*> &InstInputs,
1031 std::vector<Record*> &InstImpInputs) {
1032 // No name -> not interesting.
1033 if (Pat->getName().empty()) {
1034 if (Pat->isLeaf()) {
1035 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1036 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1037 I->error("Input " + DI->getDef()->getName() + " must be named!");
1038 else if (DI && DI->getDef()->isSubClassOf("Register"))
1039 InstImpInputs.push_back(DI->getDef());
1045 if (Pat->isLeaf()) {
1046 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1047 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1050 assert(Pat->getNumChildren() == 0 && "can't be a use with children!");
1051 Rec = Pat->getOperator();
1054 // SRCVALUE nodes are ignored.
1055 if (Rec->getName() == "srcvalue")
1058 TreePatternNode *&Slot = InstInputs[Pat->getName()];
1063 if (Slot->isLeaf()) {
1064 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1066 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1067 SlotRec = Slot->getOperator();
1070 // Ensure that the inputs agree if we've already seen this input.
1072 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1073 if (Slot->getExtTypes() != Pat->getExtTypes())
1074 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1079 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1080 /// part of "I", the instruction), computing the set of inputs and outputs of
1081 /// the pattern. Report errors if we see anything naughty.
1082 void DAGISelEmitter::
1083 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1084 std::map<std::string, TreePatternNode*> &InstInputs,
1085 std::map<std::string, Record*> &InstResults,
1086 std::vector<Record*> &InstImpInputs,
1087 std::vector<Record*> &InstImpResults) {
1088 if (Pat->isLeaf()) {
1089 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1090 if (!isUse && Pat->getTransformFn())
1091 I->error("Cannot specify a transform function for a non-input value!");
1093 } else if (Pat->getOperator()->getName() != "set") {
1094 // If this is not a set, verify that the children nodes are not void typed,
1096 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1097 if (Pat->getChild(i)->getExtTypeNum(0) == MVT::isVoid)
1098 I->error("Cannot have void nodes inside of patterns!");
1099 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
1100 InstImpInputs, InstImpResults);
1103 // If this is a non-leaf node with no children, treat it basically as if
1104 // it were a leaf. This handles nodes like (imm).
1106 if (Pat->getNumChildren() == 0)
1107 isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1109 if (!isUse && Pat->getTransformFn())
1110 I->error("Cannot specify a transform function for a non-input value!");
1114 // Otherwise, this is a set, validate and collect instruction results.
1115 if (Pat->getNumChildren() == 0)
1116 I->error("set requires operands!");
1117 else if (Pat->getNumChildren() & 1)
1118 I->error("set requires an even number of operands");
1120 if (Pat->getTransformFn())
1121 I->error("Cannot specify a transform function on a set node!");
1123 // Check the set destinations.
1124 unsigned NumValues = Pat->getNumChildren()/2;
1125 for (unsigned i = 0; i != NumValues; ++i) {
1126 TreePatternNode *Dest = Pat->getChild(i);
1127 if (!Dest->isLeaf())
1128 I->error("set destination should be a register!");
1130 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1132 I->error("set destination should be a register!");
1134 if (Val->getDef()->isSubClassOf("RegisterClass")) {
1135 if (Dest->getName().empty())
1136 I->error("set destination must have a name!");
1137 if (InstResults.count(Dest->getName()))
1138 I->error("cannot set '" + Dest->getName() +"' multiple times");
1139 InstResults[Dest->getName()] = Val->getDef();
1140 } else if (Val->getDef()->isSubClassOf("Register")) {
1141 InstImpResults.push_back(Val->getDef());
1143 I->error("set destination should be a register!");
1146 // Verify and collect info from the computation.
1147 FindPatternInputsAndOutputs(I, Pat->getChild(i+NumValues),
1148 InstInputs, InstResults,
1149 InstImpInputs, InstImpResults);
1153 /// ParseInstructions - Parse all of the instructions, inlining and resolving
1154 /// any fragments involved. This populates the Instructions list with fully
1155 /// resolved instructions.
1156 void DAGISelEmitter::ParseInstructions() {
1157 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1159 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1162 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1163 LI = Instrs[i]->getValueAsListInit("Pattern");
1165 // If there is no pattern, only collect minimal information about the
1166 // instruction for its operand list. We have to assume that there is one
1167 // result, as we have no detailed info.
1168 if (!LI || LI->getSize() == 0) {
1169 std::vector<Record*> Results;
1170 std::vector<Record*> Operands;
1172 CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1174 if (InstInfo.OperandList.size() != 0) {
1175 // FIXME: temporary hack...
1176 if (InstInfo.noResults) {
1177 // These produce no results
1178 for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
1179 Operands.push_back(InstInfo.OperandList[j].Rec);
1181 // Assume the first operand is the result.
1182 Results.push_back(InstInfo.OperandList[0].Rec);
1184 // The rest are inputs.
1185 for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
1186 Operands.push_back(InstInfo.OperandList[j].Rec);
1190 // Create and insert the instruction.
1191 std::vector<Record*> ImpResults;
1192 std::vector<Record*> ImpOperands;
1193 Instructions.insert(std::make_pair(Instrs[i],
1194 DAGInstruction(0, Results, Operands, ImpResults,
1196 continue; // no pattern.
1199 // Parse the instruction.
1200 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1201 // Inline pattern fragments into it.
1202 I->InlinePatternFragments();
1204 // Infer as many types as possible. If we cannot infer all of them, we can
1205 // never do anything with this instruction pattern: report it to the user.
1206 if (!I->InferAllTypes())
1207 I->error("Could not infer all types in pattern!");
1209 // InstInputs - Keep track of all of the inputs of the instruction, along
1210 // with the record they are declared as.
1211 std::map<std::string, TreePatternNode*> InstInputs;
1213 // InstResults - Keep track of all the virtual registers that are 'set'
1214 // in the instruction, including what reg class they are.
1215 std::map<std::string, Record*> InstResults;
1217 std::vector<Record*> InstImpInputs;
1218 std::vector<Record*> InstImpResults;
1220 // Verify that the top-level forms in the instruction are of void type, and
1221 // fill in the InstResults map.
1222 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1223 TreePatternNode *Pat = I->getTree(j);
1224 if (Pat->getExtTypeNum(0) != MVT::isVoid)
1225 I->error("Top-level forms in instruction pattern should have"
1228 // Find inputs and outputs, and verify the structure of the uses/defs.
1229 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
1230 InstImpInputs, InstImpResults);
1233 // Now that we have inputs and outputs of the pattern, inspect the operands
1234 // list for the instruction. This determines the order that operands are
1235 // added to the machine instruction the node corresponds to.
1236 unsigned NumResults = InstResults.size();
1238 // Parse the operands list from the (ops) list, validating it.
1239 std::vector<std::string> &Args = I->getArgList();
1240 assert(Args.empty() && "Args list should still be empty here!");
1241 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1243 // Check that all of the results occur first in the list.
1244 std::vector<Record*> Results;
1245 for (unsigned i = 0; i != NumResults; ++i) {
1246 if (i == CGI.OperandList.size())
1247 I->error("'" + InstResults.begin()->first +
1248 "' set but does not appear in operand list!");
1249 const std::string &OpName = CGI.OperandList[i].Name;
1251 // Check that it exists in InstResults.
1252 Record *R = InstResults[OpName];
1254 I->error("Operand $" + OpName + " should be a set destination: all "
1255 "outputs must occur before inputs in operand list!");
1257 if (CGI.OperandList[i].Rec != R)
1258 I->error("Operand $" + OpName + " class mismatch!");
1260 // Remember the return type.
1261 Results.push_back(CGI.OperandList[i].Rec);
1263 // Okay, this one checks out.
1264 InstResults.erase(OpName);
1267 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
1268 // the copy while we're checking the inputs.
1269 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
1271 std::vector<TreePatternNode*> ResultNodeOperands;
1272 std::vector<Record*> Operands;
1273 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
1274 const std::string &OpName = CGI.OperandList[i].Name;
1276 I->error("Operand #" + utostr(i) + " in operands list has no name!");
1278 if (!InstInputsCheck.count(OpName))
1279 I->error("Operand $" + OpName +
1280 " does not appear in the instruction pattern");
1281 TreePatternNode *InVal = InstInputsCheck[OpName];
1282 InstInputsCheck.erase(OpName); // It occurred, remove from map.
1284 if (InVal->isLeaf() &&
1285 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
1286 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
1287 if (CGI.OperandList[i].Rec != InRec &&
1288 !InRec->isSubClassOf("ComplexPattern"))
1289 I->error("Operand $" + OpName +
1290 "'s register class disagrees between the operand and pattern");
1292 Operands.push_back(CGI.OperandList[i].Rec);
1294 // Construct the result for the dest-pattern operand list.
1295 TreePatternNode *OpNode = InVal->clone();
1297 // No predicate is useful on the result.
1298 OpNode->setPredicateFn("");
1300 // Promote the xform function to be an explicit node if set.
1301 if (Record *Xform = OpNode->getTransformFn()) {
1302 OpNode->setTransformFn(0);
1303 std::vector<TreePatternNode*> Children;
1304 Children.push_back(OpNode);
1305 OpNode = new TreePatternNode(Xform, Children);
1308 ResultNodeOperands.push_back(OpNode);
1311 if (!InstInputsCheck.empty())
1312 I->error("Input operand $" + InstInputsCheck.begin()->first +
1313 " occurs in pattern but not in operands list!");
1315 TreePatternNode *ResultPattern =
1316 new TreePatternNode(I->getRecord(), ResultNodeOperands);
1318 // Create and insert the instruction.
1319 DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
1320 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
1322 // Use a temporary tree pattern to infer all types and make sure that the
1323 // constructed result is correct. This depends on the instruction already
1324 // being inserted into the Instructions map.
1325 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
1326 Temp.InferAllTypes();
1328 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
1329 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
1334 // If we can, convert the instructions to be patterns that are matched!
1335 for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
1336 E = Instructions.end(); II != E; ++II) {
1337 DAGInstruction &TheInst = II->second;
1338 TreePattern *I = TheInst.getPattern();
1339 if (I == 0) continue; // No pattern.
1341 if (I->getNumTrees() != 1) {
1342 std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
1345 TreePatternNode *Pattern = I->getTree(0);
1346 TreePatternNode *SrcPattern;
1347 if (Pattern->getOperator()->getName() == "set") {
1348 if (Pattern->getNumChildren() != 2)
1349 continue; // Not a set of a single value (not handled so far)
1351 SrcPattern = Pattern->getChild(1)->clone();
1353 // Not a set (store or something?)
1354 SrcPattern = Pattern;
1358 if (!SrcPattern->canPatternMatch(Reason, *this))
1359 I->error("Instruction can never match: " + Reason);
1361 Record *Instr = II->first;
1362 TreePatternNode *DstPattern = TheInst.getResultPattern();
1364 push_back(PatternToMatch(Instr->getValueAsListInit("Predicates"),
1365 SrcPattern, DstPattern));
1369 void DAGISelEmitter::ParsePatterns() {
1370 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
1372 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1373 DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
1374 TreePattern *Pattern = new TreePattern(Patterns[i], Tree, true, *this);
1376 // Inline pattern fragments into it.
1377 Pattern->InlinePatternFragments();
1379 // Infer as many types as possible. If we cannot infer all of them, we can
1380 // never do anything with this pattern: report it to the user.
1381 if (!Pattern->InferAllTypes())
1382 Pattern->error("Could not infer all types in pattern!");
1384 // Validate that the input pattern is correct.
1386 std::map<std::string, TreePatternNode*> InstInputs;
1387 std::map<std::string, Record*> InstResults;
1388 std::vector<Record*> InstImpInputs;
1389 std::vector<Record*> InstImpResults;
1390 FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(),
1391 InstInputs, InstResults,
1392 InstImpInputs, InstImpResults);
1395 ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
1396 if (LI->getSize() == 0) continue; // no pattern.
1398 // Parse the instruction.
1399 TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
1401 // Inline pattern fragments into it.
1402 Result->InlinePatternFragments();
1404 // Infer as many types as possible. If we cannot infer all of them, we can
1405 // never do anything with this pattern: report it to the user.
1406 if (!Result->InferAllTypes())
1407 Result->error("Could not infer all types in pattern result!");
1409 if (Result->getNumTrees() != 1)
1410 Result->error("Cannot handle instructions producing instructions "
1411 "with temporaries yet!");
1414 if (!Pattern->getOnlyTree()->canPatternMatch(Reason, *this))
1415 Pattern->error("Pattern can never match: " + Reason);
1418 push_back(PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"),
1419 Pattern->getOnlyTree(),
1420 Result->getOnlyTree()));
1424 /// CombineChildVariants - Given a bunch of permutations of each child of the
1425 /// 'operator' node, put them together in all possible ways.
1426 static void CombineChildVariants(TreePatternNode *Orig,
1427 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
1428 std::vector<TreePatternNode*> &OutVariants,
1429 DAGISelEmitter &ISE) {
1430 // Make sure that each operand has at least one variant to choose from.
1431 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1432 if (ChildVariants[i].empty())
1435 // The end result is an all-pairs construction of the resultant pattern.
1436 std::vector<unsigned> Idxs;
1437 Idxs.resize(ChildVariants.size());
1438 bool NotDone = true;
1440 // Create the variant and add it to the output list.
1441 std::vector<TreePatternNode*> NewChildren;
1442 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1443 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
1444 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
1446 // Copy over properties.
1447 R->setName(Orig->getName());
1448 R->setPredicateFn(Orig->getPredicateFn());
1449 R->setTransformFn(Orig->getTransformFn());
1450 R->setTypes(Orig->getExtTypes());
1452 // If this pattern cannot every match, do not include it as a variant.
1453 std::string ErrString;
1454 if (!R->canPatternMatch(ErrString, ISE)) {
1457 bool AlreadyExists = false;
1459 // Scan to see if this pattern has already been emitted. We can get
1460 // duplication due to things like commuting:
1461 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
1462 // which are the same pattern. Ignore the dups.
1463 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
1464 if (R->isIsomorphicTo(OutVariants[i])) {
1465 AlreadyExists = true;
1472 OutVariants.push_back(R);
1475 // Increment indices to the next permutation.
1477 // Look for something we can increment without causing a wrap-around.
1478 for (unsigned IdxsIdx = 0; IdxsIdx != Idxs.size(); ++IdxsIdx) {
1479 if (++Idxs[IdxsIdx] < ChildVariants[IdxsIdx].size()) {
1480 NotDone = true; // Found something to increment.
1488 /// CombineChildVariants - A helper function for binary operators.
1490 static void CombineChildVariants(TreePatternNode *Orig,
1491 const std::vector<TreePatternNode*> &LHS,
1492 const std::vector<TreePatternNode*> &RHS,
1493 std::vector<TreePatternNode*> &OutVariants,
1494 DAGISelEmitter &ISE) {
1495 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1496 ChildVariants.push_back(LHS);
1497 ChildVariants.push_back(RHS);
1498 CombineChildVariants(Orig, ChildVariants, OutVariants, ISE);
1502 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
1503 std::vector<TreePatternNode *> &Children) {
1504 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
1505 Record *Operator = N->getOperator();
1507 // Only permit raw nodes.
1508 if (!N->getName().empty() || !N->getPredicateFn().empty() ||
1509 N->getTransformFn()) {
1510 Children.push_back(N);
1514 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
1515 Children.push_back(N->getChild(0));
1517 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
1519 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
1520 Children.push_back(N->getChild(1));
1522 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
1525 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
1526 /// the (potentially recursive) pattern by using algebraic laws.
1528 static void GenerateVariantsOf(TreePatternNode *N,
1529 std::vector<TreePatternNode*> &OutVariants,
1530 DAGISelEmitter &ISE) {
1531 // We cannot permute leaves.
1533 OutVariants.push_back(N);
1537 // Look up interesting info about the node.
1538 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1540 // If this node is associative, reassociate.
1541 if (NodeInfo.hasProperty(SDNodeInfo::SDNPAssociative)) {
1542 // Reassociate by pulling together all of the linked operators
1543 std::vector<TreePatternNode*> MaximalChildren;
1544 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
1546 // Only handle child sizes of 3. Otherwise we'll end up trying too many
1548 if (MaximalChildren.size() == 3) {
1549 // Find the variants of all of our maximal children.
1550 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
1551 GenerateVariantsOf(MaximalChildren[0], AVariants, ISE);
1552 GenerateVariantsOf(MaximalChildren[1], BVariants, ISE);
1553 GenerateVariantsOf(MaximalChildren[2], CVariants, ISE);
1555 // There are only two ways we can permute the tree:
1556 // (A op B) op C and A op (B op C)
1557 // Within these forms, we can also permute A/B/C.
1559 // Generate legal pair permutations of A/B/C.
1560 std::vector<TreePatternNode*> ABVariants;
1561 std::vector<TreePatternNode*> BAVariants;
1562 std::vector<TreePatternNode*> ACVariants;
1563 std::vector<TreePatternNode*> CAVariants;
1564 std::vector<TreePatternNode*> BCVariants;
1565 std::vector<TreePatternNode*> CBVariants;
1566 CombineChildVariants(N, AVariants, BVariants, ABVariants, ISE);
1567 CombineChildVariants(N, BVariants, AVariants, BAVariants, ISE);
1568 CombineChildVariants(N, AVariants, CVariants, ACVariants, ISE);
1569 CombineChildVariants(N, CVariants, AVariants, CAVariants, ISE);
1570 CombineChildVariants(N, BVariants, CVariants, BCVariants, ISE);
1571 CombineChildVariants(N, CVariants, BVariants, CBVariants, ISE);
1573 // Combine those into the result: (x op x) op x
1574 CombineChildVariants(N, ABVariants, CVariants, OutVariants, ISE);
1575 CombineChildVariants(N, BAVariants, CVariants, OutVariants, ISE);
1576 CombineChildVariants(N, ACVariants, BVariants, OutVariants, ISE);
1577 CombineChildVariants(N, CAVariants, BVariants, OutVariants, ISE);
1578 CombineChildVariants(N, BCVariants, AVariants, OutVariants, ISE);
1579 CombineChildVariants(N, CBVariants, AVariants, OutVariants, ISE);
1581 // Combine those into the result: x op (x op x)
1582 CombineChildVariants(N, CVariants, ABVariants, OutVariants, ISE);
1583 CombineChildVariants(N, CVariants, BAVariants, OutVariants, ISE);
1584 CombineChildVariants(N, BVariants, ACVariants, OutVariants, ISE);
1585 CombineChildVariants(N, BVariants, CAVariants, OutVariants, ISE);
1586 CombineChildVariants(N, AVariants, BCVariants, OutVariants, ISE);
1587 CombineChildVariants(N, AVariants, CBVariants, OutVariants, ISE);
1592 // Compute permutations of all children.
1593 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1594 ChildVariants.resize(N->getNumChildren());
1595 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1596 GenerateVariantsOf(N->getChild(i), ChildVariants[i], ISE);
1598 // Build all permutations based on how the children were formed.
1599 CombineChildVariants(N, ChildVariants, OutVariants, ISE);
1601 // If this node is commutative, consider the commuted order.
1602 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
1603 assert(N->getNumChildren()==2 &&"Commutative but doesn't have 2 children!");
1604 // Consider the commuted order.
1605 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
1611 // GenerateVariants - Generate variants. For example, commutative patterns can
1612 // match multiple ways. Add them to PatternsToMatch as well.
1613 void DAGISelEmitter::GenerateVariants() {
1615 DEBUG(std::cerr << "Generating instruction variants.\n");
1617 // Loop over all of the patterns we've collected, checking to see if we can
1618 // generate variants of the instruction, through the exploitation of
1619 // identities. This permits the target to provide agressive matching without
1620 // the .td file having to contain tons of variants of instructions.
1622 // Note that this loop adds new patterns to the PatternsToMatch list, but we
1623 // intentionally do not reconsider these. Any variants of added patterns have
1624 // already been added.
1626 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
1627 std::vector<TreePatternNode*> Variants;
1628 GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this);
1630 assert(!Variants.empty() && "Must create at least original variant!");
1631 Variants.erase(Variants.begin()); // Remove the original pattern.
1633 if (Variants.empty()) // No variants for this pattern.
1636 DEBUG(std::cerr << "FOUND VARIANTS OF: ";
1637 PatternsToMatch[i].getSrcPattern()->dump();
1640 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
1641 TreePatternNode *Variant = Variants[v];
1643 DEBUG(std::cerr << " VAR#" << v << ": ";
1647 // Scan to see if an instruction or explicit pattern already matches this.
1648 bool AlreadyExists = false;
1649 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
1650 // Check to see if this variant already exists.
1651 if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern())) {
1652 DEBUG(std::cerr << " *** ALREADY EXISTS, ignoring variant.\n");
1653 AlreadyExists = true;
1657 // If we already have it, ignore the variant.
1658 if (AlreadyExists) continue;
1660 // Otherwise, add it to the list of patterns we have.
1662 push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
1663 Variant, PatternsToMatch[i].getDstPattern()));
1666 DEBUG(std::cerr << "\n");
1671 // NodeIsComplexPattern - return true if N is a leaf node and a subclass of
1673 static bool NodeIsComplexPattern(TreePatternNode *N)
1675 return (N->isLeaf() &&
1676 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1677 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1678 isSubClassOf("ComplexPattern"));
1681 // NodeGetComplexPattern - return the pointer to the ComplexPattern if N
1682 // is a leaf node and a subclass of ComplexPattern, else it returns NULL.
1683 static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
1684 DAGISelEmitter &ISE)
1687 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1688 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1689 isSubClassOf("ComplexPattern")) {
1690 return &ISE.getComplexPattern(static_cast<DefInit*>(N->getLeafValue())
1696 /// getPatternSize - Return the 'size' of this pattern. We want to match large
1697 /// patterns before small ones. This is used to determine the size of a
1699 static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
1700 assert(isExtIntegerInVTs(P->getExtTypes()) ||
1701 isExtFloatingPointInVTs(P->getExtTypes()) ||
1702 P->getExtTypeNum(0) == MVT::isVoid ||
1703 P->getExtTypeNum(0) == MVT::Flag &&
1704 "Not a valid pattern node to size!");
1705 unsigned Size = 2; // The node itself.
1707 // FIXME: This is a hack to statically increase the priority of patterns
1708 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
1709 // Later we can allow complexity / cost for each pattern to be (optionally)
1710 // specified. To get best possible pattern match we'll need to dynamically
1711 // calculate the complexity of all patterns a dag can potentially map to.
1712 const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
1714 Size += AM->getNumOperands() * 2;
1716 // Count children in the count if they are also nodes.
1717 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
1718 TreePatternNode *Child = P->getChild(i);
1719 if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
1720 Size += getPatternSize(Child, ISE);
1721 else if (Child->isLeaf()) {
1722 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
1723 Size += 3; // Matches a ConstantSDNode.
1724 else if (NodeIsComplexPattern(Child))
1725 Size += getPatternSize(Child, ISE);
1732 /// getResultPatternCost - Compute the number of instructions for this pattern.
1733 /// This is a temporary hack. We should really include the instruction
1734 /// latencies in this calculation.
1735 static unsigned getResultPatternCost(TreePatternNode *P) {
1736 if (P->isLeaf()) return 0;
1738 unsigned Cost = P->getOperator()->isSubClassOf("Instruction");
1739 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
1740 Cost += getResultPatternCost(P->getChild(i));
1744 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
1745 // In particular, we want to match maximal patterns first and lowest cost within
1746 // a particular complexity first.
1747 struct PatternSortingPredicate {
1748 PatternSortingPredicate(DAGISelEmitter &ise) : ISE(ise) {};
1749 DAGISelEmitter &ISE;
1751 bool operator()(PatternToMatch *LHS,
1752 PatternToMatch *RHS) {
1753 unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), ISE);
1754 unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), ISE);
1755 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
1756 if (LHSSize < RHSSize) return false;
1758 // If the patterns have equal complexity, compare generated instruction cost
1759 return getResultPatternCost(LHS->getDstPattern()) <
1760 getResultPatternCost(RHS->getDstPattern());
1764 /// getRegisterValueType - Look up and return the first ValueType of specified
1765 /// RegisterClass record
1766 static MVT::ValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
1767 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
1768 return RC->getValueTypeNum(0);
1773 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
1774 /// type information from it.
1775 static void RemoveAllTypes(TreePatternNode *N) {
1778 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1779 RemoveAllTypes(N->getChild(i));
1782 Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
1783 Record *N = Records.getDef(Name);
1784 assert(N && N->isSubClassOf("SDNode") && "Bad argument");
1788 /// NodeHasProperty - return true if TreePatternNode has the specified
1790 static bool NodeHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
1791 DAGISelEmitter &ISE)
1793 if (N->isLeaf()) return false;
1794 Record *Operator = N->getOperator();
1795 if (!Operator->isSubClassOf("SDNode")) return false;
1797 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(Operator);
1798 return NodeInfo.hasProperty(Property);
1801 static bool PatternHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
1802 DAGISelEmitter &ISE)
1804 if (NodeHasProperty(N, Property, ISE))
1807 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
1808 TreePatternNode *Child = N->getChild(i);
1809 if (PatternHasProperty(Child, Property, ISE))
1816 class PatternCodeEmitter {
1818 DAGISelEmitter &ISE;
1821 ListInit *Predicates;
1822 // Instruction selector pattern.
1823 TreePatternNode *Pattern;
1824 // Matched instruction.
1825 TreePatternNode *Instruction;
1828 // Node to name mapping
1829 std::map<std::string, std::string> VariableMap;
1830 // Node to operator mapping
1831 std::map<std::string, Record*> OperatorMap;
1832 // Names of all the folded nodes which produce chains.
1833 std::vector<std::pair<std::string, unsigned> > FoldedChains;
1837 PatternCodeEmitter(DAGISelEmitter &ise, ListInit *preds,
1838 TreePatternNode *pattern, TreePatternNode *instr,
1839 unsigned PatNum, std::ostream &os) :
1840 ISE(ise), Predicates(preds), Pattern(pattern), Instruction(instr),
1841 PatternNo(PatNum), OS(os), TmpNo(0) {}
1843 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
1844 /// if the match fails. At this point, we already know that the opcode for N
1845 /// matches, and the SDNode for the result has the RootName specified name.
1846 void EmitMatchCode(TreePatternNode *N, const std::string &RootName,
1847 bool &FoundChain, bool isRoot = false) {
1849 // Emit instruction predicates. Each predicate is just a string for now.
1851 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
1852 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
1853 Record *Def = Pred->getDef();
1854 if (Def->isSubClassOf("Predicate")) {
1859 OS << "!(" << Def->getValueAsString("CondString") << ")";
1861 OS << ") goto P" << PatternNo << "Fail;\n";
1864 assert(0 && "Unknown predicate type!");
1871 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
1872 OS << " if (cast<ConstantSDNode>(" << RootName
1873 << ")->getSignExtended() != " << II->getValue() << ")\n"
1874 << " goto P" << PatternNo << "Fail;\n";
1876 } else if (!NodeIsComplexPattern(N)) {
1877 assert(0 && "Cannot match this as a leaf value!");
1882 // If this node has a name associated with it, capture it in VariableMap. If
1883 // we already saw this in the pattern, emit code to verify dagness.
1884 if (!N->getName().empty()) {
1885 std::string &VarMapEntry = VariableMap[N->getName()];
1886 if (VarMapEntry.empty()) {
1887 VarMapEntry = RootName;
1889 // If we get here, this is a second reference to a specific name. Since
1890 // we already have checked that the first reference is valid, we don't
1891 // have to recursively match it, just check that it's the same as the
1892 // previously named thing.
1893 OS << " if (" << VarMapEntry << " != " << RootName
1894 << ") goto P" << PatternNo << "Fail;\n";
1899 OperatorMap[N->getName()] = N->getOperator();
1903 // Emit code to load the child nodes and match their contents recursively.
1905 bool HasChain = NodeHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
1909 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
1910 OS << " if (!" << RootName << ".hasOneUse()) goto P"
1911 << PatternNo << "Fail; // Multiple uses of actual result?\n";
1912 OS << " if (CodeGenMap.count(" << RootName
1913 << ".getValue(" << CInfo.getNumResults() << "))) goto P"
1914 << PatternNo << "Fail; // Already selected for a chain use?\n";
1917 OS << " SDOperand Chain = " << RootName << ".getOperand(0);\n";
1922 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
1923 OS << " SDOperand " << RootName << OpNo << " = "
1924 << RootName << ".getOperand(" << OpNo << ");\n";
1925 TreePatternNode *Child = N->getChild(i);
1927 if (!Child->isLeaf()) {
1928 // If it's not a leaf, recursively match.
1929 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(Child->getOperator());
1930 OS << " if (" << RootName << OpNo << ".getOpcode() != "
1931 << CInfo.getEnumName() << ") goto P" << PatternNo << "Fail;\n";
1932 EmitMatchCode(Child, RootName + utostr(OpNo), FoundChain);
1933 if (NodeHasProperty(Child, SDNodeInfo::SDNPHasChain, ISE)) {
1934 FoldedChains.push_back(std::make_pair(RootName + utostr(OpNo),
1935 CInfo.getNumResults()));
1938 // If this child has a name associated with it, capture it in VarMap. If
1939 // we already saw this in the pattern, emit code to verify dagness.
1940 if (!Child->getName().empty()) {
1941 std::string &VarMapEntry = VariableMap[Child->getName()];
1942 if (VarMapEntry.empty()) {
1943 VarMapEntry = RootName + utostr(OpNo);
1945 // If we get here, this is a second reference to a specific name. Since
1946 // we already have checked that the first reference is valid, we don't
1947 // have to recursively match it, just check that it's the same as the
1948 // previously named thing.
1949 OS << " if (" << VarMapEntry << " != " << RootName << OpNo
1950 << ") goto P" << PatternNo << "Fail;\n";
1955 // Handle leaves of various types.
1956 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
1957 Record *LeafRec = DI->getDef();
1958 if (LeafRec->isSubClassOf("RegisterClass")) {
1959 // Handle register references. Nothing to do here.
1960 } else if (LeafRec->isSubClassOf("Register")) {
1961 // Handle register references.
1962 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
1963 // Handle complex pattern. Nothing to do here.
1964 } else if (LeafRec->getName() == "srcvalue") {
1965 // Place holder for SRCVALUE nodes. Nothing to do here.
1966 } else if (LeafRec->isSubClassOf("ValueType")) {
1967 // Make sure this is the specified value type.
1968 OS << " if (cast<VTSDNode>(" << RootName << OpNo << ")->getVT() != "
1969 << "MVT::" << LeafRec->getName() << ") goto P" << PatternNo
1971 } else if (LeafRec->isSubClassOf("CondCode")) {
1972 // Make sure this is the specified cond code.
1973 OS << " if (cast<CondCodeSDNode>(" << RootName << OpNo
1974 << ")->get() != " << "ISD::" << LeafRec->getName()
1975 << ") goto P" << PatternNo << "Fail;\n";
1979 assert(0 && "Unknown leaf type!");
1981 } else if (IntInit *II = dynamic_cast<IntInit*>(Child->getLeafValue())) {
1982 OS << " if (!isa<ConstantSDNode>(" << RootName << OpNo << ") ||\n"
1983 << " cast<ConstantSDNode>(" << RootName << OpNo
1984 << ")->getSignExtended() != " << II->getValue() << ")\n"
1985 << " goto P" << PatternNo << "Fail;\n";
1988 assert(0 && "Unknown leaf type!");
1993 // If there is a node predicate for this, emit the call.
1994 if (!N->getPredicateFn().empty())
1995 OS << " if (!" << N->getPredicateFn() << "(" << RootName
1996 << ".Val)) goto P" << PatternNo << "Fail;\n";
1999 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
2000 /// we actually have to build a DAG!
2001 std::pair<unsigned, unsigned>
2002 EmitResultCode(TreePatternNode *N, bool isRoot = false) {
2003 // This is something selected from the pattern we matched.
2004 if (!N->getName().empty()) {
2005 assert(!isRoot && "Root of pattern cannot be a leaf!");
2006 std::string &Val = VariableMap[N->getName()];
2007 assert(!Val.empty() &&
2008 "Variable referenced but not defined and not caught earlier!");
2009 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
2010 // Already selected this operand, just return the tmpval.
2011 return std::make_pair(1, atoi(Val.c_str()+3));
2014 const ComplexPattern *CP;
2015 unsigned ResNo = TmpNo++;
2016 unsigned NumRes = 1;
2017 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
2018 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2019 switch (N->getTypeNum(0)) {
2020 default: assert(0 && "Unknown type for constant node!");
2021 case MVT::i1: OS << " bool Tmp"; break;
2022 case MVT::i8: OS << " unsigned char Tmp"; break;
2023 case MVT::i16: OS << " unsigned short Tmp"; break;
2024 case MVT::i32: OS << " unsigned Tmp"; break;
2025 case MVT::i64: OS << " uint64_t Tmp"; break;
2027 OS << ResNo << "C = cast<ConstantSDNode>(" << Val << ")->getValue();\n";
2028 OS << " SDOperand Tmp" << utostr(ResNo)
2029 << " = CurDAG->getTargetConstant(Tmp"
2030 << ResNo << "C, MVT::" << getEnumName(N->getTypeNum(0)) << ");\n";
2031 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2032 Record *Op = OperatorMap[N->getName()];
2033 // Transform ExternalSymbol to TargetExternalSymbol
2034 if (Op && Op->getName() == "externalsym") {
2035 OS << " SDOperand Tmp" << ResNo
2036 << " = CurDAG->getTargetExternalSymbol(cast<ExternalSymbolSDNode>("
2037 << Val << ")->getSymbol(), MVT::" << getEnumName(N->getTypeNum(0))
2040 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
2041 } else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") {
2042 Record *Op = OperatorMap[N->getName()];
2043 // Transform GlobalAddress to TargetGlobalAddress
2044 if (Op && Op->getName() == "globaladdr") {
2045 OS << " SDOperand Tmp" << ResNo
2046 << " = CurDAG->getTargetGlobalAddress(cast<GlobalAddressSDNode>("
2047 << Val << ")->getGlobal(), MVT::" << getEnumName(N->getTypeNum(0))
2050 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
2051 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2052 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
2053 } else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") {
2054 OS << " SDOperand Tmp" << ResNo << " = " << Val << ";\n";
2055 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, ISE))) {
2056 std::string Fn = CP->getSelectFunc();
2057 NumRes = CP->getNumOperands();
2058 OS << " SDOperand ";
2059 for (unsigned i = 0; i < NumRes - 1; ++i)
2060 OS << "Tmp" << (i+ResNo) << ",";
2061 OS << "Tmp" << (NumRes - 1 + ResNo) << ";\n";
2063 OS << " if (!" << Fn << "(" << Val;
2064 for (unsigned i = 0; i < NumRes; i++)
2065 OS << ", Tmp" << i + ResNo;
2066 OS << ")) goto P" << PatternNo << "Fail;\n";
2067 TmpNo = ResNo + NumRes;
2069 OS << " SDOperand Tmp" << ResNo << " = Select(" << Val << ");\n";
2071 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
2072 // value if used multiple times by this pattern result.
2073 Val = "Tmp"+utostr(ResNo);
2074 return std::make_pair(NumRes, ResNo);
2078 // If this is an explicit register reference, handle it.
2079 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
2080 unsigned ResNo = TmpNo++;
2081 if (DI->getDef()->isSubClassOf("Register")) {
2082 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getRegister("
2083 << ISE.getQualifiedName(DI->getDef()) << ", MVT::"
2084 << getEnumName(N->getTypeNum(0))
2086 return std::make_pair(1, ResNo);
2088 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2089 unsigned ResNo = TmpNo++;
2090 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2091 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetConstant("
2092 << II->getValue() << ", MVT::"
2093 << getEnumName(N->getTypeNum(0))
2095 return std::make_pair(1, ResNo);
2099 assert(0 && "Unknown leaf type!");
2100 return std::make_pair(1, ~0U);
2103 Record *Op = N->getOperator();
2104 if (Op->isSubClassOf("Instruction")) {
2105 const CodeGenTarget &CGT = ISE.getTargetInfo();
2106 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
2107 const DAGInstruction &Inst = ISE.getInstruction(Op);
2108 bool HasImpInputs = Inst.getNumImpOperands() > 0;
2109 bool HasImpResults = Inst.getNumImpResults() > 0;
2110 bool HasOptInFlag = isRoot &&
2111 NodeHasProperty(Pattern, SDNodeInfo::SDNPOptInFlag, ISE);
2112 bool HasInFlag = isRoot &&
2113 NodeHasProperty(Pattern, SDNodeInfo::SDNPInFlag, ISE);
2114 bool HasOutFlag = HasImpResults ||
2115 (isRoot && PatternHasProperty(Pattern, SDNodeInfo::SDNPOutFlag, ISE));
2116 bool HasChain = II.hasCtrlDep ||
2117 (isRoot && PatternHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE));
2119 if (HasOutFlag || HasInFlag || HasOptInFlag || HasImpInputs)
2120 OS << " SDOperand InFlag = SDOperand(0, 0);\n";
2122 // Determine operand emission order. Complex pattern first.
2123 std::vector<std::pair<unsigned, TreePatternNode*> > EmitOrder;
2124 std::vector<std::pair<unsigned, TreePatternNode*> >::iterator OI;
2125 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2126 TreePatternNode *Child = N->getChild(i);
2128 EmitOrder.push_back(std::make_pair(i, Child));
2129 OI = EmitOrder.begin();
2130 } else if (NodeIsComplexPattern(Child)) {
2131 OI = EmitOrder.insert(OI, std::make_pair(i, Child));
2133 EmitOrder.push_back(std::make_pair(i, Child));
2137 // Emit all of the operands.
2138 std::vector<std::pair<unsigned, unsigned> > NumTemps(EmitOrder.size());
2139 for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) {
2140 unsigned OpOrder = EmitOrder[i].first;
2141 TreePatternNode *Child = EmitOrder[i].second;
2142 std::pair<unsigned, unsigned> NumTemp = EmitResultCode(Child);
2143 NumTemps[OpOrder] = NumTemp;
2146 // List all the operands in the right order.
2147 std::vector<unsigned> Ops;
2148 for (unsigned i = 0, e = NumTemps.size(); i != e; i++) {
2149 for (unsigned j = 0; j < NumTemps[i].first; j++)
2150 Ops.push_back(NumTemps[i].second + j);
2153 // Emit all the chain and CopyToReg stuff.
2154 bool ChainEmitted = HasChain;
2156 OS << " Chain = Select(Chain);\n";
2158 EmitCopyToRegs(Pattern, "N", ChainEmitted, true);
2159 if (HasInFlag || HasOptInFlag) {
2160 unsigned FlagNo = (unsigned) HasChain + Pattern->getNumChildren();
2162 OS << " if (N.getNumOperands() == " << FlagNo+1 << ") ";
2165 OS << "InFlag = Select(N.getOperand(" << FlagNo << "));\n";
2168 unsigned NumResults = Inst.getNumResults();
2169 unsigned ResNo = TmpNo++;
2171 OS << " SDOperand Tmp" << ResNo << " = CurDAG->getTargetNode("
2172 << II.Namespace << "::" << II.TheDef->getName();
2173 if (N->getTypeNum(0) != MVT::isVoid)
2174 OS << ", MVT::" << getEnumName(N->getTypeNum(0));
2176 OS << ", MVT::Flag";
2178 unsigned LastOp = 0;
2179 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
2181 OS << ", Tmp" << LastOp;
2185 // Must have at least one result
2186 OS << " Chain = Tmp" << LastOp << ".getValue("
2187 << NumResults << ");\n";
2189 } else if (HasChain || HasOutFlag) {
2190 OS << " SDOperand Result = CurDAG->getTargetNode("
2191 << II.Namespace << "::" << II.TheDef->getName();
2193 // Output order: results, chain, flags
2195 if (NumResults > 0) {
2196 if (N->getTypeNum(0) != MVT::isVoid)
2197 OS << ", MVT::" << getEnumName(N->getTypeNum(0));
2200 OS << ", MVT::Other";
2202 OS << ", MVT::Flag";
2205 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2206 OS << ", Tmp" << Ops[i];
2207 if (HasChain) OS << ", Chain";
2208 if (HasInFlag || HasImpInputs) OS << ", InFlag";
2212 for (unsigned i = 0; i < NumResults; i++) {
2213 OS << " CodeGenMap[N.getValue(" << ValNo << ")] = Result"
2214 << ".getValue(" << ValNo << ");\n";
2219 OS << " Chain = Result.getValue(" << ValNo << ");\n";
2222 OS << " InFlag = Result.getValue("
2223 << ValNo + (unsigned)HasChain << ");\n";
2225 if (HasImpResults) {
2226 if (EmitCopyFromRegs(N, ChainEmitted)) {
2227 OS << " CodeGenMap[N.getValue(" << ValNo << ")] = "
2228 << "Result.getValue(" << ValNo << ");\n";
2233 // User does not expect that the instruction produces a chain!
2235 NodeHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE);
2236 bool AddedChain = HasChain && !NodeHasChain;
2238 OS << " CodeGenMap[N.getValue(" << ValNo++ << ")] = Chain;\n";
2240 if (FoldedChains.size() > 0) {
2242 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
2243 OS << "CodeGenMap[" << FoldedChains[j].first << ".getValue("
2244 << FoldedChains[j].second << ")] = ";
2249 OS << " CodeGenMap[N.getValue(" << ValNo << ")] = InFlag;\n";
2251 if (AddedChain && HasOutFlag) {
2252 if (NumResults == 0) {
2253 OS << " return Result.getValue(N.ResNo+1);\n";
2255 OS << " if (N.ResNo < " << NumResults << ")\n";
2256 OS << " return Result.getValue(N.ResNo);\n";
2258 OS << " return Result.getValue(N.ResNo+1);\n";
2261 OS << " return Result.getValue(N.ResNo);\n";
2264 // If this instruction is the root, and if there is only one use of it,
2265 // use SelectNodeTo instead of getTargetNode to avoid an allocation.
2266 OS << " if (N.Val->hasOneUse()) {\n";
2267 OS << " return CurDAG->SelectNodeTo(N.Val, "
2268 << II.Namespace << "::" << II.TheDef->getName();
2269 if (N->getTypeNum(0) != MVT::isVoid)
2270 OS << ", MVT::" << getEnumName(N->getTypeNum(0));
2272 OS << ", MVT::Flag";
2273 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2274 OS << ", Tmp" << Ops[i];
2275 if (HasInFlag || HasImpInputs)
2278 OS << " } else {\n";
2279 OS << " return CodeGenMap[N] = CurDAG->getTargetNode("
2280 << II.Namespace << "::" << II.TheDef->getName();
2281 if (N->getTypeNum(0) != MVT::isVoid)
2282 OS << ", MVT::" << getEnumName(N->getTypeNum(0));
2284 OS << ", MVT::Flag";
2285 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2286 OS << ", Tmp" << Ops[i];
2287 if (HasInFlag || HasImpInputs)
2293 return std::make_pair(1, ResNo);
2294 } else if (Op->isSubClassOf("SDNodeXForm")) {
2295 assert(N->getNumChildren() == 1 && "node xform should have one child!");
2296 unsigned OpVal = EmitResultCode(N->getChild(0)).second;
2297 unsigned ResNo = TmpNo++;
2298 OS << " SDOperand Tmp" << ResNo << " = Transform_" << Op->getName()
2299 << "(Tmp" << OpVal << ".Val);\n";
2301 OS << " CodeGenMap[N] = Tmp" << ResNo << ";\n";
2302 OS << " return Tmp" << ResNo << ";\n";
2304 return std::make_pair(1, ResNo);
2308 throw std::string("Unknown node in result pattern!");
2312 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat' and
2313 /// add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
2314 /// 'Pat' may be missing types. If we find an unresolved type to add a check
2315 /// for, this returns true otherwise false if Pat has all types.
2316 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
2317 const std::string &Prefix) {
2319 if (!Pat->hasTypeSet()) {
2320 // Move a type over from 'other' to 'pat'.
2321 Pat->setTypes(Other->getExtTypes());
2322 OS << " if (" << Prefix << ".Val->getValueType(0) != MVT::"
2323 << getName(Pat->getTypeNum(0)) << ") goto P" << PatternNo << "Fail;\n";
2328 (unsigned) NodeHasProperty(Pat, SDNodeInfo::SDNPHasChain, ISE);
2329 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
2330 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
2331 Prefix + utostr(OpNo)))
2337 /// EmitCopyToRegs - Emit the flag operands for the DAG that is
2339 void EmitCopyToRegs(TreePatternNode *N, const std::string &RootName,
2340 bool &ChainEmitted, bool isRoot = false) {
2341 const CodeGenTarget &T = ISE.getTargetInfo();
2343 (unsigned) NodeHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
2344 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2345 TreePatternNode *Child = N->getChild(i);
2346 if (!Child->isLeaf()) {
2347 EmitCopyToRegs(Child, RootName + utostr(OpNo), ChainEmitted);
2349 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2350 Record *RR = DI->getDef();
2351 if (RR->isSubClassOf("Register")) {
2352 MVT::ValueType RVT = getRegisterValueType(RR, T);
2353 if (RVT == MVT::Flag) {
2354 OS << " InFlag = Select(" << RootName << OpNo << ");\n";
2356 if (!ChainEmitted) {
2357 OS << " SDOperand Chain = CurDAG->getEntryNode();\n";
2358 ChainEmitted = true;
2360 OS << " SDOperand " << RootName << "CR" << i << ";\n";
2361 OS << " " << RootName << "CR" << i
2362 << " = CurDAG->getCopyToReg(Chain, CurDAG->getRegister("
2363 << ISE.getQualifiedName(RR) << ", MVT::"
2364 << getEnumName(RVT) << ")"
2365 << ", Select(" << RootName << OpNo << "), InFlag);\n";
2366 OS << " Chain = " << RootName << "CR" << i
2367 << ".getValue(0);\n";
2368 OS << " InFlag = " << RootName << "CR" << i
2369 << ".getValue(1);\n";
2377 /// EmitCopyFromRegs - Emit code to copy result to physical registers
2378 /// as specified by the instruction. It returns true if any copy is
2380 bool EmitCopyFromRegs(TreePatternNode *N, bool &ChainEmitted) {
2381 bool RetVal = false;
2382 Record *Op = N->getOperator();
2383 if (Op->isSubClassOf("Instruction")) {
2384 const DAGInstruction &Inst = ISE.getInstruction(Op);
2385 const CodeGenTarget &CGT = ISE.getTargetInfo();
2386 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
2387 unsigned NumImpResults = Inst.getNumImpResults();
2388 for (unsigned i = 0; i < NumImpResults; i++) {
2389 Record *RR = Inst.getImpResult(i);
2390 if (RR->isSubClassOf("Register")) {
2391 MVT::ValueType RVT = getRegisterValueType(RR, CGT);
2392 if (RVT != MVT::Flag) {
2393 if (!ChainEmitted) {
2394 OS << " SDOperand Chain = CurDAG->getEntryNode();\n";
2395 ChainEmitted = true;
2397 OS << " Result = CurDAG->getCopyFromReg(Chain, "
2398 << ISE.getQualifiedName(RR)
2399 << ", MVT::" << getEnumName(RVT) << ", InFlag);\n";
2400 OS << " Chain = Result.getValue(1);\n";
2401 OS << " InFlag = Result.getValue(2);\n";
2411 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
2412 /// stream to match the pattern, and generate the code for the match if it
2414 void DAGISelEmitter::EmitCodeForPattern(PatternToMatch &Pattern,
2416 static unsigned PatternCount = 0;
2417 unsigned PatternNo = PatternCount++;
2418 OS << " { // Pattern #" << PatternNo << ": ";
2419 Pattern.getSrcPattern()->print(OS);
2420 OS << "\n // Emits: ";
2421 Pattern.getDstPattern()->print(OS);
2423 OS << " // Pattern complexity = "
2424 << getPatternSize(Pattern.getSrcPattern(), *this)
2426 << getResultPatternCost(Pattern.getDstPattern()) << "\n";
2428 PatternCodeEmitter Emitter(*this, Pattern.getPredicates(),
2429 Pattern.getSrcPattern(), Pattern.getDstPattern(),
2432 // Emit the matcher, capturing named arguments in VariableMap.
2433 bool FoundChain = false;
2434 Emitter.EmitMatchCode(Pattern.getSrcPattern(), "N", FoundChain,
2437 // TP - Get *SOME* tree pattern, we don't care which.
2438 TreePattern &TP = *PatternFragments.begin()->second;
2440 // At this point, we know that we structurally match the pattern, but the
2441 // types of the nodes may not match. Figure out the fewest number of type
2442 // comparisons we need to emit. For example, if there is only one integer
2443 // type supported by a target, there should be no type comparisons at all for
2444 // integer patterns!
2446 // To figure out the fewest number of type checks needed, clone the pattern,
2447 // remove the types, then perform type inference on the pattern as a whole.
2448 // If there are unresolved types, emit an explicit check for those types,
2449 // apply the type to the tree, then rerun type inference. Iterate until all
2450 // types are resolved.
2452 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
2453 RemoveAllTypes(Pat);
2456 // Resolve/propagate as many types as possible.
2458 bool MadeChange = true;
2460 MadeChange = Pat->ApplyTypeConstraints(TP,true/*Ignore reg constraints*/);
2462 assert(0 && "Error: could not find consistent types for something we"
2463 " already decided was ok!");
2467 // Insert a check for an unresolved type and add it to the tree. If we find
2468 // an unresolved type to add a check for, this returns true and we iterate,
2469 // otherwise we are done.
2470 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N"));
2472 Emitter.EmitResultCode(Pattern.getDstPattern(), true /*the root*/);
2476 OS << " }\n P" << PatternNo << "Fail:\n";
2481 /// CompareByRecordName - An ordering predicate that implements less-than by
2482 /// comparing the names records.
2483 struct CompareByRecordName {
2484 bool operator()(const Record *LHS, const Record *RHS) const {
2485 // Sort by name first.
2486 if (LHS->getName() < RHS->getName()) return true;
2487 // If both names are equal, sort by pointer.
2488 return LHS->getName() == RHS->getName() && LHS < RHS;
2493 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
2494 std::string InstNS = Target.inst_begin()->second.Namespace;
2495 if (!InstNS.empty()) InstNS += "::";
2497 // Group the patterns by their top-level opcodes.
2498 std::map<Record*, std::vector<PatternToMatch*>,
2499 CompareByRecordName> PatternsByOpcode;
2500 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2501 TreePatternNode *Node = PatternsToMatch[i].getSrcPattern();
2502 if (!Node->isLeaf()) {
2503 PatternsByOpcode[Node->getOperator()].push_back(&PatternsToMatch[i]);
2505 const ComplexPattern *CP;
2507 dynamic_cast<IntInit*>(Node->getLeafValue())) {
2508 PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
2509 } else if ((CP = NodeGetComplexPattern(Node, *this))) {
2510 std::vector<Record*> OpNodes = CP->getRootNodes();
2511 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
2512 PatternsByOpcode[OpNodes[j]].insert(PatternsByOpcode[OpNodes[j]].begin(),
2513 &PatternsToMatch[i]);
2516 std::cerr << "Unrecognized opcode '";
2518 std::cerr << "' on tree pattern '";
2519 std::cerr << PatternsToMatch[i].getDstPattern()->getOperator()->getName();
2520 std::cerr << "'!\n";
2526 // Emit one Select_* method for each top-level opcode. We do this instead of
2527 // emitting one giant switch statement to support compilers where this will
2528 // result in the recursive functions taking less stack space.
2529 for (std::map<Record*, std::vector<PatternToMatch*>,
2530 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
2531 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
2532 OS << "SDOperand Select_" << PBOI->first->getName() << "(SDOperand N) {\n";
2534 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
2535 std::vector<PatternToMatch*> &Patterns = PBOI->second;
2537 // We want to emit all of the matching code now. However, we want to emit
2538 // the matches in order of minimal cost. Sort the patterns so the least
2539 // cost one is at the start.
2540 std::stable_sort(Patterns.begin(), Patterns.end(),
2541 PatternSortingPredicate(*this));
2543 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
2544 EmitCodeForPattern(*Patterns[i], OS);
2546 OS << " std::cerr << \"Cannot yet select: \";\n"
2547 << " N.Val->dump(CurDAG);\n"
2548 << " std::cerr << '\\n';\n"
2553 // Emit boilerplate.
2554 OS << "// The main instruction selector code.\n"
2555 << "SDOperand SelectCode(SDOperand N) {\n"
2556 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
2557 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
2558 << "INSTRUCTION_LIST_END))\n"
2559 << " return N; // Already selected.\n\n"
2560 << " std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);\n"
2561 << " if (CGMI != CodeGenMap.end()) return CGMI->second;\n"
2562 << " switch (N.getOpcode()) {\n"
2563 << " default: break;\n"
2564 << " case ISD::EntryToken: // These leaves remain the same.\n"
2565 << " case ISD::BasicBlock:\n"
2566 << " case ISD::Register:\n"
2568 << " case ISD::AssertSext:\n"
2569 << " case ISD::AssertZext: {\n"
2570 << " SDOperand Tmp0 = Select(N.getOperand(0));\n"
2571 << " if (!N.Val->hasOneUse()) CodeGenMap[N] = Tmp0;\n"
2572 << " return Tmp0;\n"
2574 << " case ISD::TokenFactor:\n"
2575 << " if (N.getNumOperands() == 2) {\n"
2576 << " SDOperand Op0 = Select(N.getOperand(0));\n"
2577 << " SDOperand Op1 = Select(N.getOperand(1));\n"
2578 << " return CodeGenMap[N] =\n"
2579 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);\n"
2581 << " std::vector<SDOperand> Ops;\n"
2582 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)\n"
2583 << " Ops.push_back(Select(N.getOperand(i)));\n"
2584 << " return CodeGenMap[N] = \n"
2585 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
2587 << " case ISD::CopyFromReg: {\n"
2588 << " SDOperand Chain = Select(N.getOperand(0));\n"
2589 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
2590 << " MVT::ValueType VT = N.Val->getValueType(0);\n"
2591 << " if (N.Val->getNumValues() == 2) {\n"
2592 << " if (Chain == N.getOperand(0)) return N; // No change\n"
2593 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT);\n"
2594 << " CodeGenMap[N.getValue(0)] = New;\n"
2595 << " CodeGenMap[N.getValue(1)] = New.getValue(1);\n"
2596 << " return New.getValue(N.ResNo);\n"
2598 << " SDOperand Flag(0, 0);\n"
2599 << " if (N.getNumOperands() == 3) Flag = Select(N.getOperand(2));\n"
2600 << " if (Chain == N.getOperand(0) &&\n"
2601 << " (N.getNumOperands() == 2 || Flag == N.getOperand(2)))\n"
2602 << " return N; // No change\n"
2603 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT, Flag);\n"
2604 << " CodeGenMap[N.getValue(0)] = New;\n"
2605 << " CodeGenMap[N.getValue(1)] = New.getValue(1);\n"
2606 << " CodeGenMap[N.getValue(2)] = New.getValue(2);\n"
2607 << " return New.getValue(N.ResNo);\n"
2610 << " case ISD::CopyToReg: {\n"
2611 << " SDOperand Chain = Select(N.getOperand(0));\n"
2612 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
2613 << " SDOperand Val = Select(N.getOperand(2));\n"
2614 << " SDOperand Result = N;\n"
2615 << " if (N.Val->getNumValues() == 1) {\n"
2616 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2))\n"
2617 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val);\n"
2618 << " return CodeGenMap[N] = Result;\n"
2620 << " SDOperand Flag(0, 0);\n"
2621 << " if (N.getNumOperands() == 4) Flag = Select(N.getOperand(3));\n"
2622 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2) ||\n"
2623 << " (N.getNumOperands() == 4 && Flag != N.getOperand(3)))\n"
2624 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val, Flag);\n"
2625 << " CodeGenMap[N.getValue(0)] = Result;\n"
2626 << " CodeGenMap[N.getValue(1)] = Result.getValue(1);\n"
2627 << " return Result.getValue(N.ResNo);\n"
2631 // Loop over all of the case statements, emiting a call to each method we
2633 for (std::map<Record*, std::vector<PatternToMatch*>,
2634 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
2635 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
2636 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
2637 OS << " case " << OpcodeInfo.getEnumName() << ": "
2638 << std::string(std::max(0, int(24-OpcodeInfo.getEnumName().size())), ' ')
2639 << "return Select_" << PBOI->first->getName() << "(N);\n";
2642 OS << " } // end of big switch.\n\n"
2643 << " std::cerr << \"Cannot yet select: \";\n"
2644 << " N.Val->dump(CurDAG);\n"
2645 << " std::cerr << '\\n';\n"
2650 void DAGISelEmitter::run(std::ostream &OS) {
2651 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
2654 OS << "// *** NOTE: This file is #included into the middle of the target\n"
2655 << "// *** instruction selector class. These functions are really "
2658 OS << "// Instance var to keep track of multiply used nodes that have \n"
2659 << "// already been selected.\n"
2660 << "std::map<SDOperand, SDOperand> CodeGenMap;\n";
2663 ParseNodeTransforms(OS);
2664 ParseComplexPatterns();
2665 ParsePatternFragments(OS);
2666 ParseInstructions();
2669 // Generate variants. For example, commutative patterns can match
2670 // multiple ways. Add them to PatternsToMatch as well.
2674 DEBUG(std::cerr << "\n\nALL PATTERNS TO MATCH:\n\n";
2675 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2676 std::cerr << "PATTERN: "; PatternsToMatch[i].getSrcPattern()->dump();
2677 std::cerr << "\nRESULT: ";PatternsToMatch[i].getDstPattern()->dump();
2681 // At this point, we have full information about the 'Patterns' we need to
2682 // parse, both implicitly from instructions as well as from explicit pattern
2683 // definitions. Emit the resultant instruction selector.
2684 EmitInstructionSelector(OS);
2686 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
2687 E = PatternFragments.end(); I != E; ++I)
2689 PatternFragments.clear();
2691 Instructions.clear();