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 EmitMatcherList(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:
130 OS.PadToColumn(CommentIndent) << "// "
131 << cast<RecordMatcherNode>(N)->getWhatFor() << '\n';
133 case MatcherNode::MoveChild:
134 OS << "OPC_MoveChild, "
135 << cast<MoveChildMatcherNode>(N)->getChildNo() << ",\n";
138 case MatcherNode::MoveParent:
139 OS << "OPC_MoveParent,\n";
142 case MatcherNode::CheckSame:
143 OS << "OPC_CheckSame, "
144 << cast<CheckSameMatcherNode>(N)->getMatchNumber() << ",\n";
147 case MatcherNode::CheckPatternPredicate: {
148 StringRef Pred = cast<CheckPatternPredicateMatcherNode>(N)->getPredicate();
149 OS << "OPC_CheckPatternPredicate, " << getPatternPredicate(Pred) << ',';
150 OS.PadToColumn(CommentIndent) << "// " << Pred << '\n';
153 case MatcherNode::CheckPredicate: {
154 StringRef Pred = cast<CheckPredicateMatcherNode>(N)->getPredicateName();
155 OS << "OPC_CheckPredicate, " << getNodePredicate(Pred) << ',';
156 OS.PadToColumn(CommentIndent) << "// " << Pred << '\n';
160 case MatcherNode::CheckOpcode:
161 OS << "OPC_CheckOpcode, "
162 << cast<CheckOpcodeMatcherNode>(N)->getOpcodeName() << ",\n";
165 case MatcherNode::CheckType:
166 OS << "OPC_CheckType, "
167 << getEnumName(cast<CheckTypeMatcherNode>(N)->getType()) << ",\n";
170 case MatcherNode::CheckInteger: {
171 int64_t Val = cast<CheckIntegerMatcherNode>(N)->getValue();
172 OS << "OPC_CheckInteger" << ClassifyInt(Val) << ", ";
173 return EmitInt(Val, OS)+1;
175 case MatcherNode::CheckCondCode:
176 OS << "OPC_CheckCondCode, ISD::"
177 << cast<CheckCondCodeMatcherNode>(N)->getCondCodeName() << ",\n";
180 case MatcherNode::CheckValueType:
181 OS << "OPC_CheckValueType, MVT::"
182 << cast<CheckValueTypeMatcherNode>(N)->getTypeName() << ",\n";
185 case MatcherNode::CheckComplexPat: {
186 const ComplexPattern &Pattern =
187 cast<CheckComplexPatMatcherNode>(N)->getPattern();
188 OS << "OPC_CheckComplexPat, " << getComplexPat(Pattern) << ',';
189 OS.PadToColumn(CommentIndent) << "// " << Pattern.getSelectFunc();
190 OS << ": " << Pattern.getNumOperands() << " operands";
191 if (Pattern.hasProperty(SDNPHasChain))
192 OS << " + chain result and input";
197 case MatcherNode::CheckAndImm: {
198 int64_t Val = cast<CheckAndImmMatcherNode>(N)->getValue();
199 OS << "OPC_CheckAndImm" << ClassifyInt(Val) << ", ";
200 return EmitInt(Val, OS)+1;
203 case MatcherNode::CheckOrImm: {
204 int64_t Val = cast<CheckOrImmMatcherNode>(N)->getValue();
205 OS << "OPC_CheckOrImm" << ClassifyInt(Val) << ", ";
206 return EmitInt(Val, OS)+1;
208 case MatcherNode::CheckFoldableChainNode:
209 OS << "OPC_CheckFoldableChainNode,\n";
211 case MatcherNode::CheckChainCompatible:
212 OS << "OPC_CheckChainCompatible, "
213 << cast<CheckChainCompatibleMatcherNode>(N)->getPreviousOp() << ",\n";
216 assert(0 && "Unreachable");
220 /// EmitMatcherList - Emit the bytes for the specified matcher subtree.
221 unsigned MatcherTableEmitter::
222 EmitMatcherList(const MatcherNode *N, unsigned Indent) {
225 // Push is a special case since it is binary.
226 if (const PushMatcherNode *PMN = dyn_cast<PushMatcherNode>(N)) {
227 // We need to encode the child and the offset of the failure code before
228 // emitting either of them. Handle this by buffering the output into a
229 // string while we get the size.
230 SmallString<128> TmpBuf;
233 raw_svector_ostream OS(TmpBuf);
234 formatted_raw_ostream FOS(OS);
235 NextSize = EmitMatcherList(cast<PushMatcherNode>(N)->getNext(),
239 if (NextSize > 255) {
241 "Tblgen internal error: can't handle predicate this complex yet\n";
245 OS.PadToColumn(Indent*2);
246 OS << "OPC_Push, " << NextSize << ",\n";
249 Size += 2 + NextSize;
251 N = PMN->getFailure();
255 Size += EmitMatcher(N, Indent);
257 // If there are other nodes in this list, iterate to them, otherwise we're
264 void MatcherTableEmitter::EmitPredicateFunctions() {
265 // FIXME: Don't build off the DAGISelEmitter's predicates, emit them directly
266 // here into the case stmts.
268 // Emit pattern predicates.
269 OS << "bool CheckPatternPredicate(unsigned PredNo) const {\n";
270 OS << " switch (PredNo) {\n";
271 OS << " default: assert(0 && \"Invalid predicate in table?\");\n";
272 for (unsigned i = 0, e = PatternPredicates.size(); i != e; ++i)
273 OS << " case " << i << ": return " << PatternPredicates[i] << ";\n";
277 // Emit Node predicates.
278 OS << "bool CheckNodePredicate(SDNode *N, unsigned PredNo) const {\n";
279 OS << " switch (PredNo) {\n";
280 OS << " default: assert(0 && \"Invalid predicate in table?\");\n";
281 for (unsigned i = 0, e = NodePredicates.size(); i != e; ++i)
282 OS << " case " << i << ": return " << NodePredicates[i] << "(N);\n";
286 // Emit CompletePattern matchers.
287 OS << "bool CheckComplexPattern(SDNode *Root, SDValue N,\n";
288 OS << " unsigned PatternNo, SmallVectorImpl<SDValue> &Result) {\n";
289 OS << " switch (PatternNo) {\n";
290 OS << " default: assert(0 && \"Invalid pattern # in table?\");\n";
291 for (unsigned i = 0, e = ComplexPatterns.size(); i != e; ++i) {
292 const ComplexPattern &P = *ComplexPatterns[i];
293 unsigned NumOps = P.getNumOperands();
294 if (P.hasProperty(SDNPHasChain))
295 NumOps += 2; // Input and output chains.
296 OS << " case " << i << ":\n";
297 OS << " Result.resize(Result.size()+" << NumOps << ");\n";
298 OS << " return " << P.getSelectFunc() << "(Root, N";
299 for (unsigned i = 0; i != NumOps; ++i)
300 OS << ", Result[Result.size()-" << (NumOps-i) << ']';
308 void llvm::EmitMatcherTable(const MatcherNode *Matcher, raw_ostream &O) {
309 formatted_raw_ostream OS(O);
311 OS << "// The main instruction selector code.\n";
312 OS << "SDNode *SelectCode2(SDNode *N) {\n";
314 MatcherTableEmitter MatcherEmitter(OS);
316 OS << " static const unsigned char MatcherTable[] = {\n";
317 unsigned TotalSize = MatcherEmitter.EmitMatcherList(Matcher, 2);
318 OS << " 0\n }; // Total Array size is " << (TotalSize+1) << " bytes\n\n";
319 OS << " return SelectCodeCommon(N, MatcherTable,sizeof(MatcherTable));\n}\n";
322 // Next up, emit the function for node and pattern predicates:
323 MatcherEmitter.EmitPredicateFunctions();