Run DCE after a LoopFlatten test to reduce spurious output [nfc]
[llvm-project.git] / llvm / utils / TableGen / AsmWriterEmitter.cpp
blob0220927295cf782a46d5876bd3de02252837617f
1 //===- AsmWriterEmitter.cpp - Generate an assembly writer -----------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This tablegen backend emits an assembly printer for the current target.
10 // Note that this is currently fairly skeletal, but will grow over time.
12 //===----------------------------------------------------------------------===//
14 #include "AsmWriterInst.h"
15 #include "CodeGenInstAlias.h"
16 #include "CodeGenInstruction.h"
17 #include "CodeGenRegisters.h"
18 #include "CodeGenTarget.h"
19 #include "SequenceToOffsetTable.h"
20 #include "Types.h"
21 #include "llvm/ADT/ArrayRef.h"
22 #include "llvm/ADT/DenseMap.h"
23 #include "llvm/ADT/STLExtras.h"
24 #include "llvm/ADT/SmallString.h"
25 #include "llvm/ADT/SmallVector.h"
26 #include "llvm/ADT/StringExtras.h"
27 #include "llvm/ADT/StringRef.h"
28 #include "llvm/ADT/Twine.h"
29 #include "llvm/Support/Casting.h"
30 #include "llvm/Support/Debug.h"
31 #include "llvm/Support/Format.h"
32 #include "llvm/Support/FormatVariadic.h"
33 #include "llvm/Support/MathExtras.h"
34 #include "llvm/Support/raw_ostream.h"
35 #include "llvm/TableGen/Error.h"
36 #include "llvm/TableGen/Record.h"
37 #include "llvm/TableGen/TableGenBackend.h"
38 #include <algorithm>
39 #include <cassert>
40 #include <cstddef>
41 #include <cstdint>
42 #include <deque>
43 #include <iterator>
44 #include <map>
45 #include <set>
46 #include <string>
47 #include <tuple>
48 #include <utility>
49 #include <vector>
51 using namespace llvm;
53 #define DEBUG_TYPE "asm-writer-emitter"
55 namespace {
57 class AsmWriterEmitter {
58 RecordKeeper &Records;
59 CodeGenTarget Target;
60 ArrayRef<const CodeGenInstruction *> NumberedInstructions;
61 std::vector<AsmWriterInst> Instructions;
63 public:
64 AsmWriterEmitter(RecordKeeper &R);
66 void run(raw_ostream &o);
67 private:
68 void EmitGetMnemonic(
69 raw_ostream &o,
70 std::vector<std::vector<std::string>> &TableDrivenOperandPrinters,
71 unsigned &BitsLeft, unsigned &AsmStrBits);
72 void EmitPrintInstruction(
73 raw_ostream &o,
74 std::vector<std::vector<std::string>> &TableDrivenOperandPrinters,
75 unsigned &BitsLeft, unsigned &AsmStrBits);
76 void EmitGetRegisterName(raw_ostream &o);
77 void EmitPrintAliasInstruction(raw_ostream &O);
79 void FindUniqueOperandCommands(std::vector<std::string> &UOC,
80 std::vector<std::vector<unsigned>> &InstIdxs,
81 std::vector<unsigned> &InstOpsUsed,
82 bool PassSubtarget) const;
85 } // end anonymous namespace
87 static void PrintCases(std::vector<std::pair<std::string,
88 AsmWriterOperand>> &OpsToPrint, raw_ostream &O,
89 bool PassSubtarget) {
90 O << " case " << OpsToPrint.back().first << ":";
91 AsmWriterOperand TheOp = OpsToPrint.back().second;
92 OpsToPrint.pop_back();
94 // Check to see if any other operands are identical in this list, and if so,
95 // emit a case label for them.
96 for (unsigned i = OpsToPrint.size(); i != 0; --i)
97 if (OpsToPrint[i-1].second == TheOp) {
98 O << "\n case " << OpsToPrint[i-1].first << ":";
99 OpsToPrint.erase(OpsToPrint.begin()+i-1);
102 // Finally, emit the code.
103 O << "\n " << TheOp.getCode(PassSubtarget);
104 O << "\n break;\n";
107 /// EmitInstructions - Emit the last instruction in the vector and any other
108 /// instructions that are suitably similar to it.
109 static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
110 raw_ostream &O, bool PassSubtarget) {
111 AsmWriterInst FirstInst = Insts.back();
112 Insts.pop_back();
114 std::vector<AsmWriterInst> SimilarInsts;
115 unsigned DifferingOperand = ~0;
116 for (unsigned i = Insts.size(); i != 0; --i) {
117 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
118 if (DiffOp != ~1U) {
119 if (DifferingOperand == ~0U) // First match!
120 DifferingOperand = DiffOp;
122 // If this differs in the same operand as the rest of the instructions in
123 // this class, move it to the SimilarInsts list.
124 if (DifferingOperand == DiffOp || DiffOp == ~0U) {
125 SimilarInsts.push_back(Insts[i-1]);
126 Insts.erase(Insts.begin()+i-1);
131 O << " case " << FirstInst.CGI->Namespace << "::"
132 << FirstInst.CGI->TheDef->getName() << ":\n";
133 for (const AsmWriterInst &AWI : SimilarInsts)
134 O << " case " << AWI.CGI->Namespace << "::"
135 << AWI.CGI->TheDef->getName() << ":\n";
136 for (unsigned i = 0, e = FirstInst.Operands.size(); i != e; ++i) {
137 if (i != DifferingOperand) {
138 // If the operand is the same for all instructions, just print it.
139 O << " " << FirstInst.Operands[i].getCode(PassSubtarget);
140 } else {
141 // If this is the operand that varies between all of the instructions,
142 // emit a switch for just this operand now.
143 O << " switch (MI->getOpcode()) {\n";
144 O << " default: llvm_unreachable(\"Unexpected opcode.\");\n";
145 std::vector<std::pair<std::string, AsmWriterOperand>> OpsToPrint;
146 OpsToPrint.push_back(std::make_pair(FirstInst.CGI->Namespace.str() + "::" +
147 FirstInst.CGI->TheDef->getName().str(),
148 FirstInst.Operands[i]));
150 for (const AsmWriterInst &AWI : SimilarInsts) {
151 OpsToPrint.push_back(std::make_pair(AWI.CGI->Namespace.str()+"::" +
152 AWI.CGI->TheDef->getName().str(),
153 AWI.Operands[i]));
155 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
156 while (!OpsToPrint.empty())
157 PrintCases(OpsToPrint, O, PassSubtarget);
158 O << " }";
160 O << "\n";
162 O << " break;\n";
165 void AsmWriterEmitter::
166 FindUniqueOperandCommands(std::vector<std::string> &UniqueOperandCommands,
167 std::vector<std::vector<unsigned>> &InstIdxs,
168 std::vector<unsigned> &InstOpsUsed,
169 bool PassSubtarget) const {
170 // This vector parallels UniqueOperandCommands, keeping track of which
171 // instructions each case are used for. It is a comma separated string of
172 // enums.
173 std::vector<std::string> InstrsForCase;
174 InstrsForCase.resize(UniqueOperandCommands.size());
175 InstOpsUsed.assign(UniqueOperandCommands.size(), 0);
177 for (size_t i = 0, e = Instructions.size(); i != e; ++i) {
178 const AsmWriterInst &Inst = Instructions[i];
179 if (Inst.Operands.empty())
180 continue; // Instruction already done.
182 std::string Command = " "+Inst.Operands[0].getCode(PassSubtarget)+"\n";
184 // Check to see if we already have 'Command' in UniqueOperandCommands.
185 // If not, add it.
186 auto I = llvm::find(UniqueOperandCommands, Command);
187 if (I != UniqueOperandCommands.end()) {
188 size_t idx = I - UniqueOperandCommands.begin();
189 InstrsForCase[idx] += ", ";
190 InstrsForCase[idx] += Inst.CGI->TheDef->getName();
191 InstIdxs[idx].push_back(i);
192 } else {
193 UniqueOperandCommands.push_back(std::move(Command));
194 InstrsForCase.push_back(std::string(Inst.CGI->TheDef->getName()));
195 InstIdxs.emplace_back();
196 InstIdxs.back().push_back(i);
198 // This command matches one operand so far.
199 InstOpsUsed.push_back(1);
203 // For each entry of UniqueOperandCommands, there is a set of instructions
204 // that uses it. If the next command of all instructions in the set are
205 // identical, fold it into the command.
206 for (size_t CommandIdx = 0, e = UniqueOperandCommands.size();
207 CommandIdx != e; ++CommandIdx) {
209 const auto &Idxs = InstIdxs[CommandIdx];
211 for (unsigned Op = 1; ; ++Op) {
212 // Find the first instruction in the set.
213 const AsmWriterInst &FirstInst = Instructions[Idxs.front()];
214 // If this instruction has no more operands, we isn't anything to merge
215 // into this command.
216 if (FirstInst.Operands.size() == Op)
217 break;
219 // Otherwise, scan to see if all of the other instructions in this command
220 // set share the operand.
221 if (any_of(drop_begin(Idxs), [&](unsigned Idx) {
222 const AsmWriterInst &OtherInst = Instructions[Idx];
223 return OtherInst.Operands.size() == Op ||
224 OtherInst.Operands[Op] != FirstInst.Operands[Op];
226 break;
228 // Okay, everything in this command set has the same next operand. Add it
229 // to UniqueOperandCommands and remember that it was consumed.
230 std::string Command = " " +
231 FirstInst.Operands[Op].getCode(PassSubtarget) + "\n";
233 UniqueOperandCommands[CommandIdx] += Command;
234 InstOpsUsed[CommandIdx]++;
238 // Prepend some of the instructions each case is used for onto the case val.
239 for (unsigned i = 0, e = InstrsForCase.size(); i != e; ++i) {
240 std::string Instrs = InstrsForCase[i];
241 if (Instrs.size() > 70) {
242 Instrs.erase(Instrs.begin()+70, Instrs.end());
243 Instrs += "...";
246 if (!Instrs.empty())
247 UniqueOperandCommands[i] = " // " + Instrs + "\n" +
248 UniqueOperandCommands[i];
252 static void UnescapeString(std::string &Str) {
253 for (unsigned i = 0; i != Str.size(); ++i) {
254 if (Str[i] == '\\' && i != Str.size()-1) {
255 switch (Str[i+1]) {
256 default: continue; // Don't execute the code after the switch.
257 case 'a': Str[i] = '\a'; break;
258 case 'b': Str[i] = '\b'; break;
259 case 'e': Str[i] = 27; break;
260 case 'f': Str[i] = '\f'; break;
261 case 'n': Str[i] = '\n'; break;
262 case 'r': Str[i] = '\r'; break;
263 case 't': Str[i] = '\t'; break;
264 case 'v': Str[i] = '\v'; break;
265 case '"': Str[i] = '\"'; break;
266 case '\'': Str[i] = '\''; break;
267 case '\\': Str[i] = '\\'; break;
269 // Nuke the second character.
270 Str.erase(Str.begin()+i+1);
275 /// UnescapeAliasString - Supports literal braces in InstAlias asm string which
276 /// are escaped with '\\' to avoid being interpreted as variants. Braces must
277 /// be unescaped before c++ code is generated as (e.g.):
279 /// AsmString = "foo \{$\x01\}";
281 /// causes non-standard escape character warnings.
282 static void UnescapeAliasString(std::string &Str) {
283 for (unsigned i = 0; i != Str.size(); ++i) {
284 if (Str[i] == '\\' && i != Str.size()-1) {
285 switch (Str[i+1]) {
286 default: continue; // Don't execute the code after the switch.
287 case '{': Str[i] = '{'; break;
288 case '}': Str[i] = '}'; break;
290 // Nuke the second character.
291 Str.erase(Str.begin()+i+1);
296 void AsmWriterEmitter::EmitGetMnemonic(
297 raw_ostream &O,
298 std::vector<std::vector<std::string>> &TableDrivenOperandPrinters,
299 unsigned &BitsLeft, unsigned &AsmStrBits) {
300 Record *AsmWriter = Target.getAsmWriter();
301 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
302 bool PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
304 O << "/// getMnemonic - This method is automatically generated by "
305 "tablegen\n"
306 "/// from the instruction set description.\n"
307 "std::pair<const char *, uint64_t> "
308 << Target.getName() << ClassName << "::getMnemonic(const MCInst *MI) {\n";
310 // Build an aggregate string, and build a table of offsets into it.
311 SequenceToOffsetTable<std::string> StringTable;
313 /// OpcodeInfo - This encodes the index of the string to use for the first
314 /// chunk of the output as well as indices used for operand printing.
315 std::vector<uint64_t> OpcodeInfo(NumberedInstructions.size());
316 const unsigned OpcodeInfoBits = 64;
318 // Add all strings to the string table upfront so it can generate an optimized
319 // representation.
320 for (AsmWriterInst &AWI : Instructions) {
321 if (AWI.Operands[0].OperandType ==
322 AsmWriterOperand::isLiteralTextOperand &&
323 !AWI.Operands[0].Str.empty()) {
324 std::string Str = AWI.Operands[0].Str;
325 UnescapeString(Str);
326 StringTable.add(Str);
330 StringTable.layout();
332 unsigned MaxStringIdx = 0;
333 for (AsmWriterInst &AWI : Instructions) {
334 unsigned Idx;
335 if (AWI.Operands[0].OperandType != AsmWriterOperand::isLiteralTextOperand ||
336 AWI.Operands[0].Str.empty()) {
337 // Something handled by the asmwriter printer, but with no leading string.
338 Idx = StringTable.get("");
339 } else {
340 std::string Str = AWI.Operands[0].Str;
341 UnescapeString(Str);
342 Idx = StringTable.get(Str);
343 MaxStringIdx = std::max(MaxStringIdx, Idx);
345 // Nuke the string from the operand list. It is now handled!
346 AWI.Operands.erase(AWI.Operands.begin());
349 // Bias offset by one since we want 0 as a sentinel.
350 OpcodeInfo[AWI.CGIIndex] = Idx+1;
353 // Figure out how many bits we used for the string index.
354 AsmStrBits = Log2_32_Ceil(MaxStringIdx + 2);
356 // To reduce code size, we compactify common instructions into a few bits
357 // in the opcode-indexed table.
358 BitsLeft = OpcodeInfoBits - AsmStrBits;
360 while (true) {
361 std::vector<std::string> UniqueOperandCommands;
362 std::vector<std::vector<unsigned>> InstIdxs;
363 std::vector<unsigned> NumInstOpsHandled;
364 FindUniqueOperandCommands(UniqueOperandCommands, InstIdxs,
365 NumInstOpsHandled, PassSubtarget);
367 // If we ran out of operands to print, we're done.
368 if (UniqueOperandCommands.empty()) break;
370 // Compute the number of bits we need to represent these cases, this is
371 // ceil(log2(numentries)).
372 unsigned NumBits = Log2_32_Ceil(UniqueOperandCommands.size());
374 // If we don't have enough bits for this operand, don't include it.
375 if (NumBits > BitsLeft) {
376 LLVM_DEBUG(errs() << "Not enough bits to densely encode " << NumBits
377 << " more bits\n");
378 break;
381 // Otherwise, we can include this in the initial lookup table. Add it in.
382 for (size_t i = 0, e = InstIdxs.size(); i != e; ++i) {
383 unsigned NumOps = NumInstOpsHandled[i];
384 for (unsigned Idx : InstIdxs[i]) {
385 OpcodeInfo[Instructions[Idx].CGIIndex] |=
386 (uint64_t)i << (OpcodeInfoBits-BitsLeft);
387 // Remove the info about this operand from the instruction.
388 AsmWriterInst &Inst = Instructions[Idx];
389 if (!Inst.Operands.empty()) {
390 assert(NumOps <= Inst.Operands.size() &&
391 "Can't remove this many ops!");
392 Inst.Operands.erase(Inst.Operands.begin(),
393 Inst.Operands.begin()+NumOps);
397 BitsLeft -= NumBits;
399 // Remember the handlers for this set of operands.
400 TableDrivenOperandPrinters.push_back(std::move(UniqueOperandCommands));
403 // Emit the string table itself.
404 StringTable.emitStringLiteralDef(O, " static const char AsmStrs[]");
406 // Emit the lookup tables in pieces to minimize wasted bytes.
407 unsigned BytesNeeded = ((OpcodeInfoBits - BitsLeft) + 7) / 8;
408 unsigned Table = 0, Shift = 0;
409 SmallString<128> BitsString;
410 raw_svector_ostream BitsOS(BitsString);
411 // If the total bits is more than 32-bits we need to use a 64-bit type.
412 BitsOS << " uint" << ((BitsLeft < (OpcodeInfoBits - 32)) ? 64 : 32)
413 << "_t Bits = 0;\n";
414 while (BytesNeeded != 0) {
415 // Figure out how big this table section needs to be, but no bigger than 4.
416 unsigned TableSize = std::min(llvm::bit_floor(BytesNeeded), 4u);
417 BytesNeeded -= TableSize;
418 TableSize *= 8; // Convert to bits;
419 uint64_t Mask = (1ULL << TableSize) - 1;
420 O << " static const uint" << TableSize << "_t OpInfo" << Table
421 << "[] = {\n";
422 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
423 O << " " << ((OpcodeInfo[i] >> Shift) & Mask) << "U,\t// "
424 << NumberedInstructions[i]->TheDef->getName() << "\n";
426 O << " };\n\n";
427 // Emit string to combine the individual table lookups.
428 BitsOS << " Bits |= ";
429 // If the total bits is more than 32-bits we need to use a 64-bit type.
430 if (BitsLeft < (OpcodeInfoBits - 32))
431 BitsOS << "(uint64_t)";
432 BitsOS << "OpInfo" << Table << "[MI->getOpcode()] << " << Shift << ";\n";
433 // Prepare the shift for the next iteration and increment the table count.
434 Shift += TableSize;
435 ++Table;
438 O << " // Emit the opcode for the instruction.\n";
439 O << BitsString;
441 // Return mnemonic string and bits.
442 O << " return {AsmStrs+(Bits & " << (1 << AsmStrBits) - 1
443 << ")-1, Bits};\n\n";
445 O << "}\n";
448 /// EmitPrintInstruction - Generate the code for the "printInstruction" method
449 /// implementation. Destroys all instances of AsmWriterInst information, by
450 /// clearing the Instructions vector.
451 void AsmWriterEmitter::EmitPrintInstruction(
452 raw_ostream &O,
453 std::vector<std::vector<std::string>> &TableDrivenOperandPrinters,
454 unsigned &BitsLeft, unsigned &AsmStrBits) {
455 const unsigned OpcodeInfoBits = 64;
456 Record *AsmWriter = Target.getAsmWriter();
457 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
458 bool PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
460 // This function has some huge switch statements that causing excessive
461 // compile time in LLVM profile instrumenation build. This print function
462 // usually is not frequently called in compilation. Here we disable the
463 // profile instrumenation for this function.
464 O << "/// printInstruction - This method is automatically generated by "
465 "tablegen\n"
466 "/// from the instruction set description.\n"
467 "LLVM_NO_PROFILE_INSTRUMENT_FUNCTION\n"
468 "void "
469 << Target.getName() << ClassName
470 << "::printInstruction(const MCInst *MI, uint64_t Address, "
471 << (PassSubtarget ? "const MCSubtargetInfo &STI, " : "")
472 << "raw_ostream &O) {\n";
474 // Emit the initial tab character.
475 O << " O << \"\\t\";\n\n";
477 // Emit the starting string.
478 O << " auto MnemonicInfo = getMnemonic(MI);\n\n";
479 O << " O << MnemonicInfo.first;\n\n";
481 O << " uint" << ((BitsLeft < (OpcodeInfoBits - 32)) ? 64 : 32)
482 << "_t Bits = MnemonicInfo.second;\n"
483 << " assert(Bits != 0 && \"Cannot print this instruction.\");\n";
485 // Output the table driven operand information.
486 BitsLeft = OpcodeInfoBits-AsmStrBits;
487 for (unsigned i = 0, e = TableDrivenOperandPrinters.size(); i != e; ++i) {
488 std::vector<std::string> &Commands = TableDrivenOperandPrinters[i];
490 // Compute the number of bits we need to represent these cases, this is
491 // ceil(log2(numentries)).
492 unsigned NumBits = Log2_32_Ceil(Commands.size());
493 assert(NumBits <= BitsLeft && "consistency error");
495 // Emit code to extract this field from Bits.
496 O << "\n // Fragment " << i << " encoded into " << NumBits
497 << " bits for " << Commands.size() << " unique commands.\n";
499 if (Commands.size() == 2) {
500 // Emit two possibilitys with if/else.
501 O << " if ((Bits >> "
502 << (OpcodeInfoBits-BitsLeft) << ") & "
503 << ((1 << NumBits)-1) << ") {\n"
504 << Commands[1]
505 << " } else {\n"
506 << Commands[0]
507 << " }\n\n";
508 } else if (Commands.size() == 1) {
509 // Emit a single possibility.
510 O << Commands[0] << "\n\n";
511 } else {
512 O << " switch ((Bits >> "
513 << (OpcodeInfoBits-BitsLeft) << ") & "
514 << ((1 << NumBits)-1) << ") {\n"
515 << " default: llvm_unreachable(\"Invalid command number.\");\n";
517 // Print out all the cases.
518 for (unsigned j = 0, e = Commands.size(); j != e; ++j) {
519 O << " case " << j << ":\n";
520 O << Commands[j];
521 O << " break;\n";
523 O << " }\n\n";
525 BitsLeft -= NumBits;
528 // Okay, delete instructions with no operand info left.
529 llvm::erase_if(Instructions,
530 [](AsmWriterInst &Inst) { return Inst.Operands.empty(); });
532 // Because this is a vector, we want to emit from the end. Reverse all of the
533 // elements in the vector.
534 std::reverse(Instructions.begin(), Instructions.end());
537 // Now that we've emitted all of the operand info that fit into 64 bits, emit
538 // information for those instructions that are left. This is a less dense
539 // encoding, but we expect the main 64-bit table to handle the majority of
540 // instructions.
541 if (!Instructions.empty()) {
542 // Find the opcode # of inline asm.
543 O << " switch (MI->getOpcode()) {\n";
544 O << " default: llvm_unreachable(\"Unexpected opcode.\");\n";
545 while (!Instructions.empty())
546 EmitInstructions(Instructions, O, PassSubtarget);
548 O << " }\n";
551 O << "}\n";
554 static void
555 emitRegisterNameString(raw_ostream &O, StringRef AltName,
556 const std::deque<CodeGenRegister> &Registers) {
557 SequenceToOffsetTable<std::string> StringTable;
558 SmallVector<std::string, 4> AsmNames(Registers.size());
559 unsigned i = 0;
560 for (const auto &Reg : Registers) {
561 std::string &AsmName = AsmNames[i++];
563 // "NoRegAltName" is special. We don't need to do a lookup for that,
564 // as it's just a reference to the default register name.
565 if (AltName == "" || AltName == "NoRegAltName") {
566 AsmName = std::string(Reg.TheDef->getValueAsString("AsmName"));
567 if (AsmName.empty())
568 AsmName = std::string(Reg.getName());
569 } else {
570 // Make sure the register has an alternate name for this index.
571 std::vector<Record*> AltNameList =
572 Reg.TheDef->getValueAsListOfDefs("RegAltNameIndices");
573 unsigned Idx = 0, e;
574 for (e = AltNameList.size();
575 Idx < e && (AltNameList[Idx]->getName() != AltName);
576 ++Idx)
578 // If the register has an alternate name for this index, use it.
579 // Otherwise, leave it empty as an error flag.
580 if (Idx < e) {
581 std::vector<StringRef> AltNames =
582 Reg.TheDef->getValueAsListOfStrings("AltNames");
583 if (AltNames.size() <= Idx)
584 PrintFatalError(Reg.TheDef->getLoc(),
585 "Register definition missing alt name for '" +
586 AltName + "'.");
587 AsmName = std::string(AltNames[Idx]);
590 StringTable.add(AsmName);
593 StringTable.layout();
594 StringTable.emitStringLiteralDef(O, Twine(" static const char AsmStrs") +
595 AltName + "[]");
597 O << " static const " << getMinimalTypeForRange(StringTable.size() - 1, 32)
598 << " RegAsmOffset" << AltName << "[] = {";
599 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
600 if ((i % 14) == 0)
601 O << "\n ";
602 O << StringTable.get(AsmNames[i]) << ", ";
604 O << "\n };\n"
605 << "\n";
608 void AsmWriterEmitter::EmitGetRegisterName(raw_ostream &O) {
609 Record *AsmWriter = Target.getAsmWriter();
610 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
611 const auto &Registers = Target.getRegBank().getRegisters();
612 const std::vector<Record*> &AltNameIndices = Target.getRegAltNameIndices();
613 bool hasAltNames = AltNameIndices.size() > 1;
614 StringRef Namespace = Registers.front().TheDef->getValueAsString("Namespace");
616 O <<
617 "\n\n/// getRegisterName - This method is automatically generated by tblgen\n"
618 "/// from the register set description. This returns the assembler name\n"
619 "/// for the specified register.\n"
620 "const char *" << Target.getName() << ClassName << "::";
621 if (hasAltNames)
622 O << "\ngetRegisterName(MCRegister Reg, unsigned AltIdx) {\n";
623 else
624 O << "getRegisterName(MCRegister Reg) {\n";
625 O << " unsigned RegNo = Reg.id();\n"
626 << " assert(RegNo && RegNo < " << (Registers.size() + 1)
627 << " && \"Invalid register number!\");\n"
628 << "\n";
630 if (hasAltNames) {
631 for (const Record *R : AltNameIndices)
632 emitRegisterNameString(O, R->getName(), Registers);
633 } else
634 emitRegisterNameString(O, "", Registers);
636 if (hasAltNames) {
637 O << " switch(AltIdx) {\n"
638 << " default: llvm_unreachable(\"Invalid register alt name index!\");\n";
639 for (const Record *R : AltNameIndices) {
640 StringRef AltName = R->getName();
641 O << " case ";
642 if (!Namespace.empty())
643 O << Namespace << "::";
644 O << AltName << ":\n";
645 if (R->isValueUnset("FallbackRegAltNameIndex"))
646 O << " assert(*(AsmStrs" << AltName << "+RegAsmOffset" << AltName
647 << "[RegNo-1]) &&\n"
648 << " \"Invalid alt name index for register!\");\n";
649 else {
650 O << " if (!*(AsmStrs" << AltName << "+RegAsmOffset" << AltName
651 << "[RegNo-1]))\n"
652 << " return getRegisterName(RegNo, ";
653 if (!Namespace.empty())
654 O << Namespace << "::";
655 O << R->getValueAsDef("FallbackRegAltNameIndex")->getName() << ");\n";
657 O << " return AsmStrs" << AltName << "+RegAsmOffset" << AltName
658 << "[RegNo-1];\n";
660 O << " }\n";
661 } else {
662 O << " assert (*(AsmStrs+RegAsmOffset[RegNo-1]) &&\n"
663 << " \"Invalid alt name index for register!\");\n"
664 << " return AsmStrs+RegAsmOffset[RegNo-1];\n";
666 O << "}\n";
669 namespace {
671 // IAPrinter - Holds information about an InstAlias. Two InstAliases match if
672 // they both have the same conditionals. In which case, we cannot print out the
673 // alias for that pattern.
674 class IAPrinter {
675 std::map<StringRef, std::pair<int, int>> OpMap;
677 std::vector<std::string> Conds;
679 std::string Result;
680 std::string AsmString;
682 unsigned NumMIOps;
684 public:
685 IAPrinter(std::string R, std::string AS, unsigned NumMIOps)
686 : Result(std::move(R)), AsmString(std::move(AS)), NumMIOps(NumMIOps) {}
688 void addCond(std::string C) { Conds.push_back(std::move(C)); }
689 ArrayRef<std::string> getConds() const { return Conds; }
690 size_t getCondCount() const { return Conds.size(); }
692 void addOperand(StringRef Op, int OpIdx, int PrintMethodIdx = -1) {
693 assert(OpIdx >= 0 && OpIdx < 0xFE && "Idx out of range");
694 assert(PrintMethodIdx >= -1 && PrintMethodIdx < 0xFF &&
695 "Idx out of range");
696 OpMap[Op] = std::make_pair(OpIdx, PrintMethodIdx);
699 unsigned getNumMIOps() { return NumMIOps; }
701 StringRef getResult() { return Result; }
703 bool isOpMapped(StringRef Op) { return OpMap.find(Op) != OpMap.end(); }
704 int getOpIndex(StringRef Op) { return OpMap[Op].first; }
705 std::pair<int, int> &getOpData(StringRef Op) { return OpMap[Op]; }
707 std::pair<StringRef, StringRef::iterator> parseName(StringRef::iterator Start,
708 StringRef::iterator End) {
709 StringRef::iterator I = Start;
710 StringRef::iterator Next;
711 if (*I == '{') {
712 // ${some_name}
713 Start = ++I;
714 while (I != End && *I != '}')
715 ++I;
716 Next = I;
717 // eat the final '}'
718 if (Next != End)
719 ++Next;
720 } else {
721 // $name, just eat the usual suspects.
722 while (I != End && (isAlnum(*I) || *I == '_'))
723 ++I;
724 Next = I;
727 return std::make_pair(StringRef(Start, I - Start), Next);
730 std::string formatAliasString(uint32_t &UnescapedSize) {
731 // Directly mangle mapped operands into the string. Each operand is
732 // identified by a '$' sign followed by a byte identifying the number of the
733 // operand. We add one to the index to avoid zero bytes.
734 StringRef ASM(AsmString);
735 std::string OutString;
736 raw_string_ostream OS(OutString);
737 for (StringRef::iterator I = ASM.begin(), E = ASM.end(); I != E;) {
738 OS << *I;
739 ++UnescapedSize;
740 if (*I == '$') {
741 StringRef Name;
742 std::tie(Name, I) = parseName(++I, E);
743 assert(isOpMapped(Name) && "Unmapped operand!");
745 int OpIndex, PrintIndex;
746 std::tie(OpIndex, PrintIndex) = getOpData(Name);
747 if (PrintIndex == -1) {
748 // Can use the default printOperand route.
749 OS << format("\\x%02X", (unsigned char)OpIndex + 1);
750 ++UnescapedSize;
751 } else {
752 // 3 bytes if a PrintMethod is needed: 0xFF, the MCInst operand
753 // number, and which of our pre-detected Methods to call.
754 OS << format("\\xFF\\x%02X\\x%02X", OpIndex + 1, PrintIndex + 1);
755 UnescapedSize += 3;
757 } else {
758 ++I;
761 return OutString;
764 bool operator==(const IAPrinter &RHS) const {
765 if (NumMIOps != RHS.NumMIOps)
766 return false;
767 if (Conds.size() != RHS.Conds.size())
768 return false;
770 unsigned Idx = 0;
771 for (const auto &str : Conds)
772 if (str != RHS.Conds[Idx++])
773 return false;
775 return true;
779 } // end anonymous namespace
781 static unsigned CountNumOperands(StringRef AsmString, unsigned Variant) {
782 return AsmString.count(' ') + AsmString.count('\t');
785 namespace {
787 struct AliasPriorityComparator {
788 typedef std::pair<CodeGenInstAlias, int> ValueType;
789 bool operator()(const ValueType &LHS, const ValueType &RHS) const {
790 if (LHS.second == RHS.second) {
791 // We don't actually care about the order, but for consistency it
792 // shouldn't depend on pointer comparisons.
793 return LessRecordByID()(LHS.first.TheDef, RHS.first.TheDef);
796 // Aliases with larger priorities should be considered first.
797 return LHS.second > RHS.second;
801 } // end anonymous namespace
803 void AsmWriterEmitter::EmitPrintAliasInstruction(raw_ostream &O) {
804 Record *AsmWriter = Target.getAsmWriter();
806 O << "\n#ifdef PRINT_ALIAS_INSTR\n";
807 O << "#undef PRINT_ALIAS_INSTR\n\n";
809 //////////////////////////////
810 // Gather information about aliases we need to print
811 //////////////////////////////
813 // Emit the method that prints the alias instruction.
814 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
815 unsigned Variant = AsmWriter->getValueAsInt("Variant");
816 bool PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
818 std::vector<Record*> AllInstAliases =
819 Records.getAllDerivedDefinitions("InstAlias");
821 // Create a map from the qualified name to a list of potential matches.
822 typedef std::set<std::pair<CodeGenInstAlias, int>, AliasPriorityComparator>
823 AliasWithPriority;
824 std::map<std::string, AliasWithPriority> AliasMap;
825 for (Record *R : AllInstAliases) {
826 int Priority = R->getValueAsInt("EmitPriority");
827 if (Priority < 1)
828 continue; // Aliases with priority 0 are never emitted.
830 const DagInit *DI = R->getValueAsDag("ResultInst");
831 AliasMap[getQualifiedName(DI->getOperatorAsDef(R->getLoc()))].insert(
832 std::make_pair(CodeGenInstAlias(R, Target), Priority));
835 // A map of which conditions need to be met for each instruction operand
836 // before it can be matched to the mnemonic.
837 std::map<std::string, std::vector<IAPrinter>> IAPrinterMap;
839 std::vector<std::pair<std::string, bool>> PrintMethods;
841 // A list of MCOperandPredicates for all operands in use, and the reverse map
842 std::vector<const Record*> MCOpPredicates;
843 DenseMap<const Record*, unsigned> MCOpPredicateMap;
845 for (auto &Aliases : AliasMap) {
846 // Collection of instruction alias rules. May contain ambiguous rules.
847 std::vector<IAPrinter> IAPs;
849 for (auto &Alias : Aliases.second) {
850 const CodeGenInstAlias &CGA = Alias.first;
851 unsigned LastOpNo = CGA.ResultInstOperandIndex.size();
852 std::string FlatInstAsmString =
853 CodeGenInstruction::FlattenAsmStringVariants(CGA.ResultInst->AsmString,
854 Variant);
855 unsigned NumResultOps = CountNumOperands(FlatInstAsmString, Variant);
857 std::string FlatAliasAsmString =
858 CodeGenInstruction::FlattenAsmStringVariants(CGA.AsmString, Variant);
859 UnescapeAliasString(FlatAliasAsmString);
861 // Don't emit the alias if it has more operands than what it's aliasing.
862 if (NumResultOps < CountNumOperands(FlatAliasAsmString, Variant))
863 continue;
865 StringRef Namespace = Target.getName();
866 unsigned NumMIOps = 0;
867 for (auto &ResultInstOpnd : CGA.ResultInst->Operands)
868 NumMIOps += ResultInstOpnd.MINumOperands;
870 IAPrinter IAP(CGA.Result->getAsString(), FlatAliasAsmString, NumMIOps);
872 unsigned MIOpNum = 0;
873 for (unsigned i = 0, e = LastOpNo; i != e; ++i) {
874 // Skip over tied operands as they're not part of an alias declaration.
875 auto &Operands = CGA.ResultInst->Operands;
876 while (true) {
877 unsigned OpNum = Operands.getSubOperandNumber(MIOpNum).first;
878 if (Operands[OpNum].MINumOperands == 1 &&
879 Operands[OpNum].getTiedRegister() != -1) {
880 // Tied operands of different RegisterClass should be explicit within
881 // an instruction's syntax and so cannot be skipped.
882 int TiedOpNum = Operands[OpNum].getTiedRegister();
883 if (Operands[OpNum].Rec->getName() ==
884 Operands[TiedOpNum].Rec->getName()) {
885 ++MIOpNum;
886 continue;
889 break;
892 // Ignore unchecked result operands.
893 while (IAP.getCondCount() < MIOpNum)
894 IAP.addCond("AliasPatternCond::K_Ignore, 0");
896 const CodeGenInstAlias::ResultOperand &RO = CGA.ResultOperands[i];
898 switch (RO.Kind) {
899 case CodeGenInstAlias::ResultOperand::K_Record: {
900 const Record *Rec = RO.getRecord();
901 StringRef ROName = RO.getName();
902 int PrintMethodIdx = -1;
904 // These two may have a PrintMethod, which we want to record (if it's
905 // the first time we've seen it) and provide an index for the aliasing
906 // code to use.
907 if (Rec->isSubClassOf("RegisterOperand") ||
908 Rec->isSubClassOf("Operand")) {
909 StringRef PrintMethod = Rec->getValueAsString("PrintMethod");
910 bool IsPCRel =
911 Rec->getValueAsString("OperandType") == "OPERAND_PCREL";
912 if (PrintMethod != "" && PrintMethod != "printOperand") {
913 PrintMethodIdx = llvm::find_if(PrintMethods,
914 [&](auto &X) {
915 return X.first == PrintMethod;
916 }) -
917 PrintMethods.begin();
918 if (static_cast<unsigned>(PrintMethodIdx) == PrintMethods.size())
919 PrintMethods.emplace_back(std::string(PrintMethod), IsPCRel);
923 if (Rec->isSubClassOf("RegisterOperand"))
924 Rec = Rec->getValueAsDef("RegClass");
925 if (Rec->isSubClassOf("RegisterClass")) {
926 if (!IAP.isOpMapped(ROName)) {
927 IAP.addOperand(ROName, MIOpNum, PrintMethodIdx);
928 Record *R = CGA.ResultOperands[i].getRecord();
929 if (R->isSubClassOf("RegisterOperand"))
930 R = R->getValueAsDef("RegClass");
931 IAP.addCond(std::string(
932 formatv("AliasPatternCond::K_RegClass, {0}::{1}RegClassID",
933 Namespace, R->getName())));
934 } else {
935 IAP.addCond(std::string(formatv(
936 "AliasPatternCond::K_TiedReg, {0}", IAP.getOpIndex(ROName))));
938 } else {
939 // Assume all printable operands are desired for now. This can be
940 // overridden in the InstAlias instantiation if necessary.
941 IAP.addOperand(ROName, MIOpNum, PrintMethodIdx);
943 // There might be an additional predicate on the MCOperand
944 unsigned Entry = MCOpPredicateMap[Rec];
945 if (!Entry) {
946 if (!Rec->isValueUnset("MCOperandPredicate")) {
947 MCOpPredicates.push_back(Rec);
948 Entry = MCOpPredicates.size();
949 MCOpPredicateMap[Rec] = Entry;
950 } else
951 break; // No conditions on this operand at all
953 IAP.addCond(
954 std::string(formatv("AliasPatternCond::K_Custom, {0}", Entry)));
956 break;
958 case CodeGenInstAlias::ResultOperand::K_Imm: {
959 // Just because the alias has an immediate result, doesn't mean the
960 // MCInst will. An MCExpr could be present, for example.
961 auto Imm = CGA.ResultOperands[i].getImm();
962 int32_t Imm32 = int32_t(Imm);
963 if (Imm != Imm32)
964 PrintFatalError("Matching an alias with an immediate out of the "
965 "range of int32_t is not supported");
966 IAP.addCond(std::string(
967 formatv("AliasPatternCond::K_Imm, uint32_t({0})", Imm32)));
968 break;
970 case CodeGenInstAlias::ResultOperand::K_Reg:
971 if (!CGA.ResultOperands[i].getRegister()) {
972 IAP.addCond(std::string(formatv(
973 "AliasPatternCond::K_Reg, {0}::NoRegister", Namespace)));
974 break;
977 StringRef Reg = CGA.ResultOperands[i].getRegister()->getName();
978 IAP.addCond(std::string(
979 formatv("AliasPatternCond::K_Reg, {0}::{1}", Namespace, Reg)));
980 break;
983 MIOpNum += RO.getMINumOperands();
986 std::vector<Record *> ReqFeatures;
987 if (PassSubtarget) {
988 // We only consider ReqFeatures predicates if PassSubtarget
989 std::vector<Record *> RF =
990 CGA.TheDef->getValueAsListOfDefs("Predicates");
991 copy_if(RF, std::back_inserter(ReqFeatures), [](Record *R) {
992 return R->getValueAsBit("AssemblerMatcherPredicate");
996 for (Record *const R : ReqFeatures) {
997 const DagInit *D = R->getValueAsDag("AssemblerCondDag");
998 auto *Op = dyn_cast<DefInit>(D->getOperator());
999 if (!Op)
1000 PrintFatalError(R->getLoc(), "Invalid AssemblerCondDag!");
1001 StringRef CombineType = Op->getDef()->getName();
1002 if (CombineType != "any_of" && CombineType != "all_of")
1003 PrintFatalError(R->getLoc(), "Invalid AssemblerCondDag!");
1004 if (D->getNumArgs() == 0)
1005 PrintFatalError(R->getLoc(), "Invalid AssemblerCondDag!");
1006 bool IsOr = CombineType == "any_of";
1007 // Change (any_of FeatureAll, (any_of ...)) to (any_of FeatureAll, ...).
1008 if (IsOr && D->getNumArgs() == 2 && isa<DagInit>(D->getArg(1))) {
1009 DagInit *RHS = cast<DagInit>(D->getArg(1));
1010 SmallVector<Init *> Args{D->getArg(0)};
1011 SmallVector<StringInit *> ArgNames{D->getArgName(0)};
1012 for (unsigned i = 0, e = RHS->getNumArgs(); i != e; ++i) {
1013 Args.push_back(RHS->getArg(i));
1014 ArgNames.push_back(RHS->getArgName(i));
1016 D = DagInit::get(D->getOperator(), nullptr, Args, ArgNames);
1019 for (auto *Arg : D->getArgs()) {
1020 bool IsNeg = false;
1021 if (auto *NotArg = dyn_cast<DagInit>(Arg)) {
1022 if (NotArg->getOperator()->getAsString() != "not" ||
1023 NotArg->getNumArgs() != 1)
1024 PrintFatalError(R->getLoc(), "Invalid AssemblerCondDag!");
1025 Arg = NotArg->getArg(0);
1026 IsNeg = true;
1028 if (!isa<DefInit>(Arg) ||
1029 !cast<DefInit>(Arg)->getDef()->isSubClassOf("SubtargetFeature"))
1030 PrintFatalError(R->getLoc(), "Invalid AssemblerCondDag!");
1032 IAP.addCond(std::string(formatv(
1033 "AliasPatternCond::K_{0}{1}Feature, {2}::{3}", IsOr ? "Or" : "",
1034 IsNeg ? "Neg" : "", Namespace, Arg->getAsString())));
1036 // If an AssemblerPredicate with ors is used, note end of list should
1037 // these be combined.
1038 if (IsOr)
1039 IAP.addCond("AliasPatternCond::K_EndOrFeatures, 0");
1042 IAPrinterMap[Aliases.first].push_back(std::move(IAP));
1046 //////////////////////////////
1047 // Write out the printAliasInstr function
1048 //////////////////////////////
1050 std::string Header;
1051 raw_string_ostream HeaderO(Header);
1053 HeaderO << "bool " << Target.getName() << ClassName
1054 << "::printAliasInstr(const MCInst"
1055 << " *MI, uint64_t Address, "
1056 << (PassSubtarget ? "const MCSubtargetInfo &STI, " : "")
1057 << "raw_ostream &OS) {\n";
1059 std::string PatternsForOpcode;
1060 raw_string_ostream OpcodeO(PatternsForOpcode);
1062 unsigned PatternCount = 0;
1063 std::string Patterns;
1064 raw_string_ostream PatternO(Patterns);
1066 unsigned CondCount = 0;
1067 std::string Conds;
1068 raw_string_ostream CondO(Conds);
1070 // All flattened alias strings.
1071 std::map<std::string, uint32_t> AsmStringOffsets;
1072 std::vector<std::pair<uint32_t, std::string>> AsmStrings;
1073 size_t AsmStringsSize = 0;
1075 // Iterate over the opcodes in enum order so they are sorted by opcode for
1076 // binary search.
1077 for (const CodeGenInstruction *Inst : NumberedInstructions) {
1078 auto It = IAPrinterMap.find(getQualifiedName(Inst->TheDef));
1079 if (It == IAPrinterMap.end())
1080 continue;
1081 std::vector<IAPrinter> &IAPs = It->second;
1082 std::vector<IAPrinter*> UniqueIAPs;
1084 // Remove any ambiguous alias rules.
1085 for (auto &LHS : IAPs) {
1086 bool IsDup = false;
1087 for (const auto &RHS : IAPs) {
1088 if (&LHS != &RHS && LHS == RHS) {
1089 IsDup = true;
1090 break;
1094 if (!IsDup)
1095 UniqueIAPs.push_back(&LHS);
1098 if (UniqueIAPs.empty()) continue;
1100 unsigned PatternStart = PatternCount;
1102 // Insert the pattern start and opcode in the pattern list for debugging.
1103 PatternO << formatv(" // {0} - {1}\n", It->first, PatternStart);
1105 for (IAPrinter *IAP : UniqueIAPs) {
1106 // Start each condition list with a comment of the resulting pattern that
1107 // we're trying to match.
1108 unsigned CondStart = CondCount;
1109 CondO << formatv(" // {0} - {1}\n", IAP->getResult(), CondStart);
1110 for (const auto &Cond : IAP->getConds())
1111 CondO << " {" << Cond << "},\n";
1112 CondCount += IAP->getCondCount();
1114 // After operands have been examined, re-encode the alias string with
1115 // escapes indicating how operands should be printed.
1116 uint32_t UnescapedSize = 0;
1117 std::string EncodedAsmString = IAP->formatAliasString(UnescapedSize);
1118 auto Insertion =
1119 AsmStringOffsets.insert({EncodedAsmString, AsmStringsSize});
1120 if (Insertion.second) {
1121 // If the string is new, add it to the vector.
1122 AsmStrings.push_back({AsmStringsSize, EncodedAsmString});
1123 AsmStringsSize += UnescapedSize + 1;
1125 unsigned AsmStrOffset = Insertion.first->second;
1127 PatternO << formatv(" {{{0}, {1}, {2}, {3} },\n", AsmStrOffset,
1128 CondStart, IAP->getNumMIOps(), IAP->getCondCount());
1129 ++PatternCount;
1132 OpcodeO << formatv(" {{{0}, {1}, {2} },\n", It->first, PatternStart,
1133 PatternCount - PatternStart);
1136 if (OpcodeO.str().empty()) {
1137 O << HeaderO.str();
1138 O << " return false;\n";
1139 O << "}\n\n";
1140 O << "#endif // PRINT_ALIAS_INSTR\n";
1141 return;
1144 // Forward declare the validation method if needed.
1145 if (!MCOpPredicates.empty())
1146 O << "static bool " << Target.getName() << ClassName
1147 << "ValidateMCOperand(const MCOperand &MCOp,\n"
1148 << " const MCSubtargetInfo &STI,\n"
1149 << " unsigned PredicateIndex);\n";
1151 O << HeaderO.str();
1152 O.indent(2) << "static const PatternsForOpcode OpToPatterns[] = {\n";
1153 O << OpcodeO.str();
1154 O.indent(2) << "};\n\n";
1155 O.indent(2) << "static const AliasPattern Patterns[] = {\n";
1156 O << PatternO.str();
1157 O.indent(2) << "};\n\n";
1158 O.indent(2) << "static const AliasPatternCond Conds[] = {\n";
1159 O << CondO.str();
1160 O.indent(2) << "};\n\n";
1161 O.indent(2) << "static const char AsmStrings[] =\n";
1162 for (const auto &P : AsmStrings) {
1163 O.indent(4) << "/* " << P.first << " */ \"" << P.second << "\\0\"\n";
1166 O.indent(2) << ";\n\n";
1168 // Assert that the opcode table is sorted. Use a static local constructor to
1169 // ensure that the check only happens once on first run.
1170 O << "#ifndef NDEBUG\n";
1171 O.indent(2) << "static struct SortCheck {\n";
1172 O.indent(2) << " SortCheck(ArrayRef<PatternsForOpcode> OpToPatterns) {\n";
1173 O.indent(2) << " assert(std::is_sorted(\n";
1174 O.indent(2) << " OpToPatterns.begin(), OpToPatterns.end(),\n";
1175 O.indent(2) << " [](const PatternsForOpcode &L, const "
1176 "PatternsForOpcode &R) {\n";
1177 O.indent(2) << " return L.Opcode < R.Opcode;\n";
1178 O.indent(2) << " }) &&\n";
1179 O.indent(2) << " \"tablegen failed to sort opcode patterns\");\n";
1180 O.indent(2) << " }\n";
1181 O.indent(2) << "} sortCheckVar(OpToPatterns);\n";
1182 O << "#endif\n\n";
1184 O.indent(2) << "AliasMatchingData M {\n";
1185 O.indent(2) << " ArrayRef(OpToPatterns),\n";
1186 O.indent(2) << " ArrayRef(Patterns),\n";
1187 O.indent(2) << " ArrayRef(Conds),\n";
1188 O.indent(2) << " StringRef(AsmStrings, std::size(AsmStrings)),\n";
1189 if (MCOpPredicates.empty())
1190 O.indent(2) << " nullptr,\n";
1191 else
1192 O.indent(2) << " &" << Target.getName() << ClassName << "ValidateMCOperand,\n";
1193 O.indent(2) << "};\n";
1195 O.indent(2) << "const char *AsmString = matchAliasPatterns(MI, "
1196 << (PassSubtarget ? "&STI" : "nullptr") << ", M);\n";
1197 O.indent(2) << "if (!AsmString) return false;\n\n";
1199 // Code that prints the alias, replacing the operands with the ones from the
1200 // MCInst.
1201 O << " unsigned I = 0;\n";
1202 O << " while (AsmString[I] != ' ' && AsmString[I] != '\\t' &&\n";
1203 O << " AsmString[I] != '$' && AsmString[I] != '\\0')\n";
1204 O << " ++I;\n";
1205 O << " OS << '\\t' << StringRef(AsmString, I);\n";
1207 O << " if (AsmString[I] != '\\0') {\n";
1208 O << " if (AsmString[I] == ' ' || AsmString[I] == '\\t') {\n";
1209 O << " OS << '\\t';\n";
1210 O << " ++I;\n";
1211 O << " }\n";
1212 O << " do {\n";
1213 O << " if (AsmString[I] == '$') {\n";
1214 O << " ++I;\n";
1215 O << " if (AsmString[I] == (char)0xff) {\n";
1216 O << " ++I;\n";
1217 O << " int OpIdx = AsmString[I++] - 1;\n";
1218 O << " int PrintMethodIdx = AsmString[I++] - 1;\n";
1219 O << " printCustomAliasOperand(MI, Address, OpIdx, PrintMethodIdx, ";
1220 O << (PassSubtarget ? "STI, " : "");
1221 O << "OS);\n";
1222 O << " } else\n";
1223 O << " printOperand(MI, unsigned(AsmString[I++]) - 1, ";
1224 O << (PassSubtarget ? "STI, " : "");
1225 O << "OS);\n";
1226 O << " } else {\n";
1227 O << " OS << AsmString[I++];\n";
1228 O << " }\n";
1229 O << " } while (AsmString[I] != '\\0');\n";
1230 O << " }\n\n";
1232 O << " return true;\n";
1233 O << "}\n\n";
1235 //////////////////////////////
1236 // Write out the printCustomAliasOperand function
1237 //////////////////////////////
1239 O << "void " << Target.getName() << ClassName << "::"
1240 << "printCustomAliasOperand(\n"
1241 << " const MCInst *MI, uint64_t Address, unsigned OpIdx,\n"
1242 << " unsigned PrintMethodIdx,\n"
1243 << (PassSubtarget ? " const MCSubtargetInfo &STI,\n" : "")
1244 << " raw_ostream &OS) {\n";
1245 if (PrintMethods.empty())
1246 O << " llvm_unreachable(\"Unknown PrintMethod kind\");\n";
1247 else {
1248 O << " switch (PrintMethodIdx) {\n"
1249 << " default:\n"
1250 << " llvm_unreachable(\"Unknown PrintMethod kind\");\n"
1251 << " break;\n";
1253 for (unsigned i = 0; i < PrintMethods.size(); ++i) {
1254 O << " case " << i << ":\n"
1255 << " " << PrintMethods[i].first << "(MI, "
1256 << (PrintMethods[i].second ? "Address, " : "") << "OpIdx, "
1257 << (PassSubtarget ? "STI, " : "") << "OS);\n"
1258 << " break;\n";
1260 O << " }\n";
1262 O << "}\n\n";
1264 if (!MCOpPredicates.empty()) {
1265 O << "static bool " << Target.getName() << ClassName
1266 << "ValidateMCOperand(const MCOperand &MCOp,\n"
1267 << " const MCSubtargetInfo &STI,\n"
1268 << " unsigned PredicateIndex) {\n"
1269 << " switch (PredicateIndex) {\n"
1270 << " default:\n"
1271 << " llvm_unreachable(\"Unknown MCOperandPredicate kind\");\n"
1272 << " break;\n";
1274 for (unsigned i = 0; i < MCOpPredicates.size(); ++i) {
1275 StringRef MCOpPred = MCOpPredicates[i]->getValueAsString("MCOperandPredicate");
1276 O << " case " << i + 1 << ": {\n"
1277 << MCOpPred.data() << "\n"
1278 << " }\n";
1280 O << " }\n"
1281 << "}\n\n";
1284 O << "#endif // PRINT_ALIAS_INSTR\n";
1287 AsmWriterEmitter::AsmWriterEmitter(RecordKeeper &R) : Records(R), Target(R) {
1288 Record *AsmWriter = Target.getAsmWriter();
1289 unsigned Variant = AsmWriter->getValueAsInt("Variant");
1291 // Get the instruction numbering.
1292 NumberedInstructions = Target.getInstructionsByEnumValue();
1294 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
1295 const CodeGenInstruction *I = NumberedInstructions[i];
1296 if (!I->AsmString.empty() && I->TheDef->getName() != "PHI")
1297 Instructions.emplace_back(*I, i, Variant);
1301 void AsmWriterEmitter::run(raw_ostream &O) {
1302 std::vector<std::vector<std::string>> TableDrivenOperandPrinters;
1303 unsigned BitsLeft = 0;
1304 unsigned AsmStrBits = 0;
1305 emitSourceFileHeader("Assembly Writer Source Fragment", O, Records);
1306 EmitGetMnemonic(O, TableDrivenOperandPrinters, BitsLeft, AsmStrBits);
1307 EmitPrintInstruction(O, TableDrivenOperandPrinters, BitsLeft, AsmStrBits);
1308 EmitGetRegisterName(O);
1309 EmitPrintAliasInstruction(O);
1312 static TableGen::Emitter::OptClass<AsmWriterEmitter>
1313 X("gen-asm-writer", "Generate assembly writer");