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 "CodeGenIntrinsics.h"
19 #include "CodeGenTarget.h"
20 #include "llvm/ADT/SmallVector.h"
21 #include "llvm/ADT/StringMap.h"
22 #include "llvm/Support/ErrorHandling.h"
35 class TreePatternNode;
36 class CodeGenDAGPatterns;
39 /// EEVT::DAGISelGenValueType - These are some extended forms of
40 /// MVT::SimpleValueType that we use as lattice values during type inference.
41 /// The existing MVT iAny, fAny and vAny types suffice to represent
42 /// arbitrary integer, floating-point, and vector types, so only an unknown
45 /// TypeSet - This is either empty if it's completely unknown, or holds a set
46 /// of types. It is used during type inference because register classes can
47 /// have multiple possible types and we don't know which one they get until
48 /// type inference is complete.
50 /// TypeSet can have three states:
51 /// Vector is empty: The type is completely unknown, it can be any valid
53 /// Vector has multiple constrained types: (e.g. v4i32 + v4f32) it is one
54 /// of those types only.
55 /// Vector has one concrete type: The type is completely known.
58 SmallVector<MVT::SimpleValueType, 4> TypeVec;
61 TypeSet(MVT::SimpleValueType VT, TreePattern &TP);
62 TypeSet(const std::vector<MVT::SimpleValueType> &VTList);
64 bool isCompletelyUnknown() const { return TypeVec.empty(); }
66 bool isConcrete() const {
67 if (TypeVec.size() != 1) return false;
68 unsigned char T = TypeVec[0]; (void)T;
69 assert(T < MVT::LAST_VALUETYPE || T == MVT::iPTR || T == MVT::iPTRAny);
73 MVT::SimpleValueType getConcrete() const {
74 assert(isConcrete() && "Type isn't concrete yet");
75 return (MVT::SimpleValueType)TypeVec[0];
78 bool isDynamicallyResolved() const {
79 return getConcrete() == MVT::iPTR || getConcrete() == MVT::iPTRAny;
82 const SmallVectorImpl<MVT::SimpleValueType> &getTypeList() const {
83 assert(!TypeVec.empty() && "Not a type list!");
88 return TypeVec.size() == 1 && TypeVec[0] == MVT::isVoid;
91 /// hasIntegerTypes - Return true if this TypeSet contains any integer value
93 bool hasIntegerTypes() const;
95 /// hasFloatingPointTypes - Return true if this TypeSet contains an fAny or
96 /// a floating point value type.
97 bool hasFloatingPointTypes() const;
99 /// hasVectorTypes - Return true if this TypeSet contains a vector value
101 bool hasVectorTypes() const;
103 /// getName() - Return this TypeSet as a string.
104 std::string getName() const;
106 /// MergeInTypeInfo - This merges in type information from the specified
107 /// argument. If 'this' changes, it returns true. If the two types are
108 /// contradictory (e.g. merge f32 into i32) then this flags an error.
109 bool MergeInTypeInfo(const EEVT::TypeSet &InVT, TreePattern &TP);
111 bool MergeInTypeInfo(MVT::SimpleValueType InVT, TreePattern &TP) {
112 return MergeInTypeInfo(EEVT::TypeSet(InVT, TP), TP);
115 /// Force this type list to only contain integer types.
116 bool EnforceInteger(TreePattern &TP);
118 /// Force this type list to only contain floating point types.
119 bool EnforceFloatingPoint(TreePattern &TP);
121 /// EnforceScalar - Remove all vector types from this type list.
122 bool EnforceScalar(TreePattern &TP);
124 /// EnforceVector - Remove all non-vector types from this type list.
125 bool EnforceVector(TreePattern &TP);
127 /// EnforceSmallerThan - 'this' must be a smaller VT than Other. Update
128 /// this an other based on this information.
129 bool EnforceSmallerThan(EEVT::TypeSet &Other, TreePattern &TP);
131 /// EnforceVectorEltTypeIs - 'this' is now constrainted to be a vector type
132 /// whose element is VT.
133 bool EnforceVectorEltTypeIs(EEVT::TypeSet &VT, TreePattern &TP);
135 /// EnforceVectorSubVectorTypeIs - 'this' is now constrainted to
136 /// be a vector type VT.
137 bool EnforceVectorSubVectorTypeIs(EEVT::TypeSet &VT, TreePattern &TP);
139 bool operator!=(const TypeSet &RHS) const { return TypeVec != RHS.TypeVec; }
140 bool operator==(const TypeSet &RHS) const { return TypeVec == RHS.TypeVec; }
143 /// FillWithPossibleTypes - Set to all legal types and return true, only
144 /// valid on completely unknown type sets. If Pred is non-null, only MVTs
145 /// that pass the predicate are added.
146 bool FillWithPossibleTypes(TreePattern &TP,
147 bool (*Pred)(MVT::SimpleValueType) = 0,
148 const char *PredicateName = 0);
152 /// Set type used to track multiply used variables in patterns
153 typedef std::set<std::string> MultipleUseVarSet;
155 /// SDTypeConstraint - This is a discriminated union of constraints,
156 /// corresponding to the SDTypeConstraint tablegen class in Target.td.
157 struct SDTypeConstraint {
158 SDTypeConstraint(Record *R);
160 unsigned OperandNo; // The operand # this constraint applies to.
162 SDTCisVT, SDTCisPtrTy, SDTCisInt, SDTCisFP, SDTCisVec, SDTCisSameAs,
163 SDTCisVTSmallerThanOp, SDTCisOpSmallerThanOp, SDTCisEltOfVec,
167 union { // The discriminated union.
169 MVT::SimpleValueType VT;
172 unsigned OtherOperandNum;
175 unsigned OtherOperandNum;
176 } SDTCisVTSmallerThanOp_Info;
178 unsigned BigOperandNum;
179 } SDTCisOpSmallerThanOp_Info;
181 unsigned OtherOperandNum;
182 } SDTCisEltOfVec_Info;
184 unsigned OtherOperandNum;
185 } SDTCisSubVecOfVec_Info;
188 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
189 /// constraint to the nodes operands. This returns true if it makes a
190 /// change, false otherwise. If a type contradiction is found, an error
192 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
193 TreePattern &TP) const;
196 /// SDNodeInfo - One of these records is created for each SDNode instance in
197 /// the target .td file. This represents the various dag nodes we will be
201 std::string EnumName;
202 std::string SDClassName;
206 std::vector<SDTypeConstraint> TypeConstraints;
208 SDNodeInfo(Record *R); // Parse the specified record.
210 unsigned getNumResults() const { return NumResults; }
212 /// getNumOperands - This is the number of operands required or -1 if
214 int getNumOperands() const { return NumOperands; }
215 Record *getRecord() const { return Def; }
216 const std::string &getEnumName() const { return EnumName; }
217 const std::string &getSDClassName() const { return SDClassName; }
219 const std::vector<SDTypeConstraint> &getTypeConstraints() const {
220 return TypeConstraints;
223 /// getKnownType - If the type constraints on this node imply a fixed type
224 /// (e.g. all stores return void, etc), then return it as an
225 /// MVT::SimpleValueType. Otherwise, return MVT::Other.
226 MVT::SimpleValueType getKnownType(unsigned ResNo) const;
228 /// hasProperty - Return true if this node has the specified property.
230 bool hasProperty(enum SDNP Prop) const { return Properties & (1 << Prop); }
232 /// ApplyTypeConstraints - Given a node in a pattern, apply the type
233 /// constraints for this node to the operands of the node. This returns
234 /// true if it makes a change, false otherwise. If a type contradiction is
235 /// found, an error is flagged.
236 bool ApplyTypeConstraints(TreePatternNode *N, TreePattern &TP) const {
237 bool MadeChange = false;
238 for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i)
239 MadeChange |= TypeConstraints[i].ApplyTypeConstraint(N, *this, TP);
244 /// TreePredicateFn - This is an abstraction that represents the predicates on
245 /// a PatFrag node. This is a simple one-word wrapper around a pointer to
246 /// provide nice accessors.
247 class TreePredicateFn {
248 /// PatFragRec - This is the TreePattern for the PatFrag that we
249 /// originally came from.
250 TreePattern *PatFragRec;
252 /// TreePredicateFn constructor. Here 'N' is a subclass of PatFrag.
253 TreePredicateFn(TreePattern *N);
256 TreePattern *getOrigPatFragRecord() const { return PatFragRec; }
258 /// isAlwaysTrue - Return true if this is a noop predicate.
259 bool isAlwaysTrue() const;
261 bool isImmediatePattern() const { return !getImmCode().empty(); }
263 /// getImmediatePredicateCode - Return the code that evaluates this pattern if
264 /// this is an immediate predicate. It is an error to call this on a
265 /// non-immediate pattern.
266 std::string getImmediatePredicateCode() const {
267 std::string Result = getImmCode();
268 assert(!Result.empty() && "Isn't an immediate pattern!");
273 bool operator==(const TreePredicateFn &RHS) const {
274 return PatFragRec == RHS.PatFragRec;
277 bool operator!=(const TreePredicateFn &RHS) const { return !(*this == RHS); }
279 /// Return the name to use in the generated code to reference this, this is
280 /// "Predicate_foo" if from a pattern fragment "foo".
281 std::string getFnName() const;
283 /// getCodeToRunOnSDNode - Return the code for the function body that
284 /// evaluates this predicate. The argument is expected to be in "Node",
285 /// not N. This handles casting and conversion to a concrete node type as
287 std::string getCodeToRunOnSDNode() const;
290 std::string getPredCode() const;
291 std::string getImmCode() const;
295 /// FIXME: TreePatternNode's can be shared in some cases (due to dag-shaped
296 /// patterns), and as such should be ref counted. We currently just leak all
297 /// TreePatternNode objects!
298 class TreePatternNode {
299 /// The type of each node result. Before and during type inference, each
300 /// result may be a set of possible types. After (successful) type inference,
301 /// each is a single concrete type.
302 SmallVector<EEVT::TypeSet, 1> Types;
304 /// Operator - The Record for the operator if this is an interior node (not
308 /// Val - The init value (e.g. the "GPRC" record, or "7") for a leaf.
312 /// Name - The name given to this node with the :$foo notation.
316 /// PredicateFns - The predicate functions to execute on this node to check
317 /// for a match. If this list is empty, no predicate is involved.
318 std::vector<TreePredicateFn> PredicateFns;
320 /// TransformFn - The transformation function to execute on this node before
321 /// it can be substituted into the resulting instruction on a pattern match.
324 std::vector<TreePatternNode*> Children;
326 TreePatternNode(Record *Op, const std::vector<TreePatternNode*> &Ch,
328 : Operator(Op), Val(0), TransformFn(0), Children(Ch) {
329 Types.resize(NumResults);
331 TreePatternNode(Init *val, unsigned NumResults) // leaf ctor
332 : Operator(0), Val(val), TransformFn(0) {
333 Types.resize(NumResults);
337 const std::string &getName() const { return Name; }
338 void setName(StringRef N) { Name.assign(N.begin(), N.end()); }
340 bool isLeaf() const { return Val != 0; }
343 unsigned getNumTypes() const { return Types.size(); }
344 MVT::SimpleValueType getType(unsigned ResNo) const {
345 return Types[ResNo].getConcrete();
347 const SmallVectorImpl<EEVT::TypeSet> &getExtTypes() const { return Types; }
348 const EEVT::TypeSet &getExtType(unsigned ResNo) const { return Types[ResNo]; }
349 EEVT::TypeSet &getExtType(unsigned ResNo) { return Types[ResNo]; }
350 void setType(unsigned ResNo, const EEVT::TypeSet &T) { Types[ResNo] = T; }
352 bool hasTypeSet(unsigned ResNo) const {
353 return Types[ResNo].isConcrete();
355 bool isTypeCompletelyUnknown(unsigned ResNo) const {
356 return Types[ResNo].isCompletelyUnknown();
358 bool isTypeDynamicallyResolved(unsigned ResNo) const {
359 return Types[ResNo].isDynamicallyResolved();
362 Init *getLeafValue() const { assert(isLeaf()); return Val; }
363 Record *getOperator() const { assert(!isLeaf()); return Operator; }
365 unsigned getNumChildren() const { return Children.size(); }
366 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
367 void setChild(unsigned i, TreePatternNode *N) {
371 /// hasChild - Return true if N is any of our children.
372 bool hasChild(const TreePatternNode *N) const {
373 for (unsigned i = 0, e = Children.size(); i != e; ++i)
374 if (Children[i] == N) return true;
378 bool hasAnyPredicate() const { return !PredicateFns.empty(); }
380 const std::vector<TreePredicateFn> &getPredicateFns() const {
383 void clearPredicateFns() { PredicateFns.clear(); }
384 void setPredicateFns(const std::vector<TreePredicateFn> &Fns) {
385 assert(PredicateFns.empty() && "Overwriting non-empty predicate list!");
388 void addPredicateFn(const TreePredicateFn &Fn) {
389 assert(!Fn.isAlwaysTrue() && "Empty predicate string!");
390 if (std::find(PredicateFns.begin(), PredicateFns.end(), Fn) ==
392 PredicateFns.push_back(Fn);
395 Record *getTransformFn() const { return TransformFn; }
396 void setTransformFn(Record *Fn) { TransformFn = Fn; }
398 /// getIntrinsicInfo - If this node corresponds to an intrinsic, return the
399 /// CodeGenIntrinsic information for it, otherwise return a null pointer.
400 const CodeGenIntrinsic *getIntrinsicInfo(const CodeGenDAGPatterns &CDP) const;
402 /// getComplexPatternInfo - If this node corresponds to a ComplexPattern,
403 /// return the ComplexPattern information, otherwise return null.
404 const ComplexPattern *
405 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
407 /// NodeHasProperty - Return true if this node has the specified property.
408 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
410 /// TreeHasProperty - Return true if any node in this tree has the specified
412 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
414 /// isCommutativeIntrinsic - Return true if the node is an intrinsic which is
415 /// marked isCommutative.
416 bool isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const;
418 void print(raw_ostream &OS) const;
421 public: // Higher level manipulation routines.
423 /// clone - Return a new copy of this tree.
425 TreePatternNode *clone() const;
427 /// RemoveAllTypes - Recursively strip all the types of this tree.
428 void RemoveAllTypes();
430 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
431 /// the specified node. For this comparison, all of the state of the node
432 /// is considered, except for the assigned name. Nodes with differing names
433 /// that are otherwise identical are considered isomorphic.
434 bool isIsomorphicTo(const TreePatternNode *N,
435 const MultipleUseVarSet &DepVars) const;
437 /// SubstituteFormalArguments - Replace the formal arguments in this tree
438 /// with actual values specified by ArgMap.
439 void SubstituteFormalArguments(std::map<std::string,
440 TreePatternNode*> &ArgMap);
442 /// InlinePatternFragments - If this pattern refers to any pattern
443 /// fragments, inline them into place, giving us a pattern without any
444 /// PatFrag references.
445 TreePatternNode *InlinePatternFragments(TreePattern &TP);
447 /// ApplyTypeConstraints - Apply all of the type constraints relevant to
448 /// this node and its children in the tree. This returns true if it makes a
449 /// change, false otherwise. If a type contradiction is found, flag an error.
450 bool ApplyTypeConstraints(TreePattern &TP, bool NotRegisters);
452 /// UpdateNodeType - Set the node type of N to VT if VT contains
453 /// information. If N already contains a conflicting type, then flag an
454 /// error. This returns true if any information was updated.
456 bool UpdateNodeType(unsigned ResNo, const EEVT::TypeSet &InTy,
458 return Types[ResNo].MergeInTypeInfo(InTy, TP);
461 bool UpdateNodeType(unsigned ResNo, MVT::SimpleValueType InTy,
463 return Types[ResNo].MergeInTypeInfo(EEVT::TypeSet(InTy, TP), TP);
466 /// ContainsUnresolvedType - Return true if this tree contains any
467 /// unresolved types.
468 bool ContainsUnresolvedType() const {
469 for (unsigned i = 0, e = Types.size(); i != e; ++i)
470 if (!Types[i].isConcrete()) return true;
472 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
473 if (getChild(i)->ContainsUnresolvedType()) return true;
477 /// canPatternMatch - If it is impossible for this pattern to match on this
478 /// target, fill in Reason and return false. Otherwise, return true.
479 bool canPatternMatch(std::string &Reason, const CodeGenDAGPatterns &CDP);
482 inline raw_ostream &operator<<(raw_ostream &OS, const TreePatternNode &TPN) {
488 /// TreePattern - Represent a pattern, used for instructions, pattern
492 /// Trees - The list of pattern trees which corresponds to this pattern.
493 /// Note that PatFrag's only have a single tree.
495 std::vector<TreePatternNode*> Trees;
497 /// NamedNodes - This is all of the nodes that have names in the trees in this
499 StringMap<SmallVector<TreePatternNode*,1> > NamedNodes;
501 /// TheRecord - The actual TableGen record corresponding to this pattern.
505 /// Args - This is a list of all of the arguments to this pattern (for
506 /// PatFrag patterns), which are the 'node' markers in this pattern.
507 std::vector<std::string> Args;
509 /// CDP - the top-level object coordinating this madness.
511 CodeGenDAGPatterns &CDP;
513 /// isInputPattern - True if this is an input pattern, something to match.
514 /// False if this is an output pattern, something to emit.
517 /// hasError - True if the currently processed nodes have unresolvable types
518 /// or other non-fatal errors
522 /// TreePattern constructor - Parse the specified DagInits into the
524 TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
525 CodeGenDAGPatterns &ise);
526 TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
527 CodeGenDAGPatterns &ise);
528 TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
529 CodeGenDAGPatterns &ise);
531 /// getTrees - Return the tree patterns which corresponds to this pattern.
533 const std::vector<TreePatternNode*> &getTrees() const { return Trees; }
534 unsigned getNumTrees() const { return Trees.size(); }
535 TreePatternNode *getTree(unsigned i) const { return Trees[i]; }
536 TreePatternNode *getOnlyTree() const {
537 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!");
541 const StringMap<SmallVector<TreePatternNode*,1> > &getNamedNodesMap() {
542 if (NamedNodes.empty())
547 /// getRecord - Return the actual TableGen record corresponding to this
550 Record *getRecord() const { return TheRecord; }
552 unsigned getNumArgs() const { return Args.size(); }
553 const std::string &getArgName(unsigned i) const {
554 assert(i < Args.size() && "Argument reference out of range!");
557 std::vector<std::string> &getArgList() { return Args; }
559 CodeGenDAGPatterns &getDAGPatterns() const { return CDP; }
561 /// InlinePatternFragments - If this pattern refers to any pattern
562 /// fragments, inline them into place, giving us a pattern without any
563 /// PatFrag references.
564 void InlinePatternFragments() {
565 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
566 Trees[i] = Trees[i]->InlinePatternFragments(*this);
569 /// InferAllTypes - Infer/propagate as many types throughout the expression
570 /// patterns as possible. Return true if all types are inferred, false
571 /// otherwise. Bail out if a type contradiction is found.
572 bool InferAllTypes(const StringMap<SmallVector<TreePatternNode*,1> >
575 /// error - If this is the first error in the current resolution step,
576 /// print it and set the error flag. Otherwise, continue silently.
577 void error(const std::string &Msg);
578 bool hasError() const {
585 void print(raw_ostream &OS) const;
589 TreePatternNode *ParseTreePattern(Init *DI, StringRef OpName);
590 void ComputeNamedNodes();
591 void ComputeNamedNodes(TreePatternNode *N);
594 /// DAGDefaultOperand - One of these is created for each OperandWithDefaultOps
595 /// that has a set ExecuteAlways / DefaultOps field.
596 struct DAGDefaultOperand {
597 std::vector<TreePatternNode*> DefaultOps;
600 class DAGInstruction {
601 TreePattern *Pattern;
602 std::vector<Record*> Results;
603 std::vector<Record*> Operands;
604 std::vector<Record*> ImpResults;
605 TreePatternNode *ResultPattern;
607 DAGInstruction(TreePattern *TP,
608 const std::vector<Record*> &results,
609 const std::vector<Record*> &operands,
610 const std::vector<Record*> &impresults)
611 : Pattern(TP), Results(results), Operands(operands),
612 ImpResults(impresults), ResultPattern(0) {}
614 TreePattern *getPattern() const { return Pattern; }
615 unsigned getNumResults() const { return Results.size(); }
616 unsigned getNumOperands() const { return Operands.size(); }
617 unsigned getNumImpResults() const { return ImpResults.size(); }
618 const std::vector<Record*>& getImpResults() const { return ImpResults; }
620 void setResultPattern(TreePatternNode *R) { ResultPattern = R; }
622 Record *getResult(unsigned RN) const {
623 assert(RN < Results.size());
627 Record *getOperand(unsigned ON) const {
628 assert(ON < Operands.size());
632 Record *getImpResult(unsigned RN) const {
633 assert(RN < ImpResults.size());
634 return ImpResults[RN];
637 TreePatternNode *getResultPattern() const { return ResultPattern; }
640 /// PatternToMatch - Used by CodeGenDAGPatterns to keep tab of patterns
641 /// processed to produce isel.
642 class PatternToMatch {
644 PatternToMatch(Record *srcrecord, ListInit *preds,
645 TreePatternNode *src, TreePatternNode *dst,
646 const std::vector<Record*> &dstregs,
647 unsigned complexity, unsigned uid)
648 : SrcRecord(srcrecord), Predicates(preds), SrcPattern(src), DstPattern(dst),
649 Dstregs(dstregs), AddedComplexity(complexity), ID(uid) {}
651 Record *SrcRecord; // Originating Record for the pattern.
652 ListInit *Predicates; // Top level predicate conditions to match.
653 TreePatternNode *SrcPattern; // Source pattern to match.
654 TreePatternNode *DstPattern; // Resulting pattern.
655 std::vector<Record*> Dstregs; // Physical register defs being matched.
656 unsigned AddedComplexity; // Add to matching pattern complexity.
657 unsigned ID; // Unique ID for the record.
659 Record *getSrcRecord() const { return SrcRecord; }
660 ListInit *getPredicates() const { return Predicates; }
661 TreePatternNode *getSrcPattern() const { return SrcPattern; }
662 TreePatternNode *getDstPattern() const { return DstPattern; }
663 const std::vector<Record*> &getDstRegs() const { return Dstregs; }
664 unsigned getAddedComplexity() const { return AddedComplexity; }
666 std::string getPredicateCheck() const;
668 /// Compute the complexity metric for the input pattern. This roughly
669 /// corresponds to the number of nodes that are covered.
670 unsigned getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
673 class CodeGenDAGPatterns {
674 RecordKeeper &Records;
675 CodeGenTarget Target;
676 std::vector<CodeGenIntrinsic> Intrinsics;
677 std::vector<CodeGenIntrinsic> TgtIntrinsics;
679 std::map<Record*, SDNodeInfo, LessRecordByID> SDNodes;
680 std::map<Record*, std::pair<Record*, std::string>, LessRecordByID> SDNodeXForms;
681 std::map<Record*, ComplexPattern, LessRecordByID> ComplexPatterns;
682 std::map<Record*, TreePattern*, LessRecordByID> PatternFragments;
683 std::map<Record*, DAGDefaultOperand, LessRecordByID> DefaultOperands;
684 std::map<Record*, DAGInstruction, LessRecordByID> Instructions;
686 // Specific SDNode definitions:
687 Record *intrinsic_void_sdnode;
688 Record *intrinsic_w_chain_sdnode, *intrinsic_wo_chain_sdnode;
690 /// PatternsToMatch - All of the things we are matching on the DAG. The first
691 /// value is the pattern to match, the second pattern is the result to
693 std::vector<PatternToMatch> PatternsToMatch;
695 CodeGenDAGPatterns(RecordKeeper &R);
696 ~CodeGenDAGPatterns();
698 CodeGenTarget &getTargetInfo() { return Target; }
699 const CodeGenTarget &getTargetInfo() const { return Target; }
701 Record *getSDNodeNamed(const std::string &Name) const;
703 const SDNodeInfo &getSDNodeInfo(Record *R) const {
704 assert(SDNodes.count(R) && "Unknown node!");
705 return SDNodes.find(R)->second;
708 // Node transformation lookups.
709 typedef std::pair<Record*, std::string> NodeXForm;
710 const NodeXForm &getSDNodeTransform(Record *R) const {
711 assert(SDNodeXForms.count(R) && "Invalid transform!");
712 return SDNodeXForms.find(R)->second;
715 typedef std::map<Record*, NodeXForm, LessRecordByID>::const_iterator
717 nx_iterator nx_begin() const { return SDNodeXForms.begin(); }
718 nx_iterator nx_end() const { return SDNodeXForms.end(); }
721 const ComplexPattern &getComplexPattern(Record *R) const {
722 assert(ComplexPatterns.count(R) && "Unknown addressing mode!");
723 return ComplexPatterns.find(R)->second;
726 const CodeGenIntrinsic &getIntrinsic(Record *R) const {
727 for (unsigned i = 0, e = Intrinsics.size(); i != e; ++i)
728 if (Intrinsics[i].TheDef == R) return Intrinsics[i];
729 for (unsigned i = 0, e = TgtIntrinsics.size(); i != e; ++i)
730 if (TgtIntrinsics[i].TheDef == R) return TgtIntrinsics[i];
731 llvm_unreachable("Unknown intrinsic!");
734 const CodeGenIntrinsic &getIntrinsicInfo(unsigned IID) const {
735 if (IID-1 < Intrinsics.size())
736 return Intrinsics[IID-1];
737 if (IID-Intrinsics.size()-1 < TgtIntrinsics.size())
738 return TgtIntrinsics[IID-Intrinsics.size()-1];
739 llvm_unreachable("Bad intrinsic ID!");
742 unsigned getIntrinsicID(Record *R) const {
743 for (unsigned i = 0, e = Intrinsics.size(); i != e; ++i)
744 if (Intrinsics[i].TheDef == R) return i;
745 for (unsigned i = 0, e = TgtIntrinsics.size(); i != e; ++i)
746 if (TgtIntrinsics[i].TheDef == R) return i + Intrinsics.size();
747 llvm_unreachable("Unknown intrinsic!");
750 const DAGDefaultOperand &getDefaultOperand(Record *R) const {
751 assert(DefaultOperands.count(R) &&"Isn't an analyzed default operand!");
752 return DefaultOperands.find(R)->second;
755 // Pattern Fragment information.
756 TreePattern *getPatternFragment(Record *R) const {
757 assert(PatternFragments.count(R) && "Invalid pattern fragment request!");
758 return PatternFragments.find(R)->second;
760 TreePattern *getPatternFragmentIfRead(Record *R) const {
761 if (!PatternFragments.count(R)) return 0;
762 return PatternFragments.find(R)->second;
765 typedef std::map<Record*, TreePattern*, LessRecordByID>::const_iterator
767 pf_iterator pf_begin() const { return PatternFragments.begin(); }
768 pf_iterator pf_end() const { return PatternFragments.end(); }
770 // Patterns to match information.
771 typedef std::vector<PatternToMatch>::const_iterator ptm_iterator;
772 ptm_iterator ptm_begin() const { return PatternsToMatch.begin(); }
773 ptm_iterator ptm_end() const { return PatternsToMatch.end(); }
777 const DAGInstruction &getInstruction(Record *R) const {
778 assert(Instructions.count(R) && "Unknown instruction!");
779 return Instructions.find(R)->second;
782 Record *get_intrinsic_void_sdnode() const {
783 return intrinsic_void_sdnode;
785 Record *get_intrinsic_w_chain_sdnode() const {
786 return intrinsic_w_chain_sdnode;
788 Record *get_intrinsic_wo_chain_sdnode() const {
789 return intrinsic_wo_chain_sdnode;
792 bool hasTargetIntrinsics() { return !TgtIntrinsics.empty(); }
795 void ParseNodeInfo();
796 void ParseNodeTransforms();
797 void ParseComplexPatterns();
798 void ParsePatternFragments();
799 void ParseDefaultOperands();
800 void ParseInstructions();
801 void ParsePatterns();
802 void InferInstructionFlags();
803 void GenerateVariants();
804 void VerifyInstructionFlags();
806 void AddPatternToMatch(TreePattern *Pattern, const PatternToMatch &PTM);
807 void FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
808 std::map<std::string,
809 TreePatternNode*> &InstInputs,
810 std::map<std::string,
811 TreePatternNode*> &InstResults,
812 std::vector<Record*> &InstImpResults);
814 } // end namespace llvm