blob: 206c90b75db5d3e1335b97f5ec1af9e987c608ce [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===- AsmWriterEmitter.cpp - Generate an assembly writer -----------------===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattnerfd6c2f02007-12-29 20:37:13 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This tablegen backend is emits an assembly printer for the current target.
11// Note that this is currently fairly skeletal, but will grow over time.
12//
13//===----------------------------------------------------------------------===//
14
15#include "AsmWriterEmitter.h"
16#include "CodeGenTarget.h"
17#include "Record.h"
18#include "llvm/ADT/StringExtras.h"
19#include "llvm/Support/Debug.h"
20#include "llvm/Support/MathExtras.h"
21#include <algorithm>
David Greene47974bf2009-07-20 22:02:59 +000022#include <sstream>
Daniel Dunbard4287062009-07-03 00:10:29 +000023#include <iostream>
Dan Gohmanf17a25c2007-07-18 16:29:46 +000024using namespace llvm;
25
26static bool isIdentChar(char C) {
27 return (C >= 'a' && C <= 'z') ||
28 (C >= 'A' && C <= 'Z') ||
29 (C >= '0' && C <= '9') ||
30 C == '_';
31}
32
33// This should be an anon namespace, this works around a GCC warning.
34namespace llvm {
35 struct AsmWriterOperand {
David Greene47974bf2009-07-20 22:02:59 +000036 enum OpType {
37 isLiteralTextOperand,
38 isMachineInstrOperand,
39 isLiteralStatementOperand
40 } OperandType;
Dan Gohmanf17a25c2007-07-18 16:29:46 +000041
42 /// Str - For isLiteralTextOperand, this IS the literal text. For
43 /// isMachineInstrOperand, this is the PrinterMethodName for the operand.
44 std::string Str;
45
46 /// MiOpNo - For isMachineInstrOperand, this is the operand number of the
47 /// machine instruction.
48 unsigned MIOpNo;
49
50 /// MiModifier - For isMachineInstrOperand, this is the modifier string for
51 /// an operand, specified with syntax like ${opname:modifier}.
52 std::string MiModifier;
53
Cédric Venetb1967722008-10-27 19:21:35 +000054 // To make VS STL happy
David Greene47974bf2009-07-20 22:02:59 +000055 AsmWriterOperand(OpType op = isLiteralTextOperand):OperandType(op) {}
Cédric Venet344da9b2008-10-26 15:40:44 +000056
David Greene47974bf2009-07-20 22:02:59 +000057 AsmWriterOperand(const std::string &LitStr,
58 OpType op = isLiteralTextOperand)
59 : OperandType(op), Str(LitStr) {}
Dan Gohmanf17a25c2007-07-18 16:29:46 +000060
61 AsmWriterOperand(const std::string &Printer, unsigned OpNo,
David Greene47974bf2009-07-20 22:02:59 +000062 const std::string &Modifier,
63 OpType op = isMachineInstrOperand)
64 : OperandType(op), Str(Printer), MIOpNo(OpNo),
Dan Gohmanf17a25c2007-07-18 16:29:46 +000065 MiModifier(Modifier) {}
66
67 bool operator!=(const AsmWriterOperand &Other) const {
68 if (OperandType != Other.OperandType || Str != Other.Str) return true;
69 if (OperandType == isMachineInstrOperand)
70 return MIOpNo != Other.MIOpNo || MiModifier != Other.MiModifier;
71 return false;
72 }
73 bool operator==(const AsmWriterOperand &Other) const {
74 return !operator!=(Other);
75 }
76
77 /// getCode - Return the code that prints this operand.
78 std::string getCode() const;
79 };
80}
81
82namespace llvm {
83 class AsmWriterInst {
84 public:
85 std::vector<AsmWriterOperand> Operands;
86 const CodeGenInstruction *CGI;
87
David Greene47974bf2009-07-20 22:02:59 +000088 /// MAX_GROUP_NESTING_LEVEL - The maximum number of group nesting
89 /// levels we ever expect to see in an asm operand.
90 static const int MAX_GROUP_NESTING_LEVEL = 10;
91
92 /// GroupLevel - The level of nesting of the current operand
93 /// group, such as [reg + (reg + offset)]. -1 means we are not in
94 /// a group.
95 int GroupLevel;
96
97 /// GroupDelim - Remember the delimeter for a group operand.
98 char GroupDelim[MAX_GROUP_NESTING_LEVEL];
99
100 /// InGroup - Determine whether we are in the middle of an
101 /// operand group.
102 bool InGroup() const { return GroupLevel != -1; }
103
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000104 AsmWriterInst(const CodeGenInstruction &CGI, unsigned Variant);
105
106 /// MatchesAllButOneOp - If this instruction is exactly identical to the
107 /// specified instruction except for one differing operand, return the
108 /// differing operand number. Otherwise return ~0.
109 unsigned MatchesAllButOneOp(const AsmWriterInst &Other) const;
110
111 private:
112 void AddLiteralString(const std::string &Str) {
113 // If the last operand was already a literal text string, append this to
114 // it, otherwise add a new operand.
David Greene47974bf2009-07-20 22:02:59 +0000115
116 std::string::size_type SearchStart = 0;
117 std::string::size_type SpaceStartPos = std::string::npos;
118 do {
119 // Search for whitespace and replace with calls to set the
120 // output column.
121 SpaceStartPos = Str.find_first_of(" \t", SearchStart);
122 // Assume grouped text is one operand.
123 std::string::size_type StartDelimPos = Str.find_first_of("[{(", SearchStart);
124
125 SearchStart = std::string::npos;
126
127 if (StartDelimPos != std::string::npos) {
128 ++GroupLevel;
129 assert(GroupLevel < MAX_GROUP_NESTING_LEVEL
130 && "Exceeded maximum operand group nesting level");
131 GroupDelim[GroupLevel] = Str[StartDelimPos];
132 if (SpaceStartPos != std::string::npos &&
133 SpaceStartPos > StartDelimPos) {
134 // This space doesn't count.
135 SpaceStartPos = std::string::npos;
136 }
137 }
138
139 if (InGroup()) {
140 // Find the end delimiter.
141 char EndDelim = (GroupDelim[GroupLevel] == '{' ? '}' :
142 (GroupDelim[GroupLevel] == '(' ? ')' : ']'));
143 std::string::size_type EndDelimSearchStart =
144 StartDelimPos == std::string::npos ? 0 : StartDelimPos+1;
145 std::string::size_type EndDelimPos = Str.find(EndDelim,
146 EndDelimSearchStart);
147 SearchStart = EndDelimPos;
148 if (EndDelimPos != std::string::npos) {
149 // Iterate.
150 SearchStart = EndDelimPos + 1;
151 --GroupLevel;
152 assert(GroupLevel > -2 && "Too many end delimeters!");
153 }
154 if (InGroup())
155 SpaceStartPos = std::string::npos;
156 }
157 } while (SearchStart != std::string::npos);
158
159
160 if (SpaceStartPos != std::string::npos) {
161 std::string::size_type SpaceEndPos =
162 Str.find_first_not_of(" \t", SpaceStartPos+1);
163 if (SpaceStartPos != 0) {
164 // Emit the first part of the string.
165 AddLiteralString(Str.substr(0, SpaceStartPos));
166 }
167 Operands.push_back(
168 AsmWriterOperand(
169 "O.PadToColumn(TAI->getOperandColumn(OperandColumn++), 1);\n",
170 AsmWriterOperand::isLiteralStatementOperand));
171 if (SpaceEndPos != std::string::npos) {
172 // Emit the last part of the string.
173 AddLiteralString(Str.substr(SpaceEndPos));
174 }
175 // We've emitted the whole string.
176 return;
177 }
178
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000179 if (!Operands.empty() &&
180 Operands.back().OperandType == AsmWriterOperand::isLiteralTextOperand)
181 Operands.back().Str.append(Str);
182 else
183 Operands.push_back(AsmWriterOperand(Str));
184 }
185 };
186}
187
188
189std::string AsmWriterOperand::getCode() const {
190 if (OperandType == isLiteralTextOperand)
191 return "O << \"" + Str + "\"; ";
192
David Greene47974bf2009-07-20 22:02:59 +0000193 if (OperandType == isLiteralStatementOperand) {
194 return Str;
195 }
196
197 if (OperandType == isLiteralStatementOperand) {
198 return Str;
199 }
200
201 if (OperandType == isLiteralStatementOperand) {
202 return Str;
203 }
204
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000205 std::string Result = Str + "(MI";
206 if (MIOpNo != ~0U)
207 Result += ", " + utostr(MIOpNo);
208 if (!MiModifier.empty())
209 Result += ", \"" + MiModifier + '"';
210 return Result + "); ";
211}
212
213
214/// ParseAsmString - Parse the specified Instruction's AsmString into this
215/// AsmWriterInst.
216///
David Greene47974bf2009-07-20 22:02:59 +0000217AsmWriterInst::AsmWriterInst(const CodeGenInstruction &CGI, unsigned Variant)
218 : GroupLevel(-1) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000219 this->CGI = &CGI;
220 unsigned CurVariant = ~0U; // ~0 if we are outside a {.|.|.} region, other #.
221
222 // NOTE: Any extensions to this code need to be mirrored in the
223 // AsmPrinter::printInlineAsm code that executes as compile time (assuming
224 // that inline asm strings should also get the new feature)!
225 const std::string &AsmString = CGI.AsmString;
226 std::string::size_type LastEmitted = 0;
227 while (LastEmitted != AsmString.size()) {
228 std::string::size_type DollarPos =
Nate Begemanb5b74722008-03-17 07:26:14 +0000229 AsmString.find_first_of("${|}\\", LastEmitted);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000230 if (DollarPos == std::string::npos) DollarPos = AsmString.size();
231
232 // Emit a constant string fragment.
233 if (DollarPos != LastEmitted) {
Chris Lattnera4bc2cd2009-03-13 21:33:17 +0000234 if (CurVariant == Variant || CurVariant == ~0U) {
235 for (; LastEmitted != DollarPos; ++LastEmitted)
236 switch (AsmString[LastEmitted]) {
237 case '\n': AddLiteralString("\\n"); break;
238 case '\t': AddLiteralString("\\t"); break;
239 case '"': AddLiteralString("\\\""); break;
240 case '\\': AddLiteralString("\\\\"); break;
241 default:
242 AddLiteralString(std::string(1, AsmString[LastEmitted]));
243 break;
244 }
245 } else {
246 LastEmitted = DollarPos;
247 }
Nate Begemanb5b74722008-03-17 07:26:14 +0000248 } else if (AsmString[DollarPos] == '\\') {
249 if (DollarPos+1 != AsmString.size() &&
250 (CurVariant == Variant || CurVariant == ~0U)) {
251 if (AsmString[DollarPos+1] == 'n') {
252 AddLiteralString("\\n");
253 } else if (AsmString[DollarPos+1] == 't') {
254 AddLiteralString("\\t");
255 } else if (std::string("${|}\\").find(AsmString[DollarPos+1])
256 != std::string::npos) {
257 AddLiteralString(std::string(1, AsmString[DollarPos+1]));
258 } else {
259 throw "Non-supported escaped character found in instruction '" +
260 CGI.TheDef->getName() + "'!";
261 }
262 LastEmitted = DollarPos+2;
263 continue;
264 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000265 } else if (AsmString[DollarPos] == '{') {
266 if (CurVariant != ~0U)
267 throw "Nested variants found for instruction '" +
268 CGI.TheDef->getName() + "'!";
269 LastEmitted = DollarPos+1;
270 CurVariant = 0; // We are now inside of the variant!
271 } else if (AsmString[DollarPos] == '|') {
272 if (CurVariant == ~0U)
273 throw "'|' character found outside of a variant in instruction '"
274 + CGI.TheDef->getName() + "'!";
275 ++CurVariant;
276 ++LastEmitted;
277 } else if (AsmString[DollarPos] == '}') {
278 if (CurVariant == ~0U)
279 throw "'}' character found outside of a variant in instruction '"
280 + CGI.TheDef->getName() + "'!";
281 ++LastEmitted;
282 CurVariant = ~0U;
283 } else if (DollarPos+1 != AsmString.size() &&
284 AsmString[DollarPos+1] == '$') {
285 if (CurVariant == Variant || CurVariant == ~0U)
286 AddLiteralString("$"); // "$$" -> $
287 LastEmitted = DollarPos+2;
288 } else {
289 // Get the name of the variable.
290 std::string::size_type VarEnd = DollarPos+1;
David Greene47974bf2009-07-20 22:02:59 +0000291
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000292 // handle ${foo}bar as $foo by detecting whether the character following
293 // the dollar sign is a curly brace. If so, advance VarEnd and DollarPos
294 // so the variable name does not contain the leading curly brace.
295 bool hasCurlyBraces = false;
296 if (VarEnd < AsmString.size() && '{' == AsmString[VarEnd]) {
297 hasCurlyBraces = true;
298 ++DollarPos;
299 ++VarEnd;
300 }
301
302 while (VarEnd < AsmString.size() && isIdentChar(AsmString[VarEnd]))
303 ++VarEnd;
304 std::string VarName(AsmString.begin()+DollarPos+1,
305 AsmString.begin()+VarEnd);
306
307 // Modifier - Support ${foo:modifier} syntax, where "modifier" is passed
308 // into printOperand. Also support ${:feature}, which is passed into
309 // PrintSpecial.
310 std::string Modifier;
311
312 // In order to avoid starting the next string at the terminating curly
313 // brace, advance the end position past it if we found an opening curly
314 // brace.
315 if (hasCurlyBraces) {
316 if (VarEnd >= AsmString.size())
317 throw "Reached end of string before terminating curly brace in '"
318 + CGI.TheDef->getName() + "'";
319
320 // Look for a modifier string.
321 if (AsmString[VarEnd] == ':') {
322 ++VarEnd;
323 if (VarEnd >= AsmString.size())
324 throw "Reached end of string before terminating curly brace in '"
325 + CGI.TheDef->getName() + "'";
326
327 unsigned ModifierStart = VarEnd;
328 while (VarEnd < AsmString.size() && isIdentChar(AsmString[VarEnd]))
329 ++VarEnd;
330 Modifier = std::string(AsmString.begin()+ModifierStart,
331 AsmString.begin()+VarEnd);
332 if (Modifier.empty())
333 throw "Bad operand modifier name in '"+ CGI.TheDef->getName() + "'";
334 }
335
336 if (AsmString[VarEnd] != '}')
337 throw "Variable name beginning with '{' did not end with '}' in '"
338 + CGI.TheDef->getName() + "'";
339 ++VarEnd;
340 }
341 if (VarName.empty() && Modifier.empty())
342 throw "Stray '$' in '" + CGI.TheDef->getName() +
343 "' asm string, maybe you want $$?";
344
345 if (VarName.empty()) {
346 // Just a modifier, pass this into PrintSpecial.
347 Operands.push_back(AsmWriterOperand("PrintSpecial", ~0U, Modifier));
348 } else {
349 // Otherwise, normal operand.
350 unsigned OpNo = CGI.getOperandNamed(VarName);
351 CodeGenInstruction::OperandInfo OpInfo = CGI.OperandList[OpNo];
352
353 if (CurVariant == Variant || CurVariant == ~0U) {
354 unsigned MIOp = OpInfo.MIOperandNo;
355 Operands.push_back(AsmWriterOperand(OpInfo.PrinterMethodName, MIOp,
356 Modifier));
357 }
358 }
359 LastEmitted = VarEnd;
360 }
361 }
Evan Chengf83cbf42009-07-20 06:10:07 +0000362
David Greene47974bf2009-07-20 22:02:59 +0000363 Operands.push_back(
364 AsmWriterOperand("EmitComments(*MI);\n",
365 AsmWriterOperand::isLiteralStatementOperand));
Evan Chengf83cbf42009-07-20 06:10:07 +0000366 AddLiteralString("\\n");
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000367}
368
369/// MatchesAllButOneOp - If this instruction is exactly identical to the
370/// specified instruction except for one differing operand, return the differing
371/// operand number. If more than one operand mismatches, return ~1, otherwise
372/// if the instructions are identical return ~0.
373unsigned AsmWriterInst::MatchesAllButOneOp(const AsmWriterInst &Other)const{
374 if (Operands.size() != Other.Operands.size()) return ~1;
375
376 unsigned MismatchOperand = ~0U;
377 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
Anton Korobeynikov357a27d2008-02-20 11:08:44 +0000378 if (Operands[i] != Other.Operands[i]) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000379 if (MismatchOperand != ~0U) // Already have one mismatch?
380 return ~1U;
381 else
382 MismatchOperand = i;
Anton Korobeynikov357a27d2008-02-20 11:08:44 +0000383 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000384 }
385 return MismatchOperand;
386}
387
388static void PrintCases(std::vector<std::pair<std::string,
Daniel Dunbard4287062009-07-03 00:10:29 +0000389 AsmWriterOperand> > &OpsToPrint, raw_ostream &O) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000390 O << " case " << OpsToPrint.back().first << ": ";
391 AsmWriterOperand TheOp = OpsToPrint.back().second;
392 OpsToPrint.pop_back();
393
394 // Check to see if any other operands are identical in this list, and if so,
395 // emit a case label for them.
396 for (unsigned i = OpsToPrint.size(); i != 0; --i)
397 if (OpsToPrint[i-1].second == TheOp) {
398 O << "\n case " << OpsToPrint[i-1].first << ": ";
399 OpsToPrint.erase(OpsToPrint.begin()+i-1);
400 }
401
402 // Finally, emit the code.
403 O << TheOp.getCode();
404 O << "break;\n";
405}
406
407
408/// EmitInstructions - Emit the last instruction in the vector and any other
409/// instructions that are suitably similar to it.
410static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
Daniel Dunbard4287062009-07-03 00:10:29 +0000411 raw_ostream &O) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000412 AsmWriterInst FirstInst = Insts.back();
413 Insts.pop_back();
414
415 std::vector<AsmWriterInst> SimilarInsts;
416 unsigned DifferingOperand = ~0;
417 for (unsigned i = Insts.size(); i != 0; --i) {
418 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
419 if (DiffOp != ~1U) {
420 if (DifferingOperand == ~0U) // First match!
421 DifferingOperand = DiffOp;
422
423 // If this differs in the same operand as the rest of the instructions in
424 // this class, move it to the SimilarInsts list.
425 if (DifferingOperand == DiffOp || DiffOp == ~0U) {
426 SimilarInsts.push_back(Insts[i-1]);
427 Insts.erase(Insts.begin()+i-1);
428 }
429 }
430 }
431
432 O << " case " << FirstInst.CGI->Namespace << "::"
433 << FirstInst.CGI->TheDef->getName() << ":\n";
434 for (unsigned i = 0, e = SimilarInsts.size(); i != e; ++i)
435 O << " case " << SimilarInsts[i].CGI->Namespace << "::"
436 << SimilarInsts[i].CGI->TheDef->getName() << ":\n";
437 for (unsigned i = 0, e = FirstInst.Operands.size(); i != e; ++i) {
438 if (i != DifferingOperand) {
439 // If the operand is the same for all instructions, just print it.
440 O << " " << FirstInst.Operands[i].getCode();
441 } else {
442 // If this is the operand that varies between all of the instructions,
443 // emit a switch for just this operand now.
444 O << " switch (MI->getOpcode()) {\n";
445 std::vector<std::pair<std::string, AsmWriterOperand> > OpsToPrint;
446 OpsToPrint.push_back(std::make_pair(FirstInst.CGI->Namespace + "::" +
447 FirstInst.CGI->TheDef->getName(),
448 FirstInst.Operands[i]));
449
450 for (unsigned si = 0, e = SimilarInsts.size(); si != e; ++si) {
451 AsmWriterInst &AWI = SimilarInsts[si];
452 OpsToPrint.push_back(std::make_pair(AWI.CGI->Namespace+"::"+
453 AWI.CGI->TheDef->getName(),
454 AWI.Operands[i]));
455 }
456 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
457 while (!OpsToPrint.empty())
458 PrintCases(OpsToPrint, O);
459 O << " }";
460 }
461 O << "\n";
462 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000463 O << " break;\n";
464}
465
466void AsmWriterEmitter::
467FindUniqueOperandCommands(std::vector<std::string> &UniqueOperandCommands,
468 std::vector<unsigned> &InstIdxs,
469 std::vector<unsigned> &InstOpsUsed) const {
470 InstIdxs.assign(NumberedInstructions.size(), ~0U);
471
472 // This vector parallels UniqueOperandCommands, keeping track of which
473 // instructions each case are used for. It is a comma separated string of
474 // enums.
475 std::vector<std::string> InstrsForCase;
476 InstrsForCase.resize(UniqueOperandCommands.size());
477 InstOpsUsed.assign(UniqueOperandCommands.size(), 0);
478
479 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
480 const AsmWriterInst *Inst = getAsmWriterInstByID(i);
Dan Gohmanfa607c92008-07-01 00:05:16 +0000481 if (Inst == 0) continue; // PHI, INLINEASM, DBG_LABEL, etc.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000482
483 std::string Command;
484 if (Inst->Operands.empty())
485 continue; // Instruction already done.
486
487 Command = " " + Inst->Operands[0].getCode() + "\n";
488
489 // If this is the last operand, emit a return.
David Greene47974bf2009-07-20 22:02:59 +0000490 if (Inst->Operands.size() == 1) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000491 Command += " return true;\n";
David Greene47974bf2009-07-20 22:02:59 +0000492 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000493
494 // Check to see if we already have 'Command' in UniqueOperandCommands.
495 // If not, add it.
496 bool FoundIt = false;
497 for (unsigned idx = 0, e = UniqueOperandCommands.size(); idx != e; ++idx)
498 if (UniqueOperandCommands[idx] == Command) {
499 InstIdxs[i] = idx;
500 InstrsForCase[idx] += ", ";
501 InstrsForCase[idx] += Inst->CGI->TheDef->getName();
502 FoundIt = true;
503 break;
504 }
505 if (!FoundIt) {
506 InstIdxs[i] = UniqueOperandCommands.size();
507 UniqueOperandCommands.push_back(Command);
508 InstrsForCase.push_back(Inst->CGI->TheDef->getName());
509
510 // This command matches one operand so far.
511 InstOpsUsed.push_back(1);
512 }
513 }
514
515 // For each entry of UniqueOperandCommands, there is a set of instructions
516 // that uses it. If the next command of all instructions in the set are
517 // identical, fold it into the command.
518 for (unsigned CommandIdx = 0, e = UniqueOperandCommands.size();
519 CommandIdx != e; ++CommandIdx) {
520
521 for (unsigned Op = 1; ; ++Op) {
522 // Scan for the first instruction in the set.
523 std::vector<unsigned>::iterator NIT =
524 std::find(InstIdxs.begin(), InstIdxs.end(), CommandIdx);
525 if (NIT == InstIdxs.end()) break; // No commonality.
526
527 // If this instruction has no more operands, we isn't anything to merge
528 // into this command.
529 const AsmWriterInst *FirstInst =
530 getAsmWriterInstByID(NIT-InstIdxs.begin());
531 if (!FirstInst || FirstInst->Operands.size() == Op)
532 break;
533
534 // Otherwise, scan to see if all of the other instructions in this command
535 // set share the operand.
536 bool AllSame = true;
David Greene47974bf2009-07-20 22:02:59 +0000537 // Keep track of the maximum, number of operands or any
538 // instruction we see in the group.
539 size_t MaxSize = FirstInst->Operands.size();
540
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000541 for (NIT = std::find(NIT+1, InstIdxs.end(), CommandIdx);
542 NIT != InstIdxs.end();
543 NIT = std::find(NIT+1, InstIdxs.end(), CommandIdx)) {
544 // Okay, found another instruction in this command set. If the operand
545 // matches, we're ok, otherwise bail out.
546 const AsmWriterInst *OtherInst =
547 getAsmWriterInstByID(NIT-InstIdxs.begin());
David Greene47974bf2009-07-20 22:02:59 +0000548
549 if (OtherInst &&
550 OtherInst->Operands.size() > FirstInst->Operands.size())
551 MaxSize = std::max(MaxSize, OtherInst->Operands.size());
552
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000553 if (!OtherInst || OtherInst->Operands.size() == Op ||
554 OtherInst->Operands[Op] != FirstInst->Operands[Op]) {
555 AllSame = false;
556 break;
557 }
558 }
559 if (!AllSame) break;
560
561 // Okay, everything in this command set has the same next operand. Add it
562 // to UniqueOperandCommands and remember that it was consumed.
563 std::string Command = " " + FirstInst->Operands[Op].getCode() + "\n";
564
565 // If this is the last operand, emit a return after the code.
David Greene47974bf2009-07-20 22:02:59 +0000566 if (FirstInst->Operands.size() == Op+1 &&
567 // Don't early-out too soon. Other instructions in this
568 // group may have more operands.
569 FirstInst->Operands.size() == MaxSize) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000570 Command += " return true;\n";
David Greene47974bf2009-07-20 22:02:59 +0000571 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000572
573 UniqueOperandCommands[CommandIdx] += Command;
574 InstOpsUsed[CommandIdx]++;
575 }
576 }
577
578 // Prepend some of the instructions each case is used for onto the case val.
579 for (unsigned i = 0, e = InstrsForCase.size(); i != e; ++i) {
580 std::string Instrs = InstrsForCase[i];
581 if (Instrs.size() > 70) {
582 Instrs.erase(Instrs.begin()+70, Instrs.end());
583 Instrs += "...";
584 }
585
586 if (!Instrs.empty())
587 UniqueOperandCommands[i] = " // " + Instrs + "\n" +
588 UniqueOperandCommands[i];
589 }
590}
591
592
593
Daniel Dunbard4287062009-07-03 00:10:29 +0000594void AsmWriterEmitter::run(raw_ostream &O) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000595 EmitSourceFileHeader("Assembly Writer Source Fragment", O);
596
597 CodeGenTarget Target;
598 Record *AsmWriter = Target.getAsmWriter();
599 std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
600 unsigned Variant = AsmWriter->getValueAsInt("Variant");
601
602 O <<
603 "/// printInstruction - This method is automatically generated by tablegen\n"
604 "/// from the instruction set description. This method returns true if the\n"
605 "/// machine instruction was sufficiently described to print it, otherwise\n"
606 "/// it returns false.\n"
607 "bool " << Target.getName() << ClassName
608 << "::printInstruction(const MachineInstr *MI) {\n";
609
610 std::vector<AsmWriterInst> Instructions;
611
612 for (CodeGenTarget::inst_iterator I = Target.inst_begin(),
613 E = Target.inst_end(); I != E; ++I)
614 if (!I->second.AsmString.empty())
615 Instructions.push_back(AsmWriterInst(I->second, Variant));
616
617 // Get the instruction numbering.
618 Target.getInstructionsByEnumValue(NumberedInstructions);
619
620 // Compute the CodeGenInstruction -> AsmWriterInst mapping. Note that not
621 // all machine instructions are necessarily being printed, so there may be
622 // target instructions not in this map.
623 for (unsigned i = 0, e = Instructions.size(); i != e; ++i)
624 CGIAWIMap.insert(std::make_pair(Instructions[i].CGI, &Instructions[i]));
625
626 // Build an aggregate string, and build a table of offsets into it.
627 std::map<std::string, unsigned> StringOffset;
628 std::string AggregateString;
629 AggregateString.push_back(0); // "\0"
630 AggregateString.push_back(0); // "\0"
631
632 /// OpcodeInfo - This encodes the index of the string to use for the first
633 /// chunk of the output as well as indices used for operand printing.
634 std::vector<unsigned> OpcodeInfo;
635
636 unsigned MaxStringIdx = 0;
637 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
638 AsmWriterInst *AWI = CGIAWIMap[NumberedInstructions[i]];
639 unsigned Idx;
640 if (AWI == 0) {
641 // Something not handled by the asmwriter printer.
642 Idx = 0;
643 } else if (AWI->Operands[0].OperandType !=
644 AsmWriterOperand::isLiteralTextOperand ||
645 AWI->Operands[0].Str.empty()) {
646 // Something handled by the asmwriter printer, but with no leading string.
647 Idx = 1;
648 } else {
649 unsigned &Entry = StringOffset[AWI->Operands[0].Str];
650 if (Entry == 0) {
651 // Add the string to the aggregate if this is the first time found.
652 MaxStringIdx = Entry = AggregateString.size();
653 std::string Str = AWI->Operands[0].Str;
654 UnescapeString(Str);
655 AggregateString += Str;
656 AggregateString += '\0';
657 }
658 Idx = Entry;
659
660 // Nuke the string from the operand list. It is now handled!
661 AWI->Operands.erase(AWI->Operands.begin());
662 }
663 OpcodeInfo.push_back(Idx);
664 }
665
666 // Figure out how many bits we used for the string index.
Nate Begemanb6fc8db2008-04-09 16:24:11 +0000667 unsigned AsmStrBits = Log2_32_Ceil(MaxStringIdx+1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000668
669 // To reduce code size, we compactify common instructions into a few bits
670 // in the opcode-indexed table.
671 unsigned BitsLeft = 32-AsmStrBits;
672
673 std::vector<std::vector<std::string> > TableDrivenOperandPrinters;
674
675 bool isFirst = true;
676 while (1) {
677 std::vector<std::string> UniqueOperandCommands;
678
679 // For the first operand check, add a default value for instructions with
680 // just opcode strings to use.
681 if (isFirst) {
Evan Chengf83cbf42009-07-20 06:10:07 +0000682 UniqueOperandCommands.push_back(" return true;\n");
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000683 isFirst = false;
684 }
David Greene47974bf2009-07-20 22:02:59 +0000685
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000686 std::vector<unsigned> InstIdxs;
687 std::vector<unsigned> NumInstOpsHandled;
688 FindUniqueOperandCommands(UniqueOperandCommands, InstIdxs,
689 NumInstOpsHandled);
690
691 // If we ran out of operands to print, we're done.
692 if (UniqueOperandCommands.empty()) break;
693
694 // Compute the number of bits we need to represent these cases, this is
695 // ceil(log2(numentries)).
696 unsigned NumBits = Log2_32_Ceil(UniqueOperandCommands.size());
697
698 // If we don't have enough bits for this operand, don't include it.
699 if (NumBits > BitsLeft) {
700 DOUT << "Not enough bits to densely encode " << NumBits
701 << " more bits\n";
702 break;
703 }
704
705 // Otherwise, we can include this in the initial lookup table. Add it in.
706 BitsLeft -= NumBits;
707 for (unsigned i = 0, e = InstIdxs.size(); i != e; ++i)
708 if (InstIdxs[i] != ~0U)
709 OpcodeInfo[i] |= InstIdxs[i] << (BitsLeft+AsmStrBits);
710
711 // Remove the info about this operand.
712 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
713 if (AsmWriterInst *Inst = getAsmWriterInstByID(i))
714 if (!Inst->Operands.empty()) {
715 unsigned NumOps = NumInstOpsHandled[InstIdxs[i]];
716 assert(NumOps <= Inst->Operands.size() &&
717 "Can't remove this many ops!");
718 Inst->Operands.erase(Inst->Operands.begin(),
719 Inst->Operands.begin()+NumOps);
720 }
721 }
722
723 // Remember the handlers for this set of operands.
724 TableDrivenOperandPrinters.push_back(UniqueOperandCommands);
725 }
726
727
728
729 O<<" static const unsigned OpInfo[] = {\n";
730 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
731 O << " " << OpcodeInfo[i] << "U,\t// "
732 << NumberedInstructions[i]->TheDef->getName() << "\n";
733 }
734 // Add a dummy entry so the array init doesn't end with a comma.
735 O << " 0U\n";
736 O << " };\n\n";
737
738 // Emit the string itself.
739 O << " const char *AsmStrs = \n \"";
740 unsigned CharsPrinted = 0;
741 EscapeString(AggregateString);
742 for (unsigned i = 0, e = AggregateString.size(); i != e; ++i) {
743 if (CharsPrinted > 70) {
744 O << "\"\n \"";
745 CharsPrinted = 0;
746 }
747 O << AggregateString[i];
748 ++CharsPrinted;
749
750 // Print escape sequences all together.
751 if (AggregateString[i] == '\\') {
752 assert(i+1 < AggregateString.size() && "Incomplete escape sequence!");
753 if (isdigit(AggregateString[i+1])) {
754 assert(isdigit(AggregateString[i+2]) && isdigit(AggregateString[i+3]) &&
755 "Expected 3 digit octal escape!");
756 O << AggregateString[++i];
757 O << AggregateString[++i];
758 O << AggregateString[++i];
759 CharsPrinted += 3;
760 } else {
761 O << AggregateString[++i];
762 ++CharsPrinted;
763 }
764 }
765 }
766 O << "\";\n\n";
767
Argiris Kirtzidis3f997f82009-05-07 13:55:51 +0000768 O << " processDebugLoc(MI->getDebugLoc());\n\n";
Bill Wendling4ff1cdf2009-02-18 23:12:06 +0000769
Chris Lattnerbfc9b7e2009-06-19 23:57:53 +0000770 O << "\n#ifndef NO_ASM_WRITER_BOILERPLATE\n";
771
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000772 O << " if (MI->getOpcode() == TargetInstrInfo::INLINEASM) {\n"
Evan Cheng8b988692008-02-02 08:39:46 +0000773 << " O << \"\\t\";\n"
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000774 << " printInlineAsm(MI);\n"
775 << " return true;\n"
Dan Gohmanfa607c92008-07-01 00:05:16 +0000776 << " } else if (MI->isLabel()) {\n"
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000777 << " printLabel(MI);\n"
778 << " return true;\n"
Evan Cheng2e28d622008-02-02 04:07:54 +0000779 << " } else if (MI->getOpcode() == TargetInstrInfo::DECLARE) {\n"
780 << " printDeclare(MI);\n"
781 << " return true;\n"
Evan Cheng3c0eda52008-03-15 00:03:38 +0000782 << " } else if (MI->getOpcode() == TargetInstrInfo::IMPLICIT_DEF) {\n"
783 << " printImplicitDef(MI);\n"
784 << " return true;\n"
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000785 << " }\n\n";
Chris Lattnerbfc9b7e2009-06-19 23:57:53 +0000786
787 O << "\n#endif\n";
788
Evan Cheng8b988692008-02-02 08:39:46 +0000789 O << " O << \"\\t\";\n\n";
790
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000791 O << " // Emit the opcode for the instruction.\n"
792 << " unsigned Bits = OpInfo[MI->getOpcode()];\n"
David Greene47974bf2009-07-20 22:02:59 +0000793 << " if (Bits == 0) return false;\n\n";
794
795 O << " std::string OpStr(AsmStrs+(Bits & " << (1 << AsmStrBits)-1 << "));\n"
796 << " unsigned OperandColumn = 1;\n"
797 << " O << OpStr;\n\n";
798
799 O << " if (OpStr.find_last_of(\" \\t\") == OpStr.size()-1) {\n"
800 << " O.PadToColumn(TAI->getOperandColumn(1));\n"
801 << " OperandColumn = 2;\n"
802 << " }\n\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000803
804 // Output the table driven operand information.
805 BitsLeft = 32-AsmStrBits;
806 for (unsigned i = 0, e = TableDrivenOperandPrinters.size(); i != e; ++i) {
807 std::vector<std::string> &Commands = TableDrivenOperandPrinters[i];
808
809 // Compute the number of bits we need to represent these cases, this is
810 // ceil(log2(numentries)).
811 unsigned NumBits = Log2_32_Ceil(Commands.size());
812 assert(NumBits <= BitsLeft && "consistency error");
813
814 // Emit code to extract this field from Bits.
815 BitsLeft -= NumBits;
816
817 O << "\n // Fragment " << i << " encoded into " << NumBits
818 << " bits for " << Commands.size() << " unique commands.\n";
819
820 if (Commands.size() == 2) {
821 // Emit two possibilitys with if/else.
822 O << " if ((Bits >> " << (BitsLeft+AsmStrBits) << ") & "
823 << ((1 << NumBits)-1) << ") {\n"
824 << Commands[1]
825 << " } else {\n"
826 << Commands[0]
827 << " }\n\n";
828 } else {
829 O << " switch ((Bits >> " << (BitsLeft+AsmStrBits) << ") & "
830 << ((1 << NumBits)-1) << ") {\n"
831 << " default: // unreachable.\n";
832
833 // Print out all the cases.
834 for (unsigned i = 0, e = Commands.size(); i != e; ++i) {
835 O << " case " << i << ":\n";
836 O << Commands[i];
837 O << " break;\n";
838 }
839 O << " }\n\n";
840 }
841 }
842
843 // Okay, delete instructions with no operand info left.
844 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
845 // Entire instruction has been emitted?
846 AsmWriterInst &Inst = Instructions[i];
847 if (Inst.Operands.empty()) {
848 Instructions.erase(Instructions.begin()+i);
849 --i; --e;
850 }
851 }
852
853
854 // Because this is a vector, we want to emit from the end. Reverse all of the
855 // elements in the vector.
856 std::reverse(Instructions.begin(), Instructions.end());
857
858 if (!Instructions.empty()) {
859 // Find the opcode # of inline asm.
860 O << " switch (MI->getOpcode()) {\n";
861 while (!Instructions.empty())
862 EmitInstructions(Instructions, O);
863
864 O << " }\n";
Evan Cheng4e30a492009-07-18 01:43:53 +0000865 O << " return true;\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000866 }
David Greene47974bf2009-07-20 22:02:59 +0000867
868 O << " return true;\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000869 O << "}\n";
870}