blob: 40dea9db41dace1d9153ecbccbcc176074d382b4 [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"
Benjamin Kramerd59664f2014-04-29 23:26:49 +000018#include "llvm/ADT/SmallString.h"
Craig Topperb6350132012-07-27 06:44:02 +000019#include "llvm/ADT/StringExtras.h"
Owen Andersona84be6c2011-06-27 21:06:21 +000020#include "llvm/ADT/Twine.h"
Chris Lattner692374c2006-07-18 17:18:03 +000021#include "llvm/Support/Debug.h"
Benjamin Kramer17c17bc2013-09-11 15:42:16 +000022#include "llvm/Support/Format.h"
Chris Lattner692374c2006-07-18 17:18:03 +000023#include "llvm/Support/MathExtras.h"
Peter Collingbourne84c287e2011-10-01 16:41:13 +000024#include "llvm/TableGen/Error.h"
25#include "llvm/TableGen/Record.h"
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000026#include "llvm/TableGen/TableGenBackend.h"
Jeff Cohenda636b32005-01-22 18:50:10 +000027#include <algorithm>
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000028#include <cassert>
29#include <map>
30#include <vector>
Chris Lattner1c4ae852004-08-01 05:59:33 +000031using namespace llvm;
32
Chandler Carruthe96dd892014-04-21 22:55:11 +000033#define DEBUG_TYPE "asm-writer-emitter"
34
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000035namespace {
36class AsmWriterEmitter {
37 RecordKeeper &Records;
Ahmed Bougachabd214002013-10-28 18:07:17 +000038 CodeGenTarget Target;
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000039 std::map<const CodeGenInstruction*, AsmWriterInst*> CGIAWIMap;
Craig Topper4c6129a2014-02-05 07:56:49 +000040 const std::vector<const CodeGenInstruction*> *NumberedInstructions;
Ahmed Bougachabd214002013-10-28 18:07:17 +000041 std::vector<AsmWriterInst> Instructions;
Tim Northoveree20caa2014-05-12 18:04:06 +000042 std::vector<std::string> PrintMethods;
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000043public:
Ahmed Bougachabd214002013-10-28 18:07:17 +000044 AsmWriterEmitter(RecordKeeper &R);
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000045
46 void run(raw_ostream &o);
47
48private:
49 void EmitPrintInstruction(raw_ostream &o);
50 void EmitGetRegisterName(raw_ostream &o);
51 void EmitPrintAliasInstruction(raw_ostream &O);
52
53 AsmWriterInst *getAsmWriterInstByID(unsigned ID) const {
Craig Topper4c6129a2014-02-05 07:56:49 +000054 assert(ID < NumberedInstructions->size());
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000055 std::map<const CodeGenInstruction*, AsmWriterInst*>::const_iterator I =
Craig Topper4c6129a2014-02-05 07:56:49 +000056 CGIAWIMap.find(NumberedInstructions->at(ID));
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000057 assert(I != CGIAWIMap.end() && "Didn't find inst!");
58 return I->second;
59 }
60 void FindUniqueOperandCommands(std::vector<std::string> &UOC,
61 std::vector<unsigned> &InstIdxs,
62 std::vector<unsigned> &InstOpsUsed) const;
63};
64} // end anonymous namespace
65
Chris Lattner59a7f5c2005-01-22 20:31:17 +000066static void PrintCases(std::vector<std::pair<std::string,
Daniel Dunbar38a22bf2009-07-03 00:10:29 +000067 AsmWriterOperand> > &OpsToPrint, raw_ostream &O) {
Chris Lattner59a7f5c2005-01-22 20:31:17 +000068 O << " case " << OpsToPrint.back().first << ": ";
69 AsmWriterOperand TheOp = OpsToPrint.back().second;
70 OpsToPrint.pop_back();
71
72 // Check to see if any other operands are identical in this list, and if so,
73 // emit a case label for them.
74 for (unsigned i = OpsToPrint.size(); i != 0; --i)
75 if (OpsToPrint[i-1].second == TheOp) {
76 O << "\n case " << OpsToPrint[i-1].first << ": ";
77 OpsToPrint.erase(OpsToPrint.begin()+i-1);
78 }
79
80 // Finally, emit the code.
Chris Lattner692374c2006-07-18 17:18:03 +000081 O << TheOp.getCode();
Chris Lattner59a7f5c2005-01-22 20:31:17 +000082 O << "break;\n";
83}
84
Chris Lattner9ceb7c82005-01-22 18:38:13 +000085
86/// EmitInstructions - Emit the last instruction in the vector and any other
87/// instructions that are suitably similar to it.
88static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
Daniel Dunbar38a22bf2009-07-03 00:10:29 +000089 raw_ostream &O) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +000090 AsmWriterInst FirstInst = Insts.back();
91 Insts.pop_back();
92
93 std::vector<AsmWriterInst> SimilarInsts;
94 unsigned DifferingOperand = ~0;
95 for (unsigned i = Insts.size(); i != 0; --i) {
Chris Lattner92275bb2005-01-22 19:22:23 +000096 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
97 if (DiffOp != ~1U) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +000098 if (DifferingOperand == ~0U) // First match!
99 DifferingOperand = DiffOp;
100
101 // If this differs in the same operand as the rest of the instructions in
102 // this class, move it to the SimilarInsts list.
Chris Lattner92275bb2005-01-22 19:22:23 +0000103 if (DifferingOperand == DiffOp || DiffOp == ~0U) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000104 SimilarInsts.push_back(Insts[i-1]);
105 Insts.erase(Insts.begin()+i-1);
106 }
107 }
108 }
109
Chris Lattner017b93d2006-05-01 17:01:17 +0000110 O << " case " << FirstInst.CGI->Namespace << "::"
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000111 << FirstInst.CGI->TheDef->getName() << ":\n";
Craig Topper190ecd52016-01-08 07:06:32 +0000112 for (const AsmWriterInst &AWI : SimilarInsts)
113 O << " case " << AWI.CGI->Namespace << "::"
114 << AWI.CGI->TheDef->getName() << ":\n";
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000115 for (unsigned i = 0, e = FirstInst.Operands.size(); i != e; ++i) {
116 if (i != DifferingOperand) {
117 // If the operand is the same for all instructions, just print it.
Chris Lattner692374c2006-07-18 17:18:03 +0000118 O << " " << FirstInst.Operands[i].getCode();
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000119 } else {
120 // If this is the operand that varies between all of the instructions,
121 // emit a switch for just this operand now.
122 O << " switch (MI->getOpcode()) {\n";
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000123 std::vector<std::pair<std::string, AsmWriterOperand> > OpsToPrint;
Chris Lattner017b93d2006-05-01 17:01:17 +0000124 OpsToPrint.push_back(std::make_pair(FirstInst.CGI->Namespace + "::" +
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000125 FirstInst.CGI->TheDef->getName(),
126 FirstInst.Operands[i]));
Misha Brukman650ba8e2005-04-22 00:00:37 +0000127
Craig Topper190ecd52016-01-08 07:06:32 +0000128 for (const AsmWriterInst &AWI : SimilarInsts) {
Chris Lattner017b93d2006-05-01 17:01:17 +0000129 OpsToPrint.push_back(std::make_pair(AWI.CGI->Namespace+"::"+
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000130 AWI.CGI->TheDef->getName(),
131 AWI.Operands[i]));
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000132 }
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000133 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
134 while (!OpsToPrint.empty())
135 PrintCases(OpsToPrint, O);
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000136 O << " }";
137 }
138 O << "\n";
139 }
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000140 O << " break;\n";
141}
Chris Lattner0c23ba52005-01-22 17:32:42 +0000142
Chris Lattner692374c2006-07-18 17:18:03 +0000143void AsmWriterEmitter::
Jim Grosbacha5497342010-09-29 22:32:50 +0000144FindUniqueOperandCommands(std::vector<std::string> &UniqueOperandCommands,
Chris Lattneredee5252006-07-18 18:28:27 +0000145 std::vector<unsigned> &InstIdxs,
146 std::vector<unsigned> &InstOpsUsed) const {
Craig Topper4c6129a2014-02-05 07:56:49 +0000147 InstIdxs.assign(NumberedInstructions->size(), ~0U);
Jim Grosbacha5497342010-09-29 22:32:50 +0000148
Chris Lattner692374c2006-07-18 17:18:03 +0000149 // This vector parallels UniqueOperandCommands, keeping track of which
150 // instructions each case are used for. It is a comma separated string of
151 // enums.
152 std::vector<std::string> InstrsForCase;
153 InstrsForCase.resize(UniqueOperandCommands.size());
Chris Lattneredee5252006-07-18 18:28:27 +0000154 InstOpsUsed.assign(UniqueOperandCommands.size(), 0);
Jim Grosbacha5497342010-09-29 22:32:50 +0000155
Craig Topper4c6129a2014-02-05 07:56:49 +0000156 for (unsigned i = 0, e = NumberedInstructions->size(); i != e; ++i) {
Chris Lattner692374c2006-07-18 17:18:03 +0000157 const AsmWriterInst *Inst = getAsmWriterInstByID(i);
Craig Topper24064772014-04-15 07:20:03 +0000158 if (!Inst)
Rafael Espindolab1f25f12014-03-07 06:08:31 +0000159 continue; // PHI, INLINEASM, CFI_INSTRUCTION, etc.
Jim Grosbacha5497342010-09-29 22:32:50 +0000160
Chris Lattnercb0c8482006-07-18 17:56:07 +0000161 if (Inst->Operands.empty())
Chris Lattner692374c2006-07-18 17:18:03 +0000162 continue; // Instruction already done.
Chris Lattner9d250692006-07-18 17:50:22 +0000163
Craig Topper1993e3b2016-01-08 07:06:29 +0000164 std::string Command = " " + Inst->Operands[0].getCode() + "\n";
Chris Lattner9d250692006-07-18 17:50:22 +0000165
Chris Lattner692374c2006-07-18 17:18:03 +0000166 // Check to see if we already have 'Command' in UniqueOperandCommands.
167 // If not, add it.
168 bool FoundIt = false;
169 for (unsigned idx = 0, e = UniqueOperandCommands.size(); idx != e; ++idx)
170 if (UniqueOperandCommands[idx] == Command) {
171 InstIdxs[i] = idx;
172 InstrsForCase[idx] += ", ";
173 InstrsForCase[idx] += Inst->CGI->TheDef->getName();
174 FoundIt = true;
175 break;
176 }
177 if (!FoundIt) {
178 InstIdxs[i] = UniqueOperandCommands.size();
Craig Topper1993e3b2016-01-08 07:06:29 +0000179 UniqueOperandCommands.push_back(std::move(Command));
Chris Lattner692374c2006-07-18 17:18:03 +0000180 InstrsForCase.push_back(Inst->CGI->TheDef->getName());
Chris Lattneredee5252006-07-18 18:28:27 +0000181
182 // This command matches one operand so far.
183 InstOpsUsed.push_back(1);
184 }
185 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000186
Chris Lattneredee5252006-07-18 18:28:27 +0000187 // For each entry of UniqueOperandCommands, there is a set of instructions
188 // that uses it. If the next command of all instructions in the set are
189 // identical, fold it into the command.
190 for (unsigned CommandIdx = 0, e = UniqueOperandCommands.size();
191 CommandIdx != e; ++CommandIdx) {
Jim Grosbacha5497342010-09-29 22:32:50 +0000192
Chris Lattneredee5252006-07-18 18:28:27 +0000193 for (unsigned Op = 1; ; ++Op) {
194 // Scan for the first instruction in the set.
195 std::vector<unsigned>::iterator NIT =
196 std::find(InstIdxs.begin(), InstIdxs.end(), CommandIdx);
197 if (NIT == InstIdxs.end()) break; // No commonality.
198
199 // If this instruction has no more operands, we isn't anything to merge
200 // into this command.
Jim Grosbacha5497342010-09-29 22:32:50 +0000201 const AsmWriterInst *FirstInst =
Chris Lattneredee5252006-07-18 18:28:27 +0000202 getAsmWriterInstByID(NIT-InstIdxs.begin());
203 if (!FirstInst || FirstInst->Operands.size() == Op)
204 break;
205
206 // Otherwise, scan to see if all of the other instructions in this command
207 // set share the operand.
208 bool AllSame = true;
David Greene5b4bc262009-07-29 20:10:24 +0000209
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
Chris Lattneredee5252006-07-18 18:28:27 +0000218 if (!OtherInst || OtherInst->Operands.size() == Op ||
219 OtherInst->Operands[Op] != FirstInst->Operands[Op]) {
220 AllSame = false;
221 break;
222 }
223 }
224 if (!AllSame) break;
Jim Grosbacha5497342010-09-29 22:32:50 +0000225
Chris Lattneredee5252006-07-18 18:28:27 +0000226 // Okay, everything in this command set has the same next operand. Add it
227 // to UniqueOperandCommands and remember that it was consumed.
228 std::string Command = " " + FirstInst->Operands[Op].getCode() + "\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000229
Chris Lattneredee5252006-07-18 18:28:27 +0000230 UniqueOperandCommands[CommandIdx] += Command;
231 InstOpsUsed[CommandIdx]++;
Chris Lattner692374c2006-07-18 17:18:03 +0000232 }
233 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000234
Chris Lattner692374c2006-07-18 17:18:03 +0000235 // Prepend some of the instructions each case is used for onto the case val.
236 for (unsigned i = 0, e = InstrsForCase.size(); i != e; ++i) {
237 std::string Instrs = InstrsForCase[i];
238 if (Instrs.size() > 70) {
239 Instrs.erase(Instrs.begin()+70, Instrs.end());
240 Instrs += "...";
241 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000242
Chris Lattner692374c2006-07-18 17:18:03 +0000243 if (!Instrs.empty())
Jim Grosbacha5497342010-09-29 22:32:50 +0000244 UniqueOperandCommands[i] = " // " + Instrs + "\n" +
Chris Lattner692374c2006-07-18 17:18:03 +0000245 UniqueOperandCommands[i];
246 }
247}
248
249
Daniel Dunbar04f049f2009-10-17 20:43:42 +0000250static void UnescapeString(std::string &Str) {
251 for (unsigned i = 0; i != Str.size(); ++i) {
252 if (Str[i] == '\\' && i != Str.size()-1) {
253 switch (Str[i+1]) {
254 default: continue; // Don't execute the code after the switch.
255 case 'a': Str[i] = '\a'; break;
256 case 'b': Str[i] = '\b'; break;
257 case 'e': Str[i] = 27; break;
258 case 'f': Str[i] = '\f'; break;
259 case 'n': Str[i] = '\n'; break;
260 case 'r': Str[i] = '\r'; break;
261 case 't': Str[i] = '\t'; break;
262 case 'v': Str[i] = '\v'; break;
263 case '"': Str[i] = '\"'; break;
264 case '\'': Str[i] = '\''; break;
265 case '\\': Str[i] = '\\'; break;
266 }
267 // Nuke the second character.
268 Str.erase(Str.begin()+i+1);
269 }
270 }
271}
272
Chris Lattner06c5eed2009-09-13 20:08:00 +0000273/// EmitPrintInstruction - Generate the code for the "printInstruction" method
Ahmed Bougachabd214002013-10-28 18:07:17 +0000274/// implementation. Destroys all instances of AsmWriterInst information, by
275/// clearing the Instructions vector.
Chris Lattner06c5eed2009-09-13 20:08:00 +0000276void AsmWriterEmitter::EmitPrintInstruction(raw_ostream &O) {
Chris Lattner6ffa5012004-08-14 22:50:53 +0000277 Record *AsmWriter = Target.getAsmWriter();
Chris Lattner72770f52004-10-03 20:19:02 +0000278 std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
Akira Hatanakab46d0232015-03-27 20:36:02 +0000279 unsigned PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
Jim Grosbacha5497342010-09-29 22:32:50 +0000280
Chris Lattner1c4ae852004-08-01 05:59:33 +0000281 O <<
282 "/// printInstruction - This method is automatically generated by tablegen\n"
Chris Lattner06c5eed2009-09-13 20:08:00 +0000283 "/// from the instruction set description.\n"
Chris Lattnerb94284b2009-08-08 01:32:19 +0000284 "void " << Target.getName() << ClassName
Akira Hatanakab46d0232015-03-27 20:36:02 +0000285 << "::printInstruction(const MCInst *MI, "
286 << (PassSubtarget ? "const MCSubtargetInfo &STI, " : "")
287 << "raw_ostream &O) {\n";
Chris Lattner1c4ae852004-08-01 05:59:33 +0000288
Chris Lattnere32982c2006-07-14 22:59:11 +0000289 // Build an aggregate string, and build a table of offsets into it.
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000290 SequenceToOffsetTable<std::string> StringTable;
Jim Grosbacha5497342010-09-29 22:32:50 +0000291
Chris Lattner5d751b42006-09-27 16:44:09 +0000292 /// OpcodeInfo - This encodes the index of the string to use for the first
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000293 /// chunk of the output as well as indices used for operand printing.
Manman Ren68cf9fc2012-09-13 17:43:46 +0000294 /// To reduce the number of unhandled cases, we expand the size from 32-bit
295 /// to 32+16 = 48-bit.
Craig Topper06cec4c2012-09-14 08:33:11 +0000296 std::vector<uint64_t> OpcodeInfo;
Jim Grosbacha5497342010-09-29 22:32:50 +0000297
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000298 // Add all strings to the string table upfront so it can generate an optimized
299 // representation.
Craig Topper190ecd52016-01-08 07:06:32 +0000300 for (const CodeGenInstruction *Inst : *NumberedInstructions) {
301 AsmWriterInst *AWI = CGIAWIMap[Inst];
Craig Topper24064772014-04-15 07:20:03 +0000302 if (AWI &&
Jim Grosbachf4e67082012-04-18 18:56:33 +0000303 AWI->Operands[0].OperandType ==
304 AsmWriterOperand::isLiteralTextOperand &&
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000305 !AWI->Operands[0].Str.empty()) {
306 std::string Str = AWI->Operands[0].Str;
307 UnescapeString(Str);
308 StringTable.add(Str);
309 }
310 }
311
312 StringTable.layout();
313
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000314 unsigned MaxStringIdx = 0;
Craig Topper190ecd52016-01-08 07:06:32 +0000315 for (const CodeGenInstruction *Inst : *NumberedInstructions) {
316 AsmWriterInst *AWI = CGIAWIMap[Inst];
Chris Lattnere32982c2006-07-14 22:59:11 +0000317 unsigned Idx;
Craig Topper24064772014-04-15 07:20:03 +0000318 if (!AWI) {
Chris Lattnere32982c2006-07-14 22:59:11 +0000319 // Something not handled by the asmwriter printer.
Chris Lattnerb47ed612009-09-14 01:16:36 +0000320 Idx = ~0U;
Jim Grosbacha5497342010-09-29 22:32:50 +0000321 } else if (AWI->Operands[0].OperandType !=
Chris Lattner36504652006-07-19 01:39:06 +0000322 AsmWriterOperand::isLiteralTextOperand ||
323 AWI->Operands[0].Str.empty()) {
324 // Something handled by the asmwriter printer, but with no leading string.
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000325 Idx = StringTable.get("");
Chris Lattnere32982c2006-07-14 22:59:11 +0000326 } else {
Chris Lattnerb47ed612009-09-14 01:16:36 +0000327 std::string Str = AWI->Operands[0].Str;
328 UnescapeString(Str);
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000329 Idx = StringTable.get(Str);
Chris Lattnerb47ed612009-09-14 01:16:36 +0000330 MaxStringIdx = std::max(MaxStringIdx, Idx);
Jim Grosbacha5497342010-09-29 22:32:50 +0000331
Chris Lattnere32982c2006-07-14 22:59:11 +0000332 // Nuke the string from the operand list. It is now handled!
333 AWI->Operands.erase(AWI->Operands.begin());
Chris Lattner92275bb2005-01-22 19:22:23 +0000334 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000335
Chris Lattnerb47ed612009-09-14 01:16:36 +0000336 // Bias offset by one since we want 0 as a sentinel.
Craig Topper06cec4c2012-09-14 08:33:11 +0000337 OpcodeInfo.push_back(Idx+1);
Chris Lattner92275bb2005-01-22 19:22:23 +0000338 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000339
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000340 // Figure out how many bits we used for the string index.
Chris Lattnerb47ed612009-09-14 01:16:36 +0000341 unsigned AsmStrBits = Log2_32_Ceil(MaxStringIdx+2);
Jim Grosbacha5497342010-09-29 22:32:50 +0000342
Chris Lattner692374c2006-07-18 17:18:03 +0000343 // To reduce code size, we compactify common instructions into a few bits
344 // in the opcode-indexed table.
Craig Topper06cec4c2012-09-14 08:33:11 +0000345 unsigned BitsLeft = 64-AsmStrBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000346
Craig Topper1f387362014-11-25 20:11:25 +0000347 std::vector<std::vector<std::string>> TableDrivenOperandPrinters;
Jim Grosbacha5497342010-09-29 22:32:50 +0000348
Chris Lattnercb0c8482006-07-18 17:56:07 +0000349 while (1) {
Chris Lattner692374c2006-07-18 17:18:03 +0000350 std::vector<std::string> UniqueOperandCommands;
Chris Lattner692374c2006-07-18 17:18:03 +0000351 std::vector<unsigned> InstIdxs;
Chris Lattneredee5252006-07-18 18:28:27 +0000352 std::vector<unsigned> NumInstOpsHandled;
353 FindUniqueOperandCommands(UniqueOperandCommands, InstIdxs,
354 NumInstOpsHandled);
Jim Grosbacha5497342010-09-29 22:32:50 +0000355
Chris Lattner692374c2006-07-18 17:18:03 +0000356 // If we ran out of operands to print, we're done.
357 if (UniqueOperandCommands.empty()) break;
Jim Grosbacha5497342010-09-29 22:32:50 +0000358
Chris Lattner692374c2006-07-18 17:18:03 +0000359 // Compute the number of bits we need to represent these cases, this is
360 // ceil(log2(numentries)).
361 unsigned NumBits = Log2_32_Ceil(UniqueOperandCommands.size());
Jim Grosbacha5497342010-09-29 22:32:50 +0000362
Chris Lattner692374c2006-07-18 17:18:03 +0000363 // If we don't have enough bits for this operand, don't include it.
364 if (NumBits > BitsLeft) {
Chris Lattner34822f62009-08-23 04:44:11 +0000365 DEBUG(errs() << "Not enough bits to densely encode " << NumBits
366 << " more bits\n");
Chris Lattner692374c2006-07-18 17:18:03 +0000367 break;
368 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000369
Chris Lattner692374c2006-07-18 17:18:03 +0000370 // Otherwise, we can include this in the initial lookup table. Add it in.
Chris Lattner692374c2006-07-18 17:18:03 +0000371 for (unsigned i = 0, e = InstIdxs.size(); i != e; ++i)
Manman Ren68cf9fc2012-09-13 17:43:46 +0000372 if (InstIdxs[i] != ~0U) {
Craig Topper06cec4c2012-09-14 08:33:11 +0000373 OpcodeInfo[i] |= (uint64_t)InstIdxs[i] << (64-BitsLeft);
Manman Ren68cf9fc2012-09-13 17:43:46 +0000374 }
Craig Topper06cec4c2012-09-14 08:33:11 +0000375 BitsLeft -= NumBits;
Jim Grosbacha5497342010-09-29 22:32:50 +0000376
Chris Lattnercb0c8482006-07-18 17:56:07 +0000377 // Remove the info about this operand.
Craig Topper4c6129a2014-02-05 07:56:49 +0000378 for (unsigned i = 0, e = NumberedInstructions->size(); i != e; ++i) {
Chris Lattnercb0c8482006-07-18 17:56:07 +0000379 if (AsmWriterInst *Inst = getAsmWriterInstByID(i))
Chris Lattneredee5252006-07-18 18:28:27 +0000380 if (!Inst->Operands.empty()) {
381 unsigned NumOps = NumInstOpsHandled[InstIdxs[i]];
Chris Lattner6e172082006-07-18 19:06:01 +0000382 assert(NumOps <= Inst->Operands.size() &&
383 "Can't remove this many ops!");
Chris Lattneredee5252006-07-18 18:28:27 +0000384 Inst->Operands.erase(Inst->Operands.begin(),
385 Inst->Operands.begin()+NumOps);
386 }
Chris Lattnercb0c8482006-07-18 17:56:07 +0000387 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000388
Chris Lattnercb0c8482006-07-18 17:56:07 +0000389 // Remember the handlers for this set of operands.
Craig Topper1f387362014-11-25 20:11:25 +0000390 TableDrivenOperandPrinters.push_back(std::move(UniqueOperandCommands));
Chris Lattner692374c2006-07-18 17:18:03 +0000391 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000392
Craig Topper14d91732016-01-11 05:13:41 +0000393 // Emit the string table itself.
Reid Kleckner132c40f2014-07-17 19:43:40 +0000394 O << " static const char AsmStrs[] = {\n";
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000395 StringTable.emit(O, printChar);
396 O << " };\n\n";
Chris Lattnere32982c2006-07-14 22:59:11 +0000397
Craig Topper14d91732016-01-11 05:13:41 +0000398 // Emit the lookup tables in pieces to minimize wasted bytes.
399 unsigned BytesNeeded = ((64 - BitsLeft) + 7) / 8;
400 unsigned Table = 0, Shift = 0;
401 SmallString<128> BitsString;
402 raw_svector_ostream BitsOS(BitsString);
403 // If the total bits is more than 32-bits we need to use a 64-bit type.
404 BitsOS << " uint" << ((BitsLeft < 32) ? 64 : 32) << "_t Bits = 0;\n";
405 while (BytesNeeded != 0) {
406 // Figure out how big this table section needs to be, but no bigger than 4.
407 unsigned TableSize = std::min(1 << Log2_32(BytesNeeded), 4);
408 BytesNeeded -= TableSize;
409 TableSize *= 8; // Convert to bits;
410 uint64_t Mask = (1ULL << TableSize) - 1;
411 O << " static const uint" << TableSize << "_t OpInfo" << Table
412 << "[] = {\n";
413 for (unsigned i = 0, e = NumberedInstructions->size(); i != e; ++i) {
414 O << " " << ((OpcodeInfo[i] >> Shift) & Mask) << "U,\t// "
415 << NumberedInstructions->at(i)->TheDef->getName() << "\n";
416 }
417 O << " };\n\n";
418 // Emit string to combine the individual table lookups.
419 BitsOS << " Bits |= ";
420 // If the total bits is more than 32-bits we need to use a 64-bit type.
421 if (BitsLeft < 32)
422 BitsOS << "(uint64_t)";
423 BitsOS << "OpInfo" << Table << "[MI->getOpcode()] << " << Shift << ";\n";
424 // Prepare the shift for the next iteration and increment the table count.
425 Shift += TableSize;
426 ++Table;
427 }
428
429 // Emit the initial tab character.
Evan Cheng32e53472008-02-02 08:39:46 +0000430 O << " O << \"\\t\";\n\n";
431
Craig Topper06cec4c2012-09-14 08:33:11 +0000432 O << " // Emit the opcode for the instruction.\n";
Craig Topper14d91732016-01-11 05:13:41 +0000433 O << BitsString;
434
435 // Emit the starting string.
Manman Ren68cf9fc2012-09-13 17:43:46 +0000436 O << " assert(Bits != 0 && \"Cannot print this instruction.\");\n"
Chris Lattnerb47ed612009-09-14 01:16:36 +0000437 << " O << AsmStrs+(Bits & " << (1 << AsmStrBits)-1 << ")-1;\n\n";
David Greenefdd25192009-08-05 21:00:52 +0000438
Chris Lattner692374c2006-07-18 17:18:03 +0000439 // Output the table driven operand information.
Craig Topper06cec4c2012-09-14 08:33:11 +0000440 BitsLeft = 64-AsmStrBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000441 for (unsigned i = 0, e = TableDrivenOperandPrinters.size(); i != e; ++i) {
442 std::vector<std::string> &Commands = TableDrivenOperandPrinters[i];
443
444 // Compute the number of bits we need to represent these cases, this is
445 // ceil(log2(numentries)).
446 unsigned NumBits = Log2_32_Ceil(Commands.size());
447 assert(NumBits <= BitsLeft && "consistency error");
Jim Grosbacha5497342010-09-29 22:32:50 +0000448
Chris Lattner692374c2006-07-18 17:18:03 +0000449 // Emit code to extract this field from Bits.
Chris Lattner692374c2006-07-18 17:18:03 +0000450 O << "\n // Fragment " << i << " encoded into " << NumBits
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000451 << " bits for " << Commands.size() << " unique commands.\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000452
Chris Lattneredee5252006-07-18 18:28:27 +0000453 if (Commands.size() == 2) {
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000454 // Emit two possibilitys with if/else.
Craig Topper06cec4c2012-09-14 08:33:11 +0000455 O << " if ((Bits >> "
456 << (64-BitsLeft) << ") & "
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000457 << ((1 << NumBits)-1) << ") {\n"
458 << Commands[1]
459 << " } else {\n"
460 << Commands[0]
461 << " }\n\n";
Eric Christophera573d192010-09-18 18:50:27 +0000462 } else if (Commands.size() == 1) {
463 // Emit a single possibility.
464 O << Commands[0] << "\n\n";
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000465 } else {
Craig Topper06cec4c2012-09-14 08:33:11 +0000466 O << " switch ((Bits >> "
467 << (64-BitsLeft) << ") & "
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000468 << ((1 << NumBits)-1) << ") {\n"
Craig Toppera4ff6ae2014-11-24 14:09:52 +0000469 << " default: llvm_unreachable(\"Invalid command number.\");\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000470
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000471 // Print out all the cases.
Craig Topper190ecd52016-01-08 07:06:32 +0000472 for (unsigned j = 0, e = Commands.size(); j != e; ++j) {
473 O << " case " << j << ":\n";
474 O << Commands[j];
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000475 O << " break;\n";
476 }
477 O << " }\n\n";
Chris Lattner692374c2006-07-18 17:18:03 +0000478 }
Craig Topper06cec4c2012-09-14 08:33:11 +0000479 BitsLeft -= NumBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000480 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000481
Chris Lattnercb0c8482006-07-18 17:56:07 +0000482 // Okay, delete instructions with no operand info left.
Chris Lattner692374c2006-07-18 17:18:03 +0000483 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
484 // Entire instruction has been emitted?
485 AsmWriterInst &Inst = Instructions[i];
Chris Lattnercb0c8482006-07-18 17:56:07 +0000486 if (Inst.Operands.empty()) {
Chris Lattner692374c2006-07-18 17:18:03 +0000487 Instructions.erase(Instructions.begin()+i);
Chris Lattnercb0c8482006-07-18 17:56:07 +0000488 --i; --e;
Chris Lattner692374c2006-07-18 17:18:03 +0000489 }
490 }
491
Jim Grosbacha5497342010-09-29 22:32:50 +0000492
Chris Lattner692374c2006-07-18 17:18:03 +0000493 // Because this is a vector, we want to emit from the end. Reverse all of the
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000494 // elements in the vector.
495 std::reverse(Instructions.begin(), Instructions.end());
Jim Grosbacha5497342010-09-29 22:32:50 +0000496
497
Chris Lattnerbf1a7692009-09-18 18:10:19 +0000498 // Now that we've emitted all of the operand info that fit into 32 bits, emit
499 // information for those instructions that are left. This is a less dense
500 // encoding, but we expect the main 32-bit table to handle the majority of
501 // instructions.
Chris Lattner66e288b2006-07-18 17:38:46 +0000502 if (!Instructions.empty()) {
503 // Find the opcode # of inline asm.
504 O << " switch (MI->getOpcode()) {\n";
505 while (!Instructions.empty())
506 EmitInstructions(Instructions, O);
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000507
Chris Lattner66e288b2006-07-18 17:38:46 +0000508 O << " }\n";
Chris Lattnerb94284b2009-08-08 01:32:19 +0000509 O << " return;\n";
Chris Lattner66e288b2006-07-18 17:38:46 +0000510 }
David Greene5b4bc262009-07-29 20:10:24 +0000511
Chris Lattner6e172082006-07-18 19:06:01 +0000512 O << "}\n";
Chris Lattner1c4ae852004-08-01 05:59:33 +0000513}
Chris Lattner06c5eed2009-09-13 20:08:00 +0000514
Craig Topperba6d83e2014-11-24 02:08:35 +0000515static const char *getMinimalTypeForRange(uint64_t Range) {
516 assert(Range < 0xFFFFFFFFULL && "Enum too large");
517 if (Range > 0xFFFF)
518 return "uint32_t";
519 if (Range > 0xFF)
520 return "uint16_t";
521 return "uint8_t";
522}
523
Owen Andersona84be6c2011-06-27 21:06:21 +0000524static void
525emitRegisterNameString(raw_ostream &O, StringRef AltName,
David Blaikie9b613db2014-11-29 18:13:39 +0000526 const std::deque<CodeGenRegister> &Registers) {
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000527 SequenceToOffsetTable<std::string> StringTable;
528 SmallVector<std::string, 4> AsmNames(Registers.size());
David Blaikie9b613db2014-11-29 18:13:39 +0000529 unsigned i = 0;
530 for (const auto &Reg : Registers) {
531 std::string &AsmName = AsmNames[i++];
Owen Andersona84be6c2011-06-27 21:06:21 +0000532
Owen Andersona84be6c2011-06-27 21:06:21 +0000533 // "NoRegAltName" is special. We don't need to do a lookup for that,
534 // as it's just a reference to the default register name.
535 if (AltName == "" || AltName == "NoRegAltName") {
536 AsmName = Reg.TheDef->getValueAsString("AsmName");
537 if (AsmName.empty())
538 AsmName = Reg.getName();
539 } else {
540 // Make sure the register has an alternate name for this index.
541 std::vector<Record*> AltNameList =
542 Reg.TheDef->getValueAsListOfDefs("RegAltNameIndices");
543 unsigned Idx = 0, e;
544 for (e = AltNameList.size();
545 Idx < e && (AltNameList[Idx]->getName() != AltName);
546 ++Idx)
547 ;
548 // If the register has an alternate name for this index, use it.
549 // Otherwise, leave it empty as an error flag.
550 if (Idx < e) {
551 std::vector<std::string> AltNames =
552 Reg.TheDef->getValueAsListOfStrings("AltNames");
553 if (AltNames.size() <= Idx)
Joerg Sonnenberger635debe2012-10-25 20:33:17 +0000554 PrintFatalError(Reg.TheDef->getLoc(),
Benjamin Kramer48e7e852014-03-29 17:17:15 +0000555 "Register definition missing alt name for '" +
556 AltName + "'.");
Owen Andersona84be6c2011-06-27 21:06:21 +0000557 AsmName = AltNames[Idx];
558 }
559 }
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000560 StringTable.add(AsmName);
561 }
Owen Andersona84be6c2011-06-27 21:06:21 +0000562
Craig Topperf8f0a232012-09-15 01:22:42 +0000563 StringTable.layout();
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000564 O << " static const char AsmStrs" << AltName << "[] = {\n";
565 StringTable.emit(O, printChar);
566 O << " };\n\n";
567
Craig Topperba6d83e2014-11-24 02:08:35 +0000568 O << " static const " << getMinimalTypeForRange(StringTable.size()-1)
569 << " RegAsmOffset" << AltName << "[] = {";
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000570 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
Craig Topper7a2cea12012-04-02 00:47:39 +0000571 if ((i % 14) == 0)
572 O << "\n ";
573 O << StringTable.get(AsmNames[i]) << ", ";
Owen Andersona84be6c2011-06-27 21:06:21 +0000574 }
Craig Topper9c252eb2012-04-03 06:52:47 +0000575 O << "\n };\n"
Owen Andersona84be6c2011-06-27 21:06:21 +0000576 << "\n";
Owen Andersona84be6c2011-06-27 21:06:21 +0000577}
Chris Lattner06c5eed2009-09-13 20:08:00 +0000578
579void AsmWriterEmitter::EmitGetRegisterName(raw_ostream &O) {
Chris Lattner06c5eed2009-09-13 20:08:00 +0000580 Record *AsmWriter = Target.getAsmWriter();
581 std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
David Blaikie9b613db2014-11-29 18:13:39 +0000582 const auto &Registers = Target.getRegBank().getRegisters();
Owen Andersona84be6c2011-06-27 21:06:21 +0000583 std::vector<Record*> AltNameIndices = Target.getRegAltNameIndices();
584 bool hasAltNames = AltNameIndices.size() > 1;
Hal Finkelcd5f9842015-12-11 17:31:27 +0000585 std::string Namespace =
586 Registers.front().TheDef->getValueAsString("Namespace");
Jim Grosbacha5497342010-09-29 22:32:50 +0000587
Chris Lattner06c5eed2009-09-13 20:08:00 +0000588 O <<
589 "\n\n/// getRegisterName - This method is automatically generated by tblgen\n"
590 "/// from the register set description. This returns the assembler name\n"
591 "/// for the specified register.\n"
Owen Andersona84be6c2011-06-27 21:06:21 +0000592 "const char *" << Target.getName() << ClassName << "::";
593 if (hasAltNames)
594 O << "\ngetRegisterName(unsigned RegNo, unsigned AltIdx) {\n";
595 else
596 O << "getRegisterName(unsigned RegNo) {\n";
597 O << " assert(RegNo && RegNo < " << (Registers.size()+1)
598 << " && \"Invalid register number!\");\n"
Chris Lattnera7e8ae42009-09-14 01:26:18 +0000599 << "\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000600
Owen Andersona84be6c2011-06-27 21:06:21 +0000601 if (hasAltNames) {
Craig Topper190ecd52016-01-08 07:06:32 +0000602 for (const Record *R : AltNameIndices)
603 emitRegisterNameString(O, R->getName(), Registers);
Owen Andersona84be6c2011-06-27 21:06:21 +0000604 } else
605 emitRegisterNameString(O, "", Registers);
Jim Grosbacha5497342010-09-29 22:32:50 +0000606
Owen Andersona84be6c2011-06-27 21:06:21 +0000607 if (hasAltNames) {
Craig Topperba6d83e2014-11-24 02:08:35 +0000608 O << " switch(AltIdx) {\n"
Craig Topperc4965bc2012-02-05 07:21:30 +0000609 << " default: llvm_unreachable(\"Invalid register alt name index!\");\n";
Craig Topper190ecd52016-01-08 07:06:32 +0000610 for (const Record *R : AltNameIndices) {
611 std::string AltName(R->getName());
Hal Finkelcd5f9842015-12-11 17:31:27 +0000612 std::string Prefix = !Namespace.empty() ? Namespace + "::" : "";
613 O << " case " << Prefix << AltName << ":\n"
Craig Topperba6d83e2014-11-24 02:08:35 +0000614 << " assert(*(AsmStrs" << AltName << "+RegAsmOffset"
615 << AltName << "[RegNo-1]) &&\n"
616 << " \"Invalid alt name index for register!\");\n"
617 << " return AsmStrs" << AltName << "+RegAsmOffset"
618 << AltName << "[RegNo-1];\n";
Owen Andersona84be6c2011-06-27 21:06:21 +0000619 }
Craig Topperba6d83e2014-11-24 02:08:35 +0000620 O << " }\n";
621 } else {
622 O << " assert (*(AsmStrs+RegAsmOffset[RegNo-1]) &&\n"
623 << " \"Invalid alt name index for register!\");\n"
624 << " return AsmStrs+RegAsmOffset[RegNo-1];\n";
Owen Andersona84be6c2011-06-27 21:06:21 +0000625 }
Craig Topperba6d83e2014-11-24 02:08:35 +0000626 O << "}\n";
Chris Lattner06c5eed2009-09-13 20:08:00 +0000627}
628
Bill Wendling7e5771d2011-03-21 08:31:53 +0000629namespace {
Bill Wendling5d3174c2011-03-21 08:40:31 +0000630// IAPrinter - Holds information about an InstAlias. Two InstAliases match if
631// they both have the same conditionals. In which case, we cannot print out the
632// alias for that pattern.
633class IAPrinter {
Bill Wendling5d3174c2011-03-21 08:40:31 +0000634 std::vector<std::string> Conds;
Tim Northoveree20caa2014-05-12 18:04:06 +0000635 std::map<StringRef, std::pair<int, int>> OpMap;
636 SmallVector<Record*, 4> ReqFeatures;
637
Bill Wendling5d3174c2011-03-21 08:40:31 +0000638 std::string Result;
639 std::string AsmString;
Bill Wendling5d3174c2011-03-21 08:40:31 +0000640public:
Tim Northoveree20caa2014-05-12 18:04:06 +0000641 IAPrinter(std::string R, std::string AS) : Result(R), AsmString(AS) {}
Bill Wendling5d3174c2011-03-21 08:40:31 +0000642
643 void addCond(const std::string &C) { Conds.push_back(C); }
Bill Wendling5d3174c2011-03-21 08:40:31 +0000644
Tim Northoveree20caa2014-05-12 18:04:06 +0000645 void addOperand(StringRef Op, int OpIdx, int PrintMethodIdx = -1) {
646 assert(OpIdx >= 0 && OpIdx < 0xFE && "Idx out of range");
Tim Northover0ee9e7e2014-05-13 09:37:41 +0000647 assert(PrintMethodIdx >= -1 && PrintMethodIdx < 0xFF &&
Jay Foadb3590512014-05-13 08:26:53 +0000648 "Idx out of range");
Tim Northoveree20caa2014-05-12 18:04:06 +0000649 OpMap[Op] = std::make_pair(OpIdx, PrintMethodIdx);
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000650 }
Tim Northoveree20caa2014-05-12 18:04:06 +0000651
Bill Wendling5d3174c2011-03-21 08:40:31 +0000652 bool isOpMapped(StringRef Op) { return OpMap.find(Op) != OpMap.end(); }
Tim Northoveree20caa2014-05-12 18:04:06 +0000653 int getOpIndex(StringRef Op) { return OpMap[Op].first; }
654 std::pair<int, int> &getOpData(StringRef Op) { return OpMap[Op]; }
Bill Wendling5d3174c2011-03-21 08:40:31 +0000655
Tim Northoverd8d65a62014-05-15 11:16:32 +0000656 std::pair<StringRef, StringRef::iterator> parseName(StringRef::iterator Start,
657 StringRef::iterator End) {
658 StringRef::iterator I = Start;
Evgeny Astigeevichb42003d2014-12-16 18:16:17 +0000659 StringRef::iterator Next;
Tim Northoverd8d65a62014-05-15 11:16:32 +0000660 if (*I == '{') {
661 // ${some_name}
662 Start = ++I;
663 while (I != End && *I != '}')
664 ++I;
Evgeny Astigeevichb42003d2014-12-16 18:16:17 +0000665 Next = I;
666 // eat the final '}'
667 if (Next != End)
668 ++Next;
Tim Northoverd8d65a62014-05-15 11:16:32 +0000669 } else {
670 // $name, just eat the usual suspects.
671 while (I != End &&
672 ((*I >= 'a' && *I <= 'z') || (*I >= 'A' && *I <= 'Z') ||
673 (*I >= '0' && *I <= '9') || *I == '_'))
674 ++I;
Evgeny Astigeevichb42003d2014-12-16 18:16:17 +0000675 Next = I;
Tim Northoverd8d65a62014-05-15 11:16:32 +0000676 }
677
Evgeny Astigeevichb42003d2014-12-16 18:16:17 +0000678 return std::make_pair(StringRef(Start, I - Start), Next);
Tim Northoverd8d65a62014-05-15 11:16:32 +0000679 }
680
Evan Cheng4d806e22011-07-06 02:02:33 +0000681 void print(raw_ostream &O) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000682 if (Conds.empty() && ReqFeatures.empty()) {
683 O.indent(6) << "return true;\n";
Evan Cheng4d806e22011-07-06 02:02:33 +0000684 return;
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000685 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000686
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000687 O << "if (";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000688
689 for (std::vector<std::string>::iterator
690 I = Conds.begin(), E = Conds.end(); I != E; ++I) {
691 if (I != Conds.begin()) {
692 O << " &&\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000693 O.indent(8);
Bill Wendling5d3174c2011-03-21 08:40:31 +0000694 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000695
Bill Wendling5d3174c2011-03-21 08:40:31 +0000696 O << *I;
697 }
698
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000699 O << ") {\n";
700 O.indent(6) << "// " << Result << "\n";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000701
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000702 // Directly mangle mapped operands into the string. Each operand is
703 // identified by a '$' sign followed by a byte identifying the number of the
704 // operand. We add one to the index to avoid zero bytes.
Tim Northoverd8d65a62014-05-15 11:16:32 +0000705 StringRef ASM(AsmString);
706 SmallString<128> OutString;
707 raw_svector_ostream OS(OutString);
708 for (StringRef::iterator I = ASM.begin(), E = ASM.end(); I != E;) {
709 OS << *I;
710 if (*I == '$') {
711 StringRef Name;
712 std::tie(Name, I) = parseName(++I, E);
713 assert(isOpMapped(Name) && "Unmapped operand!");
Tim Northoveree20caa2014-05-12 18:04:06 +0000714
Tim Northoverd8d65a62014-05-15 11:16:32 +0000715 int OpIndex, PrintIndex;
716 std::tie(OpIndex, PrintIndex) = getOpData(Name);
717 if (PrintIndex == -1) {
718 // Can use the default printOperand route.
719 OS << format("\\x%02X", (unsigned char)OpIndex + 1);
720 } else
721 // 3 bytes if a PrintMethod is needed: 0xFF, the MCInst operand
722 // number, and which of our pre-detected Methods to call.
723 OS << format("\\xFF\\x%02X\\x%02X", OpIndex + 1, PrintIndex + 1);
724 } else {
725 ++I;
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000726 }
727 }
728
729 // Emit the string.
Yaron Keren09fb7c62015-03-10 07:33:23 +0000730 O.indent(6) << "AsmString = \"" << OutString << "\";\n";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000731
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000732 O.indent(6) << "break;\n";
733 O.indent(4) << '}';
Bill Wendling5d3174c2011-03-21 08:40:31 +0000734 }
735
David Blaikie4ab57cd2015-08-06 19:23:33 +0000736 bool operator==(const IAPrinter &RHS) const {
Bill Wendling5d3174c2011-03-21 08:40:31 +0000737 if (Conds.size() != RHS.Conds.size())
738 return false;
739
740 unsigned Idx = 0;
David Blaikie4ab57cd2015-08-06 19:23:33 +0000741 for (const auto &str : Conds)
742 if (str != RHS.Conds[Idx++])
Bill Wendling5d3174c2011-03-21 08:40:31 +0000743 return false;
744
745 return true;
746 }
Bill Wendling5d3174c2011-03-21 08:40:31 +0000747};
748
Bill Wendling7e5771d2011-03-21 08:31:53 +0000749} // end anonymous namespace
750
Tim Northover5896b062014-05-16 09:42:04 +0000751static unsigned CountNumOperands(StringRef AsmString, unsigned Variant) {
752 std::string FlatAsmString =
753 CodeGenInstruction::FlattenAsmStringVariants(AsmString, Variant);
754 AsmString = FlatAsmString;
Bill Wendlinge7124492011-06-14 03:17:20 +0000755
Tim Northover5896b062014-05-16 09:42:04 +0000756 return AsmString.count(' ') + AsmString.count('\t');
Bill Wendling36c0c6d2011-06-15 04:31:19 +0000757}
Bill Wendlinge7124492011-06-14 03:17:20 +0000758
Tim Northover9a24f882014-05-20 09:17:16 +0000759namespace {
760struct AliasPriorityComparator {
David Blaikie4ab57cd2015-08-06 19:23:33 +0000761 typedef std::pair<CodeGenInstAlias, int> ValueType;
Tim Northover9a24f882014-05-20 09:17:16 +0000762 bool operator()(const ValueType &LHS, const ValueType &RHS) {
763 if (LHS.second == RHS.second) {
764 // We don't actually care about the order, but for consistency it
765 // shouldn't depend on pointer comparisons.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000766 return LHS.first.TheDef->getName() < RHS.first.TheDef->getName();
Tim Northover9a24f882014-05-20 09:17:16 +0000767 }
768
769 // Aliases with larger priorities should be considered first.
770 return LHS.second > RHS.second;
771 }
772};
773}
774
775
Bill Wendling7e5771d2011-03-21 08:31:53 +0000776void AsmWriterEmitter::EmitPrintAliasInstruction(raw_ostream &O) {
Bill Wendling7e5771d2011-03-21 08:31:53 +0000777 Record *AsmWriter = Target.getAsmWriter();
778
779 O << "\n#ifdef PRINT_ALIAS_INSTR\n";
780 O << "#undef PRINT_ALIAS_INSTR\n\n";
781
Tim Northoveree20caa2014-05-12 18:04:06 +0000782 //////////////////////////////
783 // Gather information about aliases we need to print
784 //////////////////////////////
785
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000786 // Emit the method that prints the alias instruction.
787 std::string ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
Tim Northover9a24f882014-05-20 09:17:16 +0000788 unsigned Variant = AsmWriter->getValueAsInt("Variant");
Akira Hatanakab46d0232015-03-27 20:36:02 +0000789 unsigned PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000790
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000791 std::vector<Record*> AllInstAliases =
792 Records.getAllDerivedDefinitions("InstAlias");
793
794 // Create a map from the qualified name to a list of potential matches.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000795 typedef std::set<std::pair<CodeGenInstAlias, int>, AliasPriorityComparator>
Tim Northover9a24f882014-05-20 09:17:16 +0000796 AliasWithPriority;
797 std::map<std::string, AliasWithPriority> AliasMap;
Craig Topper190ecd52016-01-08 07:06:32 +0000798 for (Record *R : AllInstAliases) {
Tim Northover9a24f882014-05-20 09:17:16 +0000799 int Priority = R->getValueAsInt("EmitPriority");
800 if (Priority < 1)
801 continue; // Aliases with priority 0 are never emitted.
802
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000803 const DagInit *DI = R->getValueAsDag("ResultInst");
Sean Silva88eb8dd2012-10-10 20:24:47 +0000804 const DefInit *Op = cast<DefInit>(DI->getOperator());
David Blaikie4ab57cd2015-08-06 19:23:33 +0000805 AliasMap[getQualifiedName(Op->getDef())].insert(
Craig Topper190ecd52016-01-08 07:06:32 +0000806 std::make_pair(CodeGenInstAlias(R, Variant, Target), Priority));
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000807 }
808
Bill Wendling7e570b52011-03-21 08:59:17 +0000809 // A map of which conditions need to be met for each instruction operand
810 // before it can be matched to the mnemonic.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000811 std::map<std::string, std::vector<IAPrinter>> IAPrinterMap;
Bill Wendling7e570b52011-03-21 08:59:17 +0000812
Artyom Skrobov6c8682e2014-06-10 13:11:35 +0000813 // A list of MCOperandPredicates for all operands in use, and the reverse map
814 std::vector<const Record*> MCOpPredicates;
815 DenseMap<const Record*, unsigned> MCOpPredicateMap;
816
Tim Northover9a24f882014-05-20 09:17:16 +0000817 for (auto &Aliases : AliasMap) {
818 for (auto &Alias : Aliases.second) {
David Blaikie4ab57cd2015-08-06 19:23:33 +0000819 const CodeGenInstAlias &CGA = Alias.first;
820 unsigned LastOpNo = CGA.ResultInstOperandIndex.size();
Bill Wendling36c0c6d2011-06-15 04:31:19 +0000821 unsigned NumResultOps =
David Blaikie4ab57cd2015-08-06 19:23:33 +0000822 CountNumOperands(CGA.ResultInst->AsmString, Variant);
Bill Wendlinge7124492011-06-14 03:17:20 +0000823
824 // Don't emit the alias if it has more operands than what it's aliasing.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000825 if (NumResultOps < CountNumOperands(CGA.AsmString, Variant))
Bill Wendlinge7124492011-06-14 03:17:20 +0000826 continue;
827
David Blaikie4ab57cd2015-08-06 19:23:33 +0000828 IAPrinter IAP(CGA.Result->getAsString(), CGA.AsmString);
Bill Wendling7e570b52011-03-21 08:59:17 +0000829
Tim Northover60091cf2014-05-15 13:36:01 +0000830 unsigned NumMIOps = 0;
David Blaikie4ab57cd2015-08-06 19:23:33 +0000831 for (auto &Operand : CGA.ResultOperands)
Tim Northover60091cf2014-05-15 13:36:01 +0000832 NumMIOps += Operand.getMINumOperands();
833
Bill Wendling7e570b52011-03-21 08:59:17 +0000834 std::string Cond;
Tim Northover60091cf2014-05-15 13:36:01 +0000835 Cond = std::string("MI->getNumOperands() == ") + llvm::utostr(NumMIOps);
David Blaikie4ab57cd2015-08-06 19:23:33 +0000836 IAP.addCond(Cond);
Bill Wendling7e570b52011-03-21 08:59:17 +0000837
Bill Wendling7e570b52011-03-21 08:59:17 +0000838 bool CantHandle = false;
839
Tim Northover60091cf2014-05-15 13:36:01 +0000840 unsigned MIOpNum = 0;
Bill Wendling7e570b52011-03-21 08:59:17 +0000841 for (unsigned i = 0, e = LastOpNo; i != e; ++i) {
Artyom Skrobovaf3c20f2014-06-10 12:47:23 +0000842 std::string Op = "MI->getOperand(" + llvm::utostr(MIOpNum) + ")";
843
David Blaikie4ab57cd2015-08-06 19:23:33 +0000844 const CodeGenInstAlias::ResultOperand &RO = CGA.ResultOperands[i];
Bill Wendling7e570b52011-03-21 08:59:17 +0000845
846 switch (RO.Kind) {
Bill Wendling7e570b52011-03-21 08:59:17 +0000847 case CodeGenInstAlias::ResultOperand::K_Record: {
848 const Record *Rec = RO.getRecord();
849 StringRef ROName = RO.getName();
Tim Northoveree20caa2014-05-12 18:04:06 +0000850 int PrintMethodIdx = -1;
Bill Wendling7e570b52011-03-21 08:59:17 +0000851
Tim Northoveree20caa2014-05-12 18:04:06 +0000852 // These two may have a PrintMethod, which we want to record (if it's
853 // the first time we've seen it) and provide an index for the aliasing
854 // code to use.
855 if (Rec->isSubClassOf("RegisterOperand") ||
856 Rec->isSubClassOf("Operand")) {
857 std::string PrintMethod = Rec->getValueAsString("PrintMethod");
858 if (PrintMethod != "" && PrintMethod != "printOperand") {
859 PrintMethodIdx = std::find(PrintMethods.begin(),
860 PrintMethods.end(), PrintMethod) -
861 PrintMethods.begin();
862 if (static_cast<unsigned>(PrintMethodIdx) == PrintMethods.size())
863 PrintMethods.push_back(PrintMethod);
864 }
865 }
Owen Andersona84be6c2011-06-27 21:06:21 +0000866
867 if (Rec->isSubClassOf("RegisterOperand"))
868 Rec = Rec->getValueAsDef("RegClass");
Bill Wendling7e570b52011-03-21 08:59:17 +0000869 if (Rec->isSubClassOf("RegisterClass")) {
David Blaikie4ab57cd2015-08-06 19:23:33 +0000870 IAP.addCond(Op + ".isReg()");
Bill Wendling7e570b52011-03-21 08:59:17 +0000871
David Blaikie4ab57cd2015-08-06 19:23:33 +0000872 if (!IAP.isOpMapped(ROName)) {
873 IAP.addOperand(ROName, MIOpNum, PrintMethodIdx);
874 Record *R = CGA.ResultOperands[i].getRecord();
Jack Carter9c1a0272013-02-05 08:32:10 +0000875 if (R->isSubClassOf("RegisterOperand"))
876 R = R->getValueAsDef("RegClass");
Benjamin Kramer682de392012-03-30 23:13:40 +0000877 Cond = std::string("MRI.getRegClass(") + Target.getName() + "::" +
Tim Northover60091cf2014-05-15 13:36:01 +0000878 R->getName() + "RegClassID)"
Artyom Skrobovaf3c20f2014-06-10 12:47:23 +0000879 ".contains(" + Op + ".getReg())";
Bill Wendling7e570b52011-03-21 08:59:17 +0000880 } else {
Artyom Skrobovaf3c20f2014-06-10 12:47:23 +0000881 Cond = Op + ".getReg() == MI->getOperand(" +
David Blaikie4ab57cd2015-08-06 19:23:33 +0000882 llvm::utostr(IAP.getOpIndex(ROName)) + ").getReg()";
Bill Wendling7e570b52011-03-21 08:59:17 +0000883 }
884 } else {
Tim Northoveree20caa2014-05-12 18:04:06 +0000885 // Assume all printable operands are desired for now. This can be
Alp Tokerbeaca192014-05-15 01:52:21 +0000886 // overridden in the InstAlias instantiation if necessary.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000887 IAP.addOperand(ROName, MIOpNum, PrintMethodIdx);
Bill Wendling7e570b52011-03-21 08:59:17 +0000888
Artyom Skrobov6c8682e2014-06-10 13:11:35 +0000889 // There might be an additional predicate on the MCOperand
890 unsigned Entry = MCOpPredicateMap[Rec];
891 if (!Entry) {
892 if (!Rec->isValueUnset("MCOperandPredicate")) {
893 MCOpPredicates.push_back(Rec);
894 Entry = MCOpPredicates.size();
895 MCOpPredicateMap[Rec] = Entry;
896 } else
897 break; // No conditions on this operand at all
898 }
899 Cond = Target.getName() + ClassName + "ValidateMCOperand(" +
Oliver Stannarda34e4702015-12-01 10:48:51 +0000900 Op + ", STI, " + llvm::utostr(Entry) + ")";
Artyom Skrobov6c8682e2014-06-10 13:11:35 +0000901 }
902 // for all subcases of ResultOperand::K_Record:
David Blaikie4ab57cd2015-08-06 19:23:33 +0000903 IAP.addCond(Cond);
Bill Wendling7e570b52011-03-21 08:59:17 +0000904 break;
905 }
Tim Northoverab7689e2013-01-09 13:32:04 +0000906 case CodeGenInstAlias::ResultOperand::K_Imm: {
Tim Northoverab7689e2013-01-09 13:32:04 +0000907 // Just because the alias has an immediate result, doesn't mean the
908 // MCInst will. An MCExpr could be present, for example.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000909 IAP.addCond(Op + ".isImm()");
Tim Northoverab7689e2013-01-09 13:32:04 +0000910
David Blaikie4ab57cd2015-08-06 19:23:33 +0000911 Cond = Op + ".getImm() == " +
912 llvm::utostr(CGA.ResultOperands[i].getImm());
913 IAP.addCond(Cond);
Bill Wendling7e570b52011-03-21 08:59:17 +0000914 break;
Tim Northoverab7689e2013-01-09 13:32:04 +0000915 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000916 case CodeGenInstAlias::ResultOperand::K_Reg:
Jim Grosbach29cdcda2011-11-15 01:46:57 +0000917 // If this is zero_reg, something's playing tricks we're not
918 // equipped to handle.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000919 if (!CGA.ResultOperands[i].getRegister()) {
Jim Grosbach29cdcda2011-11-15 01:46:57 +0000920 CantHandle = true;
921 break;
922 }
923
David Blaikie4ab57cd2015-08-06 19:23:33 +0000924 Cond = Op + ".getReg() == " + Target.getName() + "::" +
925 CGA.ResultOperands[i].getRegister()->getName();
926 IAP.addCond(Cond);
Bill Wendling7e570b52011-03-21 08:59:17 +0000927 break;
928 }
929
Tim Northover60091cf2014-05-15 13:36:01 +0000930 MIOpNum += RO.getMINumOperands();
Bill Wendling7e570b52011-03-21 08:59:17 +0000931 }
932
933 if (CantHandle) continue;
David Blaikie4ab57cd2015-08-06 19:23:33 +0000934 IAPrinterMap[Aliases.first].push_back(std::move(IAP));
Bill Wendling7e570b52011-03-21 08:59:17 +0000935 }
936 }
937
Tim Northoveree20caa2014-05-12 18:04:06 +0000938 //////////////////////////////
939 // Write out the printAliasInstr function
940 //////////////////////////////
941
Bill Wendlingf5199de2011-05-23 00:18:33 +0000942 std::string Header;
943 raw_string_ostream HeaderO(Header);
944
945 HeaderO << "bool " << Target.getName() << ClassName
Bill Wendlinge7124492011-06-14 03:17:20 +0000946 << "::printAliasInstr(const MCInst"
Akira Hatanakab46d0232015-03-27 20:36:02 +0000947 << " *MI, " << (PassSubtarget ? "const MCSubtargetInfo &STI, " : "")
948 << "raw_ostream &OS) {\n";
Bill Wendling7e570b52011-03-21 08:59:17 +0000949
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000950 std::string Cases;
951 raw_string_ostream CasesO(Cases);
952
David Blaikie4ab57cd2015-08-06 19:23:33 +0000953 for (auto &Entry : IAPrinterMap) {
954 std::vector<IAPrinter> &IAPs = Entry.second;
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000955 std::vector<IAPrinter*> UniqueIAPs;
956
David Blaikie4ab57cd2015-08-06 19:23:33 +0000957 for (auto &LHS : IAPs) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000958 bool IsDup = false;
David Blaikie4ab57cd2015-08-06 19:23:33 +0000959 for (const auto &RHS : IAPs) {
960 if (&LHS != &RHS && LHS == RHS) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000961 IsDup = true;
962 break;
963 }
964 }
965
David Blaikie4ab57cd2015-08-06 19:23:33 +0000966 if (!IsDup)
967 UniqueIAPs.push_back(&LHS);
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000968 }
969
970 if (UniqueIAPs.empty()) continue;
971
David Blaikie4ab57cd2015-08-06 19:23:33 +0000972 CasesO.indent(2) << "case " << Entry.first << ":\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000973
Craig Topper190ecd52016-01-08 07:06:32 +0000974 for (IAPrinter *IAP : UniqueIAPs) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000975 CasesO.indent(4);
Evan Cheng4d806e22011-07-06 02:02:33 +0000976 IAP->print(CasesO);
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000977 CasesO << '\n';
978 }
979
Eric Christopher2e3fbaa2011-04-18 21:28:11 +0000980 CasesO.indent(4) << "return false;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000981 }
982
Bill Wendlinge7124492011-06-14 03:17:20 +0000983 if (CasesO.str().empty()) {
Bill Wendlingf5199de2011-05-23 00:18:33 +0000984 O << HeaderO.str();
Eric Christopher2e3fbaa2011-04-18 21:28:11 +0000985 O << " return false;\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000986 O << "}\n\n";
987 O << "#endif // PRINT_ALIAS_INSTR\n";
988 return;
989 }
990
Alexander Kornienko8c0809c2015-01-15 11:41:30 +0000991 if (!MCOpPredicates.empty())
Artyom Skrobov6c8682e2014-06-10 13:11:35 +0000992 O << "static bool " << Target.getName() << ClassName
Oliver Stannarda34e4702015-12-01 10:48:51 +0000993 << "ValidateMCOperand(const MCOperand &MCOp,\n"
994 << " const MCSubtargetInfo &STI,\n"
995 << " unsigned PredicateIndex);\n";
Artyom Skrobov6c8682e2014-06-10 13:11:35 +0000996
Bill Wendlingf5199de2011-05-23 00:18:33 +0000997 O << HeaderO.str();
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000998 O.indent(2) << "const char *AsmString;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000999 O.indent(2) << "switch (MI->getOpcode()) {\n";
Eric Christopher2e3fbaa2011-04-18 21:28:11 +00001000 O.indent(2) << "default: return false;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001001 O << CasesO.str();
1002 O.indent(2) << "}\n\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001003
1004 // Code that prints the alias, replacing the operands with the ones from the
1005 // MCInst.
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001006 O << " unsigned I = 0;\n";
Tim Northoverd8d65a62014-05-15 11:16:32 +00001007 O << " while (AsmString[I] != ' ' && AsmString[I] != '\t' &&\n";
1008 O << " AsmString[I] != '\\0')\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001009 O << " ++I;\n";
1010 O << " OS << '\\t' << StringRef(AsmString, I);\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001011
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001012 O << " if (AsmString[I] != '\\0') {\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001013 O << " OS << '\\t';\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001014 O << " do {\n";
1015 O << " if (AsmString[I] == '$') {\n";
1016 O << " ++I;\n";
Tim Northoveree20caa2014-05-12 18:04:06 +00001017 O << " if (AsmString[I] == (char)0xff) {\n";
1018 O << " ++I;\n";
1019 O << " int OpIdx = AsmString[I++] - 1;\n";
1020 O << " int PrintMethodIdx = AsmString[I++] - 1;\n";
Akira Hatanakab46d0232015-03-27 20:36:02 +00001021 O << " printCustomAliasOperand(MI, OpIdx, PrintMethodIdx, ";
1022 O << (PassSubtarget ? "STI, " : "");
1023 O << "OS);\n";
Tim Northoveree20caa2014-05-12 18:04:06 +00001024 O << " } else\n";
Akira Hatanakab46d0232015-03-27 20:36:02 +00001025 O << " printOperand(MI, unsigned(AsmString[I++]) - 1, ";
1026 O << (PassSubtarget ? "STI, " : "");
1027 O << "OS);\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001028 O << " } else {\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001029 O << " OS << AsmString[I++];\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001030 O << " }\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001031 O << " } while (AsmString[I] != '\\0');\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001032 O << " }\n\n";
Jim Grosbachf4e67082012-04-18 18:56:33 +00001033
Eric Christopher2e3fbaa2011-04-18 21:28:11 +00001034 O << " return true;\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001035 O << "}\n\n";
1036
Tim Northoveree20caa2014-05-12 18:04:06 +00001037 //////////////////////////////
1038 // Write out the printCustomAliasOperand function
1039 //////////////////////////////
1040
1041 O << "void " << Target.getName() << ClassName << "::"
1042 << "printCustomAliasOperand(\n"
1043 << " const MCInst *MI, unsigned OpIdx,\n"
Akira Hatanakab46d0232015-03-27 20:36:02 +00001044 << " unsigned PrintMethodIdx,\n"
1045 << (PassSubtarget ? " const MCSubtargetInfo &STI,\n" : "")
1046 << " raw_ostream &OS) {\n";
Aaron Ballmane58a5702014-05-13 12:52:35 +00001047 if (PrintMethods.empty())
1048 O << " llvm_unreachable(\"Unknown PrintMethod kind\");\n";
1049 else {
1050 O << " switch (PrintMethodIdx) {\n"
1051 << " default:\n"
1052 << " llvm_unreachable(\"Unknown PrintMethod kind\");\n"
Tim Northoveree20caa2014-05-12 18:04:06 +00001053 << " break;\n";
Tim Northoveree20caa2014-05-12 18:04:06 +00001054
Aaron Ballmane58a5702014-05-13 12:52:35 +00001055 for (unsigned i = 0; i < PrintMethods.size(); ++i) {
1056 O << " case " << i << ":\n"
Akira Hatanakab46d0232015-03-27 20:36:02 +00001057 << " " << PrintMethods[i] << "(MI, OpIdx, "
1058 << (PassSubtarget ? "STI, " : "") << "OS);\n"
Aaron Ballmane58a5702014-05-13 12:52:35 +00001059 << " break;\n";
1060 }
1061 O << " }\n";
1062 }
1063 O << "}\n\n";
Tim Northoveree20caa2014-05-12 18:04:06 +00001064
Alexander Kornienko8c0809c2015-01-15 11:41:30 +00001065 if (!MCOpPredicates.empty()) {
Artyom Skrobov6c8682e2014-06-10 13:11:35 +00001066 O << "static bool " << Target.getName() << ClassName
Oliver Stannarda34e4702015-12-01 10:48:51 +00001067 << "ValidateMCOperand(const MCOperand &MCOp,\n"
1068 << " const MCSubtargetInfo &STI,\n"
1069 << " unsigned PredicateIndex) {\n"
Artyom Skrobov6c8682e2014-06-10 13:11:35 +00001070 << " switch (PredicateIndex) {\n"
1071 << " default:\n"
1072 << " llvm_unreachable(\"Unknown MCOperandPredicate kind\");\n"
1073 << " break;\n";
1074
1075 for (unsigned i = 0; i < MCOpPredicates.size(); ++i) {
1076 Init *MCOpPred = MCOpPredicates[i]->getValueInit("MCOperandPredicate");
1077 if (StringInit *SI = dyn_cast<StringInit>(MCOpPred)) {
1078 O << " case " << i + 1 << ": {\n"
1079 << SI->getValue() << "\n"
1080 << " }\n";
1081 } else
1082 llvm_unreachable("Unexpected MCOperandPredicate field!");
1083 }
1084 O << " }\n"
1085 << "}\n\n";
1086 }
1087
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001088 O << "#endif // PRINT_ALIAS_INSTR\n";
1089}
Chris Lattner06c5eed2009-09-13 20:08:00 +00001090
Ahmed Bougachabd214002013-10-28 18:07:17 +00001091AsmWriterEmitter::AsmWriterEmitter(RecordKeeper &R) : Records(R), Target(R) {
1092 Record *AsmWriter = Target.getAsmWriter();
Craig Topper0bd58742016-01-13 07:20:05 +00001093 unsigned Variant = AsmWriter->getValueAsInt("Variant");
1094 unsigned PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
Craig Topper03ec8012014-11-25 20:11:31 +00001095 for (const CodeGenInstruction *I : Target.instructions())
1096 if (!I->AsmString.empty() && I->TheDef->getName() != "PHI")
Craig Topper0bd58742016-01-13 07:20:05 +00001097 Instructions.emplace_back(*I, Variant, PassSubtarget);
Ahmed Bougachabd214002013-10-28 18:07:17 +00001098
1099 // Get the instruction numbering.
Craig Topper4c6129a2014-02-05 07:56:49 +00001100 NumberedInstructions = &Target.getInstructionsByEnumValue();
Ahmed Bougachabd214002013-10-28 18:07:17 +00001101
1102 // Compute the CodeGenInstruction -> AsmWriterInst mapping. Note that not
1103 // all machine instructions are necessarily being printed, so there may be
1104 // target instructions not in this map.
Craig Topper190ecd52016-01-08 07:06:32 +00001105 for (AsmWriterInst &AWI : Instructions)
1106 CGIAWIMap.insert(std::make_pair(AWI.CGI, &AWI));
Ahmed Bougachabd214002013-10-28 18:07:17 +00001107}
1108
Chris Lattner06c5eed2009-09-13 20:08:00 +00001109void AsmWriterEmitter::run(raw_ostream &O) {
Chris Lattner06c5eed2009-09-13 20:08:00 +00001110 EmitPrintInstruction(O);
1111 EmitGetRegisterName(O);
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001112 EmitPrintAliasInstruction(O);
Chris Lattner06c5eed2009-09-13 20:08:00 +00001113}
1114
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +00001115
1116namespace llvm {
1117
1118void EmitAsmWriter(RecordKeeper &RK, raw_ostream &OS) {
1119 emitSourceFileHeader("Assembly Writer Source Fragment", OS);
1120 AsmWriterEmitter(RK).run(OS);
1121}
1122
1123} // End llvm namespace