blob: c3169509db51d828d4424e965639cf6091ba118a [file] [log] [blame]
Chris Lattnerda272d12010-02-15 08:04:42 +00001//===- DAGISelMatcherEmitter.cpp - Matcher Emitter ------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file contains code to generate C++ code a matcher.
11//
12//===----------------------------------------------------------------------===//
13
14#include "DAGISelMatcher.h"
15#include "CodeGenDAGPatterns.h"
Chris Lattner8e946be2010-02-21 03:22:59 +000016#include "Record.h"
Chris Lattnere609a512010-02-17 00:31:50 +000017#include "llvm/ADT/DenseMap.h"
Chris Lattnerda272d12010-02-15 08:04:42 +000018#include "llvm/ADT/SmallString.h"
Chris Lattner050a03d2010-02-16 07:21:10 +000019#include "llvm/ADT/StringMap.h"
Chris Lattnerda272d12010-02-15 08:04:42 +000020#include "llvm/Support/FormattedStream.h"
21using namespace llvm;
22
23namespace {
24enum {
Chris Lattner5be6e592010-02-17 00:39:26 +000025 CommentIndent = 30
Chris Lattnerda272d12010-02-15 08:04:42 +000026};
27}
28
Chris Lattnerda272d12010-02-15 08:04:42 +000029/// ClassifyInt - Classify an integer by size, return '1','2','4','8' if this
30/// fits in 1, 2, 4, or 8 sign extended bytes.
31static char ClassifyInt(int64_t Val) {
32 if (Val == int8_t(Val)) return '1';
33 if (Val == int16_t(Val)) return '2';
34 if (Val == int32_t(Val)) return '4';
35 return '8';
36}
37
38/// EmitInt - Emit the specified integer, returning the number of bytes emitted.
39static unsigned EmitInt(int64_t Val, formatted_raw_ostream &OS) {
40 unsigned BytesEmitted = 1;
41 OS << (int)(unsigned char)Val << ", ";
42 if (Val == int8_t(Val)) {
Chris Lattner8e946be2010-02-21 03:22:59 +000043 OS << '\n';
Chris Lattnerda272d12010-02-15 08:04:42 +000044 return BytesEmitted;
45 }
46
47 OS << (int)(unsigned char)(Val >> 8) << ", ";
48 ++BytesEmitted;
49
50 if (Val != int16_t(Val)) {
Chris Lattner8e946be2010-02-21 03:22:59 +000051 OS << (int)(unsigned char)(Val >> 16) << ", "
52 << (int)(unsigned char)(Val >> 24) << ", ";
Chris Lattnerda272d12010-02-15 08:04:42 +000053 BytesEmitted += 2;
54
55 if (Val != int32_t(Val)) {
Chris Lattner8e946be2010-02-21 03:22:59 +000056 OS << (int)(unsigned char)(Val >> 32) << ", "
57 << (int)(unsigned char)(Val >> 40) << ", "
58 << (int)(unsigned char)(Val >> 48) << ", "
59 << (int)(unsigned char)(Val >> 56) << ", ";
Chris Lattnerda272d12010-02-15 08:04:42 +000060 BytesEmitted += 4;
61 }
62 }
63
Chris Lattner8e946be2010-02-21 03:22:59 +000064 OS.PadToColumn(CommentIndent) << "// " << Val << " aka 0x";
65 OS.write_hex(Val) << '\n';
Chris Lattnerda272d12010-02-15 08:04:42 +000066 return BytesEmitted;
67}
68
Chris Lattnere02ea542010-02-16 06:52:01 +000069namespace {
70class MatcherTableEmitter {
Chris Lattner050a03d2010-02-16 07:21:10 +000071 StringMap<unsigned> NodePredicateMap, PatternPredicateMap;
72 std::vector<std::string> NodePredicates, PatternPredicates;
Chris Lattnere609a512010-02-17 00:31:50 +000073
74 DenseMap<const ComplexPattern*, unsigned> ComplexPatternMap;
75 std::vector<const ComplexPattern*> ComplexPatterns;
Chris Lattner8e946be2010-02-21 03:22:59 +000076
77
78 DenseMap<Record*, unsigned> NodeXFormMap;
79 std::vector<const Record*> NodeXForms;
80
Chris Lattnere02ea542010-02-16 06:52:01 +000081public:
Chris Lattner984e1882010-02-21 06:30:04 +000082 MatcherTableEmitter() {}
Chris Lattnere02ea542010-02-16 06:52:01 +000083
Chris Lattner984e1882010-02-21 06:30:04 +000084 unsigned EmitMatcherList(const MatcherNode *N, unsigned Indent,
Chris Lattner8fbad242010-02-21 07:16:41 +000085 unsigned StartIdx, formatted_raw_ostream &OS);
Chris Lattner050a03d2010-02-16 07:21:10 +000086
Chris Lattner984e1882010-02-21 06:30:04 +000087 void EmitPredicateFunctions(formatted_raw_ostream &OS);
Chris Lattnere02ea542010-02-16 06:52:01 +000088private:
Chris Lattner984e1882010-02-21 06:30:04 +000089 unsigned EmitMatcher(const MatcherNode *N, unsigned Indent,
90 formatted_raw_ostream &OS);
Chris Lattner050a03d2010-02-16 07:21:10 +000091
92 unsigned getNodePredicate(StringRef PredName) {
93 unsigned &Entry = NodePredicateMap[PredName];
94 if (Entry == 0) {
95 NodePredicates.push_back(PredName.str());
96 Entry = NodePredicates.size();
97 }
98 return Entry-1;
99 }
100 unsigned getPatternPredicate(StringRef PredName) {
101 unsigned &Entry = PatternPredicateMap[PredName];
102 if (Entry == 0) {
103 PatternPredicates.push_back(PredName.str());
104 Entry = PatternPredicates.size();
105 }
106 return Entry-1;
107 }
Chris Lattnere609a512010-02-17 00:31:50 +0000108
109 unsigned getComplexPat(const ComplexPattern &P) {
110 unsigned &Entry = ComplexPatternMap[&P];
111 if (Entry == 0) {
112 ComplexPatterns.push_back(&P);
113 Entry = ComplexPatterns.size();
114 }
115 return Entry-1;
116 }
Chris Lattner8e946be2010-02-21 03:22:59 +0000117
118 unsigned getNodeXFormID(Record *Rec) {
119 unsigned &Entry = NodeXFormMap[Rec];
120 if (Entry == 0) {
121 NodeXForms.push_back(Rec);
122 Entry = NodeXForms.size();
123 }
124 return Entry-1;
125 }
126
Chris Lattnere02ea542010-02-16 06:52:01 +0000127};
128} // end anonymous namespace.
129
Chris Lattner5007e1e2010-02-23 00:59:59 +0000130/// EmitVBRValue - Emit the specified value as a VBR, returning the number of
131/// bytes emitted.
132static unsigned EmitVBRValue(unsigned Val, raw_ostream &OS) {
133 if (Val <= 127) {
134 OS << Val << ", ";
135 return 1;
136 }
137
138 unsigned InVal = Val;
139 unsigned NumBytes = 0;
Chris Lattner860d4a72010-02-23 01:07:39 +0000140 while (Val >= 128) {
Chris Lattner5007e1e2010-02-23 00:59:59 +0000141 OS << (Val&127) << "|128,";
142 Val >>= 7;
143 ++NumBytes;
144 }
145 OS << Val << "/*" << InVal << "*/, ";
146 return NumBytes+1;
147}
148
Chris Lattnerda272d12010-02-15 08:04:42 +0000149/// EmitMatcherOpcodes - Emit bytes for the specified matcher and return
150/// the number of bytes emitted.
Chris Lattnere02ea542010-02-16 06:52:01 +0000151unsigned MatcherTableEmitter::
Chris Lattner984e1882010-02-21 06:30:04 +0000152EmitMatcher(const MatcherNode *N, unsigned Indent, formatted_raw_ostream &OS) {
Chris Lattnerda272d12010-02-15 08:04:42 +0000153 OS.PadToColumn(Indent*2);
154
155 switch (N->getKind()) {
156 case MatcherNode::Push: assert(0 && "Should be handled by caller");
Chris Lattner845c0422010-02-18 22:03:03 +0000157 case MatcherNode::RecordNode:
158 OS << "OPC_RecordNode,";
Chris Lattnerc96087b2010-02-17 01:03:09 +0000159 OS.PadToColumn(CommentIndent) << "// "
160 << cast<RecordMatcherNode>(N)->getWhatFor() << '\n';
Chris Lattnerda272d12010-02-15 08:04:42 +0000161 return 1;
Chris Lattner8e946be2010-02-21 03:22:59 +0000162
163 case MatcherNode::RecordMemRef:
164 OS << "OPC_RecordMemRef,\n";
165 return 1;
166
167 case MatcherNode::CaptureFlagInput:
168 OS << "OPC_CaptureFlagInput,\n";
169 return 1;
170
Chris Lattnerda272d12010-02-15 08:04:42 +0000171 case MatcherNode::MoveChild:
172 OS << "OPC_MoveChild, "
173 << cast<MoveChildMatcherNode>(N)->getChildNo() << ",\n";
174 return 2;
175
176 case MatcherNode::MoveParent:
177 OS << "OPC_MoveParent,\n";
178 return 1;
179
180 case MatcherNode::CheckSame:
181 OS << "OPC_CheckSame, "
182 << cast<CheckSameMatcherNode>(N)->getMatchNumber() << ",\n";
183 return 2;
184
Chris Lattner050a03d2010-02-16 07:21:10 +0000185 case MatcherNode::CheckPatternPredicate: {
186 StringRef Pred = cast<CheckPatternPredicateMatcherNode>(N)->getPredicate();
187 OS << "OPC_CheckPatternPredicate, " << getPatternPredicate(Pred) << ',';
188 OS.PadToColumn(CommentIndent) << "// " << Pred << '\n';
Chris Lattnerda272d12010-02-15 08:04:42 +0000189 return 2;
Chris Lattner050a03d2010-02-16 07:21:10 +0000190 }
191 case MatcherNode::CheckPredicate: {
192 StringRef Pred = cast<CheckPredicateMatcherNode>(N)->getPredicateName();
193 OS << "OPC_CheckPredicate, " << getNodePredicate(Pred) << ',';
194 OS.PadToColumn(CommentIndent) << "// " << Pred << '\n';
Chris Lattnerda272d12010-02-15 08:04:42 +0000195 return 2;
Chris Lattner050a03d2010-02-16 07:21:10 +0000196 }
197
Chris Lattnerda272d12010-02-15 08:04:42 +0000198 case MatcherNode::CheckOpcode:
199 OS << "OPC_CheckOpcode, "
200 << cast<CheckOpcodeMatcherNode>(N)->getOpcodeName() << ",\n";
201 return 2;
202
Chris Lattner12a667c2010-02-22 22:30:37 +0000203 case MatcherNode::CheckMultiOpcode: {
204 const CheckMultiOpcodeMatcherNode *CMO=cast<CheckMultiOpcodeMatcherNode>(N);
205 OS << "OPC_CheckMultiOpcode, " << CMO->getNumOpcodeNames() << ", ";
206 for (unsigned i = 0, e = CMO->getNumOpcodeNames(); i != e; ++i)
207 OS << CMO->getOpcodeName(i) << ", ";
208 OS << '\n';
209 return 2 + CMO->getNumOpcodeNames();
210 }
211
Chris Lattnerda272d12010-02-15 08:04:42 +0000212 case MatcherNode::CheckType:
213 OS << "OPC_CheckType, "
214 << getEnumName(cast<CheckTypeMatcherNode>(N)->getType()) << ",\n";
215 return 2;
216
217 case MatcherNode::CheckInteger: {
218 int64_t Val = cast<CheckIntegerMatcherNode>(N)->getValue();
219 OS << "OPC_CheckInteger" << ClassifyInt(Val) << ", ";
220 return EmitInt(Val, OS)+1;
221 }
222 case MatcherNode::CheckCondCode:
223 OS << "OPC_CheckCondCode, ISD::"
224 << cast<CheckCondCodeMatcherNode>(N)->getCondCodeName() << ",\n";
225 return 2;
226
227 case MatcherNode::CheckValueType:
228 OS << "OPC_CheckValueType, MVT::"
229 << cast<CheckValueTypeMatcherNode>(N)->getTypeName() << ",\n";
230 return 2;
231
Chris Lattner5be6e592010-02-17 00:39:26 +0000232 case MatcherNode::CheckComplexPat: {
233 const ComplexPattern &Pattern =
234 cast<CheckComplexPatMatcherNode>(N)->getPattern();
235 OS << "OPC_CheckComplexPat, " << getComplexPat(Pattern) << ',';
Chris Lattner781f3592010-02-17 06:47:35 +0000236 OS.PadToColumn(CommentIndent) << "// " << Pattern.getSelectFunc();
237 OS << ": " << Pattern.getNumOperands() << " operands";
238 if (Pattern.hasProperty(SDNPHasChain))
239 OS << " + chain result and input";
240 OS << '\n';
Chris Lattnerda272d12010-02-15 08:04:42 +0000241 return 2;
Chris Lattner5be6e592010-02-17 00:39:26 +0000242 }
Chris Lattnerda272d12010-02-15 08:04:42 +0000243
244 case MatcherNode::CheckAndImm: {
245 int64_t Val = cast<CheckAndImmMatcherNode>(N)->getValue();
246 OS << "OPC_CheckAndImm" << ClassifyInt(Val) << ", ";
247 return EmitInt(Val, OS)+1;
248 }
249
250 case MatcherNode::CheckOrImm: {
251 int64_t Val = cast<CheckOrImmMatcherNode>(N)->getValue();
252 OS << "OPC_CheckOrImm" << ClassifyInt(Val) << ", ";
253 return EmitInt(Val, OS)+1;
254 }
Chris Lattner21390d72010-02-16 19:15:55 +0000255 case MatcherNode::CheckFoldableChainNode:
256 OS << "OPC_CheckFoldableChainNode,\n";
Chris Lattnere39650a2010-02-16 06:10:58 +0000257 return 1;
Chris Lattner9a747f12010-02-17 06:23:39 +0000258 case MatcherNode::CheckChainCompatible:
259 OS << "OPC_CheckChainCompatible, "
260 << cast<CheckChainCompatibleMatcherNode>(N)->getPreviousOp() << ",\n";
261 return 2;
Chris Lattner845c0422010-02-18 22:03:03 +0000262
Chris Lattner906b4992010-02-19 07:49:56 +0000263 case MatcherNode::EmitInteger: {
264 int64_t Val = cast<EmitIntegerMatcherNode>(N)->getValue();
265 OS << "OPC_EmitInteger" << ClassifyInt(Val) << ", "
266 << getEnumName(cast<EmitIntegerMatcherNode>(N)->getVT()) << ", ";
267 return EmitInt(Val, OS)+2;
268 }
Chris Lattner8e946be2010-02-21 03:22:59 +0000269 case MatcherNode::EmitStringInteger: {
270 const std::string &Val = cast<EmitStringIntegerMatcherNode>(N)->getValue();
271 // These should always fit into one byte.
272 OS << "OPC_EmitInteger1, "
273 << getEnumName(cast<EmitStringIntegerMatcherNode>(N)->getVT()) << ", "
274 << Val << ",\n";
275 return 3;
276 }
Chris Lattner906b4992010-02-19 07:49:56 +0000277
Chris Lattner845c0422010-02-18 22:03:03 +0000278 case MatcherNode::EmitRegister:
Chris Lattner906b4992010-02-19 07:49:56 +0000279 OS << "OPC_EmitRegister, "
280 << getEnumName(cast<EmitRegisterMatcherNode>(N)->getVT()) << ", ";
281 if (Record *R = cast<EmitRegisterMatcherNode>(N)->getReg())
282 OS << getQualifiedName(R) << ",\n";
283 else
284 OS << "0 /*zero_reg*/,\n";
285 return 3;
Chris Lattner8e946be2010-02-21 03:22:59 +0000286
287 case MatcherNode::EmitConvertToTarget:
288 OS << "OPC_EmitConvertToTarget, "
289 << cast<EmitConvertToTargetMatcherNode>(N)->getSlot() << ",\n";
290 return 2;
291
292 case MatcherNode::EmitMergeInputChains: {
293 const EmitMergeInputChainsMatcherNode *MN =
294 cast<EmitMergeInputChainsMatcherNode>(N);
295 OS << "OPC_EmitMergeInputChains, " << MN->getNumNodes() << ", ";
296 for (unsigned i = 0, e = MN->getNumNodes(); i != e; ++i)
297 OS << MN->getNode(i) << ", ";
298 OS << '\n';
299 return 2+MN->getNumNodes();
300 }
301 case MatcherNode::EmitCopyToReg:
302 OS << "OPC_EmitCopyToReg, "
303 << cast<EmitCopyToRegMatcherNode>(N)->getSrcSlot() << ", "
304 << getQualifiedName(cast<EmitCopyToRegMatcherNode>(N)->getDestPhysReg())
305 << ",\n";
306 return 3;
307 case MatcherNode::EmitNodeXForm: {
308 const EmitNodeXFormMatcherNode *XF = cast<EmitNodeXFormMatcherNode>(N);
309 OS << "OPC_EmitNodeXForm, " << getNodeXFormID(XF->getNodeXForm()) << ", "
310 << XF->getSlot() << ',';
311 OS.PadToColumn(CommentIndent) << "// "<<XF->getNodeXForm()->getName()<<'\n';
312 return 3;
313 }
314
315 case MatcherNode::EmitNode: {
316 const EmitNodeMatcherNode *EN = cast<EmitNodeMatcherNode>(N);
317 OS << "OPC_EmitNode, TARGET_OPCODE(" << EN->getOpcodeName() << "), 0";
318
319 if (EN->hasChain()) OS << "|OPFL_Chain";
320 if (EN->hasFlag()) OS << "|OPFL_Flag";
321 if (EN->hasMemRefs()) OS << "|OPFL_MemRefs";
322 if (EN->getNumFixedArityOperands() != -1)
323 OS << "|OPFL_Variadic" << EN->getNumFixedArityOperands();
324 OS << ",\n";
325
326 OS.PadToColumn(Indent*2+4) << EN->getNumVTs() << "/*#VTs*/, ";
327 for (unsigned i = 0, e = EN->getNumVTs(); i != e; ++i)
328 OS << getEnumName(EN->getVT(i)) << ", ";
329
330 OS << EN->getNumOperands() << "/*#Ops*/, ";
Chris Lattner5007e1e2010-02-23 00:59:59 +0000331 unsigned NumOperandBytes = 0;
332 for (unsigned i = 0, e = EN->getNumOperands(); i != e; ++i) {
333 // We emit the operand numbers in VBR encoded format, in case the number
334 // is too large to represent with a byte.
335 NumOperandBytes += EmitVBRValue(EN->getOperand(i), OS);
336 }
Chris Lattner8e946be2010-02-21 03:22:59 +0000337 OS << '\n';
Chris Lattner5007e1e2010-02-23 00:59:59 +0000338 return 6+EN->getNumVTs()+NumOperandBytes;
Chris Lattner8e946be2010-02-21 03:22:59 +0000339 }
Chris Lattner77f2e272010-02-21 06:03:07 +0000340 case MatcherNode::CompleteMatch: {
341 const CompleteMatchMatcherNode *CM = cast<CompleteMatchMatcherNode>(N);
342 OS << "OPC_CompleteMatch, " << CM->getNumResults() << ", ";
Chris Lattner5007e1e2010-02-23 00:59:59 +0000343 unsigned NumResultBytes = 0;
Chris Lattner77f2e272010-02-21 06:03:07 +0000344 for (unsigned i = 0, e = CM->getNumResults(); i != e; ++i)
Chris Lattner5007e1e2010-02-23 00:59:59 +0000345 NumResultBytes += EmitVBRValue(CM->getResult(i), OS);
Chris Lattner77f2e272010-02-21 06:03:07 +0000346 OS << '\n';
347 OS.PadToColumn(Indent*2) << "// Src: "
348 << *CM->getPattern().getSrcPattern() << '\n';
349 OS.PadToColumn(Indent*2) << "// Dst: "
350 << *CM->getPattern().getDstPattern() << '\n';
Chris Lattner5007e1e2010-02-23 00:59:59 +0000351 return 2 + NumResultBytes;
Chris Lattnerda272d12010-02-15 08:04:42 +0000352 }
Chris Lattner77f2e272010-02-21 06:03:07 +0000353 }
Chris Lattnerda272d12010-02-15 08:04:42 +0000354 assert(0 && "Unreachable");
355 return 0;
356}
357
Chris Lattnerbd8227f2010-02-18 02:53:41 +0000358/// EmitMatcherList - Emit the bytes for the specified matcher subtree.
Chris Lattnere02ea542010-02-16 06:52:01 +0000359unsigned MatcherTableEmitter::
Chris Lattner8fbad242010-02-21 07:16:41 +0000360EmitMatcherList(const MatcherNode *N, unsigned Indent, unsigned CurrentIdx,
Chris Lattner984e1882010-02-21 06:30:04 +0000361 formatted_raw_ostream &OS) {
Chris Lattnerda272d12010-02-15 08:04:42 +0000362 unsigned Size = 0;
Chris Lattner8ef9c792010-02-18 02:49:24 +0000363 while (N) {
Chris Lattnerda272d12010-02-15 08:04:42 +0000364 // Push is a special case since it is binary.
365 if (const PushMatcherNode *PMN = dyn_cast<PushMatcherNode>(N)) {
366 // We need to encode the child and the offset of the failure code before
367 // emitting either of them. Handle this by buffering the output into a
368 // string while we get the size.
369 SmallString<128> TmpBuf;
Chris Lattnerbd8227f2010-02-18 02:53:41 +0000370 unsigned NextSize;
Chris Lattnerda272d12010-02-15 08:04:42 +0000371 {
372 raw_svector_ostream OS(TmpBuf);
373 formatted_raw_ostream FOS(OS);
Chris Lattnerbd8227f2010-02-18 02:53:41 +0000374 NextSize = EmitMatcherList(cast<PushMatcherNode>(N)->getNext(),
Chris Lattner8fbad242010-02-21 07:16:41 +0000375 Indent+1, CurrentIdx+2, FOS);
Chris Lattnerda272d12010-02-15 08:04:42 +0000376 }
Chris Lattner3e22f2d2010-02-22 23:55:39 +0000377
378 // In the unlikely event that we have something too big to emit with a
379 // one byte offset, regenerate it with a two-byte one.
Chris Lattnerbd8227f2010-02-18 02:53:41 +0000380 if (NextSize > 255) {
Chris Lattner3e22f2d2010-02-22 23:55:39 +0000381 TmpBuf.clear();
382 raw_svector_ostream OS(TmpBuf);
383 formatted_raw_ostream FOS(OS);
384 NextSize = EmitMatcherList(cast<PushMatcherNode>(N)->getNext(),
385 Indent+1, CurrentIdx+3, FOS);
386 if (NextSize > 65535) {
387 errs() <<
388 "Tblgen internal error: can't handle pattern this complex yet\n";
389 exit(1);
390 }
Chris Lattnerda272d12010-02-15 08:04:42 +0000391 }
392
Chris Lattner8fbad242010-02-21 07:16:41 +0000393 OS << "/*" << CurrentIdx << "*/";
Chris Lattnerda272d12010-02-15 08:04:42 +0000394 OS.PadToColumn(Indent*2);
Chris Lattner3e22f2d2010-02-22 23:55:39 +0000395
396 if (NextSize < 256)
397 OS << "OPC_Push, " << NextSize << ",\n";
398 else
399 OS << "OPC_Push2, " << (NextSize&255) << ", " << (NextSize>>8) << ",\n";
Chris Lattnerda272d12010-02-15 08:04:42 +0000400 OS << TmpBuf.str();
401
Chris Lattner8fbad242010-02-21 07:16:41 +0000402 Size += 2+NextSize;
403 CurrentIdx += 2+NextSize;
Chris Lattnerda272d12010-02-15 08:04:42 +0000404 N = PMN->getFailure();
405 continue;
406 }
407
Chris Lattner8fbad242010-02-21 07:16:41 +0000408 OS << "/*" << CurrentIdx << "*/";
409 unsigned MatcherSize = EmitMatcher(N, Indent, OS);
410 Size += MatcherSize;
411 CurrentIdx += MatcherSize;
Chris Lattnerda272d12010-02-15 08:04:42 +0000412
Chris Lattnerbd8227f2010-02-18 02:53:41 +0000413 // If there are other nodes in this list, iterate to them, otherwise we're
Chris Lattnerda272d12010-02-15 08:04:42 +0000414 // done.
Chris Lattnerbd8227f2010-02-18 02:53:41 +0000415 N = N->getNext();
Chris Lattnerda272d12010-02-15 08:04:42 +0000416 }
Chris Lattner8ef9c792010-02-18 02:49:24 +0000417 return Size;
Chris Lattnerda272d12010-02-15 08:04:42 +0000418}
419
Chris Lattner984e1882010-02-21 06:30:04 +0000420void MatcherTableEmitter::EmitPredicateFunctions(formatted_raw_ostream &OS) {
Chris Lattnerb49985a2010-02-18 06:47:49 +0000421 // FIXME: Don't build off the DAGISelEmitter's predicates, emit them directly
422 // here into the case stmts.
423
Chris Lattnere609a512010-02-17 00:31:50 +0000424 // Emit pattern predicates.
Chris Lattner050a03d2010-02-16 07:21:10 +0000425 OS << "bool CheckPatternPredicate(unsigned PredNo) const {\n";
426 OS << " switch (PredNo) {\n";
427 OS << " default: assert(0 && \"Invalid predicate in table?\");\n";
428 for (unsigned i = 0, e = PatternPredicates.size(); i != e; ++i)
429 OS << " case " << i << ": return " << PatternPredicates[i] << ";\n";
430 OS << " }\n";
431 OS << "}\n\n";
432
Chris Lattnere609a512010-02-17 00:31:50 +0000433 // Emit Node predicates.
Chris Lattner050a03d2010-02-16 07:21:10 +0000434 OS << "bool CheckNodePredicate(SDNode *N, unsigned PredNo) const {\n";
435 OS << " switch (PredNo) {\n";
436 OS << " default: assert(0 && \"Invalid predicate in table?\");\n";
437 for (unsigned i = 0, e = NodePredicates.size(); i != e; ++i)
438 OS << " case " << i << ": return " << NodePredicates[i] << "(N);\n";
439 OS << " }\n";
440 OS << "}\n\n";
Chris Lattnere609a512010-02-17 00:31:50 +0000441
442 // Emit CompletePattern matchers.
Chris Lattner8e946be2010-02-21 03:22:59 +0000443 // FIXME: This should be const.
Chris Lattnere609a512010-02-17 00:31:50 +0000444 OS << "bool CheckComplexPattern(SDNode *Root, SDValue N,\n";
445 OS << " unsigned PatternNo, SmallVectorImpl<SDValue> &Result) {\n";
446 OS << " switch (PatternNo) {\n";
447 OS << " default: assert(0 && \"Invalid pattern # in table?\");\n";
448 for (unsigned i = 0, e = ComplexPatterns.size(); i != e; ++i) {
449 const ComplexPattern &P = *ComplexPatterns[i];
450 unsigned NumOps = P.getNumOperands();
Chris Lattner8e946be2010-02-21 03:22:59 +0000451
Chris Lattnere609a512010-02-17 00:31:50 +0000452 if (P.hasProperty(SDNPHasChain))
Chris Lattner8e946be2010-02-21 03:22:59 +0000453 ++NumOps; // Get the chained node too.
454
Chris Lattnere609a512010-02-17 00:31:50 +0000455 OS << " case " << i << ":\n";
456 OS << " Result.resize(Result.size()+" << NumOps << ");\n";
Chris Lattner8e946be2010-02-21 03:22:59 +0000457 OS << " return " << P.getSelectFunc();
458
459 // FIXME: Temporary hack until old isel dies.
460 if (P.hasProperty(SDNPHasChain))
461 OS << "XXX";
462
463 OS << "(Root, N";
Chris Lattnere609a512010-02-17 00:31:50 +0000464 for (unsigned i = 0; i != NumOps; ++i)
465 OS << ", Result[Result.size()-" << (NumOps-i) << ']';
466 OS << ");\n";
467 }
468 OS << " }\n";
469 OS << "}\n\n";
Chris Lattner8e946be2010-02-21 03:22:59 +0000470
471 // Emit SDNodeXForm handlers.
472 // FIXME: This should be const.
473 OS << "SDValue RunSDNodeXForm(SDValue V, unsigned XFormNo) {\n";
474 OS << " switch (XFormNo) {\n";
475 OS << " default: assert(0 && \"Invalid xform # in table?\");\n";
476
477 // FIXME: The node xform could take SDValue's instead of SDNode*'s.
478 for (unsigned i = 0, e = NodeXForms.size(); i != e; ++i)
479 OS << " case " << i << ": return Transform_" << NodeXForms[i]->getName()
480 << "(V.getNode());\n";
481 OS << " }\n";
482 OS << "}\n\n";
Chris Lattner050a03d2010-02-16 07:21:10 +0000483}
484
485
Chris Lattnerda272d12010-02-15 08:04:42 +0000486void llvm::EmitMatcherTable(const MatcherNode *Matcher, raw_ostream &O) {
487 formatted_raw_ostream OS(O);
488
489 OS << "// The main instruction selector code.\n";
490 OS << "SDNode *SelectCode2(SDNode *N) {\n";
491
Chris Lattner984e1882010-02-21 06:30:04 +0000492 MatcherTableEmitter MatcherEmitter;
Chris Lattnere02ea542010-02-16 06:52:01 +0000493
Chris Lattner8e946be2010-02-21 03:22:59 +0000494 OS << " // Opcodes are emitted as 2 bytes, TARGET_OPCODE handles this.\n";
495 OS << " #define TARGET_OPCODE(X) X & 255, unsigned(X) >> 8\n";
Chris Lattnerda272d12010-02-15 08:04:42 +0000496 OS << " static const unsigned char MatcherTable[] = {\n";
Chris Lattner8fbad242010-02-21 07:16:41 +0000497 unsigned TotalSize = MatcherEmitter.EmitMatcherList(Matcher, 5, 0, OS);
Chris Lattnerda272d12010-02-15 08:04:42 +0000498 OS << " 0\n }; // Total Array size is " << (TotalSize+1) << " bytes\n\n";
Chris Lattner8e946be2010-02-21 03:22:59 +0000499 OS << " #undef TARGET_OPCODE\n";
Chris Lattnere02ea542010-02-16 06:52:01 +0000500 OS << " return SelectCodeCommon(N, MatcherTable,sizeof(MatcherTable));\n}\n";
Chris Lattner050a03d2010-02-16 07:21:10 +0000501 OS << "\n";
502
503 // Next up, emit the function for node and pattern predicates:
Chris Lattner984e1882010-02-21 06:30:04 +0000504 MatcherEmitter.EmitPredicateFunctions(OS);
Chris Lattnerda272d12010-02-15 08:04:42 +0000505}