1 //===- CodeGenDAGPatterns.cpp - Read DAG patterns from .td file -----------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the CodeGenDAGPatterns class, which is used to read and
11 // represent the patterns present in a .td file for instructions.
13 //===----------------------------------------------------------------------===//
15 #include "CodeGenDAGPatterns.h"
17 #include "llvm/ADT/StringExtras.h"
18 #include "llvm/ADT/STLExtras.h"
19 #include "llvm/Support/Debug.h"
24 //===----------------------------------------------------------------------===//
25 // EEVT::TypeSet Implementation
26 //===----------------------------------------------------------------------===//
28 static inline bool isInteger(MVT::SimpleValueType VT) {
29 return EVT(VT).isInteger();
31 static inline bool isFloatingPoint(MVT::SimpleValueType VT) {
32 return EVT(VT).isFloatingPoint();
34 static inline bool isVector(MVT::SimpleValueType VT) {
35 return EVT(VT).isVector();
37 static inline bool isScalar(MVT::SimpleValueType VT) {
38 return !EVT(VT).isVector();
41 EEVT::TypeSet::TypeSet(MVT::SimpleValueType VT, TreePattern &TP) {
44 else if (VT == MVT::fAny)
45 EnforceFloatingPoint(TP);
46 else if (VT == MVT::vAny)
49 assert((VT < MVT::LAST_VALUETYPE || VT == MVT::iPTR ||
50 VT == MVT::iPTRAny) && "Not a concrete type!");
51 TypeVec.push_back(VT);
56 EEVT::TypeSet::TypeSet(const std::vector<MVT::SimpleValueType> &VTList) {
57 assert(!VTList.empty() && "empty list?");
58 TypeVec.append(VTList.begin(), VTList.end());
61 assert(VTList[0] != MVT::iAny && VTList[0] != MVT::vAny &&
62 VTList[0] != MVT::fAny);
65 array_pod_sort(TypeVec.begin(), TypeVec.end());
66 TypeVec.erase(std::unique(TypeVec.begin(), TypeVec.end()), TypeVec.end());
69 /// FillWithPossibleTypes - Set to all legal types and return true, only valid
70 /// on completely unknown type sets.
71 bool EEVT::TypeSet::FillWithPossibleTypes(TreePattern &TP,
72 bool (*Pred)(MVT::SimpleValueType),
73 const char *PredicateName) {
74 assert(isCompletelyUnknown());
75 const std::vector<MVT::SimpleValueType> &LegalTypes =
76 TP.getDAGPatterns().getTargetInfo().getLegalValueTypes();
78 for (unsigned i = 0, e = LegalTypes.size(); i != e; ++i)
79 if (Pred == 0 || Pred(LegalTypes[i]))
80 TypeVec.push_back(LegalTypes[i]);
82 // If we have nothing that matches the predicate, bail out.
84 TP.error("Type inference contradiction found, no " +
85 std::string(PredicateName) + " types found");
86 // No need to sort with one element.
87 if (TypeVec.size() == 1) return true;
90 array_pod_sort(TypeVec.begin(), TypeVec.end());
91 TypeVec.erase(std::unique(TypeVec.begin(), TypeVec.end()), TypeVec.end());
96 /// hasIntegerTypes - Return true if this TypeSet contains iAny or an
97 /// integer value type.
98 bool EEVT::TypeSet::hasIntegerTypes() const {
99 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)
100 if (isInteger(TypeVec[i]))
105 /// hasFloatingPointTypes - Return true if this TypeSet contains an fAny or
106 /// a floating point value type.
107 bool EEVT::TypeSet::hasFloatingPointTypes() const {
108 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)
109 if (isFloatingPoint(TypeVec[i]))
114 /// hasVectorTypes - Return true if this TypeSet contains a vAny or a vector
116 bool EEVT::TypeSet::hasVectorTypes() const {
117 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)
118 if (isVector(TypeVec[i]))
124 std::string EEVT::TypeSet::getName() const {
125 if (TypeVec.empty()) return "<empty>";
129 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) {
130 std::string VTName = llvm::getEnumName(TypeVec[i]);
131 // Strip off MVT:: prefix if present.
132 if (VTName.substr(0,5) == "MVT::")
133 VTName = VTName.substr(5);
134 if (i) Result += ':';
138 if (TypeVec.size() == 1)
140 return "{" + Result + "}";
143 /// MergeInTypeInfo - This merges in type information from the specified
144 /// argument. If 'this' changes, it returns true. If the two types are
145 /// contradictory (e.g. merge f32 into i32) then this throws an exception.
146 bool EEVT::TypeSet::MergeInTypeInfo(const EEVT::TypeSet &InVT, TreePattern &TP){
147 if (InVT.isCompletelyUnknown() || *this == InVT)
150 if (isCompletelyUnknown()) {
155 assert(TypeVec.size() >= 1 && InVT.TypeVec.size() >= 1 && "No unknowns");
157 // Handle the abstract cases, seeing if we can resolve them better.
158 switch (TypeVec[0]) {
162 if (InVT.hasIntegerTypes()) {
163 EEVT::TypeSet InCopy(InVT);
164 InCopy.EnforceInteger(TP);
165 InCopy.EnforceScalar(TP);
167 if (InCopy.isConcrete()) {
168 // If the RHS has one integer type, upgrade iPTR to i32.
169 TypeVec[0] = InVT.TypeVec[0];
173 // If the input has multiple scalar integers, this doesn't add any info.
174 if (!InCopy.isCompletelyUnknown())
180 // If the input constraint is iAny/iPTR and this is an integer type list,
181 // remove non-integer types from the list.
182 if ((InVT.TypeVec[0] == MVT::iPTR || InVT.TypeVec[0] == MVT::iPTRAny) &&
184 bool MadeChange = EnforceInteger(TP);
186 // If we're merging in iPTR/iPTRAny and the node currently has a list of
187 // multiple different integer types, replace them with a single iPTR.
188 if ((InVT.TypeVec[0] == MVT::iPTR || InVT.TypeVec[0] == MVT::iPTRAny) &&
189 TypeVec.size() != 1) {
191 TypeVec[0] = InVT.TypeVec[0];
198 // If this is a type list and the RHS is a typelist as well, eliminate entries
199 // from this list that aren't in the other one.
200 bool MadeChange = false;
201 TypeSet InputSet(*this);
203 for (unsigned i = 0; i != TypeVec.size(); ++i) {
205 for (unsigned j = 0, e = InVT.TypeVec.size(); j != e; ++j)
206 if (TypeVec[i] == InVT.TypeVec[j]) {
211 if (InInVT) continue;
212 TypeVec.erase(TypeVec.begin()+i--);
216 // If we removed all of our types, we have a type contradiction.
217 if (!TypeVec.empty())
220 // FIXME: Really want an SMLoc here!
221 TP.error("Type inference contradiction found, merging '" +
222 InVT.getName() + "' into '" + InputSet.getName() + "'");
223 return true; // unreachable
226 /// EnforceInteger - Remove all non-integer types from this set.
227 bool EEVT::TypeSet::EnforceInteger(TreePattern &TP) {
228 // If we know nothing, then get the full set.
230 return FillWithPossibleTypes(TP, isInteger, "integer");
231 if (!hasFloatingPointTypes())
234 TypeSet InputSet(*this);
236 // Filter out all the fp types.
237 for (unsigned i = 0; i != TypeVec.size(); ++i)
238 if (!isInteger(TypeVec[i]))
239 TypeVec.erase(TypeVec.begin()+i--);
242 TP.error("Type inference contradiction found, '" +
243 InputSet.getName() + "' needs to be integer");
247 /// EnforceFloatingPoint - Remove all integer types from this set.
248 bool EEVT::TypeSet::EnforceFloatingPoint(TreePattern &TP) {
249 // If we know nothing, then get the full set.
251 return FillWithPossibleTypes(TP, isFloatingPoint, "floating point");
253 if (!hasIntegerTypes())
256 TypeSet InputSet(*this);
258 // Filter out all the fp types.
259 for (unsigned i = 0; i != TypeVec.size(); ++i)
260 if (!isFloatingPoint(TypeVec[i]))
261 TypeVec.erase(TypeVec.begin()+i--);
264 TP.error("Type inference contradiction found, '" +
265 InputSet.getName() + "' needs to be floating point");
269 /// EnforceScalar - Remove all vector types from this.
270 bool EEVT::TypeSet::EnforceScalar(TreePattern &TP) {
271 // If we know nothing, then get the full set.
273 return FillWithPossibleTypes(TP, isScalar, "scalar");
275 if (!hasVectorTypes())
278 TypeSet InputSet(*this);
280 // Filter out all the vector types.
281 for (unsigned i = 0; i != TypeVec.size(); ++i)
282 if (!isScalar(TypeVec[i]))
283 TypeVec.erase(TypeVec.begin()+i--);
286 TP.error("Type inference contradiction found, '" +
287 InputSet.getName() + "' needs to be scalar");
291 /// EnforceVector - Remove all vector types from this.
292 bool EEVT::TypeSet::EnforceVector(TreePattern &TP) {
293 // If we know nothing, then get the full set.
295 return FillWithPossibleTypes(TP, isVector, "vector");
297 TypeSet InputSet(*this);
298 bool MadeChange = false;
300 // Filter out all the scalar types.
301 for (unsigned i = 0; i != TypeVec.size(); ++i)
302 if (!isVector(TypeVec[i])) {
303 TypeVec.erase(TypeVec.begin()+i--);
308 TP.error("Type inference contradiction found, '" +
309 InputSet.getName() + "' needs to be a vector");
315 /// EnforceSmallerThan - 'this' must be a smaller VT than Other. Update
316 /// this an other based on this information.
317 bool EEVT::TypeSet::EnforceSmallerThan(EEVT::TypeSet &Other, TreePattern &TP) {
318 // Both operands must be integer or FP, but we don't care which.
319 bool MadeChange = false;
321 if (isCompletelyUnknown())
322 MadeChange = FillWithPossibleTypes(TP);
324 if (Other.isCompletelyUnknown())
325 MadeChange = Other.FillWithPossibleTypes(TP);
327 // If one side is known to be integer or known to be FP but the other side has
328 // no information, get at least the type integrality info in there.
329 if (!hasFloatingPointTypes())
330 MadeChange |= Other.EnforceInteger(TP);
331 else if (!hasIntegerTypes())
332 MadeChange |= Other.EnforceFloatingPoint(TP);
333 if (!Other.hasFloatingPointTypes())
334 MadeChange |= EnforceInteger(TP);
335 else if (!Other.hasIntegerTypes())
336 MadeChange |= EnforceFloatingPoint(TP);
338 assert(!isCompletelyUnknown() && !Other.isCompletelyUnknown() &&
339 "Should have a type list now");
341 // If one contains vectors but the other doesn't pull vectors out.
342 if (!hasVectorTypes())
343 MadeChange |= Other.EnforceScalar(TP);
344 if (!hasVectorTypes())
345 MadeChange |= EnforceScalar(TP);
347 // This code does not currently handle nodes which have multiple types,
348 // where some types are integer, and some are fp. Assert that this is not
350 assert(!(hasIntegerTypes() && hasFloatingPointTypes()) &&
351 !(Other.hasIntegerTypes() && Other.hasFloatingPointTypes()) &&
352 "SDTCisOpSmallerThanOp does not handle mixed int/fp types!");
354 // Okay, find the smallest type from the current set and remove it from the
356 MVT::SimpleValueType Smallest = TypeVec[0];
357 for (unsigned i = 1, e = TypeVec.size(); i != e; ++i)
358 if (TypeVec[i] < Smallest)
359 Smallest = TypeVec[i];
361 // If this is the only type in the large set, the constraint can never be
363 if (Other.TypeVec.size() == 1 && Other.TypeVec[0] == Smallest)
364 TP.error("Type inference contradiction found, '" +
365 Other.getName() + "' has nothing larger than '" + getName() +"'!");
367 SmallVector<MVT::SimpleValueType, 2>::iterator TVI =
368 std::find(Other.TypeVec.begin(), Other.TypeVec.end(), Smallest);
369 if (TVI != Other.TypeVec.end()) {
370 Other.TypeVec.erase(TVI);
374 // Okay, find the largest type in the Other set and remove it from the
376 MVT::SimpleValueType Largest = Other.TypeVec[0];
377 for (unsigned i = 1, e = Other.TypeVec.size(); i != e; ++i)
378 if (Other.TypeVec[i] > Largest)
379 Largest = Other.TypeVec[i];
381 // If this is the only type in the small set, the constraint can never be
383 if (TypeVec.size() == 1 && TypeVec[0] == Largest)
384 TP.error("Type inference contradiction found, '" +
385 getName() + "' has nothing smaller than '" + Other.getName()+"'!");
387 TVI = std::find(TypeVec.begin(), TypeVec.end(), Largest);
388 if (TVI != TypeVec.end()) {
396 /// EnforceVectorEltTypeIs - 'this' is now constrainted to be a vector type
397 /// whose element is specified by VTOperand.
398 bool EEVT::TypeSet::EnforceVectorEltTypeIs(EEVT::TypeSet &VTOperand,
400 // "This" must be a vector and "VTOperand" must be a scalar.
401 bool MadeChange = false;
402 MadeChange |= EnforceVector(TP);
403 MadeChange |= VTOperand.EnforceScalar(TP);
405 // If we know the vector type, it forces the scalar to agree.
407 EVT IVT = getConcrete();
408 IVT = IVT.getVectorElementType();
410 VTOperand.MergeInTypeInfo(IVT.getSimpleVT().SimpleTy, TP);
413 // If the scalar type is known, filter out vector types whose element types
415 if (!VTOperand.isConcrete())
418 MVT::SimpleValueType VT = VTOperand.getConcrete();
420 TypeSet InputSet(*this);
422 // Filter out all the types which don't have the right element type.
423 for (unsigned i = 0; i != TypeVec.size(); ++i) {
424 assert(isVector(TypeVec[i]) && "EnforceVector didn't work");
425 if (EVT(TypeVec[i]).getVectorElementType().getSimpleVT().SimpleTy != VT) {
426 TypeVec.erase(TypeVec.begin()+i--);
431 if (TypeVec.empty()) // FIXME: Really want an SMLoc here!
432 TP.error("Type inference contradiction found, forcing '" +
433 InputSet.getName() + "' to have a vector element");
437 //===----------------------------------------------------------------------===//
438 // Helpers for working with extended types.
440 bool RecordPtrCmp::operator()(const Record *LHS, const Record *RHS) const {
441 return LHS->getID() < RHS->getID();
444 /// Dependent variable map for CodeGenDAGPattern variant generation
445 typedef std::map<std::string, int> DepVarMap;
447 /// Const iterator shorthand for DepVarMap
448 typedef DepVarMap::const_iterator DepVarMap_citer;
451 void FindDepVarsOf(TreePatternNode *N, DepVarMap &DepMap) {
453 if (dynamic_cast<DefInit*>(N->getLeafValue()) != NULL) {
454 DepMap[N->getName()]++;
457 for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)
458 FindDepVarsOf(N->getChild(i), DepMap);
462 //! Find dependent variables within child patterns
465 void FindDepVars(TreePatternNode *N, MultipleUseVarSet &DepVars) {
467 FindDepVarsOf(N, depcounts);
468 for (DepVarMap_citer i = depcounts.begin(); i != depcounts.end(); ++i) {
469 if (i->second > 1) { // std::pair<std::string, int>
470 DepVars.insert(i->first);
475 //! Dump the dependent variable set:
476 void DumpDepVars(MultipleUseVarSet &DepVars) {
477 if (DepVars.empty()) {
478 DEBUG(errs() << "<empty set>");
480 DEBUG(errs() << "[ ");
481 for (MultipleUseVarSet::const_iterator i = DepVars.begin(), e = DepVars.end();
483 DEBUG(errs() << (*i) << " ");
485 DEBUG(errs() << "]");
490 //===----------------------------------------------------------------------===//
491 // PatternToMatch implementation
494 /// getPredicateCheck - Return a single string containing all of this
495 /// pattern's predicates concatenated with "&&" operators.
497 std::string PatternToMatch::getPredicateCheck() const {
498 std::string PredicateCheck;
499 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {
500 if (DefInit *Pred = dynamic_cast<DefInit*>(Predicates->getElement(i))) {
501 Record *Def = Pred->getDef();
502 if (!Def->isSubClassOf("Predicate")) {
506 assert(0 && "Unknown predicate type!");
508 if (!PredicateCheck.empty())
509 PredicateCheck += " && ";
510 PredicateCheck += "(" + Def->getValueAsString("CondString") + ")";
514 return PredicateCheck;
517 //===----------------------------------------------------------------------===//
518 // SDTypeConstraint implementation
521 SDTypeConstraint::SDTypeConstraint(Record *R) {
522 OperandNo = R->getValueAsInt("OperandNum");
524 if (R->isSubClassOf("SDTCisVT")) {
525 ConstraintType = SDTCisVT;
526 x.SDTCisVT_Info.VT = getValueType(R->getValueAsDef("VT"));
527 } else if (R->isSubClassOf("SDTCisPtrTy")) {
528 ConstraintType = SDTCisPtrTy;
529 } else if (R->isSubClassOf("SDTCisInt")) {
530 ConstraintType = SDTCisInt;
531 } else if (R->isSubClassOf("SDTCisFP")) {
532 ConstraintType = SDTCisFP;
533 } else if (R->isSubClassOf("SDTCisVec")) {
534 ConstraintType = SDTCisVec;
535 } else if (R->isSubClassOf("SDTCisSameAs")) {
536 ConstraintType = SDTCisSameAs;
537 x.SDTCisSameAs_Info.OtherOperandNum = R->getValueAsInt("OtherOperandNum");
538 } else if (R->isSubClassOf("SDTCisVTSmallerThanOp")) {
539 ConstraintType = SDTCisVTSmallerThanOp;
540 x.SDTCisVTSmallerThanOp_Info.OtherOperandNum =
541 R->getValueAsInt("OtherOperandNum");
542 } else if (R->isSubClassOf("SDTCisOpSmallerThanOp")) {
543 ConstraintType = SDTCisOpSmallerThanOp;
544 x.SDTCisOpSmallerThanOp_Info.BigOperandNum =
545 R->getValueAsInt("BigOperandNum");
546 } else if (R->isSubClassOf("SDTCisEltOfVec")) {
547 ConstraintType = SDTCisEltOfVec;
548 x.SDTCisEltOfVec_Info.OtherOperandNum = R->getValueAsInt("OtherOpNum");
550 errs() << "Unrecognized SDTypeConstraint '" << R->getName() << "'!\n";
555 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
556 /// N, and the result number in ResNo.
557 static TreePatternNode *getOperandNum(unsigned OpNo, TreePatternNode *N,
558 const SDNodeInfo &NodeInfo,
560 unsigned NumResults = NodeInfo.getNumResults();
561 if (OpNo < NumResults) {
568 if (OpNo >= N->getNumChildren()) {
569 errs() << "Invalid operand number in type constraint "
570 << (OpNo+NumResults) << " ";
576 return N->getChild(OpNo);
579 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
580 /// constraint to the nodes operands. This returns true if it makes a
581 /// change, false otherwise. If a type contradiction is found, throw an
583 bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
584 const SDNodeInfo &NodeInfo,
585 TreePattern &TP) const {
586 // Check that the number of operands is sane. Negative operands -> varargs.
587 if (NodeInfo.getNumOperands() >= 0) {
588 if (N->getNumChildren() != (unsigned)NodeInfo.getNumOperands())
589 TP.error(N->getOperator()->getName() + " node requires exactly " +
590 itostr(NodeInfo.getNumOperands()) + " operands!");
593 unsigned ResNo = 0; // The result number being referenced.
594 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo);
596 switch (ConstraintType) {
597 default: assert(0 && "Unknown constraint type!");
599 // Operand must be a particular type.
600 return NodeToApply->UpdateNodeType(ResNo, x.SDTCisVT_Info.VT, TP);
602 // Operand must be same as target pointer type.
603 return NodeToApply->UpdateNodeType(ResNo, MVT::iPTR, TP);
605 // Require it to be one of the legal integer VTs.
606 return NodeToApply->getExtType(ResNo).EnforceInteger(TP);
608 // Require it to be one of the legal fp VTs.
609 return NodeToApply->getExtType(ResNo).EnforceFloatingPoint(TP);
611 // Require it to be one of the legal vector VTs.
612 return NodeToApply->getExtType(ResNo).EnforceVector(TP);
615 TreePatternNode *OtherNode =
616 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NodeInfo, OResNo);
617 return NodeToApply->UpdateNodeType(OResNo, OtherNode->getExtType(ResNo),TP)|
618 OtherNode->UpdateNodeType(ResNo,NodeToApply->getExtType(OResNo),TP);
620 case SDTCisVTSmallerThanOp: {
621 // The NodeToApply must be a leaf node that is a VT. OtherOperandNum must
622 // have an integer type that is smaller than the VT.
623 if (!NodeToApply->isLeaf() ||
624 !dynamic_cast<DefInit*>(NodeToApply->getLeafValue()) ||
625 !static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef()
626 ->isSubClassOf("ValueType"))
627 TP.error(N->getOperator()->getName() + " expects a VT operand!");
628 MVT::SimpleValueType VT =
629 getValueType(static_cast<DefInit*>(NodeToApply->getLeafValue())->getDef());
631 EEVT::TypeSet TypeListTmp(VT, TP);
634 TreePatternNode *OtherNode =
635 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N, NodeInfo,
638 return TypeListTmp.EnforceSmallerThan(OtherNode->getExtType(OResNo), TP);
640 case SDTCisOpSmallerThanOp: {
642 TreePatternNode *BigOperand =
643 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NodeInfo,
645 return NodeToApply->getExtType(ResNo).
646 EnforceSmallerThan(BigOperand->getExtType(BResNo), TP);
648 case SDTCisEltOfVec: {
650 TreePatternNode *VecOperand =
651 getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum, N, NodeInfo,
654 // Filter vector types out of VecOperand that don't have the right element
656 return VecOperand->getExtType(VResNo).
657 EnforceVectorEltTypeIs(NodeToApply->getExtType(ResNo), TP);
663 //===----------------------------------------------------------------------===//
664 // SDNodeInfo implementation
666 SDNodeInfo::SDNodeInfo(Record *R) : Def(R) {
667 EnumName = R->getValueAsString("Opcode");
668 SDClassName = R->getValueAsString("SDClass");
669 Record *TypeProfile = R->getValueAsDef("TypeProfile");
670 NumResults = TypeProfile->getValueAsInt("NumResults");
671 NumOperands = TypeProfile->getValueAsInt("NumOperands");
673 // Parse the properties.
675 std::vector<Record*> PropList = R->getValueAsListOfDefs("Properties");
676 for (unsigned i = 0, e = PropList.size(); i != e; ++i) {
677 if (PropList[i]->getName() == "SDNPCommutative") {
678 Properties |= 1 << SDNPCommutative;
679 } else if (PropList[i]->getName() == "SDNPAssociative") {
680 Properties |= 1 << SDNPAssociative;
681 } else if (PropList[i]->getName() == "SDNPHasChain") {
682 Properties |= 1 << SDNPHasChain;
683 } else if (PropList[i]->getName() == "SDNPOutFlag") {
684 Properties |= 1 << SDNPOutFlag;
685 } else if (PropList[i]->getName() == "SDNPInFlag") {
686 Properties |= 1 << SDNPInFlag;
687 } else if (PropList[i]->getName() == "SDNPOptInFlag") {
688 Properties |= 1 << SDNPOptInFlag;
689 } else if (PropList[i]->getName() == "SDNPMayStore") {
690 Properties |= 1 << SDNPMayStore;
691 } else if (PropList[i]->getName() == "SDNPMayLoad") {
692 Properties |= 1 << SDNPMayLoad;
693 } else if (PropList[i]->getName() == "SDNPSideEffect") {
694 Properties |= 1 << SDNPSideEffect;
695 } else if (PropList[i]->getName() == "SDNPMemOperand") {
696 Properties |= 1 << SDNPMemOperand;
697 } else if (PropList[i]->getName() == "SDNPVariadic") {
698 Properties |= 1 << SDNPVariadic;
700 errs() << "Unknown SD Node property '" << PropList[i]->getName()
701 << "' on node '" << R->getName() << "'!\n";
707 // Parse the type constraints.
708 std::vector<Record*> ConstraintList =
709 TypeProfile->getValueAsListOfDefs("Constraints");
710 TypeConstraints.assign(ConstraintList.begin(), ConstraintList.end());
713 /// getKnownType - If the type constraints on this node imply a fixed type
714 /// (e.g. all stores return void, etc), then return it as an
715 /// MVT::SimpleValueType. Otherwise, return EEVT::Other.
716 MVT::SimpleValueType SDNodeInfo::getKnownType(unsigned ResNo) const {
717 unsigned NumResults = getNumResults();
718 assert(NumResults <= 1 &&
719 "We only work with nodes with zero or one result so far!");
720 assert(ResNo == 0 && "Only handles single result nodes so far");
722 for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i) {
723 // Make sure that this applies to the correct node result.
724 if (TypeConstraints[i].OperandNo >= NumResults) // FIXME: need value #
727 switch (TypeConstraints[i].ConstraintType) {
729 case SDTypeConstraint::SDTCisVT:
730 return TypeConstraints[i].x.SDTCisVT_Info.VT;
731 case SDTypeConstraint::SDTCisPtrTy:
738 //===----------------------------------------------------------------------===//
739 // TreePatternNode implementation
742 TreePatternNode::~TreePatternNode() {
743 #if 0 // FIXME: implement refcounted tree nodes!
744 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
749 static unsigned GetNumNodeResults(Record *Operator, CodeGenDAGPatterns &CDP) {
750 if (Operator->getName() == "set" ||
751 Operator->getName() == "implicit" ||
752 Operator->getName() == "parallel")
753 return 0; // All return nothing.
755 if (Operator->isSubClassOf("Intrinsic"))
756 return CDP.getIntrinsic(Operator).IS.RetVTs.size();
758 if (Operator->isSubClassOf("SDNode"))
759 return CDP.getSDNodeInfo(Operator).getNumResults();
761 if (Operator->isSubClassOf("PatFrag")) {
762 // If we've already parsed this pattern fragment, get it. Otherwise, handle
763 // the forward reference case where one pattern fragment references another
764 // before it is processed.
765 if (TreePattern *PFRec = CDP.getPatternFragmentIfRead(Operator))
766 return PFRec->getOnlyTree()->getNumTypes();
768 // Get the result tree.
769 DagInit *Tree = Operator->getValueAsDag("Fragment");
771 if (Tree && dynamic_cast<DefInit*>(Tree->getOperator()))
772 Op = dynamic_cast<DefInit*>(Tree->getOperator())->getDef();
773 assert(Op && "Invalid Fragment");
774 return GetNumNodeResults(Op, CDP);
777 if (Operator->isSubClassOf("Instruction")) {
778 CodeGenInstruction &InstInfo = CDP.getTargetInfo().getInstruction(Operator);
780 // FIXME: Handle implicit defs right.
781 if (InstInfo.NumDefs != 0)
782 return 1; // FIXME: Handle inst results right!
784 if (!InstInfo.ImplicitDefs.empty()) {
785 // Add on one implicit def if it has a resolvable type.
786 Record *FirstImplicitDef = InstInfo.ImplicitDefs[0];
787 assert(FirstImplicitDef->isSubClassOf("Register"));
788 const std::vector<MVT::SimpleValueType> &RegVTs =
789 CDP.getTargetInfo().getRegisterVTs(FirstImplicitDef);
790 if (RegVTs.size() == 1)
796 if (Operator->isSubClassOf("SDNodeXForm"))
797 return 1; // FIXME: Generalize SDNodeXForm
800 errs() << "Unhandled node in GetNumNodeResults\n";
804 void TreePatternNode::print(raw_ostream &OS) const {
806 OS << *getLeafValue();
808 OS << '(' << getOperator()->getName();
810 for (unsigned i = 0, e = Types.size(); i != e; ++i)
811 OS << ':' << getExtType(i).getName();
814 if (getNumChildren() != 0) {
816 getChild(0)->print(OS);
817 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
819 getChild(i)->print(OS);
825 for (unsigned i = 0, e = PredicateFns.size(); i != e; ++i)
826 OS << "<<P:" << PredicateFns[i] << ">>";
828 OS << "<<X:" << TransformFn->getName() << ">>";
829 if (!getName().empty())
830 OS << ":$" << getName();
833 void TreePatternNode::dump() const {
837 /// isIsomorphicTo - Return true if this node is recursively
838 /// isomorphic to the specified node. For this comparison, the node's
839 /// entire state is considered. The assigned name is ignored, since
840 /// nodes with differing names are considered isomorphic. However, if
841 /// the assigned name is present in the dependent variable set, then
842 /// the assigned name is considered significant and the node is
843 /// isomorphic if the names match.
844 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N,
845 const MultipleUseVarSet &DepVars) const {
846 if (N == this) return true;
847 if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
848 getPredicateFns() != N->getPredicateFns() ||
849 getTransformFn() != N->getTransformFn())
853 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
854 if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue())) {
855 return ((DI->getDef() == NDI->getDef())
856 && (DepVars.find(getName()) == DepVars.end()
857 || getName() == N->getName()));
860 return getLeafValue() == N->getLeafValue();
863 if (N->getOperator() != getOperator() ||
864 N->getNumChildren() != getNumChildren()) return false;
865 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
866 if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars))
871 /// clone - Make a copy of this tree and all of its children.
873 TreePatternNode *TreePatternNode::clone() const {
874 TreePatternNode *New;
876 New = new TreePatternNode(getLeafValue(), getNumTypes());
878 std::vector<TreePatternNode*> CChildren;
879 CChildren.reserve(Children.size());
880 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
881 CChildren.push_back(getChild(i)->clone());
882 New = new TreePatternNode(getOperator(), CChildren, getNumTypes());
884 New->setName(getName());
886 New->setPredicateFns(getPredicateFns());
887 New->setTransformFn(getTransformFn());
891 /// RemoveAllTypes - Recursively strip all the types of this tree.
892 void TreePatternNode::RemoveAllTypes() {
893 for (unsigned i = 0, e = Types.size(); i != e; ++i)
894 Types[i] = EEVT::TypeSet(); // Reset to unknown type.
895 if (isLeaf()) return;
896 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
897 getChild(i)->RemoveAllTypes();
901 /// SubstituteFormalArguments - Replace the formal arguments in this tree
902 /// with actual values specified by ArgMap.
903 void TreePatternNode::
904 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
905 if (isLeaf()) return;
907 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
908 TreePatternNode *Child = getChild(i);
909 if (Child->isLeaf()) {
910 Init *Val = Child->getLeafValue();
911 if (dynamic_cast<DefInit*>(Val) &&
912 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
913 // We found a use of a formal argument, replace it with its value.
914 TreePatternNode *NewChild = ArgMap[Child->getName()];
915 assert(NewChild && "Couldn't find formal argument!");
916 assert((Child->getPredicateFns().empty() ||
917 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
918 "Non-empty child predicate clobbered!");
919 setChild(i, NewChild);
922 getChild(i)->SubstituteFormalArguments(ArgMap);
928 /// InlinePatternFragments - If this pattern refers to any pattern
929 /// fragments, inline them into place, giving us a pattern without any
930 /// PatFrag references.
931 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
932 if (isLeaf()) return this; // nothing to do.
933 Record *Op = getOperator();
935 if (!Op->isSubClassOf("PatFrag")) {
936 // Just recursively inline children nodes.
937 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
938 TreePatternNode *Child = getChild(i);
939 TreePatternNode *NewChild = Child->InlinePatternFragments(TP);
941 assert((Child->getPredicateFns().empty() ||
942 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
943 "Non-empty child predicate clobbered!");
945 setChild(i, NewChild);
950 // Otherwise, we found a reference to a fragment. First, look up its
951 // TreePattern record.
952 TreePattern *Frag = TP.getDAGPatterns().getPatternFragment(Op);
954 // Verify that we are passing the right number of operands.
955 if (Frag->getNumArgs() != Children.size())
956 TP.error("'" + Op->getName() + "' fragment requires " +
957 utostr(Frag->getNumArgs()) + " operands!");
959 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
961 std::string Code = Op->getValueAsCode("Predicate");
963 FragTree->addPredicateFn("Predicate_"+Op->getName());
965 // Resolve formal arguments to their actual value.
966 if (Frag->getNumArgs()) {
967 // Compute the map of formal to actual arguments.
968 std::map<std::string, TreePatternNode*> ArgMap;
969 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
970 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
972 FragTree->SubstituteFormalArguments(ArgMap);
975 FragTree->setName(getName());
976 for (unsigned i = 0, e = Types.size(); i != e; ++i)
977 FragTree->UpdateNodeType(i, getExtType(i), TP);
979 // Transfer in the old predicates.
980 for (unsigned i = 0, e = getPredicateFns().size(); i != e; ++i)
981 FragTree->addPredicateFn(getPredicateFns()[i]);
983 // Get a new copy of this fragment to stitch into here.
984 //delete this; // FIXME: implement refcounting!
986 // The fragment we inlined could have recursive inlining that is needed. See
987 // if there are any pattern fragments in it and inline them as needed.
988 return FragTree->InlinePatternFragments(TP);
991 /// getImplicitType - Check to see if the specified record has an implicit
992 /// type which should be applied to it. This will infer the type of register
993 /// references from the register file information, for example.
995 static EEVT::TypeSet getImplicitType(Record *R, unsigned ResNo,
996 bool NotRegisters, TreePattern &TP) {
997 // Check to see if this is a register or a register class.
998 if (R->isSubClassOf("RegisterClass")) {
999 assert(ResNo == 0 && "Regclass ref only has one result!");
1001 return EEVT::TypeSet(); // Unknown.
1002 const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
1003 return EEVT::TypeSet(T.getRegisterClass(R).getValueTypes());
1006 if (R->isSubClassOf("PatFrag")) {
1007 assert(ResNo == 0 && "FIXME: PatFrag with multiple results?");
1008 // Pattern fragment types will be resolved when they are inlined.
1009 return EEVT::TypeSet(); // Unknown.
1012 if (R->isSubClassOf("Register")) {
1013 assert(ResNo == 0 && "Registers only produce one result!");
1015 return EEVT::TypeSet(); // Unknown.
1016 const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
1017 return EEVT::TypeSet(T.getRegisterVTs(R));
1020 if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
1021 assert(ResNo == 0 && "This node only has one result!");
1022 // Using a VTSDNode or CondCodeSDNode.
1023 return EEVT::TypeSet(MVT::Other, TP);
1026 if (R->isSubClassOf("ComplexPattern")) {
1027 assert(ResNo == 0 && "FIXME: ComplexPattern with multiple results?");
1029 return EEVT::TypeSet(); // Unknown.
1030 return EEVT::TypeSet(TP.getDAGPatterns().getComplexPattern(R).getValueType(),
1033 if (R->isSubClassOf("PointerLikeRegClass")) {
1034 assert(ResNo == 0 && "Regclass can only have one result!");
1035 return EEVT::TypeSet(MVT::iPTR, TP);
1038 if (R->getName() == "node" || R->getName() == "srcvalue" ||
1039 R->getName() == "zero_reg") {
1041 return EEVT::TypeSet(); // Unknown.
1044 TP.error("Unknown node flavor used in pattern: " + R->getName());
1045 return EEVT::TypeSet(MVT::Other, TP);
1049 /// getIntrinsicInfo - If this node corresponds to an intrinsic, return the
1050 /// CodeGenIntrinsic information for it, otherwise return a null pointer.
1051 const CodeGenIntrinsic *TreePatternNode::
1052 getIntrinsicInfo(const CodeGenDAGPatterns &CDP) const {
1053 if (getOperator() != CDP.get_intrinsic_void_sdnode() &&
1054 getOperator() != CDP.get_intrinsic_w_chain_sdnode() &&
1055 getOperator() != CDP.get_intrinsic_wo_chain_sdnode())
1059 dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
1060 return &CDP.getIntrinsicInfo(IID);
1063 /// getComplexPatternInfo - If this node corresponds to a ComplexPattern,
1064 /// return the ComplexPattern information, otherwise return null.
1065 const ComplexPattern *
1066 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const {
1067 if (!isLeaf()) return 0;
1069 DefInit *DI = dynamic_cast<DefInit*>(getLeafValue());
1070 if (DI && DI->getDef()->isSubClassOf("ComplexPattern"))
1071 return &CGP.getComplexPattern(DI->getDef());
1075 /// NodeHasProperty - Return true if this node has the specified property.
1076 bool TreePatternNode::NodeHasProperty(SDNP Property,
1077 const CodeGenDAGPatterns &CGP) const {
1079 if (const ComplexPattern *CP = getComplexPatternInfo(CGP))
1080 return CP->hasProperty(Property);
1084 Record *Operator = getOperator();
1085 if (!Operator->isSubClassOf("SDNode")) return false;
1087 return CGP.getSDNodeInfo(Operator).hasProperty(Property);
1093 /// TreeHasProperty - Return true if any node in this tree has the specified
1095 bool TreePatternNode::TreeHasProperty(SDNP Property,
1096 const CodeGenDAGPatterns &CGP) const {
1097 if (NodeHasProperty(Property, CGP))
1099 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1100 if (getChild(i)->TreeHasProperty(Property, CGP))
1105 /// isCommutativeIntrinsic - Return true if the node corresponds to a
1106 /// commutative intrinsic.
1108 TreePatternNode::isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const {
1109 if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP))
1110 return Int->isCommutative;
1115 /// ApplyTypeConstraints - Apply all of the type constraints relevant to
1116 /// this node and its children in the tree. This returns true if it makes a
1117 /// change, false otherwise. If a type contradiction is found, throw an
1119 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
1120 CodeGenDAGPatterns &CDP = TP.getDAGPatterns();
1122 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
1123 // If it's a regclass or something else known, include the type.
1124 bool MadeChange = false;
1125 for (unsigned i = 0, e = Types.size(); i != e; ++i)
1126 MadeChange |= UpdateNodeType(i, getImplicitType(DI->getDef(), i,
1127 NotRegisters, TP), TP);
1131 if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
1132 assert(Types.size() == 1 && "Invalid IntInit");
1134 // Int inits are always integers. :)
1135 bool MadeChange = Types[0].EnforceInteger(TP);
1137 if (!Types[0].isConcrete())
1140 MVT::SimpleValueType VT = getType(0);
1141 if (VT == MVT::iPTR || VT == MVT::iPTRAny)
1144 unsigned Size = EVT(VT).getSizeInBits();
1145 // Make sure that the value is representable for this type.
1146 if (Size >= 32) return MadeChange;
1148 int Val = (II->getValue() << (32-Size)) >> (32-Size);
1149 if (Val == II->getValue()) return MadeChange;
1151 // If sign-extended doesn't fit, does it fit as unsigned?
1153 unsigned UnsignedVal;
1154 ValueMask = unsigned(~uint32_t(0UL) >> (32-Size));
1155 UnsignedVal = unsigned(II->getValue());
1157 if ((ValueMask & UnsignedVal) == UnsignedVal)
1160 TP.error("Integer value '" + itostr(II->getValue())+
1161 "' is out of range for type '" + getEnumName(getType(0)) + "'!");
1167 // special handling for set, which isn't really an SDNode.
1168 if (getOperator()->getName() == "set") {
1169 assert(getNumTypes() == 0 && "Set doesn't produce a value");
1170 assert(getNumChildren() >= 2 && "Missing RHS of a set?");
1171 unsigned NC = getNumChildren();
1173 TreePatternNode *SetVal = getChild(NC-1);
1174 bool MadeChange = SetVal->ApplyTypeConstraints(TP, NotRegisters);
1176 for (unsigned i = 0; i < NC-1; ++i) {
1177 TreePatternNode *Child = getChild(i);
1178 MadeChange |= Child->ApplyTypeConstraints(TP, NotRegisters);
1180 // Types of operands must match.
1181 MadeChange |= Child->UpdateNodeType(0, SetVal->getExtType(i), TP);
1182 MadeChange |= SetVal->UpdateNodeType(i, Child->getExtType(0), TP);
1187 if (getOperator()->getName() == "implicit" ||
1188 getOperator()->getName() == "parallel") {
1189 assert(getNumTypes() == 0 && "Node doesn't produce a value");
1191 bool MadeChange = false;
1192 for (unsigned i = 0; i < getNumChildren(); ++i)
1193 MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1197 if (getOperator()->getName() == "COPY_TO_REGCLASS") {
1198 bool MadeChange = false;
1199 MadeChange |= getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1200 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
1202 assert(getChild(0)->getNumTypes() == 1 &&
1203 getChild(1)->getNumTypes() == 1 && "Unhandled case");
1205 // child #1 of COPY_TO_REGCLASS should be a register class. We don't care
1206 // what type it gets, so if it didn't get a concrete type just give it the
1207 // first viable type from the reg class.
1208 if (!getChild(1)->hasTypeSet(0) &&
1209 !getChild(1)->getExtType(0).isCompletelyUnknown()) {
1210 MVT::SimpleValueType RCVT = getChild(1)->getExtType(0).getTypeList()[0];
1211 MadeChange |= getChild(1)->UpdateNodeType(0, RCVT, TP);
1216 if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP)) {
1217 bool MadeChange = false;
1219 // Apply the result type to the node.
1220 unsigned NumRetVTs = Int->IS.RetVTs.size();
1221 unsigned NumParamVTs = Int->IS.ParamVTs.size();
1223 for (unsigned i = 0, e = NumRetVTs; i != e; ++i)
1224 MadeChange |= UpdateNodeType(i, Int->IS.RetVTs[i], TP);
1226 if (getNumChildren() != NumParamVTs + 1)
1227 TP.error("Intrinsic '" + Int->Name + "' expects " +
1228 utostr(NumParamVTs) + " operands, not " +
1229 utostr(getNumChildren() - 1) + " operands!");
1231 // Apply type info to the intrinsic ID.
1232 MadeChange |= getChild(0)->UpdateNodeType(0, MVT::iPTR, TP);
1234 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {
1235 MadeChange |= getChild(i+1)->ApplyTypeConstraints(TP, NotRegisters);
1237 MVT::SimpleValueType OpVT = Int->IS.ParamVTs[i];
1238 assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case");
1239 MadeChange |= getChild(i+1)->UpdateNodeType(0, OpVT, TP);
1244 if (getOperator()->isSubClassOf("SDNode")) {
1245 const SDNodeInfo &NI = CDP.getSDNodeInfo(getOperator());
1247 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
1248 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1249 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1253 if (getOperator()->isSubClassOf("Instruction")) {
1254 const DAGInstruction &Inst = CDP.getInstruction(getOperator());
1256 assert(Inst.getNumResults() <= 1 &&
1257 "FIXME: Only supports zero or one result instrs!");
1259 CodeGenInstruction &InstInfo =
1260 CDP.getTargetInfo().getInstruction(getOperator());
1262 EEVT::TypeSet ResultType;
1264 // Apply the result type to the node
1265 if (InstInfo.NumDefs != 0) { // # of elements in (outs) list
1266 Record *ResultNode = Inst.getResult(0);
1268 if (ResultNode->isSubClassOf("PointerLikeRegClass")) {
1269 ResultType = EEVT::TypeSet(MVT::iPTR, TP);
1270 } else if (ResultNode->getName() == "unknown") {
1273 assert(ResultNode->isSubClassOf("RegisterClass") &&
1274 "Operands should be register classes!");
1275 const CodeGenRegisterClass &RC =
1276 CDP.getTargetInfo().getRegisterClass(ResultNode);
1277 ResultType = RC.getValueTypes();
1279 } else if (!InstInfo.ImplicitDefs.empty()) {
1280 // If the instruction has implicit defs, the first one defines the result
1282 Record *FirstImplicitDef = InstInfo.ImplicitDefs[0];
1283 assert(FirstImplicitDef->isSubClassOf("Register"));
1284 const std::vector<MVT::SimpleValueType> &RegVTs =
1285 CDP.getTargetInfo().getRegisterVTs(FirstImplicitDef);
1286 if (RegVTs.size() == 1) // FIXME: Generalize.
1287 ResultType = EEVT::TypeSet(RegVTs);
1289 // Otherwise, the instruction produces no value result.
1292 bool MadeChange = false;
1294 if (!ResultType.isCompletelyUnknown())
1295 MadeChange |= UpdateNodeType(ResNo, ResultType, TP);
1297 // If this is an INSERT_SUBREG, constrain the source and destination VTs to
1299 if (getOperator()->getName() == "INSERT_SUBREG") {
1300 assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled");
1301 MadeChange |= UpdateNodeType(0, getChild(0)->getExtType(0), TP);
1302 MadeChange |= getChild(0)->UpdateNodeType(0, getExtType(0), TP);
1305 unsigned ChildNo = 0;
1306 for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i) {
1307 Record *OperandNode = Inst.getOperand(i);
1309 // If the instruction expects a predicate or optional def operand, we
1310 // codegen this by setting the operand to it's default value if it has a
1311 // non-empty DefaultOps field.
1312 if ((OperandNode->isSubClassOf("PredicateOperand") ||
1313 OperandNode->isSubClassOf("OptionalDefOperand")) &&
1314 !CDP.getDefaultOperand(OperandNode).DefaultOps.empty())
1317 // Verify that we didn't run out of provided operands.
1318 if (ChildNo >= getNumChildren())
1319 TP.error("Instruction '" + getOperator()->getName() +
1320 "' expects more operands than were provided.");
1322 MVT::SimpleValueType VT;
1323 TreePatternNode *Child = getChild(ChildNo++);
1324 assert(Child->getNumTypes() == 1 && "Unknown case?");
1326 if (OperandNode->isSubClassOf("RegisterClass")) {
1327 const CodeGenRegisterClass &RC =
1328 CDP.getTargetInfo().getRegisterClass(OperandNode);
1329 MadeChange |= Child->UpdateNodeType(0, RC.getValueTypes(), TP);
1330 } else if (OperandNode->isSubClassOf("Operand")) {
1331 VT = getValueType(OperandNode->getValueAsDef("Type"));
1332 MadeChange |= Child->UpdateNodeType(0, VT, TP);
1333 } else if (OperandNode->isSubClassOf("PointerLikeRegClass")) {
1334 MadeChange |= Child->UpdateNodeType(0, MVT::iPTR, TP);
1335 } else if (OperandNode->getName() == "unknown") {
1338 assert(0 && "Unknown operand type!");
1341 MadeChange |= Child->ApplyTypeConstraints(TP, NotRegisters);
1344 if (ChildNo != getNumChildren())
1345 TP.error("Instruction '" + getOperator()->getName() +
1346 "' was provided too many operands!");
1351 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
1353 // Node transforms always take one operand.
1354 if (getNumChildren() != 1)
1355 TP.error("Node transform '" + getOperator()->getName() +
1356 "' requires one operand!");
1358 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1361 // If either the output or input of the xform does not have exact
1362 // type info. We assume they must be the same. Otherwise, it is perfectly
1363 // legal to transform from one type to a completely different type.
1365 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
1366 bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
1367 MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
1374 /// OnlyOnRHSOfCommutative - Return true if this value is only allowed on the
1375 /// RHS of a commutative operation, not the on LHS.
1376 static bool OnlyOnRHSOfCommutative(TreePatternNode *N) {
1377 if (!N->isLeaf() && N->getOperator()->getName() == "imm")
1379 if (N->isLeaf() && dynamic_cast<IntInit*>(N->getLeafValue()))
1385 /// canPatternMatch - If it is impossible for this pattern to match on this
1386 /// target, fill in Reason and return false. Otherwise, return true. This is
1387 /// used as a sanity check for .td files (to prevent people from writing stuff
1388 /// that can never possibly work), and to prevent the pattern permuter from
1389 /// generating stuff that is useless.
1390 bool TreePatternNode::canPatternMatch(std::string &Reason,
1391 const CodeGenDAGPatterns &CDP) {
1392 if (isLeaf()) return true;
1394 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1395 if (!getChild(i)->canPatternMatch(Reason, CDP))
1398 // If this is an intrinsic, handle cases that would make it not match. For
1399 // example, if an operand is required to be an immediate.
1400 if (getOperator()->isSubClassOf("Intrinsic")) {
1405 // If this node is a commutative operator, check that the LHS isn't an
1407 const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(getOperator());
1408 bool isCommIntrinsic = isCommutativeIntrinsic(CDP);
1409 if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
1410 // Scan all of the operands of the node and make sure that only the last one
1411 // is a constant node, unless the RHS also is.
1412 if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
1413 bool Skip = isCommIntrinsic ? 1 : 0; // First operand is intrinsic id.
1414 for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)
1415 if (OnlyOnRHSOfCommutative(getChild(i))) {
1416 Reason="Immediate value must be on the RHS of commutative operators!";
1425 //===----------------------------------------------------------------------===//
1426 // TreePattern implementation
1429 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
1430 CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1431 isInputPattern = isInput;
1432 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
1433 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
1436 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
1437 CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1438 isInputPattern = isInput;
1439 Trees.push_back(ParseTreePattern(Pat));
1442 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
1443 CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1444 isInputPattern = isInput;
1445 Trees.push_back(Pat);
1448 void TreePattern::error(const std::string &Msg) const {
1450 throw TGError(TheRecord->getLoc(), "In " + TheRecord->getName() + ": " + Msg);
1453 void TreePattern::ComputeNamedNodes() {
1454 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1455 ComputeNamedNodes(Trees[i]);
1458 void TreePattern::ComputeNamedNodes(TreePatternNode *N) {
1459 if (!N->getName().empty())
1460 NamedNodes[N->getName()].push_back(N);
1462 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1463 ComputeNamedNodes(N->getChild(i));
1467 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
1468 DefInit *OpDef = dynamic_cast<DefInit*>(Dag->getOperator());
1469 if (!OpDef) error("Pattern has unexpected operator type!");
1470 Record *Operator = OpDef->getDef();
1472 if (Operator->isSubClassOf("ValueType")) {
1473 // If the operator is a ValueType, then this must be "type cast" of a leaf
1475 if (Dag->getNumArgs() != 1)
1476 error("Type cast only takes one operand!");
1478 Init *Arg = Dag->getArg(0);
1479 TreePatternNode *New;
1480 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
1481 Record *R = DI->getDef();
1482 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
1483 Dag->setArg(0, new DagInit(DI, "",
1484 std::vector<std::pair<Init*, std::string> >()));
1485 return ParseTreePattern(Dag);
1489 if (R->getName() == "node") {
1490 if (Dag->getArgName(0).empty())
1491 error("'node' argument requires a name to match with operand list");
1492 Args.push_back(Dag->getArgName(0));
1495 New = new TreePatternNode(DI, 1);
1496 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
1497 New = ParseTreePattern(DI);
1498 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
1499 New = new TreePatternNode(II, 1);
1500 if (!Dag->getArgName(0).empty())
1501 error("Constant int argument should not have a name!");
1502 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
1503 // Turn this into an IntInit.
1504 Init *II = BI->convertInitializerTo(new IntRecTy());
1505 if (II == 0 || !dynamic_cast<IntInit*>(II))
1506 error("Bits value must be constants!");
1508 New = new TreePatternNode(dynamic_cast<IntInit*>(II), 1);
1509 if (!Dag->getArgName(0).empty())
1510 error("Constant int argument should not have a name!");
1513 error("Unknown leaf value for tree pattern!");
1517 // Apply the type cast.
1518 assert(New->getNumTypes() == 1 && "FIXME: Unhandled");
1519 New->UpdateNodeType(0, getValueType(Operator), *this);
1520 if (New->getNumChildren() == 0)
1521 New->setName(Dag->getArgName(0));
1525 // Verify that this is something that makes sense for an operator.
1526 if (!Operator->isSubClassOf("PatFrag") &&
1527 !Operator->isSubClassOf("SDNode") &&
1528 !Operator->isSubClassOf("Instruction") &&
1529 !Operator->isSubClassOf("SDNodeXForm") &&
1530 !Operator->isSubClassOf("Intrinsic") &&
1531 Operator->getName() != "set" &&
1532 Operator->getName() != "implicit" &&
1533 Operator->getName() != "parallel")
1534 error("Unrecognized node '" + Operator->getName() + "'!");
1536 // Check to see if this is something that is illegal in an input pattern.
1537 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
1538 Operator->isSubClassOf("SDNodeXForm")))
1539 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
1541 std::vector<TreePatternNode*> Children;
1543 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
1544 Init *Arg = Dag->getArg(i);
1545 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
1546 Children.push_back(ParseTreePattern(DI));
1547 if (Children.back()->getName().empty())
1548 Children.back()->setName(Dag->getArgName(i));
1549 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
1550 Record *R = DefI->getDef();
1551 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
1552 // TreePatternNode if its own.
1553 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
1554 Dag->setArg(i, new DagInit(DefI, "",
1555 std::vector<std::pair<Init*, std::string> >()));
1556 --i; // Revisit this node...
1558 TreePatternNode *Node = new TreePatternNode(DefI, 1);
1559 Node->setName(Dag->getArgName(i));
1560 Children.push_back(Node);
1563 if (R->getName() == "node") {
1564 if (Dag->getArgName(i).empty())
1565 error("'node' argument requires a name to match with operand list");
1566 Args.push_back(Dag->getArgName(i));
1569 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
1570 TreePatternNode *Node = new TreePatternNode(II, 1);
1571 if (!Dag->getArgName(i).empty())
1572 error("Constant int argument should not have a name!");
1573 Children.push_back(Node);
1574 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
1575 // Turn this into an IntInit.
1576 Init *II = BI->convertInitializerTo(new IntRecTy());
1577 if (II == 0 || !dynamic_cast<IntInit*>(II))
1578 error("Bits value must be constants!");
1580 TreePatternNode *Node = new TreePatternNode(dynamic_cast<IntInit*>(II),1);
1581 if (!Dag->getArgName(i).empty())
1582 error("Constant int argument should not have a name!");
1583 Children.push_back(Node);
1588 error("Unknown leaf value for tree pattern!");
1592 // If the operator is an intrinsic, then this is just syntactic sugar for for
1593 // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
1594 // convert the intrinsic name to a number.
1595 if (Operator->isSubClassOf("Intrinsic")) {
1596 const CodeGenIntrinsic &Int = getDAGPatterns().getIntrinsic(Operator);
1597 unsigned IID = getDAGPatterns().getIntrinsicID(Operator)+1;
1599 // If this intrinsic returns void, it must have side-effects and thus a
1601 if (Int.IS.RetVTs.empty()) {
1602 Operator = getDAGPatterns().get_intrinsic_void_sdnode();
1603 } else if (Int.ModRef != CodeGenIntrinsic::NoMem) {
1604 // Has side-effects, requires chain.
1605 Operator = getDAGPatterns().get_intrinsic_w_chain_sdnode();
1607 // Otherwise, no chain.
1608 Operator = getDAGPatterns().get_intrinsic_wo_chain_sdnode();
1611 TreePatternNode *IIDNode = new TreePatternNode(new IntInit(IID), 1);
1612 Children.insert(Children.begin(), IIDNode);
1615 unsigned NumResults = GetNumNodeResults(Operator, CDP);
1616 TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults);
1617 Result->setName(Dag->getName());
1621 /// InferAllTypes - Infer/propagate as many types throughout the expression
1622 /// patterns as possible. Return true if all types are inferred, false
1623 /// otherwise. Throw an exception if a type contradiction is found.
1625 InferAllTypes(const StringMap<SmallVector<TreePatternNode*,1> > *InNamedTypes) {
1626 if (NamedNodes.empty())
1627 ComputeNamedNodes();
1629 bool MadeChange = true;
1630 while (MadeChange) {
1632 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1633 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
1635 // If there are constraints on our named nodes, apply them.
1636 for (StringMap<SmallVector<TreePatternNode*,1> >::iterator
1637 I = NamedNodes.begin(), E = NamedNodes.end(); I != E; ++I) {
1638 SmallVectorImpl<TreePatternNode*> &Nodes = I->second;
1640 // If we have input named node types, propagate their types to the named
1643 // FIXME: Should be error?
1644 assert(InNamedTypes->count(I->getKey()) &&
1645 "Named node in output pattern but not input pattern?");
1647 const SmallVectorImpl<TreePatternNode*> &InNodes =
1648 InNamedTypes->find(I->getKey())->second;
1650 // The input types should be fully resolved by now.
1651 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
1652 // If this node is a register class, and it is the root of the pattern
1653 // then we're mapping something onto an input register. We allow
1654 // changing the type of the input register in this case. This allows
1655 // us to match things like:
1656 // def : Pat<(v1i64 (bitconvert(v2i32 DPR:$src))), (v1i64 DPR:$src)>;
1657 if (Nodes[i] == Trees[0] && Nodes[i]->isLeaf()) {
1658 DefInit *DI = dynamic_cast<DefInit*>(Nodes[i]->getLeafValue());
1659 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1663 assert(Nodes[i]->getNumTypes() == 1 &&
1664 InNodes[0]->getNumTypes() == 1 &&
1665 "FIXME: cannot name multiple result nodes yet");
1666 MadeChange |= Nodes[i]->UpdateNodeType(0, InNodes[0]->getExtType(0),
1671 // If there are multiple nodes with the same name, they must all have the
1673 if (I->second.size() > 1) {
1674 for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {
1675 TreePatternNode *N1 = Nodes[i], *N2 = Nodes[i+1];
1676 assert(N1->getNumTypes() == 1 && N2->getNumTypes() == 1 &&
1677 "FIXME: cannot name multiple result nodes yet");
1679 MadeChange |= N1->UpdateNodeType(0, N2->getExtType(0), *this);
1680 MadeChange |= N2->UpdateNodeType(0, N1->getExtType(0), *this);
1686 bool HasUnresolvedTypes = false;
1687 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1688 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
1689 return !HasUnresolvedTypes;
1692 void TreePattern::print(raw_ostream &OS) const {
1693 OS << getRecord()->getName();
1694 if (!Args.empty()) {
1695 OS << "(" << Args[0];
1696 for (unsigned i = 1, e = Args.size(); i != e; ++i)
1697 OS << ", " << Args[i];
1702 if (Trees.size() > 1)
1704 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
1706 Trees[i]->print(OS);
1710 if (Trees.size() > 1)
1714 void TreePattern::dump() const { print(errs()); }
1716 //===----------------------------------------------------------------------===//
1717 // CodeGenDAGPatterns implementation
1720 CodeGenDAGPatterns::CodeGenDAGPatterns(RecordKeeper &R) : Records(R) {
1721 Intrinsics = LoadIntrinsics(Records, false);
1722 TgtIntrinsics = LoadIntrinsics(Records, true);
1724 ParseNodeTransforms();
1725 ParseComplexPatterns();
1726 ParsePatternFragments();
1727 ParseDefaultOperands();
1728 ParseInstructions();
1731 // Generate variants. For example, commutative patterns can match
1732 // multiple ways. Add them to PatternsToMatch as well.
1735 // Infer instruction flags. For example, we can detect loads,
1736 // stores, and side effects in many cases by examining an
1737 // instruction's pattern.
1738 InferInstructionFlags();
1741 CodeGenDAGPatterns::~CodeGenDAGPatterns() {
1742 for (pf_iterator I = PatternFragments.begin(),
1743 E = PatternFragments.end(); I != E; ++I)
1748 Record *CodeGenDAGPatterns::getSDNodeNamed(const std::string &Name) const {
1749 Record *N = Records.getDef(Name);
1750 if (!N || !N->isSubClassOf("SDNode")) {
1751 errs() << "Error getting SDNode '" << Name << "'!\n";
1757 // Parse all of the SDNode definitions for the target, populating SDNodes.
1758 void CodeGenDAGPatterns::ParseNodeInfo() {
1759 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
1760 while (!Nodes.empty()) {
1761 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
1765 // Get the builtin intrinsic nodes.
1766 intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
1767 intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
1768 intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
1771 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
1772 /// map, and emit them to the file as functions.
1773 void CodeGenDAGPatterns::ParseNodeTransforms() {
1774 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
1775 while (!Xforms.empty()) {
1776 Record *XFormNode = Xforms.back();
1777 Record *SDNode = XFormNode->getValueAsDef("Opcode");
1778 std::string Code = XFormNode->getValueAsCode("XFormFunction");
1779 SDNodeXForms.insert(std::make_pair(XFormNode, NodeXForm(SDNode, Code)));
1785 void CodeGenDAGPatterns::ParseComplexPatterns() {
1786 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
1787 while (!AMs.empty()) {
1788 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
1794 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
1795 /// file, building up the PatternFragments map. After we've collected them all,
1796 /// inline fragments together as necessary, so that there are no references left
1797 /// inside a pattern fragment to a pattern fragment.
1799 void CodeGenDAGPatterns::ParsePatternFragments() {
1800 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
1802 // First step, parse all of the fragments.
1803 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1804 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
1805 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
1806 PatternFragments[Fragments[i]] = P;
1808 // Validate the argument list, converting it to set, to discard duplicates.
1809 std::vector<std::string> &Args = P->getArgList();
1810 std::set<std::string> OperandsSet(Args.begin(), Args.end());
1812 if (OperandsSet.count(""))
1813 P->error("Cannot have unnamed 'node' values in pattern fragment!");
1815 // Parse the operands list.
1816 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
1817 DefInit *OpsOp = dynamic_cast<DefInit*>(OpsList->getOperator());
1818 // Special cases: ops == outs == ins. Different names are used to
1819 // improve readability.
1821 (OpsOp->getDef()->getName() != "ops" &&
1822 OpsOp->getDef()->getName() != "outs" &&
1823 OpsOp->getDef()->getName() != "ins"))
1824 P->error("Operands list should start with '(ops ... '!");
1826 // Copy over the arguments.
1828 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
1829 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
1830 static_cast<DefInit*>(OpsList->getArg(j))->
1831 getDef()->getName() != "node")
1832 P->error("Operands list should all be 'node' values.");
1833 if (OpsList->getArgName(j).empty())
1834 P->error("Operands list should have names for each operand!");
1835 if (!OperandsSet.count(OpsList->getArgName(j)))
1836 P->error("'" + OpsList->getArgName(j) +
1837 "' does not occur in pattern or was multiply specified!");
1838 OperandsSet.erase(OpsList->getArgName(j));
1839 Args.push_back(OpsList->getArgName(j));
1842 if (!OperandsSet.empty())
1843 P->error("Operands list does not contain an entry for operand '" +
1844 *OperandsSet.begin() + "'!");
1846 // If there is a code init for this fragment, keep track of the fact that
1847 // this fragment uses it.
1848 std::string Code = Fragments[i]->getValueAsCode("Predicate");
1850 P->getOnlyTree()->addPredicateFn("Predicate_"+Fragments[i]->getName());
1852 // If there is a node transformation corresponding to this, keep track of
1854 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
1855 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
1856 P->getOnlyTree()->setTransformFn(Transform);
1859 // Now that we've parsed all of the tree fragments, do a closure on them so
1860 // that there are not references to PatFrags left inside of them.
1861 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1862 TreePattern *ThePat = PatternFragments[Fragments[i]];
1863 ThePat->InlinePatternFragments();
1865 // Infer as many types as possible. Don't worry about it if we don't infer
1866 // all of them, some may depend on the inputs of the pattern.
1868 ThePat->InferAllTypes();
1870 // If this pattern fragment is not supported by this target (no types can
1871 // satisfy its constraints), just ignore it. If the bogus pattern is
1872 // actually used by instructions, the type consistency error will be
1876 // If debugging, print out the pattern fragment result.
1877 DEBUG(ThePat->dump());
1881 void CodeGenDAGPatterns::ParseDefaultOperands() {
1882 std::vector<Record*> DefaultOps[2];
1883 DefaultOps[0] = Records.getAllDerivedDefinitions("PredicateOperand");
1884 DefaultOps[1] = Records.getAllDerivedDefinitions("OptionalDefOperand");
1886 // Find some SDNode.
1887 assert(!SDNodes.empty() && "No SDNodes parsed?");
1888 Init *SomeSDNode = new DefInit(SDNodes.begin()->first);
1890 for (unsigned iter = 0; iter != 2; ++iter) {
1891 for (unsigned i = 0, e = DefaultOps[iter].size(); i != e; ++i) {
1892 DagInit *DefaultInfo = DefaultOps[iter][i]->getValueAsDag("DefaultOps");
1894 // Clone the DefaultInfo dag node, changing the operator from 'ops' to
1895 // SomeSDnode so that we can parse this.
1896 std::vector<std::pair<Init*, std::string> > Ops;
1897 for (unsigned op = 0, e = DefaultInfo->getNumArgs(); op != e; ++op)
1898 Ops.push_back(std::make_pair(DefaultInfo->getArg(op),
1899 DefaultInfo->getArgName(op)));
1900 DagInit *DI = new DagInit(SomeSDNode, "", Ops);
1902 // Create a TreePattern to parse this.
1903 TreePattern P(DefaultOps[iter][i], DI, false, *this);
1904 assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!");
1906 // Copy the operands over into a DAGDefaultOperand.
1907 DAGDefaultOperand DefaultOpInfo;
1909 TreePatternNode *T = P.getTree(0);
1910 for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {
1911 TreePatternNode *TPN = T->getChild(op);
1912 while (TPN->ApplyTypeConstraints(P, false))
1913 /* Resolve all types */;
1915 if (TPN->ContainsUnresolvedType()) {
1917 throw "Value #" + utostr(i) + " of PredicateOperand '" +
1918 DefaultOps[iter][i]->getName() +"' doesn't have a concrete type!";
1920 throw "Value #" + utostr(i) + " of OptionalDefOperand '" +
1921 DefaultOps[iter][i]->getName() +"' doesn't have a concrete type!";
1923 DefaultOpInfo.DefaultOps.push_back(TPN);
1926 // Insert it into the DefaultOperands map so we can find it later.
1927 DefaultOperands[DefaultOps[iter][i]] = DefaultOpInfo;
1932 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1933 /// instruction input. Return true if this is a real use.
1934 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1935 std::map<std::string, TreePatternNode*> &InstInputs,
1936 std::vector<Record*> &InstImpInputs) {
1937 // No name -> not interesting.
1938 if (Pat->getName().empty()) {
1939 if (Pat->isLeaf()) {
1940 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1941 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1942 I->error("Input " + DI->getDef()->getName() + " must be named!");
1943 else if (DI && DI->getDef()->isSubClassOf("Register"))
1944 InstImpInputs.push_back(DI->getDef());
1950 if (Pat->isLeaf()) {
1951 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1952 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1955 Rec = Pat->getOperator();
1958 // SRCVALUE nodes are ignored.
1959 if (Rec->getName() == "srcvalue")
1962 TreePatternNode *&Slot = InstInputs[Pat->getName()];
1968 if (Slot->isLeaf()) {
1969 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1971 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1972 SlotRec = Slot->getOperator();
1975 // Ensure that the inputs agree if we've already seen this input.
1977 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1978 if (Slot->getExtTypes() != Pat->getExtTypes())
1979 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1983 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1984 /// part of "I", the instruction), computing the set of inputs and outputs of
1985 /// the pattern. Report errors if we see anything naughty.
1986 void CodeGenDAGPatterns::
1987 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1988 std::map<std::string, TreePatternNode*> &InstInputs,
1989 std::map<std::string, TreePatternNode*>&InstResults,
1990 std::vector<Record*> &InstImpInputs,
1991 std::vector<Record*> &InstImpResults) {
1992 if (Pat->isLeaf()) {
1993 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1994 if (!isUse && Pat->getTransformFn())
1995 I->error("Cannot specify a transform function for a non-input value!");
1999 if (Pat->getOperator()->getName() == "implicit") {
2000 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
2001 TreePatternNode *Dest = Pat->getChild(i);
2002 if (!Dest->isLeaf())
2003 I->error("implicitly defined value should be a register!");
2005 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
2006 if (!Val || !Val->getDef()->isSubClassOf("Register"))
2007 I->error("implicitly defined value should be a register!");
2008 InstImpResults.push_back(Val->getDef());
2013 if (Pat->getOperator()->getName() != "set") {
2014 // If this is not a set, verify that the children nodes are not void typed,
2016 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
2017 if (Pat->getChild(i)->getNumTypes() == 0)
2018 I->error("Cannot have void nodes inside of patterns!");
2019 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
2020 InstImpInputs, InstImpResults);
2023 // If this is a non-leaf node with no children, treat it basically as if
2024 // it were a leaf. This handles nodes like (imm).
2025 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
2027 if (!isUse && Pat->getTransformFn())
2028 I->error("Cannot specify a transform function for a non-input value!");
2032 // Otherwise, this is a set, validate and collect instruction results.
2033 if (Pat->getNumChildren() == 0)
2034 I->error("set requires operands!");
2036 if (Pat->getTransformFn())
2037 I->error("Cannot specify a transform function on a set node!");
2039 // Check the set destinations.
2040 unsigned NumDests = Pat->getNumChildren()-1;
2041 for (unsigned i = 0; i != NumDests; ++i) {
2042 TreePatternNode *Dest = Pat->getChild(i);
2043 if (!Dest->isLeaf())
2044 I->error("set destination should be a register!");
2046 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
2048 I->error("set destination should be a register!");
2050 if (Val->getDef()->isSubClassOf("RegisterClass") ||
2051 Val->getDef()->isSubClassOf("PointerLikeRegClass")) {
2052 if (Dest->getName().empty())
2053 I->error("set destination must have a name!");
2054 if (InstResults.count(Dest->getName()))
2055 I->error("cannot set '" + Dest->getName() +"' multiple times");
2056 InstResults[Dest->getName()] = Dest;
2057 } else if (Val->getDef()->isSubClassOf("Register")) {
2058 InstImpResults.push_back(Val->getDef());
2060 I->error("set destination should be a register!");
2064 // Verify and collect info from the computation.
2065 FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
2066 InstInputs, InstResults,
2067 InstImpInputs, InstImpResults);
2070 //===----------------------------------------------------------------------===//
2071 // Instruction Analysis
2072 //===----------------------------------------------------------------------===//
2074 class InstAnalyzer {
2075 const CodeGenDAGPatterns &CDP;
2078 bool &HasSideEffects;
2081 InstAnalyzer(const CodeGenDAGPatterns &cdp,
2082 bool &maystore, bool &mayload, bool &hse, bool &isv)
2083 : CDP(cdp), mayStore(maystore), mayLoad(mayload), HasSideEffects(hse),
2087 /// Analyze - Analyze the specified instruction, returning true if the
2088 /// instruction had a pattern.
2089 bool Analyze(Record *InstRecord) {
2090 const TreePattern *Pattern = CDP.getInstruction(InstRecord).getPattern();
2093 return false; // No pattern.
2096 // FIXME: Assume only the first tree is the pattern. The others are clobber
2098 AnalyzeNode(Pattern->getTree(0));
2103 void AnalyzeNode(const TreePatternNode *N) {
2105 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
2106 Record *LeafRec = DI->getDef();
2107 // Handle ComplexPattern leaves.
2108 if (LeafRec->isSubClassOf("ComplexPattern")) {
2109 const ComplexPattern &CP = CDP.getComplexPattern(LeafRec);
2110 if (CP.hasProperty(SDNPMayStore)) mayStore = true;
2111 if (CP.hasProperty(SDNPMayLoad)) mayLoad = true;
2112 if (CP.hasProperty(SDNPSideEffect)) HasSideEffects = true;
2118 // Analyze children.
2119 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2120 AnalyzeNode(N->getChild(i));
2122 // Ignore set nodes, which are not SDNodes.
2123 if (N->getOperator()->getName() == "set")
2126 // Get information about the SDNode for the operator.
2127 const SDNodeInfo &OpInfo = CDP.getSDNodeInfo(N->getOperator());
2129 // Notice properties of the node.
2130 if (OpInfo.hasProperty(SDNPMayStore)) mayStore = true;
2131 if (OpInfo.hasProperty(SDNPMayLoad)) mayLoad = true;
2132 if (OpInfo.hasProperty(SDNPSideEffect)) HasSideEffects = true;
2133 if (OpInfo.hasProperty(SDNPVariadic)) IsVariadic = true;
2135 if (const CodeGenIntrinsic *IntInfo = N->getIntrinsicInfo(CDP)) {
2136 // If this is an intrinsic, analyze it.
2137 if (IntInfo->ModRef >= CodeGenIntrinsic::ReadArgMem)
2138 mayLoad = true;// These may load memory.
2140 if (IntInfo->ModRef >= CodeGenIntrinsic::WriteArgMem)
2141 mayStore = true;// Intrinsics that can write to memory are 'mayStore'.
2143 if (IntInfo->ModRef >= CodeGenIntrinsic::WriteMem)
2144 // WriteMem intrinsics can have other strange effects.
2145 HasSideEffects = true;
2151 static void InferFromPattern(const CodeGenInstruction &Inst,
2152 bool &MayStore, bool &MayLoad,
2153 bool &HasSideEffects, bool &IsVariadic,
2154 const CodeGenDAGPatterns &CDP) {
2155 MayStore = MayLoad = HasSideEffects = IsVariadic = false;
2158 InstAnalyzer(CDP, MayStore, MayLoad, HasSideEffects, IsVariadic)
2159 .Analyze(Inst.TheDef);
2161 // InstAnalyzer only correctly analyzes mayStore/mayLoad so far.
2162 if (Inst.mayStore) { // If the .td file explicitly sets mayStore, use it.
2163 // If we decided that this is a store from the pattern, then the .td file
2164 // entry is redundant.
2167 "Warning: mayStore flag explicitly set on instruction '%s'"
2168 " but flag already inferred from pattern.\n",
2169 Inst.TheDef->getName().c_str());
2173 if (Inst.mayLoad) { // If the .td file explicitly sets mayLoad, use it.
2174 // If we decided that this is a load from the pattern, then the .td file
2175 // entry is redundant.
2178 "Warning: mayLoad flag explicitly set on instruction '%s'"
2179 " but flag already inferred from pattern.\n",
2180 Inst.TheDef->getName().c_str());
2184 if (Inst.neverHasSideEffects) {
2186 fprintf(stderr, "Warning: neverHasSideEffects set on instruction '%s' "
2187 "which already has a pattern\n", Inst.TheDef->getName().c_str());
2188 HasSideEffects = false;
2191 if (Inst.hasSideEffects) {
2193 fprintf(stderr, "Warning: hasSideEffects set on instruction '%s' "
2194 "which already inferred this.\n", Inst.TheDef->getName().c_str());
2195 HasSideEffects = true;
2198 if (Inst.isVariadic)
2199 IsVariadic = true; // Can warn if we want.
2202 /// ParseInstructions - Parse all of the instructions, inlining and resolving
2203 /// any fragments involved. This populates the Instructions list with fully
2204 /// resolved instructions.
2205 void CodeGenDAGPatterns::ParseInstructions() {
2206 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
2208 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
2211 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
2212 LI = Instrs[i]->getValueAsListInit("Pattern");
2214 // If there is no pattern, only collect minimal information about the
2215 // instruction for its operand list. We have to assume that there is one
2216 // result, as we have no detailed info.
2217 if (!LI || LI->getSize() == 0) {
2218 std::vector<Record*> Results;
2219 std::vector<Record*> Operands;
2221 CodeGenInstruction &InstInfo = Target.getInstruction(Instrs[i]);
2223 if (InstInfo.OperandList.size() != 0) {
2224 if (InstInfo.NumDefs == 0) {
2225 // These produce no results
2226 for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
2227 Operands.push_back(InstInfo.OperandList[j].Rec);
2229 // Assume the first operand is the result.
2230 Results.push_back(InstInfo.OperandList[0].Rec);
2232 // The rest are inputs.
2233 for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
2234 Operands.push_back(InstInfo.OperandList[j].Rec);
2238 // Create and insert the instruction.
2239 std::vector<Record*> ImpResults;
2240 std::vector<Record*> ImpOperands;
2241 Instructions.insert(std::make_pair(Instrs[i],
2242 DAGInstruction(0, Results, Operands, ImpResults,
2244 continue; // no pattern.
2247 // Parse the instruction.
2248 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
2249 // Inline pattern fragments into it.
2250 I->InlinePatternFragments();
2252 // Infer as many types as possible. If we cannot infer all of them, we can
2253 // never do anything with this instruction pattern: report it to the user.
2254 if (!I->InferAllTypes())
2255 I->error("Could not infer all types in pattern!");
2257 // InstInputs - Keep track of all of the inputs of the instruction, along
2258 // with the record they are declared as.
2259 std::map<std::string, TreePatternNode*> InstInputs;
2261 // InstResults - Keep track of all the virtual registers that are 'set'
2262 // in the instruction, including what reg class they are.
2263 std::map<std::string, TreePatternNode*> InstResults;
2265 std::vector<Record*> InstImpInputs;
2266 std::vector<Record*> InstImpResults;
2268 // Verify that the top-level forms in the instruction are of void type, and
2269 // fill in the InstResults map.
2270 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
2271 TreePatternNode *Pat = I->getTree(j);
2272 if (Pat->getNumTypes() != 0)
2273 I->error("Top-level forms in instruction pattern should have"
2276 // Find inputs and outputs, and verify the structure of the uses/defs.
2277 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
2278 InstImpInputs, InstImpResults);
2281 // Now that we have inputs and outputs of the pattern, inspect the operands
2282 // list for the instruction. This determines the order that operands are
2283 // added to the machine instruction the node corresponds to.
2284 unsigned NumResults = InstResults.size();
2286 // Parse the operands list from the (ops) list, validating it.
2287 assert(I->getArgList().empty() && "Args list should still be empty here!");
2288 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]);
2290 // Check that all of the results occur first in the list.
2291 std::vector<Record*> Results;
2292 TreePatternNode *Res0Node = 0;
2293 for (unsigned i = 0; i != NumResults; ++i) {
2294 if (i == CGI.OperandList.size())
2295 I->error("'" + InstResults.begin()->first +
2296 "' set but does not appear in operand list!");
2297 const std::string &OpName = CGI.OperandList[i].Name;
2299 // Check that it exists in InstResults.
2300 TreePatternNode *RNode = InstResults[OpName];
2302 I->error("Operand $" + OpName + " does not exist in operand list!");
2306 Record *R = dynamic_cast<DefInit*>(RNode->getLeafValue())->getDef();
2308 I->error("Operand $" + OpName + " should be a set destination: all "
2309 "outputs must occur before inputs in operand list!");
2311 if (CGI.OperandList[i].Rec != R)
2312 I->error("Operand $" + OpName + " class mismatch!");
2314 // Remember the return type.
2315 Results.push_back(CGI.OperandList[i].Rec);
2317 // Okay, this one checks out.
2318 InstResults.erase(OpName);
2321 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
2322 // the copy while we're checking the inputs.
2323 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
2325 std::vector<TreePatternNode*> ResultNodeOperands;
2326 std::vector<Record*> Operands;
2327 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
2328 CodeGenInstruction::OperandInfo &Op = CGI.OperandList[i];
2329 const std::string &OpName = Op.Name;
2331 I->error("Operand #" + utostr(i) + " in operands list has no name!");
2333 if (!InstInputsCheck.count(OpName)) {
2334 // If this is an predicate operand or optional def operand with an
2335 // DefaultOps set filled in, we can ignore this. When we codegen it,
2336 // we will do so as always executed.
2337 if (Op.Rec->isSubClassOf("PredicateOperand") ||
2338 Op.Rec->isSubClassOf("OptionalDefOperand")) {
2339 // Does it have a non-empty DefaultOps field? If so, ignore this
2341 if (!getDefaultOperand(Op.Rec).DefaultOps.empty())
2344 I->error("Operand $" + OpName +
2345 " does not appear in the instruction pattern");
2347 TreePatternNode *InVal = InstInputsCheck[OpName];
2348 InstInputsCheck.erase(OpName); // It occurred, remove from map.
2350 if (InVal->isLeaf() &&
2351 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
2352 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
2353 if (Op.Rec != InRec && !InRec->isSubClassOf("ComplexPattern"))
2354 I->error("Operand $" + OpName + "'s register class disagrees"
2355 " between the operand and pattern");
2357 Operands.push_back(Op.Rec);
2359 // Construct the result for the dest-pattern operand list.
2360 TreePatternNode *OpNode = InVal->clone();
2362 // No predicate is useful on the result.
2363 OpNode->clearPredicateFns();
2365 // Promote the xform function to be an explicit node if set.
2366 if (Record *Xform = OpNode->getTransformFn()) {
2367 OpNode->setTransformFn(0);
2368 std::vector<TreePatternNode*> Children;
2369 Children.push_back(OpNode);
2370 OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes());
2373 ResultNodeOperands.push_back(OpNode);
2376 if (!InstInputsCheck.empty())
2377 I->error("Input operand $" + InstInputsCheck.begin()->first +
2378 " occurs in pattern but not in operands list!");
2380 TreePatternNode *ResultPattern =
2381 new TreePatternNode(I->getRecord(), ResultNodeOperands,
2382 GetNumNodeResults(I->getRecord(), *this));
2383 // Copy fully inferred output node type to instruction result pattern.
2384 for (unsigned i = 0; i != NumResults; ++i)
2385 ResultPattern->setType(i, Res0Node->getExtType(i));
2387 // Create and insert the instruction.
2388 // FIXME: InstImpResults and InstImpInputs should not be part of
2390 DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
2391 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
2393 // Use a temporary tree pattern to infer all types and make sure that the
2394 // constructed result is correct. This depends on the instruction already
2395 // being inserted into the Instructions map.
2396 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
2397 Temp.InferAllTypes(&I->getNamedNodesMap());
2399 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
2400 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
2405 // If we can, convert the instructions to be patterns that are matched!
2406 for (std::map<Record*, DAGInstruction, RecordPtrCmp>::iterator II =
2407 Instructions.begin(),
2408 E = Instructions.end(); II != E; ++II) {
2409 DAGInstruction &TheInst = II->second;
2410 const TreePattern *I = TheInst.getPattern();
2411 if (I == 0) continue; // No pattern.
2413 // FIXME: Assume only the first tree is the pattern. The others are clobber
2415 TreePatternNode *Pattern = I->getTree(0);
2416 TreePatternNode *SrcPattern;
2417 if (Pattern->getOperator()->getName() == "set") {
2418 SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
2420 // Not a set (store or something?)
2421 SrcPattern = Pattern;
2424 Record *Instr = II->first;
2425 AddPatternToMatch(I,
2426 PatternToMatch(Instr->getValueAsListInit("Predicates"),
2428 TheInst.getResultPattern(),
2429 TheInst.getImpResults(),
2430 Instr->getValueAsInt("AddedComplexity"),
2436 typedef std::pair<const TreePatternNode*, unsigned> NameRecord;
2438 static void FindNames(const TreePatternNode *P,
2439 std::map<std::string, NameRecord> &Names,
2440 const TreePattern *PatternTop) {
2441 if (!P->getName().empty()) {
2442 NameRecord &Rec = Names[P->getName()];
2443 // If this is the first instance of the name, remember the node.
2444 if (Rec.second++ == 0)
2446 else if (Rec.first->getExtTypes() != P->getExtTypes())
2447 PatternTop->error("repetition of value: $" + P->getName() +
2448 " where different uses have different types!");
2452 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
2453 FindNames(P->getChild(i), Names, PatternTop);
2457 void CodeGenDAGPatterns::AddPatternToMatch(const TreePattern *Pattern,
2458 const PatternToMatch &PTM) {
2459 // Do some sanity checking on the pattern we're about to match.
2461 if (!PTM.getSrcPattern()->canPatternMatch(Reason, *this))
2462 Pattern->error("Pattern can never match: " + Reason);
2464 // If the source pattern's root is a complex pattern, that complex pattern
2465 // must specify the nodes it can potentially match.
2466 if (const ComplexPattern *CP =
2467 PTM.getSrcPattern()->getComplexPatternInfo(*this))
2468 if (CP->getRootNodes().empty())
2469 Pattern->error("ComplexPattern at root must specify list of opcodes it"
2473 // Find all of the named values in the input and output, ensure they have the
2475 std::map<std::string, NameRecord> SrcNames, DstNames;
2476 FindNames(PTM.getSrcPattern(), SrcNames, Pattern);
2477 FindNames(PTM.getDstPattern(), DstNames, Pattern);
2479 // Scan all of the named values in the destination pattern, rejecting them if
2480 // they don't exist in the input pattern.
2481 for (std::map<std::string, NameRecord>::iterator
2482 I = DstNames.begin(), E = DstNames.end(); I != E; ++I) {
2483 if (SrcNames[I->first].first == 0)
2484 Pattern->error("Pattern has input without matching name in output: $" +
2488 // Scan all of the named values in the source pattern, rejecting them if the
2489 // name isn't used in the dest, and isn't used to tie two values together.
2490 for (std::map<std::string, NameRecord>::iterator
2491 I = SrcNames.begin(), E = SrcNames.end(); I != E; ++I)
2492 if (DstNames[I->first].first == 0 && SrcNames[I->first].second == 1)
2493 Pattern->error("Pattern has dead named input: $" + I->first);
2495 PatternsToMatch.push_back(PTM);
2500 void CodeGenDAGPatterns::InferInstructionFlags() {
2501 const std::vector<const CodeGenInstruction*> &Instructions =
2502 Target.getInstructionsByEnumValue();
2503 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
2504 CodeGenInstruction &InstInfo =
2505 const_cast<CodeGenInstruction &>(*Instructions[i]);
2506 // Determine properties of the instruction from its pattern.
2507 bool MayStore, MayLoad, HasSideEffects, IsVariadic;
2508 InferFromPattern(InstInfo, MayStore, MayLoad, HasSideEffects, IsVariadic,
2510 InstInfo.mayStore = MayStore;
2511 InstInfo.mayLoad = MayLoad;
2512 InstInfo.hasSideEffects = HasSideEffects;
2513 InstInfo.isVariadic = IsVariadic;
2517 /// Given a pattern result with an unresolved type, see if we can find one
2518 /// instruction with an unresolved result type. Force this result type to an
2519 /// arbitrary element if it's possible types to converge results.
2520 static bool ForceArbitraryInstResultType(TreePatternNode *N, TreePattern &TP) {
2524 // Analyze children.
2525 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2526 if (ForceArbitraryInstResultType(N->getChild(i), TP))
2529 if (!N->getOperator()->isSubClassOf("Instruction"))
2532 // If this type is already concrete or completely unknown we can't do
2534 for (unsigned i = 0, e = N->getNumTypes(); i != e; ++i) {
2535 if (N->getExtType(i).isCompletelyUnknown() || N->getExtType(i).isConcrete())
2538 // Otherwise, force its type to the first possibility (an arbitrary choice).
2539 if (N->getExtType(i).MergeInTypeInfo(N->getExtType(i).getTypeList()[0], TP))
2546 void CodeGenDAGPatterns::ParsePatterns() {
2547 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
2549 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
2550 Record *CurPattern = Patterns[i];
2551 DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch");
2552 DefInit *OpDef = dynamic_cast<DefInit*>(Tree->getOperator());
2553 Record *Operator = OpDef->getDef();
2554 TreePattern *Pattern;
2555 if (Operator->getName() != "parallel")
2556 Pattern = new TreePattern(CurPattern, Tree, true, *this);
2558 std::vector<Init*> Values;
2560 for (unsigned j = 0, ee = Tree->getNumArgs(); j != ee; ++j) {
2561 Values.push_back(Tree->getArg(j));
2562 TypedInit *TArg = dynamic_cast<TypedInit*>(Tree->getArg(j));
2564 errs() << "In dag: " << Tree->getAsString();
2565 errs() << " -- Untyped argument in pattern\n";
2566 assert(0 && "Untyped argument in pattern");
2569 ListTy = resolveTypes(ListTy, TArg->getType());
2571 errs() << "In dag: " << Tree->getAsString();
2572 errs() << " -- Incompatible types in pattern arguments\n";
2573 assert(0 && "Incompatible types in pattern arguments");
2577 ListTy = TArg->getType();
2580 ListInit *LI = new ListInit(Values, new ListRecTy(ListTy));
2581 Pattern = new TreePattern(CurPattern, LI, true, *this);
2584 // Inline pattern fragments into it.
2585 Pattern->InlinePatternFragments();
2587 ListInit *LI = CurPattern->getValueAsListInit("ResultInstrs");
2588 if (LI->getSize() == 0) continue; // no pattern.
2590 // Parse the instruction.
2591 TreePattern *Result = new TreePattern(CurPattern, LI, false, *this);
2593 // Inline pattern fragments into it.
2594 Result->InlinePatternFragments();
2596 if (Result->getNumTrees() != 1)
2597 Result->error("Cannot handle instructions producing instructions "
2598 "with temporaries yet!");
2600 bool IterateInference;
2601 bool InferredAllPatternTypes, InferredAllResultTypes;
2603 // Infer as many types as possible. If we cannot infer all of them, we
2604 // can never do anything with this pattern: report it to the user.
2605 InferredAllPatternTypes =
2606 Pattern->InferAllTypes(&Pattern->getNamedNodesMap());
2608 // Infer as many types as possible. If we cannot infer all of them, we
2609 // can never do anything with this pattern: report it to the user.
2610 InferredAllResultTypes =
2611 Result->InferAllTypes(&Pattern->getNamedNodesMap());
2613 IterateInference = false;
2615 // Apply the type of the result to the source pattern. This helps us
2616 // resolve cases where the input type is known to be a pointer type (which
2617 // is considered resolved), but the result knows it needs to be 32- or
2618 // 64-bits. Infer the other way for good measure.
2619 for (unsigned i = 0, e = std::min(Result->getTree(0)->getNumTypes(),
2620 Pattern->getTree(0)->getNumTypes());
2622 IterateInference = Pattern->getTree(0)->
2623 UpdateNodeType(i, Result->getTree(0)->getExtType(i), *Result);
2624 IterateInference |= Result->getTree(0)->
2625 UpdateNodeType(i, Pattern->getTree(0)->getExtType(i), *Result);
2628 // If our iteration has converged and the input pattern's types are fully
2629 // resolved but the result pattern is not fully resolved, we may have a
2630 // situation where we have two instructions in the result pattern and
2631 // the instructions require a common register class, but don't care about
2632 // what actual MVT is used. This is actually a bug in our modelling:
2633 // output patterns should have register classes, not MVTs.
2635 // In any case, to handle this, we just go through and disambiguate some
2636 // arbitrary types to the result pattern's nodes.
2637 if (!IterateInference && InferredAllPatternTypes &&
2638 !InferredAllResultTypes)
2639 IterateInference = ForceArbitraryInstResultType(Result->getTree(0),
2641 } while (IterateInference);
2643 // Verify that we inferred enough types that we can do something with the
2644 // pattern and result. If these fire the user has to add type casts.
2645 if (!InferredAllPatternTypes)
2646 Pattern->error("Could not infer all types in pattern!");
2647 if (!InferredAllResultTypes) {
2649 Result->error("Could not infer all types in pattern result!");
2652 // Validate that the input pattern is correct.
2653 std::map<std::string, TreePatternNode*> InstInputs;
2654 std::map<std::string, TreePatternNode*> InstResults;
2655 std::vector<Record*> InstImpInputs;
2656 std::vector<Record*> InstImpResults;
2657 for (unsigned j = 0, ee = Pattern->getNumTrees(); j != ee; ++j)
2658 FindPatternInputsAndOutputs(Pattern, Pattern->getTree(j),
2659 InstInputs, InstResults,
2660 InstImpInputs, InstImpResults);
2662 // Promote the xform function to be an explicit node if set.
2663 TreePatternNode *DstPattern = Result->getOnlyTree();
2664 std::vector<TreePatternNode*> ResultNodeOperands;
2665 for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
2666 TreePatternNode *OpNode = DstPattern->getChild(ii);
2667 if (Record *Xform = OpNode->getTransformFn()) {
2668 OpNode->setTransformFn(0);
2669 std::vector<TreePatternNode*> Children;
2670 Children.push_back(OpNode);
2671 OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes());
2673 ResultNodeOperands.push_back(OpNode);
2675 DstPattern = Result->getOnlyTree();
2676 if (!DstPattern->isLeaf())
2677 DstPattern = new TreePatternNode(DstPattern->getOperator(),
2679 DstPattern->getNumTypes());
2681 for (unsigned i = 0, e = Result->getOnlyTree()->getNumTypes(); i != e; ++i)
2682 DstPattern->setType(i, Result->getOnlyTree()->getExtType(i));
2684 TreePattern Temp(Result->getRecord(), DstPattern, false, *this);
2685 Temp.InferAllTypes();
2688 AddPatternToMatch(Pattern,
2689 PatternToMatch(CurPattern->getValueAsListInit("Predicates"),
2690 Pattern->getTree(0),
2691 Temp.getOnlyTree(), InstImpResults,
2692 CurPattern->getValueAsInt("AddedComplexity"),
2693 CurPattern->getID()));
2697 /// CombineChildVariants - Given a bunch of permutations of each child of the
2698 /// 'operator' node, put them together in all possible ways.
2699 static void CombineChildVariants(TreePatternNode *Orig,
2700 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
2701 std::vector<TreePatternNode*> &OutVariants,
2702 CodeGenDAGPatterns &CDP,
2703 const MultipleUseVarSet &DepVars) {
2704 // Make sure that each operand has at least one variant to choose from.
2705 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
2706 if (ChildVariants[i].empty())
2709 // The end result is an all-pairs construction of the resultant pattern.
2710 std::vector<unsigned> Idxs;
2711 Idxs.resize(ChildVariants.size());
2715 DEBUG(if (!Idxs.empty()) {
2716 errs() << Orig->getOperator()->getName() << ": Idxs = [ ";
2717 for (unsigned i = 0; i < Idxs.size(); ++i) {
2718 errs() << Idxs[i] << " ";
2723 // Create the variant and add it to the output list.
2724 std::vector<TreePatternNode*> NewChildren;
2725 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
2726 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
2727 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren,
2728 Orig->getNumTypes());
2730 // Copy over properties.
2731 R->setName(Orig->getName());
2732 R->setPredicateFns(Orig->getPredicateFns());
2733 R->setTransformFn(Orig->getTransformFn());
2734 for (unsigned i = 0, e = Orig->getNumTypes(); i != e; ++i)
2735 R->setType(i, Orig->getExtType(i));
2737 // If this pattern cannot match, do not include it as a variant.
2738 std::string ErrString;
2739 if (!R->canPatternMatch(ErrString, CDP)) {
2742 bool AlreadyExists = false;
2744 // Scan to see if this pattern has already been emitted. We can get
2745 // duplication due to things like commuting:
2746 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
2747 // which are the same pattern. Ignore the dups.
2748 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
2749 if (R->isIsomorphicTo(OutVariants[i], DepVars)) {
2750 AlreadyExists = true;
2757 OutVariants.push_back(R);
2760 // Increment indices to the next permutation by incrementing the
2761 // indicies from last index backward, e.g., generate the sequence
2762 // [0, 0], [0, 1], [1, 0], [1, 1].
2764 for (IdxsIdx = Idxs.size() - 1; IdxsIdx >= 0; --IdxsIdx) {
2765 if (++Idxs[IdxsIdx] == ChildVariants[IdxsIdx].size())
2770 NotDone = (IdxsIdx >= 0);
2774 /// CombineChildVariants - A helper function for binary operators.
2776 static void CombineChildVariants(TreePatternNode *Orig,
2777 const std::vector<TreePatternNode*> &LHS,
2778 const std::vector<TreePatternNode*> &RHS,
2779 std::vector<TreePatternNode*> &OutVariants,
2780 CodeGenDAGPatterns &CDP,
2781 const MultipleUseVarSet &DepVars) {
2782 std::vector<std::vector<TreePatternNode*> > ChildVariants;
2783 ChildVariants.push_back(LHS);
2784 ChildVariants.push_back(RHS);
2785 CombineChildVariants(Orig, ChildVariants, OutVariants, CDP, DepVars);
2789 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
2790 std::vector<TreePatternNode *> &Children) {
2791 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
2792 Record *Operator = N->getOperator();
2794 // Only permit raw nodes.
2795 if (!N->getName().empty() || !N->getPredicateFns().empty() ||
2796 N->getTransformFn()) {
2797 Children.push_back(N);
2801 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
2802 Children.push_back(N->getChild(0));
2804 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
2806 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
2807 Children.push_back(N->getChild(1));
2809 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
2812 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
2813 /// the (potentially recursive) pattern by using algebraic laws.
2815 static void GenerateVariantsOf(TreePatternNode *N,
2816 std::vector<TreePatternNode*> &OutVariants,
2817 CodeGenDAGPatterns &CDP,
2818 const MultipleUseVarSet &DepVars) {
2819 // We cannot permute leaves.
2821 OutVariants.push_back(N);
2825 // Look up interesting info about the node.
2826 const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(N->getOperator());
2828 // If this node is associative, re-associate.
2829 if (NodeInfo.hasProperty(SDNPAssociative)) {
2830 // Re-associate by pulling together all of the linked operators
2831 std::vector<TreePatternNode*> MaximalChildren;
2832 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
2834 // Only handle child sizes of 3. Otherwise we'll end up trying too many
2836 if (MaximalChildren.size() == 3) {
2837 // Find the variants of all of our maximal children.
2838 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
2839 GenerateVariantsOf(MaximalChildren[0], AVariants, CDP, DepVars);
2840 GenerateVariantsOf(MaximalChildren[1], BVariants, CDP, DepVars);
2841 GenerateVariantsOf(MaximalChildren[2], CVariants, CDP, DepVars);
2843 // There are only two ways we can permute the tree:
2844 // (A op B) op C and A op (B op C)
2845 // Within these forms, we can also permute A/B/C.
2847 // Generate legal pair permutations of A/B/C.
2848 std::vector<TreePatternNode*> ABVariants;
2849 std::vector<TreePatternNode*> BAVariants;
2850 std::vector<TreePatternNode*> ACVariants;
2851 std::vector<TreePatternNode*> CAVariants;
2852 std::vector<TreePatternNode*> BCVariants;
2853 std::vector<TreePatternNode*> CBVariants;
2854 CombineChildVariants(N, AVariants, BVariants, ABVariants, CDP, DepVars);
2855 CombineChildVariants(N, BVariants, AVariants, BAVariants, CDP, DepVars);
2856 CombineChildVariants(N, AVariants, CVariants, ACVariants, CDP, DepVars);
2857 CombineChildVariants(N, CVariants, AVariants, CAVariants, CDP, DepVars);
2858 CombineChildVariants(N, BVariants, CVariants, BCVariants, CDP, DepVars);
2859 CombineChildVariants(N, CVariants, BVariants, CBVariants, CDP, DepVars);
2861 // Combine those into the result: (x op x) op x
2862 CombineChildVariants(N, ABVariants, CVariants, OutVariants, CDP, DepVars);
2863 CombineChildVariants(N, BAVariants, CVariants, OutVariants, CDP, DepVars);
2864 CombineChildVariants(N, ACVariants, BVariants, OutVariants, CDP, DepVars);
2865 CombineChildVariants(N, CAVariants, BVariants, OutVariants, CDP, DepVars);
2866 CombineChildVariants(N, BCVariants, AVariants, OutVariants, CDP, DepVars);
2867 CombineChildVariants(N, CBVariants, AVariants, OutVariants, CDP, DepVars);
2869 // Combine those into the result: x op (x op x)
2870 CombineChildVariants(N, CVariants, ABVariants, OutVariants, CDP, DepVars);
2871 CombineChildVariants(N, CVariants, BAVariants, OutVariants, CDP, DepVars);
2872 CombineChildVariants(N, BVariants, ACVariants, OutVariants, CDP, DepVars);
2873 CombineChildVariants(N, BVariants, CAVariants, OutVariants, CDP, DepVars);
2874 CombineChildVariants(N, AVariants, BCVariants, OutVariants, CDP, DepVars);
2875 CombineChildVariants(N, AVariants, CBVariants, OutVariants, CDP, DepVars);
2880 // Compute permutations of all children.
2881 std::vector<std::vector<TreePatternNode*> > ChildVariants;
2882 ChildVariants.resize(N->getNumChildren());
2883 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2884 GenerateVariantsOf(N->getChild(i), ChildVariants[i], CDP, DepVars);
2886 // Build all permutations based on how the children were formed.
2887 CombineChildVariants(N, ChildVariants, OutVariants, CDP, DepVars);
2889 // If this node is commutative, consider the commuted order.
2890 bool isCommIntrinsic = N->isCommutativeIntrinsic(CDP);
2891 if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
2892 assert((N->getNumChildren()==2 || isCommIntrinsic) &&
2893 "Commutative but doesn't have 2 children!");
2894 // Don't count children which are actually register references.
2896 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2897 TreePatternNode *Child = N->getChild(i);
2898 if (Child->isLeaf())
2899 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2900 Record *RR = DI->getDef();
2901 if (RR->isSubClassOf("Register"))
2906 // Consider the commuted order.
2907 if (isCommIntrinsic) {
2908 // Commutative intrinsic. First operand is the intrinsic id, 2nd and 3rd
2909 // operands are the commutative operands, and there might be more operands
2912 "Commutative intrinsic should have at least 3 childrean!");
2913 std::vector<std::vector<TreePatternNode*> > Variants;
2914 Variants.push_back(ChildVariants[0]); // Intrinsic id.
2915 Variants.push_back(ChildVariants[2]);
2916 Variants.push_back(ChildVariants[1]);
2917 for (unsigned i = 3; i != NC; ++i)
2918 Variants.push_back(ChildVariants[i]);
2919 CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
2921 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
2922 OutVariants, CDP, DepVars);
2927 // GenerateVariants - Generate variants. For example, commutative patterns can
2928 // match multiple ways. Add them to PatternsToMatch as well.
2929 void CodeGenDAGPatterns::GenerateVariants() {
2930 DEBUG(errs() << "Generating instruction variants.\n");
2932 // Loop over all of the patterns we've collected, checking to see if we can
2933 // generate variants of the instruction, through the exploitation of
2934 // identities. This permits the target to provide aggressive matching without
2935 // the .td file having to contain tons of variants of instructions.
2937 // Note that this loop adds new patterns to the PatternsToMatch list, but we
2938 // intentionally do not reconsider these. Any variants of added patterns have
2939 // already been added.
2941 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2942 MultipleUseVarSet DepVars;
2943 std::vector<TreePatternNode*> Variants;
2944 FindDepVars(PatternsToMatch[i].getSrcPattern(), DepVars);
2945 DEBUG(errs() << "Dependent/multiply used variables: ");
2946 DEBUG(DumpDepVars(DepVars));
2947 DEBUG(errs() << "\n");
2948 GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this, DepVars);
2950 assert(!Variants.empty() && "Must create at least original variant!");
2951 Variants.erase(Variants.begin()); // Remove the original pattern.
2953 if (Variants.empty()) // No variants for this pattern.
2956 DEBUG(errs() << "FOUND VARIANTS OF: ";
2957 PatternsToMatch[i].getSrcPattern()->dump();
2960 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
2961 TreePatternNode *Variant = Variants[v];
2963 DEBUG(errs() << " VAR#" << v << ": ";
2967 // Scan to see if an instruction or explicit pattern already matches this.
2968 bool AlreadyExists = false;
2969 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
2970 // Skip if the top level predicates do not match.
2971 if (PatternsToMatch[i].getPredicates() !=
2972 PatternsToMatch[p].getPredicates())
2974 // Check to see if this variant already exists.
2975 if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern(), DepVars)) {
2976 DEBUG(errs() << " *** ALREADY EXISTS, ignoring variant.\n");
2977 AlreadyExists = true;
2981 // If we already have it, ignore the variant.
2982 if (AlreadyExists) continue;
2984 // Otherwise, add it to the list of patterns we have.
2986 push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
2987 Variant, PatternsToMatch[i].getDstPattern(),
2988 PatternsToMatch[i].getDstRegs(),
2989 PatternsToMatch[i].getAddedComplexity(),
2990 Record::getNewUID()));
2993 DEBUG(errs() << "\n");