1 //===- DAGISelEmitter.h - Generate an instruction selector ------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Chris Lattner and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This tablegen backend emits a DAG instruction selector.
12 //===----------------------------------------------------------------------===//
14 #ifndef DAGISEL_EMITTER_H
15 #define DAGISEL_EMITTER_H
17 #include "TableGenBackend.h"
18 #include "CodeGenTarget.h"
26 class TreePatternNode;
29 /// SDTypeConstraint - This is a discriminated union of constraints,
30 /// corresponding to the SDTypeConstraint tablegen class in Target.td.
31 struct SDTypeConstraint {
32 SDTypeConstraint(Record *R);
34 unsigned OperandNo; // The operand # this constraint applies to.
36 SDTCisVT, SDTCisInt, SDTCisFP, SDTCisSameAs, SDTCisVTSmallerThanOp
39 union { // The discriminated union.
44 unsigned OtherOperandNum;
47 unsigned OtherOperandNum;
48 } SDTCisVTSmallerThanOp_Info;
51 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
52 /// constraint to the nodes operands. This returns true if it makes a
53 /// change, false otherwise. If a type contradiction is found, throw an
55 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
56 TreePattern &TP) const;
58 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
59 /// N, which has NumResults results.
60 TreePatternNode *getOperandNum(unsigned OpNo, TreePatternNode *N,
61 unsigned NumResults) const;
64 /// SDNodeInfo - One of these records is created for each SDNode instance in
65 /// the target .td file. This represents the various dag nodes we will be
70 std::string SDClassName;
73 std::vector<SDTypeConstraint> TypeConstraints;
75 SDNodeInfo(Record *R); // Parse the specified record.
77 unsigned getNumResults() const { return NumResults; }
78 int getNumOperands() const { return NumOperands; }
79 Record *getRecord() const { return Def; }
80 const std::string &getEnumName() const { return EnumName; }
81 const std::string &getSDClassName() const { return SDClassName; }
83 const std::vector<SDTypeConstraint> &getTypeConstraints() const {
84 return TypeConstraints;
87 /// ApplyTypeConstraints - Given a node in a pattern, apply the type
88 /// constraints for this node to the operands of the node. This returns
89 /// true if it makes a change, false otherwise. If a type contradiction is
90 /// found, throw an exception.
91 bool ApplyTypeConstraints(TreePatternNode *N, TreePattern &TP) const {
92 bool MadeChange = false;
93 for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i)
94 MadeChange |= TypeConstraints[i].ApplyTypeConstraint(N, *this, TP);
99 /// FIXME: TreePatternNode's can be shared in some cases (due to dag-shaped
100 /// patterns), and as such should be ref counted. We currently just leak all
101 /// TreePatternNode objects!
102 class TreePatternNode {
103 /// The inferred type for this node, or MVT::LAST_VALUETYPE if it hasn't
104 /// been determined yet.
107 /// Operator - The Record for the operator if this is an interior node (not
111 /// Val - The init value (e.g. the "GPRC" record, or "7") for a leaf.
115 /// Name - The name given to this node with the :$foo notation.
119 /// PredicateFn - The predicate function to execute on this node to check
120 /// for a match. If this string is empty, no predicate is involved.
121 std::string PredicateFn;
123 std::vector<TreePatternNode*> Children;
125 TreePatternNode(Record *Op, const std::vector<TreePatternNode*> &Ch)
126 : Ty(MVT::LAST_VALUETYPE), Operator(Op), Val(0), Children(Ch) {}
127 TreePatternNode(Init *val) // leaf ctor
128 : Ty(MVT::LAST_VALUETYPE), Operator(0), Val(val) {}
131 const std::string &getName() const { return Name; }
132 void setName(const std::string &N) { Name = N; }
134 bool isLeaf() const { return Val != 0; }
135 bool hasTypeSet() const { return Ty != MVT::LAST_VALUETYPE; }
136 MVT::ValueType getType() const { return Ty; }
137 void setType(MVT::ValueType VT) { Ty = VT; }
139 Init *getLeafValue() const { assert(isLeaf()); return Val; }
140 Record *getOperator() const { assert(!isLeaf()); return Operator; }
142 unsigned getNumChildren() const { return Children.size(); }
143 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
144 void setChild(unsigned i, TreePatternNode *N) {
148 const std::string &getPredicateFn() const { return PredicateFn; }
149 void setPredicateFn(const std::string &Fn) { PredicateFn = Fn; }
151 void print(std::ostream &OS) const;
154 public: // Higher level manipulation routines.
156 /// clone - Return a new copy of this tree.
158 TreePatternNode *clone() const;
160 /// SubstituteFormalArguments - Replace the formal arguments in this tree
161 /// with actual values specified by ArgMap.
162 void SubstituteFormalArguments(std::map<std::string,
163 TreePatternNode*> &ArgMap);
165 /// InlinePatternFragments - If this pattern refers to any pattern
166 /// fragments, inline them into place, giving us a pattern without any
167 /// PatFrag references.
168 TreePatternNode *InlinePatternFragments(TreePattern &TP);
170 /// ApplyTypeConstraints - Apply all of the type constraints relevent to
171 /// this node and its children in the tree. This returns true if it makes a
172 /// change, false otherwise. If a type contradiction is found, throw an
174 bool ApplyTypeConstraints(TreePattern &TP);
176 /// UpdateNodeType - Set the node type of N to VT if VT contains
177 /// information. If N already contains a conflicting type, then throw an
178 /// exception. This returns true if any information was updated.
180 bool UpdateNodeType(MVT::ValueType VT, TreePattern &TP);
182 /// ContainsUnresolvedType - Return true if this tree contains any
183 /// unresolved types.
184 bool ContainsUnresolvedType() const {
185 if (Ty == MVT::LAST_VALUETYPE) return true;
186 for (unsigned i = 0, e = getNumChildren(); i != e; ++i)
187 if (getChild(i)->ContainsUnresolvedType()) return true;
193 /// TreePattern - Represent a pattern of one form or another. Currently, two
194 /// types of patterns are possible: Instructions and PatFrags.
202 /// PTy - The type of pattern this is.
206 /// Trees - The list of pattern trees which corresponds to this pattern.
207 /// Note that PatFrag's only have a single tree.
209 std::vector<TreePatternNode*> Trees;
211 /// TheRecord - The actual TableGen record corresponding to this pattern.
215 /// Args - This is a list of all of the arguments to this pattern (for
216 /// PatFrag patterns), which are the 'node' markers in this pattern.
217 std::vector<std::string> Args;
219 /// ISE - the DAG isel emitter coordinating this madness.
224 /// TreePattern constructor - Parse the specified DagInits into the
226 TreePattern(PatternType pty, Record *TheRec,
227 const std::vector<DagInit *> &RawPat, DAGISelEmitter &ise);
229 /// getPatternType - Return what flavor of Record this pattern originated from
231 PatternType getPatternType() const { return PTy; }
233 /// getTrees - Return the tree patterns which corresponds to this pattern.
235 const std::vector<TreePatternNode*> &getTrees() const { return Trees; }
237 /// getRecord - Return the actual TableGen record corresponding to this
240 Record *getRecord() const { return TheRecord; }
242 unsigned getNumArgs() const { return Args.size(); }
243 const std::string &getArgName(unsigned i) const {
244 assert(i < Args.size() && "Argument reference out of range!");
248 DAGISelEmitter &getDAGISelEmitter() const { return ISE; }
250 /// InlinePatternFragments - If this pattern refers to any pattern
251 /// fragments, inline them into place, giving us a pattern without any
252 /// PatFrag references.
253 void InlinePatternFragments() {
254 for (unsigned i = 0, e = Trees.size(); i != e; ++i)
255 Trees[i] = Trees[i]->InlinePatternFragments(*this);
258 /// InferAllTypes - Infer/propagate as many types throughout the expression
259 /// patterns as possible. Return true if all types are infered, false
260 /// otherwise. Throw an exception if a type contradiction is found.
261 bool InferAllTypes();
263 /// error - Throw an exception, prefixing it with information about this
265 void error(const std::string &Msg) const;
267 void print(std::ostream &OS) const;
271 MVT::ValueType getIntrinsicType(Record *R) const;
272 TreePatternNode *ParseTreePattern(DagInit *DI);
277 /// InstrSelectorEmitter - The top-level class which coordinates construction
278 /// and emission of the instruction selector.
280 class DAGISelEmitter : public TableGenBackend {
281 RecordKeeper &Records;
282 CodeGenTarget Target;
284 std::map<Record*, SDNodeInfo> SDNodes;
285 std::map<Record*, TreePattern*> PatternFragments;
286 std::vector<TreePattern*> Instructions;
288 DAGISelEmitter(RecordKeeper &R) : Records(R) {}
290 // run - Output the isel, returning true on failure.
291 void run(std::ostream &OS);
293 const SDNodeInfo &getSDNodeInfo(Record *R) const {
294 assert(SDNodes.count(R) && "Unknown node!");
295 return SDNodes.find(R)->second;
298 TreePattern *getPatternFragment(Record *R) const {
299 assert(PatternFragments.count(R) && "Invalid pattern fragment request!");
300 return PatternFragments.find(R)->second;
304 void ParseNodeInfo();
305 void ParseAndResolvePatternFragments(std::ostream &OS);
306 void ParseAndResolveInstructions();
307 void EmitInstructionSelector(std::ostream &OS);
310 } // End llvm namespace