1 //===- DAGISelMatcherEmitter.cpp - Matcher Emitter ------------------------===//
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 contains code to generate C++ code a matcher.
12 //===----------------------------------------------------------------------===//
14 #include "DAGISelMatcher.h"
15 #include "CodeGenDAGPatterns.h"
16 #include "llvm/ADT/DenseMap.h"
17 #include "llvm/ADT/SmallString.h"
18 #include "llvm/ADT/StringMap.h"
19 #include "llvm/Support/FormattedStream.h"
28 /// ClassifyInt - Classify an integer by size, return '1','2','4','8' if this
29 /// fits in 1, 2, 4, or 8 sign extended bytes.
30 static char ClassifyInt(int64_t Val) {
31 if (Val == int8_t(Val)) return '1';
32 if (Val == int16_t(Val)) return '2';
33 if (Val == int32_t(Val)) return '4';
37 /// EmitInt - Emit the specified integer, returning the number of bytes emitted.
38 static unsigned EmitInt(int64_t Val, formatted_raw_ostream &OS) {
39 unsigned BytesEmitted = 1;
40 OS << (int)(unsigned char)Val << ", ";
41 if (Val == int8_t(Val)) {
46 OS << (int)(unsigned char)(Val >> 8) << ", ";
49 if (Val != int16_t(Val)) {
50 OS << (int)(unsigned char)(Val >> 16) << ','
51 << (int)(unsigned char)(Val >> 24) << ',';
54 if (Val != int32_t(Val)) {
55 OS << (int)(unsigned char)(Val >> 32) << ','
56 << (int)(unsigned char)(Val >> 40) << ','
57 << (int)(unsigned char)(Val >> 48) << ','
58 << (int)(unsigned char)(Val >> 56) << ',';
63 OS.PadToColumn(CommentIndent) << "// " << Val << '\n';
68 class MatcherTableEmitter {
69 formatted_raw_ostream &OS;
71 StringMap<unsigned> NodePredicateMap, PatternPredicateMap;
72 std::vector<std::string> NodePredicates, PatternPredicates;
74 DenseMap<const ComplexPattern*, unsigned> ComplexPatternMap;
75 std::vector<const ComplexPattern*> ComplexPatterns;
77 MatcherTableEmitter(formatted_raw_ostream &os) : OS(os) {}
79 unsigned EmitMatcherAndChildren(const MatcherNode *N, unsigned Indent);
81 void EmitPredicateFunctions();
83 unsigned EmitMatcher(const MatcherNode *N, unsigned Indent);
85 unsigned getNodePredicate(StringRef PredName) {
86 unsigned &Entry = NodePredicateMap[PredName];
88 NodePredicates.push_back(PredName.str());
89 Entry = NodePredicates.size();
93 unsigned getPatternPredicate(StringRef PredName) {
94 unsigned &Entry = PatternPredicateMap[PredName];
96 PatternPredicates.push_back(PredName.str());
97 Entry = PatternPredicates.size();
102 unsigned getComplexPat(const ComplexPattern &P) {
103 unsigned &Entry = ComplexPatternMap[&P];
105 ComplexPatterns.push_back(&P);
106 Entry = ComplexPatterns.size();
111 } // end anonymous namespace.
113 /// EmitMatcherOpcodes - Emit bytes for the specified matcher and return
114 /// the number of bytes emitted.
115 unsigned MatcherTableEmitter::
116 EmitMatcher(const MatcherNode *N, unsigned Indent) {
117 OS.PadToColumn(Indent*2);
119 switch (N->getKind()) {
120 case MatcherNode::Push: assert(0 && "Should be handled by caller");
121 case MatcherNode::EmitNode:
123 << *cast<EmitNodeMatcherNode>(N)->getPattern().getSrcPattern() << '\n';
124 OS.PadToColumn(Indent*2) << "// Dst: "
125 << *cast<EmitNodeMatcherNode>(N)->getPattern().getDstPattern() << "\n";
126 OS.PadToColumn(Indent*2) << "OPC_Emit, /*XXX*/\n\n";
128 case MatcherNode::Record:
129 OS << "OPC_Record,\n";
131 case MatcherNode::MoveChild:
132 OS << "OPC_MoveChild, "
133 << cast<MoveChildMatcherNode>(N)->getChildNo() << ",\n";
136 case MatcherNode::MoveParent:
137 OS << "OPC_MoveParent,\n";
140 case MatcherNode::CheckSame:
141 OS << "OPC_CheckSame, "
142 << cast<CheckSameMatcherNode>(N)->getMatchNumber() << ",\n";
145 case MatcherNode::CheckPatternPredicate: {
146 StringRef Pred = cast<CheckPatternPredicateMatcherNode>(N)->getPredicate();
147 OS << "OPC_CheckPatternPredicate, " << getPatternPredicate(Pred) << ',';
148 OS.PadToColumn(CommentIndent) << "// " << Pred << '\n';
151 case MatcherNode::CheckPredicate: {
152 StringRef Pred = cast<CheckPredicateMatcherNode>(N)->getPredicateName();
153 OS << "OPC_CheckPredicate, " << getNodePredicate(Pred) << ',';
154 OS.PadToColumn(CommentIndent) << "// " << Pred << '\n';
158 case MatcherNode::CheckOpcode:
159 OS << "OPC_CheckOpcode, "
160 << cast<CheckOpcodeMatcherNode>(N)->getOpcodeName() << ",\n";
163 case MatcherNode::CheckType:
164 OS << "OPC_CheckType, "
165 << getEnumName(cast<CheckTypeMatcherNode>(N)->getType()) << ",\n";
168 case MatcherNode::CheckInteger: {
169 int64_t Val = cast<CheckIntegerMatcherNode>(N)->getValue();
170 OS << "OPC_CheckInteger" << ClassifyInt(Val) << ", ";
171 return EmitInt(Val, OS)+1;
173 case MatcherNode::CheckCondCode:
174 OS << "OPC_CheckCondCode, ISD::"
175 << cast<CheckCondCodeMatcherNode>(N)->getCondCodeName() << ",\n";
178 case MatcherNode::CheckValueType:
179 OS << "OPC_CheckValueType, MVT::"
180 << cast<CheckValueTypeMatcherNode>(N)->getTypeName() << ",\n";
183 case MatcherNode::CheckComplexPat: {
184 const ComplexPattern &Pattern =
185 cast<CheckComplexPatMatcherNode>(N)->getPattern();
186 OS << "OPC_CheckComplexPat, " << getComplexPat(Pattern) << ',';
187 OS.PadToColumn(CommentIndent) << "// " << Pattern.getSelectFunc() << '\n';
191 case MatcherNode::CheckAndImm: {
192 int64_t Val = cast<CheckAndImmMatcherNode>(N)->getValue();
193 OS << "OPC_CheckAndImm" << ClassifyInt(Val) << ", ";
194 return EmitInt(Val, OS)+1;
197 case MatcherNode::CheckOrImm: {
198 int64_t Val = cast<CheckOrImmMatcherNode>(N)->getValue();
199 OS << "OPC_CheckOrImm" << ClassifyInt(Val) << ", ";
200 return EmitInt(Val, OS)+1;
202 case MatcherNode::CheckFoldableChainNode:
203 OS << "OPC_CheckFoldableChainNode,\n";
206 assert(0 && "Unreachable");
210 /// EmitMatcherAndChildren - Emit the bytes for the specified matcher subtree.
211 unsigned MatcherTableEmitter::
212 EmitMatcherAndChildren(const MatcherNode *N, unsigned Indent) {
215 // Push is a special case since it is binary.
216 if (const PushMatcherNode *PMN = dyn_cast<PushMatcherNode>(N)) {
217 // We need to encode the child and the offset of the failure code before
218 // emitting either of them. Handle this by buffering the output into a
219 // string while we get the size.
220 SmallString<128> TmpBuf;
223 raw_svector_ostream OS(TmpBuf);
224 formatted_raw_ostream FOS(OS);
226 EmitMatcherAndChildren(cast<PushMatcherNode>(N)->getChild(),Indent+1);
229 if (ChildSize > 255) {
231 "Tblgen internal error: can't handle predicate this complex yet\n";
235 OS.PadToColumn(Indent*2);
236 OS << "OPC_Push, " << ChildSize << ",\n";
239 Size += 2 + ChildSize;
241 N = PMN->getFailure();
245 Size += EmitMatcher(N, Indent);
247 // If there are children of this node, iterate to them, otherwise we're
249 if (const MatcherNodeWithChild *MNWC = dyn_cast<MatcherNodeWithChild>(N))
250 N = MNWC->getChild();
256 void MatcherTableEmitter::EmitPredicateFunctions() {
257 // Emit pattern predicates.
258 OS << "bool CheckPatternPredicate(unsigned PredNo) const {\n";
259 OS << " switch (PredNo) {\n";
260 OS << " default: assert(0 && \"Invalid predicate in table?\");\n";
261 for (unsigned i = 0, e = PatternPredicates.size(); i != e; ++i)
262 OS << " case " << i << ": return " << PatternPredicates[i] << ";\n";
266 // Emit Node predicates.
267 OS << "bool CheckNodePredicate(SDNode *N, unsigned PredNo) const {\n";
268 OS << " switch (PredNo) {\n";
269 OS << " default: assert(0 && \"Invalid predicate in table?\");\n";
270 for (unsigned i = 0, e = NodePredicates.size(); i != e; ++i)
271 OS << " case " << i << ": return " << NodePredicates[i] << "(N);\n";
275 // Emit CompletePattern matchers.
276 OS << "bool CheckComplexPattern(SDNode *Root, SDValue N,\n";
277 OS << " unsigned PatternNo, SmallVectorImpl<SDValue> &Result) {\n";
278 OS << " switch (PatternNo) {\n";
279 OS << " default: assert(0 && \"Invalid pattern # in table?\");\n";
280 for (unsigned i = 0, e = ComplexPatterns.size(); i != e; ++i) {
281 const ComplexPattern &P = *ComplexPatterns[i];
282 unsigned NumOps = P.getNumOperands();
283 if (P.hasProperty(SDNPHasChain))
284 NumOps += 2; // Input and output chains.
285 OS << " case " << i << ":\n";
286 OS << " Result.resize(Result.size()+" << NumOps << ");\n";
287 OS << " return " << P.getSelectFunc() << "(Root, N";
288 for (unsigned i = 0; i != NumOps; ++i)
289 OS << ", Result[Result.size()-" << (NumOps-i) << ']';
297 void llvm::EmitMatcherTable(const MatcherNode *Matcher, raw_ostream &O) {
298 formatted_raw_ostream OS(O);
300 OS << "// The main instruction selector code.\n";
301 OS << "SDNode *SelectCode2(SDNode *N) {\n";
303 MatcherTableEmitter MatcherEmitter(OS);
305 OS << " static const unsigned char MatcherTable[] = {\n";
306 unsigned TotalSize = MatcherEmitter.EmitMatcherAndChildren(Matcher, 2);
307 OS << " 0\n }; // Total Array size is " << (TotalSize+1) << " bytes\n\n";
308 OS << " return SelectCodeCommon(N, MatcherTable,sizeof(MatcherTable));\n}\n";
311 // Next up, emit the function for node and pattern predicates:
312 MatcherEmitter.EmitPredicateFunctions();