1 //===- DAGISelEmitter.cpp - Generate an instruction selector --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Chris Lattner and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This tablegen backend emits a DAG instruction selector.
12 //===----------------------------------------------------------------------===//
14 #include "DAGISelEmitter.h"
16 #include "llvm/ADT/StringExtras.h"
17 #include "llvm/Support/Debug.h"
22 //===----------------------------------------------------------------------===//
23 // Helpers for working with extended types.
25 /// FilterVTs - Filter a list of VT's according to a predicate.
28 static std::vector<MVT::ValueType>
29 FilterVTs(const std::vector<MVT::ValueType> &InVTs, T Filter) {
30 std::vector<MVT::ValueType> Result;
31 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
33 Result.push_back(InVTs[i]);
38 static std::vector<unsigned char>
39 FilterEVTs(const std::vector<unsigned char> &InVTs, T Filter) {
40 std::vector<unsigned char> Result;
41 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
42 if (Filter((MVT::ValueType)InVTs[i]))
43 Result.push_back(InVTs[i]);
47 static std::vector<unsigned char>
48 ConvertVTs(const std::vector<MVT::ValueType> &InVTs) {
49 std::vector<unsigned char> Result;
50 for (unsigned i = 0, e = InVTs.size(); i != e; ++i)
51 Result.push_back(InVTs[i]);
55 static bool LHSIsSubsetOfRHS(const std::vector<unsigned char> &LHS,
56 const std::vector<unsigned char> &RHS) {
57 if (LHS.size() > RHS.size()) return false;
58 for (unsigned i = 0, e = LHS.size(); i != e; ++i)
59 if (std::find(RHS.begin(), RHS.end(), LHS[i]) == RHS.end())
64 /// isExtIntegerVT - Return true if the specified extended value type vector
65 /// contains isInt or an integer value type.
66 static bool isExtIntegerInVTs(const std::vector<unsigned char> &EVTs) {
67 assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
68 return EVTs[0] == MVT::isInt || !(FilterEVTs(EVTs, MVT::isInteger).empty());
71 /// isExtFloatingPointVT - Return true if the specified extended value type
72 /// vector contains isFP or a FP value type.
73 static bool isExtFloatingPointInVTs(const std::vector<unsigned char> &EVTs) {
74 assert(!EVTs.empty() && "Cannot check for integer in empty ExtVT list!");
75 return EVTs[0] == MVT::isFP ||
76 !(FilterEVTs(EVTs, MVT::isFloatingPoint).empty());
79 //===----------------------------------------------------------------------===//
80 // SDTypeConstraint implementation
83 SDTypeConstraint::SDTypeConstraint(Record *R) {
84 OperandNo = R->getValueAsInt("OperandNum");
86 if (R->isSubClassOf("SDTCisVT")) {
87 ConstraintType = SDTCisVT;
88 x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT"));
89 } else if (R->isSubClassOf("SDTCisPtrTy")) {
90 ConstraintType = SDTCisPtrTy;
91 } else if (R->isSubClassOf("SDTCisInt")) {
92 ConstraintType = SDTCisInt;
93 } else if (R->isSubClassOf("SDTCisFP")) {
94 ConstraintType = SDTCisFP;
95 } else if (R->isSubClassOf("SDTCisSameAs")) {
96 ConstraintType = SDTCisSameAs;
97 x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
98 } else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
99 ConstraintType = SDTCisVTSmallerThanOp;
100 x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
101 R->getValueAsInt("OtherOperandNum");
102 } else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) {
103 ConstraintType = SDTCisOpSmallerThanOp;
104 x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
105 R->getValueAsInt("BigOperandNum");
106 } else if (R->isSubClassOf("SDTCisIntVectorOfSameSize")) {
107 ConstraintType = SDTCisIntVectorOfSameSize;
108 x.SDTCisIntVectorOfSameSize_Info.OtherOperandNum =
109 R->getValueAsInt("OtherOpNum");
111 std::cerr << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
116 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
117 /// N, which has NumResults results.
118 TreePatternNode *SDTypeConstraint::getOperandNum(unsigned OpNo,
120 unsigned NumResults) const {
121 assert(NumResults <= 1 &&
122 "We only work with nodes with zero or one result so far!");
124 if (OpNo < NumResults)
125 return N; // FIXME: need value #
127 return N->getChild(OpNo-NumResults);
130 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
131 /// constraint to the nodes operands. This returns true if it makes a
132 /// change, false otherwise. If a type contradiction is found, throw an
134 bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
135 const SDNodeInfo &NodeInfo,
136 TreePattern &TP) const {
137 unsigned NumResults = NodeInfo.getNumResults();
138 assert(NumResults <= 1 &&
139 "We only work with nodes with zero or one result so far!");
141 // Check that the number of operands is sane.
142 if (NodeInfo.getNumOperands() >= 0) {
143 if (N->getNumChildren() != (unsigned)NodeInfo.getNumOperands())
144 TP.error(N->getOperator()->getName() + " node requires exactly " +
145 itostr(NodeInfo.getNumOperands()) + " operands!");
148 const CodeGenTarget &CGT = TP.getDAGISelEmitter().getTargetInfo();
150 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NumResults);
152 switch (ConstraintType) {
153 default: assert(0 && "Unknown constraint type!");
155 // Operand must be a particular type.
156 return NodeToApply->UpdateNodeType(x.SDTCisVT_Info.VT, TP);
158 // Operand must be same as target pointer type.
159 return NodeToApply->UpdateNodeType(CGT.getPointerType(), TP);
162 // If there is only one integer type supported, this must be it.
163 std::vector<MVT::ValueType> IntVTs =
164 FilterVTs(CGT.getLegalValueTypes(), MVT::isInteger);
166 // If we found exactly one supported integer type, apply it.
167 if (IntVTs.size() == 1)
168 return NodeToApply->UpdateNodeType(IntVTs[0], TP);
169 return NodeToApply->UpdateNodeType(MVT::isInt, TP);
172 // If there is only one FP type supported, this must be it.
173 std::vector<MVT::ValueType> FPVTs =
174 FilterVTs(CGT.getLegalValueTypes(), MVT::isFloatingPoint);
176 // If we found exactly one supported FP type, apply it.
177 if (FPVTs.size() == 1)
178 return NodeToApply->UpdateNodeType(FPVTs[0], TP);
179 return NodeToApply->UpdateNodeType(MVT::isFP, TP);
182 TreePatternNode *OtherNode =
183 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NumResults);
184 return NodeToApply->UpdateNodeType(OtherNode->getExtTypes(), TP) |
185 OtherNode->UpdateNodeType(NodeToApply->getExtTypes(), TP);
187 case SDTCisVTSmallerThanOp: {
188 // The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
189 // have an integer type that is smaller than the VT.
190 if (!NodeToApply->isLeaf() ||
191 !dynamic_cast<DefInit*>(NodeToApply->getLeafValue()) ||
192 !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
193 ->isSubClassOf("ValueType"))
194 TP.error(N->getOperator()->getName() + " expects a VT operand!");
196 getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef());
197 if (!MVT::isInteger(VT))
198 TP.error(N->getOperator()->getName() + " VT operand must be integer!");
200 TreePatternNode *OtherNode =
201 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N,NumResults);
203 // It must be integer.
204 bool MadeChange = false;
205 MadeChange |= OtherNode->UpdateNodeType(MVT::isInt, TP);
207 // This code only handles nodes that have one type set. Assert here so
208 // that we can change this if we ever need to deal with multiple value
209 // types at this point.
210 assert(OtherNode->getExtTypes().size() == 1 && "Node has too many types!");
211 if (OtherNode->hasTypeSet() && OtherNode->getTypeNum(0) <= VT)
212 OtherNode->UpdateNodeType(MVT::Other, TP); // Throw an error.
215 case SDTCisOpSmallerThanOp: {
216 TreePatternNode *BigOperand =
217 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NumResults);
219 // Both operands must be integer or FP, but we don't care which.
220 bool MadeChange = false;
222 // This code does not currently handle nodes which have multiple types,
223 // where some types are integer, and some are fp. Assert that this is not
225 assert(!(isExtIntegerInVTs(NodeToApply->getExtTypes()) &&
226 isExtFloatingPointInVTs(NodeToApply->getExtTypes())) &&
227 !(isExtIntegerInVTs(BigOperand->getExtTypes()) &&
228 isExtFloatingPointInVTs(BigOperand->getExtTypes())) &&
229 "SDTCisOpSmallerThanOp does not handle mixed int/fp types!");
230 if (isExtIntegerInVTs(NodeToApply->getExtTypes()))
231 MadeChange |= BigOperand->UpdateNodeType(MVT::isInt, TP);
232 else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes()))
233 MadeChange |= BigOperand->UpdateNodeType(MVT::isFP, TP);
234 if (isExtIntegerInVTs(BigOperand->getExtTypes()))
235 MadeChange |= NodeToApply->UpdateNodeType(MVT::isInt, TP);
236 else if (isExtFloatingPointInVTs(BigOperand->getExtTypes()))
237 MadeChange |= NodeToApply->UpdateNodeType(MVT::isFP, TP);
239 std::vector<MVT::ValueType> VTs = CGT.getLegalValueTypes();
241 if (isExtIntegerInVTs(NodeToApply->getExtTypes())) {
242 VTs = FilterVTs(VTs, MVT::isInteger);
243 } else if (isExtFloatingPointInVTs(NodeToApply->getExtTypes())) {
244 VTs = FilterVTs(VTs, MVT::isFloatingPoint);
249 switch (VTs.size()) {
250 default: // Too many VT's to pick from.
251 case 0: break; // No info yet.
253 // Only one VT of this flavor. Cannot ever satisify the constraints.
254 return NodeToApply->UpdateNodeType(MVT::Other, TP); // throw
256 // If we have exactly two possible types, the little operand must be the
257 // small one, the big operand should be the big one. Common with
258 // float/double for example.
259 assert(VTs[0] < VTs[1] && "Should be sorted!");
260 MadeChange |= NodeToApply->UpdateNodeType(VTs[0], TP);
261 MadeChange |= BigOperand->UpdateNodeType(VTs[1], TP);
266 case SDTCisIntVectorOfSameSize: {
267 TreePatternNode *OtherOperand =
268 getOperandNum(x.SDTCisIntVectorOfSameSize_Info.OtherOperandNum,
270 if (OtherOperand->hasTypeSet()) {
271 if (!MVT::isVector(OtherOperand->getTypeNum(0)))
272 TP.error(N->getOperator()->getName() + " VT operand must be a vector!");
273 MVT::ValueType IVT = OtherOperand->getTypeNum(0);
274 IVT = MVT::getIntVectorWithNumElements(MVT::getVectorNumElements(IVT));
275 return NodeToApply->UpdateNodeType(IVT, TP);
284 //===----------------------------------------------------------------------===//
285 // SDNodeInfo implementation
287 SDNodeInfo::SDNodeInfo(Record *R) : Def(R) {
288 EnumName = R->getValueAsString("Opcode");
289 SDClassName = R->getValueAsString("SDClass");
290 Record *TypeProfile = R->getValueAsDef("TypeProfile");
291 NumResults = TypeProfile->getValueAsInt("NumResults");
292 NumOperands = TypeProfile->getValueAsInt("NumOperands");
294 // Parse the properties.
296 std::vector<Record*> PropList = R->getValueAsListOfDefs("Properties");
297 for (unsigned i = 0, e = PropList.size(); i != e; ++i) {
298 if (PropList[i]->getName() == "SDNPCommutative") {
299 Properties |= 1 << SDNPCommutative;
300 } else if (PropList[i]->getName() == "SDNPAssociative") {
301 Properties |= 1 << SDNPAssociative;
302 } else if (PropList[i]->getName() == "SDNPHasChain") {
303 Properties |= 1 << SDNPHasChain;
304 } else if (PropList[i]->getName() == "SDNPOutFlag") {
305 Properties |= 1 << SDNPOutFlag;
306 } else if (PropList[i]->getName() == "SDNPInFlag") {
307 Properties |= 1 << SDNPInFlag;
308 } else if (PropList[i]->getName() == "SDNPOptInFlag") {
309 Properties |= 1 << SDNPOptInFlag;
311 std::cerr << "Unknown SD Node property '" << PropList[i]->getName()
312 << "' on node '" << R->getName() << "'!\n";
318 // Parse the type constraints.
319 std::vector<Record*> ConstraintList =
320 TypeProfile->getValueAsListOfDefs("Constraints");
321 TypeConstraints.assign(ConstraintList.begin(), ConstraintList.end());
324 //===----------------------------------------------------------------------===//
325 // TreePatternNode implementation
328 TreePatternNode::~TreePatternNode() {
329 #if 0 // FIXME: implement refcounted tree nodes!
330 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
335 /// UpdateNodeType - Set the node type of N to VT if VT contains
336 /// information. If N already contains a conflicting type, then throw an
337 /// exception. This returns true if any information was updated.
339 bool TreePatternNode::UpdateNodeType(const std::vector<unsigned char> &ExtVTs,
341 assert(!ExtVTs.empty() && "Cannot update node type with empty type vector!");
343 if (ExtVTs[0] == MVT::isUnknown || LHSIsSubsetOfRHS(getExtTypes(), ExtVTs))
345 if (isTypeCompletelyUnknown() || LHSIsSubsetOfRHS(ExtVTs, getExtTypes())) {
350 if (ExtVTs[0] == MVT::isInt && isExtIntegerInVTs(getExtTypes())) {
351 assert(hasTypeSet() && "should be handled above!");
352 std::vector<unsigned char> FVTs = FilterEVTs(getExtTypes(), MVT::isInteger);
353 if (getExtTypes() == FVTs)
358 if (ExtVTs[0] == MVT::isFP && isExtFloatingPointInVTs(getExtTypes())) {
359 assert(hasTypeSet() && "should be handled above!");
360 std::vector<unsigned char> FVTs =
361 FilterEVTs(getExtTypes(), MVT::isFloatingPoint);
362 if (getExtTypes() == FVTs)
368 // If we know this is an int or fp type, and we are told it is a specific one,
371 // Similarly, we should probably set the type here to the intersection of
372 // {isInt|isFP} and ExtVTs
373 if ((getExtTypeNum(0) == MVT::isInt && isExtIntegerInVTs(ExtVTs)) ||
374 (getExtTypeNum(0) == MVT::isFP && isExtFloatingPointInVTs(ExtVTs))) {
382 TP.error("Type inference contradiction found in node!");
384 TP.error("Type inference contradiction found in node " +
385 getOperator()->getName() + "!");
387 return true; // unreachable
391 void TreePatternNode::print(std::ostream &OS) const {
393 OS << *getLeafValue();
395 OS << "(" << getOperator()->getName();
398 // FIXME: At some point we should handle printing all the value types for
399 // nodes that are multiply typed.
400 switch (getExtTypeNum(0)) {
401 case MVT::Other: OS << ":Other"; break;
402 case MVT::isInt: OS << ":isInt"; break;
403 case MVT::isFP : OS << ":isFP"; break;
404 case MVT::isUnknown: ; /*OS << ":?";*/ break;
405 default: OS << ":" << getTypeNum(0); break;
409 if (getNumChildren() != 0) {
411 getChild(0)->print(OS);
412 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
414 getChild(i)->print(OS);
420 if (!PredicateFn.empty())
421 OS << "<<P:" << PredicateFn << ">>";
423 OS << "<<X:" << TransformFn->getName() << ">>";
424 if (!getName().empty())
425 OS << ":$" << getName();
428 void TreePatternNode::dump() const {
432 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
433 /// the specified node. For this comparison, all of the state of the node
434 /// is considered, except for the assigned name. Nodes with differing names
435 /// that are otherwise identical are considered isomorphic.
436 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N) const {
437 if (N == this) return true;
438 if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
439 getPredicateFn() != N->getPredicateFn() ||
440 getTransformFn() != N->getTransformFn())
444 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue()))
445 if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue()))
446 return DI->getDef() == NDI->getDef();
447 return getLeafValue() == N->getLeafValue();
450 if (N->getOperator() != getOperator() ||
451 N->getNumChildren() != getNumChildren()) return false;
452 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
453 if (!getChild(i)->isIsomorphicTo(N->getChild(i)))
458 /// clone - Make a copy of this tree and all of its children.
460 TreePatternNode *TreePatternNode::clone() const {
461 TreePatternNode *New;
463 New = new TreePatternNode(getLeafValue());
465 std::vector<TreePatternNode*> CChildren;
466 CChildren.reserve(Children.size());
467 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
468 CChildren.push_back(getChild(i)->clone());
469 New = new TreePatternNode(getOperator(), CChildren);
471 New->setName(getName());
472 New->setTypes(getExtTypes());
473 New->setPredicateFn(getPredicateFn());
474 New->setTransformFn(getTransformFn());
478 /// SubstituteFormalArguments - Replace the formal arguments in this tree
479 /// with actual values specified by ArgMap.
480 void TreePatternNode::
481 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
482 if (isLeaf()) return;
484 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
485 TreePatternNode *Child = getChild(i);
486 if (Child->isLeaf()) {
487 Init *Val = Child->getLeafValue();
488 if (dynamic_cast<DefInit*>(Val) &&
489 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
490 // We found a use of a formal argument, replace it with its value.
491 Child = ArgMap[Child->getName()];
492 assert(Child && "Couldn't find formal argument!");
496 getChild(i)->SubstituteFormalArguments(ArgMap);
502 /// InlinePatternFragments - If this pattern refers to any pattern
503 /// fragments, inline them into place, giving us a pattern without any
504 /// PatFrag references.
505 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
506 if (isLeaf()) return this; // nothing to do.
507 Record *Op = getOperator();
509 if (!Op->isSubClassOf("PatFrag")) {
510 // Just recursively inline children nodes.
511 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
512 setChild(i, getChild(i)->InlinePatternFragments(TP));
516 // Otherwise, we found a reference to a fragment. First, look up its
517 // TreePattern record.
518 TreePattern *Frag = TP.getDAGISelEmitter().getPatternFragment(Op);
520 // Verify that we are passing the right number of operands.
521 if (Frag->getNumArgs() != Children.size())
522 TP.error("'" + Op->getName() + "' fragment requires " +
523 utostr(Frag->getNumArgs()) + " operands!");
525 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
527 // Resolve formal arguments to their actual value.
528 if (Frag->getNumArgs()) {
529 // Compute the map of formal to actual arguments.
530 std::map<std::string, TreePatternNode*> ArgMap;
531 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
532 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
534 FragTree->SubstituteFormalArguments(ArgMap);
537 FragTree->setName(getName());
538 FragTree->UpdateNodeType(getExtTypes(), TP);
540 // Get a new copy of this fragment to stitch into here.
541 //delete this; // FIXME: implement refcounting!
545 /// getImplicitType - Check to see if the specified record has an implicit
546 /// type which should be applied to it. This infer the type of register
547 /// references from the register file information, for example.
549 static std::vector<unsigned char> getImplicitType(Record *R, bool NotRegisters,
551 // Some common return values
552 std::vector<unsigned char> Unknown(1, MVT::isUnknown);
553 std::vector<unsigned char> Other(1, MVT::Other);
555 // Check to see if this is a register or a register class...
556 if (R->isSubClassOf("RegisterClass")) {
559 const CodeGenRegisterClass &RC =
560 TP.getDAGISelEmitter().getTargetInfo().getRegisterClass(R);
561 return ConvertVTs(RC.getValueTypes());
562 } else if (R->isSubClassOf("PatFrag")) {
563 // Pattern fragment types will be resolved when they are inlined.
565 } else if (R->isSubClassOf("Register")) {
568 const CodeGenTarget &T = TP.getDAGISelEmitter().getTargetInfo();
569 return T.getRegisterVTs(R);
570 } else if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
571 // Using a VTSDNode or CondCodeSDNode.
573 } else if (R->isSubClassOf("ComplexPattern")) {
576 std::vector<unsigned char>
577 ComplexPat(1, TP.getDAGISelEmitter().getComplexPattern(R).getValueType());
579 } else if (R->getName() == "node" || R->getName() == "srcvalue") {
584 TP.error("Unknown node flavor used in pattern: " + R->getName());
588 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
589 /// this node and its children in the tree. This returns true if it makes a
590 /// change, false otherwise. If a type contradiction is found, throw an
592 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
593 DAGISelEmitter &ISE = TP.getDAGISelEmitter();
595 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
596 // If it's a regclass or something else known, include the type.
597 return UpdateNodeType(getImplicitType(DI->getDef(), NotRegisters, TP),TP);
598 } else if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
599 // Int inits are always integers. :)
600 bool MadeChange = UpdateNodeType(MVT::isInt, TP);
603 // At some point, it may make sense for this tree pattern to have
604 // multiple types. Assert here that it does not, so we revisit this
605 // code when appropriate.
606 assert(getExtTypes().size() >= 1 && "TreePattern does not have a type!");
607 MVT::ValueType VT = getTypeNum(0);
608 for (unsigned i = 1, e = getExtTypes().size(); i != e; ++i)
609 assert(getTypeNum(i) == VT && "TreePattern has too many types!");
611 unsigned Size = MVT::getSizeInBits(getTypeNum(0));
612 // Make sure that the value is representable for this type.
614 int Val = (II->getValue() << (32-Size)) >> (32-Size);
615 if (Val != II->getValue())
616 TP.error("Sign-extended integer value '" + itostr(II->getValue()) +
617 "' is out of range for type 'MVT::" +
618 getEnumName(getTypeNum(0)) + "'!");
627 // special handling for set, which isn't really an SDNode.
628 if (getOperator()->getName() == "set") {
629 assert (getNumChildren() == 2 && "Only handle 2 operand set's for now!");
630 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
631 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
633 // Types of operands must match.
634 MadeChange |= getChild(0)->UpdateNodeType(getChild(1)->getExtTypes(), TP);
635 MadeChange |= getChild(1)->UpdateNodeType(getChild(0)->getExtTypes(), TP);
636 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
638 } else if (getOperator() == ISE.get_intrinsic_void_sdnode() ||
639 getOperator() == ISE.get_intrinsic_w_chain_sdnode() ||
640 getOperator() == ISE.get_intrinsic_wo_chain_sdnode()) {
642 dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
643 const CodeGenIntrinsic &Int = ISE.getIntrinsicInfo(IID);
644 bool MadeChange = false;
646 // Apply the result type to the node.
647 MadeChange = UpdateNodeType(Int.ArgVTs[0], TP);
649 if (getNumChildren() != Int.ArgVTs.size())
650 TP.error("Intrinsic '" + Int.Name + "' expects " +
651 utostr(Int.ArgVTs.size()-1) + " operands, not " +
652 utostr(getNumChildren()-1) + " operands!");
654 // Apply type info to the intrinsic ID.
655 MVT::ValueType PtrTy = ISE.getTargetInfo().getPointerType();
656 MadeChange |= getChild(0)->UpdateNodeType(PtrTy, TP);
658 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
659 MVT::ValueType OpVT = Int.ArgVTs[i];
660 MadeChange |= getChild(i)->UpdateNodeType(OpVT, TP);
661 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
664 } else if (getOperator()->isSubClassOf("SDNode")) {
665 const SDNodeInfo &NI = ISE.getSDNodeInfo(getOperator());
667 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
668 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
669 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
670 // Branch, etc. do not produce results and top-level forms in instr pattern
671 // must have void types.
672 if (NI.getNumResults() == 0)
673 MadeChange |= UpdateNodeType(MVT::isVoid, TP);
675 // If this is a vector_shuffle operation, apply types to the build_vector
676 // operation. The types of the integers don't matter, but this ensures they
677 // won't get checked.
678 if (getOperator()->getName() == "vector_shuffle" &&
679 getChild(2)->getOperator()->getName() == "build_vector") {
680 TreePatternNode *BV = getChild(2);
681 const std::vector<MVT::ValueType> &LegalVTs
682 = ISE.getTargetInfo().getLegalValueTypes();
683 MVT::ValueType LegalIntVT = MVT::Other;
684 for (unsigned i = 0, e = LegalVTs.size(); i != e; ++i)
685 if (MVT::isInteger(LegalVTs[i]) && !MVT::isVector(LegalVTs[i])) {
686 LegalIntVT = LegalVTs[i];
689 assert(LegalIntVT != MVT::Other && "No legal integer VT?");
691 for (unsigned i = 0, e = BV->getNumChildren(); i != e; ++i)
692 MadeChange |= BV->getChild(i)->UpdateNodeType(LegalIntVT, TP);
695 } else if (getOperator()->isSubClassOf("Instruction")) {
696 const DAGInstruction &Inst = ISE.getInstruction(getOperator());
697 bool MadeChange = false;
698 unsigned NumResults = Inst.getNumResults();
700 assert(NumResults <= 1 &&
701 "Only supports zero or one result instrs!");
702 // Apply the result type to the node
703 if (NumResults == 0) {
704 MadeChange = UpdateNodeType(MVT::isVoid, TP);
706 Record *ResultNode = Inst.getResult(0);
707 assert(ResultNode->isSubClassOf("RegisterClass") &&
708 "Operands should be register classes!");
710 const CodeGenRegisterClass &RC =
711 ISE.getTargetInfo().getRegisterClass(ResultNode);
712 MadeChange = UpdateNodeType(ConvertVTs(RC.getValueTypes()), TP);
715 if (getNumChildren() != Inst.getNumOperands())
716 TP.error("Instruction '" + getOperator()->getName() + " expects " +
717 utostr(Inst.getNumOperands()) + " operands, not " +
718 utostr(getNumChildren()) + " operands!");
719 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
720 Record *OperandNode = Inst.getOperand(i);
722 if (OperandNode->isSubClassOf("RegisterClass")) {
723 const CodeGenRegisterClass &RC =
724 ISE.getTargetInfo().getRegisterClass(OperandNode);
725 //VT = RC.getValueTypeNum(0);
726 MadeChange |=getChild(i)->UpdateNodeType(ConvertVTs(RC.getValueTypes()),
728 } else if (OperandNode->isSubClassOf("Operand")) {
729 VT = getValueType(OperandNode->getValueAsDef("Type"));
730 MadeChange |= getChild(i)->UpdateNodeType(VT, TP);
732 assert(0 && "Unknown operand type!");
735 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
739 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
741 // Node transforms always take one operand.
742 if (getNumChildren() != 1)
743 TP.error("Node transform '" + getOperator()->getName() +
744 "' requires one operand!");
746 // If either the output or input of the xform does not have exact
747 // type info. We assume they must be the same. Otherwise, it is perfectly
748 // legal to transform from one type to a completely different type.
749 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
750 bool MadeChange = UpdateNodeType(getChild(0)->getExtTypes(), TP);
751 MadeChange |= getChild(0)->UpdateNodeType(getExtTypes(), TP);
758 /// canPatternMatch - If it is impossible for this pattern to match on this
759 /// target, fill in Reason and return false. Otherwise, return true. This is
760 /// used as a santity check for .td files (to prevent people from writing stuff
761 /// that can never possibly work), and to prevent the pattern permuter from
762 /// generating stuff that is useless.
763 bool TreePatternNode::canPatternMatch(std::string &Reason, DAGISelEmitter &ISE){
764 if (isLeaf()) return true;
766 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
767 if (!getChild(i)->canPatternMatch(Reason, ISE))
770 // If this is an intrinsic, handle cases that would make it not match. For
771 // example, if an operand is required to be an immediate.
772 if (getOperator()->isSubClassOf("Intrinsic")) {
777 // If this node is a commutative operator, check that the LHS isn't an
779 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(getOperator());
780 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
781 // Scan all of the operands of the node and make sure that only the last one
782 // is a constant node.
783 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i)
784 if (!getChild(i)->isLeaf() &&
785 getChild(i)->getOperator()->getName() == "imm") {
786 Reason = "Immediate value must be on the RHS of commutative operators!";
794 //===----------------------------------------------------------------------===//
795 // TreePattern implementation
798 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
799 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
800 isInputPattern = isInput;
801 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
802 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
805 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
806 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
807 isInputPattern = isInput;
808 Trees.push_back(ParseTreePattern(Pat));
811 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
812 DAGISelEmitter &ise) : TheRecord(TheRec), ISE(ise) {
813 isInputPattern = isInput;
814 Trees.push_back(Pat);
819 void TreePattern::error(const std::string &Msg) const {
821 throw "In " + TheRecord->getName() + ": " + Msg;
824 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
825 DefInit *OpDef = dynamic_cast<DefInit*>(Dag->getOperator());
826 if (!OpDef) error("Pattern has unexpected operator type!");
827 Record *Operator = OpDef->getDef();
829 if (Operator->isSubClassOf("ValueType")) {
830 // If the operator is a ValueType, then this must be "type cast" of a leaf
832 if (Dag->getNumArgs() != 1)
833 error("Type cast only takes one operand!");
835 Init *Arg = Dag->getArg(0);
836 TreePatternNode *New;
837 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
838 Record *R = DI->getDef();
839 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
840 Dag->setArg(0, new DagInit(DI,
841 std::vector<std::pair<Init*, std::string> >()));
842 return ParseTreePattern(Dag);
844 New = new TreePatternNode(DI);
845 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
846 New = ParseTreePattern(DI);
847 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
848 New = new TreePatternNode(II);
849 if (!Dag->getArgName(0).empty())
850 error("Constant int argument should not have a name!");
851 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
852 // Turn this into an IntInit.
853 Init *II = BI->convertInitializerTo(new IntRecTy());
854 if (II == 0 || !dynamic_cast<IntInit*>(II))
855 error("Bits value must be constants!");
857 New = new TreePatternNode(dynamic_cast<IntInit*>(II));
858 if (!Dag->getArgName(0).empty())
859 error("Constant int argument should not have a name!");
862 error("Unknown leaf value for tree pattern!");
866 // Apply the type cast.
867 New->UpdateNodeType(getValueType(Operator), *this);
868 New->setName(Dag->getArgName(0));
872 // Verify that this is something that makes sense for an operator.
873 if (!Operator->isSubClassOf("PatFrag") && !Operator->isSubClassOf("SDNode") &&
874 !Operator->isSubClassOf("Instruction") &&
875 !Operator->isSubClassOf("SDNodeXForm") &&
876 !Operator->isSubClassOf("Intrinsic") &&
877 Operator->getName() != "set")
878 error("Unrecognized node '" + Operator->getName() + "'!");
880 // Check to see if this is something that is illegal in an input pattern.
881 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
882 Operator->isSubClassOf("SDNodeXForm")))
883 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
885 std::vector<TreePatternNode*> Children;
887 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
888 Init *Arg = Dag->getArg(i);
889 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
890 Children.push_back(ParseTreePattern(DI));
891 if (Children.back()->getName().empty())
892 Children.back()->setName(Dag->getArgName(i));
893 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
894 Record *R = DefI->getDef();
895 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
896 // TreePatternNode if its own.
897 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
898 Dag->setArg(i, new DagInit(DefI,
899 std::vector<std::pair<Init*, std::string> >()));
900 --i; // Revisit this node...
902 TreePatternNode *Node = new TreePatternNode(DefI);
903 Node->setName(Dag->getArgName(i));
904 Children.push_back(Node);
907 if (R->getName() == "node") {
908 if (Dag->getArgName(i).empty())
909 error("'node' argument requires a name to match with operand list");
910 Args.push_back(Dag->getArgName(i));
913 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
914 TreePatternNode *Node = new TreePatternNode(II);
915 if (!Dag->getArgName(i).empty())
916 error("Constant int argument should not have a name!");
917 Children.push_back(Node);
918 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
919 // Turn this into an IntInit.
920 Init *II = BI->convertInitializerTo(new IntRecTy());
921 if (II == 0 || !dynamic_cast<IntInit*>(II))
922 error("Bits value must be constants!");
924 TreePatternNode *Node = new TreePatternNode(dynamic_cast<IntInit*>(II));
925 if (!Dag->getArgName(i).empty())
926 error("Constant int argument should not have a name!");
927 Children.push_back(Node);
932 error("Unknown leaf value for tree pattern!");
936 // If the operator is an intrinsic, then this is just syntactic sugar for for
937 // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
938 // convert the intrinsic name to a number.
939 if (Operator->isSubClassOf("Intrinsic")) {
940 const CodeGenIntrinsic &Int = getDAGISelEmitter().getIntrinsic(Operator);
941 unsigned IID = getDAGISelEmitter().getIntrinsicID(Operator)+1;
943 // If this intrinsic returns void, it must have side-effects and thus a
945 if (Int.ArgVTs[0] == MVT::isVoid) {
946 Operator = getDAGISelEmitter().get_intrinsic_void_sdnode();
947 } else if (Int.ModRef != CodeGenIntrinsic::NoMem) {
948 // Has side-effects, requires chain.
949 Operator = getDAGISelEmitter().get_intrinsic_w_chain_sdnode();
951 // Otherwise, no chain.
952 Operator = getDAGISelEmitter().get_intrinsic_wo_chain_sdnode();
955 TreePatternNode *IIDNode = new TreePatternNode(new IntInit(IID));
956 Children.insert(Children.begin(), IIDNode);
959 return new TreePatternNode(Operator, Children);
962 /// InferAllTypes - Infer/propagate as many types throughout the expression
963 /// patterns as possible. Return true if all types are infered, false
964 /// otherwise. Throw an exception if a type contradiction is found.
965 bool TreePattern::InferAllTypes() {
966 bool MadeChange = true;
969 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
970 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
973 bool HasUnresolvedTypes = false;
974 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
975 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
976 return !HasUnresolvedTypes;
979 void TreePattern::print(std::ostream &OS) const {
980 OS << getRecord()->getName();
982 OS << "(" << Args[0];
983 for (unsigned i = 1, e = Args.size(); i != e; ++i)
984 OS << ", " << Args[i];
989 if (Trees.size() > 1)
991 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
997 if (Trees.size() > 1)
1001 void TreePattern::dump() const { print(std::cerr); }
1005 //===----------------------------------------------------------------------===//
1006 // DAGISelEmitter implementation
1009 // Parse all of the SDNode definitions for the target, populating SDNodes.
1010 void DAGISelEmitter::ParseNodeInfo() {
1011 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
1012 while (!Nodes.empty()) {
1013 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
1017 // Get the buildin intrinsic nodes.
1018 intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
1019 intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
1020 intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
1023 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
1024 /// map, and emit them to the file as functions.
1025 void DAGISelEmitter::ParseNodeTransforms(std::ostream &OS) {
1026 OS << "\n// Node transformations.\n";
1027 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
1028 while (!Xforms.empty()) {
1029 Record *XFormNode = Xforms.back();
1030 Record *SDNode = XFormNode->getValueAsDef("Opcode");
1031 std::string Code = XFormNode->getValueAsCode("XFormFunction");
1032 SDNodeXForms.insert(std::make_pair(XFormNode,
1033 std::make_pair(SDNode, Code)));
1035 if (!Code.empty()) {
1036 std::string ClassName = getSDNodeInfo(SDNode).getSDClassName();
1037 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
1039 OS << "inline SDOperand Transform_" << XFormNode->getName()
1040 << "(SDNode *" << C2 << ") {\n";
1041 if (ClassName != "SDNode")
1042 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
1043 OS << Code << "\n}\n";
1050 void DAGISelEmitter::ParseComplexPatterns() {
1051 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
1052 while (!AMs.empty()) {
1053 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
1059 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
1060 /// file, building up the PatternFragments map. After we've collected them all,
1061 /// inline fragments together as necessary, so that there are no references left
1062 /// inside a pattern fragment to a pattern fragment.
1064 /// This also emits all of the predicate functions to the output file.
1066 void DAGISelEmitter::ParsePatternFragments(std::ostream &OS) {
1067 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
1069 // First step, parse all of the fragments and emit predicate functions.
1070 OS << "\n// Predicate functions.\n";
1071 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1072 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
1073 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
1074 PatternFragments[Fragments[i]] = P;
1076 // Validate the argument list, converting it to map, to discard duplicates.
1077 std::vector<std::string> &Args = P->getArgList();
1078 std::set<std::string> OperandsMap(Args.begin(), Args.end());
1080 if (OperandsMap.count(""))
1081 P->error("Cannot have unnamed 'node' values in pattern fragment!");
1083 // Parse the operands list.
1084 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
1085 DefInit *OpsOp = dynamic_cast<DefInit*>(OpsList->getOperator());
1086 if (!OpsOp || OpsOp->getDef()->getName() != "ops")
1087 P->error("Operands list should start with '(ops ... '!");
1089 // Copy over the arguments.
1091 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
1092 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
1093 static_cast<DefInit*>(OpsList->getArg(j))->
1094 getDef()->getName() != "node")
1095 P->error("Operands list should all be 'node' values.");
1096 if (OpsList->getArgName(j).empty())
1097 P->error("Operands list should have names for each operand!");
1098 if (!OperandsMap.count(OpsList->getArgName(j)))
1099 P->error("'" + OpsList->getArgName(j) +
1100 "' does not occur in pattern or was multiply specified!");
1101 OperandsMap.erase(OpsList->getArgName(j));
1102 Args.push_back(OpsList->getArgName(j));
1105 if (!OperandsMap.empty())
1106 P->error("Operands list does not contain an entry for operand '" +
1107 *OperandsMap.begin() + "'!");
1109 // If there is a code init for this fragment, emit the predicate code and
1110 // keep track of the fact that this fragment uses it.
1111 std::string Code = Fragments[i]->getValueAsCode("Predicate");
1112 if (!Code.empty()) {
1113 assert(!P->getOnlyTree()->isLeaf() && "Can't be a leaf!");
1114 std::string ClassName =
1115 getSDNodeInfo(P->getOnlyTree()->getOperator()).getSDClassName();
1116 const char *C2 = ClassName == "SDNode" ? "N" : "inN";
1118 OS << "inline bool Predicate_" << Fragments[i]->getName()
1119 << "(SDNode *" << C2 << ") {\n";
1120 if (ClassName != "SDNode")
1121 OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n";
1122 OS << Code << "\n}\n";
1123 P->getOnlyTree()->setPredicateFn("Predicate_"+Fragments[i]->getName());
1126 // If there is a node transformation corresponding to this, keep track of
1128 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
1129 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
1130 P->getOnlyTree()->setTransformFn(Transform);
1135 // Now that we've parsed all of the tree fragments, do a closure on them so
1136 // that there are not references to PatFrags left inside of them.
1137 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
1138 E = PatternFragments.end(); I != E; ++I) {
1139 TreePattern *ThePat = I->second;
1140 ThePat->InlinePatternFragments();
1142 // Infer as many types as possible. Don't worry about it if we don't infer
1143 // all of them, some may depend on the inputs of the pattern.
1145 ThePat->InferAllTypes();
1147 // If this pattern fragment is not supported by this target (no types can
1148 // satisfy its constraints), just ignore it. If the bogus pattern is
1149 // actually used by instructions, the type consistency error will be
1153 // If debugging, print out the pattern fragment result.
1154 DEBUG(ThePat->dump());
1158 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1159 /// instruction input. Return true if this is a real use.
1160 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1161 std::map<std::string, TreePatternNode*> &InstInputs,
1162 std::vector<Record*> &InstImpInputs) {
1163 // No name -> not interesting.
1164 if (Pat->getName().empty()) {
1165 if (Pat->isLeaf()) {
1166 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1167 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1168 I->error("Input " + DI->getDef()->getName() + " must be named!");
1169 else if (DI && DI->getDef()->isSubClassOf("Register"))
1170 InstImpInputs.push_back(DI->getDef());
1176 if (Pat->isLeaf()) {
1177 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1178 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1181 assert(Pat->getNumChildren() == 0 && "can't be a use with children!");
1182 Rec = Pat->getOperator();
1185 // SRCVALUE nodes are ignored.
1186 if (Rec->getName() == "srcvalue")
1189 TreePatternNode *&Slot = InstInputs[Pat->getName()];
1194 if (Slot->isLeaf()) {
1195 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1197 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1198 SlotRec = Slot->getOperator();
1201 // Ensure that the inputs agree if we've already seen this input.
1203 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1204 if (Slot->getExtTypes() != Pat->getExtTypes())
1205 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1210 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1211 /// part of "I", the instruction), computing the set of inputs and outputs of
1212 /// the pattern. Report errors if we see anything naughty.
1213 void DAGISelEmitter::
1214 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1215 std::map<std::string, TreePatternNode*> &InstInputs,
1216 std::map<std::string, TreePatternNode*>&InstResults,
1217 std::vector<Record*> &InstImpInputs,
1218 std::vector<Record*> &InstImpResults) {
1219 if (Pat->isLeaf()) {
1220 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1221 if (!isUse && Pat->getTransformFn())
1222 I->error("Cannot specify a transform function for a non-input value!");
1224 } else if (Pat->getOperator()->getName() != "set") {
1225 // If this is not a set, verify that the children nodes are not void typed,
1227 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1228 if (Pat->getChild(i)->getExtTypeNum(0) == MVT::isVoid)
1229 I->error("Cannot have void nodes inside of patterns!");
1230 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
1231 InstImpInputs, InstImpResults);
1234 // If this is a non-leaf node with no children, treat it basically as if
1235 // it were a leaf. This handles nodes like (imm).
1237 if (Pat->getNumChildren() == 0)
1238 isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1240 if (!isUse && Pat->getTransformFn())
1241 I->error("Cannot specify a transform function for a non-input value!");
1245 // Otherwise, this is a set, validate and collect instruction results.
1246 if (Pat->getNumChildren() == 0)
1247 I->error("set requires operands!");
1248 else if (Pat->getNumChildren() & 1)
1249 I->error("set requires an even number of operands");
1251 if (Pat->getTransformFn())
1252 I->error("Cannot specify a transform function on a set node!");
1254 // Check the set destinations.
1255 unsigned NumValues = Pat->getNumChildren()/2;
1256 for (unsigned i = 0; i != NumValues; ++i) {
1257 TreePatternNode *Dest = Pat->getChild(i);
1258 if (!Dest->isLeaf())
1259 I->error("set destination should be a register!");
1261 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
1263 I->error("set destination should be a register!");
1265 if (Val->getDef()->isSubClassOf("RegisterClass")) {
1266 if (Dest->getName().empty())
1267 I->error("set destination must have a name!");
1268 if (InstResults.count(Dest->getName()))
1269 I->error("cannot set '" + Dest->getName() +"' multiple times");
1270 InstResults[Dest->getName()] = Dest;
1271 } else if (Val->getDef()->isSubClassOf("Register")) {
1272 InstImpResults.push_back(Val->getDef());
1274 I->error("set destination should be a register!");
1277 // Verify and collect info from the computation.
1278 FindPatternInputsAndOutputs(I, Pat->getChild(i+NumValues),
1279 InstInputs, InstResults,
1280 InstImpInputs, InstImpResults);
1284 /// ParseInstructions - Parse all of the instructions, inlining and resolving
1285 /// any fragments involved. This populates the Instructions list with fully
1286 /// resolved instructions.
1287 void DAGISelEmitter::ParseInstructions() {
1288 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
1290 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
1293 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
1294 LI = Instrs[i]->getValueAsListInit("Pattern");
1296 // If there is no pattern, only collect minimal information about the
1297 // instruction for its operand list. We have to assume that there is one
1298 // result, as we have no detailed info.
1299 if (!LI || LI->getSize() == 0) {
1300 std::vector<Record*> Results;
1301 std::vector<Record*> Operands;
1303 CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
1305 if (InstInfo.OperandList.size() != 0) {
1306 // FIXME: temporary hack...
1307 if (InstInfo.noResults) {
1308 // These produce no results
1309 for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
1310 Operands.push_back(InstInfo.OperandList[j].Rec);
1312 // Assume the first operand is the result.
1313 Results.push_back(InstInfo.OperandList[0].Rec);
1315 // The rest are inputs.
1316 for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
1317 Operands.push_back(InstInfo.OperandList[j].Rec);
1321 // Create and insert the instruction.
1322 std::vector<Record*> ImpResults;
1323 std::vector<Record*> ImpOperands;
1324 Instructions.insert(std::make_pair(Instrs[i],
1325 DAGInstruction(0, Results, Operands, ImpResults,
1327 continue; // no pattern.
1330 // Parse the instruction.
1331 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
1332 // Inline pattern fragments into it.
1333 I->InlinePatternFragments();
1335 // Infer as many types as possible. If we cannot infer all of them, we can
1336 // never do anything with this instruction pattern: report it to the user.
1337 if (!I->InferAllTypes())
1338 I->error("Could not infer all types in pattern!");
1340 // InstInputs - Keep track of all of the inputs of the instruction, along
1341 // with the record they are declared as.
1342 std::map<std::string, TreePatternNode*> InstInputs;
1344 // InstResults - Keep track of all the virtual registers that are 'set'
1345 // in the instruction, including what reg class they are.
1346 std::map<std::string, TreePatternNode*> InstResults;
1348 std::vector<Record*> InstImpInputs;
1349 std::vector<Record*> InstImpResults;
1351 // Verify that the top-level forms in the instruction are of void type, and
1352 // fill in the InstResults map.
1353 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
1354 TreePatternNode *Pat = I->getTree(j);
1355 if (Pat->getExtTypeNum(0) != MVT::isVoid)
1356 I->error("Top-level forms in instruction pattern should have"
1359 // Find inputs and outputs, and verify the structure of the uses/defs.
1360 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
1361 InstImpInputs, InstImpResults);
1364 // Now that we have inputs and outputs of the pattern, inspect the operands
1365 // list for the instruction. This determines the order that operands are
1366 // added to the machine instruction the node corresponds to.
1367 unsigned NumResults = InstResults.size();
1369 // Parse the operands list from the (ops) list, validating it.
1370 std::vector<std::string> &Args = I->getArgList();
1371 assert(Args.empty() && "Args list should still be empty here!");
1372 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]->getName());
1374 // Check that all of the results occur first in the list.
1375 std::vector<Record*> Results;
1376 TreePatternNode *Res0Node = NULL;
1377 for (unsigned i = 0; i != NumResults; ++i) {
1378 if (i == CGI.OperandList.size())
1379 I->error("'" + InstResults.begin()->first +
1380 "' set but does not appear in operand list!");
1381 const std::string &OpName = CGI.OperandList[i].Name;
1383 // Check that it exists in InstResults.
1384 TreePatternNode *RNode = InstResults[OpName];
1386 I->error("Operand $" + OpName + " does not exist in operand list!");
1390 Record *R = dynamic_cast<DefInit*>(RNode->getLeafValue())->getDef();
1392 I->error("Operand $" + OpName + " should be a set destination: all "
1393 "outputs must occur before inputs in operand list!");
1395 if (CGI.OperandList[i].Rec != R)
1396 I->error("Operand $" + OpName + " class mismatch!");
1398 // Remember the return type.
1399 Results.push_back(CGI.OperandList[i].Rec);
1401 // Okay, this one checks out.
1402 InstResults.erase(OpName);
1405 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
1406 // the copy while we're checking the inputs.
1407 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
1409 std::vector<TreePatternNode*> ResultNodeOperands;
1410 std::vector<Record*> Operands;
1411 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
1412 const std::string &OpName = CGI.OperandList[i].Name;
1414 I->error("Operand #" + utostr(i) + " in operands list has no name!");
1416 if (!InstInputsCheck.count(OpName))
1417 I->error("Operand $" + OpName +
1418 " does not appear in the instruction pattern");
1419 TreePatternNode *InVal = InstInputsCheck[OpName];
1420 InstInputsCheck.erase(OpName); // It occurred, remove from map.
1422 if (InVal->isLeaf() &&
1423 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
1424 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
1425 if (CGI.OperandList[i].Rec != InRec &&
1426 !InRec->isSubClassOf("ComplexPattern"))
1427 I->error("Operand $" + OpName + "'s register class disagrees"
1428 " between the operand and pattern");
1430 Operands.push_back(CGI.OperandList[i].Rec);
1432 // Construct the result for the dest-pattern operand list.
1433 TreePatternNode *OpNode = InVal->clone();
1435 // No predicate is useful on the result.
1436 OpNode->setPredicateFn("");
1438 // Promote the xform function to be an explicit node if set.
1439 if (Record *Xform = OpNode->getTransformFn()) {
1440 OpNode->setTransformFn(0);
1441 std::vector<TreePatternNode*> Children;
1442 Children.push_back(OpNode);
1443 OpNode = new TreePatternNode(Xform, Children);
1446 ResultNodeOperands.push_back(OpNode);
1449 if (!InstInputsCheck.empty())
1450 I->error("Input operand $" + InstInputsCheck.begin()->first +
1451 " occurs in pattern but not in operands list!");
1453 TreePatternNode *ResultPattern =
1454 new TreePatternNode(I->getRecord(), ResultNodeOperands);
1455 // Copy fully inferred output node type to instruction result pattern.
1457 ResultPattern->setTypes(Res0Node->getExtTypes());
1459 // Create and insert the instruction.
1460 DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
1461 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
1463 // Use a temporary tree pattern to infer all types and make sure that the
1464 // constructed result is correct. This depends on the instruction already
1465 // being inserted into the Instructions map.
1466 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
1467 Temp.InferAllTypes();
1469 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
1470 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
1475 // If we can, convert the instructions to be patterns that are matched!
1476 for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
1477 E = Instructions.end(); II != E; ++II) {
1478 DAGInstruction &TheInst = II->second;
1479 TreePattern *I = TheInst.getPattern();
1480 if (I == 0) continue; // No pattern.
1482 if (I->getNumTrees() != 1) {
1483 std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
1486 TreePatternNode *Pattern = I->getTree(0);
1487 TreePatternNode *SrcPattern;
1488 if (Pattern->getOperator()->getName() == "set") {
1489 if (Pattern->getNumChildren() != 2)
1490 continue; // Not a set of a single value (not handled so far)
1492 SrcPattern = Pattern->getChild(1)->clone();
1494 // Not a set (store or something?)
1495 SrcPattern = Pattern;
1499 if (!SrcPattern->canPatternMatch(Reason, *this))
1500 I->error("Instruction can never match: " + Reason);
1502 Record *Instr = II->first;
1503 TreePatternNode *DstPattern = TheInst.getResultPattern();
1505 push_back(PatternToMatch(Instr->getValueAsListInit("Predicates"),
1506 SrcPattern, DstPattern,
1507 Instr->getValueAsInt("AddedComplexity")));
1511 void DAGISelEmitter::ParsePatterns() {
1512 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
1514 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
1515 DagInit *Tree = Patterns[i]->getValueAsDag("PatternToMatch");
1516 TreePattern *Pattern = new TreePattern(Patterns[i], Tree, true, *this);
1518 // Inline pattern fragments into it.
1519 Pattern->InlinePatternFragments();
1521 // Infer as many types as possible. If we cannot infer all of them, we can
1522 // never do anything with this pattern: report it to the user.
1523 if (!Pattern->InferAllTypes())
1524 Pattern->error("Could not infer all types in pattern!");
1526 // Validate that the input pattern is correct.
1528 std::map<std::string, TreePatternNode*> InstInputs;
1529 std::map<std::string, TreePatternNode*> InstResults;
1530 std::vector<Record*> InstImpInputs;
1531 std::vector<Record*> InstImpResults;
1532 FindPatternInputsAndOutputs(Pattern, Pattern->getOnlyTree(),
1533 InstInputs, InstResults,
1534 InstImpInputs, InstImpResults);
1537 ListInit *LI = Patterns[i]->getValueAsListInit("ResultInstrs");
1538 if (LI->getSize() == 0) continue; // no pattern.
1540 // Parse the instruction.
1541 TreePattern *Result = new TreePattern(Patterns[i], LI, false, *this);
1543 // Inline pattern fragments into it.
1544 Result->InlinePatternFragments();
1546 // Infer as many types as possible. If we cannot infer all of them, we can
1547 // never do anything with this pattern: report it to the user.
1548 if (!Result->InferAllTypes())
1549 Result->error("Could not infer all types in pattern result!");
1551 if (Result->getNumTrees() != 1)
1552 Result->error("Cannot handle instructions producing instructions "
1553 "with temporaries yet!");
1555 // Promote the xform function to be an explicit node if set.
1556 std::vector<TreePatternNode*> ResultNodeOperands;
1557 TreePatternNode *DstPattern = Result->getOnlyTree();
1558 for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
1559 TreePatternNode *OpNode = DstPattern->getChild(ii);
1560 if (Record *Xform = OpNode->getTransformFn()) {
1561 OpNode->setTransformFn(0);
1562 std::vector<TreePatternNode*> Children;
1563 Children.push_back(OpNode);
1564 OpNode = new TreePatternNode(Xform, Children);
1566 ResultNodeOperands.push_back(OpNode);
1568 DstPattern = Result->getOnlyTree();
1569 if (!DstPattern->isLeaf())
1570 DstPattern = new TreePatternNode(DstPattern->getOperator(),
1571 ResultNodeOperands);
1572 DstPattern->setTypes(Result->getOnlyTree()->getExtTypes());
1573 TreePattern Temp(Result->getRecord(), DstPattern, false, *this);
1574 Temp.InferAllTypes();
1577 if (!Pattern->getOnlyTree()->canPatternMatch(Reason, *this))
1578 Pattern->error("Pattern can never match: " + Reason);
1581 push_back(PatternToMatch(Patterns[i]->getValueAsListInit("Predicates"),
1582 Pattern->getOnlyTree(),
1584 Patterns[i]->getValueAsInt("AddedComplexity")));
1588 /// CombineChildVariants - Given a bunch of permutations of each child of the
1589 /// 'operator' node, put them together in all possible ways.
1590 static void CombineChildVariants(TreePatternNode *Orig,
1591 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
1592 std::vector<TreePatternNode*> &OutVariants,
1593 DAGISelEmitter &ISE) {
1594 // Make sure that each operand has at least one variant to choose from.
1595 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1596 if (ChildVariants[i].empty())
1599 // The end result is an all-pairs construction of the resultant pattern.
1600 std::vector<unsigned> Idxs;
1601 Idxs.resize(ChildVariants.size());
1602 bool NotDone = true;
1604 // Create the variant and add it to the output list.
1605 std::vector<TreePatternNode*> NewChildren;
1606 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
1607 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
1608 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren);
1610 // Copy over properties.
1611 R->setName(Orig->getName());
1612 R->setPredicateFn(Orig->getPredicateFn());
1613 R->setTransformFn(Orig->getTransformFn());
1614 R->setTypes(Orig->getExtTypes());
1616 // If this pattern cannot every match, do not include it as a variant.
1617 std::string ErrString;
1618 if (!R->canPatternMatch(ErrString, ISE)) {
1621 bool AlreadyExists = false;
1623 // Scan to see if this pattern has already been emitted. We can get
1624 // duplication due to things like commuting:
1625 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
1626 // which are the same pattern. Ignore the dups.
1627 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
1628 if (R->isIsomorphicTo(OutVariants[i])) {
1629 AlreadyExists = true;
1636 OutVariants.push_back(R);
1639 // Increment indices to the next permutation.
1641 // Look for something we can increment without causing a wrap-around.
1642 for (unsigned IdxsIdx = 0; IdxsIdx != Idxs.size(); ++IdxsIdx) {
1643 if (++Idxs[IdxsIdx] < ChildVariants[IdxsIdx].size()) {
1644 NotDone = true; // Found something to increment.
1652 /// CombineChildVariants - A helper function for binary operators.
1654 static void CombineChildVariants(TreePatternNode *Orig,
1655 const std::vector<TreePatternNode*> &LHS,
1656 const std::vector<TreePatternNode*> &RHS,
1657 std::vector<TreePatternNode*> &OutVariants,
1658 DAGISelEmitter &ISE) {
1659 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1660 ChildVariants.push_back(LHS);
1661 ChildVariants.push_back(RHS);
1662 CombineChildVariants(Orig, ChildVariants, OutVariants, ISE);
1666 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
1667 std::vector<TreePatternNode *> &Children) {
1668 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
1669 Record *Operator = N->getOperator();
1671 // Only permit raw nodes.
1672 if (!N->getName().empty() || !N->getPredicateFn().empty() ||
1673 N->getTransformFn()) {
1674 Children.push_back(N);
1678 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
1679 Children.push_back(N->getChild(0));
1681 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
1683 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
1684 Children.push_back(N->getChild(1));
1686 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
1689 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
1690 /// the (potentially recursive) pattern by using algebraic laws.
1692 static void GenerateVariantsOf(TreePatternNode *N,
1693 std::vector<TreePatternNode*> &OutVariants,
1694 DAGISelEmitter &ISE) {
1695 // We cannot permute leaves.
1697 OutVariants.push_back(N);
1701 // Look up interesting info about the node.
1702 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(N->getOperator());
1704 // If this node is associative, reassociate.
1705 if (NodeInfo.hasProperty(SDNodeInfo::SDNPAssociative)) {
1706 // Reassociate by pulling together all of the linked operators
1707 std::vector<TreePatternNode*> MaximalChildren;
1708 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
1710 // Only handle child sizes of 3. Otherwise we'll end up trying too many
1712 if (MaximalChildren.size() == 3) {
1713 // Find the variants of all of our maximal children.
1714 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
1715 GenerateVariantsOf(MaximalChildren[0], AVariants, ISE);
1716 GenerateVariantsOf(MaximalChildren[1], BVariants, ISE);
1717 GenerateVariantsOf(MaximalChildren[2], CVariants, ISE);
1719 // There are only two ways we can permute the tree:
1720 // (A op B) op C and A op (B op C)
1721 // Within these forms, we can also permute A/B/C.
1723 // Generate legal pair permutations of A/B/C.
1724 std::vector<TreePatternNode*> ABVariants;
1725 std::vector<TreePatternNode*> BAVariants;
1726 std::vector<TreePatternNode*> ACVariants;
1727 std::vector<TreePatternNode*> CAVariants;
1728 std::vector<TreePatternNode*> BCVariants;
1729 std::vector<TreePatternNode*> CBVariants;
1730 CombineChildVariants(N, AVariants, BVariants, ABVariants, ISE);
1731 CombineChildVariants(N, BVariants, AVariants, BAVariants, ISE);
1732 CombineChildVariants(N, AVariants, CVariants, ACVariants, ISE);
1733 CombineChildVariants(N, CVariants, AVariants, CAVariants, ISE);
1734 CombineChildVariants(N, BVariants, CVariants, BCVariants, ISE);
1735 CombineChildVariants(N, CVariants, BVariants, CBVariants, ISE);
1737 // Combine those into the result: (x op x) op x
1738 CombineChildVariants(N, ABVariants, CVariants, OutVariants, ISE);
1739 CombineChildVariants(N, BAVariants, CVariants, OutVariants, ISE);
1740 CombineChildVariants(N, ACVariants, BVariants, OutVariants, ISE);
1741 CombineChildVariants(N, CAVariants, BVariants, OutVariants, ISE);
1742 CombineChildVariants(N, BCVariants, AVariants, OutVariants, ISE);
1743 CombineChildVariants(N, CBVariants, AVariants, OutVariants, ISE);
1745 // Combine those into the result: x op (x op x)
1746 CombineChildVariants(N, CVariants, ABVariants, OutVariants, ISE);
1747 CombineChildVariants(N, CVariants, BAVariants, OutVariants, ISE);
1748 CombineChildVariants(N, BVariants, ACVariants, OutVariants, ISE);
1749 CombineChildVariants(N, BVariants, CAVariants, OutVariants, ISE);
1750 CombineChildVariants(N, AVariants, BCVariants, OutVariants, ISE);
1751 CombineChildVariants(N, AVariants, CBVariants, OutVariants, ISE);
1756 // Compute permutations of all children.
1757 std::vector<std::vector<TreePatternNode*> > ChildVariants;
1758 ChildVariants.resize(N->getNumChildren());
1759 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1760 GenerateVariantsOf(N->getChild(i), ChildVariants[i], ISE);
1762 // Build all permutations based on how the children were formed.
1763 CombineChildVariants(N, ChildVariants, OutVariants, ISE);
1765 // If this node is commutative, consider the commuted order.
1766 if (NodeInfo.hasProperty(SDNodeInfo::SDNPCommutative)) {
1767 assert(N->getNumChildren()==2 &&"Commutative but doesn't have 2 children!");
1768 // Consider the commuted order.
1769 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
1775 // GenerateVariants - Generate variants. For example, commutative patterns can
1776 // match multiple ways. Add them to PatternsToMatch as well.
1777 void DAGISelEmitter::GenerateVariants() {
1779 DEBUG(std::cerr << "Generating instruction variants.\n");
1781 // Loop over all of the patterns we've collected, checking to see if we can
1782 // generate variants of the instruction, through the exploitation of
1783 // identities. This permits the target to provide agressive matching without
1784 // the .td file having to contain tons of variants of instructions.
1786 // Note that this loop adds new patterns to the PatternsToMatch list, but we
1787 // intentionally do not reconsider these. Any variants of added patterns have
1788 // already been added.
1790 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
1791 std::vector<TreePatternNode*> Variants;
1792 GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this);
1794 assert(!Variants.empty() && "Must create at least original variant!");
1795 Variants.erase(Variants.begin()); // Remove the original pattern.
1797 if (Variants.empty()) // No variants for this pattern.
1800 DEBUG(std::cerr << "FOUND VARIANTS OF: ";
1801 PatternsToMatch[i].getSrcPattern()->dump();
1804 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
1805 TreePatternNode *Variant = Variants[v];
1807 DEBUG(std::cerr << " VAR#" << v << ": ";
1811 // Scan to see if an instruction or explicit pattern already matches this.
1812 bool AlreadyExists = false;
1813 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
1814 // Check to see if this variant already exists.
1815 if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern())) {
1816 DEBUG(std::cerr << " *** ALREADY EXISTS, ignoring variant.\n");
1817 AlreadyExists = true;
1821 // If we already have it, ignore the variant.
1822 if (AlreadyExists) continue;
1824 // Otherwise, add it to the list of patterns we have.
1826 push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
1827 Variant, PatternsToMatch[i].getDstPattern(),
1828 PatternsToMatch[i].getAddedComplexity()));
1831 DEBUG(std::cerr << "\n");
1836 // NodeIsComplexPattern - return true if N is a leaf node and a subclass of
1838 static bool NodeIsComplexPattern(TreePatternNode *N)
1840 return (N->isLeaf() &&
1841 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1842 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1843 isSubClassOf("ComplexPattern"));
1846 // NodeGetComplexPattern - return the pointer to the ComplexPattern if N
1847 // is a leaf node and a subclass of ComplexPattern, else it returns NULL.
1848 static const ComplexPattern *NodeGetComplexPattern(TreePatternNode *N,
1849 DAGISelEmitter &ISE)
1852 dynamic_cast<DefInit*>(N->getLeafValue()) &&
1853 static_cast<DefInit*>(N->getLeafValue())->getDef()->
1854 isSubClassOf("ComplexPattern")) {
1855 return &ISE.getComplexPattern(static_cast<DefInit*>(N->getLeafValue())
1861 /// getPatternSize - Return the 'size' of this pattern. We want to match large
1862 /// patterns before small ones. This is used to determine the size of a
1864 static unsigned getPatternSize(TreePatternNode *P, DAGISelEmitter &ISE) {
1865 assert(isExtIntegerInVTs(P->getExtTypes()) ||
1866 isExtFloatingPointInVTs(P->getExtTypes()) ||
1867 P->getExtTypeNum(0) == MVT::isVoid ||
1868 P->getExtTypeNum(0) == MVT::Flag &&
1869 "Not a valid pattern node to size!");
1870 unsigned Size = 2; // The node itself.
1871 // If the root node is a ConstantSDNode, increases its size.
1872 // e.g. (set R32:$dst, 0).
1873 if (P->isLeaf() && dynamic_cast<IntInit*>(P->getLeafValue()))
1876 // FIXME: This is a hack to statically increase the priority of patterns
1877 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
1878 // Later we can allow complexity / cost for each pattern to be (optionally)
1879 // specified. To get best possible pattern match we'll need to dynamically
1880 // calculate the complexity of all patterns a dag can potentially map to.
1881 const ComplexPattern *AM = NodeGetComplexPattern(P, ISE);
1883 Size += AM->getNumOperands() * 2;
1885 // If this node has some predicate function that must match, it adds to the
1886 // complexity of this node.
1887 if (!P->getPredicateFn().empty())
1890 // Count children in the count if they are also nodes.
1891 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {
1892 TreePatternNode *Child = P->getChild(i);
1893 if (!Child->isLeaf() && Child->getExtTypeNum(0) != MVT::Other)
1894 Size += getPatternSize(Child, ISE);
1895 else if (Child->isLeaf()) {
1896 if (dynamic_cast<IntInit*>(Child->getLeafValue()))
1897 Size += 3; // Matches a ConstantSDNode (+2) and a specific value (+1).
1898 else if (NodeIsComplexPattern(Child))
1899 Size += getPatternSize(Child, ISE);
1900 else if (!Child->getPredicateFn().empty())
1908 /// getResultPatternCost - Compute the number of instructions for this pattern.
1909 /// This is a temporary hack. We should really include the instruction
1910 /// latencies in this calculation.
1911 static unsigned getResultPatternCost(TreePatternNode *P, DAGISelEmitter &ISE) {
1912 if (P->isLeaf()) return 0;
1915 Record *Op = P->getOperator();
1916 if (Op->isSubClassOf("Instruction")) {
1918 CodeGenInstruction &II = ISE.getTargetInfo().getInstruction(Op->getName());
1919 if (II.usesCustomDAGSchedInserter)
1922 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
1923 Cost += getResultPatternCost(P->getChild(i), ISE);
1927 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
1928 // In particular, we want to match maximal patterns first and lowest cost within
1929 // a particular complexity first.
1930 struct PatternSortingPredicate {
1931 PatternSortingPredicate(DAGISelEmitter &ise) : ISE(ise) {};
1932 DAGISelEmitter &ISE;
1934 bool operator()(PatternToMatch *LHS,
1935 PatternToMatch *RHS) {
1936 unsigned LHSSize = getPatternSize(LHS->getSrcPattern(), ISE);
1937 unsigned RHSSize = getPatternSize(RHS->getSrcPattern(), ISE);
1938 LHSSize += LHS->getAddedComplexity();
1939 RHSSize += RHS->getAddedComplexity();
1940 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
1941 if (LHSSize < RHSSize) return false;
1943 // If the patterns have equal complexity, compare generated instruction cost
1944 return getResultPatternCost(LHS->getDstPattern(), ISE) <
1945 getResultPatternCost(RHS->getDstPattern(), ISE);
1949 /// getRegisterValueType - Look up and return the first ValueType of specified
1950 /// RegisterClass record
1951 static MVT::ValueType getRegisterValueType(Record *R, const CodeGenTarget &T) {
1952 if (const CodeGenRegisterClass *RC = T.getRegisterClassForRegister(R))
1953 return RC->getValueTypeNum(0);
1958 /// RemoveAllTypes - A quick recursive walk over a pattern which removes all
1959 /// type information from it.
1960 static void RemoveAllTypes(TreePatternNode *N) {
1963 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1964 RemoveAllTypes(N->getChild(i));
1967 Record *DAGISelEmitter::getSDNodeNamed(const std::string &Name) const {
1968 Record *N = Records.getDef(Name);
1969 if (!N || !N->isSubClassOf("SDNode")) {
1970 std::cerr << "Error getting SDNode '" << Name << "'!\n";
1976 /// NodeHasProperty - return true if TreePatternNode has the specified
1978 static bool NodeHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
1979 DAGISelEmitter &ISE)
1981 if (N->isLeaf()) return false;
1982 Record *Operator = N->getOperator();
1983 if (!Operator->isSubClassOf("SDNode")) return false;
1985 const SDNodeInfo &NodeInfo = ISE.getSDNodeInfo(Operator);
1986 return NodeInfo.hasProperty(Property);
1989 static bool PatternHasProperty(TreePatternNode *N, SDNodeInfo::SDNP Property,
1990 DAGISelEmitter &ISE)
1992 if (NodeHasProperty(N, Property, ISE))
1995 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
1996 TreePatternNode *Child = N->getChild(i);
1997 if (PatternHasProperty(Child, Property, ISE))
2004 class PatternCodeEmitter {
2006 DAGISelEmitter &ISE;
2009 ListInit *Predicates;
2012 // Instruction selector pattern.
2013 TreePatternNode *Pattern;
2014 // Matched instruction.
2015 TreePatternNode *Instruction;
2017 // Node to name mapping
2018 std::map<std::string, std::string> VariableMap;
2019 // Node to operator mapping
2020 std::map<std::string, Record*> OperatorMap;
2021 // Names of all the folded nodes which produce chains.
2022 std::vector<std::pair<std::string, unsigned> > FoldedChains;
2023 std::set<std::string> Duplicates;
2024 /// These nodes are being marked "in-flight" so they cannot be folded.
2025 std::vector<std::string> InflightNodes;
2027 /// GeneratedCode - This is the buffer that we emit code to. The first bool
2028 /// indicates whether this is an exit predicate (something that should be
2029 /// tested, and if true, the match fails) [when true] or normal code to emit
2031 std::vector<std::pair<bool, std::string> > &GeneratedCode;
2032 /// GeneratedDecl - This is the set of all SDOperand declarations needed for
2033 /// the set of patterns for each top-level opcode.
2034 std::set<std::pair<bool, std::string> > &GeneratedDecl;
2036 std::string ChainName;
2041 void emitCheck(const std::string &S) {
2043 GeneratedCode.push_back(std::make_pair(true, S));
2045 void emitCode(const std::string &S) {
2047 GeneratedCode.push_back(std::make_pair(false, S));
2049 void emitDecl(const std::string &S, bool isSDNode=false) {
2050 assert(!S.empty() && "Invalid declaration");
2051 GeneratedDecl.insert(std::make_pair(isSDNode, S));
2054 PatternCodeEmitter(DAGISelEmitter &ise, ListInit *preds,
2055 TreePatternNode *pattern, TreePatternNode *instr,
2056 std::vector<std::pair<bool, std::string> > &gc,
2057 std::set<std::pair<bool, std::string> > &gd,
2059 : ISE(ise), Predicates(preds), Pattern(pattern), Instruction(instr),
2060 GeneratedCode(gc), GeneratedDecl(gd),
2061 NewTF(false), DoReplace(dorep), TmpNo(0) {}
2063 /// EmitMatchCode - Emit a matcher for N, going to the label for PatternNo
2064 /// if the match fails. At this point, we already know that the opcode for N
2065 /// matches, and the SDNode for the result has the RootName specified name.
2066 void EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
2067 const std::string &RootName, const std::string &ParentName,
2068 const std::string &ChainSuffix, bool &FoundChain) {
2069 bool isRoot = (P == NULL);
2070 // Emit instruction predicates. Each predicate is just a string for now.
2072 std::string PredicateCheck;
2073 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
2074 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
2075 Record *Def = Pred->getDef();
2076 if (!Def->isSubClassOf("Predicate")) {
2078 assert(0 && "Unknown predicate type!");
2080 if (!PredicateCheck.empty())
2081 PredicateCheck += " || ";
2082 PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
2086 emitCheck(PredicateCheck);
2090 if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2091 emitCheck("cast<ConstantSDNode>(" + RootName +
2092 ")->getSignExtended() == " + itostr(II->getValue()));
2094 } else if (!NodeIsComplexPattern(N)) {
2095 assert(0 && "Cannot match this as a leaf value!");
2100 // If this node has a name associated with it, capture it in VariableMap. If
2101 // we already saw this in the pattern, emit code to verify dagness.
2102 if (!N->getName().empty()) {
2103 std::string &VarMapEntry = VariableMap[N->getName()];
2104 if (VarMapEntry.empty()) {
2105 VarMapEntry = RootName;
2107 // If we get here, this is a second reference to a specific name. Since
2108 // we already have checked that the first reference is valid, we don't
2109 // have to recursively match it, just check that it's the same as the
2110 // previously named thing.
2111 emitCheck(VarMapEntry + " == " + RootName);
2116 OperatorMap[N->getName()] = N->getOperator();
2120 // Emit code to load the child nodes and match their contents recursively.
2122 bool NodeHasChain = NodeHasProperty (N, SDNodeInfo::SDNPHasChain, ISE);
2123 bool HasChain = PatternHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
2124 bool HasOutFlag = PatternHasProperty(N, SDNodeInfo::SDNPOutFlag, ISE);
2125 bool EmittedUseCheck = false;
2126 bool EmittedSlctedCheck = false;
2131 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
2133 emitCheck("InFlightSet.count(" + RootName + ".Val) == 0");
2134 // Multiple uses of actual result?
2135 emitCheck(RootName + ".hasOneUse()");
2136 EmittedUseCheck = true;
2137 // hasOneUse() check is not strong enough. If the original node has
2138 // already been selected, it may have been replaced with another.
2139 for (unsigned j = 0; j != CInfo.getNumResults(); j++)
2140 emitCheck("!CodeGenMap.count(" + RootName + ".getValue(" + utostr(j) +
2143 EmittedSlctedCheck = true;
2145 // FIXME: Don't fold if 1) the parent node writes a flag, 2) the node
2147 // This a workaround for this problem:
2152 // [XX]--/ \- [flag : cmp]
2157 // cmp + br should be considered as a single node as they are flagged
2158 // together. So, if the ld is folded into the cmp, the XX node in the
2159 // graph is now both an operand and a use of the ld/cmp/br node.
2160 if (NodeHasProperty(P, SDNodeInfo::SDNPOutFlag, ISE))
2161 emitCheck(ParentName + ".Val->isOnlyUse(" + RootName + ".Val)");
2163 // If the immediate use can somehow reach this node through another
2164 // path, then can't fold it either or it will create a cycle.
2165 // e.g. In the following diagram, XX can reach ld through YY. If
2166 // ld is folded into XX, then YY is both a predecessor and a successor
2176 const SDNodeInfo &PInfo = ISE.getSDNodeInfo(P->getOperator());
2177 if (PInfo.getNumOperands() > 1 ||
2178 PInfo.hasProperty(SDNodeInfo::SDNPHasChain) ||
2179 PInfo.hasProperty(SDNodeInfo::SDNPInFlag) ||
2180 PInfo.hasProperty(SDNodeInfo::SDNPOptInFlag))
2181 if (PInfo.getNumOperands() > 1) {
2182 emitCheck("!isNonImmUse(" + ParentName + ".Val, " + RootName +
2185 emitCheck("(" + ParentName + ".getNumOperands() == 1 || !" +
2186 "isNonImmUse(" + ParentName + ".Val, " + RootName +
2193 ChainName = "Chain" + ChainSuffix;
2194 emitDecl(ChainName);
2196 // FIXME: temporary workaround for a common case where chain
2197 // is a TokenFactor and the previous "inner" chain is an operand.
2199 emitDecl("OldTF", true);
2200 emitCheck("(" + ChainName + " = UpdateFoldedChain(CurDAG, " +
2201 RootName + ".Val, Chain.Val, OldTF)).Val");
2204 emitCode(ChainName + " = " + RootName + ".getOperand(0);");
2209 // Don't fold any node which reads or writes a flag and has multiple uses.
2210 // FIXME: We really need to separate the concepts of flag and "glue". Those
2211 // real flag results, e.g. X86CMP output, can have multiple uses.
2212 // FIXME: If the optional incoming flag does not exist. Then it is ok to
2215 (PatternHasProperty(N, SDNodeInfo::SDNPInFlag, ISE) ||
2216 PatternHasProperty(N, SDNodeInfo::SDNPOptInFlag, ISE) ||
2217 PatternHasProperty(N, SDNodeInfo::SDNPOutFlag, ISE))) {
2218 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(N->getOperator());
2219 if (!EmittedUseCheck) {
2220 // Multiple uses of actual result?
2221 emitCheck(RootName + ".hasOneUse()");
2223 if (!EmittedSlctedCheck)
2224 // hasOneUse() check is not strong enough. If the original node has
2225 // already been selected, it may have been replaced with another.
2226 for (unsigned j = 0; j < CInfo.getNumResults(); j++)
2227 emitCheck("!CodeGenMap.count(" + RootName + ".getValue(" + utostr(j) +
2231 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2232 emitDecl(RootName + utostr(OpNo));
2233 emitCode(RootName + utostr(OpNo) + " = " +
2234 RootName + ".getOperand(" +utostr(OpNo) + ");");
2235 TreePatternNode *Child = N->getChild(i);
2237 if (!Child->isLeaf()) {
2238 // If it's not a leaf, recursively match.
2239 const SDNodeInfo &CInfo = ISE.getSDNodeInfo(Child->getOperator());
2240 emitCheck(RootName + utostr(OpNo) + ".getOpcode() == " +
2241 CInfo.getEnumName());
2242 EmitMatchCode(Child, N, RootName + utostr(OpNo), RootName,
2243 ChainSuffix + utostr(OpNo), FoundChain);
2244 if (NodeHasProperty(Child, SDNodeInfo::SDNPHasChain, ISE))
2245 FoldedChains.push_back(std::make_pair(RootName + utostr(OpNo),
2246 CInfo.getNumResults()));
2248 // If this child has a name associated with it, capture it in VarMap. If
2249 // we already saw this in the pattern, emit code to verify dagness.
2250 if (!Child->getName().empty()) {
2251 std::string &VarMapEntry = VariableMap[Child->getName()];
2252 if (VarMapEntry.empty()) {
2253 VarMapEntry = RootName + utostr(OpNo);
2255 // If we get here, this is a second reference to a specific name.
2256 // Since we already have checked that the first reference is valid,
2257 // we don't have to recursively match it, just check that it's the
2258 // same as the previously named thing.
2259 emitCheck(VarMapEntry + " == " + RootName + utostr(OpNo));
2260 Duplicates.insert(RootName + utostr(OpNo));
2265 // Handle leaves of various types.
2266 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2267 Record *LeafRec = DI->getDef();
2268 if (LeafRec->isSubClassOf("RegisterClass")) {
2269 // Handle register references. Nothing to do here.
2270 } else if (LeafRec->isSubClassOf("Register")) {
2271 // Handle register references.
2272 } else if (LeafRec->isSubClassOf("ComplexPattern")) {
2273 // Handle complex pattern. Nothing to do here.
2274 } else if (LeafRec->getName() == "srcvalue") {
2275 // Place holder for SRCVALUE nodes. Nothing to do here.
2276 } else if (LeafRec->isSubClassOf("ValueType")) {
2277 // Make sure this is the specified value type.
2278 emitCheck("cast<VTSDNode>(" + RootName + utostr(OpNo) +
2279 ")->getVT() == MVT::" + LeafRec->getName());
2280 } else if (LeafRec->isSubClassOf("CondCode")) {
2281 // Make sure this is the specified cond code.
2282 emitCheck("cast<CondCodeSDNode>(" + RootName + utostr(OpNo) +
2283 ")->get() == ISD::" + LeafRec->getName());
2287 assert(0 && "Unknown leaf type!");
2289 } else if (IntInit *II =
2290 dynamic_cast<IntInit*>(Child->getLeafValue())) {
2291 emitCheck("isa<ConstantSDNode>(" + RootName + utostr(OpNo) + ")");
2292 unsigned CTmp = TmpNo++;
2293 emitCode("int64_t CN"+utostr(CTmp)+" = cast<ConstantSDNode>("+
2294 RootName + utostr(OpNo) + ")->getSignExtended();");
2296 emitCheck("CN" + utostr(CTmp) + " == " +itostr(II->getValue()));
2299 assert(0 && "Unknown leaf type!");
2304 // If there is a node predicate for this, emit the call.
2305 if (!N->getPredicateFn().empty())
2306 emitCheck(N->getPredicateFn() + "(" + RootName + ".Val)");
2309 /// EmitResultCode - Emit the action for a pattern. Now that it has matched
2310 /// we actually have to build a DAG!
2311 std::pair<unsigned, unsigned>
2312 EmitResultCode(TreePatternNode *N, bool LikeLeaf = false,
2313 bool isRoot = false) {
2314 // This is something selected from the pattern we matched.
2315 if (!N->getName().empty()) {
2316 std::string &Val = VariableMap[N->getName()];
2317 assert(!Val.empty() &&
2318 "Variable referenced but not defined and not caught earlier!");
2319 if (Val[0] == 'T' && Val[1] == 'm' && Val[2] == 'p') {
2320 // Already selected this operand, just return the tmpval.
2321 return std::make_pair(1, atoi(Val.c_str()+3));
2324 const ComplexPattern *CP;
2325 unsigned ResNo = TmpNo++;
2326 unsigned NumRes = 1;
2327 if (!N->isLeaf() && N->getOperator()->getName() == "imm") {
2328 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2329 std::string CastType;
2330 switch (N->getTypeNum(0)) {
2331 default: assert(0 && "Unknown type for constant node!");
2332 case MVT::i1: CastType = "bool"; break;
2333 case MVT::i8: CastType = "unsigned char"; break;
2334 case MVT::i16: CastType = "unsigned short"; break;
2335 case MVT::i32: CastType = "unsigned"; break;
2336 case MVT::i64: CastType = "uint64_t"; break;
2338 emitCode(CastType + " Tmp" + utostr(ResNo) + "C = (" + CastType +
2339 ")cast<ConstantSDNode>(" + Val + ")->getValue();");
2340 emitDecl("Tmp" + utostr(ResNo));
2341 emitCode("Tmp" + utostr(ResNo) +
2342 " = CurDAG->getTargetConstant(Tmp" + utostr(ResNo) +
2343 "C, MVT::" + getEnumName(N->getTypeNum(0)) + ");");
2344 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2345 Record *Op = OperatorMap[N->getName()];
2346 // Transform ExternalSymbol to TargetExternalSymbol
2347 if (Op && Op->getName() == "externalsym") {
2348 emitDecl("Tmp" + utostr(ResNo));
2349 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
2350 "ExternalSymbol(cast<ExternalSymbolSDNode>(" +
2351 Val + ")->getSymbol(), MVT::" +
2352 getEnumName(N->getTypeNum(0)) + ");");
2354 emitDecl("Tmp" + utostr(ResNo));
2355 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2357 } else if (!N->isLeaf() && N->getOperator()->getName() == "tglobaladdr") {
2358 Record *Op = OperatorMap[N->getName()];
2359 // Transform GlobalAddress to TargetGlobalAddress
2360 if (Op && Op->getName() == "globaladdr") {
2361 emitDecl("Tmp" + utostr(ResNo));
2362 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getTarget"
2363 "GlobalAddress(cast<GlobalAddressSDNode>(" + Val +
2364 ")->getGlobal(), MVT::" + getEnumName(N->getTypeNum(0)) +
2367 emitDecl("Tmp" + utostr(ResNo));
2368 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2370 } else if (!N->isLeaf() && N->getOperator()->getName() == "texternalsym"){
2371 emitDecl("Tmp" + utostr(ResNo));
2372 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2373 } else if (!N->isLeaf() && N->getOperator()->getName() == "tconstpool") {
2374 emitDecl("Tmp" + utostr(ResNo));
2375 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2376 } else if (N->isLeaf() && (CP = NodeGetComplexPattern(N, ISE))) {
2377 std::string Fn = CP->getSelectFunc();
2378 NumRes = CP->getNumOperands();
2379 for (unsigned i = 0; i < NumRes; ++i)
2380 emitDecl("Tmp" + utostr(i+ResNo));
2382 std::string Code = Fn + "(" + Val;
2383 for (unsigned i = 0; i < NumRes; i++)
2384 Code += ", Tmp" + utostr(i + ResNo);
2385 emitCheck(Code + ")");
2387 for (unsigned i = 0; i < NumRes; ++i) {
2388 emitCode("InFlightSet.insert(Tmp" + utostr(i+ResNo) + ".Val);");
2389 InflightNodes.push_back("Tmp" + utostr(i+ResNo));
2391 for (unsigned i = 0; i < NumRes; ++i)
2392 emitCode("Select(Tmp" + utostr(i+ResNo) + ", Tmp" +
2393 utostr(i+ResNo) + ");");
2395 TmpNo = ResNo + NumRes;
2397 emitDecl("Tmp" + utostr(ResNo));
2398 // This node, probably wrapped in a SDNodeXForms, behaves like a leaf
2399 // node even if it isn't one. Don't select it.
2401 emitCode("Tmp" + utostr(ResNo) + " = " + Val + ";");
2403 emitCode("Select(Tmp" + utostr(ResNo) + ", " + Val + ");");
2406 if (isRoot && N->isLeaf()) {
2407 emitCode("Result = Tmp" + utostr(ResNo) + ";");
2408 emitCode("return;");
2411 // Add Tmp<ResNo> to VariableMap, so that we don't multiply select this
2412 // value if used multiple times by this pattern result.
2413 Val = "Tmp"+utostr(ResNo);
2414 return std::make_pair(NumRes, ResNo);
2417 // If this is an explicit register reference, handle it.
2418 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
2419 unsigned ResNo = TmpNo++;
2420 if (DI->getDef()->isSubClassOf("Register")) {
2421 emitDecl("Tmp" + utostr(ResNo));
2422 emitCode("Tmp" + utostr(ResNo) + " = CurDAG->getRegister(" +
2423 ISE.getQualifiedName(DI->getDef()) + ", MVT::" +
2424 getEnumName(N->getTypeNum(0)) + ");");
2425 return std::make_pair(1, ResNo);
2427 } else if (IntInit *II = dynamic_cast<IntInit*>(N->getLeafValue())) {
2428 unsigned ResNo = TmpNo++;
2429 assert(N->getExtTypes().size() == 1 && "Multiple types not handled!");
2430 emitDecl("Tmp" + utostr(ResNo));
2431 emitCode("Tmp" + utostr(ResNo) +
2432 " = CurDAG->getTargetConstant(" + itostr(II->getValue()) +
2433 ", MVT::" + getEnumName(N->getTypeNum(0)) + ");");
2434 return std::make_pair(1, ResNo);
2438 assert(0 && "Unknown leaf type!");
2439 return std::make_pair(1, ~0U);
2442 Record *Op = N->getOperator();
2443 if (Op->isSubClassOf("Instruction")) {
2444 const CodeGenTarget &CGT = ISE.getTargetInfo();
2445 CodeGenInstruction &II = CGT.getInstruction(Op->getName());
2446 const DAGInstruction &Inst = ISE.getInstruction(Op);
2447 TreePattern *InstPat = Inst.getPattern();
2448 TreePatternNode *InstPatNode =
2449 isRoot ? (InstPat ? InstPat->getOnlyTree() : Pattern)
2450 : (InstPat ? InstPat->getOnlyTree() : NULL);
2451 if (InstPatNode && InstPatNode->getOperator()->getName() == "set") {
2452 InstPatNode = InstPatNode->getChild(1);
2454 bool HasImpInputs = isRoot && Inst.getNumImpOperands() > 0;
2455 bool HasImpResults = isRoot && Inst.getNumImpResults() > 0;
2456 bool NodeHasOptInFlag = isRoot &&
2457 PatternHasProperty(Pattern, SDNodeInfo::SDNPOptInFlag, ISE);
2458 bool NodeHasInFlag = isRoot &&
2459 PatternHasProperty(Pattern, SDNodeInfo::SDNPInFlag, ISE);
2460 bool NodeHasOutFlag = HasImpResults || (isRoot &&
2461 PatternHasProperty(Pattern, SDNodeInfo::SDNPOutFlag, ISE));
2462 bool NodeHasChain = InstPatNode &&
2463 PatternHasProperty(InstPatNode, SDNodeInfo::SDNPHasChain, ISE);
2464 bool InputHasChain = isRoot &&
2465 NodeHasProperty(Pattern, SDNodeInfo::SDNPHasChain, ISE);
2467 if (NodeHasInFlag || NodeHasOutFlag || NodeHasOptInFlag || HasImpInputs)
2469 if (NodeHasOptInFlag)
2470 emitCode("bool HasOptInFlag = false;");
2472 // How many results is this pattern expected to produce?
2473 unsigned PatResults = 0;
2474 for (unsigned i = 0, e = Pattern->getExtTypes().size(); i != e; i++) {
2475 MVT::ValueType VT = Pattern->getTypeNum(i);
2476 if (VT != MVT::isVoid && VT != MVT::Flag)
2480 // Determine operand emission order. Complex pattern first.
2481 std::vector<std::pair<unsigned, TreePatternNode*> > EmitOrder;
2482 std::vector<std::pair<unsigned, TreePatternNode*> >::iterator OI;
2483 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2484 TreePatternNode *Child = N->getChild(i);
2486 EmitOrder.push_back(std::make_pair(i, Child));
2487 OI = EmitOrder.begin();
2488 } else if (NodeIsComplexPattern(Child)) {
2489 OI = EmitOrder.insert(OI, std::make_pair(i, Child));
2491 EmitOrder.push_back(std::make_pair(i, Child));
2495 // Make sure these operands which would be selected won't be folded while
2496 // the isel traverses the DAG upward.
2497 std::vector<std::pair<unsigned, unsigned> > NumTemps(EmitOrder.size());
2498 for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) {
2499 TreePatternNode *Child = EmitOrder[i].second;
2500 if (!Child->getName().empty()) {
2501 std::string &Val = VariableMap[Child->getName()];
2502 assert(!Val.empty() &&
2503 "Variable referenced but not defined and not caught earlier!");
2504 if (Child->isLeaf() && !NodeGetComplexPattern(Child, ISE)) {
2505 emitCode("InFlightSet.insert(" + Val + ".Val);");
2506 InflightNodes.push_back(Val);
2511 // Emit all of the operands.
2512 for (unsigned i = 0, e = EmitOrder.size(); i != e; ++i) {
2513 unsigned OpOrder = EmitOrder[i].first;
2514 TreePatternNode *Child = EmitOrder[i].second;
2515 std::pair<unsigned, unsigned> NumTemp = EmitResultCode(Child);
2516 NumTemps[OpOrder] = NumTemp;
2519 // List all the operands in the right order.
2520 std::vector<unsigned> Ops;
2521 for (unsigned i = 0, e = NumTemps.size(); i != e; i++) {
2522 for (unsigned j = 0; j < NumTemps[i].first; j++)
2523 Ops.push_back(NumTemps[i].second + j);
2526 // Emit all the chain and CopyToReg stuff.
2527 bool ChainEmitted = NodeHasChain;
2529 emitCode("Select(" + ChainName + ", " + ChainName + ");");
2530 if (NodeHasInFlag || NodeHasOptInFlag || HasImpInputs)
2531 EmitInFlagSelectCode(Pattern, "N", ChainEmitted, true);
2534 // The operands have been selected. Remove them from InFlightSet.
2535 for (std::vector<std::string>::iterator AI = InflightNodes.begin(),
2536 AE = InflightNodes.end(); AI != AE; ++AI)
2537 emitCode("InFlightSet.erase(" + *AI + ".Val);");
2540 unsigned NumResults = Inst.getNumResults();
2541 unsigned ResNo = TmpNo++;
2542 if (!isRoot || InputHasChain || NodeHasChain || NodeHasOutFlag ||
2544 if (NodeHasOptInFlag) {
2545 unsigned FlagNo = (unsigned) NodeHasChain + Pattern->getNumChildren();
2546 emitDecl("ResNode", true);
2547 emitCode("if (HasOptInFlag)");
2548 std::string Code = " ResNode = CurDAG->getTargetNode(" +
2549 II.Namespace + "::" + II.TheDef->getName();
2551 // Output order: results, chain, flags
2553 if (PatResults > 0) {
2554 if (N->getTypeNum(0) != MVT::isVoid)
2555 Code += ", MVT::" + getEnumName(N->getTypeNum(0));
2558 Code += ", MVT::Other";
2560 Code += ", MVT::Flag";
2563 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2564 Code += ", Tmp" + utostr(Ops[i]);
2565 if (NodeHasChain) Code += ", " + ChainName;
2566 emitCode(Code + ", InFlag);");
2569 Code = " ResNode = CurDAG->getTargetNode(" + II.Namespace + "::" +
2570 II.TheDef->getName();
2572 // Output order: results, chain, flags
2574 if (PatResults > 0 && N->getTypeNum(0) != MVT::isVoid)
2575 Code += ", MVT::" + getEnumName(N->getTypeNum(0));
2577 Code += ", MVT::Other";
2579 Code += ", MVT::Flag";
2582 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2583 Code += ", Tmp" + utostr(Ops[i]);
2584 if (NodeHasChain) Code += ", " + ChainName + ");";
2588 // Remember which op produces the chain.
2589 emitCode(ChainName + " = SDOperand(ResNode" +
2590 ", " + utostr(PatResults) + ");");
2593 std::string NodeName;
2595 NodeName = "Tmp" + utostr(ResNo);
2597 Code = NodeName + " = SDOperand(";
2599 NodeName = "ResNode";
2600 emitDecl(NodeName, true);
2601 Code = NodeName + " = ";
2603 Code += "CurDAG->getTargetNode(" +
2604 II.Namespace + "::" + II.TheDef->getName();
2606 // Output order: results, chain, flags
2608 if (NumResults > 0 && N->getTypeNum(0) != MVT::isVoid)
2609 Code += ", MVT::" + getEnumName(N->getTypeNum(0));
2611 Code += ", MVT::Other";
2613 Code += ", MVT::Flag";
2616 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2617 Code += ", Tmp" + utostr(Ops[i]);
2618 if (NodeHasChain) Code += ", " + ChainName;
2619 if (NodeHasInFlag || HasImpInputs) Code += ", InFlag";
2621 emitCode(Code + "), 0);");
2623 emitCode(Code + ");");
2626 // Remember which op produces the chain.
2628 emitCode(ChainName + " = SDOperand(" + NodeName +
2629 ".Val, " + utostr(PatResults) + ");");
2631 emitCode(ChainName + " = SDOperand(" + NodeName +
2632 ", " + utostr(PatResults) + ");");
2636 return std::make_pair(1, ResNo);
2639 emitCode("if (OldTF) "
2640 "SelectionDAG::InsertISelMapEntry(CodeGenMap, OldTF, 0, " +
2641 ChainName + ".Val, 0);");
2643 for (unsigned i = 0; i < NumResults; i++)
2644 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2645 utostr(i) + ", ResNode, " + utostr(i) + ");");
2648 emitCode("InFlag = SDOperand(ResNode, " +
2649 utostr(NumResults + (unsigned)NodeHasChain) + ");");
2651 if (HasImpResults && EmitCopyFromRegs(N, ChainEmitted)) {
2652 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, "
2657 if (InputHasChain) {
2658 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2659 utostr(PatResults) + ", " + ChainName + ".Val, " +
2660 ChainName + ".ResNo" + ");");
2662 emitCode("if (N.ResNo == 0) AddHandleReplacement(N.Val, " +
2663 utostr(PatResults) + ", " + ChainName + ".Val, " +
2664 ChainName + ".ResNo" + ");");
2667 if (FoldedChains.size() > 0) {
2669 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
2670 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, " +
2671 FoldedChains[j].first + ".Val, " +
2672 utostr(FoldedChains[j].second) + ", ResNode, " +
2673 utostr(NumResults) + ");");
2675 for (unsigned j = 0, e = FoldedChains.size(); j < e; j++) {
2677 FoldedChains[j].first + ".Val, " +
2678 utostr(FoldedChains[j].second) + ", ";
2679 emitCode("AddHandleReplacement(" + Code + "ResNode, " +
2680 utostr(NumResults) + ");");
2685 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, " +
2686 utostr(PatResults + (unsigned)InputHasChain) +
2687 ", InFlag.Val, InFlag.ResNo);");
2689 // User does not expect the instruction would produce a chain!
2690 bool AddedChain = NodeHasChain && !InputHasChain;
2691 if (AddedChain && NodeHasOutFlag) {
2692 if (PatResults == 0) {
2693 emitCode("Result = SDOperand(ResNode, N.ResNo+1);");
2695 emitCode("if (N.ResNo < " + utostr(PatResults) + ")");
2696 emitCode(" Result = SDOperand(ResNode, N.ResNo);");
2698 emitCode(" Result = SDOperand(ResNode, N.ResNo+1);");
2700 } else if (InputHasChain && !NodeHasChain) {
2701 // One of the inner node produces a chain.
2702 emitCode("if (N.ResNo < " + utostr(PatResults) + ")");
2703 emitCode(" Result = SDOperand(ResNode, N.ResNo);");
2704 if (NodeHasOutFlag) {
2705 emitCode("else if (N.ResNo > " + utostr(PatResults) + ")");
2706 emitCode(" Result = SDOperand(ResNode, N.ResNo-1);");
2709 emitCode(" Result = SDOperand(" + ChainName + ".Val, " + ChainName + ".ResNo);");
2711 emitCode("Result = SDOperand(ResNode, N.ResNo);");
2714 // If this instruction is the root, and if there is only one use of it,
2715 // use SelectNodeTo instead of getTargetNode to avoid an allocation.
2716 emitCode("if (N.Val->hasOneUse()) {");
2717 std::string Code = " Result = CurDAG->SelectNodeTo(N.Val, " +
2718 II.Namespace + "::" + II.TheDef->getName();
2719 if (N->getTypeNum(0) != MVT::isVoid)
2720 Code += ", MVT::" + getEnumName(N->getTypeNum(0));
2722 Code += ", MVT::Flag";
2723 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2724 Code += ", Tmp" + utostr(Ops[i]);
2725 if (NodeHasInFlag || HasImpInputs)
2727 emitCode(Code + ");");
2728 emitCode("} else {");
2729 emitDecl("ResNode", true);
2730 Code = " ResNode = CurDAG->getTargetNode(" +
2731 II.Namespace + "::" + II.TheDef->getName();
2732 if (N->getTypeNum(0) != MVT::isVoid)
2733 Code += ", MVT::" + getEnumName(N->getTypeNum(0));
2735 Code += ", MVT::Flag";
2736 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2737 Code += ", Tmp" + utostr(Ops[i]);
2738 if (NodeHasInFlag || HasImpInputs)
2740 emitCode(Code + ");");
2741 emitCode(" SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
2743 emitCode(" Result = SDOperand(ResNode, 0);");
2748 emitCode("return;");
2749 return std::make_pair(1, ResNo);
2750 } else if (Op->isSubClassOf("SDNodeXForm")) {
2751 assert(N->getNumChildren() == 1 && "node xform should have one child!");
2752 // PatLeaf node - the operand may or may not be a leaf node. But it should
2754 unsigned OpVal = EmitResultCode(N->getChild(0), true).second;
2755 unsigned ResNo = TmpNo++;
2756 emitDecl("Tmp" + utostr(ResNo));
2757 emitCode("Tmp" + utostr(ResNo) + " = Transform_" + Op->getName()
2758 + "(Tmp" + utostr(OpVal) + ".Val);");
2760 emitCode("SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val,"
2761 "N.ResNo, Tmp" + utostr(ResNo) + ".Val, Tmp" +
2762 utostr(ResNo) + ".ResNo);");
2763 emitCode("Result = Tmp" + utostr(ResNo) + ";");
2764 emitCode("return;");
2766 return std::make_pair(1, ResNo);
2770 throw std::string("Unknown node in result pattern!");
2774 /// InsertOneTypeCheck - Insert a type-check for an unresolved type in 'Pat'
2775 /// and add it to the tree. 'Pat' and 'Other' are isomorphic trees except that
2776 /// 'Pat' may be missing types. If we find an unresolved type to add a check
2777 /// for, this returns true otherwise false if Pat has all types.
2778 bool InsertOneTypeCheck(TreePatternNode *Pat, TreePatternNode *Other,
2779 const std::string &Prefix) {
2781 if (!Pat->hasTypeSet()) {
2782 // Move a type over from 'other' to 'pat'.
2783 Pat->setTypes(Other->getExtTypes());
2784 emitCheck(Prefix + ".Val->getValueType(0) == MVT::" +
2785 getName(Pat->getTypeNum(0)));
2790 (unsigned) NodeHasProperty(Pat, SDNodeInfo::SDNPHasChain, ISE);
2791 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i, ++OpNo)
2792 if (InsertOneTypeCheck(Pat->getChild(i), Other->getChild(i),
2793 Prefix + utostr(OpNo)))
2799 /// EmitInFlagSelectCode - Emit the flag operands for the DAG that is
2801 void EmitInFlagSelectCode(TreePatternNode *N, const std::string &RootName,
2802 bool &ChainEmitted, bool isRoot = false) {
2803 const CodeGenTarget &T = ISE.getTargetInfo();
2805 (unsigned) NodeHasProperty(N, SDNodeInfo::SDNPHasChain, ISE);
2806 bool HasInFlag = NodeHasProperty(N, SDNodeInfo::SDNPInFlag, ISE);
2807 bool HasOptInFlag = NodeHasProperty(N, SDNodeInfo::SDNPOptInFlag, ISE);
2808 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
2809 TreePatternNode *Child = N->getChild(i);
2810 if (!Child->isLeaf()) {
2811 EmitInFlagSelectCode(Child, RootName + utostr(OpNo), ChainEmitted);
2813 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2814 if (!Child->getName().empty()) {
2815 std::string Name = RootName + utostr(OpNo);
2816 if (Duplicates.find(Name) != Duplicates.end())
2817 // A duplicate! Do not emit a copy for this node.
2821 Record *RR = DI->getDef();
2822 if (RR->isSubClassOf("Register")) {
2823 MVT::ValueType RVT = getRegisterValueType(RR, T);
2824 if (RVT == MVT::Flag) {
2825 emitCode("Select(InFlag, " + RootName + utostr(OpNo) + ");");
2827 if (!ChainEmitted) {
2829 emitCode("Chain = CurDAG->getEntryNode();");
2830 ChainName = "Chain";
2831 ChainEmitted = true;
2833 emitCode("Select(" + RootName + utostr(OpNo) + ", " +
2834 RootName + utostr(OpNo) + ");");
2835 emitCode("ResNode = CurDAG->getCopyToReg(" + ChainName +
2836 ", CurDAG->getRegister(" + ISE.getQualifiedName(RR) +
2837 ", MVT::" + getEnumName(RVT) + "), " +
2838 RootName + utostr(OpNo) + ", InFlag).Val;");
2839 emitCode(ChainName + " = SDOperand(ResNode, 0);");
2840 emitCode("InFlag = SDOperand(ResNode, 1);");
2847 if (HasInFlag || HasOptInFlag) {
2850 emitCode("if (" + RootName + ".getNumOperands() == " + utostr(OpNo+1) +
2854 emitCode(Code + "Select(InFlag, " + RootName +
2855 ".getOperand(" + utostr(OpNo) + "));");
2857 emitCode(" HasOptInFlag = true;");
2863 /// EmitCopyFromRegs - Emit code to copy result to physical registers
2864 /// as specified by the instruction. It returns true if any copy is
2866 bool EmitCopyFromRegs(TreePatternNode *N, bool &ChainEmitted) {
2867 bool RetVal = false;
2868 Record *Op = N->getOperator();
2869 if (Op->isSubClassOf("Instruction")) {
2870 const DAGInstruction &Inst = ISE.getInstruction(Op);
2871 const CodeGenTarget &CGT = ISE.getTargetInfo();
2872 unsigned NumImpResults = Inst.getNumImpResults();
2873 for (unsigned i = 0; i < NumImpResults; i++) {
2874 Record *RR = Inst.getImpResult(i);
2875 if (RR->isSubClassOf("Register")) {
2876 MVT::ValueType RVT = getRegisterValueType(RR, CGT);
2877 if (RVT != MVT::Flag) {
2878 if (!ChainEmitted) {
2880 emitCode("Chain = CurDAG->getEntryNode();");
2881 ChainEmitted = true;
2882 ChainName = "Chain";
2884 emitCode("ResNode = CurDAG->getCopyFromReg(" + ChainName + ", " +
2885 ISE.getQualifiedName(RR) + ", MVT::" + getEnumName(RVT) +
2887 emitCode(ChainName + " = SDOperand(ResNode, 1);");
2888 emitCode("InFlag = SDOperand(ResNode, 2);");
2898 /// EmitCodeForPattern - Given a pattern to match, emit code to the specified
2899 /// stream to match the pattern, and generate the code for the match if it
2900 /// succeeds. Returns true if the pattern is not guaranteed to match.
2901 void DAGISelEmitter::GenerateCodeForPattern(PatternToMatch &Pattern,
2902 std::vector<std::pair<bool, std::string> > &GeneratedCode,
2903 std::set<std::pair<bool, std::string> > &GeneratedDecl,
2905 PatternCodeEmitter Emitter(*this, Pattern.getPredicates(),
2906 Pattern.getSrcPattern(), Pattern.getDstPattern(),
2907 GeneratedCode, GeneratedDecl, DoReplace);
2909 // Emit the matcher, capturing named arguments in VariableMap.
2910 bool FoundChain = false;
2911 Emitter.EmitMatchCode(Pattern.getSrcPattern(), NULL, "N", "", "", FoundChain);
2913 // TP - Get *SOME* tree pattern, we don't care which.
2914 TreePattern &TP = *PatternFragments.begin()->second;
2916 // At this point, we know that we structurally match the pattern, but the
2917 // types of the nodes may not match. Figure out the fewest number of type
2918 // comparisons we need to emit. For example, if there is only one integer
2919 // type supported by a target, there should be no type comparisons at all for
2920 // integer patterns!
2922 // To figure out the fewest number of type checks needed, clone the pattern,
2923 // remove the types, then perform type inference on the pattern as a whole.
2924 // If there are unresolved types, emit an explicit check for those types,
2925 // apply the type to the tree, then rerun type inference. Iterate until all
2926 // types are resolved.
2928 TreePatternNode *Pat = Pattern.getSrcPattern()->clone();
2929 RemoveAllTypes(Pat);
2932 // Resolve/propagate as many types as possible.
2934 bool MadeChange = true;
2936 MadeChange = Pat->ApplyTypeConstraints(TP,
2937 true/*Ignore reg constraints*/);
2939 assert(0 && "Error: could not find consistent types for something we"
2940 " already decided was ok!");
2944 // Insert a check for an unresolved type and add it to the tree. If we find
2945 // an unresolved type to add a check for, this returns true and we iterate,
2946 // otherwise we are done.
2947 } while (Emitter.InsertOneTypeCheck(Pat, Pattern.getSrcPattern(), "N"));
2949 Emitter.EmitResultCode(Pattern.getDstPattern(), false, true /*the root*/);
2953 /// EraseCodeLine - Erase one code line from all of the patterns. If removing
2954 /// a line causes any of them to be empty, remove them and return true when
2956 static bool EraseCodeLine(std::vector<std::pair<PatternToMatch*,
2957 std::vector<std::pair<bool, std::string> > > >
2959 bool ErasedPatterns = false;
2960 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
2961 Patterns[i].second.pop_back();
2962 if (Patterns[i].second.empty()) {
2963 Patterns.erase(Patterns.begin()+i);
2965 ErasedPatterns = true;
2968 return ErasedPatterns;
2971 /// EmitPatterns - Emit code for at least one pattern, but try to group common
2972 /// code together between the patterns.
2973 void DAGISelEmitter::EmitPatterns(std::vector<std::pair<PatternToMatch*,
2974 std::vector<std::pair<bool, std::string> > > >
2975 &Patterns, unsigned Indent,
2977 typedef std::pair<bool, std::string> CodeLine;
2978 typedef std::vector<CodeLine> CodeList;
2979 typedef std::vector<std::pair<PatternToMatch*, CodeList> > PatternList;
2981 if (Patterns.empty()) return;
2983 // Figure out how many patterns share the next code line. Explicitly copy
2984 // FirstCodeLine so that we don't invalidate a reference when changing
2986 const CodeLine FirstCodeLine = Patterns.back().second.back();
2987 unsigned LastMatch = Patterns.size()-1;
2988 while (LastMatch != 0 && Patterns[LastMatch-1].second.back() == FirstCodeLine)
2991 // If not all patterns share this line, split the list into two pieces. The
2992 // first chunk will use this line, the second chunk won't.
2993 if (LastMatch != 0) {
2994 PatternList Shared(Patterns.begin()+LastMatch, Patterns.end());
2995 PatternList Other(Patterns.begin(), Patterns.begin()+LastMatch);
2997 // FIXME: Emit braces?
2998 if (Shared.size() == 1) {
2999 PatternToMatch &Pattern = *Shared.back().first;
3000 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
3001 Pattern.getSrcPattern()->print(OS);
3002 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
3003 Pattern.getDstPattern()->print(OS);
3005 unsigned AddedComplexity = Pattern.getAddedComplexity();
3006 OS << std::string(Indent, ' ') << "// Pattern complexity = "
3007 << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity
3009 << getResultPatternCost(Pattern.getDstPattern(), *this) << "\n";
3011 if (!FirstCodeLine.first) {
3012 OS << std::string(Indent, ' ') << "{\n";
3015 EmitPatterns(Shared, Indent, OS);
3016 if (!FirstCodeLine.first) {
3018 OS << std::string(Indent, ' ') << "}\n";
3021 if (Other.size() == 1) {
3022 PatternToMatch &Pattern = *Other.back().first;
3023 OS << "\n" << std::string(Indent, ' ') << "// Pattern: ";
3024 Pattern.getSrcPattern()->print(OS);
3025 OS << "\n" << std::string(Indent, ' ') << "// Emits: ";
3026 Pattern.getDstPattern()->print(OS);
3028 unsigned AddedComplexity = Pattern.getAddedComplexity();
3029 OS << std::string(Indent, ' ') << "// Pattern complexity = "
3030 << getPatternSize(Pattern.getSrcPattern(), *this) + AddedComplexity
3032 << getResultPatternCost(Pattern.getDstPattern(), *this) << "\n";
3034 EmitPatterns(Other, Indent, OS);
3038 // Remove this code from all of the patterns that share it.
3039 bool ErasedPatterns = EraseCodeLine(Patterns);
3041 bool isPredicate = FirstCodeLine.first;
3043 // Otherwise, every pattern in the list has this line. Emit it.
3046 OS << std::string(Indent, ' ') << FirstCodeLine.second << "\n";
3048 OS << std::string(Indent, ' ') << "if (" << FirstCodeLine.second;
3050 // If the next code line is another predicate, and if all of the pattern
3051 // in this group share the same next line, emit it inline now. Do this
3052 // until we run out of common predicates.
3053 while (!ErasedPatterns && Patterns.back().second.back().first) {
3054 // Check that all of fhe patterns in Patterns end with the same predicate.
3055 bool AllEndWithSamePredicate = true;
3056 for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
3057 if (Patterns[i].second.back() != Patterns.back().second.back()) {
3058 AllEndWithSamePredicate = false;
3061 // If all of the predicates aren't the same, we can't share them.
3062 if (!AllEndWithSamePredicate) break;
3064 // Otherwise we can. Emit it shared now.
3065 OS << " &&\n" << std::string(Indent+4, ' ')
3066 << Patterns.back().second.back().second;
3067 ErasedPatterns = EraseCodeLine(Patterns);
3074 EmitPatterns(Patterns, Indent, OS);
3077 OS << std::string(Indent-2, ' ') << "}\n";
3083 /// CompareByRecordName - An ordering predicate that implements less-than by
3084 /// comparing the names records.
3085 struct CompareByRecordName {
3086 bool operator()(const Record *LHS, const Record *RHS) const {
3087 // Sort by name first.
3088 if (LHS->getName() < RHS->getName()) return true;
3089 // If both names are equal, sort by pointer.
3090 return LHS->getName() == RHS->getName() && LHS < RHS;
3095 void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
3096 std::string InstNS = Target.inst_begin()->second.Namespace;
3097 if (!InstNS.empty()) InstNS += "::";
3099 // Group the patterns by their top-level opcodes.
3100 std::map<Record*, std::vector<PatternToMatch*>,
3101 CompareByRecordName> PatternsByOpcode;
3102 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
3103 TreePatternNode *Node = PatternsToMatch[i].getSrcPattern();
3104 if (!Node->isLeaf()) {
3105 PatternsByOpcode[Node->getOperator()].push_back(&PatternsToMatch[i]);
3107 const ComplexPattern *CP;
3109 dynamic_cast<IntInit*>(Node->getLeafValue())) {
3110 PatternsByOpcode[getSDNodeNamed("imm")].push_back(&PatternsToMatch[i]);
3111 } else if ((CP = NodeGetComplexPattern(Node, *this))) {
3112 std::vector<Record*> OpNodes = CP->getRootNodes();
3113 for (unsigned j = 0, e = OpNodes.size(); j != e; j++) {
3114 PatternsByOpcode[OpNodes[j]]
3115 .insert(PatternsByOpcode[OpNodes[j]].begin(), &PatternsToMatch[i]);
3118 std::cerr << "Unrecognized opcode '";
3120 std::cerr << "' on tree pattern '";
3122 PatternsToMatch[i].getDstPattern()->getOperator()->getName();
3123 std::cerr << "'!\n";
3129 // Emit one Select_* method for each top-level opcode. We do this instead of
3130 // emitting one giant switch statement to support compilers where this will
3131 // result in the recursive functions taking less stack space.
3132 for (std::map<Record*, std::vector<PatternToMatch*>,
3133 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
3134 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
3135 const std::string &OpName = PBOI->first->getName();
3136 OS << "void Select_" << OpName << "(SDOperand &Result, SDOperand N) {\n";
3138 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
3140 (OpcodeInfo.hasProperty(SDNodeInfo::SDNPHasChain) &&
3141 OpcodeInfo.getNumResults() > 0);
3144 OS << " if (N.ResNo == " << OpcodeInfo.getNumResults()
3145 << " && N.getValue(0).hasOneUse()) {\n"
3146 << " SDOperand Dummy = "
3147 << "CurDAG->getNode(ISD::HANDLENODE, MVT::Other, N);\n"
3148 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, "
3149 << OpcodeInfo.getNumResults() << ", Dummy.Val, 0);\n"
3150 << " SelectionDAG::InsertISelMapEntry(HandleMap, N.Val, "
3151 << OpcodeInfo.getNumResults() << ", Dummy.Val, 0);\n"
3152 << " Result = Dummy;\n"
3157 std::vector<PatternToMatch*> &Patterns = PBOI->second;
3158 assert(!Patterns.empty() && "No patterns but map has entry?");
3160 // We want to emit all of the matching code now. However, we want to emit
3161 // the matches in order of minimal cost. Sort the patterns so the least
3162 // cost one is at the start.
3163 std::stable_sort(Patterns.begin(), Patterns.end(),
3164 PatternSortingPredicate(*this));
3166 typedef std::vector<std::pair<bool, std::string> > CodeList;
3167 typedef std::set<std::string> DeclSet;
3169 std::vector<std::pair<PatternToMatch*, CodeList> > CodeForPatterns;
3170 std::set<std::pair<bool, std::string> > GeneratedDecl;
3171 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
3172 CodeList GeneratedCode;
3173 GenerateCodeForPattern(*Patterns[i], GeneratedCode, GeneratedDecl,
3175 CodeForPatterns.push_back(std::make_pair(Patterns[i], GeneratedCode));
3178 // Scan the code to see if all of the patterns are reachable and if it is
3179 // possible that the last one might not match.
3180 bool mightNotMatch = true;
3181 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3182 CodeList &GeneratedCode = CodeForPatterns[i].second;
3183 mightNotMatch = false;
3185 for (unsigned j = 0, e = GeneratedCode.size(); j != e; ++j) {
3186 if (GeneratedCode[j].first) { // predicate.
3187 mightNotMatch = true;
3192 // If this pattern definitely matches, and if it isn't the last one, the
3193 // patterns after it CANNOT ever match. Error out.
3194 if (mightNotMatch == false && i != CodeForPatterns.size()-1) {
3195 std::cerr << "Pattern '";
3196 CodeForPatterns[i+1].first->getSrcPattern()->print(OS);
3197 std::cerr << "' is impossible to select!\n";
3202 // Print all declarations.
3203 for (std::set<std::pair<bool, std::string> >::iterator
3204 I = GeneratedDecl.begin(), E = GeneratedDecl.end(); I != E; ++I)
3206 OS << " SDNode *" << I->second << ";\n";
3208 OS << " SDOperand " << I->second << "(0, 0);\n";
3210 // Loop through and reverse all of the CodeList vectors, as we will be
3211 // accessing them from their logical front, but accessing the end of a
3212 // vector is more efficient.
3213 for (unsigned i = 0, e = CodeForPatterns.size(); i != e; ++i) {
3214 CodeList &GeneratedCode = CodeForPatterns[i].second;
3215 std::reverse(GeneratedCode.begin(), GeneratedCode.end());
3218 // Next, reverse the list of patterns itself for the same reason.
3219 std::reverse(CodeForPatterns.begin(), CodeForPatterns.end());
3221 // Emit all of the patterns now, grouped together to share code.
3222 EmitPatterns(CodeForPatterns, 2, OS);
3224 // If the last pattern has predicates (which could fail) emit code to catch
3225 // the case where nothing handles a pattern.
3226 if (mightNotMatch) {
3227 OS << " std::cerr << \"Cannot yet select: \";\n";
3228 if (OpcodeInfo.getEnumName() != "ISD::INTRINSIC_W_CHAIN" &&
3229 OpcodeInfo.getEnumName() != "ISD::INTRINSIC_WO_CHAIN" &&
3230 OpcodeInfo.getEnumName() != "ISD::INTRINSIC_VOID") {
3231 OS << " N.Val->dump(CurDAG);\n";
3233 OS << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
3234 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
3235 << " std::cerr << \"intrinsic %\"<< "
3236 "Intrinsic::getName((Intrinsic::ID)iid);\n";
3238 OS << " std::cerr << '\\n';\n"
3244 // Emit boilerplate.
3245 OS << "void Select_INLINEASM(SDOperand& Result, SDOperand N) {\n"
3246 << " std::vector<SDOperand> Ops(N.Val->op_begin(), N.Val->op_end());\n"
3247 << " Select(Ops[0], N.getOperand(0)); // Select the chain.\n\n"
3248 << " // Select the flag operand.\n"
3249 << " if (Ops.back().getValueType() == MVT::Flag)\n"
3250 << " Select(Ops.back(), Ops.back());\n"
3251 << " SelectInlineAsmMemoryOperands(Ops, *CurDAG);\n"
3252 << " std::vector<MVT::ValueType> VTs;\n"
3253 << " VTs.push_back(MVT::Other);\n"
3254 << " VTs.push_back(MVT::Flag);\n"
3255 << " SDOperand New = CurDAG->getNode(ISD::INLINEASM, VTs, Ops);\n"
3256 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, New.Val, 0);\n"
3257 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, New.Val, 1);\n"
3258 << " Result = New.getValue(N.ResNo);\n"
3262 OS << "// The main instruction selector code.\n"
3263 << "void SelectCode(SDOperand &Result, SDOperand N) {\n"
3264 << " if (N.getOpcode() >= ISD::BUILTIN_OP_END &&\n"
3265 << " N.getOpcode() < (ISD::BUILTIN_OP_END+" << InstNS
3266 << "INSTRUCTION_LIST_END)) {\n"
3268 << " return; // Already selected.\n"
3270 << " std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(N);\n"
3271 << " if (CGMI != CodeGenMap.end()) {\n"
3272 << " Result = CGMI->second;\n"
3275 << " switch (N.getOpcode()) {\n"
3276 << " default: break;\n"
3277 << " case ISD::EntryToken: // These leaves remain the same.\n"
3278 << " case ISD::BasicBlock:\n"
3279 << " case ISD::Register:\n"
3280 << " case ISD::HANDLENODE:\n"
3281 << " case ISD::TargetConstant:\n"
3282 << " case ISD::TargetConstantPool:\n"
3283 << " case ISD::TargetFrameIndex:\n"
3284 << " case ISD::TargetJumpTable:\n"
3285 << " case ISD::TargetGlobalAddress: {\n"
3289 << " case ISD::AssertSext:\n"
3290 << " case ISD::AssertZext: {\n"
3291 << " SDOperand Tmp0;\n"
3292 << " Select(Tmp0, N.getOperand(0));\n"
3293 << " if (!N.Val->hasOneUse())\n"
3294 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3295 << "Tmp0.Val, Tmp0.ResNo);\n"
3296 << " Result = Tmp0;\n"
3299 << " case ISD::TokenFactor:\n"
3300 << " if (N.getNumOperands() == 2) {\n"
3301 << " SDOperand Op0, Op1;\n"
3302 << " Select(Op0, N.getOperand(0));\n"
3303 << " Select(Op1, N.getOperand(1));\n"
3305 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);\n"
3306 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3307 << "Result.Val, Result.ResNo);\n"
3309 << " std::vector<SDOperand> Ops;\n"
3310 << " for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i) {\n"
3311 << " SDOperand Val;\n"
3312 << " Select(Val, N.getOperand(i));\n"
3313 << " Ops.push_back(Val);\n"
3316 << " CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n"
3317 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, N.ResNo, "
3318 << "Result.Val, Result.ResNo);\n"
3321 << " case ISD::CopyFromReg: {\n"
3322 << " SDOperand Chain;\n"
3323 << " Select(Chain, N.getOperand(0));\n"
3324 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
3325 << " MVT::ValueType VT = N.Val->getValueType(0);\n"
3326 << " if (N.Val->getNumValues() == 2) {\n"
3327 << " if (Chain == N.getOperand(0)) {\n"
3328 << " Result = N; // No change\n"
3331 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT);\n"
3332 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3334 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3336 << " Result = New.getValue(N.ResNo);\n"
3339 << " SDOperand Flag;\n"
3340 << " if (N.getNumOperands() == 3) Select(Flag, N.getOperand(2));\n"
3341 << " if (Chain == N.getOperand(0) &&\n"
3342 << " (N.getNumOperands() == 2 || Flag == N.getOperand(2))) {\n"
3343 << " Result = N; // No change\n"
3346 << " SDOperand New = CurDAG->getCopyFromReg(Chain, Reg, VT, Flag);\n"
3347 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3349 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3351 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 2, "
3353 << " Result = New.getValue(N.ResNo);\n"
3357 << " case ISD::CopyToReg: {\n"
3358 << " SDOperand Chain;\n"
3359 << " Select(Chain, N.getOperand(0));\n"
3360 << " unsigned Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg();\n"
3361 << " SDOperand Val;\n"
3362 << " Select(Val, N.getOperand(2));\n"
3364 << " if (N.Val->getNumValues() == 1) {\n"
3365 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2))\n"
3366 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val);\n"
3367 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3368 << "Result.Val, 0);\n"
3370 << " SDOperand Flag(0, 0);\n"
3371 << " if (N.getNumOperands() == 4) Select(Flag, N.getOperand(3));\n"
3372 << " if (Chain != N.getOperand(0) || Val != N.getOperand(2) ||\n"
3373 << " (N.getNumOperands() == 4 && Flag != N.getOperand(3)))\n"
3374 << " Result = CurDAG->getCopyToReg(Chain, Reg, Val, Flag);\n"
3375 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 0, "
3376 << "Result.Val, 0);\n"
3377 << " SelectionDAG::InsertISelMapEntry(CodeGenMap, N.Val, 1, "
3378 << "Result.Val, 1);\n"
3379 << " Result = Result.getValue(N.ResNo);\n"
3383 << " case ISD::INLINEASM: Select_INLINEASM(Result, N); return;\n";
3386 // Loop over all of the case statements, emiting a call to each method we
3388 for (std::map<Record*, std::vector<PatternToMatch*>,
3389 CompareByRecordName>::iterator PBOI = PatternsByOpcode.begin(),
3390 E = PatternsByOpcode.end(); PBOI != E; ++PBOI) {
3391 const SDNodeInfo &OpcodeInfo = getSDNodeInfo(PBOI->first);
3392 OS << " case " << OpcodeInfo.getEnumName() << ": "
3393 << std::string(std::max(0, int(24-OpcodeInfo.getEnumName().size())), ' ')
3394 << "Select_" << PBOI->first->getName() << "(Result, N); return;\n";
3397 OS << " } // end of big switch.\n\n"
3398 << " std::cerr << \"Cannot yet select: \";\n"
3399 << " if (N.getOpcode() != ISD::INTRINSIC_W_CHAIN &&\n"
3400 << " N.getOpcode() != ISD::INTRINSIC_WO_CHAIN &&\n"
3401 << " N.getOpcode() != ISD::INTRINSIC_VOID) {\n"
3402 << " N.Val->dump(CurDAG);\n"
3404 << " unsigned iid = cast<ConstantSDNode>(N.getOperand("
3405 "N.getOperand(0).getValueType() == MVT::Other))->getValue();\n"
3406 << " std::cerr << \"intrinsic %\"<< "
3407 "Intrinsic::getName((Intrinsic::ID)iid);\n"
3409 << " std::cerr << '\\n';\n"
3414 void DAGISelEmitter::run(std::ostream &OS) {
3415 EmitSourceFileHeader("DAG Instruction Selector for the " + Target.getName() +
3418 OS << "// *** NOTE: This file is #included into the middle of the target\n"
3419 << "// *** instruction selector class. These functions are really "
3422 OS << "// Instance var to keep track of multiply used nodes that have \n"
3423 << "// already been selected.\n"
3424 << "std::map<SDOperand, SDOperand> CodeGenMap;\n";
3426 OS << "// Instance var to keep track of mapping of chain generating nodes\n"
3427 << "// and their place handle nodes.\n";
3428 OS << "std::map<SDOperand, SDOperand> HandleMap;\n";
3429 OS << "// Instance var to keep track of mapping of place handle nodes\n"
3430 << "// and their replacement nodes.\n";
3431 OS << "std::map<SDOperand, SDOperand> ReplaceMap;\n";
3432 OS << "// Keep track of nodes that are currently being selecte and therefore\n"
3433 << "// should not be folded.\n";
3434 OS << "std::set<SDNode*> InFlightSet;\n";
3437 OS << "static void findNonImmUse(SDNode* Use, SDNode* Def, bool &found, "
3438 << "std::set<SDNode *> &Visited) {\n";
3439 OS << " if (found || !Visited.insert(Use).second) return;\n";
3440 OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {\n";
3441 OS << " SDNode *N = Use->getOperand(i).Val;\n";
3442 OS << " if (N->getNodeDepth() >= Def->getNodeDepth()) {\n";
3443 OS << " if (N != Def) {\n";
3444 OS << " findNonImmUse(N, Def, found, Visited);\n";
3445 OS << " } else {\n";
3446 OS << " found = true;\n";
3454 OS << "static bool isNonImmUse(SDNode* Use, SDNode* Def) {\n";
3455 OS << " std::set<SDNode *> Visited;\n";
3456 OS << " bool found = false;\n";
3457 OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {\n";
3458 OS << " SDNode *N = Use->getOperand(i).Val;\n";
3459 OS << " if (N != Def) {\n";
3460 OS << " findNonImmUse(N, Def, found, Visited);\n";
3461 OS << " if (found) break;\n";
3464 OS << " return found;\n";
3468 OS << "// AddHandleReplacement - Note the pending replacement node for a\n"
3469 << "// handle node in ReplaceMap.\n";
3470 OS << "void AddHandleReplacement(SDNode *H, unsigned HNum, SDNode *R, "
3471 << "unsigned RNum) {\n";
3472 OS << " SDOperand N(H, HNum);\n";
3473 OS << " std::map<SDOperand, SDOperand>::iterator HMI = HandleMap.find(N);\n";
3474 OS << " if (HMI != HandleMap.end()) {\n";
3475 OS << " ReplaceMap[HMI->second] = SDOperand(R, RNum);\n";
3476 OS << " HandleMap.erase(N);\n";
3481 OS << "// SelectDanglingHandles - Select replacements for all `dangling`\n";
3482 OS << "// handles.Some handles do not yet have replacements because the\n";
3483 OS << "// nodes they replacements have only dead readers.\n";
3484 OS << "void SelectDanglingHandles() {\n";
3485 OS << " for (std::map<SDOperand, SDOperand>::iterator I = "
3486 << "HandleMap.begin(),\n"
3487 << " E = HandleMap.end(); I != E; ++I) {\n";
3488 OS << " SDOperand N = I->first;\n";
3489 OS << " SDOperand R;\n";
3490 OS << " Select(R, N.getValue(0));\n";
3491 OS << " AddHandleReplacement(N.Val, N.ResNo, R.Val, R.ResNo);\n";
3495 OS << "// ReplaceHandles - Replace all the handles with the real target\n";
3496 OS << "// specific nodes.\n";
3497 OS << "void ReplaceHandles() {\n";
3498 OS << " for (std::map<SDOperand, SDOperand>::iterator I = "
3499 << "ReplaceMap.begin(),\n"
3500 << " E = ReplaceMap.end(); I != E; ++I) {\n";
3501 OS << " SDOperand From = I->first;\n";
3502 OS << " SDOperand To = I->second;\n";
3503 OS << " for (SDNode::use_iterator UI = From.Val->use_begin(), "
3504 << "E = From.Val->use_end(); UI != E; ++UI) {\n";
3505 OS << " SDNode *Use = *UI;\n";
3506 OS << " std::vector<SDOperand> Ops;\n";
3507 OS << " for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {\n";
3508 OS << " SDOperand O = Use->getOperand(i);\n";
3509 OS << " if (O.Val == From.Val)\n";
3510 OS << " Ops.push_back(To);\n";
3512 OS << " Ops.push_back(O);\n";
3514 OS << " SDOperand U = SDOperand(Use, 0);\n";
3515 OS << " CurDAG->UpdateNodeOperands(U, Ops);\n";
3521 OS << "// UpdateFoldedChain - return a SDOperand of the new chain created\n";
3522 OS << "// if the folding were to happen. This is called when, for example,\n";
3523 OS << "// a load is folded into a store. If the store's chain is the load,\n";
3524 OS << "// then the resulting node's input chain would be the load's input\n";
3525 OS << "// chain. If the store's chain is a TokenFactor and the load's\n";
3526 OS << "// output chain feeds into in, then the new chain is a TokenFactor\n";
3527 OS << "// with the other operands along with the input chain of the load.\n";
3528 OS << "SDOperand UpdateFoldedChain(SelectionDAG *DAG, SDNode *N, "
3529 << "SDNode *Chain, SDNode* &OldTF) {\n";
3530 OS << " OldTF = NULL;\n";
3531 OS << " if (N == Chain) {\n";
3532 OS << " return N->getOperand(0);\n";
3533 OS << " } else if (Chain->getOpcode() == ISD::TokenFactor &&\n";
3534 OS << " N->isOperand(Chain)) {\n";
3535 OS << " SDOperand Ch = SDOperand(Chain, 0);\n";
3536 OS << " std::map<SDOperand, SDOperand>::iterator CGMI = "
3537 << "CodeGenMap.find(Ch);\n";
3538 OS << " if (CGMI != CodeGenMap.end())\n";
3539 OS << " return SDOperand(0, 0);\n";
3540 OS << " OldTF = Chain;\n";
3541 OS << " std::vector<SDOperand> Ops;\n";
3542 OS << " for (unsigned i = 0; i < Chain->getNumOperands(); ++i) {\n";
3543 OS << " SDOperand Op = Chain->getOperand(i);\n";
3544 OS << " if (Op.Val == N)\n";
3545 OS << " Ops.push_back(N->getOperand(0));\n";
3547 OS << " Ops.push_back(Op);\n";
3549 OS << " return DAG->getNode(ISD::TokenFactor, MVT::Other, Ops);\n";
3551 OS << " return SDOperand(0, 0);\n";
3555 OS << "// SelectRoot - Top level entry to DAG isel.\n";
3556 OS << "SDOperand SelectRoot(SDOperand N) {\n";
3557 OS << " SDOperand ResNode;\n";
3558 OS << " Select(ResNode, N);\n";
3559 OS << " SelectDanglingHandles();\n";
3560 OS << " ReplaceHandles();\n";
3561 OS << " ReplaceMap.clear();\n";
3562 OS << " return ResNode;\n";
3565 Intrinsics = LoadIntrinsics(Records);
3567 ParseNodeTransforms(OS);
3568 ParseComplexPatterns();
3569 ParsePatternFragments(OS);
3570 ParseInstructions();
3573 // Generate variants. For example, commutative patterns can match
3574 // multiple ways. Add them to PatternsToMatch as well.
3578 DEBUG(std::cerr << "\n\nALL PATTERNS TO MATCH:\n\n";
3579 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
3580 std::cerr << "PATTERN: "; PatternsToMatch[i].getSrcPattern()->dump();
3581 std::cerr << "\nRESULT: ";PatternsToMatch[i].getDstPattern()->dump();
3585 // At this point, we have full information about the 'Patterns' we need to
3586 // parse, both implicitly from instructions as well as from explicit pattern
3587 // definitions. Emit the resultant instruction selector.
3588 EmitInstructionSelector(OS);
3590 for (std::map<Record*, TreePattern*>::iterator I = PatternFragments.begin(),
3591 E = PatternFragments.end(); I != E; ++I)
3593 PatternFragments.clear();
3595 Instructions.clear();