1 //===- CodeGenDAGPatterns.h - Read DAG patterns from .td file ---*- C++ -*-===//
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 declares the CodeGenDAGPatterns class, which is used to read and
11 // represent the patterns present in a .td file for instructions.
13 //===----------------------------------------------------------------------===//
15 #ifndef CODEGEN_DAGPATTERNS_H
16 #define CODEGEN_DAGPATTERNS_H
18 #include "CodeGenTarget.h"
19 #include "CodeGenIntrinsics.h"
20 #include "llvm/ADT/SmallVector.h"
21 #include "llvm/ADT/StringMap.h"
34 class TreePatternNode;
35 class CodeGenDAGPatterns;
38 /// EEVT::DAGISelGenValueType - These are some extended forms of
39 /// MVT::SimpleValueType that we use as lattice values during type inference.
40 /// The existing MVT iAny, fAny and vAny types suffice to represent
41 /// arbitrary integer, floating-point, and vector types, so only an unknown
44 /// TypeSet - This is either empty if it's completely unknown, or holds a set
45 /// of types. It is used during type inference because register classes can
46 /// have multiple possible types and we don't know which one they get until
47 /// type inference is complete.
49 /// TypeSet can have three states:
50 /// Vector is empty: The type is completely unknown, it can be any valid
52 /// Vector has multiple constrained types: (e.g. v4i32 + v4f32) it is one
53 /// of those types only.
54 /// Vector has one concrete type: The type is completely known.
57 SmallVector<MVT::SimpleValueType, 4> TypeVec;
60 TypeSet(MVT::SimpleValueType VT, TreePattern &TP);
61 TypeSet(const std::vector<MVT::SimpleValueType> &VTList);
63 bool isCompletelyUnknown() const { return TypeVec.empty(); }
65 bool isConcrete() const {
66 if (TypeVec.size() != 1) return false;
67 unsigned char T = TypeVec[0]; (void)T;
68 assert(T < MVT::LAST_VALUETYPE || T == MVT::iPTR || T == MVT::iPTRAny);
72 MVT::SimpleValueType getConcrete() const {
73 assert(isConcrete() && "Type isn't concrete yet");
74 return (MVT::SimpleValueType)TypeVec[0];
77 bool isDynamicallyResolved() const {
78 return getConcrete() == MVT::iPTR || getConcrete() == MVT::iPTRAny;
81 const SmallVectorImpl<MVT::SimpleValueType> &getTypeList() const {
82 assert(!TypeVec.empty() && "Not a type list!");
87 return TypeVec.size() == 1 && TypeVec[0] == MVT::isVoid;
90 /// hasIntegerTypes - Return true if this TypeSet contains any integer value
92 bool hasIntegerTypes() const;
94 /// hasFloatingPointTypes - Return true if this TypeSet contains an fAny or
95 /// a floating point value type.
96 bool hasFloatingPointTypes() const;
98 /// hasVectorTypes - Return true if this TypeSet contains a vector value
100 bool hasVectorTypes() const;
102 /// getName() - Return this TypeSet as a string.
103 std::string getName() const;
105 /// MergeInTypeInfo - This merges in type information from the specified
106 /// argument. If 'this' changes, it returns true. If the two types are
107 /// contradictory (e.g. merge f32 into i32) then this throws an exception.
108 bool MergeInTypeInfo(const EEVT::TypeSet &InVT, TreePattern &TP);
110 bool MergeInTypeInfo(MVT::SimpleValueType InVT, TreePattern &TP) {
111 return MergeInTypeInfo(EEVT::TypeSet(InVT, TP), TP);
114 /// Force this type list to only contain integer types.
115 bool EnforceInteger(TreePattern &TP);
117 /// Force this type list to only contain floating point types.
118 bool EnforceFloatingPoint(TreePattern &TP);
120 /// EnforceScalar - Remove all vector types from this type list.
121 bool EnforceScalar(TreePattern &TP);
123 /// EnforceVector - Remove all non-vector types from this type list.
124 bool EnforceVector(TreePattern &TP);
126 /// EnforceSmallerThan - 'this' must be a smaller VT than Other. Update
127 /// this an other based on this information.
128 bool EnforceSmallerThan(EEVT::TypeSet &Other, TreePattern &TP);
130 /// EnforceVectorEltTypeIs - 'this' is now constrainted to be a vector type
131 /// whose element is VT.
132 bool EnforceVectorEltTypeIs(EEVT::TypeSet &VT, TreePattern &TP);
134 /// EnforceVectorSubVectorTypeIs - 'this' is now constrainted to
135 /// be a vector type VT.
136 bool EnforceVectorSubVectorTypeIs(EEVT::TypeSet &VT, TreePattern &TP);
138 bool operator!=(const TypeSet &RHS) const { return TypeVec != RHS.TypeVec; }
139 bool operator==(const TypeSet &RHS) const { return TypeVec == RHS.TypeVec; }
142 /// FillWithPossibleTypes - Set to all legal types and return true, only
143 /// valid on completely unknown type sets. If Pred is non-null, only MVTs
144 /// that pass the predicate are added.
145 bool FillWithPossibleTypes(TreePattern &TP,
146 bool (*Pred)(MVT::SimpleValueType) = 0,
147 const char *PredicateName = 0);
151 /// Set type used to track multiply used variables in patterns
152 typedef std::set<std::string> MultipleUseVarSet;
154 /// SDTypeConstraint - This is a discriminated union of constraints,
155 /// corresponding to the SDTypeConstraint tablegen class in Target.td.
156 struct SDTypeConstraint {
157 SDTypeConstraint(Record *R);
159 unsigned OperandNo; // The operand # this constraint applies to.
161 SDTCisVT, SDTCisPtrTy, SDTCisInt, SDTCisFP, SDTCisVec, SDTCisSameAs,
162 SDTCisVTSmallerThanOp, SDTCisOpSmallerThanOp, SDTCisEltOfVec,
166 union { // The discriminated union.
168 MVT::SimpleValueType VT;
171 unsigned OtherOperandNum;
174 unsigned OtherOperandNum;
175 } SDTCisVTSmallerThanOp_Info;
177 unsigned BigOperandNum;
178 } SDTCisOpSmallerThanOp_Info;
180 unsigned OtherOperandNum;
181 } SDTCisEltOfVec_Info;
183 unsigned OtherOperandNum;
184 } SDTCisSubVecOfVec_Info;
187 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
188 /// constraint to the nodes operands. This returns true if it makes a
189 /// change, false otherwise. If a type contradiction is found, throw an
191 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
192 TreePattern &TP) const;
195 /// SDNodeInfo - One of these records is created for each SDNode instance in
196 /// the target .td file. This represents the various dag nodes we will be
200 std::string EnumName;
201 std::string SDClassName;
205 std::vector<SDTypeConstraint> TypeConstraints;
207 SDNodeInfo(Record *R); // Parse the specified record.
209 unsigned getNumResults() const { return NumResults; }
211 /// getNumOperands - This is the number of operands required or -1 if
213 int getNumOperands() const { return NumOperands; }
214 Record *getRecord() const { return Def; }
215 const std::string &getEnumName() const { return EnumName; }
216 const std::string &getSDClassName() const { return SDClassName; }
218 const std::vector<SDTypeConstraint> &getTypeConstraints() const {
219 return TypeConstraints;
222 /// getKnownType - If the type constraints on this node imply a fixed type
223 /// (e.g. all stores return void, etc), then return it as an
224 /// MVT::SimpleValueType. Otherwise, return MVT::Other.
225 MVT::SimpleValueType getKnownType(unsigned ResNo) const;
227 /// hasProperty - Return true if this node has the specified property.
229 bool hasProperty(enum SDNP Prop) const { return Properties & (1 << Prop); }
231 /// ApplyTypeConstraints - Given a node in a pattern, apply the type
232 /// constraints for this node to the operands of the node. This returns
233 /// true if it makes a change, false otherwise. If a type contradiction is
234 /// found, throw an exception.
235 bool ApplyTypeConstraints(TreePatternNode *N, TreePattern &TP) const {
236 bool MadeChange = false;
237 for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i)
238 MadeChange |= TypeConstraints[i].ApplyTypeConstraint(N, *this, TP);
243 /// TreePredicateFn - This is an abstraction that represents the predicates on
244 /// a PatFrag node. This is a simple one-word wrapper around a pointer to
245 /// provide nice accessors.
246 class TreePredicateFn {
247 /// PatFragRec - This is the TreePattern for the PatFrag that we
248 /// originally came from.
249 TreePattern *PatFragRec;
251 /// TreePredicateFn constructor. Here 'N' is a subclass of PatFrag.
252 TreePredicateFn(TreePattern *N) : PatFragRec(N) {}
255 TreePattern *getOrigPatFragRecord() const { return PatFragRec; }
257 /// isAlwaysTrue - Return true if this is a noop predicate.
258 bool isAlwaysTrue() const;
261 bool operator==(const TreePredicateFn &RHS) const {
262 return PatFragRec == RHS.PatFragRec;
265 bool operator!=(const TreePredicateFn &RHS) const { return !(*this == RHS); }
267 /// Return the name to use in the generated code to reference this, this is
268 /// "Predicate_foo" if from a pattern fragment "foo".
269 std::string getFnName() const;
271 /// getCodeToRunOnSDNode - Return the code for the function body that
272 /// evaluates this predicate. The argument is expected to be in "Node",
273 /// not N. This handles casting and conversion to a concrete node type as
275 std::string getCodeToRunOnSDNode() const;
278 std::string getPredCode() const;
282 /// FIXME: TreePatternNode's can be shared in some cases (due to dag-shaped
283 /// patterns), and as such should be ref counted. We currently just leak all
284 /// TreePatternNode objects!
285 class TreePatternNode {
286 /// The type of each node result. Before and during type inference, each
287 /// result may be a set of possible types. After (successful) type inference,
288 /// each is a single concrete type.
289 SmallVector<EEVT::TypeSet, 1> Types;
291 /// Operator - The Record for the operator if this is an interior node (not
295 /// Val - The init value (e.g. the "GPRC" record, or "7") for a leaf.
299 /// Name - The name given to this node with the :$foo notation.
303 /// PredicateFns - The predicate functions to execute on this node to check
304 /// for a match. If this list is empty, no predicate is involved.
305 std::vector<TreePredicateFn> PredicateFns;
307 /// TransformFn - The transformation function to execute on this node before
308 /// it can be substituted into the resulting instruction on a pattern match.
311 std::vector<TreePatternNode*> Children;
313 TreePatternNode(Record *Op, const std::vector<TreePatternNode*> &Ch,
315 : Operator(Op), Val(0), TransformFn(0), Children(Ch) {
316 Types.resize(NumResults);
318 TreePatternNode(Init *val, unsigned NumResults) // leaf ctor
319 : Operator(0), Val(val), TransformFn(0) {
320 Types.resize(NumResults);
324 const std::string &getName() const { return Name; }
325 void setName(StringRef N) { Name.assign(N.begin(), N.end()); }
327 bool isLeaf() const { return Val != 0; }
330 unsigned getNumTypes() const { return Types.size(); }
331 MVT::SimpleValueType getType(unsigned ResNo) const {
332 return Types[ResNo].getConcrete();
334 const SmallVectorImpl<EEVT::TypeSet> &getExtTypes() const { return Types; }
335 const EEVT::TypeSet &getExtType(unsigned ResNo) const { return Types[ResNo]; }
336 EEVT::TypeSet &getExtType(unsigned ResNo) { return Types[ResNo]; }
337 void setType(unsigned ResNo, const EEVT::TypeSet &T) { Types[ResNo] = T; }
339 bool hasTypeSet(unsigned ResNo) const {
340 return Types[ResNo].isConcrete();
342 bool isTypeCompletelyUnknown(unsigned ResNo) const {
343 return Types[ResNo].isCompletelyUnknown();
345 bool isTypeDynamicallyResolved(unsigned ResNo) const {
346 return Types[ResNo].isDynamicallyResolved();
349 Init *getLeafValue() const { assert(isLeaf()); return Val; }
350 Record *getOperator() const { assert(!isLeaf()); return Operator; }
352 unsigned getNumChildren() const { return Children.size(); }
353 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
354 void setChild(unsigned i, TreePatternNode *N) {
358 /// hasChild - Return true if N is any of our children.
359 bool hasChild(const TreePatternNode *N) const {
360 for (unsigned i = 0, e = Children.size(); i != e; ++i)
361 if (Children[i] == N) return true;
365 bool hasAnyPredicate() const { return !PredicateFns.empty(); }
367 const std::vector<TreePredicateFn> &getPredicateFns() const {
370 void clearPredicateFns() { PredicateFns.clear(); }
371 void setPredicateFns(const std::vector<TreePredicateFn> &Fns) {
372 assert(PredicateFns.empty() && "Overwriting non-empty predicate list!");
375 void addPredicateFn(const TreePredicateFn &Fn) {
376 assert(!Fn.isAlwaysTrue() && "Empty predicate string!");
377 if (std::find(PredicateFns.begin(), PredicateFns.end(), Fn) ==
379 PredicateFns.push_back(Fn);
382 Record *getTransformFn() const { return TransformFn; }
383 void setTransformFn(Record *Fn) { TransformFn = Fn; }
385 /// getIntrinsicInfo - If this node corresponds to an intrinsic, return the
386 /// CodeGenIntrinsic information for it, otherwise return a null pointer.
387 const CodeGenIntrinsic *getIntrinsicInfo(const CodeGenDAGPatterns &CDP) const;
389 /// getComplexPatternInfo - If this node corresponds to a ComplexPattern,
390 /// return the ComplexPattern information, otherwise return null.
391 const ComplexPattern *
392 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
394 /// NodeHasProperty - Return true if this node has the specified property.
395 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
397 /// TreeHasProperty - Return true if any node in this tree has the specified
399 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
401 /// isCommutativeIntrinsic - Return true if the node is an intrinsic which is
402 /// marked isCommutative.
403 bool isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const;
405 void print(raw_ostream &OS) const;
408 public: // Higher level manipulation routines.
410 /// clone - Return a new copy of this tree.
412 TreePatternNode *clone() const;
414 /// RemoveAllTypes - Recursively strip all the types of this tree.
415 void RemoveAllTypes();
417 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
418 /// the specified node. For this comparison, all of the state of the node
419 /// is considered, except for the assigned name. Nodes with differing names
420 /// that are otherwise identical are considered isomorphic.
421 bool isIsomorphicTo(const TreePatternNode *N,
422 const MultipleUseVarSet &DepVars) const;
424 /// SubstituteFormalArguments - Replace the formal arguments in this tree
425 /// with actual values specified by ArgMap.
426 void SubstituteFormalArguments(std::map<std::string,
427 TreePatternNode*> &ArgMap);
429 /// InlinePatternFragments - If this pattern refers to any pattern
430 /// fragments, inline them into place, giving us a pattern without any
431 /// PatFrag references.
432 TreePatternNode *InlinePatternFragments(TreePattern &TP);
434 /// ApplyTypeConstraints - Apply all of the type constraints relevant to
435 /// this node and its children in the tree. This returns true if it makes a
436 /// change, false otherwise. If a type contradiction is found, throw an
438 bool ApplyTypeConstraints(TreePattern &TP, bool NotRegisters);
440 /// UpdateNodeType - Set the node type of N to VT if VT contains
441 /// information. If N already contains a conflicting type, then throw an
442 /// exception. This returns true if any information was updated.
444 bool UpdateNodeType(unsigned ResNo, const EEVT::TypeSet &InTy,
446 return Types[ResNo].MergeInTypeInfo(InTy, TP);
449 bool UpdateNodeType(unsigned ResNo, MVT::SimpleValueType InTy,
451 return Types[ResNo].MergeInTypeInfo(EEVT::TypeSet(InTy, TP), TP);
454 /// ContainsUnresolvedType - Return true if this tree contains any
455 /// unresolved types.
456 bool ContainsUnresolvedType() const {
457 for (unsigned i = 0, e = Types.size(); i != e; ++i)
458 if (!Types[i].isConcrete()) return true;
460 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
461 if (getChild(i)->ContainsUnresolvedType()) return true;
465 /// canPatternMatch - If it is impossible for this pattern to match on this
466 /// target, fill in Reason and return false. Otherwise, return true.
467 bool canPatternMatch(std::string &Reason, const CodeGenDAGPatterns &CDP);
470 inline raw_ostream &operator<<(raw_ostream &OS, const TreePatternNode &TPN) {
476 /// TreePattern - Represent a pattern, used for instructions, pattern
480 /// Trees - The list of pattern trees which corresponds to this pattern.
481 /// Note that PatFrag's only have a single tree.
483 std::vector<TreePatternNode*> Trees;
485 /// NamedNodes - This is all of the nodes that have names in the trees in this
487 StringMap<SmallVector<TreePatternNode*,1> > NamedNodes;
489 /// TheRecord - The actual TableGen record corresponding to this pattern.
493 /// Args - This is a list of all of the arguments to this pattern (for
494 /// PatFrag patterns), which are the 'node' markers in this pattern.
495 std::vector<std::string> Args;
497 /// CDP - the top-level object coordinating this madness.
499 CodeGenDAGPatterns &CDP;
501 /// isInputPattern - True if this is an input pattern, something to match.
502 /// False if this is an output pattern, something to emit.
506 /// TreePattern constructor - Parse the specified DagInits into the
508 TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
509 CodeGenDAGPatterns &ise);
510 TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
511 CodeGenDAGPatterns &ise);
512 TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
513 CodeGenDAGPatterns &ise);
515 /// getTrees - Return the tree patterns which corresponds to this pattern.
517 const std::vector<TreePatternNode*> &getTrees() const { return Trees; }
518 unsigned getNumTrees() const { return Trees.size(); }
519 TreePatternNode *getTree(unsigned i) const { return Trees[i]; }
520 TreePatternNode *getOnlyTree() const {
521 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!");
525 const StringMap<SmallVector<TreePatternNode*,1> > &getNamedNodesMap() {
526 if (NamedNodes.empty())
531 /// getRecord - Return the actual TableGen record corresponding to this
534 Record *getRecord() const { return TheRecord; }
536 unsigned getNumArgs() const { return Args.size(); }
537 const std::string &getArgName(unsigned i) const {
538 assert(i < Args.size() && "Argument reference out of range!");
541 std::vector<std::string> &getArgList() { return Args; }
543 CodeGenDAGPatterns &getDAGPatterns() const { return CDP; }
545 /// InlinePatternFragments - If this pattern refers to any pattern
546 /// fragments, inline them into place, giving us a pattern without any
547 /// PatFrag references.
548 void InlinePatternFragments() {
549 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
550 Trees[i] = Trees[i]->InlinePatternFragments(*this);
553 /// InferAllTypes - Infer/propagate as many types throughout the expression
554 /// patterns as possible. Return true if all types are inferred, false
555 /// otherwise. Throw an exception if a type contradiction is found.
556 bool InferAllTypes(const StringMap<SmallVector<TreePatternNode*,1> >
559 /// error - Throw an exception, prefixing it with information about this
561 void error(const std::string &Msg) const;
563 void print(raw_ostream &OS) const;
567 TreePatternNode *ParseTreePattern(Init *DI, StringRef OpName);
568 void ComputeNamedNodes();
569 void ComputeNamedNodes(TreePatternNode *N);
572 /// DAGDefaultOperand - One of these is created for each PredicateOperand
573 /// or OptionalDefOperand that has a set ExecuteAlways / DefaultOps field.
574 struct DAGDefaultOperand {
575 std::vector<TreePatternNode*> DefaultOps;
578 class DAGInstruction {
579 TreePattern *Pattern;
580 std::vector<Record*> Results;
581 std::vector<Record*> Operands;
582 std::vector<Record*> ImpResults;
583 TreePatternNode *ResultPattern;
585 DAGInstruction(TreePattern *TP,
586 const std::vector<Record*> &results,
587 const std::vector<Record*> &operands,
588 const std::vector<Record*> &impresults)
589 : Pattern(TP), Results(results), Operands(operands),
590 ImpResults(impresults), ResultPattern(0) {}
592 const TreePattern *getPattern() const { return Pattern; }
593 unsigned getNumResults() const { return Results.size(); }
594 unsigned getNumOperands() const { return Operands.size(); }
595 unsigned getNumImpResults() const { return ImpResults.size(); }
596 const std::vector<Record*>& getImpResults() const { return ImpResults; }
598 void setResultPattern(TreePatternNode *R) { ResultPattern = R; }
600 Record *getResult(unsigned RN) const {
601 assert(RN < Results.size());
605 Record *getOperand(unsigned ON) const {
606 assert(ON < Operands.size());
610 Record *getImpResult(unsigned RN) const {
611 assert(RN < ImpResults.size());
612 return ImpResults[RN];
615 TreePatternNode *getResultPattern() const { return ResultPattern; }
618 /// PatternToMatch - Used by CodeGenDAGPatterns to keep tab of patterns
619 /// processed to produce isel.
620 class PatternToMatch {
622 PatternToMatch(Record *srcrecord, ListInit *preds,
623 TreePatternNode *src, TreePatternNode *dst,
624 const std::vector<Record*> &dstregs,
625 unsigned complexity, unsigned uid)
626 : SrcRecord(srcrecord), Predicates(preds), SrcPattern(src), DstPattern(dst),
627 Dstregs(dstregs), AddedComplexity(complexity), ID(uid) {}
629 Record *SrcRecord; // Originating Record for the pattern.
630 ListInit *Predicates; // Top level predicate conditions to match.
631 TreePatternNode *SrcPattern; // Source pattern to match.
632 TreePatternNode *DstPattern; // Resulting pattern.
633 std::vector<Record*> Dstregs; // Physical register defs being matched.
634 unsigned AddedComplexity; // Add to matching pattern complexity.
635 unsigned ID; // Unique ID for the record.
637 Record *getSrcRecord() const { return SrcRecord; }
638 ListInit *getPredicates() const { return Predicates; }
639 TreePatternNode *getSrcPattern() const { return SrcPattern; }
640 TreePatternNode *getDstPattern() const { return DstPattern; }
641 const std::vector<Record*> &getDstRegs() const { return Dstregs; }
642 unsigned getAddedComplexity() const { return AddedComplexity; }
644 std::string getPredicateCheck() const;
646 /// Compute the complexity metric for the input pattern. This roughly
647 /// corresponds to the number of nodes that are covered.
648 unsigned getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
651 // Deterministic comparison of Record*.
652 struct RecordPtrCmp {
653 bool operator()(const Record *LHS, const Record *RHS) const;
656 class CodeGenDAGPatterns {
657 RecordKeeper &Records;
658 CodeGenTarget Target;
659 std::vector<CodeGenIntrinsic> Intrinsics;
660 std::vector<CodeGenIntrinsic> TgtIntrinsics;
662 std::map<Record*, SDNodeInfo, RecordPtrCmp> SDNodes;
663 std::map<Record*, std::pair<Record*, std::string>, RecordPtrCmp> SDNodeXForms;
664 std::map<Record*, ComplexPattern, RecordPtrCmp> ComplexPatterns;
665 std::map<Record*, TreePattern*, RecordPtrCmp> PatternFragments;
666 std::map<Record*, DAGDefaultOperand, RecordPtrCmp> DefaultOperands;
667 std::map<Record*, DAGInstruction, RecordPtrCmp> Instructions;
669 // Specific SDNode definitions:
670 Record *intrinsic_void_sdnode;
671 Record *intrinsic_w_chain_sdnode, *intrinsic_wo_chain_sdnode;
673 /// PatternsToMatch - All of the things we are matching on the DAG. The first
674 /// value is the pattern to match, the second pattern is the result to
676 std::vector<PatternToMatch> PatternsToMatch;
678 CodeGenDAGPatterns(RecordKeeper &R);
679 ~CodeGenDAGPatterns();
681 CodeGenTarget &getTargetInfo() { return Target; }
682 const CodeGenTarget &getTargetInfo() const { return Target; }
684 Record *getSDNodeNamed(const std::string &Name) const;
686 const SDNodeInfo &getSDNodeInfo(Record *R) const {
687 assert(SDNodes.count(R) && "Unknown node!");
688 return SDNodes.find(R)->second;
691 // Node transformation lookups.
692 typedef std::pair<Record*, std::string> NodeXForm;
693 const NodeXForm &getSDNodeTransform(Record *R) const {
694 assert(SDNodeXForms.count(R) && "Invalid transform!");
695 return SDNodeXForms.find(R)->second;
698 typedef std::map<Record*, NodeXForm, RecordPtrCmp>::const_iterator
700 nx_iterator nx_begin() const { return SDNodeXForms.begin(); }
701 nx_iterator nx_end() const { return SDNodeXForms.end(); }
704 const ComplexPattern &getComplexPattern(Record *R) const {
705 assert(ComplexPatterns.count(R) && "Unknown addressing mode!");
706 return ComplexPatterns.find(R)->second;
709 const CodeGenIntrinsic &getIntrinsic(Record *R) const {
710 for (unsigned i = 0, e = Intrinsics.size(); i != e; ++i)
711 if (Intrinsics[i].TheDef == R) return Intrinsics[i];
712 for (unsigned i = 0, e = TgtIntrinsics.size(); i != e; ++i)
713 if (TgtIntrinsics[i].TheDef == R) return TgtIntrinsics[i];
714 assert(0 && "Unknown intrinsic!");
718 const CodeGenIntrinsic &getIntrinsicInfo(unsigned IID) const {
719 if (IID-1 < Intrinsics.size())
720 return Intrinsics[IID-1];
721 if (IID-Intrinsics.size()-1 < TgtIntrinsics.size())
722 return TgtIntrinsics[IID-Intrinsics.size()-1];
723 assert(0 && "Bad intrinsic ID!");
727 unsigned getIntrinsicID(Record *R) const {
728 for (unsigned i = 0, e = Intrinsics.size(); i != e; ++i)
729 if (Intrinsics[i].TheDef == R) return i;
730 for (unsigned i = 0, e = TgtIntrinsics.size(); i != e; ++i)
731 if (TgtIntrinsics[i].TheDef == R) return i + Intrinsics.size();
732 assert(0 && "Unknown intrinsic!");
736 const DAGDefaultOperand &getDefaultOperand(Record *R) const {
737 assert(DefaultOperands.count(R) &&"Isn't an analyzed default operand!");
738 return DefaultOperands.find(R)->second;
741 // Pattern Fragment information.
742 TreePattern *getPatternFragment(Record *R) const {
743 assert(PatternFragments.count(R) && "Invalid pattern fragment request!");
744 return PatternFragments.find(R)->second;
746 TreePattern *getPatternFragmentIfRead(Record *R) const {
747 if (!PatternFragments.count(R)) return 0;
748 return PatternFragments.find(R)->second;
751 typedef std::map<Record*, TreePattern*, RecordPtrCmp>::const_iterator
753 pf_iterator pf_begin() const { return PatternFragments.begin(); }
754 pf_iterator pf_end() const { return PatternFragments.end(); }
756 // Patterns to match information.
757 typedef std::vector<PatternToMatch>::const_iterator ptm_iterator;
758 ptm_iterator ptm_begin() const { return PatternsToMatch.begin(); }
759 ptm_iterator ptm_end() const { return PatternsToMatch.end(); }
763 const DAGInstruction &getInstruction(Record *R) const {
764 assert(Instructions.count(R) && "Unknown instruction!");
765 return Instructions.find(R)->second;
768 Record *get_intrinsic_void_sdnode() const {
769 return intrinsic_void_sdnode;
771 Record *get_intrinsic_w_chain_sdnode() const {
772 return intrinsic_w_chain_sdnode;
774 Record *get_intrinsic_wo_chain_sdnode() const {
775 return intrinsic_wo_chain_sdnode;
778 bool hasTargetIntrinsics() { return !TgtIntrinsics.empty(); }
781 void ParseNodeInfo();
782 void ParseNodeTransforms();
783 void ParseComplexPatterns();
784 void ParsePatternFragments();
785 void ParseDefaultOperands();
786 void ParseInstructions();
787 void ParsePatterns();
788 void InferInstructionFlags();
789 void GenerateVariants();
791 void AddPatternToMatch(const TreePattern *Pattern, const PatternToMatch &PTM);
792 void FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
793 std::map<std::string,
794 TreePatternNode*> &InstInputs,
795 std::map<std::string,
796 TreePatternNode*> &InstResults,
797 std::vector<Record*> &InstImpResults);
799 } // end namespace llvm