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(MVT::SimpleValueType VT, TreePattern &TP);
134 bool operator!=(const TypeSet &RHS) const { return TypeVec != RHS.TypeVec; }
135 bool operator==(const TypeSet &RHS) const { return TypeVec == RHS.TypeVec; }
138 /// FillWithPossibleTypes - Set to all legal types and return true, only
139 /// valid on completely unknown type sets. If Pred is non-null, only MVTs
140 /// that pass the predicate are added.
141 bool FillWithPossibleTypes(TreePattern &TP,
142 bool (*Pred)(MVT::SimpleValueType) = 0,
143 const char *PredicateName = 0);
147 /// Set type used to track multiply used variables in patterns
148 typedef std::set<std::string> MultipleUseVarSet;
150 /// SDTypeConstraint - This is a discriminated union of constraints,
151 /// corresponding to the SDTypeConstraint tablegen class in Target.td.
152 struct SDTypeConstraint {
153 SDTypeConstraint(Record *R);
155 unsigned OperandNo; // The operand # this constraint applies to.
157 SDTCisVT, SDTCisPtrTy, SDTCisInt, SDTCisFP, SDTCisVec, SDTCisSameAs,
158 SDTCisVTSmallerThanOp, SDTCisOpSmallerThanOp, SDTCisEltOfVec
161 union { // The discriminated union.
163 MVT::SimpleValueType VT;
166 unsigned OtherOperandNum;
169 unsigned OtherOperandNum;
170 } SDTCisVTSmallerThanOp_Info;
172 unsigned BigOperandNum;
173 } SDTCisOpSmallerThanOp_Info;
175 unsigned OtherOperandNum;
176 } SDTCisEltOfVec_Info;
179 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
180 /// constraint to the nodes operands. This returns true if it makes a
181 /// change, false otherwise. If a type contradiction is found, throw an
183 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
184 TreePattern &TP) const;
186 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
187 /// N, which has NumResults results.
188 TreePatternNode *getOperandNum(unsigned OpNo, TreePatternNode *N,
189 unsigned NumResults) const;
192 /// SDNodeInfo - One of these records is created for each SDNode instance in
193 /// the target .td file. This represents the various dag nodes we will be
197 std::string EnumName;
198 std::string SDClassName;
202 std::vector<SDTypeConstraint> TypeConstraints;
204 SDNodeInfo(Record *R); // Parse the specified record.
206 unsigned getNumResults() const { return NumResults; }
207 int getNumOperands() const { return NumOperands; }
208 Record *getRecord() const { return Def; }
209 const std::string &getEnumName() const { return EnumName; }
210 const std::string &getSDClassName() const { return SDClassName; }
212 const std::vector<SDTypeConstraint> &getTypeConstraints() const {
213 return TypeConstraints;
216 /// getKnownType - If the type constraints on this node imply a fixed type
217 /// (e.g. all stores return void, etc), then return it as an
218 /// MVT::SimpleValueType. Otherwise, return MVT::Other.
219 MVT::SimpleValueType getKnownType() const;
221 /// hasProperty - Return true if this node has the specified property.
223 bool hasProperty(enum SDNP Prop) const { return Properties & (1 << Prop); }
225 /// ApplyTypeConstraints - Given a node in a pattern, apply the type
226 /// constraints for this node to the operands of the node. This returns
227 /// true if it makes a change, false otherwise. If a type contradiction is
228 /// found, throw an exception.
229 bool ApplyTypeConstraints(TreePatternNode *N, TreePattern &TP) const {
230 bool MadeChange = false;
231 for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i)
232 MadeChange |= TypeConstraints[i].ApplyTypeConstraint(N, *this, TP);
237 /// FIXME: TreePatternNode's can be shared in some cases (due to dag-shaped
238 /// patterns), and as such should be ref counted. We currently just leak all
239 /// TreePatternNode objects!
240 class TreePatternNode {
241 /// The type of each node result. Before and during type inference, each
242 /// result may be a set of possible types. After (successful) type inference,
243 /// each is a single concrete type.
244 SmallVector<EEVT::TypeSet, 1> Types;
246 /// Operator - The Record for the operator if this is an interior node (not
250 /// Val - The init value (e.g. the "GPRC" record, or "7") for a leaf.
254 /// Name - The name given to this node with the :$foo notation.
258 /// PredicateFns - The predicate functions to execute on this node to check
259 /// for a match. If this list is empty, no predicate is involved.
260 std::vector<std::string> PredicateFns;
262 /// TransformFn - The transformation function to execute on this node before
263 /// it can be substituted into the resulting instruction on a pattern match.
266 std::vector<TreePatternNode*> Children;
268 TreePatternNode(Record *Op, const std::vector<TreePatternNode*> &Ch,
270 : Operator(Op), Val(0), TransformFn(0), Children(Ch) {
271 Types.resize(NumResults);
273 TreePatternNode(Init *val, unsigned NumResults) // leaf ctor
274 : Operator(0), Val(val), TransformFn(0) {
275 Types.resize(NumResults);
279 const std::string &getName() const { return Name; }
280 void setName(const std::string &N) { Name = N; }
282 bool isLeaf() const { return Val != 0; }
285 unsigned getNumTypes() const { return Types.size(); }
286 MVT::SimpleValueType getType(unsigned ResNo) const {
287 return Types[ResNo].getConcrete();
289 const SmallVectorImpl<EEVT::TypeSet> &getExtTypes() const { return Types; }
290 const EEVT::TypeSet &getExtType(unsigned ResNo) const { return Types[ResNo]; }
291 EEVT::TypeSet &getExtType(unsigned ResNo) { return Types[ResNo]; }
292 void setType(unsigned ResNo, const EEVT::TypeSet &T) { Types[ResNo] = T; }
294 bool hasTypeSet(unsigned ResNo) const {
295 return Types[ResNo].isConcrete();
297 bool isTypeCompletelyUnknown(unsigned ResNo) const {
298 return Types[ResNo].isCompletelyUnknown();
300 bool isTypeDynamicallyResolved(unsigned ResNo) const {
301 return Types[ResNo].isDynamicallyResolved();
304 Init *getLeafValue() const { assert(isLeaf()); return Val; }
305 Record *getOperator() const { assert(!isLeaf()); return Operator; }
307 unsigned getNumChildren() const { return Children.size(); }
308 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
309 void setChild(unsigned i, TreePatternNode *N) {
313 /// hasChild - Return true if N is any of our children.
314 bool hasChild(const TreePatternNode *N) const {
315 for (unsigned i = 0, e = Children.size(); i != e; ++i)
316 if (Children[i] == N) return true;
320 const std::vector<std::string> &getPredicateFns() const {return PredicateFns;}
321 void clearPredicateFns() { PredicateFns.clear(); }
322 void setPredicateFns(const std::vector<std::string> &Fns) {
323 assert(PredicateFns.empty() && "Overwriting non-empty predicate list!");
326 void addPredicateFn(const std::string &Fn) {
327 assert(!Fn.empty() && "Empty predicate string!");
328 if (std::find(PredicateFns.begin(), PredicateFns.end(), Fn) ==
330 PredicateFns.push_back(Fn);
333 Record *getTransformFn() const { return TransformFn; }
334 void setTransformFn(Record *Fn) { TransformFn = Fn; }
336 /// getIntrinsicInfo - If this node corresponds to an intrinsic, return the
337 /// CodeGenIntrinsic information for it, otherwise return a null pointer.
338 const CodeGenIntrinsic *getIntrinsicInfo(const CodeGenDAGPatterns &CDP) const;
340 /// getComplexPatternInfo - If this node corresponds to a ComplexPattern,
341 /// return the ComplexPattern information, otherwise return null.
342 const ComplexPattern *
343 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
345 /// NodeHasProperty - Return true if this node has the specified property.
346 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
348 /// TreeHasProperty - Return true if any node in this tree has the specified
350 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
352 /// isCommutativeIntrinsic - Return true if the node is an intrinsic which is
353 /// marked isCommutative.
354 bool isCommutativeIntrinsic(const CodeGenDAGPatterns &CDP) const;
356 void print(raw_ostream &OS) const;
359 public: // Higher level manipulation routines.
361 /// clone - Return a new copy of this tree.
363 TreePatternNode *clone() const;
365 /// RemoveAllTypes - Recursively strip all the types of this tree.
366 void RemoveAllTypes();
368 /// isIsomorphicTo - Return true if this node is recursively isomorphic to
369 /// the specified node. For this comparison, all of the state of the node
370 /// is considered, except for the assigned name. Nodes with differing names
371 /// that are otherwise identical are considered isomorphic.
372 bool isIsomorphicTo(const TreePatternNode *N,
373 const MultipleUseVarSet &DepVars) const;
375 /// SubstituteFormalArguments - Replace the formal arguments in this tree
376 /// with actual values specified by ArgMap.
377 void SubstituteFormalArguments(std::map<std::string,
378 TreePatternNode*> &ArgMap);
380 /// InlinePatternFragments - If this pattern refers to any pattern
381 /// fragments, inline them into place, giving us a pattern without any
382 /// PatFrag references.
383 TreePatternNode *InlinePatternFragments(TreePattern &TP);
385 /// ApplyTypeConstraints - Apply all of the type constraints relevant to
386 /// this node and its children in the tree. This returns true if it makes a
387 /// change, false otherwise. If a type contradiction is found, throw an
389 bool ApplyTypeConstraints(TreePattern &TP, bool NotRegisters);
391 /// UpdateNodeType - Set the node type of N to VT if VT contains
392 /// information. If N already contains a conflicting type, then throw an
393 /// exception. This returns true if any information was updated.
395 bool UpdateNodeType(unsigned ResNo, const EEVT::TypeSet &InTy,
397 return Types[ResNo].MergeInTypeInfo(InTy, TP);
400 bool UpdateNodeType(unsigned ResNo, MVT::SimpleValueType InTy,
402 return Types[ResNo].MergeInTypeInfo(EEVT::TypeSet(InTy, TP), TP);
405 /// ContainsUnresolvedType - Return true if this tree contains any
406 /// unresolved types.
407 bool ContainsUnresolvedType() const {
408 for (unsigned i = 0, e = Types.size(); i != e; ++i)
409 if (!Types[i].isConcrete()) return true;
411 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
412 if (getChild(i)->ContainsUnresolvedType()) return true;
416 /// canPatternMatch - If it is impossible for this pattern to match on this
417 /// target, fill in Reason and return false. Otherwise, return true.
418 bool canPatternMatch(std::string &Reason, const CodeGenDAGPatterns &CDP);
421 inline raw_ostream &operator<<(raw_ostream &OS, const TreePatternNode &TPN) {
427 /// TreePattern - Represent a pattern, used for instructions, pattern
431 /// Trees - The list of pattern trees which corresponds to this pattern.
432 /// Note that PatFrag's only have a single tree.
434 std::vector<TreePatternNode*> Trees;
436 /// NamedNodes - This is all of the nodes that have names in the trees in this
438 StringMap<SmallVector<TreePatternNode*,1> > NamedNodes;
440 /// TheRecord - The actual TableGen record corresponding to this pattern.
444 /// Args - This is a list of all of the arguments to this pattern (for
445 /// PatFrag patterns), which are the 'node' markers in this pattern.
446 std::vector<std::string> Args;
448 /// CDP - the top-level object coordinating this madness.
450 CodeGenDAGPatterns &CDP;
452 /// isInputPattern - True if this is an input pattern, something to match.
453 /// False if this is an output pattern, something to emit.
457 /// TreePattern constructor - Parse the specified DagInits into the
459 TreePattern(Record *TheRec, ListInit *RawPat, bool isInput,
460 CodeGenDAGPatterns &ise);
461 TreePattern(Record *TheRec, DagInit *Pat, bool isInput,
462 CodeGenDAGPatterns &ise);
463 TreePattern(Record *TheRec, TreePatternNode *Pat, bool isInput,
464 CodeGenDAGPatterns &ise);
466 /// getTrees - Return the tree patterns which corresponds to this pattern.
468 const std::vector<TreePatternNode*> &getTrees() const { return Trees; }
469 unsigned getNumTrees() const { return Trees.size(); }
470 TreePatternNode *getTree(unsigned i) const { return Trees[i]; }
471 TreePatternNode *getOnlyTree() const {
472 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!");
476 const StringMap<SmallVector<TreePatternNode*,1> > &getNamedNodesMap() {
477 if (NamedNodes.empty())
482 /// getRecord - Return the actual TableGen record corresponding to this
485 Record *getRecord() const { return TheRecord; }
487 unsigned getNumArgs() const { return Args.size(); }
488 const std::string &getArgName(unsigned i) const {
489 assert(i < Args.size() && "Argument reference out of range!");
492 std::vector<std::string> &getArgList() { return Args; }
494 CodeGenDAGPatterns &getDAGPatterns() const { return CDP; }
496 /// InlinePatternFragments - If this pattern refers to any pattern
497 /// fragments, inline them into place, giving us a pattern without any
498 /// PatFrag references.
499 void InlinePatternFragments() {
500 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
501 Trees[i] = Trees[i]->InlinePatternFragments(*this);
504 /// InferAllTypes - Infer/propagate as many types throughout the expression
505 /// patterns as possible. Return true if all types are inferred, false
506 /// otherwise. Throw an exception if a type contradiction is found.
507 bool InferAllTypes(const StringMap<SmallVector<TreePatternNode*,1> >
510 /// error - Throw an exception, prefixing it with information about this
512 void error(const std::string &Msg) const;
514 void print(raw_ostream &OS) const;
518 TreePatternNode *ParseTreePattern(DagInit *DI);
519 void ComputeNamedNodes();
520 void ComputeNamedNodes(TreePatternNode *N);
523 /// DAGDefaultOperand - One of these is created for each PredicateOperand
524 /// or OptionalDefOperand that has a set ExecuteAlways / DefaultOps field.
525 struct DAGDefaultOperand {
526 std::vector<TreePatternNode*> DefaultOps;
529 class DAGInstruction {
530 TreePattern *Pattern;
531 std::vector<Record*> Results;
532 std::vector<Record*> Operands;
533 std::vector<Record*> ImpResults;
534 std::vector<Record*> ImpOperands;
535 TreePatternNode *ResultPattern;
537 DAGInstruction(TreePattern *TP,
538 const std::vector<Record*> &results,
539 const std::vector<Record*> &operands,
540 const std::vector<Record*> &impresults,
541 const std::vector<Record*> &impoperands)
542 : Pattern(TP), Results(results), Operands(operands),
543 ImpResults(impresults), ImpOperands(impoperands),
546 const TreePattern *getPattern() const { return Pattern; }
547 unsigned getNumResults() const { return Results.size(); }
548 unsigned getNumOperands() const { return Operands.size(); }
549 unsigned getNumImpResults() const { return ImpResults.size(); }
550 unsigned getNumImpOperands() const { return ImpOperands.size(); }
551 const std::vector<Record*>& getImpResults() const { return ImpResults; }
553 void setResultPattern(TreePatternNode *R) { ResultPattern = R; }
555 Record *getResult(unsigned RN) const {
556 assert(RN < Results.size());
560 Record *getOperand(unsigned ON) const {
561 assert(ON < Operands.size());
565 Record *getImpResult(unsigned RN) const {
566 assert(RN < ImpResults.size());
567 return ImpResults[RN];
570 Record *getImpOperand(unsigned ON) const {
571 assert(ON < ImpOperands.size());
572 return ImpOperands[ON];
575 TreePatternNode *getResultPattern() const { return ResultPattern; }
578 /// PatternToMatch - Used by CodeGenDAGPatterns to keep tab of patterns
579 /// processed to produce isel.
580 class PatternToMatch {
582 PatternToMatch(ListInit *preds,
583 TreePatternNode *src, TreePatternNode *dst,
584 const std::vector<Record*> &dstregs,
585 unsigned complexity, unsigned uid)
586 : Predicates(preds), SrcPattern(src), DstPattern(dst),
587 Dstregs(dstregs), AddedComplexity(complexity), ID(uid) {}
589 ListInit *Predicates; // Top level predicate conditions to match.
590 TreePatternNode *SrcPattern; // Source pattern to match.
591 TreePatternNode *DstPattern; // Resulting pattern.
592 std::vector<Record*> Dstregs; // Physical register defs being matched.
593 unsigned AddedComplexity; // Add to matching pattern complexity.
594 unsigned ID; // Unique ID for the record.
596 ListInit *getPredicates() const { return Predicates; }
597 TreePatternNode *getSrcPattern() const { return SrcPattern; }
598 TreePatternNode *getDstPattern() const { return DstPattern; }
599 const std::vector<Record*> &getDstRegs() const { return Dstregs; }
600 unsigned getAddedComplexity() const { return AddedComplexity; }
602 std::string getPredicateCheck() const;
605 // Deterministic comparison of Record*.
606 struct RecordPtrCmp {
607 bool operator()(const Record *LHS, const Record *RHS) const;
610 class CodeGenDAGPatterns {
611 RecordKeeper &Records;
612 CodeGenTarget Target;
613 std::vector<CodeGenIntrinsic> Intrinsics;
614 std::vector<CodeGenIntrinsic> TgtIntrinsics;
616 std::map<Record*, SDNodeInfo, RecordPtrCmp> SDNodes;
617 std::map<Record*, std::pair<Record*, std::string>, RecordPtrCmp> SDNodeXForms;
618 std::map<Record*, ComplexPattern, RecordPtrCmp> ComplexPatterns;
619 std::map<Record*, TreePattern*, RecordPtrCmp> PatternFragments;
620 std::map<Record*, DAGDefaultOperand, RecordPtrCmp> DefaultOperands;
621 std::map<Record*, DAGInstruction, RecordPtrCmp> Instructions;
623 // Specific SDNode definitions:
624 Record *intrinsic_void_sdnode;
625 Record *intrinsic_w_chain_sdnode, *intrinsic_wo_chain_sdnode;
627 /// PatternsToMatch - All of the things we are matching on the DAG. The first
628 /// value is the pattern to match, the second pattern is the result to
630 std::vector<PatternToMatch> PatternsToMatch;
632 CodeGenDAGPatterns(RecordKeeper &R);
633 ~CodeGenDAGPatterns();
635 CodeGenTarget &getTargetInfo() { return Target; }
636 const CodeGenTarget &getTargetInfo() const { return Target; }
638 Record *getSDNodeNamed(const std::string &Name) const;
640 const SDNodeInfo &getSDNodeInfo(Record *R) const {
641 assert(SDNodes.count(R) && "Unknown node!");
642 return SDNodes.find(R)->second;
645 // Node transformation lookups.
646 typedef std::pair<Record*, std::string> NodeXForm;
647 const NodeXForm &getSDNodeTransform(Record *R) const {
648 assert(SDNodeXForms.count(R) && "Invalid transform!");
649 return SDNodeXForms.find(R)->second;
652 typedef std::map<Record*, NodeXForm, RecordPtrCmp>::const_iterator
654 nx_iterator nx_begin() const { return SDNodeXForms.begin(); }
655 nx_iterator nx_end() const { return SDNodeXForms.end(); }
658 const ComplexPattern &getComplexPattern(Record *R) const {
659 assert(ComplexPatterns.count(R) && "Unknown addressing mode!");
660 return ComplexPatterns.find(R)->second;
663 const CodeGenIntrinsic &getIntrinsic(Record *R) const {
664 for (unsigned i = 0, e = Intrinsics.size(); i != e; ++i)
665 if (Intrinsics[i].TheDef == R) return Intrinsics[i];
666 for (unsigned i = 0, e = TgtIntrinsics.size(); i != e; ++i)
667 if (TgtIntrinsics[i].TheDef == R) return TgtIntrinsics[i];
668 assert(0 && "Unknown intrinsic!");
672 const CodeGenIntrinsic &getIntrinsicInfo(unsigned IID) const {
673 if (IID-1 < Intrinsics.size())
674 return Intrinsics[IID-1];
675 if (IID-Intrinsics.size()-1 < TgtIntrinsics.size())
676 return TgtIntrinsics[IID-Intrinsics.size()-1];
677 assert(0 && "Bad intrinsic ID!");
681 unsigned getIntrinsicID(Record *R) const {
682 for (unsigned i = 0, e = Intrinsics.size(); i != e; ++i)
683 if (Intrinsics[i].TheDef == R) return i;
684 for (unsigned i = 0, e = TgtIntrinsics.size(); i != e; ++i)
685 if (TgtIntrinsics[i].TheDef == R) return i + Intrinsics.size();
686 assert(0 && "Unknown intrinsic!");
690 const DAGDefaultOperand &getDefaultOperand(Record *R) const {
691 assert(DefaultOperands.count(R) &&"Isn't an analyzed default operand!");
692 return DefaultOperands.find(R)->second;
695 // Pattern Fragment information.
696 TreePattern *getPatternFragment(Record *R) const {
697 assert(PatternFragments.count(R) && "Invalid pattern fragment request!");
698 return PatternFragments.find(R)->second;
700 TreePattern *getPatternFragmentIfRead(Record *R) const {
701 if (!PatternFragments.count(R)) return 0;
702 return PatternFragments.find(R)->second;
705 typedef std::map<Record*, TreePattern*, RecordPtrCmp>::const_iterator
707 pf_iterator pf_begin() const { return PatternFragments.begin(); }
708 pf_iterator pf_end() const { return PatternFragments.end(); }
710 // Patterns to match information.
711 typedef std::vector<PatternToMatch>::const_iterator ptm_iterator;
712 ptm_iterator ptm_begin() const { return PatternsToMatch.begin(); }
713 ptm_iterator ptm_end() const { return PatternsToMatch.end(); }
717 const DAGInstruction &getInstruction(Record *R) const {
718 assert(Instructions.count(R) && "Unknown instruction!");
719 return Instructions.find(R)->second;
722 Record *get_intrinsic_void_sdnode() const {
723 return intrinsic_void_sdnode;
725 Record *get_intrinsic_w_chain_sdnode() const {
726 return intrinsic_w_chain_sdnode;
728 Record *get_intrinsic_wo_chain_sdnode() const {
729 return intrinsic_wo_chain_sdnode;
732 bool hasTargetIntrinsics() { return !TgtIntrinsics.empty(); }
735 void ParseNodeInfo();
736 void ParseNodeTransforms();
737 void ParseComplexPatterns();
738 void ParsePatternFragments();
739 void ParseDefaultOperands();
740 void ParseInstructions();
741 void ParsePatterns();
742 void InferInstructionFlags();
743 void GenerateVariants();
745 void AddPatternToMatch(const TreePattern *Pattern, const PatternToMatch &PTM);
746 void FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
747 std::map<std::string,
748 TreePatternNode*> &InstInputs,
749 std::map<std::string,
750 TreePatternNode*> &InstResults,
751 std::vector<Record*> &InstImpInputs,
752 std::vector<Record*> &InstImpResults);
754 } // end namespace llvm