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 return 0; // All return nothing.
754 if (Operator->isSubClassOf("Intrinsic"))
755 return CDP.getIntrinsic(Operator).IS.RetVTs.size();
757 if (Operator->isSubClassOf("SDNode"))
758 return CDP.getSDNodeInfo(Operator).getNumResults();
760 if (Operator->isSubClassOf("PatFrag")) {
761 // If we've already parsed this pattern fragment, get it. Otherwise, handle
762 // the forward reference case where one pattern fragment references another
763 // before it is processed.
764 if (TreePattern *PFRec = CDP.getPatternFragmentIfRead(Operator))
765 return PFRec->getOnlyTree()->getNumTypes();
767 // Get the result tree.
768 DagInit *Tree = Operator->getValueAsDag("Fragment");
770 if (Tree && dynamic_cast<DefInit*>(Tree->getOperator()))
771 Op = dynamic_cast<DefInit*>(Tree->getOperator())->getDef();
772 assert(Op && "Invalid Fragment");
773 return GetNumNodeResults(Op, CDP);
776 if (Operator->isSubClassOf("Instruction")) {
777 CodeGenInstruction &InstInfo = CDP.getTargetInfo().getInstruction(Operator);
779 // FIXME: Handle implicit defs right.
780 if (InstInfo.NumDefs != 0)
781 return 1; // FIXME: Handle inst results right!
783 if (!InstInfo.ImplicitDefs.empty()) {
784 // Add on one implicit def if it has a resolvable type.
785 Record *FirstImplicitDef = InstInfo.ImplicitDefs[0];
786 assert(FirstImplicitDef->isSubClassOf("Register"));
787 const std::vector<MVT::SimpleValueType> &RegVTs =
788 CDP.getTargetInfo().getRegisterVTs(FirstImplicitDef);
789 if (RegVTs.size() == 1)
795 if (Operator->isSubClassOf("SDNodeXForm"))
796 return 1; // FIXME: Generalize SDNodeXForm
799 errs() << "Unhandled node in GetNumNodeResults\n";
803 void TreePatternNode::print(raw_ostream &OS) const {
805 OS << *getLeafValue();
807 OS << '(' << getOperator()->getName();
809 for (unsigned i = 0, e = Types.size(); i != e; ++i)
810 OS << ':' << getExtType(i).getName();
813 if (getNumChildren() != 0) {
815 getChild(0)->print(OS);
816 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {
818 getChild(i)->print(OS);
824 for (unsigned i = 0, e = PredicateFns.size(); i != e; ++i)
825 OS << "<<P:" << PredicateFns[i] << ">>";
827 OS << "<<X:" << TransformFn->getName() << ">>";
828 if (!getName().empty())
829 OS << ":$" << getName();
832 void TreePatternNode::dump() const {
836 /// isIsomorphicTo - Return true if this node is recursively
837 /// isomorphic to the specified node. For this comparison, the node's
838 /// entire state is considered. The assigned name is ignored, since
839 /// nodes with differing names are considered isomorphic. However, if
840 /// the assigned name is present in the dependent variable set, then
841 /// the assigned name is considered significant and the node is
842 /// isomorphic if the names match.
843 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N,
844 const MultipleUseVarSet &DepVars) const {
845 if (N == this) return true;
846 if (N->isLeaf() != isLeaf() || getExtTypes() != N->getExtTypes() ||
847 getPredicateFns() != N->getPredicateFns() ||
848 getTransformFn() != N->getTransformFn())
852 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
853 if (DefInit *NDI = dynamic_cast<DefInit*>(N->getLeafValue())) {
854 return ((DI->getDef() == NDI->getDef())
855 && (DepVars.find(getName()) == DepVars.end()
856 || getName() == N->getName()));
859 return getLeafValue() == N->getLeafValue();
862 if (N->getOperator() != getOperator() ||
863 N->getNumChildren() != getNumChildren()) return false;
864 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
865 if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars))
870 /// clone - Make a copy of this tree and all of its children.
872 TreePatternNode *TreePatternNode::clone() const {
873 TreePatternNode *New;
875 New = new TreePatternNode(getLeafValue(), getNumTypes());
877 std::vector<TreePatternNode*> CChildren;
878 CChildren.reserve(Children.size());
879 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
880 CChildren.push_back(getChild(i)->clone());
881 New = new TreePatternNode(getOperator(), CChildren, getNumTypes());
883 New->setName(getName());
885 New->setPredicateFns(getPredicateFns());
886 New->setTransformFn(getTransformFn());
890 /// RemoveAllTypes - Recursively strip all the types of this tree.
891 void TreePatternNode::RemoveAllTypes() {
892 for (unsigned i = 0, e = Types.size(); i != e; ++i)
893 Types[i] = EEVT::TypeSet(); // Reset to unknown type.
894 if (isLeaf()) return;
895 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
896 getChild(i)->RemoveAllTypes();
900 /// SubstituteFormalArguments - Replace the formal arguments in this tree
901 /// with actual values specified by ArgMap.
902 void TreePatternNode::
903 SubstituteFormalArguments(std::map<std::string, TreePatternNode*> &ArgMap) {
904 if (isLeaf()) return;
906 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
907 TreePatternNode *Child = getChild(i);
908 if (Child->isLeaf()) {
909 Init *Val = Child->getLeafValue();
910 if (dynamic_cast<DefInit*>(Val) &&
911 static_cast<DefInit*>(Val)->getDef()->getName() == "node") {
912 // We found a use of a formal argument, replace it with its value.
913 TreePatternNode *NewChild = ArgMap[Child->getName()];
914 assert(NewChild && "Couldn't find formal argument!");
915 assert((Child->getPredicateFns().empty() ||
916 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
917 "Non-empty child predicate clobbered!");
918 setChild(i, NewChild);
921 getChild(i)->SubstituteFormalArguments(ArgMap);
927 /// InlinePatternFragments - If this pattern refers to any pattern
928 /// fragments, inline them into place, giving us a pattern without any
929 /// PatFrag references.
930 TreePatternNode *TreePatternNode::InlinePatternFragments(TreePattern &TP) {
931 if (isLeaf()) return this; // nothing to do.
932 Record *Op = getOperator();
934 if (!Op->isSubClassOf("PatFrag")) {
935 // Just recursively inline children nodes.
936 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {
937 TreePatternNode *Child = getChild(i);
938 TreePatternNode *NewChild = Child->InlinePatternFragments(TP);
940 assert((Child->getPredicateFns().empty() ||
941 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
942 "Non-empty child predicate clobbered!");
944 setChild(i, NewChild);
949 // Otherwise, we found a reference to a fragment. First, look up its
950 // TreePattern record.
951 TreePattern *Frag = TP.getDAGPatterns().getPatternFragment(Op);
953 // Verify that we are passing the right number of operands.
954 if (Frag->getNumArgs() != Children.size())
955 TP.error("'" + Op->getName() + "' fragment requires " +
956 utostr(Frag->getNumArgs()) + " operands!");
958 TreePatternNode *FragTree = Frag->getOnlyTree()->clone();
960 std::string Code = Op->getValueAsCode("Predicate");
962 FragTree->addPredicateFn("Predicate_"+Op->getName());
964 // Resolve formal arguments to their actual value.
965 if (Frag->getNumArgs()) {
966 // Compute the map of formal to actual arguments.
967 std::map<std::string, TreePatternNode*> ArgMap;
968 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)
969 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
971 FragTree->SubstituteFormalArguments(ArgMap);
974 FragTree->setName(getName());
975 for (unsigned i = 0, e = Types.size(); i != e; ++i)
976 FragTree->UpdateNodeType(i, getExtType(i), TP);
978 // Transfer in the old predicates.
979 for (unsigned i = 0, e = getPredicateFns().size(); i != e; ++i)
980 FragTree->addPredicateFn(getPredicateFns()[i]);
982 // Get a new copy of this fragment to stitch into here.
983 //delete this; // FIXME: implement refcounting!
985 // The fragment we inlined could have recursive inlining that is needed. See
986 // if there are any pattern fragments in it and inline them as needed.
987 return FragTree->InlinePatternFragments(TP);
990 /// getImplicitType - Check to see if the specified record has an implicit
991 /// type which should be applied to it. This will infer the type of register
992 /// references from the register file information, for example.
994 static EEVT::TypeSet getImplicitType(Record *R, unsigned ResNo,
995 bool NotRegisters, TreePattern &TP) {
996 // Check to see if this is a register or a register class.
997 if (R->isSubClassOf("RegisterClass")) {
998 assert(ResNo == 0 && "Regclass ref only has one result!");
1000 return EEVT::TypeSet(); // Unknown.
1001 const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
1002 return EEVT::TypeSet(T.getRegisterClass(R).getValueTypes());
1005 if (R->isSubClassOf("PatFrag")) {
1006 assert(ResNo == 0 && "FIXME: PatFrag with multiple results?");
1007 // Pattern fragment types will be resolved when they are inlined.
1008 return EEVT::TypeSet(); // Unknown.
1011 if (R->isSubClassOf("Register")) {
1012 assert(ResNo == 0 && "Registers only produce one result!");
1014 return EEVT::TypeSet(); // Unknown.
1015 const CodeGenTarget &T = TP.getDAGPatterns().getTargetInfo();
1016 return EEVT::TypeSet(T.getRegisterVTs(R));
1019 if (R->isSubClassOf("ValueType") || R->isSubClassOf("CondCode")) {
1020 assert(ResNo == 0 && "This node only has one result!");
1021 // Using a VTSDNode or CondCodeSDNode.
1022 return EEVT::TypeSet(MVT::Other, TP);
1025 if (R->isSubClassOf("ComplexPattern")) {
1026 assert(ResNo == 0 && "FIXME: ComplexPattern with multiple results?");
1028 return EEVT::TypeSet(); // Unknown.
1029 return EEVT::TypeSet(TP.getDAGPatterns().getComplexPattern(R).getValueType(),
1032 if (R->isSubClassOf("PointerLikeRegClass")) {
1033 assert(ResNo == 0 && "Regclass can only have one result!");
1034 return EEVT::TypeSet(MVT::iPTR, TP);
1037 if (R->getName() == "node" || R->getName() == "srcvalue" ||
1038 R->getName() == "zero_reg") {
1040 return EEVT::TypeSet(); // Unknown.
1043 TP.error("Unknown node flavor used in pattern: " + R->getName());
1044 return EEVT::TypeSet(MVT::Other, TP);
1048 /// getIntrinsicInfo - If this node corresponds to an intrinsic, return the
1049 /// CodeGenIntrinsic information for it, otherwise return a null pointer.
1050 const CodeGenIntrinsic *TreePatternNode::
1051 getIntrinsicInfo(const CodeGenDAGPatterns &CDP) const {
1052 if (getOperator() != CDP.get_intrinsic_void_sdnode() &&
1053 getOperator() != CDP.get_intrinsic_w_chain_sdnode() &&
1054 getOperator() != CDP.get_intrinsic_wo_chain_sdnode())
1058 dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
1059 return &CDP.getIntrinsicInfo(IID);
1062 /// getComplexPatternInfo - If this node corresponds to a ComplexPattern,
1063 /// return the ComplexPattern information, otherwise return null.
1064 const ComplexPattern *
1065 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const {
1066 if (!isLeaf()) return 0;
1068 DefInit *DI = dynamic_cast<DefInit*>(getLeafValue());
1069 if (DI && DI->getDef()->isSubClassOf("ComplexPattern"))
1070 return &CGP.getComplexPattern(DI->getDef());
1074 /// NodeHasProperty - Return true if this node has the specified property.
1075 bool TreePatternNode::NodeHasProperty(SDNP Property,
1076 const CodeGenDAGPatterns &CGP) const {
1078 if (const ComplexPattern *CP = getComplexPatternInfo(CGP))
1079 return CP->hasProperty(Property);
1083 Record *Operator = getOperator();
1084 if (!Operator->isSubClassOf("SDNode")) return false;
1086 return CGP.getSDNodeInfo(Operator).hasProperty(Property);
1092 /// TreeHasProperty - Return true if any node in this tree has the specified
1094 bool TreePatternNode::TreeHasProperty(SDNP Property,
1095 const CodeGenDAGPatterns &CGP) const {
1096 if (NodeHasProperty(Property, CGP))
1098 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1099 if (getChild(i)->TreeHasProperty(Property, CGP))
1104 /// isCommutativeIntrinsic - Return true if the node corresponds to a
1105 /// commutative intrinsic.
1107 TreePatternNode::isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const {
1108 if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP))
1109 return Int->isCommutative;
1114 /// ApplyTypeConstraints - Apply all of the type constraints relevant to
1115 /// this node and its children in the tree. This returns true if it makes a
1116 /// change, false otherwise. If a type contradiction is found, throw an
1118 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
1119 CodeGenDAGPatterns &CDP = TP.getDAGPatterns();
1121 if (DefInit *DI = dynamic_cast<DefInit*>(getLeafValue())) {
1122 // If it's a regclass or something else known, include the type.
1123 bool MadeChange = false;
1124 for (unsigned i = 0, e = Types.size(); i != e; ++i)
1125 MadeChange |= UpdateNodeType(i, getImplicitType(DI->getDef(), i,
1126 NotRegisters, TP), TP);
1130 if (IntInit *II = dynamic_cast<IntInit*>(getLeafValue())) {
1131 assert(Types.size() == 1 && "Invalid IntInit");
1133 // Int inits are always integers. :)
1134 bool MadeChange = Types[0].EnforceInteger(TP);
1136 if (!Types[0].isConcrete())
1139 MVT::SimpleValueType VT = getType(0);
1140 if (VT == MVT::iPTR || VT == MVT::iPTRAny)
1143 unsigned Size = EVT(VT).getSizeInBits();
1144 // Make sure that the value is representable for this type.
1145 if (Size >= 32) return MadeChange;
1147 int Val = (II->getValue() << (32-Size)) >> (32-Size);
1148 if (Val == II->getValue()) return MadeChange;
1150 // If sign-extended doesn't fit, does it fit as unsigned?
1152 unsigned UnsignedVal;
1153 ValueMask = unsigned(~uint32_t(0UL) >> (32-Size));
1154 UnsignedVal = unsigned(II->getValue());
1156 if ((ValueMask & UnsignedVal) == UnsignedVal)
1159 TP.error("Integer value '" + itostr(II->getValue())+
1160 "' is out of range for type '" + getEnumName(getType(0)) + "'!");
1166 // special handling for set, which isn't really an SDNode.
1167 if (getOperator()->getName() == "set") {
1168 assert(getNumTypes() == 0 && "Set doesn't produce a value");
1169 assert(getNumChildren() >= 2 && "Missing RHS of a set?");
1170 unsigned NC = getNumChildren();
1172 TreePatternNode *SetVal = getChild(NC-1);
1173 bool MadeChange = SetVal->ApplyTypeConstraints(TP, NotRegisters);
1175 for (unsigned i = 0; i < NC-1; ++i) {
1176 TreePatternNode *Child = getChild(i);
1177 MadeChange |= Child->ApplyTypeConstraints(TP, NotRegisters);
1179 // Types of operands must match.
1180 MadeChange |= Child->UpdateNodeType(0, SetVal->getExtType(i), TP);
1181 MadeChange |= SetVal->UpdateNodeType(i, Child->getExtType(0), TP);
1186 if (getOperator()->getName() == "implicit") {
1187 assert(getNumTypes() == 0 && "Node doesn't produce a value");
1189 bool MadeChange = false;
1190 for (unsigned i = 0; i < getNumChildren(); ++i)
1191 MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1195 if (getOperator()->getName() == "COPY_TO_REGCLASS") {
1196 bool MadeChange = false;
1197 MadeChange |= getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1198 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
1200 assert(getChild(0)->getNumTypes() == 1 &&
1201 getChild(1)->getNumTypes() == 1 && "Unhandled case");
1203 // child #1 of COPY_TO_REGCLASS should be a register class. We don't care
1204 // what type it gets, so if it didn't get a concrete type just give it the
1205 // first viable type from the reg class.
1206 if (!getChild(1)->hasTypeSet(0) &&
1207 !getChild(1)->getExtType(0).isCompletelyUnknown()) {
1208 MVT::SimpleValueType RCVT = getChild(1)->getExtType(0).getTypeList()[0];
1209 MadeChange |= getChild(1)->UpdateNodeType(0, RCVT, TP);
1214 if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CDP)) {
1215 bool MadeChange = false;
1217 // Apply the result type to the node.
1218 unsigned NumRetVTs = Int->IS.RetVTs.size();
1219 unsigned NumParamVTs = Int->IS.ParamVTs.size();
1221 for (unsigned i = 0, e = NumRetVTs; i != e; ++i)
1222 MadeChange |= UpdateNodeType(i, Int->IS.RetVTs[i], TP);
1224 if (getNumChildren() != NumParamVTs + 1)
1225 TP.error("Intrinsic '" + Int->Name + "' expects " +
1226 utostr(NumParamVTs) + " operands, not " +
1227 utostr(getNumChildren() - 1) + " operands!");
1229 // Apply type info to the intrinsic ID.
1230 MadeChange |= getChild(0)->UpdateNodeType(0, MVT::iPTR, TP);
1232 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {
1233 MadeChange |= getChild(i+1)->ApplyTypeConstraints(TP, NotRegisters);
1235 MVT::SimpleValueType OpVT = Int->IS.ParamVTs[i];
1236 assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case");
1237 MadeChange |= getChild(i+1)->UpdateNodeType(0, OpVT, TP);
1242 if (getOperator()->isSubClassOf("SDNode")) {
1243 const SDNodeInfo &NI = CDP.getSDNodeInfo(getOperator());
1245 bool MadeChange = NI.ApplyTypeConstraints(this, TP);
1246 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1247 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1251 if (getOperator()->isSubClassOf("Instruction")) {
1252 const DAGInstruction &Inst = CDP.getInstruction(getOperator());
1254 assert(Inst.getNumResults() <= 1 &&
1255 "FIXME: Only supports zero or one result instrs!");
1257 CodeGenInstruction &InstInfo =
1258 CDP.getTargetInfo().getInstruction(getOperator());
1260 EEVT::TypeSet ResultType;
1262 // Apply the result type to the node
1263 if (InstInfo.NumDefs != 0) { // # of elements in (outs) list
1264 Record *ResultNode = Inst.getResult(0);
1266 if (ResultNode->isSubClassOf("PointerLikeRegClass")) {
1267 ResultType = EEVT::TypeSet(MVT::iPTR, TP);
1268 } else if (ResultNode->getName() == "unknown") {
1271 assert(ResultNode->isSubClassOf("RegisterClass") &&
1272 "Operands should be register classes!");
1273 const CodeGenRegisterClass &RC =
1274 CDP.getTargetInfo().getRegisterClass(ResultNode);
1275 ResultType = RC.getValueTypes();
1277 } else if (!InstInfo.ImplicitDefs.empty()) {
1278 // If the instruction has implicit defs, the first one defines the result
1280 Record *FirstImplicitDef = InstInfo.ImplicitDefs[0];
1281 assert(FirstImplicitDef->isSubClassOf("Register"));
1282 const std::vector<MVT::SimpleValueType> &RegVTs =
1283 CDP.getTargetInfo().getRegisterVTs(FirstImplicitDef);
1284 if (RegVTs.size() == 1) // FIXME: Generalize.
1285 ResultType = EEVT::TypeSet(RegVTs);
1287 // Otherwise, the instruction produces no value result.
1290 bool MadeChange = false;
1292 if (!ResultType.isCompletelyUnknown())
1293 MadeChange |= UpdateNodeType(ResNo, ResultType, TP);
1295 // If this is an INSERT_SUBREG, constrain the source and destination VTs to
1297 if (getOperator()->getName() == "INSERT_SUBREG") {
1298 assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled");
1299 MadeChange |= UpdateNodeType(0, getChild(0)->getExtType(0), TP);
1300 MadeChange |= getChild(0)->UpdateNodeType(0, getExtType(0), TP);
1303 unsigned ChildNo = 0;
1304 for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i) {
1305 Record *OperandNode = Inst.getOperand(i);
1307 // If the instruction expects a predicate or optional def operand, we
1308 // codegen this by setting the operand to it's default value if it has a
1309 // non-empty DefaultOps field.
1310 if ((OperandNode->isSubClassOf("PredicateOperand") ||
1311 OperandNode->isSubClassOf("OptionalDefOperand")) &&
1312 !CDP.getDefaultOperand(OperandNode).DefaultOps.empty())
1315 // Verify that we didn't run out of provided operands.
1316 if (ChildNo >= getNumChildren())
1317 TP.error("Instruction '" + getOperator()->getName() +
1318 "' expects more operands than were provided.");
1320 MVT::SimpleValueType VT;
1321 TreePatternNode *Child = getChild(ChildNo++);
1322 assert(Child->getNumTypes() == 1 && "Unknown case?");
1324 if (OperandNode->isSubClassOf("RegisterClass")) {
1325 const CodeGenRegisterClass &RC =
1326 CDP.getTargetInfo().getRegisterClass(OperandNode);
1327 MadeChange |= Child->UpdateNodeType(0, RC.getValueTypes(), TP);
1328 } else if (OperandNode->isSubClassOf("Operand")) {
1329 VT = getValueType(OperandNode->getValueAsDef("Type"));
1330 MadeChange |= Child->UpdateNodeType(0, VT, TP);
1331 } else if (OperandNode->isSubClassOf("PointerLikeRegClass")) {
1332 MadeChange |= Child->UpdateNodeType(0, MVT::iPTR, TP);
1333 } else if (OperandNode->getName() == "unknown") {
1336 assert(0 && "Unknown operand type!");
1339 MadeChange |= Child->ApplyTypeConstraints(TP, NotRegisters);
1342 if (ChildNo != getNumChildren())
1343 TP.error("Instruction '" + getOperator()->getName() +
1344 "' was provided too many operands!");
1349 assert(getOperator()->isSubClassOf("SDNodeXForm") && "Unknown node type!");
1351 // Node transforms always take one operand.
1352 if (getNumChildren() != 1)
1353 TP.error("Node transform '" + getOperator()->getName() +
1354 "' requires one operand!");
1356 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1359 // If either the output or input of the xform does not have exact
1360 // type info. We assume they must be the same. Otherwise, it is perfectly
1361 // legal to transform from one type to a completely different type.
1363 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
1364 bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
1365 MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
1372 /// OnlyOnRHSOfCommutative - Return true if this value is only allowed on the
1373 /// RHS of a commutative operation, not the on LHS.
1374 static bool OnlyOnRHSOfCommutative(TreePatternNode *N) {
1375 if (!N->isLeaf() && N->getOperator()->getName() == "imm")
1377 if (N->isLeaf() && dynamic_cast<IntInit*>(N->getLeafValue()))
1383 /// canPatternMatch - If it is impossible for this pattern to match on this
1384 /// target, fill in Reason and return false. Otherwise, return true. This is
1385 /// used as a sanity check for .td files (to prevent people from writing stuff
1386 /// that can never possibly work), and to prevent the pattern permuter from
1387 /// generating stuff that is useless.
1388 bool TreePatternNode::canPatternMatch(std::string &Reason,
1389 const CodeGenDAGPatterns &CDP) {
1390 if (isLeaf()) return true;
1392 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
1393 if (!getChild(i)->canPatternMatch(Reason, CDP))
1396 // If this is an intrinsic, handle cases that would make it not match. For
1397 // example, if an operand is required to be an immediate.
1398 if (getOperator()->isSubClassOf("Intrinsic")) {
1403 // If this node is a commutative operator, check that the LHS isn't an
1405 const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(getOperator());
1406 bool isCommIntrinsic = isCommutativeIntrinsic(CDP);
1407 if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
1408 // Scan all of the operands of the node and make sure that only the last one
1409 // is a constant node, unless the RHS also is.
1410 if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
1411 bool Skip = isCommIntrinsic ? 1 : 0; // First operand is intrinsic id.
1412 for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)
1413 if (OnlyOnRHSOfCommutative(getChild(i))) {
1414 Reason="Immediate value must be on the RHS of commutative operators!";
1423 //===----------------------------------------------------------------------===//
1424 // TreePattern implementation
1427 TreePattern::TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
1428 CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1429 isInputPattern = isInput;
1430 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)
1431 Trees.push_back(ParseTreePattern((DagInit*)RawPat->getElement(i)));
1434 TreePattern::TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
1435 CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1436 isInputPattern = isInput;
1437 Trees.push_back(ParseTreePattern(Pat));
1440 TreePattern::TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
1441 CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp){
1442 isInputPattern = isInput;
1443 Trees.push_back(Pat);
1446 void TreePattern::error(const std::string &Msg) const {
1448 throw TGError(TheRecord->getLoc(), "In " + TheRecord->getName() + ": " + Msg);
1451 void TreePattern::ComputeNamedNodes() {
1452 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1453 ComputeNamedNodes(Trees[i]);
1456 void TreePattern::ComputeNamedNodes(TreePatternNode *N) {
1457 if (!N->getName().empty())
1458 NamedNodes[N->getName()].push_back(N);
1460 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
1461 ComputeNamedNodes(N->getChild(i));
1465 TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) {
1466 DefInit *OpDef = dynamic_cast<DefInit*>(Dag->getOperator());
1467 if (!OpDef) error("Pattern has unexpected operator type!");
1468 Record *Operator = OpDef->getDef();
1470 if (Operator->isSubClassOf("ValueType")) {
1471 // If the operator is a ValueType, then this must be "type cast" of a leaf
1473 if (Dag->getNumArgs() != 1)
1474 error("Type cast only takes one operand!");
1476 Init *Arg = Dag->getArg(0);
1477 TreePatternNode *New;
1478 if (DefInit *DI = dynamic_cast<DefInit*>(Arg)) {
1479 Record *R = DI->getDef();
1480 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
1481 Dag->setArg(0, new DagInit(DI, "",
1482 std::vector<std::pair<Init*, std::string> >()));
1483 return ParseTreePattern(Dag);
1487 if (R->getName() == "node") {
1488 if (Dag->getArgName(0).empty())
1489 error("'node' argument requires a name to match with operand list");
1490 Args.push_back(Dag->getArgName(0));
1493 New = new TreePatternNode(DI, 1);
1494 } else if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
1495 New = ParseTreePattern(DI);
1496 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
1497 New = new TreePatternNode(II, 1);
1498 if (!Dag->getArgName(0).empty())
1499 error("Constant int argument should not have a name!");
1500 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
1501 // Turn this into an IntInit.
1502 Init *II = BI->convertInitializerTo(new IntRecTy());
1503 if (II == 0 || !dynamic_cast<IntInit*>(II))
1504 error("Bits value must be constants!");
1506 New = new TreePatternNode(dynamic_cast<IntInit*>(II), 1);
1507 if (!Dag->getArgName(0).empty())
1508 error("Constant int argument should not have a name!");
1511 error("Unknown leaf value for tree pattern!");
1515 // Apply the type cast.
1516 assert(New->getNumTypes() == 1 && "FIXME: Unhandled");
1517 New->UpdateNodeType(0, getValueType(Operator), *this);
1518 if (New->getNumChildren() == 0)
1519 New->setName(Dag->getArgName(0));
1523 // Verify that this is something that makes sense for an operator.
1524 if (!Operator->isSubClassOf("PatFrag") &&
1525 !Operator->isSubClassOf("SDNode") &&
1526 !Operator->isSubClassOf("Instruction") &&
1527 !Operator->isSubClassOf("SDNodeXForm") &&
1528 !Operator->isSubClassOf("Intrinsic") &&
1529 Operator->getName() != "set" &&
1530 Operator->getName() != "implicit")
1531 error("Unrecognized node '" + Operator->getName() + "'!");
1533 // Check to see if this is something that is illegal in an input pattern.
1534 if (isInputPattern && (Operator->isSubClassOf("Instruction") ||
1535 Operator->isSubClassOf("SDNodeXForm")))
1536 error("Cannot use '" + Operator->getName() + "' in an input pattern!");
1538 std::vector<TreePatternNode*> Children;
1540 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) {
1541 Init *Arg = Dag->getArg(i);
1542 if (DagInit *DI = dynamic_cast<DagInit*>(Arg)) {
1543 Children.push_back(ParseTreePattern(DI));
1544 if (Children.back()->getName().empty())
1545 Children.back()->setName(Dag->getArgName(i));
1546 } else if (DefInit *DefI = dynamic_cast<DefInit*>(Arg)) {
1547 Record *R = DefI->getDef();
1548 // Direct reference to a leaf DagNode or PatFrag? Turn it into a
1549 // TreePatternNode if its own.
1550 if (R->isSubClassOf("SDNode") || R->isSubClassOf("PatFrag")) {
1551 Dag->setArg(i, new DagInit(DefI, "",
1552 std::vector<std::pair<Init*, std::string> >()));
1553 --i; // Revisit this node...
1555 TreePatternNode *Node = new TreePatternNode(DefI, 1);
1556 Node->setName(Dag->getArgName(i));
1557 Children.push_back(Node);
1560 if (R->getName() == "node") {
1561 if (Dag->getArgName(i).empty())
1562 error("'node' argument requires a name to match with operand list");
1563 Args.push_back(Dag->getArgName(i));
1566 } else if (IntInit *II = dynamic_cast<IntInit*>(Arg)) {
1567 TreePatternNode *Node = new TreePatternNode(II, 1);
1568 if (!Dag->getArgName(i).empty())
1569 error("Constant int argument should not have a name!");
1570 Children.push_back(Node);
1571 } else if (BitsInit *BI = dynamic_cast<BitsInit*>(Arg)) {
1572 // Turn this into an IntInit.
1573 Init *II = BI->convertInitializerTo(new IntRecTy());
1574 if (II == 0 || !dynamic_cast<IntInit*>(II))
1575 error("Bits value must be constants!");
1577 TreePatternNode *Node = new TreePatternNode(dynamic_cast<IntInit*>(II),1);
1578 if (!Dag->getArgName(i).empty())
1579 error("Constant int argument should not have a name!");
1580 Children.push_back(Node);
1585 error("Unknown leaf value for tree pattern!");
1589 // If the operator is an intrinsic, then this is just syntactic sugar for for
1590 // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
1591 // convert the intrinsic name to a number.
1592 if (Operator->isSubClassOf("Intrinsic")) {
1593 const CodeGenIntrinsic &Int = getDAGPatterns().getIntrinsic(Operator);
1594 unsigned IID = getDAGPatterns().getIntrinsicID(Operator)+1;
1596 // If this intrinsic returns void, it must have side-effects and thus a
1598 if (Int.IS.RetVTs.empty()) {
1599 Operator = getDAGPatterns().get_intrinsic_void_sdnode();
1600 } else if (Int.ModRef != CodeGenIntrinsic::NoMem) {
1601 // Has side-effects, requires chain.
1602 Operator = getDAGPatterns().get_intrinsic_w_chain_sdnode();
1604 // Otherwise, no chain.
1605 Operator = getDAGPatterns().get_intrinsic_wo_chain_sdnode();
1608 TreePatternNode *IIDNode = new TreePatternNode(new IntInit(IID), 1);
1609 Children.insert(Children.begin(), IIDNode);
1612 unsigned NumResults = GetNumNodeResults(Operator, CDP);
1613 TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults);
1614 Result->setName(Dag->getName());
1618 /// InferAllTypes - Infer/propagate as many types throughout the expression
1619 /// patterns as possible. Return true if all types are inferred, false
1620 /// otherwise. Throw an exception if a type contradiction is found.
1622 InferAllTypes(const StringMap<SmallVector<TreePatternNode*,1> > *InNamedTypes) {
1623 if (NamedNodes.empty())
1624 ComputeNamedNodes();
1626 bool MadeChange = true;
1627 while (MadeChange) {
1629 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1630 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false);
1632 // If there are constraints on our named nodes, apply them.
1633 for (StringMap<SmallVector<TreePatternNode*,1> >::iterator
1634 I = NamedNodes.begin(), E = NamedNodes.end(); I != E; ++I) {
1635 SmallVectorImpl<TreePatternNode*> &Nodes = I->second;
1637 // If we have input named node types, propagate their types to the named
1640 // FIXME: Should be error?
1641 assert(InNamedTypes->count(I->getKey()) &&
1642 "Named node in output pattern but not input pattern?");
1644 const SmallVectorImpl<TreePatternNode*> &InNodes =
1645 InNamedTypes->find(I->getKey())->second;
1647 // The input types should be fully resolved by now.
1648 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
1649 // If this node is a register class, and it is the root of the pattern
1650 // then we're mapping something onto an input register. We allow
1651 // changing the type of the input register in this case. This allows
1652 // us to match things like:
1653 // def : Pat<(v1i64 (bitconvert(v2i32 DPR:$src))), (v1i64 DPR:$src)>;
1654 if (Nodes[i] == Trees[0] && Nodes[i]->isLeaf()) {
1655 DefInit *DI = dynamic_cast<DefInit*>(Nodes[i]->getLeafValue());
1656 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1660 assert(Nodes[i]->getNumTypes() == 1 &&
1661 InNodes[0]->getNumTypes() == 1 &&
1662 "FIXME: cannot name multiple result nodes yet");
1663 MadeChange |= Nodes[i]->UpdateNodeType(0, InNodes[0]->getExtType(0),
1668 // If there are multiple nodes with the same name, they must all have the
1670 if (I->second.size() > 1) {
1671 for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {
1672 TreePatternNode *N1 = Nodes[i], *N2 = Nodes[i+1];
1673 assert(N1->getNumTypes() == 1 && N2->getNumTypes() == 1 &&
1674 "FIXME: cannot name multiple result nodes yet");
1676 MadeChange |= N1->UpdateNodeType(0, N2->getExtType(0), *this);
1677 MadeChange |= N2->UpdateNodeType(0, N1->getExtType(0), *this);
1683 bool HasUnresolvedTypes = false;
1684 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
1685 HasUnresolvedTypes |= Trees[i]->ContainsUnresolvedType();
1686 return !HasUnresolvedTypes;
1689 void TreePattern::print(raw_ostream &OS) const {
1690 OS << getRecord()->getName();
1691 if (!Args.empty()) {
1692 OS << "(" << Args[0];
1693 for (unsigned i = 1, e = Args.size(); i != e; ++i)
1694 OS << ", " << Args[i];
1699 if (Trees.size() > 1)
1701 for (unsigned i = 0, e = Trees.size(); i != e; ++i) {
1703 Trees[i]->print(OS);
1707 if (Trees.size() > 1)
1711 void TreePattern::dump() const { print(errs()); }
1713 //===----------------------------------------------------------------------===//
1714 // CodeGenDAGPatterns implementation
1717 CodeGenDAGPatterns::CodeGenDAGPatterns(RecordKeeper &R) : Records(R) {
1718 Intrinsics = LoadIntrinsics(Records, false);
1719 TgtIntrinsics = LoadIntrinsics(Records, true);
1721 ParseNodeTransforms();
1722 ParseComplexPatterns();
1723 ParsePatternFragments();
1724 ParseDefaultOperands();
1725 ParseInstructions();
1728 // Generate variants. For example, commutative patterns can match
1729 // multiple ways. Add them to PatternsToMatch as well.
1732 // Infer instruction flags. For example, we can detect loads,
1733 // stores, and side effects in many cases by examining an
1734 // instruction's pattern.
1735 InferInstructionFlags();
1738 CodeGenDAGPatterns::~CodeGenDAGPatterns() {
1739 for (pf_iterator I = PatternFragments.begin(),
1740 E = PatternFragments.end(); I != E; ++I)
1745 Record *CodeGenDAGPatterns::getSDNodeNamed(const std::string &Name) const {
1746 Record *N = Records.getDef(Name);
1747 if (!N || !N->isSubClassOf("SDNode")) {
1748 errs() << "Error getting SDNode '" << Name << "'!\n";
1754 // Parse all of the SDNode definitions for the target, populating SDNodes.
1755 void CodeGenDAGPatterns::ParseNodeInfo() {
1756 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode");
1757 while (!Nodes.empty()) {
1758 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
1762 // Get the builtin intrinsic nodes.
1763 intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
1764 intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
1765 intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
1768 /// ParseNodeTransforms - Parse all SDNodeXForm instances into the SDNodeXForms
1769 /// map, and emit them to the file as functions.
1770 void CodeGenDAGPatterns::ParseNodeTransforms() {
1771 std::vector<Record*> Xforms = Records.getAllDerivedDefinitions("SDNodeXForm");
1772 while (!Xforms.empty()) {
1773 Record *XFormNode = Xforms.back();
1774 Record *SDNode = XFormNode->getValueAsDef("Opcode");
1775 std::string Code = XFormNode->getValueAsCode("XFormFunction");
1776 SDNodeXForms.insert(std::make_pair(XFormNode, NodeXForm(SDNode, Code)));
1782 void CodeGenDAGPatterns::ParseComplexPatterns() {
1783 std::vector<Record*> AMs = Records.getAllDerivedDefinitions("ComplexPattern");
1784 while (!AMs.empty()) {
1785 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
1791 /// ParsePatternFragments - Parse all of the PatFrag definitions in the .td
1792 /// file, building up the PatternFragments map. After we've collected them all,
1793 /// inline fragments together as necessary, so that there are no references left
1794 /// inside a pattern fragment to a pattern fragment.
1796 void CodeGenDAGPatterns::ParsePatternFragments() {
1797 std::vector<Record*> Fragments = Records.getAllDerivedDefinitions("PatFrag");
1799 // First step, parse all of the fragments.
1800 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1801 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
1802 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
1803 PatternFragments[Fragments[i]] = P;
1805 // Validate the argument list, converting it to set, to discard duplicates.
1806 std::vector<std::string> &Args = P->getArgList();
1807 std::set<std::string> OperandsSet(Args.begin(), Args.end());
1809 if (OperandsSet.count(""))
1810 P->error("Cannot have unnamed 'node' values in pattern fragment!");
1812 // Parse the operands list.
1813 DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
1814 DefInit *OpsOp = dynamic_cast<DefInit*>(OpsList->getOperator());
1815 // Special cases: ops == outs == ins. Different names are used to
1816 // improve readability.
1818 (OpsOp->getDef()->getName() != "ops" &&
1819 OpsOp->getDef()->getName() != "outs" &&
1820 OpsOp->getDef()->getName() != "ins"))
1821 P->error("Operands list should start with '(ops ... '!");
1823 // Copy over the arguments.
1825 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {
1826 if (!dynamic_cast<DefInit*>(OpsList->getArg(j)) ||
1827 static_cast<DefInit*>(OpsList->getArg(j))->
1828 getDef()->getName() != "node")
1829 P->error("Operands list should all be 'node' values.");
1830 if (OpsList->getArgName(j).empty())
1831 P->error("Operands list should have names for each operand!");
1832 if (!OperandsSet.count(OpsList->getArgName(j)))
1833 P->error("'" + OpsList->getArgName(j) +
1834 "' does not occur in pattern or was multiply specified!");
1835 OperandsSet.erase(OpsList->getArgName(j));
1836 Args.push_back(OpsList->getArgName(j));
1839 if (!OperandsSet.empty())
1840 P->error("Operands list does not contain an entry for operand '" +
1841 *OperandsSet.begin() + "'!");
1843 // If there is a code init for this fragment, keep track of the fact that
1844 // this fragment uses it.
1845 std::string Code = Fragments[i]->getValueAsCode("Predicate");
1847 P->getOnlyTree()->addPredicateFn("Predicate_"+Fragments[i]->getName());
1849 // If there is a node transformation corresponding to this, keep track of
1851 Record *Transform = Fragments[i]->getValueAsDef("OperandTransform");
1852 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
1853 P->getOnlyTree()->setTransformFn(Transform);
1856 // Now that we've parsed all of the tree fragments, do a closure on them so
1857 // that there are not references to PatFrags left inside of them.
1858 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {
1859 TreePattern *ThePat = PatternFragments[Fragments[i]];
1860 ThePat->InlinePatternFragments();
1862 // Infer as many types as possible. Don't worry about it if we don't infer
1863 // all of them, some may depend on the inputs of the pattern.
1865 ThePat->InferAllTypes();
1867 // If this pattern fragment is not supported by this target (no types can
1868 // satisfy its constraints), just ignore it. If the bogus pattern is
1869 // actually used by instructions, the type consistency error will be
1873 // If debugging, print out the pattern fragment result.
1874 DEBUG(ThePat->dump());
1878 void CodeGenDAGPatterns::ParseDefaultOperands() {
1879 std::vector<Record*> DefaultOps[2];
1880 DefaultOps[0] = Records.getAllDerivedDefinitions("PredicateOperand");
1881 DefaultOps[1] = Records.getAllDerivedDefinitions("OptionalDefOperand");
1883 // Find some SDNode.
1884 assert(!SDNodes.empty() && "No SDNodes parsed?");
1885 Init *SomeSDNode = new DefInit(SDNodes.begin()->first);
1887 for (unsigned iter = 0; iter != 2; ++iter) {
1888 for (unsigned i = 0, e = DefaultOps[iter].size(); i != e; ++i) {
1889 DagInit *DefaultInfo = DefaultOps[iter][i]->getValueAsDag("DefaultOps");
1891 // Clone the DefaultInfo dag node, changing the operator from 'ops' to
1892 // SomeSDnode so that we can parse this.
1893 std::vector<std::pair<Init*, std::string> > Ops;
1894 for (unsigned op = 0, e = DefaultInfo->getNumArgs(); op != e; ++op)
1895 Ops.push_back(std::make_pair(DefaultInfo->getArg(op),
1896 DefaultInfo->getArgName(op)));
1897 DagInit *DI = new DagInit(SomeSDNode, "", Ops);
1899 // Create a TreePattern to parse this.
1900 TreePattern P(DefaultOps[iter][i], DI, false, *this);
1901 assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!");
1903 // Copy the operands over into a DAGDefaultOperand.
1904 DAGDefaultOperand DefaultOpInfo;
1906 TreePatternNode *T = P.getTree(0);
1907 for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {
1908 TreePatternNode *TPN = T->getChild(op);
1909 while (TPN->ApplyTypeConstraints(P, false))
1910 /* Resolve all types */;
1912 if (TPN->ContainsUnresolvedType()) {
1914 throw "Value #" + utostr(i) + " of PredicateOperand '" +
1915 DefaultOps[iter][i]->getName() +"' doesn't have a concrete type!";
1917 throw "Value #" + utostr(i) + " of OptionalDefOperand '" +
1918 DefaultOps[iter][i]->getName() +"' doesn't have a concrete type!";
1920 DefaultOpInfo.DefaultOps.push_back(TPN);
1923 // Insert it into the DefaultOperands map so we can find it later.
1924 DefaultOperands[DefaultOps[iter][i]] = DefaultOpInfo;
1929 /// HandleUse - Given "Pat" a leaf in the pattern, check to see if it is an
1930 /// instruction input. Return true if this is a real use.
1931 static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
1932 std::map<std::string, TreePatternNode*> &InstInputs,
1933 std::vector<Record*> &InstImpInputs) {
1934 // No name -> not interesting.
1935 if (Pat->getName().empty()) {
1936 if (Pat->isLeaf()) {
1937 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1938 if (DI && DI->getDef()->isSubClassOf("RegisterClass"))
1939 I->error("Input " + DI->getDef()->getName() + " must be named!");
1940 else if (DI && DI->getDef()->isSubClassOf("Register"))
1941 InstImpInputs.push_back(DI->getDef());
1947 if (Pat->isLeaf()) {
1948 DefInit *DI = dynamic_cast<DefInit*>(Pat->getLeafValue());
1949 if (!DI) I->error("Input $" + Pat->getName() + " must be an identifier!");
1952 Rec = Pat->getOperator();
1955 // SRCVALUE nodes are ignored.
1956 if (Rec->getName() == "srcvalue")
1959 TreePatternNode *&Slot = InstInputs[Pat->getName()];
1965 if (Slot->isLeaf()) {
1966 SlotRec = dynamic_cast<DefInit*>(Slot->getLeafValue())->getDef();
1968 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
1969 SlotRec = Slot->getOperator();
1972 // Ensure that the inputs agree if we've already seen this input.
1974 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1975 if (Slot->getExtTypes() != Pat->getExtTypes())
1976 I->error("All $" + Pat->getName() + " inputs must agree with each other");
1980 /// FindPatternInputsAndOutputs - Scan the specified TreePatternNode (which is
1981 /// part of "I", the instruction), computing the set of inputs and outputs of
1982 /// the pattern. Report errors if we see anything naughty.
1983 void CodeGenDAGPatterns::
1984 FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
1985 std::map<std::string, TreePatternNode*> &InstInputs,
1986 std::map<std::string, TreePatternNode*>&InstResults,
1987 std::vector<Record*> &InstImpInputs,
1988 std::vector<Record*> &InstImpResults) {
1989 if (Pat->isLeaf()) {
1990 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
1991 if (!isUse && Pat->getTransformFn())
1992 I->error("Cannot specify a transform function for a non-input value!");
1996 if (Pat->getOperator()->getName() == "implicit") {
1997 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
1998 TreePatternNode *Dest = Pat->getChild(i);
1999 if (!Dest->isLeaf())
2000 I->error("implicitly defined value should be a register!");
2002 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
2003 if (!Val || !Val->getDef()->isSubClassOf("Register"))
2004 I->error("implicitly defined value should be a register!");
2005 InstImpResults.push_back(Val->getDef());
2010 if (Pat->getOperator()->getName() != "set") {
2011 // If this is not a set, verify that the children nodes are not void typed,
2013 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {
2014 if (Pat->getChild(i)->getNumTypes() == 0)
2015 I->error("Cannot have void nodes inside of patterns!");
2016 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
2017 InstImpInputs, InstImpResults);
2020 // If this is a non-leaf node with no children, treat it basically as if
2021 // it were a leaf. This handles nodes like (imm).
2022 bool isUse = HandleUse(I, Pat, InstInputs, InstImpInputs);
2024 if (!isUse && Pat->getTransformFn())
2025 I->error("Cannot specify a transform function for a non-input value!");
2029 // Otherwise, this is a set, validate and collect instruction results.
2030 if (Pat->getNumChildren() == 0)
2031 I->error("set requires operands!");
2033 if (Pat->getTransformFn())
2034 I->error("Cannot specify a transform function on a set node!");
2036 // Check the set destinations.
2037 unsigned NumDests = Pat->getNumChildren()-1;
2038 for (unsigned i = 0; i != NumDests; ++i) {
2039 TreePatternNode *Dest = Pat->getChild(i);
2040 if (!Dest->isLeaf())
2041 I->error("set destination should be a register!");
2043 DefInit *Val = dynamic_cast<DefInit*>(Dest->getLeafValue());
2045 I->error("set destination should be a register!");
2047 if (Val->getDef()->isSubClassOf("RegisterClass") ||
2048 Val->getDef()->isSubClassOf("PointerLikeRegClass")) {
2049 if (Dest->getName().empty())
2050 I->error("set destination must have a name!");
2051 if (InstResults.count(Dest->getName()))
2052 I->error("cannot set '" + Dest->getName() +"' multiple times");
2053 InstResults[Dest->getName()] = Dest;
2054 } else if (Val->getDef()->isSubClassOf("Register")) {
2055 InstImpResults.push_back(Val->getDef());
2057 I->error("set destination should be a register!");
2061 // Verify and collect info from the computation.
2062 FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
2063 InstInputs, InstResults,
2064 InstImpInputs, InstImpResults);
2067 //===----------------------------------------------------------------------===//
2068 // Instruction Analysis
2069 //===----------------------------------------------------------------------===//
2071 class InstAnalyzer {
2072 const CodeGenDAGPatterns &CDP;
2075 bool &HasSideEffects;
2078 InstAnalyzer(const CodeGenDAGPatterns &cdp,
2079 bool &maystore, bool &mayload, bool &hse, bool &isv)
2080 : CDP(cdp), mayStore(maystore), mayLoad(mayload), HasSideEffects(hse),
2084 /// Analyze - Analyze the specified instruction, returning true if the
2085 /// instruction had a pattern.
2086 bool Analyze(Record *InstRecord) {
2087 const TreePattern *Pattern = CDP.getInstruction(InstRecord).getPattern();
2090 return false; // No pattern.
2093 // FIXME: Assume only the first tree is the pattern. The others are clobber
2095 AnalyzeNode(Pattern->getTree(0));
2100 void AnalyzeNode(const TreePatternNode *N) {
2102 if (DefInit *DI = dynamic_cast<DefInit*>(N->getLeafValue())) {
2103 Record *LeafRec = DI->getDef();
2104 // Handle ComplexPattern leaves.
2105 if (LeafRec->isSubClassOf("ComplexPattern")) {
2106 const ComplexPattern &CP = CDP.getComplexPattern(LeafRec);
2107 if (CP.hasProperty(SDNPMayStore)) mayStore = true;
2108 if (CP.hasProperty(SDNPMayLoad)) mayLoad = true;
2109 if (CP.hasProperty(SDNPSideEffect)) HasSideEffects = true;
2115 // Analyze children.
2116 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2117 AnalyzeNode(N->getChild(i));
2119 // Ignore set nodes, which are not SDNodes.
2120 if (N->getOperator()->getName() == "set")
2123 // Get information about the SDNode for the operator.
2124 const SDNodeInfo &OpInfo = CDP.getSDNodeInfo(N->getOperator());
2126 // Notice properties of the node.
2127 if (OpInfo.hasProperty(SDNPMayStore)) mayStore = true;
2128 if (OpInfo.hasProperty(SDNPMayLoad)) mayLoad = true;
2129 if (OpInfo.hasProperty(SDNPSideEffect)) HasSideEffects = true;
2130 if (OpInfo.hasProperty(SDNPVariadic)) IsVariadic = true;
2132 if (const CodeGenIntrinsic *IntInfo = N->getIntrinsicInfo(CDP)) {
2133 // If this is an intrinsic, analyze it.
2134 if (IntInfo->ModRef >= CodeGenIntrinsic::ReadArgMem)
2135 mayLoad = true;// These may load memory.
2137 if (IntInfo->ModRef >= CodeGenIntrinsic::WriteArgMem)
2138 mayStore = true;// Intrinsics that can write to memory are 'mayStore'.
2140 if (IntInfo->ModRef >= CodeGenIntrinsic::WriteMem)
2141 // WriteMem intrinsics can have other strange effects.
2142 HasSideEffects = true;
2148 static void InferFromPattern(const CodeGenInstruction &Inst,
2149 bool &MayStore, bool &MayLoad,
2150 bool &HasSideEffects, bool &IsVariadic,
2151 const CodeGenDAGPatterns &CDP) {
2152 MayStore = MayLoad = HasSideEffects = IsVariadic = false;
2155 InstAnalyzer(CDP, MayStore, MayLoad, HasSideEffects, IsVariadic)
2156 .Analyze(Inst.TheDef);
2158 // InstAnalyzer only correctly analyzes mayStore/mayLoad so far.
2159 if (Inst.mayStore) { // If the .td file explicitly sets mayStore, use it.
2160 // If we decided that this is a store from the pattern, then the .td file
2161 // entry is redundant.
2164 "Warning: mayStore flag explicitly set on instruction '%s'"
2165 " but flag already inferred from pattern.\n",
2166 Inst.TheDef->getName().c_str());
2170 if (Inst.mayLoad) { // If the .td file explicitly sets mayLoad, use it.
2171 // If we decided that this is a load from the pattern, then the .td file
2172 // entry is redundant.
2175 "Warning: mayLoad flag explicitly set on instruction '%s'"
2176 " but flag already inferred from pattern.\n",
2177 Inst.TheDef->getName().c_str());
2181 if (Inst.neverHasSideEffects) {
2183 fprintf(stderr, "Warning: neverHasSideEffects set on instruction '%s' "
2184 "which already has a pattern\n", Inst.TheDef->getName().c_str());
2185 HasSideEffects = false;
2188 if (Inst.hasSideEffects) {
2190 fprintf(stderr, "Warning: hasSideEffects set on instruction '%s' "
2191 "which already inferred this.\n", Inst.TheDef->getName().c_str());
2192 HasSideEffects = true;
2195 if (Inst.isVariadic)
2196 IsVariadic = true; // Can warn if we want.
2199 /// ParseInstructions - Parse all of the instructions, inlining and resolving
2200 /// any fragments involved. This populates the Instructions list with fully
2201 /// resolved instructions.
2202 void CodeGenDAGPatterns::ParseInstructions() {
2203 std::vector<Record*> Instrs = Records.getAllDerivedDefinitions("Instruction");
2205 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
2208 if (dynamic_cast<ListInit*>(Instrs[i]->getValueInit("Pattern")))
2209 LI = Instrs[i]->getValueAsListInit("Pattern");
2211 // If there is no pattern, only collect minimal information about the
2212 // instruction for its operand list. We have to assume that there is one
2213 // result, as we have no detailed info.
2214 if (!LI || LI->getSize() == 0) {
2215 std::vector<Record*> Results;
2216 std::vector<Record*> Operands;
2218 CodeGenInstruction &InstInfo = Target.getInstruction(Instrs[i]);
2220 if (InstInfo.OperandList.size() != 0) {
2221 if (InstInfo.NumDefs == 0) {
2222 // These produce no results
2223 for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
2224 Operands.push_back(InstInfo.OperandList[j].Rec);
2226 // Assume the first operand is the result.
2227 Results.push_back(InstInfo.OperandList[0].Rec);
2229 // The rest are inputs.
2230 for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
2231 Operands.push_back(InstInfo.OperandList[j].Rec);
2235 // Create and insert the instruction.
2236 std::vector<Record*> ImpResults;
2237 std::vector<Record*> ImpOperands;
2238 Instructions.insert(std::make_pair(Instrs[i],
2239 DAGInstruction(0, Results, Operands, ImpResults,
2241 continue; // no pattern.
2244 // Parse the instruction.
2245 TreePattern *I = new TreePattern(Instrs[i], LI, true, *this);
2246 // Inline pattern fragments into it.
2247 I->InlinePatternFragments();
2249 // Infer as many types as possible. If we cannot infer all of them, we can
2250 // never do anything with this instruction pattern: report it to the user.
2251 if (!I->InferAllTypes())
2252 I->error("Could not infer all types in pattern!");
2254 // InstInputs - Keep track of all of the inputs of the instruction, along
2255 // with the record they are declared as.
2256 std::map<std::string, TreePatternNode*> InstInputs;
2258 // InstResults - Keep track of all the virtual registers that are 'set'
2259 // in the instruction, including what reg class they are.
2260 std::map<std::string, TreePatternNode*> InstResults;
2262 std::vector<Record*> InstImpInputs;
2263 std::vector<Record*> InstImpResults;
2265 // Verify that the top-level forms in the instruction are of void type, and
2266 // fill in the InstResults map.
2267 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {
2268 TreePatternNode *Pat = I->getTree(j);
2269 if (Pat->getNumTypes() != 0)
2270 I->error("Top-level forms in instruction pattern should have"
2273 // Find inputs and outputs, and verify the structure of the uses/defs.
2274 FindPatternInputsAndOutputs(I, Pat, InstInputs, InstResults,
2275 InstImpInputs, InstImpResults);
2278 // Now that we have inputs and outputs of the pattern, inspect the operands
2279 // list for the instruction. This determines the order that operands are
2280 // added to the machine instruction the node corresponds to.
2281 unsigned NumResults = InstResults.size();
2283 // Parse the operands list from the (ops) list, validating it.
2284 assert(I->getArgList().empty() && "Args list should still be empty here!");
2285 CodeGenInstruction &CGI = Target.getInstruction(Instrs[i]);
2287 // Check that all of the results occur first in the list.
2288 std::vector<Record*> Results;
2289 TreePatternNode *Res0Node = 0;
2290 for (unsigned i = 0; i != NumResults; ++i) {
2291 if (i == CGI.OperandList.size())
2292 I->error("'" + InstResults.begin()->first +
2293 "' set but does not appear in operand list!");
2294 const std::string &OpName = CGI.OperandList[i].Name;
2296 // Check that it exists in InstResults.
2297 TreePatternNode *RNode = InstResults[OpName];
2299 I->error("Operand $" + OpName + " does not exist in operand list!");
2303 Record *R = dynamic_cast<DefInit*>(RNode->getLeafValue())->getDef();
2305 I->error("Operand $" + OpName + " should be a set destination: all "
2306 "outputs must occur before inputs in operand list!");
2308 if (CGI.OperandList[i].Rec != R)
2309 I->error("Operand $" + OpName + " class mismatch!");
2311 // Remember the return type.
2312 Results.push_back(CGI.OperandList[i].Rec);
2314 // Okay, this one checks out.
2315 InstResults.erase(OpName);
2318 // Loop over the inputs next. Make a copy of InstInputs so we can destroy
2319 // the copy while we're checking the inputs.
2320 std::map<std::string, TreePatternNode*> InstInputsCheck(InstInputs);
2322 std::vector<TreePatternNode*> ResultNodeOperands;
2323 std::vector<Record*> Operands;
2324 for (unsigned i = NumResults, e = CGI.OperandList.size(); i != e; ++i) {
2325 CodeGenInstruction::OperandInfo &Op = CGI.OperandList[i];
2326 const std::string &OpName = Op.Name;
2328 I->error("Operand #" + utostr(i) + " in operands list has no name!");
2330 if (!InstInputsCheck.count(OpName)) {
2331 // If this is an predicate operand or optional def operand with an
2332 // DefaultOps set filled in, we can ignore this. When we codegen it,
2333 // we will do so as always executed.
2334 if (Op.Rec->isSubClassOf("PredicateOperand") ||
2335 Op.Rec->isSubClassOf("OptionalDefOperand")) {
2336 // Does it have a non-empty DefaultOps field? If so, ignore this
2338 if (!getDefaultOperand(Op.Rec).DefaultOps.empty())
2341 I->error("Operand $" + OpName +
2342 " does not appear in the instruction pattern");
2344 TreePatternNode *InVal = InstInputsCheck[OpName];
2345 InstInputsCheck.erase(OpName); // It occurred, remove from map.
2347 if (InVal->isLeaf() &&
2348 dynamic_cast<DefInit*>(InVal->getLeafValue())) {
2349 Record *InRec = static_cast<DefInit*>(InVal->getLeafValue())->getDef();
2350 if (Op.Rec != InRec && !InRec->isSubClassOf("ComplexPattern"))
2351 I->error("Operand $" + OpName + "'s register class disagrees"
2352 " between the operand and pattern");
2354 Operands.push_back(Op.Rec);
2356 // Construct the result for the dest-pattern operand list.
2357 TreePatternNode *OpNode = InVal->clone();
2359 // No predicate is useful on the result.
2360 OpNode->clearPredicateFns();
2362 // Promote the xform function to be an explicit node if set.
2363 if (Record *Xform = OpNode->getTransformFn()) {
2364 OpNode->setTransformFn(0);
2365 std::vector<TreePatternNode*> Children;
2366 Children.push_back(OpNode);
2367 OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes());
2370 ResultNodeOperands.push_back(OpNode);
2373 if (!InstInputsCheck.empty())
2374 I->error("Input operand $" + InstInputsCheck.begin()->first +
2375 " occurs in pattern but not in operands list!");
2377 TreePatternNode *ResultPattern =
2378 new TreePatternNode(I->getRecord(), ResultNodeOperands,
2379 GetNumNodeResults(I->getRecord(), *this));
2380 // Copy fully inferred output node type to instruction result pattern.
2381 for (unsigned i = 0; i != NumResults; ++i)
2382 ResultPattern->setType(i, Res0Node->getExtType(i));
2384 // Create and insert the instruction.
2385 // FIXME: InstImpResults and InstImpInputs should not be part of
2387 DAGInstruction TheInst(I, Results, Operands, InstImpResults, InstImpInputs);
2388 Instructions.insert(std::make_pair(I->getRecord(), TheInst));
2390 // Use a temporary tree pattern to infer all types and make sure that the
2391 // constructed result is correct. This depends on the instruction already
2392 // being inserted into the Instructions map.
2393 TreePattern Temp(I->getRecord(), ResultPattern, false, *this);
2394 Temp.InferAllTypes(&I->getNamedNodesMap());
2396 DAGInstruction &TheInsertedInst = Instructions.find(I->getRecord())->second;
2397 TheInsertedInst.setResultPattern(Temp.getOnlyTree());
2402 // If we can, convert the instructions to be patterns that are matched!
2403 for (std::map<Record*, DAGInstruction, RecordPtrCmp>::iterator II =
2404 Instructions.begin(),
2405 E = Instructions.end(); II != E; ++II) {
2406 DAGInstruction &TheInst = II->second;
2407 const TreePattern *I = TheInst.getPattern();
2408 if (I == 0) continue; // No pattern.
2410 // FIXME: Assume only the first tree is the pattern. The others are clobber
2412 TreePatternNode *Pattern = I->getTree(0);
2413 TreePatternNode *SrcPattern;
2414 if (Pattern->getOperator()->getName() == "set") {
2415 SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
2417 // Not a set (store or something?)
2418 SrcPattern = Pattern;
2421 Record *Instr = II->first;
2422 AddPatternToMatch(I,
2423 PatternToMatch(Instr->getValueAsListInit("Predicates"),
2425 TheInst.getResultPattern(),
2426 TheInst.getImpResults(),
2427 Instr->getValueAsInt("AddedComplexity"),
2433 typedef std::pair<const TreePatternNode*, unsigned> NameRecord;
2435 static void FindNames(const TreePatternNode *P,
2436 std::map<std::string, NameRecord> &Names,
2437 const TreePattern *PatternTop) {
2438 if (!P->getName().empty()) {
2439 NameRecord &Rec = Names[P->getName()];
2440 // If this is the first instance of the name, remember the node.
2441 if (Rec.second++ == 0)
2443 else if (Rec.first->getExtTypes() != P->getExtTypes())
2444 PatternTop->error("repetition of value: $" + P->getName() +
2445 " where different uses have different types!");
2449 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)
2450 FindNames(P->getChild(i), Names, PatternTop);
2454 void CodeGenDAGPatterns::AddPatternToMatch(const TreePattern *Pattern,
2455 const PatternToMatch &PTM) {
2456 // Do some sanity checking on the pattern we're about to match.
2458 if (!PTM.getSrcPattern()->canPatternMatch(Reason, *this))
2459 Pattern->error("Pattern can never match: " + Reason);
2461 // If the source pattern's root is a complex pattern, that complex pattern
2462 // must specify the nodes it can potentially match.
2463 if (const ComplexPattern *CP =
2464 PTM.getSrcPattern()->getComplexPatternInfo(*this))
2465 if (CP->getRootNodes().empty())
2466 Pattern->error("ComplexPattern at root must specify list of opcodes it"
2470 // Find all of the named values in the input and output, ensure they have the
2472 std::map<std::string, NameRecord> SrcNames, DstNames;
2473 FindNames(PTM.getSrcPattern(), SrcNames, Pattern);
2474 FindNames(PTM.getDstPattern(), DstNames, Pattern);
2476 // Scan all of the named values in the destination pattern, rejecting them if
2477 // they don't exist in the input pattern.
2478 for (std::map<std::string, NameRecord>::iterator
2479 I = DstNames.begin(), E = DstNames.end(); I != E; ++I) {
2480 if (SrcNames[I->first].first == 0)
2481 Pattern->error("Pattern has input without matching name in output: $" +
2485 // Scan all of the named values in the source pattern, rejecting them if the
2486 // name isn't used in the dest, and isn't used to tie two values together.
2487 for (std::map<std::string, NameRecord>::iterator
2488 I = SrcNames.begin(), E = SrcNames.end(); I != E; ++I)
2489 if (DstNames[I->first].first == 0 && SrcNames[I->first].second == 1)
2490 Pattern->error("Pattern has dead named input: $" + I->first);
2492 PatternsToMatch.push_back(PTM);
2497 void CodeGenDAGPatterns::InferInstructionFlags() {
2498 const std::vector<const CodeGenInstruction*> &Instructions =
2499 Target.getInstructionsByEnumValue();
2500 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
2501 CodeGenInstruction &InstInfo =
2502 const_cast<CodeGenInstruction &>(*Instructions[i]);
2503 // Determine properties of the instruction from its pattern.
2504 bool MayStore, MayLoad, HasSideEffects, IsVariadic;
2505 InferFromPattern(InstInfo, MayStore, MayLoad, HasSideEffects, IsVariadic,
2507 InstInfo.mayStore = MayStore;
2508 InstInfo.mayLoad = MayLoad;
2509 InstInfo.hasSideEffects = HasSideEffects;
2510 InstInfo.isVariadic = IsVariadic;
2514 /// Given a pattern result with an unresolved type, see if we can find one
2515 /// instruction with an unresolved result type. Force this result type to an
2516 /// arbitrary element if it's possible types to converge results.
2517 static bool ForceArbitraryInstResultType(TreePatternNode *N, TreePattern &TP) {
2521 // Analyze children.
2522 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2523 if (ForceArbitraryInstResultType(N->getChild(i), TP))
2526 if (!N->getOperator()->isSubClassOf("Instruction"))
2529 // If this type is already concrete or completely unknown we can't do
2531 for (unsigned i = 0, e = N->getNumTypes(); i != e; ++i) {
2532 if (N->getExtType(i).isCompletelyUnknown() || N->getExtType(i).isConcrete())
2535 // Otherwise, force its type to the first possibility (an arbitrary choice).
2536 if (N->getExtType(i).MergeInTypeInfo(N->getExtType(i).getTypeList()[0], TP))
2543 void CodeGenDAGPatterns::ParsePatterns() {
2544 std::vector<Record*> Patterns = Records.getAllDerivedDefinitions("Pattern");
2546 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {
2547 Record *CurPattern = Patterns[i];
2548 DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch");
2549 TreePattern *Pattern = new TreePattern(CurPattern, Tree, true, *this);
2551 // Inline pattern fragments into it.
2552 Pattern->InlinePatternFragments();
2554 ListInit *LI = CurPattern->getValueAsListInit("ResultInstrs");
2555 if (LI->getSize() == 0) continue; // no pattern.
2557 // Parse the instruction.
2558 TreePattern *Result = new TreePattern(CurPattern, LI, false, *this);
2560 // Inline pattern fragments into it.
2561 Result->InlinePatternFragments();
2563 if (Result->getNumTrees() != 1)
2564 Result->error("Cannot handle instructions producing instructions "
2565 "with temporaries yet!");
2567 bool IterateInference;
2568 bool InferredAllPatternTypes, InferredAllResultTypes;
2570 // Infer as many types as possible. If we cannot infer all of them, we
2571 // can never do anything with this pattern: report it to the user.
2572 InferredAllPatternTypes =
2573 Pattern->InferAllTypes(&Pattern->getNamedNodesMap());
2575 // Infer as many types as possible. If we cannot infer all of them, we
2576 // can never do anything with this pattern: report it to the user.
2577 InferredAllResultTypes =
2578 Result->InferAllTypes(&Pattern->getNamedNodesMap());
2580 IterateInference = false;
2582 // Apply the type of the result to the source pattern. This helps us
2583 // resolve cases where the input type is known to be a pointer type (which
2584 // is considered resolved), but the result knows it needs to be 32- or
2585 // 64-bits. Infer the other way for good measure.
2586 for (unsigned i = 0, e = std::min(Result->getTree(0)->getNumTypes(),
2587 Pattern->getTree(0)->getNumTypes());
2589 IterateInference = Pattern->getTree(0)->
2590 UpdateNodeType(i, Result->getTree(0)->getExtType(i), *Result);
2591 IterateInference |= Result->getTree(0)->
2592 UpdateNodeType(i, Pattern->getTree(0)->getExtType(i), *Result);
2595 // If our iteration has converged and the input pattern's types are fully
2596 // resolved but the result pattern is not fully resolved, we may have a
2597 // situation where we have two instructions in the result pattern and
2598 // the instructions require a common register class, but don't care about
2599 // what actual MVT is used. This is actually a bug in our modelling:
2600 // output patterns should have register classes, not MVTs.
2602 // In any case, to handle this, we just go through and disambiguate some
2603 // arbitrary types to the result pattern's nodes.
2604 if (!IterateInference && InferredAllPatternTypes &&
2605 !InferredAllResultTypes)
2606 IterateInference = ForceArbitraryInstResultType(Result->getTree(0),
2608 } while (IterateInference);
2610 // Verify that we inferred enough types that we can do something with the
2611 // pattern and result. If these fire the user has to add type casts.
2612 if (!InferredAllPatternTypes)
2613 Pattern->error("Could not infer all types in pattern!");
2614 if (!InferredAllResultTypes) {
2616 Result->error("Could not infer all types in pattern result!");
2619 // Validate that the input pattern is correct.
2620 std::map<std::string, TreePatternNode*> InstInputs;
2621 std::map<std::string, TreePatternNode*> InstResults;
2622 std::vector<Record*> InstImpInputs;
2623 std::vector<Record*> InstImpResults;
2624 for (unsigned j = 0, ee = Pattern->getNumTrees(); j != ee; ++j)
2625 FindPatternInputsAndOutputs(Pattern, Pattern->getTree(j),
2626 InstInputs, InstResults,
2627 InstImpInputs, InstImpResults);
2629 // Promote the xform function to be an explicit node if set.
2630 TreePatternNode *DstPattern = Result->getOnlyTree();
2631 std::vector<TreePatternNode*> ResultNodeOperands;
2632 for (unsigned ii = 0, ee = DstPattern->getNumChildren(); ii != ee; ++ii) {
2633 TreePatternNode *OpNode = DstPattern->getChild(ii);
2634 if (Record *Xform = OpNode->getTransformFn()) {
2635 OpNode->setTransformFn(0);
2636 std::vector<TreePatternNode*> Children;
2637 Children.push_back(OpNode);
2638 OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes());
2640 ResultNodeOperands.push_back(OpNode);
2642 DstPattern = Result->getOnlyTree();
2643 if (!DstPattern->isLeaf())
2644 DstPattern = new TreePatternNode(DstPattern->getOperator(),
2646 DstPattern->getNumTypes());
2648 for (unsigned i = 0, e = Result->getOnlyTree()->getNumTypes(); i != e; ++i)
2649 DstPattern->setType(i, Result->getOnlyTree()->getExtType(i));
2651 TreePattern Temp(Result->getRecord(), DstPattern, false, *this);
2652 Temp.InferAllTypes();
2655 AddPatternToMatch(Pattern,
2656 PatternToMatch(CurPattern->getValueAsListInit("Predicates"),
2657 Pattern->getTree(0),
2658 Temp.getOnlyTree(), InstImpResults,
2659 CurPattern->getValueAsInt("AddedComplexity"),
2660 CurPattern->getID()));
2664 /// CombineChildVariants - Given a bunch of permutations of each child of the
2665 /// 'operator' node, put them together in all possible ways.
2666 static void CombineChildVariants(TreePatternNode *Orig,
2667 const std::vector<std::vector<TreePatternNode*> > &ChildVariants,
2668 std::vector<TreePatternNode*> &OutVariants,
2669 CodeGenDAGPatterns &CDP,
2670 const MultipleUseVarSet &DepVars) {
2671 // Make sure that each operand has at least one variant to choose from.
2672 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
2673 if (ChildVariants[i].empty())
2676 // The end result is an all-pairs construction of the resultant pattern.
2677 std::vector<unsigned> Idxs;
2678 Idxs.resize(ChildVariants.size());
2682 DEBUG(if (!Idxs.empty()) {
2683 errs() << Orig->getOperator()->getName() << ": Idxs = [ ";
2684 for (unsigned i = 0; i < Idxs.size(); ++i) {
2685 errs() << Idxs[i] << " ";
2690 // Create the variant and add it to the output list.
2691 std::vector<TreePatternNode*> NewChildren;
2692 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)
2693 NewChildren.push_back(ChildVariants[i][Idxs[i]]);
2694 TreePatternNode *R = new TreePatternNode(Orig->getOperator(), NewChildren,
2695 Orig->getNumTypes());
2697 // Copy over properties.
2698 R->setName(Orig->getName());
2699 R->setPredicateFns(Orig->getPredicateFns());
2700 R->setTransformFn(Orig->getTransformFn());
2701 for (unsigned i = 0, e = Orig->getNumTypes(); i != e; ++i)
2702 R->setType(i, Orig->getExtType(i));
2704 // If this pattern cannot match, do not include it as a variant.
2705 std::string ErrString;
2706 if (!R->canPatternMatch(ErrString, CDP)) {
2709 bool AlreadyExists = false;
2711 // Scan to see if this pattern has already been emitted. We can get
2712 // duplication due to things like commuting:
2713 // (and GPRC:$a, GPRC:$b) -> (and GPRC:$b, GPRC:$a)
2714 // which are the same pattern. Ignore the dups.
2715 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)
2716 if (R->isIsomorphicTo(OutVariants[i], DepVars)) {
2717 AlreadyExists = true;
2724 OutVariants.push_back(R);
2727 // Increment indices to the next permutation by incrementing the
2728 // indicies from last index backward, e.g., generate the sequence
2729 // [0, 0], [0, 1], [1, 0], [1, 1].
2731 for (IdxsIdx = Idxs.size() - 1; IdxsIdx >= 0; --IdxsIdx) {
2732 if (++Idxs[IdxsIdx] == ChildVariants[IdxsIdx].size())
2737 NotDone = (IdxsIdx >= 0);
2741 /// CombineChildVariants - A helper function for binary operators.
2743 static void CombineChildVariants(TreePatternNode *Orig,
2744 const std::vector<TreePatternNode*> &LHS,
2745 const std::vector<TreePatternNode*> &RHS,
2746 std::vector<TreePatternNode*> &OutVariants,
2747 CodeGenDAGPatterns &CDP,
2748 const MultipleUseVarSet &DepVars) {
2749 std::vector<std::vector<TreePatternNode*> > ChildVariants;
2750 ChildVariants.push_back(LHS);
2751 ChildVariants.push_back(RHS);
2752 CombineChildVariants(Orig, ChildVariants, OutVariants, CDP, DepVars);
2756 static void GatherChildrenOfAssociativeOpcode(TreePatternNode *N,
2757 std::vector<TreePatternNode *> &Children) {
2758 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
2759 Record *Operator = N->getOperator();
2761 // Only permit raw nodes.
2762 if (!N->getName().empty() || !N->getPredicateFns().empty() ||
2763 N->getTransformFn()) {
2764 Children.push_back(N);
2768 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
2769 Children.push_back(N->getChild(0));
2771 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
2773 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
2774 Children.push_back(N->getChild(1));
2776 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
2779 /// GenerateVariantsOf - Given a pattern N, generate all permutations we can of
2780 /// the (potentially recursive) pattern by using algebraic laws.
2782 static void GenerateVariantsOf(TreePatternNode *N,
2783 std::vector<TreePatternNode*> &OutVariants,
2784 CodeGenDAGPatterns &CDP,
2785 const MultipleUseVarSet &DepVars) {
2786 // We cannot permute leaves.
2788 OutVariants.push_back(N);
2792 // Look up interesting info about the node.
2793 const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(N->getOperator());
2795 // If this node is associative, re-associate.
2796 if (NodeInfo.hasProperty(SDNPAssociative)) {
2797 // Re-associate by pulling together all of the linked operators
2798 std::vector<TreePatternNode*> MaximalChildren;
2799 GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
2801 // Only handle child sizes of 3. Otherwise we'll end up trying too many
2803 if (MaximalChildren.size() == 3) {
2804 // Find the variants of all of our maximal children.
2805 std::vector<TreePatternNode*> AVariants, BVariants, CVariants;
2806 GenerateVariantsOf(MaximalChildren[0], AVariants, CDP, DepVars);
2807 GenerateVariantsOf(MaximalChildren[1], BVariants, CDP, DepVars);
2808 GenerateVariantsOf(MaximalChildren[2], CVariants, CDP, DepVars);
2810 // There are only two ways we can permute the tree:
2811 // (A op B) op C and A op (B op C)
2812 // Within these forms, we can also permute A/B/C.
2814 // Generate legal pair permutations of A/B/C.
2815 std::vector<TreePatternNode*> ABVariants;
2816 std::vector<TreePatternNode*> BAVariants;
2817 std::vector<TreePatternNode*> ACVariants;
2818 std::vector<TreePatternNode*> CAVariants;
2819 std::vector<TreePatternNode*> BCVariants;
2820 std::vector<TreePatternNode*> CBVariants;
2821 CombineChildVariants(N, AVariants, BVariants, ABVariants, CDP, DepVars);
2822 CombineChildVariants(N, BVariants, AVariants, BAVariants, CDP, DepVars);
2823 CombineChildVariants(N, AVariants, CVariants, ACVariants, CDP, DepVars);
2824 CombineChildVariants(N, CVariants, AVariants, CAVariants, CDP, DepVars);
2825 CombineChildVariants(N, BVariants, CVariants, BCVariants, CDP, DepVars);
2826 CombineChildVariants(N, CVariants, BVariants, CBVariants, CDP, DepVars);
2828 // Combine those into the result: (x op x) op x
2829 CombineChildVariants(N, ABVariants, CVariants, OutVariants, CDP, DepVars);
2830 CombineChildVariants(N, BAVariants, CVariants, OutVariants, CDP, DepVars);
2831 CombineChildVariants(N, ACVariants, BVariants, OutVariants, CDP, DepVars);
2832 CombineChildVariants(N, CAVariants, BVariants, OutVariants, CDP, DepVars);
2833 CombineChildVariants(N, BCVariants, AVariants, OutVariants, CDP, DepVars);
2834 CombineChildVariants(N, CBVariants, AVariants, OutVariants, CDP, DepVars);
2836 // Combine those into the result: x op (x op x)
2837 CombineChildVariants(N, CVariants, ABVariants, OutVariants, CDP, DepVars);
2838 CombineChildVariants(N, CVariants, BAVariants, OutVariants, CDP, DepVars);
2839 CombineChildVariants(N, BVariants, ACVariants, OutVariants, CDP, DepVars);
2840 CombineChildVariants(N, BVariants, CAVariants, OutVariants, CDP, DepVars);
2841 CombineChildVariants(N, AVariants, BCVariants, OutVariants, CDP, DepVars);
2842 CombineChildVariants(N, AVariants, CBVariants, OutVariants, CDP, DepVars);
2847 // Compute permutations of all children.
2848 std::vector<std::vector<TreePatternNode*> > ChildVariants;
2849 ChildVariants.resize(N->getNumChildren());
2850 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)
2851 GenerateVariantsOf(N->getChild(i), ChildVariants[i], CDP, DepVars);
2853 // Build all permutations based on how the children were formed.
2854 CombineChildVariants(N, ChildVariants, OutVariants, CDP, DepVars);
2856 // If this node is commutative, consider the commuted order.
2857 bool isCommIntrinsic = N->isCommutativeIntrinsic(CDP);
2858 if (NodeInfo.hasProperty(SDNPCommutative) || isCommIntrinsic) {
2859 assert((N->getNumChildren()==2 || isCommIntrinsic) &&
2860 "Commutative but doesn't have 2 children!");
2861 // Don't count children which are actually register references.
2863 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {
2864 TreePatternNode *Child = N->getChild(i);
2865 if (Child->isLeaf())
2866 if (DefInit *DI = dynamic_cast<DefInit*>(Child->getLeafValue())) {
2867 Record *RR = DI->getDef();
2868 if (RR->isSubClassOf("Register"))
2873 // Consider the commuted order.
2874 if (isCommIntrinsic) {
2875 // Commutative intrinsic. First operand is the intrinsic id, 2nd and 3rd
2876 // operands are the commutative operands, and there might be more operands
2879 "Commutative intrinsic should have at least 3 childrean!");
2880 std::vector<std::vector<TreePatternNode*> > Variants;
2881 Variants.push_back(ChildVariants[0]); // Intrinsic id.
2882 Variants.push_back(ChildVariants[2]);
2883 Variants.push_back(ChildVariants[1]);
2884 for (unsigned i = 3; i != NC; ++i)
2885 Variants.push_back(ChildVariants[i]);
2886 CombineChildVariants(N, Variants, OutVariants, CDP, DepVars);
2888 CombineChildVariants(N, ChildVariants[1], ChildVariants[0],
2889 OutVariants, CDP, DepVars);
2894 // GenerateVariants - Generate variants. For example, commutative patterns can
2895 // match multiple ways. Add them to PatternsToMatch as well.
2896 void CodeGenDAGPatterns::GenerateVariants() {
2897 DEBUG(errs() << "Generating instruction variants.\n");
2899 // Loop over all of the patterns we've collected, checking to see if we can
2900 // generate variants of the instruction, through the exploitation of
2901 // identities. This permits the target to provide aggressive matching without
2902 // the .td file having to contain tons of variants of instructions.
2904 // Note that this loop adds new patterns to the PatternsToMatch list, but we
2905 // intentionally do not reconsider these. Any variants of added patterns have
2906 // already been added.
2908 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {
2909 MultipleUseVarSet DepVars;
2910 std::vector<TreePatternNode*> Variants;
2911 FindDepVars(PatternsToMatch[i].getSrcPattern(), DepVars);
2912 DEBUG(errs() << "Dependent/multiply used variables: ");
2913 DEBUG(DumpDepVars(DepVars));
2914 DEBUG(errs() << "\n");
2915 GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this, DepVars);
2917 assert(!Variants.empty() && "Must create at least original variant!");
2918 Variants.erase(Variants.begin()); // Remove the original pattern.
2920 if (Variants.empty()) // No variants for this pattern.
2923 DEBUG(errs() << "FOUND VARIANTS OF: ";
2924 PatternsToMatch[i].getSrcPattern()->dump();
2927 for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
2928 TreePatternNode *Variant = Variants[v];
2930 DEBUG(errs() << " VAR#" << v << ": ";
2934 // Scan to see if an instruction or explicit pattern already matches this.
2935 bool AlreadyExists = false;
2936 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {
2937 // Skip if the top level predicates do not match.
2938 if (PatternsToMatch[i].getPredicates() !=
2939 PatternsToMatch[p].getPredicates())
2941 // Check to see if this variant already exists.
2942 if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern(), DepVars)) {
2943 DEBUG(errs() << " *** ALREADY EXISTS, ignoring variant.\n");
2944 AlreadyExists = true;
2948 // If we already have it, ignore the variant.
2949 if (AlreadyExists) continue;
2951 // Otherwise, add it to the list of patterns we have.
2953 push_back(PatternToMatch(PatternsToMatch[i].getPredicates(),
2954 Variant, PatternsToMatch[i].getDstPattern(),
2955 PatternsToMatch[i].getDstRegs(),
2956 PatternsToMatch[i].getAddedComplexity(),
2957 Record::getNewUID()));
2960 DEBUG(errs() << "\n");