blob: a18b6b5594702a2c38b3a772a3c437365ff80845 [file] [log] [blame]
Chris Lattner1c4ae852004-08-01 05:59:33 +00001//===- AsmWriterEmitter.cpp - Generate an assembly writer -----------------===//
Misha Brukman650ba8e2005-04-22 00:00:37 +00002//
Chris Lattner1c4ae852004-08-01 05:59:33 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattner8adcd9f2007-12-29 20:37:13 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukman650ba8e2005-04-22 00:00:37 +00007//
Chris Lattner1c4ae852004-08-01 05:59:33 +00008//===----------------------------------------------------------------------===//
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
Sean Callananb7e8f4a2010-02-09 21:50:41 +000015#include "AsmWriterInst.h"
Chris Lattner1c4ae852004-08-01 05:59:33 +000016#include "CodeGenTarget.h"
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +000017#include "SequenceToOffsetTable.h"
Craig Topperb6350132012-07-27 06:44:02 +000018#include "llvm/ADT/StringExtras.h"
Owen Andersona84be6c2011-06-27 21:06:21 +000019#include "llvm/ADT/Twine.h"
Chris Lattner692374c2006-07-18 17:18:03 +000020#include "llvm/Support/Debug.h"
Benjamin Kramer17c17bc2013-09-11 15:42:16 +000021#include "llvm/Support/Format.h"
Chris Lattner692374c2006-07-18 17:18:03 +000022#include "llvm/Support/MathExtras.h"
Peter Collingbourne84c287e2011-10-01 16:41:13 +000023#include "llvm/TableGen/Error.h"
24#include "llvm/TableGen/Record.h"
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000025#include "llvm/TableGen/TableGenBackend.h"
Jeff Cohenda636b32005-01-22 18:50:10 +000026#include <algorithm>
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000027#include <cassert>
28#include <map>
29#include <vector>
Chris Lattner1c4ae852004-08-01 05:59:33 +000030using namespace llvm;
31
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000032namespace {
33class AsmWriterEmitter {
34 RecordKeeper &Records;
Ahmed Bougachabd214002013-10-28 18:07:17 +000035 CodeGenTarget Target;
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000036 std::map<const CodeGenInstruction*, AsmWriterInst*> CGIAWIMap;
37 std::vector<const CodeGenInstruction*> NumberedInstructions;
Ahmed Bougachabd214002013-10-28 18:07:17 +000038 std::vector<AsmWriterInst> Instructions;
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000039public:
Ahmed Bougachabd214002013-10-28 18:07:17 +000040 AsmWriterEmitter(RecordKeeper &R);
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000041
42 void run(raw_ostream &o);
43
44private:
45 void EmitPrintInstruction(raw_ostream &o);
46 void EmitGetRegisterName(raw_ostream &o);
47 void EmitPrintAliasInstruction(raw_ostream &O);
48
49 AsmWriterInst *getAsmWriterInstByID(unsigned ID) const {
50 assert(ID < NumberedInstructions.size());
51 std::map<const CodeGenInstruction*, AsmWriterInst*>::const_iterator I =
52 CGIAWIMap.find(NumberedInstructions[ID]);
53 assert(I != CGIAWIMap.end() && "Didn't find inst!");
54 return I->second;
55 }
56 void FindUniqueOperandCommands(std::vector<std::string> &UOC,
57 std::vector<unsigned> &InstIdxs,
58 std::vector<unsigned> &InstOpsUsed) const;
59};
60} // end anonymous namespace
61
Chris Lattner59a7f5c2005-01-22 20:31:17 +000062static void PrintCases(std::vector<std::pair<std::string,
Daniel Dunbar38a22bf2009-07-03 00:10:29 +000063 AsmWriterOperand> > &OpsToPrint, raw_ostream &O) {
Chris Lattner59a7f5c2005-01-22 20:31:17 +000064 O << " case " << OpsToPrint.back().first << ": ";
65 AsmWriterOperand TheOp = OpsToPrint.back().second;
66 OpsToPrint.pop_back();
67
68 // Check to see if any other operands are identical in this list, and if so,
69 // emit a case label for them.
70 for (unsigned i = OpsToPrint.size(); i != 0; --i)
71 if (OpsToPrint[i-1].second == TheOp) {
72 O << "\n case " << OpsToPrint[i-1].first << ": ";
73 OpsToPrint.erase(OpsToPrint.begin()+i-1);
74 }
75
76 // Finally, emit the code.
Chris Lattner692374c2006-07-18 17:18:03 +000077 O << TheOp.getCode();
Chris Lattner59a7f5c2005-01-22 20:31:17 +000078 O << "break;\n";
79}
80
Chris Lattner9ceb7c82005-01-22 18:38:13 +000081
82/// EmitInstructions - Emit the last instruction in the vector and any other
83/// instructions that are suitably similar to it.
84static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
Daniel Dunbar38a22bf2009-07-03 00:10:29 +000085 raw_ostream &O) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +000086 AsmWriterInst FirstInst = Insts.back();
87 Insts.pop_back();
88
89 std::vector<AsmWriterInst> SimilarInsts;
90 unsigned DifferingOperand = ~0;
91 for (unsigned i = Insts.size(); i != 0; --i) {
Chris Lattner92275bb2005-01-22 19:22:23 +000092 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
93 if (DiffOp != ~1U) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +000094 if (DifferingOperand == ~0U) // First match!
95 DifferingOperand = DiffOp;
96
97 // If this differs in the same operand as the rest of the instructions in
98 // this class, move it to the SimilarInsts list.
Chris Lattner92275bb2005-01-22 19:22:23 +000099 if (DifferingOperand == DiffOp || DiffOp == ~0U) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000100 SimilarInsts.push_back(Insts[i-1]);
101 Insts.erase(Insts.begin()+i-1);
102 }
103 }
104 }
105
Chris Lattner017b93d2006-05-01 17:01:17 +0000106 O << " case " << FirstInst.CGI->Namespace << "::"
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000107 << FirstInst.CGI->TheDef->getName() << ":\n";
108 for (unsigned i = 0, e = SimilarInsts.size(); i != e; ++i)
Chris Lattner017b93d2006-05-01 17:01:17 +0000109 O << " case " << SimilarInsts[i].CGI->Namespace << "::"
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000110 << SimilarInsts[i].CGI->TheDef->getName() << ":\n";
111 for (unsigned i = 0, e = FirstInst.Operands.size(); i != e; ++i) {
112 if (i != DifferingOperand) {
113 // If the operand is the same for all instructions, just print it.
Chris Lattner692374c2006-07-18 17:18:03 +0000114 O << " " << FirstInst.Operands[i].getCode();
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000115 } else {
116 // If this is the operand that varies between all of the instructions,
117 // emit a switch for just this operand now.
118 O << " switch (MI->getOpcode()) {\n";
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000119 std::vector<std::pair<std::string, AsmWriterOperand> > OpsToPrint;
Chris Lattner017b93d2006-05-01 17:01:17 +0000120 OpsToPrint.push_back(std::make_pair(FirstInst.CGI->Namespace + "::" +
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000121 FirstInst.CGI->TheDef->getName(),
122 FirstInst.Operands[i]));
Misha Brukman650ba8e2005-04-22 00:00:37 +0000123
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000124 for (unsigned si = 0, e = SimilarInsts.size(); si != e; ++si) {
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000125 AsmWriterInst &AWI = SimilarInsts[si];
Chris Lattner017b93d2006-05-01 17:01:17 +0000126 OpsToPrint.push_back(std::make_pair(AWI.CGI->Namespace+"::"+
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000127 AWI.CGI->TheDef->getName(),
128 AWI.Operands[i]));
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000129 }
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000130 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
131 while (!OpsToPrint.empty())
132 PrintCases(OpsToPrint, O);
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000133 O << " }";
134 }
135 O << "\n";
136 }
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000137 O << " break;\n";
138}
Chris Lattner0c23ba52005-01-22 17:32:42 +0000139
Chris Lattner692374c2006-07-18 17:18:03 +0000140void AsmWriterEmitter::
Jim Grosbacha5497342010-09-29 22:32:50 +0000141FindUniqueOperandCommands(std::vector<std::string> &UniqueOperandCommands,
Chris Lattneredee5252006-07-18 18:28:27 +0000142 std::vector<unsigned> &InstIdxs,
143 std::vector<unsigned> &InstOpsUsed) const {
Chris Lattner68ee5cf2006-07-18 19:27:30 +0000144 InstIdxs.assign(NumberedInstructions.size(), ~0U);
Jim Grosbacha5497342010-09-29 22:32:50 +0000145
Chris Lattner692374c2006-07-18 17:18:03 +0000146 // This vector parallels UniqueOperandCommands, keeping track of which
147 // instructions each case are used for. It is a comma separated string of
148 // enums.
149 std::vector<std::string> InstrsForCase;
150 InstrsForCase.resize(UniqueOperandCommands.size());
Chris Lattneredee5252006-07-18 18:28:27 +0000151 InstOpsUsed.assign(UniqueOperandCommands.size(), 0);
Jim Grosbacha5497342010-09-29 22:32:50 +0000152
Chris Lattner692374c2006-07-18 17:18:03 +0000153 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
154 const AsmWriterInst *Inst = getAsmWriterInstByID(i);
Bill Wendling004d7722010-07-16 23:10:00 +0000155 if (Inst == 0) continue; // PHI, INLINEASM, PROLOG_LABEL, etc.
Jim Grosbacha5497342010-09-29 22:32:50 +0000156
Chris Lattner692374c2006-07-18 17:18:03 +0000157 std::string Command;
Chris Lattnercb0c8482006-07-18 17:56:07 +0000158 if (Inst->Operands.empty())
Chris Lattner692374c2006-07-18 17:18:03 +0000159 continue; // Instruction already done.
Chris Lattner9d250692006-07-18 17:50:22 +0000160
Chris Lattnercb0c8482006-07-18 17:56:07 +0000161 Command = " " + Inst->Operands[0].getCode() + "\n";
Chris Lattner9d250692006-07-18 17:50:22 +0000162
Chris Lattner692374c2006-07-18 17:18:03 +0000163 // Check to see if we already have 'Command' in UniqueOperandCommands.
164 // If not, add it.
165 bool FoundIt = false;
166 for (unsigned idx = 0, e = UniqueOperandCommands.size(); idx != e; ++idx)
167 if (UniqueOperandCommands[idx] == Command) {
168 InstIdxs[i] = idx;
169 InstrsForCase[idx] += ", ";
170 InstrsForCase[idx] += Inst->CGI->TheDef->getName();
171 FoundIt = true;
172 break;
173 }
174 if (!FoundIt) {
175 InstIdxs[i] = UniqueOperandCommands.size();
176 UniqueOperandCommands.push_back(Command);
177 InstrsForCase.push_back(Inst->CGI->TheDef->getName());
Chris Lattneredee5252006-07-18 18:28:27 +0000178
179 // This command matches one operand so far.
180 InstOpsUsed.push_back(1);
181 }
182 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000183
Chris Lattneredee5252006-07-18 18:28:27 +0000184 // For each entry of UniqueOperandCommands, there is a set of instructions
185 // that uses it. If the next command of all instructions in the set are
186 // identical, fold it into the command.
187 for (unsigned CommandIdx = 0, e = UniqueOperandCommands.size();
188 CommandIdx != e; ++CommandIdx) {
Jim Grosbacha5497342010-09-29 22:32:50 +0000189
Chris Lattneredee5252006-07-18 18:28:27 +0000190 for (unsigned Op = 1; ; ++Op) {
191 // Scan for the first instruction in the set.
192 std::vector<unsigned>::iterator NIT =
193 std::find(InstIdxs.begin(), InstIdxs.end(), CommandIdx);
194 if (NIT == InstIdxs.end()) break; // No commonality.
195
196 // If this instruction has no more operands, we isn't anything to merge
197 // into this command.
Jim Grosbacha5497342010-09-29 22:32:50 +0000198 const AsmWriterInst *FirstInst =
Chris Lattneredee5252006-07-18 18:28:27 +0000199 getAsmWriterInstByID(NIT-InstIdxs.begin());
200 if (!FirstInst || FirstInst->Operands.size() == Op)
201 break;
202
203 // Otherwise, scan to see if all of the other instructions in this command
204 // set share the operand.
205 bool AllSame = true;
David Greene5b4bc262009-07-29 20:10:24 +0000206 // Keep track of the maximum, number of operands or any
207 // instruction we see in the group.
208 size_t MaxSize = FirstInst->Operands.size();
209
Chris Lattneredee5252006-07-18 18:28:27 +0000210 for (NIT = std::find(NIT+1, InstIdxs.end(), CommandIdx);
211 NIT != InstIdxs.end();
212 NIT = std::find(NIT+1, InstIdxs.end(), CommandIdx)) {
213 // Okay, found another instruction in this command set. If the operand
214 // matches, we're ok, otherwise bail out.
Jim Grosbacha5497342010-09-29 22:32:50 +0000215 const AsmWriterInst *OtherInst =
Chris Lattneredee5252006-07-18 18:28:27 +0000216 getAsmWriterInstByID(NIT-InstIdxs.begin());
David Greene5b4bc262009-07-29 20:10:24 +0000217
218 if (OtherInst &&
219 OtherInst->Operands.size() > FirstInst->Operands.size())
220 MaxSize = std::max(MaxSize, OtherInst->Operands.size());
221
Chris Lattneredee5252006-07-18 18:28:27 +0000222 if (!OtherInst || OtherInst->Operands.size() == Op ||
223 OtherInst->Operands[Op] != FirstInst->Operands[Op]) {
224 AllSame = false;
225 break;
226 }
227 }
228 if (!AllSame) break;
Jim Grosbacha5497342010-09-29 22:32:50 +0000229
Chris Lattneredee5252006-07-18 18:28:27 +0000230 // Okay, everything in this command set has the same next operand. Add it
231 // to UniqueOperandCommands and remember that it was consumed.
232 std::string Command = " " + FirstInst->Operands[Op].getCode() + "\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000233
Chris Lattneredee5252006-07-18 18:28:27 +0000234 UniqueOperandCommands[CommandIdx] += Command;
235 InstOpsUsed[CommandIdx]++;
Chris Lattner692374c2006-07-18 17:18:03 +0000236 }
237 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000238
Chris Lattner692374c2006-07-18 17:18:03 +0000239 // Prepend some of the instructions each case is used for onto the case val.
240 for (unsigned i = 0, e = InstrsForCase.size(); i != e; ++i) {
241 std::string Instrs = InstrsForCase[i];
242 if (Instrs.size() > 70) {
243 Instrs.erase(Instrs.begin()+70, Instrs.end());
244 Instrs += "...";
245 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000246
Chris Lattner692374c2006-07-18 17:18:03 +0000247 if (!Instrs.empty())
Jim Grosbacha5497342010-09-29 22:32:50 +0000248 UniqueOperandCommands[i] = " // " + Instrs + "\n" +
Chris Lattner692374c2006-07-18 17:18:03 +0000249 UniqueOperandCommands[i];
250 }
251}
252
253
Daniel Dunbar04f049f2009-10-17 20:43:42 +0000254static void UnescapeString(std::string &Str) {
255 for (unsigned i = 0; i != Str.size(); ++i) {
256 if (Str[i] == '\\' && i != Str.size()-1) {
257 switch (Str[i+1]) {
258 default: continue; // Don't execute the code after the switch.
259 case 'a': Str[i] = '\a'; break;
260 case 'b': Str[i] = '\b'; break;
261 case 'e': Str[i] = 27; break;
262 case 'f': Str[i] = '\f'; break;
263 case 'n': Str[i] = '\n'; break;
264 case 'r': Str[i] = '\r'; break;
265 case 't': Str[i] = '\t'; break;
266 case 'v': Str[i] = '\v'; break;
267 case '"': Str[i] = '\"'; break;
268 case '\'': Str[i] = '\''; break;
269 case '\\': Str[i] = '\\'; break;
270 }
271 // Nuke the second character.
272 Str.erase(Str.begin()+i+1);
273 }
274 }
275}
276
Chris Lattner06c5eed2009-09-13 20:08:00 +0000277/// EmitPrintInstruction - Generate the code for the "printInstruction" method
Ahmed Bougachabd214002013-10-28 18:07:17 +0000278/// implementation. Destroys all instances of AsmWriterInst information, by
279/// clearing the Instructions vector.
Chris Lattner06c5eed2009-09-13 20:08:00 +0000280void AsmWriterEmitter::EmitPrintInstruction(raw_ostream &O) {
Chris Lattner6ffa5012004-08-14 22:50:53 +0000281 Record *AsmWriter = Target.getAsmWriter();
Chris Lattner72770f52004-10-03 20:19:02 +0000282 std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
Jim Grosbach4a57b762010-09-30 01:29:54 +0000283 bool isMC = AsmWriter->getValueAsBit("isMCAsmWriter");
284 const char *MachineInstrClassName = isMC ? "MCInst" : "MachineInstr";
Jim Grosbacha5497342010-09-29 22:32:50 +0000285
Chris Lattner1c4ae852004-08-01 05:59:33 +0000286 O <<
287 "/// printInstruction - This method is automatically generated by tablegen\n"
Chris Lattner06c5eed2009-09-13 20:08:00 +0000288 "/// from the instruction set description.\n"
Chris Lattnerb94284b2009-08-08 01:32:19 +0000289 "void " << Target.getName() << ClassName
Jim Grosbach4a57b762010-09-30 01:29:54 +0000290 << "::printInstruction(const " << MachineInstrClassName
291 << " *MI, raw_ostream &O) {\n";
Chris Lattner1c4ae852004-08-01 05:59:33 +0000292
Chris Lattnere32982c2006-07-14 22:59:11 +0000293 // Build an aggregate string, and build a table of offsets into it.
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000294 SequenceToOffsetTable<std::string> StringTable;
Jim Grosbacha5497342010-09-29 22:32:50 +0000295
Chris Lattner5d751b42006-09-27 16:44:09 +0000296 /// OpcodeInfo - This encodes the index of the string to use for the first
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000297 /// chunk of the output as well as indices used for operand printing.
Manman Ren68cf9fc2012-09-13 17:43:46 +0000298 /// To reduce the number of unhandled cases, we expand the size from 32-bit
299 /// to 32+16 = 48-bit.
Craig Topper06cec4c2012-09-14 08:33:11 +0000300 std::vector<uint64_t> OpcodeInfo;
Jim Grosbacha5497342010-09-29 22:32:50 +0000301
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000302 // Add all strings to the string table upfront so it can generate an optimized
303 // representation.
304 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
305 AsmWriterInst *AWI = CGIAWIMap[NumberedInstructions[i]];
306 if (AWI != 0 &&
Jim Grosbachf4e67082012-04-18 18:56:33 +0000307 AWI->Operands[0].OperandType ==
308 AsmWriterOperand::isLiteralTextOperand &&
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000309 !AWI->Operands[0].Str.empty()) {
310 std::string Str = AWI->Operands[0].Str;
311 UnescapeString(Str);
312 StringTable.add(Str);
313 }
314 }
315
316 StringTable.layout();
317
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000318 unsigned MaxStringIdx = 0;
Chris Lattnere32982c2006-07-14 22:59:11 +0000319 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
320 AsmWriterInst *AWI = CGIAWIMap[NumberedInstructions[i]];
321 unsigned Idx;
Chris Lattner36504652006-07-19 01:39:06 +0000322 if (AWI == 0) {
Chris Lattnere32982c2006-07-14 22:59:11 +0000323 // Something not handled by the asmwriter printer.
Chris Lattnerb47ed612009-09-14 01:16:36 +0000324 Idx = ~0U;
Jim Grosbacha5497342010-09-29 22:32:50 +0000325 } else if (AWI->Operands[0].OperandType !=
Chris Lattner36504652006-07-19 01:39:06 +0000326 AsmWriterOperand::isLiteralTextOperand ||
327 AWI->Operands[0].Str.empty()) {
328 // Something handled by the asmwriter printer, but with no leading string.
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000329 Idx = StringTable.get("");
Chris Lattnere32982c2006-07-14 22:59:11 +0000330 } else {
Chris Lattnerb47ed612009-09-14 01:16:36 +0000331 std::string Str = AWI->Operands[0].Str;
332 UnescapeString(Str);
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000333 Idx = StringTable.get(Str);
Chris Lattnerb47ed612009-09-14 01:16:36 +0000334 MaxStringIdx = std::max(MaxStringIdx, Idx);
Jim Grosbacha5497342010-09-29 22:32:50 +0000335
Chris Lattnere32982c2006-07-14 22:59:11 +0000336 // Nuke the string from the operand list. It is now handled!
337 AWI->Operands.erase(AWI->Operands.begin());
Chris Lattner92275bb2005-01-22 19:22:23 +0000338 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000339
Chris Lattnerb47ed612009-09-14 01:16:36 +0000340 // Bias offset by one since we want 0 as a sentinel.
Craig Topper06cec4c2012-09-14 08:33:11 +0000341 OpcodeInfo.push_back(Idx+1);
Chris Lattner92275bb2005-01-22 19:22:23 +0000342 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000343
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000344 // Figure out how many bits we used for the string index.
Chris Lattnerb47ed612009-09-14 01:16:36 +0000345 unsigned AsmStrBits = Log2_32_Ceil(MaxStringIdx+2);
Jim Grosbacha5497342010-09-29 22:32:50 +0000346
Chris Lattner692374c2006-07-18 17:18:03 +0000347 // To reduce code size, we compactify common instructions into a few bits
348 // in the opcode-indexed table.
Craig Topper06cec4c2012-09-14 08:33:11 +0000349 unsigned BitsLeft = 64-AsmStrBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000350
351 std::vector<std::vector<std::string> > TableDrivenOperandPrinters;
Jim Grosbacha5497342010-09-29 22:32:50 +0000352
Chris Lattnercb0c8482006-07-18 17:56:07 +0000353 while (1) {
Chris Lattner692374c2006-07-18 17:18:03 +0000354 std::vector<std::string> UniqueOperandCommands;
Chris Lattner692374c2006-07-18 17:18:03 +0000355 std::vector<unsigned> InstIdxs;
Chris Lattneredee5252006-07-18 18:28:27 +0000356 std::vector<unsigned> NumInstOpsHandled;
357 FindUniqueOperandCommands(UniqueOperandCommands, InstIdxs,
358 NumInstOpsHandled);
Jim Grosbacha5497342010-09-29 22:32:50 +0000359
Chris Lattner692374c2006-07-18 17:18:03 +0000360 // If we ran out of operands to print, we're done.
361 if (UniqueOperandCommands.empty()) break;
Jim Grosbacha5497342010-09-29 22:32:50 +0000362
Chris Lattner692374c2006-07-18 17:18:03 +0000363 // Compute the number of bits we need to represent these cases, this is
364 // ceil(log2(numentries)).
365 unsigned NumBits = Log2_32_Ceil(UniqueOperandCommands.size());
Jim Grosbacha5497342010-09-29 22:32:50 +0000366
Chris Lattner692374c2006-07-18 17:18:03 +0000367 // If we don't have enough bits for this operand, don't include it.
368 if (NumBits > BitsLeft) {
Chris Lattner34822f62009-08-23 04:44:11 +0000369 DEBUG(errs() << "Not enough bits to densely encode " << NumBits
370 << " more bits\n");
Chris Lattner692374c2006-07-18 17:18:03 +0000371 break;
372 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000373
Chris Lattner692374c2006-07-18 17:18:03 +0000374 // Otherwise, we can include this in the initial lookup table. Add it in.
Chris Lattner692374c2006-07-18 17:18:03 +0000375 for (unsigned i = 0, e = InstIdxs.size(); i != e; ++i)
Manman Ren68cf9fc2012-09-13 17:43:46 +0000376 if (InstIdxs[i] != ~0U) {
Craig Topper06cec4c2012-09-14 08:33:11 +0000377 OpcodeInfo[i] |= (uint64_t)InstIdxs[i] << (64-BitsLeft);
Manman Ren68cf9fc2012-09-13 17:43:46 +0000378 }
Craig Topper06cec4c2012-09-14 08:33:11 +0000379 BitsLeft -= NumBits;
Jim Grosbacha5497342010-09-29 22:32:50 +0000380
Chris Lattnercb0c8482006-07-18 17:56:07 +0000381 // Remove the info about this operand.
382 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
383 if (AsmWriterInst *Inst = getAsmWriterInstByID(i))
Chris Lattneredee5252006-07-18 18:28:27 +0000384 if (!Inst->Operands.empty()) {
385 unsigned NumOps = NumInstOpsHandled[InstIdxs[i]];
Chris Lattner6e172082006-07-18 19:06:01 +0000386 assert(NumOps <= Inst->Operands.size() &&
387 "Can't remove this many ops!");
Chris Lattneredee5252006-07-18 18:28:27 +0000388 Inst->Operands.erase(Inst->Operands.begin(),
389 Inst->Operands.begin()+NumOps);
390 }
Chris Lattnercb0c8482006-07-18 17:56:07 +0000391 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000392
Chris Lattnercb0c8482006-07-18 17:56:07 +0000393 // Remember the handlers for this set of operands.
Chris Lattner692374c2006-07-18 17:18:03 +0000394 TableDrivenOperandPrinters.push_back(UniqueOperandCommands);
395 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000396
397
Craig Topper06cec4c2012-09-14 08:33:11 +0000398 // We always emit at least one 32-bit table. A second table is emitted if
399 // more bits are needed.
400 O<<" static const uint32_t OpInfo[] = {\n";
Chris Lattner692374c2006-07-18 17:18:03 +0000401 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
Craig Topper06cec4c2012-09-14 08:33:11 +0000402 O << " " << (OpcodeInfo[i] & 0xffffffff) << "U,\t// "
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000403 << NumberedInstructions[i]->TheDef->getName() << "\n";
Chris Lattner692374c2006-07-18 17:18:03 +0000404 }
405 // Add a dummy entry so the array init doesn't end with a comma.
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000406 O << " 0U\n";
Chris Lattnere32982c2006-07-14 22:59:11 +0000407 O << " };\n\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000408
Craig Topper06cec4c2012-09-14 08:33:11 +0000409 if (BitsLeft < 32) {
Manman Ren68cf9fc2012-09-13 17:43:46 +0000410 // Add a second OpInfo table only when it is necessary.
Craig Topper06cec4c2012-09-14 08:33:11 +0000411 // Adjust the type of the second table based on the number of bits needed.
412 O << " static const uint"
413 << ((BitsLeft < 16) ? "32" : (BitsLeft < 24) ? "16" : "8")
414 << "_t OpInfo2[] = {\n";
Manman Ren68cf9fc2012-09-13 17:43:46 +0000415 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
Craig Topper06cec4c2012-09-14 08:33:11 +0000416 O << " " << (OpcodeInfo[i] >> 32) << "U,\t// "
Manman Ren68cf9fc2012-09-13 17:43:46 +0000417 << NumberedInstructions[i]->TheDef->getName() << "\n";
418 }
419 // Add a dummy entry so the array init doesn't end with a comma.
420 O << " 0U\n";
421 O << " };\n\n";
422 }
423
Chris Lattnere32982c2006-07-14 22:59:11 +0000424 // Emit the string itself.
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000425 O << " const char AsmStrs[] = {\n";
426 StringTable.emit(O, printChar);
427 O << " };\n\n";
Chris Lattnere32982c2006-07-14 22:59:11 +0000428
Evan Cheng32e53472008-02-02 08:39:46 +0000429 O << " O << \"\\t\";\n\n";
430
Craig Topper06cec4c2012-09-14 08:33:11 +0000431 O << " // Emit the opcode for the instruction.\n";
432 if (BitsLeft < 32) {
433 // If we have two tables then we need to perform two lookups and combine
434 // the results into a single 64-bit value.
435 O << " uint64_t Bits1 = OpInfo[MI->getOpcode()];\n"
436 << " uint64_t Bits2 = OpInfo2[MI->getOpcode()];\n"
437 << " uint64_t Bits = (Bits2 << 32) | Bits1;\n";
438 } else {
439 // If only one table is used we just need to perform a single lookup.
440 O << " uint32_t Bits = OpInfo[MI->getOpcode()];\n";
441 }
Manman Ren68cf9fc2012-09-13 17:43:46 +0000442 O << " assert(Bits != 0 && \"Cannot print this instruction.\");\n"
Chris Lattnerb47ed612009-09-14 01:16:36 +0000443 << " O << AsmStrs+(Bits & " << (1 << AsmStrBits)-1 << ")-1;\n\n";
David Greenefdd25192009-08-05 21:00:52 +0000444
Chris Lattner692374c2006-07-18 17:18:03 +0000445 // Output the table driven operand information.
Craig Topper06cec4c2012-09-14 08:33:11 +0000446 BitsLeft = 64-AsmStrBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000447 for (unsigned i = 0, e = TableDrivenOperandPrinters.size(); i != e; ++i) {
448 std::vector<std::string> &Commands = TableDrivenOperandPrinters[i];
449
450 // Compute the number of bits we need to represent these cases, this is
451 // ceil(log2(numentries)).
452 unsigned NumBits = Log2_32_Ceil(Commands.size());
453 assert(NumBits <= BitsLeft && "consistency error");
Jim Grosbacha5497342010-09-29 22:32:50 +0000454
Chris Lattner692374c2006-07-18 17:18:03 +0000455 // Emit code to extract this field from Bits.
Chris Lattner692374c2006-07-18 17:18:03 +0000456 O << "\n // Fragment " << i << " encoded into " << NumBits
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000457 << " bits for " << Commands.size() << " unique commands.\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000458
Chris Lattneredee5252006-07-18 18:28:27 +0000459 if (Commands.size() == 2) {
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000460 // Emit two possibilitys with if/else.
Craig Topper06cec4c2012-09-14 08:33:11 +0000461 O << " if ((Bits >> "
462 << (64-BitsLeft) << ") & "
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000463 << ((1 << NumBits)-1) << ") {\n"
464 << Commands[1]
465 << " } else {\n"
466 << Commands[0]
467 << " }\n\n";
Eric Christophera573d192010-09-18 18:50:27 +0000468 } else if (Commands.size() == 1) {
469 // Emit a single possibility.
470 O << Commands[0] << "\n\n";
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000471 } else {
Craig Topper06cec4c2012-09-14 08:33:11 +0000472 O << " switch ((Bits >> "
473 << (64-BitsLeft) << ") & "
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000474 << ((1 << NumBits)-1) << ") {\n"
475 << " default: // unreachable.\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000476
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000477 // Print out all the cases.
478 for (unsigned i = 0, e = Commands.size(); i != e; ++i) {
479 O << " case " << i << ":\n";
480 O << Commands[i];
481 O << " break;\n";
482 }
483 O << " }\n\n";
Chris Lattner692374c2006-07-18 17:18:03 +0000484 }
Craig Topper06cec4c2012-09-14 08:33:11 +0000485 BitsLeft -= NumBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000486 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000487
Chris Lattnercb0c8482006-07-18 17:56:07 +0000488 // Okay, delete instructions with no operand info left.
Chris Lattner692374c2006-07-18 17:18:03 +0000489 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
490 // Entire instruction has been emitted?
491 AsmWriterInst &Inst = Instructions[i];
Chris Lattnercb0c8482006-07-18 17:56:07 +0000492 if (Inst.Operands.empty()) {
Chris Lattner692374c2006-07-18 17:18:03 +0000493 Instructions.erase(Instructions.begin()+i);
Chris Lattnercb0c8482006-07-18 17:56:07 +0000494 --i; --e;
Chris Lattner692374c2006-07-18 17:18:03 +0000495 }
496 }
497
Jim Grosbacha5497342010-09-29 22:32:50 +0000498
Chris Lattner692374c2006-07-18 17:18:03 +0000499 // Because this is a vector, we want to emit from the end. Reverse all of the
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000500 // elements in the vector.
501 std::reverse(Instructions.begin(), Instructions.end());
Jim Grosbacha5497342010-09-29 22:32:50 +0000502
503
Chris Lattnerbf1a7692009-09-18 18:10:19 +0000504 // Now that we've emitted all of the operand info that fit into 32 bits, emit
505 // information for those instructions that are left. This is a less dense
506 // encoding, but we expect the main 32-bit table to handle the majority of
507 // instructions.
Chris Lattner66e288b2006-07-18 17:38:46 +0000508 if (!Instructions.empty()) {
509 // Find the opcode # of inline asm.
510 O << " switch (MI->getOpcode()) {\n";
511 while (!Instructions.empty())
512 EmitInstructions(Instructions, O);
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000513
Chris Lattner66e288b2006-07-18 17:38:46 +0000514 O << " }\n";
Chris Lattnerb94284b2009-08-08 01:32:19 +0000515 O << " return;\n";
Chris Lattner66e288b2006-07-18 17:38:46 +0000516 }
David Greene5b4bc262009-07-29 20:10:24 +0000517
Chris Lattner6e172082006-07-18 19:06:01 +0000518 O << "}\n";
Chris Lattner1c4ae852004-08-01 05:59:33 +0000519}
Chris Lattner06c5eed2009-09-13 20:08:00 +0000520
Owen Andersona84be6c2011-06-27 21:06:21 +0000521static void
522emitRegisterNameString(raw_ostream &O, StringRef AltName,
Craig Topper9c252eb2012-04-03 06:52:47 +0000523 const std::vector<CodeGenRegister*> &Registers) {
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000524 SequenceToOffsetTable<std::string> StringTable;
525 SmallVector<std::string, 4> AsmNames(Registers.size());
Owen Andersona84be6c2011-06-27 21:06:21 +0000526 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
527 const CodeGenRegister &Reg = *Registers[i];
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000528 std::string &AsmName = AsmNames[i];
Owen Andersona84be6c2011-06-27 21:06:21 +0000529
Owen Andersona84be6c2011-06-27 21:06:21 +0000530 // "NoRegAltName" is special. We don't need to do a lookup for that,
531 // as it's just a reference to the default register name.
532 if (AltName == "" || AltName == "NoRegAltName") {
533 AsmName = Reg.TheDef->getValueAsString("AsmName");
534 if (AsmName.empty())
535 AsmName = Reg.getName();
536 } else {
537 // Make sure the register has an alternate name for this index.
538 std::vector<Record*> AltNameList =
539 Reg.TheDef->getValueAsListOfDefs("RegAltNameIndices");
540 unsigned Idx = 0, e;
541 for (e = AltNameList.size();
542 Idx < e && (AltNameList[Idx]->getName() != AltName);
543 ++Idx)
544 ;
545 // If the register has an alternate name for this index, use it.
546 // Otherwise, leave it empty as an error flag.
547 if (Idx < e) {
548 std::vector<std::string> AltNames =
549 Reg.TheDef->getValueAsListOfStrings("AltNames");
550 if (AltNames.size() <= Idx)
Joerg Sonnenberger635debe2012-10-25 20:33:17 +0000551 PrintFatalError(Reg.TheDef->getLoc(),
552 (Twine("Register definition missing alt name for '") +
553 AltName + "'.").str());
Owen Andersona84be6c2011-06-27 21:06:21 +0000554 AsmName = AltNames[Idx];
555 }
556 }
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000557 StringTable.add(AsmName);
558 }
Owen Andersona84be6c2011-06-27 21:06:21 +0000559
Craig Topperf8f0a232012-09-15 01:22:42 +0000560 StringTable.layout();
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000561 O << " static const char AsmStrs" << AltName << "[] = {\n";
562 StringTable.emit(O, printChar);
563 O << " };\n\n";
564
Craig Topperf8f0a232012-09-15 01:22:42 +0000565 O << " static const uint32_t RegAsmOffset" << AltName << "[] = {";
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000566 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
Craig Topper7a2cea12012-04-02 00:47:39 +0000567 if ((i % 14) == 0)
568 O << "\n ";
569 O << StringTable.get(AsmNames[i]) << ", ";
Owen Andersona84be6c2011-06-27 21:06:21 +0000570 }
Craig Topper9c252eb2012-04-03 06:52:47 +0000571 O << "\n };\n"
Owen Andersona84be6c2011-06-27 21:06:21 +0000572 << "\n";
Owen Andersona84be6c2011-06-27 21:06:21 +0000573}
Chris Lattner06c5eed2009-09-13 20:08:00 +0000574
575void AsmWriterEmitter::EmitGetRegisterName(raw_ostream &O) {
Chris Lattner06c5eed2009-09-13 20:08:00 +0000576 Record *AsmWriter = Target.getAsmWriter();
577 std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
Jakob Stoklund Olesen8e188be2011-06-18 04:26:06 +0000578 const std::vector<CodeGenRegister*> &Registers =
579 Target.getRegBank().getRegisters();
Owen Andersona84be6c2011-06-27 21:06:21 +0000580 std::vector<Record*> AltNameIndices = Target.getRegAltNameIndices();
581 bool hasAltNames = AltNameIndices.size() > 1;
Jim Grosbacha5497342010-09-29 22:32:50 +0000582
Chris Lattner06c5eed2009-09-13 20:08:00 +0000583 O <<
584 "\n\n/// getRegisterName - This method is automatically generated by tblgen\n"
585 "/// from the register set description. This returns the assembler name\n"
586 "/// for the specified register.\n"
Owen Andersona84be6c2011-06-27 21:06:21 +0000587 "const char *" << Target.getName() << ClassName << "::";
588 if (hasAltNames)
589 O << "\ngetRegisterName(unsigned RegNo, unsigned AltIdx) {\n";
590 else
591 O << "getRegisterName(unsigned RegNo) {\n";
592 O << " assert(RegNo && RegNo < " << (Registers.size()+1)
593 << " && \"Invalid register number!\");\n"
Chris Lattnera7e8ae42009-09-14 01:26:18 +0000594 << "\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000595
Owen Andersona84be6c2011-06-27 21:06:21 +0000596 if (hasAltNames) {
597 for (unsigned i = 0, e = AltNameIndices.size(); i < e; ++i)
598 emitRegisterNameString(O, AltNameIndices[i]->getName(), Registers);
599 } else
600 emitRegisterNameString(O, "", Registers);
Jim Grosbacha5497342010-09-29 22:32:50 +0000601
Owen Andersona84be6c2011-06-27 21:06:21 +0000602 if (hasAltNames) {
Craig Topperf8f0a232012-09-15 01:22:42 +0000603 O << " const uint32_t *RegAsmOffset;\n"
Owen Andersona84be6c2011-06-27 21:06:21 +0000604 << " const char *AsmStrs;\n"
605 << " switch(AltIdx) {\n"
Craig Topperc4965bc2012-02-05 07:21:30 +0000606 << " default: llvm_unreachable(\"Invalid register alt name index!\");\n";
Owen Andersona84be6c2011-06-27 21:06:21 +0000607 for (unsigned i = 0, e = AltNameIndices.size(); i < e; ++i) {
608 StringRef Namespace = AltNameIndices[1]->getValueAsString("Namespace");
609 StringRef AltName(AltNameIndices[i]->getName());
610 O << " case " << Namespace << "::" << AltName
611 << ":\n"
612 << " AsmStrs = AsmStrs" << AltName << ";\n"
613 << " RegAsmOffset = RegAsmOffset" << AltName << ";\n"
614 << " break;\n";
615 }
616 O << "}\n";
617 }
618
619 O << " assert (*(AsmStrs+RegAsmOffset[RegNo-1]) &&\n"
620 << " \"Invalid alt name index for register!\");\n"
621 << " return AsmStrs+RegAsmOffset[RegNo-1];\n"
Chris Lattner06c5eed2009-09-13 20:08:00 +0000622 << "}\n";
623}
624
Bill Wendling7e5771d2011-03-21 08:31:53 +0000625namespace {
Bill Wendling5d3174c2011-03-21 08:40:31 +0000626// IAPrinter - Holds information about an InstAlias. Two InstAliases match if
627// they both have the same conditionals. In which case, we cannot print out the
628// alias for that pattern.
629class IAPrinter {
Bill Wendling5d3174c2011-03-21 08:40:31 +0000630 std::vector<std::string> Conds;
631 std::map<StringRef, unsigned> OpMap;
632 std::string Result;
633 std::string AsmString;
Jim Grosbachdba3f5b2012-04-18 19:02:43 +0000634 SmallVector<Record*, 4> ReqFeatures;
Bill Wendling5d3174c2011-03-21 08:40:31 +0000635public:
Evan Cheng4d806e22011-07-06 02:02:33 +0000636 IAPrinter(std::string R, std::string AS)
637 : Result(R), AsmString(AS) {}
Bill Wendling5d3174c2011-03-21 08:40:31 +0000638
639 void addCond(const std::string &C) { Conds.push_back(C); }
Bill Wendling5d3174c2011-03-21 08:40:31 +0000640
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000641 void addOperand(StringRef Op, unsigned Idx) {
642 assert(Idx < 0xFF && "Index too large!");
643 OpMap[Op] = Idx;
644 }
Bill Wendling5d3174c2011-03-21 08:40:31 +0000645 unsigned getOpIndex(StringRef Op) { return OpMap[Op]; }
646 bool isOpMapped(StringRef Op) { return OpMap.find(Op) != OpMap.end(); }
647
Evan Cheng4d806e22011-07-06 02:02:33 +0000648 void print(raw_ostream &O) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000649 if (Conds.empty() && ReqFeatures.empty()) {
650 O.indent(6) << "return true;\n";
Evan Cheng4d806e22011-07-06 02:02:33 +0000651 return;
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000652 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000653
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000654 O << "if (";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000655
656 for (std::vector<std::string>::iterator
657 I = Conds.begin(), E = Conds.end(); I != E; ++I) {
658 if (I != Conds.begin()) {
659 O << " &&\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000660 O.indent(8);
Bill Wendling5d3174c2011-03-21 08:40:31 +0000661 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000662
Bill Wendling5d3174c2011-03-21 08:40:31 +0000663 O << *I;
664 }
665
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000666 O << ") {\n";
667 O.indent(6) << "// " << Result << "\n";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000668
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000669 // Directly mangle mapped operands into the string. Each operand is
670 // identified by a '$' sign followed by a byte identifying the number of the
671 // operand. We add one to the index to avoid zero bytes.
672 std::pair<StringRef, StringRef> ASM = StringRef(AsmString).split(' ');
673 SmallString<128> OutString = ASM.first;
674 if (!ASM.second.empty()) {
675 raw_svector_ostream OS(OutString);
676 OS << ' ';
677 for (StringRef::iterator I = ASM.second.begin(), E = ASM.second.end();
678 I != E;) {
679 OS << *I;
680 if (*I == '$') {
681 StringRef::iterator Start = ++I;
682 while (I != E &&
683 ((*I >= 'a' && *I <= 'z') || (*I >= 'A' && *I <= 'Z') ||
684 (*I >= '0' && *I <= '9') || *I == '_'))
685 ++I;
686 StringRef Name(Start, I - Start);
687 assert(isOpMapped(Name) && "Unmapped operand!");
688 OS << format("\\x%02X", (unsigned char)getOpIndex(Name) + 1);
689 } else {
690 ++I;
691 }
692 }
693 }
694
695 // Emit the string.
696 O.indent(6) << "AsmString = \"" << OutString.str() << "\";\n";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000697
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000698 O.indent(6) << "break;\n";
699 O.indent(4) << '}';
Bill Wendling5d3174c2011-03-21 08:40:31 +0000700 }
701
702 bool operator==(const IAPrinter &RHS) {
703 if (Conds.size() != RHS.Conds.size())
704 return false;
705
706 unsigned Idx = 0;
707 for (std::vector<std::string>::iterator
708 I = Conds.begin(), E = Conds.end(); I != E; ++I)
709 if (*I != RHS.Conds[Idx++])
710 return false;
711
712 return true;
713 }
714
715 bool operator()(const IAPrinter &RHS) {
716 if (Conds.size() < RHS.Conds.size())
717 return true;
718
719 unsigned Idx = 0;
720 for (std::vector<std::string>::iterator
721 I = Conds.begin(), E = Conds.end(); I != E; ++I)
722 if (*I != RHS.Conds[Idx++])
723 return *I < RHS.Conds[Idx++];
724
725 return false;
726 }
727};
728
Bill Wendling7e5771d2011-03-21 08:31:53 +0000729} // end anonymous namespace
730
Bill Wendlinge7124492011-06-14 03:17:20 +0000731static unsigned CountNumOperands(StringRef AsmString) {
732 unsigned NumOps = 0;
733 std::pair<StringRef, StringRef> ASM = AsmString.split(' ');
734
735 while (!ASM.second.empty()) {
736 ++NumOps;
737 ASM = ASM.second.split(' ');
738 }
739
740 return NumOps;
741}
742
Bill Wendling36c0c6d2011-06-15 04:31:19 +0000743static unsigned CountResultNumOperands(StringRef AsmString) {
744 unsigned NumOps = 0;
745 std::pair<StringRef, StringRef> ASM = AsmString.split('\t');
746
747 if (!ASM.second.empty()) {
748 size_t I = ASM.second.find('{');
749 StringRef Str = ASM.second;
750 if (I != StringRef::npos)
751 Str = ASM.second.substr(I, ASM.second.find('|', I));
752
753 ASM = Str.split(' ');
754
755 do {
756 ++NumOps;
757 ASM = ASM.second.split(' ');
758 } while (!ASM.second.empty());
759 }
760
761 return NumOps;
762}
Bill Wendlinge7124492011-06-14 03:17:20 +0000763
Bill Wendling7e5771d2011-03-21 08:31:53 +0000764void AsmWriterEmitter::EmitPrintAliasInstruction(raw_ostream &O) {
Bill Wendling7e5771d2011-03-21 08:31:53 +0000765 Record *AsmWriter = Target.getAsmWriter();
766
Bill Wendlinge7124492011-06-14 03:17:20 +0000767 if (!AsmWriter->getValueAsBit("isMCAsmWriter"))
768 return;
769
Bill Wendling7e5771d2011-03-21 08:31:53 +0000770 O << "\n#ifdef PRINT_ALIAS_INSTR\n";
771 O << "#undef PRINT_ALIAS_INSTR\n\n";
772
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000773 // Emit the method that prints the alias instruction.
774 std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
775
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000776 std::vector<Record*> AllInstAliases =
777 Records.getAllDerivedDefinitions("InstAlias");
778
779 // Create a map from the qualified name to a list of potential matches.
Jim Grosbachefe653f2012-04-18 20:24:49 +0000780 std::map<std::string, std::vector<CodeGenInstAlias*> > AliasMap;
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000781 for (std::vector<Record*>::iterator
782 I = AllInstAliases.begin(), E = AllInstAliases.end(); I != E; ++I) {
783 CodeGenInstAlias *Alias = new CodeGenInstAlias(*I, Target);
784 const Record *R = *I;
Bill Wendling6dd69d92011-04-13 23:36:21 +0000785 if (!R->getValueAsBit("EmitAlias"))
786 continue; // We were told not to emit the alias, but to emit the aliasee.
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000787 const DagInit *DI = R->getValueAsDag("ResultInst");
Sean Silva88eb8dd2012-10-10 20:24:47 +0000788 const DefInit *Op = cast<DefInit>(DI->getOperator());
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000789 AliasMap[getQualifiedName(Op->getDef())].push_back(Alias);
790 }
791
Bill Wendling7e570b52011-03-21 08:59:17 +0000792 // A map of which conditions need to be met for each instruction operand
793 // before it can be matched to the mnemonic.
Jim Grosbachefe653f2012-04-18 20:24:49 +0000794 std::map<std::string, std::vector<IAPrinter*> > IAPrinterMap;
Bill Wendling7e570b52011-03-21 08:59:17 +0000795
Jim Grosbachefe653f2012-04-18 20:24:49 +0000796 for (std::map<std::string, std::vector<CodeGenInstAlias*> >::iterator
Bill Wendling7e570b52011-03-21 08:59:17 +0000797 I = AliasMap.begin(), E = AliasMap.end(); I != E; ++I) {
798 std::vector<CodeGenInstAlias*> &Aliases = I->second;
799
800 for (std::vector<CodeGenInstAlias*>::iterator
801 II = Aliases.begin(), IE = Aliases.end(); II != IE; ++II) {
802 const CodeGenInstAlias *CGA = *II;
Bill Wendlinge7124492011-06-14 03:17:20 +0000803 unsigned LastOpNo = CGA->ResultInstOperandIndex.size();
Bill Wendling36c0c6d2011-06-15 04:31:19 +0000804 unsigned NumResultOps =
805 CountResultNumOperands(CGA->ResultInst->AsmString);
Bill Wendlinge7124492011-06-14 03:17:20 +0000806
807 // Don't emit the alias if it has more operands than what it's aliasing.
Bill Wendling36c0c6d2011-06-15 04:31:19 +0000808 if (NumResultOps < CountNumOperands(CGA->AsmString))
Bill Wendlinge7124492011-06-14 03:17:20 +0000809 continue;
810
Evan Cheng4d806e22011-07-06 02:02:33 +0000811 IAPrinter *IAP = new IAPrinter(CGA->Result->getAsString(),
Bill Wendling7e570b52011-03-21 08:59:17 +0000812 CGA->AsmString);
Bill Wendling7e570b52011-03-21 08:59:17 +0000813
Bill Wendling7e570b52011-03-21 08:59:17 +0000814 std::string Cond;
815 Cond = std::string("MI->getNumOperands() == ") + llvm::utostr(LastOpNo);
816 IAP->addCond(Cond);
817
Bill Wendling7e570b52011-03-21 08:59:17 +0000818 bool CantHandle = false;
819
820 for (unsigned i = 0, e = LastOpNo; i != e; ++i) {
821 const CodeGenInstAlias::ResultOperand &RO = CGA->ResultOperands[i];
822
823 switch (RO.Kind) {
Bill Wendling7e570b52011-03-21 08:59:17 +0000824 case CodeGenInstAlias::ResultOperand::K_Record: {
825 const Record *Rec = RO.getRecord();
826 StringRef ROName = RO.getName();
827
Owen Andersona84be6c2011-06-27 21:06:21 +0000828
829 if (Rec->isSubClassOf("RegisterOperand"))
830 Rec = Rec->getValueAsDef("RegClass");
Bill Wendling7e570b52011-03-21 08:59:17 +0000831 if (Rec->isSubClassOf("RegisterClass")) {
832 Cond = std::string("MI->getOperand(")+llvm::utostr(i)+").isReg()";
833 IAP->addCond(Cond);
834
835 if (!IAP->isOpMapped(ROName)) {
836 IAP->addOperand(ROName, i);
Jack Carter9c1a0272013-02-05 08:32:10 +0000837 Record *R = CGA->ResultOperands[i].getRecord();
838 if (R->isSubClassOf("RegisterOperand"))
839 R = R->getValueAsDef("RegClass");
Benjamin Kramer682de392012-03-30 23:13:40 +0000840 Cond = std::string("MRI.getRegClass(") + Target.getName() + "::" +
Jack Carter9c1a0272013-02-05 08:32:10 +0000841 R->getName() + "RegClassID)"
Benjamin Kramer682de392012-03-30 23:13:40 +0000842 ".contains(MI->getOperand(" + llvm::utostr(i) + ").getReg())";
Bill Wendling7e570b52011-03-21 08:59:17 +0000843 IAP->addCond(Cond);
844 } else {
845 Cond = std::string("MI->getOperand(") +
846 llvm::utostr(i) + ").getReg() == MI->getOperand(" +
847 llvm::utostr(IAP->getOpIndex(ROName)) + ").getReg()";
848 IAP->addCond(Cond);
849 }
850 } else {
851 assert(Rec->isSubClassOf("Operand") && "Unexpected operand!");
Bill Wendlinge7124492011-06-14 03:17:20 +0000852 // FIXME: We may need to handle these situations.
Bill Wendling7e570b52011-03-21 08:59:17 +0000853 delete IAP;
854 IAP = 0;
855 CantHandle = true;
856 break;
857 }
858
859 break;
860 }
Tim Northoverab7689e2013-01-09 13:32:04 +0000861 case CodeGenInstAlias::ResultOperand::K_Imm: {
862 std::string Op = "MI->getOperand(" + llvm::utostr(i) + ")";
863
864 // Just because the alias has an immediate result, doesn't mean the
865 // MCInst will. An MCExpr could be present, for example.
866 IAP->addCond(Op + ".isImm()");
867
868 Cond = Op + ".getImm() == "
869 + llvm::utostr(CGA->ResultOperands[i].getImm());
Bill Wendling7e570b52011-03-21 08:59:17 +0000870 IAP->addCond(Cond);
871 break;
Tim Northoverab7689e2013-01-09 13:32:04 +0000872 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000873 case CodeGenInstAlias::ResultOperand::K_Reg:
Jim Grosbach29cdcda2011-11-15 01:46:57 +0000874 // If this is zero_reg, something's playing tricks we're not
875 // equipped to handle.
876 if (!CGA->ResultOperands[i].getRegister()) {
877 CantHandle = true;
878 break;
879 }
880
Bill Wendling7e570b52011-03-21 08:59:17 +0000881 Cond = std::string("MI->getOperand(") +
882 llvm::utostr(i) + ").getReg() == " + Target.getName() +
883 "::" + CGA->ResultOperands[i].getRegister()->getName();
884 IAP->addCond(Cond);
885 break;
886 }
887
888 if (!IAP) break;
889 }
890
891 if (CantHandle) continue;
Jim Grosbachefe653f2012-04-18 20:24:49 +0000892 IAPrinterMap[I->first].push_back(IAP);
Bill Wendling7e570b52011-03-21 08:59:17 +0000893 }
894 }
895
Bill Wendlingf5199de2011-05-23 00:18:33 +0000896 std::string Header;
897 raw_string_ostream HeaderO(Header);
898
899 HeaderO << "bool " << Target.getName() << ClassName
Bill Wendlinge7124492011-06-14 03:17:20 +0000900 << "::printAliasInstr(const MCInst"
Bill Wendlingf5199de2011-05-23 00:18:33 +0000901 << " *MI, raw_ostream &OS) {\n";
Bill Wendling7e570b52011-03-21 08:59:17 +0000902
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000903 std::string Cases;
904 raw_string_ostream CasesO(Cases);
905
Jim Grosbachefe653f2012-04-18 20:24:49 +0000906 for (std::map<std::string, std::vector<IAPrinter*> >::iterator
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000907 I = IAPrinterMap.begin(), E = IAPrinterMap.end(); I != E; ++I) {
908 std::vector<IAPrinter*> &IAPs = I->second;
909 std::vector<IAPrinter*> UniqueIAPs;
910
911 for (std::vector<IAPrinter*>::iterator
912 II = IAPs.begin(), IE = IAPs.end(); II != IE; ++II) {
913 IAPrinter *LHS = *II;
914 bool IsDup = false;
915 for (std::vector<IAPrinter*>::iterator
916 III = IAPs.begin(), IIE = IAPs.end(); III != IIE; ++III) {
917 IAPrinter *RHS = *III;
918 if (LHS != RHS && *LHS == *RHS) {
919 IsDup = true;
920 break;
921 }
922 }
923
924 if (!IsDup) UniqueIAPs.push_back(LHS);
925 }
926
927 if (UniqueIAPs.empty()) continue;
928
Jim Grosbachefe653f2012-04-18 20:24:49 +0000929 CasesO.indent(2) << "case " << I->first << ":\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000930
931 for (std::vector<IAPrinter*>::iterator
932 II = UniqueIAPs.begin(), IE = UniqueIAPs.end(); II != IE; ++II) {
933 IAPrinter *IAP = *II;
934 CasesO.indent(4);
Evan Cheng4d806e22011-07-06 02:02:33 +0000935 IAP->print(CasesO);
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000936 CasesO << '\n';
937 }
938
Eric Christopher2e3fbaa2011-04-18 21:28:11 +0000939 CasesO.indent(4) << "return false;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000940 }
941
Bill Wendlinge7124492011-06-14 03:17:20 +0000942 if (CasesO.str().empty()) {
Bill Wendlingf5199de2011-05-23 00:18:33 +0000943 O << HeaderO.str();
Eric Christopher2e3fbaa2011-04-18 21:28:11 +0000944 O << " return false;\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000945 O << "}\n\n";
946 O << "#endif // PRINT_ALIAS_INSTR\n";
947 return;
948 }
949
Bill Wendlingf5199de2011-05-23 00:18:33 +0000950 O << HeaderO.str();
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000951 O.indent(2) << "const char *AsmString;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000952 O.indent(2) << "switch (MI->getOpcode()) {\n";
Eric Christopher2e3fbaa2011-04-18 21:28:11 +0000953 O.indent(2) << "default: return false;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000954 O << CasesO.str();
955 O.indent(2) << "}\n\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000956
957 // Code that prints the alias, replacing the operands with the ones from the
958 // MCInst.
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000959 O << " unsigned I = 0;\n";
960 O << " while (AsmString[I] != ' ' && AsmString[I] != '\\0')\n";
961 O << " ++I;\n";
962 O << " OS << '\\t' << StringRef(AsmString, I);\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000963
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000964 O << " if (AsmString[I] != '\\0') {\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000965 O << " OS << '\\t';\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000966 O << " do {\n";
967 O << " if (AsmString[I] == '$') {\n";
968 O << " ++I;\n";
969 O << " printOperand(MI, unsigned(AsmString[I++]) - 1, OS);\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000970 O << " } else {\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000971 O << " OS << AsmString[I++];\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000972 O << " }\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000973 O << " } while (AsmString[I] != '\\0');\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000974 O << " }\n\n";
Jim Grosbachf4e67082012-04-18 18:56:33 +0000975
Eric Christopher2e3fbaa2011-04-18 21:28:11 +0000976 O << " return true;\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000977 O << "}\n\n";
978
979 O << "#endif // PRINT_ALIAS_INSTR\n";
980}
Chris Lattner06c5eed2009-09-13 20:08:00 +0000981
Ahmed Bougachabd214002013-10-28 18:07:17 +0000982AsmWriterEmitter::AsmWriterEmitter(RecordKeeper &R) : Records(R), Target(R) {
983 Record *AsmWriter = Target.getAsmWriter();
984 for (CodeGenTarget::inst_iterator I = Target.inst_begin(),
985 E = Target.inst_end();
986 I != E; ++I)
987 if (!(*I)->AsmString.empty() && (*I)->TheDef->getName() != "PHI")
988 Instructions.push_back(
989 AsmWriterInst(**I, AsmWriter->getValueAsInt("Variant"),
990 AsmWriter->getValueAsInt("FirstOperandColumn"),
991 AsmWriter->getValueAsInt("OperandSpacing")));
992
993 // Get the instruction numbering.
994 NumberedInstructions = Target.getInstructionsByEnumValue();
995
996 // Compute the CodeGenInstruction -> AsmWriterInst mapping. Note that not
997 // all machine instructions are necessarily being printed, so there may be
998 // target instructions not in this map.
999 for (unsigned i = 0, e = Instructions.size(); i != e; ++i)
1000 CGIAWIMap.insert(std::make_pair(Instructions[i].CGI, &Instructions[i]));
1001}
1002
Chris Lattner06c5eed2009-09-13 20:08:00 +00001003void AsmWriterEmitter::run(raw_ostream &O) {
Chris Lattner06c5eed2009-09-13 20:08:00 +00001004 EmitPrintInstruction(O);
1005 EmitGetRegisterName(O);
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001006 EmitPrintAliasInstruction(O);
Chris Lattner06c5eed2009-09-13 20:08:00 +00001007}
1008
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +00001009
1010namespace llvm {
1011
1012void EmitAsmWriter(RecordKeeper &RK, raw_ostream &OS) {
1013 emitSourceFileHeader("Assembly Writer Source Fragment", OS);
1014 AsmWriterEmitter(RK).run(OS);
1015}
1016
1017} // End llvm namespace