blob: b5c7f35be0e543d7e1957769b8b87a1c7ad561e2 [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//
Chandler Carruth2946cd72019-01-19 08:50:56 +00003// 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
Misha Brukman650ba8e2005-04-22 00:00:37 +00006//
Chris Lattner1c4ae852004-08-01 05:59:33 +00007//===----------------------------------------------------------------------===//
8//
Xinliang David Lib439c7a2016-02-23 19:18:21 +00009// This tablegen backend emits an assembly printer for the current target.
Chris Lattner1c4ae852004-08-01 05:59:33 +000010// Note that this is currently fairly skeletal, but will grow over time.
11//
12//===----------------------------------------------------------------------===//
13
Sean Callananb7e8f4a2010-02-09 21:50:41 +000014#include "AsmWriterInst.h"
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000015#include "CodeGenInstruction.h"
16#include "CodeGenRegisters.h"
Chris Lattner1c4ae852004-08-01 05:59:33 +000017#include "CodeGenTarget.h"
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +000018#include "SequenceToOffsetTable.h"
Daniel Sandersca89f3a2016-11-19 12:21:34 +000019#include "Types.h"
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000020#include "llvm/ADT/ArrayRef.h"
21#include "llvm/ADT/DenseMap.h"
Benjamin Kramerd59664f2014-04-29 23:26:49 +000022#include "llvm/ADT/SmallString.h"
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000023#include "llvm/ADT/SmallVector.h"
24#include "llvm/ADT/STLExtras.h"
Craig Topperb6350132012-07-27 06:44:02 +000025#include "llvm/ADT/StringExtras.h"
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000026#include "llvm/ADT/StringRef.h"
Owen Andersona84be6c2011-06-27 21:06:21 +000027#include "llvm/ADT/Twine.h"
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000028#include "llvm/Support/Casting.h"
Chris Lattner692374c2006-07-18 17:18:03 +000029#include "llvm/Support/Debug.h"
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000030#include "llvm/Support/ErrorHandling.h"
Benjamin Kramer17c17bc2013-09-11 15:42:16 +000031#include "llvm/Support/Format.h"
Chris Lattner692374c2006-07-18 17:18:03 +000032#include "llvm/Support/MathExtras.h"
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000033#include "llvm/Support/raw_ostream.h"
Peter Collingbourne84c287e2011-10-01 16:41:13 +000034#include "llvm/TableGen/Error.h"
35#include "llvm/TableGen/Record.h"
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000036#include "llvm/TableGen/TableGenBackend.h"
Jeff Cohenda636b32005-01-22 18:50:10 +000037#include <algorithm>
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000038#include <cassert>
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000039#include <cstddef>
40#include <cstdint>
41#include <deque>
42#include <iterator>
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000043#include <map>
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000044#include <set>
45#include <string>
46#include <tuple>
Benjamin Kramer82de7d32016-05-27 14:27:24 +000047#include <utility>
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000048#include <vector>
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000049
Chris Lattner1c4ae852004-08-01 05:59:33 +000050using namespace llvm;
51
Chandler Carruthe96dd892014-04-21 22:55:11 +000052#define DEBUG_TYPE "asm-writer-emitter"
53
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000054namespace {
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000055
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000056class AsmWriterEmitter {
57 RecordKeeper &Records;
Ahmed Bougachabd214002013-10-28 18:07:17 +000058 CodeGenTarget Target;
Craig Topperf9265322016-01-17 20:38:14 +000059 ArrayRef<const CodeGenInstruction *> NumberedInstructions;
Ahmed Bougachabd214002013-10-28 18:07:17 +000060 std::vector<AsmWriterInst> Instructions;
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000061
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000062public:
Ahmed Bougachabd214002013-10-28 18:07:17 +000063 AsmWriterEmitter(RecordKeeper &R);
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000064
65 void run(raw_ostream &o);
66
67private:
68 void EmitPrintInstruction(raw_ostream &o);
69 void EmitGetRegisterName(raw_ostream &o);
70 void EmitPrintAliasInstruction(raw_ostream &O);
71
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000072 void FindUniqueOperandCommands(std::vector<std::string> &UOC,
Craig Topper5dd7a2c2016-01-24 07:13:28 +000073 std::vector<std::vector<unsigned>> &InstIdxs,
Craig Topperc24a4012016-01-14 06:15:07 +000074 std::vector<unsigned> &InstOpsUsed,
75 bool PassSubtarget) const;
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000076};
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000077
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +000078} // end anonymous namespace
79
Chris Lattner59a7f5c2005-01-22 20:31:17 +000080static void PrintCases(std::vector<std::pair<std::string,
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +000081 AsmWriterOperand>> &OpsToPrint, raw_ostream &O,
Craig Topperc24a4012016-01-14 06:15:07 +000082 bool PassSubtarget) {
Craig Topper0b271ad2016-01-13 07:20:13 +000083 O << " case " << OpsToPrint.back().first << ":";
Chris Lattner59a7f5c2005-01-22 20:31:17 +000084 AsmWriterOperand TheOp = OpsToPrint.back().second;
85 OpsToPrint.pop_back();
86
87 // Check to see if any other operands are identical in this list, and if so,
88 // emit a case label for them.
89 for (unsigned i = OpsToPrint.size(); i != 0; --i)
90 if (OpsToPrint[i-1].second == TheOp) {
Craig Topper0b271ad2016-01-13 07:20:13 +000091 O << "\n case " << OpsToPrint[i-1].first << ":";
Chris Lattner59a7f5c2005-01-22 20:31:17 +000092 OpsToPrint.erase(OpsToPrint.begin()+i-1);
93 }
94
95 // Finally, emit the code.
Craig Topperc24a4012016-01-14 06:15:07 +000096 O << "\n " << TheOp.getCode(PassSubtarget);
Craig Topper0b271ad2016-01-13 07:20:13 +000097 O << "\n break;\n";
Chris Lattner59a7f5c2005-01-22 20:31:17 +000098}
99
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000100/// EmitInstructions - Emit the last instruction in the vector and any other
101/// instructions that are suitably similar to it.
102static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
Craig Topperc24a4012016-01-14 06:15:07 +0000103 raw_ostream &O, bool PassSubtarget) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000104 AsmWriterInst FirstInst = Insts.back();
105 Insts.pop_back();
106
107 std::vector<AsmWriterInst> SimilarInsts;
108 unsigned DifferingOperand = ~0;
109 for (unsigned i = Insts.size(); i != 0; --i) {
Chris Lattner92275bb2005-01-22 19:22:23 +0000110 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
111 if (DiffOp != ~1U) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000112 if (DifferingOperand == ~0U) // First match!
113 DifferingOperand = DiffOp;
114
115 // If this differs in the same operand as the rest of the instructions in
116 // this class, move it to the SimilarInsts list.
Chris Lattner92275bb2005-01-22 19:22:23 +0000117 if (DifferingOperand == DiffOp || DiffOp == ~0U) {
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000118 SimilarInsts.push_back(Insts[i-1]);
119 Insts.erase(Insts.begin()+i-1);
120 }
121 }
122 }
123
Chris Lattner017b93d2006-05-01 17:01:17 +0000124 O << " case " << FirstInst.CGI->Namespace << "::"
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000125 << FirstInst.CGI->TheDef->getName() << ":\n";
Craig Topper190ecd52016-01-08 07:06:32 +0000126 for (const AsmWriterInst &AWI : SimilarInsts)
127 O << " case " << AWI.CGI->Namespace << "::"
128 << AWI.CGI->TheDef->getName() << ":\n";
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000129 for (unsigned i = 0, e = FirstInst.Operands.size(); i != e; ++i) {
130 if (i != DifferingOperand) {
131 // If the operand is the same for all instructions, just print it.
Craig Topperc24a4012016-01-14 06:15:07 +0000132 O << " " << FirstInst.Operands[i].getCode(PassSubtarget);
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000133 } else {
134 // If this is the operand that varies between all of the instructions,
135 // emit a switch for just this operand now.
136 O << " switch (MI->getOpcode()) {\n";
Craig Topper0b271ad2016-01-13 07:20:13 +0000137 O << " default: llvm_unreachable(\"Unexpected opcode.\");\n";
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000138 std::vector<std::pair<std::string, AsmWriterOperand>> OpsToPrint;
Craig Topper86a9aee2017-07-07 06:22:35 +0000139 OpsToPrint.push_back(std::make_pair(FirstInst.CGI->Namespace.str() + "::" +
Matthias Braun4a86d452016-12-04 05:48:16 +0000140 FirstInst.CGI->TheDef->getName().str(),
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000141 FirstInst.Operands[i]));
Misha Brukman650ba8e2005-04-22 00:00:37 +0000142
Craig Topper190ecd52016-01-08 07:06:32 +0000143 for (const AsmWriterInst &AWI : SimilarInsts) {
Craig Topper86a9aee2017-07-07 06:22:35 +0000144 OpsToPrint.push_back(std::make_pair(AWI.CGI->Namespace.str()+"::" +
Matthias Braun4a86d452016-12-04 05:48:16 +0000145 AWI.CGI->TheDef->getName().str(),
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000146 AWI.Operands[i]));
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000147 }
Chris Lattner59a7f5c2005-01-22 20:31:17 +0000148 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
149 while (!OpsToPrint.empty())
Craig Topperc24a4012016-01-14 06:15:07 +0000150 PrintCases(OpsToPrint, O, PassSubtarget);
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000151 O << " }";
152 }
153 O << "\n";
154 }
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000155 O << " break;\n";
156}
Chris Lattner0c23ba52005-01-22 17:32:42 +0000157
Chris Lattner692374c2006-07-18 17:18:03 +0000158void AsmWriterEmitter::
Jim Grosbacha5497342010-09-29 22:32:50 +0000159FindUniqueOperandCommands(std::vector<std::string> &UniqueOperandCommands,
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000160 std::vector<std::vector<unsigned>> &InstIdxs,
Craig Topperc24a4012016-01-14 06:15:07 +0000161 std::vector<unsigned> &InstOpsUsed,
162 bool PassSubtarget) const {
Chris Lattner692374c2006-07-18 17:18:03 +0000163 // This vector parallels UniqueOperandCommands, keeping track of which
164 // instructions each case are used for. It is a comma separated string of
165 // enums.
166 std::vector<std::string> InstrsForCase;
167 InstrsForCase.resize(UniqueOperandCommands.size());
Chris Lattneredee5252006-07-18 18:28:27 +0000168 InstOpsUsed.assign(UniqueOperandCommands.size(), 0);
Jim Grosbacha5497342010-09-29 22:32:50 +0000169
Craig Topper9e9ae602016-01-17 08:05:33 +0000170 for (size_t i = 0, e = Instructions.size(); i != e; ++i) {
171 const AsmWriterInst &Inst = Instructions[i];
172 if (Inst.Operands.empty())
Chris Lattner692374c2006-07-18 17:18:03 +0000173 continue; // Instruction already done.
Chris Lattner9d250692006-07-18 17:50:22 +0000174
Craig Topper9e9ae602016-01-17 08:05:33 +0000175 std::string Command = " "+Inst.Operands[0].getCode(PassSubtarget)+"\n";
Chris Lattner9d250692006-07-18 17:50:22 +0000176
Chris Lattner692374c2006-07-18 17:18:03 +0000177 // Check to see if we already have 'Command' in UniqueOperandCommands.
178 // If not, add it.
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000179 auto I = llvm::find(UniqueOperandCommands, Command);
Craig Toppera99859d2016-01-17 08:05:30 +0000180 if (I != UniqueOperandCommands.end()) {
181 size_t idx = I - UniqueOperandCommands.begin();
Craig Toppera99859d2016-01-17 08:05:30 +0000182 InstrsForCase[idx] += ", ";
Craig Topper9e9ae602016-01-17 08:05:33 +0000183 InstrsForCase[idx] += Inst.CGI->TheDef->getName();
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000184 InstIdxs[idx].push_back(i);
Craig Toppera99859d2016-01-17 08:05:30 +0000185 } else {
Craig Topper1993e3b2016-01-08 07:06:29 +0000186 UniqueOperandCommands.push_back(std::move(Command));
Craig Topper9e9ae602016-01-17 08:05:33 +0000187 InstrsForCase.push_back(Inst.CGI->TheDef->getName());
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000188 InstIdxs.emplace_back();
189 InstIdxs.back().push_back(i);
Chris Lattneredee5252006-07-18 18:28:27 +0000190
191 // This command matches one operand so far.
192 InstOpsUsed.push_back(1);
193 }
194 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000195
Chris Lattneredee5252006-07-18 18:28:27 +0000196 // For each entry of UniqueOperandCommands, there is a set of instructions
197 // that uses it. If the next command of all instructions in the set are
198 // identical, fold it into the command.
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000199 for (size_t CommandIdx = 0, e = UniqueOperandCommands.size();
Chris Lattneredee5252006-07-18 18:28:27 +0000200 CommandIdx != e; ++CommandIdx) {
Jim Grosbacha5497342010-09-29 22:32:50 +0000201
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000202 const auto &Idxs = InstIdxs[CommandIdx];
Chris Lattneredee5252006-07-18 18:28:27 +0000203
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000204 for (unsigned Op = 1; ; ++Op) {
205 // Find the first instruction in the set.
206 const AsmWriterInst &FirstInst = Instructions[Idxs.front()];
Chris Lattneredee5252006-07-18 18:28:27 +0000207 // If this instruction has no more operands, we isn't anything to merge
208 // into this command.
Craig Topper9e9ae602016-01-17 08:05:33 +0000209 if (FirstInst.Operands.size() == Op)
Chris Lattneredee5252006-07-18 18:28:27 +0000210 break;
211
212 // Otherwise, scan to see if all of the other instructions in this command
213 // set share the operand.
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000214 if (std::any_of(Idxs.begin()+1, Idxs.end(),
215 [&](unsigned Idx) {
216 const AsmWriterInst &OtherInst = Instructions[Idx];
217 return OtherInst.Operands.size() == Op ||
218 OtherInst.Operands[Op] != FirstInst.Operands[Op];
219 }))
220 break;
Jim Grosbacha5497342010-09-29 22:32:50 +0000221
Chris Lattneredee5252006-07-18 18:28:27 +0000222 // Okay, everything in this command set has the same next operand. Add it
223 // to UniqueOperandCommands and remember that it was consumed.
Craig Topperc24a4012016-01-14 06:15:07 +0000224 std::string Command = " " +
Craig Topper9e9ae602016-01-17 08:05:33 +0000225 FirstInst.Operands[Op].getCode(PassSubtarget) + "\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000226
Chris Lattneredee5252006-07-18 18:28:27 +0000227 UniqueOperandCommands[CommandIdx] += Command;
228 InstOpsUsed[CommandIdx]++;
Chris Lattner692374c2006-07-18 17:18:03 +0000229 }
230 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000231
Chris Lattner692374c2006-07-18 17:18:03 +0000232 // Prepend some of the instructions each case is used for onto the case val.
233 for (unsigned i = 0, e = InstrsForCase.size(); i != e; ++i) {
234 std::string Instrs = InstrsForCase[i];
235 if (Instrs.size() > 70) {
236 Instrs.erase(Instrs.begin()+70, Instrs.end());
237 Instrs += "...";
238 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000239
Chris Lattner692374c2006-07-18 17:18:03 +0000240 if (!Instrs.empty())
Jim Grosbacha5497342010-09-29 22:32:50 +0000241 UniqueOperandCommands[i] = " // " + Instrs + "\n" +
Chris Lattner692374c2006-07-18 17:18:03 +0000242 UniqueOperandCommands[i];
243 }
244}
245
Daniel Dunbar04f049f2009-10-17 20:43:42 +0000246static void UnescapeString(std::string &Str) {
247 for (unsigned i = 0; i != Str.size(); ++i) {
248 if (Str[i] == '\\' && i != Str.size()-1) {
249 switch (Str[i+1]) {
250 default: continue; // Don't execute the code after the switch.
251 case 'a': Str[i] = '\a'; break;
252 case 'b': Str[i] = '\b'; break;
253 case 'e': Str[i] = 27; break;
254 case 'f': Str[i] = '\f'; break;
255 case 'n': Str[i] = '\n'; break;
256 case 'r': Str[i] = '\r'; break;
257 case 't': Str[i] = '\t'; break;
258 case 'v': Str[i] = '\v'; break;
259 case '"': Str[i] = '\"'; break;
260 case '\'': Str[i] = '\''; break;
261 case '\\': Str[i] = '\\'; break;
262 }
263 // Nuke the second character.
264 Str.erase(Str.begin()+i+1);
265 }
266 }
267}
268
Chris Lattner06c5eed2009-09-13 20:08:00 +0000269/// EmitPrintInstruction - Generate the code for the "printInstruction" method
Ahmed Bougachabd214002013-10-28 18:07:17 +0000270/// implementation. Destroys all instances of AsmWriterInst information, by
271/// clearing the Instructions vector.
Chris Lattner06c5eed2009-09-13 20:08:00 +0000272void AsmWriterEmitter::EmitPrintInstruction(raw_ostream &O) {
Chris Lattner6ffa5012004-08-14 22:50:53 +0000273 Record *AsmWriter = Target.getAsmWriter();
Craig Topperbcd3c372017-05-31 21:12:46 +0000274 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
Craig Topperc24a4012016-01-14 06:15:07 +0000275 bool PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
Jim Grosbacha5497342010-09-29 22:32:50 +0000276
Chris Lattner1c4ae852004-08-01 05:59:33 +0000277 O <<
278 "/// printInstruction - This method is automatically generated by tablegen\n"
Chris Lattner06c5eed2009-09-13 20:08:00 +0000279 "/// from the instruction set description.\n"
Chris Lattnerb94284b2009-08-08 01:32:19 +0000280 "void " << Target.getName() << ClassName
Akira Hatanakab46d0232015-03-27 20:36:02 +0000281 << "::printInstruction(const MCInst *MI, "
282 << (PassSubtarget ? "const MCSubtargetInfo &STI, " : "")
283 << "raw_ostream &O) {\n";
Chris Lattner1c4ae852004-08-01 05:59:33 +0000284
Chris Lattnere32982c2006-07-14 22:59:11 +0000285 // Build an aggregate string, and build a table of offsets into it.
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000286 SequenceToOffsetTable<std::string> StringTable;
Jim Grosbacha5497342010-09-29 22:32:50 +0000287
Chris Lattner5d751b42006-09-27 16:44:09 +0000288 /// OpcodeInfo - This encodes the index of the string to use for the first
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000289 /// chunk of the output as well as indices used for operand printing.
Craig Topperf9265322016-01-17 20:38:14 +0000290 std::vector<uint64_t> OpcodeInfo(NumberedInstructions.size());
Craig Topperd4f87a32016-01-13 07:20:12 +0000291 const unsigned OpcodeInfoBits = 64;
Jim Grosbacha5497342010-09-29 22:32:50 +0000292
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000293 // Add all strings to the string table upfront so it can generate an optimized
294 // representation.
Craig Topper9e9ae602016-01-17 08:05:33 +0000295 for (AsmWriterInst &AWI : Instructions) {
296 if (AWI.Operands[0].OperandType ==
Jim Grosbachf4e67082012-04-18 18:56:33 +0000297 AsmWriterOperand::isLiteralTextOperand &&
Craig Topper9e9ae602016-01-17 08:05:33 +0000298 !AWI.Operands[0].Str.empty()) {
299 std::string Str = AWI.Operands[0].Str;
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000300 UnescapeString(Str);
301 StringTable.add(Str);
302 }
303 }
304
305 StringTable.layout();
306
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000307 unsigned MaxStringIdx = 0;
Craig Topper9e9ae602016-01-17 08:05:33 +0000308 for (AsmWriterInst &AWI : Instructions) {
Chris Lattnere32982c2006-07-14 22:59:11 +0000309 unsigned Idx;
Craig Topper9e9ae602016-01-17 08:05:33 +0000310 if (AWI.Operands[0].OperandType != AsmWriterOperand::isLiteralTextOperand ||
311 AWI.Operands[0].Str.empty()) {
Chris Lattner36504652006-07-19 01:39:06 +0000312 // Something handled by the asmwriter printer, but with no leading string.
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000313 Idx = StringTable.get("");
Chris Lattnere32982c2006-07-14 22:59:11 +0000314 } else {
Craig Topper9e9ae602016-01-17 08:05:33 +0000315 std::string Str = AWI.Operands[0].Str;
Chris Lattnerb47ed612009-09-14 01:16:36 +0000316 UnescapeString(Str);
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000317 Idx = StringTable.get(Str);
Chris Lattnerb47ed612009-09-14 01:16:36 +0000318 MaxStringIdx = std::max(MaxStringIdx, Idx);
Jim Grosbacha5497342010-09-29 22:32:50 +0000319
Chris Lattnere32982c2006-07-14 22:59:11 +0000320 // Nuke the string from the operand list. It is now handled!
Craig Topper9e9ae602016-01-17 08:05:33 +0000321 AWI.Operands.erase(AWI.Operands.begin());
Chris Lattner92275bb2005-01-22 19:22:23 +0000322 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000323
Chris Lattnerb47ed612009-09-14 01:16:36 +0000324 // Bias offset by one since we want 0 as a sentinel.
Craig Topper9e9ae602016-01-17 08:05:33 +0000325 OpcodeInfo[AWI.CGIIndex] = Idx+1;
Chris Lattner92275bb2005-01-22 19:22:23 +0000326 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000327
Chris Lattner1ac0eb72006-07-18 17:32:27 +0000328 // Figure out how many bits we used for the string index.
Chris Lattnerb47ed612009-09-14 01:16:36 +0000329 unsigned AsmStrBits = Log2_32_Ceil(MaxStringIdx+2);
Jim Grosbacha5497342010-09-29 22:32:50 +0000330
Chris Lattner692374c2006-07-18 17:18:03 +0000331 // To reduce code size, we compactify common instructions into a few bits
332 // in the opcode-indexed table.
Craig Topperd4f87a32016-01-13 07:20:12 +0000333 unsigned BitsLeft = OpcodeInfoBits-AsmStrBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000334
Craig Topper1f387362014-11-25 20:11:25 +0000335 std::vector<std::vector<std::string>> TableDrivenOperandPrinters;
Jim Grosbacha5497342010-09-29 22:32:50 +0000336
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000337 while (true) {
Chris Lattner692374c2006-07-18 17:18:03 +0000338 std::vector<std::string> UniqueOperandCommands;
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000339 std::vector<std::vector<unsigned>> InstIdxs;
Chris Lattneredee5252006-07-18 18:28:27 +0000340 std::vector<unsigned> NumInstOpsHandled;
341 FindUniqueOperandCommands(UniqueOperandCommands, InstIdxs,
Craig Topperc24a4012016-01-14 06:15:07 +0000342 NumInstOpsHandled, PassSubtarget);
Jim Grosbacha5497342010-09-29 22:32:50 +0000343
Chris Lattner692374c2006-07-18 17:18:03 +0000344 // If we ran out of operands to print, we're done.
345 if (UniqueOperandCommands.empty()) break;
Jim Grosbacha5497342010-09-29 22:32:50 +0000346
Chris Lattner692374c2006-07-18 17:18:03 +0000347 // Compute the number of bits we need to represent these cases, this is
348 // ceil(log2(numentries)).
349 unsigned NumBits = Log2_32_Ceil(UniqueOperandCommands.size());
Jim Grosbacha5497342010-09-29 22:32:50 +0000350
Chris Lattner692374c2006-07-18 17:18:03 +0000351 // If we don't have enough bits for this operand, don't include it.
352 if (NumBits > BitsLeft) {
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000353 LLVM_DEBUG(errs() << "Not enough bits to densely encode " << NumBits
354 << " more bits\n");
Chris Lattner692374c2006-07-18 17:18:03 +0000355 break;
356 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000357
Chris Lattner692374c2006-07-18 17:18:03 +0000358 // Otherwise, we can include this in the initial lookup table. Add it in.
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000359 for (size_t i = 0, e = InstIdxs.size(); i != e; ++i) {
360 unsigned NumOps = NumInstOpsHandled[i];
361 for (unsigned Idx : InstIdxs[i]) {
362 OpcodeInfo[Instructions[Idx].CGIIndex] |=
363 (uint64_t)i << (OpcodeInfoBits-BitsLeft);
364 // Remove the info about this operand from the instruction.
365 AsmWriterInst &Inst = Instructions[Idx];
366 if (!Inst.Operands.empty()) {
367 assert(NumOps <= Inst.Operands.size() &&
368 "Can't remove this many ops!");
369 Inst.Operands.erase(Inst.Operands.begin(),
370 Inst.Operands.begin()+NumOps);
371 }
Craig Topper9e9ae602016-01-17 08:05:33 +0000372 }
Chris Lattnercb0c8482006-07-18 17:56:07 +0000373 }
Craig Topper5dd7a2c2016-01-24 07:13:28 +0000374 BitsLeft -= NumBits;
Jim Grosbacha5497342010-09-29 22:32:50 +0000375
Chris Lattnercb0c8482006-07-18 17:56:07 +0000376 // Remember the handlers for this set of operands.
Craig Topper1f387362014-11-25 20:11:25 +0000377 TableDrivenOperandPrinters.push_back(std::move(UniqueOperandCommands));
Chris Lattner692374c2006-07-18 17:18:03 +0000378 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000379
Craig Topper14d91732016-01-11 05:13:41 +0000380 // Emit the string table itself.
Reid Kleckner132c40f2014-07-17 19:43:40 +0000381 O << " static const char AsmStrs[] = {\n";
Benjamin Kramer22d093e2012-04-02 09:13:46 +0000382 StringTable.emit(O, printChar);
383 O << " };\n\n";
Chris Lattnere32982c2006-07-14 22:59:11 +0000384
Craig Topper14d91732016-01-11 05:13:41 +0000385 // Emit the lookup tables in pieces to minimize wasted bytes.
Craig Topperd4f87a32016-01-13 07:20:12 +0000386 unsigned BytesNeeded = ((OpcodeInfoBits - BitsLeft) + 7) / 8;
Craig Topper14d91732016-01-11 05:13:41 +0000387 unsigned Table = 0, Shift = 0;
388 SmallString<128> BitsString;
389 raw_svector_ostream BitsOS(BitsString);
390 // If the total bits is more than 32-bits we need to use a 64-bit type.
Craig Topperd4f87a32016-01-13 07:20:12 +0000391 BitsOS << " uint" << ((BitsLeft < (OpcodeInfoBits - 32)) ? 64 : 32)
392 << "_t Bits = 0;\n";
Craig Topper14d91732016-01-11 05:13:41 +0000393 while (BytesNeeded != 0) {
394 // Figure out how big this table section needs to be, but no bigger than 4.
395 unsigned TableSize = std::min(1 << Log2_32(BytesNeeded), 4);
396 BytesNeeded -= TableSize;
397 TableSize *= 8; // Convert to bits;
398 uint64_t Mask = (1ULL << TableSize) - 1;
399 O << " static const uint" << TableSize << "_t OpInfo" << Table
400 << "[] = {\n";
Craig Topperf9265322016-01-17 20:38:14 +0000401 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
Craig Topper14d91732016-01-11 05:13:41 +0000402 O << " " << ((OpcodeInfo[i] >> Shift) & Mask) << "U,\t// "
Craig Topperf9265322016-01-17 20:38:14 +0000403 << NumberedInstructions[i]->TheDef->getName() << "\n";
Craig Topper14d91732016-01-11 05:13:41 +0000404 }
405 O << " };\n\n";
406 // Emit string to combine the individual table lookups.
407 BitsOS << " Bits |= ";
408 // If the total bits is more than 32-bits we need to use a 64-bit type.
Craig Topperd4f87a32016-01-13 07:20:12 +0000409 if (BitsLeft < (OpcodeInfoBits - 32))
Craig Topper14d91732016-01-11 05:13:41 +0000410 BitsOS << "(uint64_t)";
411 BitsOS << "OpInfo" << Table << "[MI->getOpcode()] << " << Shift << ";\n";
412 // Prepare the shift for the next iteration and increment the table count.
413 Shift += TableSize;
414 ++Table;
415 }
416
417 // Emit the initial tab character.
Evan Cheng32e53472008-02-02 08:39:46 +0000418 O << " O << \"\\t\";\n\n";
419
Craig Topper06cec4c2012-09-14 08:33:11 +0000420 O << " // Emit the opcode for the instruction.\n";
Craig Topper14d91732016-01-11 05:13:41 +0000421 O << BitsString;
422
423 // Emit the starting string.
Manman Ren68cf9fc2012-09-13 17:43:46 +0000424 O << " assert(Bits != 0 && \"Cannot print this instruction.\");\n"
Chris Lattnerb47ed612009-09-14 01:16:36 +0000425 << " O << AsmStrs+(Bits & " << (1 << AsmStrBits)-1 << ")-1;\n\n";
David Greenefdd25192009-08-05 21:00:52 +0000426
Chris Lattner692374c2006-07-18 17:18:03 +0000427 // Output the table driven operand information.
Craig Topperd4f87a32016-01-13 07:20:12 +0000428 BitsLeft = OpcodeInfoBits-AsmStrBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000429 for (unsigned i = 0, e = TableDrivenOperandPrinters.size(); i != e; ++i) {
430 std::vector<std::string> &Commands = TableDrivenOperandPrinters[i];
431
432 // Compute the number of bits we need to represent these cases, this is
433 // ceil(log2(numentries)).
434 unsigned NumBits = Log2_32_Ceil(Commands.size());
435 assert(NumBits <= BitsLeft && "consistency error");
Jim Grosbacha5497342010-09-29 22:32:50 +0000436
Chris Lattner692374c2006-07-18 17:18:03 +0000437 // Emit code to extract this field from Bits.
Chris Lattner692374c2006-07-18 17:18:03 +0000438 O << "\n // Fragment " << i << " encoded into " << NumBits
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000439 << " bits for " << Commands.size() << " unique commands.\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000440
Chris Lattneredee5252006-07-18 18:28:27 +0000441 if (Commands.size() == 2) {
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000442 // Emit two possibilitys with if/else.
Craig Topper06cec4c2012-09-14 08:33:11 +0000443 O << " if ((Bits >> "
Craig Topperd4f87a32016-01-13 07:20:12 +0000444 << (OpcodeInfoBits-BitsLeft) << ") & "
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000445 << ((1 << NumBits)-1) << ") {\n"
446 << Commands[1]
447 << " } else {\n"
448 << Commands[0]
449 << " }\n\n";
Eric Christophera573d192010-09-18 18:50:27 +0000450 } else if (Commands.size() == 1) {
451 // Emit a single possibility.
452 O << Commands[0] << "\n\n";
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000453 } else {
Craig Topper06cec4c2012-09-14 08:33:11 +0000454 O << " switch ((Bits >> "
Craig Topperd4f87a32016-01-13 07:20:12 +0000455 << (OpcodeInfoBits-BitsLeft) << ") & "
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000456 << ((1 << NumBits)-1) << ") {\n"
Craig Toppera4ff6ae2014-11-24 14:09:52 +0000457 << " default: llvm_unreachable(\"Invalid command number.\");\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000458
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000459 // Print out all the cases.
Craig Topper190ecd52016-01-08 07:06:32 +0000460 for (unsigned j = 0, e = Commands.size(); j != e; ++j) {
461 O << " case " << j << ":\n";
462 O << Commands[j];
Chris Lattner75dcf6c2006-07-18 17:43:54 +0000463 O << " break;\n";
464 }
465 O << " }\n\n";
Chris Lattner692374c2006-07-18 17:18:03 +0000466 }
Craig Topper06cec4c2012-09-14 08:33:11 +0000467 BitsLeft -= NumBits;
Chris Lattner692374c2006-07-18 17:18:03 +0000468 }
Jim Grosbacha5497342010-09-29 22:32:50 +0000469
Chris Lattnercb0c8482006-07-18 17:56:07 +0000470 // Okay, delete instructions with no operand info left.
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000471 auto I = llvm::remove_if(Instructions,
David Majnemerc7004902016-08-12 04:32:37 +0000472 [](AsmWriterInst &Inst) { return Inst.Operands.empty(); });
Craig Topper4f1f1152016-01-13 07:20:10 +0000473 Instructions.erase(I, Instructions.end());
Chris Lattner692374c2006-07-18 17:18:03 +0000474
Jim Grosbacha5497342010-09-29 22:32:50 +0000475
Chris Lattner692374c2006-07-18 17:18:03 +0000476 // Because this is a vector, we want to emit from the end. Reverse all of the
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000477 // elements in the vector.
478 std::reverse(Instructions.begin(), Instructions.end());
Jim Grosbacha5497342010-09-29 22:32:50 +0000479
480
Craig Topperdf390602016-01-13 07:20:07 +0000481 // Now that we've emitted all of the operand info that fit into 64 bits, emit
Chris Lattnerbf1a7692009-09-18 18:10:19 +0000482 // information for those instructions that are left. This is a less dense
Craig Topperdf390602016-01-13 07:20:07 +0000483 // encoding, but we expect the main 64-bit table to handle the majority of
Chris Lattnerbf1a7692009-09-18 18:10:19 +0000484 // instructions.
Chris Lattner66e288b2006-07-18 17:38:46 +0000485 if (!Instructions.empty()) {
486 // Find the opcode # of inline asm.
487 O << " switch (MI->getOpcode()) {\n";
Craig Topper0b271ad2016-01-13 07:20:13 +0000488 O << " default: llvm_unreachable(\"Unexpected opcode.\");\n";
Chris Lattner66e288b2006-07-18 17:38:46 +0000489 while (!Instructions.empty())
Craig Topperc24a4012016-01-14 06:15:07 +0000490 EmitInstructions(Instructions, O, PassSubtarget);
Chris Lattner9ceb7c82005-01-22 18:38:13 +0000491
Chris Lattner66e288b2006-07-18 17:38:46 +0000492 O << " }\n";
493 }
David Greene5b4bc262009-07-29 20:10:24 +0000494
Chris Lattner6e172082006-07-18 19:06:01 +0000495 O << "}\n";
Chris Lattner1c4ae852004-08-01 05:59:33 +0000496}
Chris Lattner06c5eed2009-09-13 20:08:00 +0000497
Owen Andersona84be6c2011-06-27 21:06:21 +0000498static void
499emitRegisterNameString(raw_ostream &O, StringRef AltName,
David Blaikie9b613db2014-11-29 18:13:39 +0000500 const std::deque<CodeGenRegister> &Registers) {
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000501 SequenceToOffsetTable<std::string> StringTable;
502 SmallVector<std::string, 4> AsmNames(Registers.size());
David Blaikie9b613db2014-11-29 18:13:39 +0000503 unsigned i = 0;
504 for (const auto &Reg : Registers) {
505 std::string &AsmName = AsmNames[i++];
Owen Andersona84be6c2011-06-27 21:06:21 +0000506
Owen Andersona84be6c2011-06-27 21:06:21 +0000507 // "NoRegAltName" is special. We don't need to do a lookup for that,
508 // as it's just a reference to the default register name.
509 if (AltName == "" || AltName == "NoRegAltName") {
510 AsmName = Reg.TheDef->getValueAsString("AsmName");
511 if (AsmName.empty())
512 AsmName = Reg.getName();
513 } else {
514 // Make sure the register has an alternate name for this index.
515 std::vector<Record*> AltNameList =
516 Reg.TheDef->getValueAsListOfDefs("RegAltNameIndices");
517 unsigned Idx = 0, e;
518 for (e = AltNameList.size();
519 Idx < e && (AltNameList[Idx]->getName() != AltName);
520 ++Idx)
521 ;
522 // If the register has an alternate name for this index, use it.
523 // Otherwise, leave it empty as an error flag.
524 if (Idx < e) {
Craig Topper2b8419a2017-05-31 19:01:11 +0000525 std::vector<StringRef> AltNames =
Owen Andersona84be6c2011-06-27 21:06:21 +0000526 Reg.TheDef->getValueAsListOfStrings("AltNames");
527 if (AltNames.size() <= Idx)
Joerg Sonnenberger635debe2012-10-25 20:33:17 +0000528 PrintFatalError(Reg.TheDef->getLoc(),
Benjamin Kramer48e7e852014-03-29 17:17:15 +0000529 "Register definition missing alt name for '" +
530 AltName + "'.");
Owen Andersona84be6c2011-06-27 21:06:21 +0000531 AsmName = AltNames[Idx];
532 }
533 }
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000534 StringTable.add(AsmName);
535 }
Owen Andersona84be6c2011-06-27 21:06:21 +0000536
Craig Topperf8f0a232012-09-15 01:22:42 +0000537 StringTable.layout();
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000538 O << " static const char AsmStrs" << AltName << "[] = {\n";
539 StringTable.emit(O, printChar);
540 O << " };\n\n";
541
Daniel Sandersca89f3a2016-11-19 12:21:34 +0000542 O << " static const " << getMinimalTypeForRange(StringTable.size() - 1, 32)
Craig Topperba6d83e2014-11-24 02:08:35 +0000543 << " RegAsmOffset" << AltName << "[] = {";
Jakob Stoklund Olesen892f4802012-03-30 21:12:52 +0000544 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
Craig Topper7a2cea12012-04-02 00:47:39 +0000545 if ((i % 14) == 0)
546 O << "\n ";
547 O << StringTable.get(AsmNames[i]) << ", ";
Owen Andersona84be6c2011-06-27 21:06:21 +0000548 }
Craig Topper9c252eb2012-04-03 06:52:47 +0000549 O << "\n };\n"
Owen Andersona84be6c2011-06-27 21:06:21 +0000550 << "\n";
Owen Andersona84be6c2011-06-27 21:06:21 +0000551}
Chris Lattner06c5eed2009-09-13 20:08:00 +0000552
553void AsmWriterEmitter::EmitGetRegisterName(raw_ostream &O) {
Chris Lattner06c5eed2009-09-13 20:08:00 +0000554 Record *AsmWriter = Target.getAsmWriter();
Craig Topperbcd3c372017-05-31 21:12:46 +0000555 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
David Blaikie9b613db2014-11-29 18:13:39 +0000556 const auto &Registers = Target.getRegBank().getRegisters();
Craig Topper83421ec2016-01-17 20:38:21 +0000557 const std::vector<Record*> &AltNameIndices = Target.getRegAltNameIndices();
Owen Andersona84be6c2011-06-27 21:06:21 +0000558 bool hasAltNames = AltNameIndices.size() > 1;
Craig Topperbcd3c372017-05-31 21:12:46 +0000559 StringRef Namespace = Registers.front().TheDef->getValueAsString("Namespace");
Jim Grosbacha5497342010-09-29 22:32:50 +0000560
Chris Lattner06c5eed2009-09-13 20:08:00 +0000561 O <<
562 "\n\n/// getRegisterName - This method is automatically generated by tblgen\n"
563 "/// from the register set description. This returns the assembler name\n"
564 "/// for the specified register.\n"
Owen Andersona84be6c2011-06-27 21:06:21 +0000565 "const char *" << Target.getName() << ClassName << "::";
566 if (hasAltNames)
567 O << "\ngetRegisterName(unsigned RegNo, unsigned AltIdx) {\n";
568 else
569 O << "getRegisterName(unsigned RegNo) {\n";
570 O << " assert(RegNo && RegNo < " << (Registers.size()+1)
571 << " && \"Invalid register number!\");\n"
Chris Lattnera7e8ae42009-09-14 01:26:18 +0000572 << "\n";
Jim Grosbacha5497342010-09-29 22:32:50 +0000573
Owen Andersona84be6c2011-06-27 21:06:21 +0000574 if (hasAltNames) {
Craig Topper190ecd52016-01-08 07:06:32 +0000575 for (const Record *R : AltNameIndices)
576 emitRegisterNameString(O, R->getName(), Registers);
Owen Andersona84be6c2011-06-27 21:06:21 +0000577 } else
578 emitRegisterNameString(O, "", Registers);
Jim Grosbacha5497342010-09-29 22:32:50 +0000579
Owen Andersona84be6c2011-06-27 21:06:21 +0000580 if (hasAltNames) {
Craig Topperba6d83e2014-11-24 02:08:35 +0000581 O << " switch(AltIdx) {\n"
Craig Topperc4965bc2012-02-05 07:21:30 +0000582 << " default: llvm_unreachable(\"Invalid register alt name index!\");\n";
Craig Topper190ecd52016-01-08 07:06:32 +0000583 for (const Record *R : AltNameIndices) {
Craig Topperbcd3c372017-05-31 21:12:46 +0000584 StringRef AltName = R->getName();
585 O << " case ";
586 if (!Namespace.empty())
587 O << Namespace << "::";
Igor Kudrin2d3faad2019-02-26 12:15:14 +0000588 O << AltName << ":\n";
589 if (R->isValueUnset("FallbackRegAltNameIndex"))
590 O << " assert(*(AsmStrs" << AltName << "+RegAsmOffset" << AltName
591 << "[RegNo-1]) &&\n"
592 << " \"Invalid alt name index for register!\");\n";
593 else {
594 O << " if (!*(AsmStrs" << AltName << "+RegAsmOffset" << AltName
595 << "[RegNo-1]))\n"
596 << " return getRegisterName(RegNo, ";
597 if (!Namespace.empty())
598 O << Namespace << "::";
599 O << R->getValueAsDef("FallbackRegAltNameIndex")->getName() << ");\n";
600 }
601 O << " return AsmStrs" << AltName << "+RegAsmOffset" << AltName
Craig Topperbcd3c372017-05-31 21:12:46 +0000602 << "[RegNo-1];\n";
Owen Andersona84be6c2011-06-27 21:06:21 +0000603 }
Craig Topperba6d83e2014-11-24 02:08:35 +0000604 O << " }\n";
605 } else {
606 O << " assert (*(AsmStrs+RegAsmOffset[RegNo-1]) &&\n"
607 << " \"Invalid alt name index for register!\");\n"
608 << " return AsmStrs+RegAsmOffset[RegNo-1];\n";
Owen Andersona84be6c2011-06-27 21:06:21 +0000609 }
Craig Topperba6d83e2014-11-24 02:08:35 +0000610 O << "}\n";
Chris Lattner06c5eed2009-09-13 20:08:00 +0000611}
612
Bill Wendling7e5771d2011-03-21 08:31:53 +0000613namespace {
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000614
Bill Wendling5d3174c2011-03-21 08:40:31 +0000615// IAPrinter - Holds information about an InstAlias. Two InstAliases match if
616// they both have the same conditionals. In which case, we cannot print out the
617// alias for that pattern.
618class IAPrinter {
Bill Wendling5d3174c2011-03-21 08:40:31 +0000619 std::vector<std::string> Conds;
Tim Northoveree20caa2014-05-12 18:04:06 +0000620 std::map<StringRef, std::pair<int, int>> OpMap;
Tim Northoveree20caa2014-05-12 18:04:06 +0000621
Bill Wendling5d3174c2011-03-21 08:40:31 +0000622 std::string Result;
623 std::string AsmString;
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000624
Bill Wendling5d3174c2011-03-21 08:40:31 +0000625public:
Benjamin Kramer82de7d32016-05-27 14:27:24 +0000626 IAPrinter(std::string R, std::string AS)
627 : Result(std::move(R)), AsmString(std::move(AS)) {}
Bill Wendling5d3174c2011-03-21 08:40:31 +0000628
629 void addCond(const std::string &C) { Conds.push_back(C); }
Bill Wendling5d3174c2011-03-21 08:40:31 +0000630
Tim Northoveree20caa2014-05-12 18:04:06 +0000631 void addOperand(StringRef Op, int OpIdx, int PrintMethodIdx = -1) {
632 assert(OpIdx >= 0 && OpIdx < 0xFE && "Idx out of range");
Tim Northover0ee9e7e2014-05-13 09:37:41 +0000633 assert(PrintMethodIdx >= -1 && PrintMethodIdx < 0xFF &&
Jay Foadb3590512014-05-13 08:26:53 +0000634 "Idx out of range");
Tim Northoveree20caa2014-05-12 18:04:06 +0000635 OpMap[Op] = std::make_pair(OpIdx, PrintMethodIdx);
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000636 }
Tim Northoveree20caa2014-05-12 18:04:06 +0000637
Bill Wendling5d3174c2011-03-21 08:40:31 +0000638 bool isOpMapped(StringRef Op) { return OpMap.find(Op) != OpMap.end(); }
Tim Northoveree20caa2014-05-12 18:04:06 +0000639 int getOpIndex(StringRef Op) { return OpMap[Op].first; }
640 std::pair<int, int> &getOpData(StringRef Op) { return OpMap[Op]; }
Bill Wendling5d3174c2011-03-21 08:40:31 +0000641
Tim Northoverd8d65a62014-05-15 11:16:32 +0000642 std::pair<StringRef, StringRef::iterator> parseName(StringRef::iterator Start,
643 StringRef::iterator End) {
644 StringRef::iterator I = Start;
Evgeny Astigeevichb42003d2014-12-16 18:16:17 +0000645 StringRef::iterator Next;
Tim Northoverd8d65a62014-05-15 11:16:32 +0000646 if (*I == '{') {
647 // ${some_name}
648 Start = ++I;
649 while (I != End && *I != '}')
650 ++I;
Evgeny Astigeevichb42003d2014-12-16 18:16:17 +0000651 Next = I;
652 // eat the final '}'
653 if (Next != End)
654 ++Next;
Tim Northoverd8d65a62014-05-15 11:16:32 +0000655 } else {
656 // $name, just eat the usual suspects.
657 while (I != End &&
658 ((*I >= 'a' && *I <= 'z') || (*I >= 'A' && *I <= 'Z') ||
659 (*I >= '0' && *I <= '9') || *I == '_'))
660 ++I;
Evgeny Astigeevichb42003d2014-12-16 18:16:17 +0000661 Next = I;
Tim Northoverd8d65a62014-05-15 11:16:32 +0000662 }
663
Evgeny Astigeevichb42003d2014-12-16 18:16:17 +0000664 return std::make_pair(StringRef(Start, I - Start), Next);
Tim Northoverd8d65a62014-05-15 11:16:32 +0000665 }
666
Evan Cheng4d806e22011-07-06 02:02:33 +0000667 void print(raw_ostream &O) {
Sjoerd Meijer84e2f692016-06-03 13:14:19 +0000668 if (Conds.empty()) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000669 O.indent(6) << "return true;\n";
Evan Cheng4d806e22011-07-06 02:02:33 +0000670 return;
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000671 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000672
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000673 O << "if (";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000674
675 for (std::vector<std::string>::iterator
676 I = Conds.begin(), E = Conds.end(); I != E; ++I) {
677 if (I != Conds.begin()) {
678 O << " &&\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000679 O.indent(8);
Bill Wendling5d3174c2011-03-21 08:40:31 +0000680 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000681
Bill Wendling5d3174c2011-03-21 08:40:31 +0000682 O << *I;
683 }
684
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000685 O << ") {\n";
686 O.indent(6) << "// " << Result << "\n";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000687
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000688 // Directly mangle mapped operands into the string. Each operand is
689 // identified by a '$' sign followed by a byte identifying the number of the
690 // operand. We add one to the index to avoid zero bytes.
Tim Northoverd8d65a62014-05-15 11:16:32 +0000691 StringRef ASM(AsmString);
692 SmallString<128> OutString;
693 raw_svector_ostream OS(OutString);
694 for (StringRef::iterator I = ASM.begin(), E = ASM.end(); I != E;) {
695 OS << *I;
696 if (*I == '$') {
697 StringRef Name;
698 std::tie(Name, I) = parseName(++I, E);
699 assert(isOpMapped(Name) && "Unmapped operand!");
Tim Northoveree20caa2014-05-12 18:04:06 +0000700
Tim Northoverd8d65a62014-05-15 11:16:32 +0000701 int OpIndex, PrintIndex;
702 std::tie(OpIndex, PrintIndex) = getOpData(Name);
703 if (PrintIndex == -1) {
704 // Can use the default printOperand route.
705 OS << format("\\x%02X", (unsigned char)OpIndex + 1);
706 } else
707 // 3 bytes if a PrintMethod is needed: 0xFF, the MCInst operand
708 // number, and which of our pre-detected Methods to call.
709 OS << format("\\xFF\\x%02X\\x%02X", OpIndex + 1, PrintIndex + 1);
710 } else {
711 ++I;
Benjamin Kramer17c17bc2013-09-11 15:42:16 +0000712 }
713 }
714
715 // Emit the string.
Yaron Keren09fb7c62015-03-10 07:33:23 +0000716 O.indent(6) << "AsmString = \"" << OutString << "\";\n";
Bill Wendling5d3174c2011-03-21 08:40:31 +0000717
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000718 O.indent(6) << "break;\n";
719 O.indent(4) << '}';
Bill Wendling5d3174c2011-03-21 08:40:31 +0000720 }
721
David Blaikie4ab57cd2015-08-06 19:23:33 +0000722 bool operator==(const IAPrinter &RHS) const {
Bill Wendling5d3174c2011-03-21 08:40:31 +0000723 if (Conds.size() != RHS.Conds.size())
724 return false;
725
726 unsigned Idx = 0;
David Blaikie4ab57cd2015-08-06 19:23:33 +0000727 for (const auto &str : Conds)
728 if (str != RHS.Conds[Idx++])
Bill Wendling5d3174c2011-03-21 08:40:31 +0000729 return false;
730
731 return true;
732 }
Bill Wendling5d3174c2011-03-21 08:40:31 +0000733};
734
Bill Wendling7e5771d2011-03-21 08:31:53 +0000735} // end anonymous namespace
736
Tim Northover5896b062014-05-16 09:42:04 +0000737static unsigned CountNumOperands(StringRef AsmString, unsigned Variant) {
Tim Northover5896b062014-05-16 09:42:04 +0000738 return AsmString.count(' ') + AsmString.count('\t');
Bill Wendling36c0c6d2011-06-15 04:31:19 +0000739}
Bill Wendlinge7124492011-06-14 03:17:20 +0000740
Tim Northover9a24f882014-05-20 09:17:16 +0000741namespace {
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000742
Tim Northover9a24f882014-05-20 09:17:16 +0000743struct AliasPriorityComparator {
David Blaikie4ab57cd2015-08-06 19:23:33 +0000744 typedef std::pair<CodeGenInstAlias, int> ValueType;
Eric Fiselieraa54e502016-12-27 23:15:58 +0000745 bool operator()(const ValueType &LHS, const ValueType &RHS) const {
Tim Northover9a24f882014-05-20 09:17:16 +0000746 if (LHS.second == RHS.second) {
747 // We don't actually care about the order, but for consistency it
748 // shouldn't depend on pointer comparisons.
Quentin Colombet21136c02017-02-10 02:43:09 +0000749 return LessRecordByID()(LHS.first.TheDef, RHS.first.TheDef);
Tim Northover9a24f882014-05-20 09:17:16 +0000750 }
751
752 // Aliases with larger priorities should be considered first.
753 return LHS.second > RHS.second;
754 }
755};
Tim Northover9a24f882014-05-20 09:17:16 +0000756
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000757} // end anonymous namespace
Tim Northover9a24f882014-05-20 09:17:16 +0000758
Bill Wendling7e5771d2011-03-21 08:31:53 +0000759void AsmWriterEmitter::EmitPrintAliasInstruction(raw_ostream &O) {
Bill Wendling7e5771d2011-03-21 08:31:53 +0000760 Record *AsmWriter = Target.getAsmWriter();
761
762 O << "\n#ifdef PRINT_ALIAS_INSTR\n";
763 O << "#undef PRINT_ALIAS_INSTR\n\n";
764
Tim Northoveree20caa2014-05-12 18:04:06 +0000765 //////////////////////////////
766 // Gather information about aliases we need to print
767 //////////////////////////////
768
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000769 // Emit the method that prints the alias instruction.
Craig Topperbcd3c372017-05-31 21:12:46 +0000770 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
Tim Northover9a24f882014-05-20 09:17:16 +0000771 unsigned Variant = AsmWriter->getValueAsInt("Variant");
Craig Topperc24a4012016-01-14 06:15:07 +0000772 bool PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000773
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000774 std::vector<Record*> AllInstAliases =
775 Records.getAllDerivedDefinitions("InstAlias");
776
777 // Create a map from the qualified name to a list of potential matches.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000778 typedef std::set<std::pair<CodeGenInstAlias, int>, AliasPriorityComparator>
Tim Northover9a24f882014-05-20 09:17:16 +0000779 AliasWithPriority;
780 std::map<std::string, AliasWithPriority> AliasMap;
Craig Topper190ecd52016-01-08 07:06:32 +0000781 for (Record *R : AllInstAliases) {
Tim Northover9a24f882014-05-20 09:17:16 +0000782 int Priority = R->getValueAsInt("EmitPriority");
783 if (Priority < 1)
784 continue; // Aliases with priority 0 are never emitted.
785
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000786 const DagInit *DI = R->getValueAsDag("ResultInst");
Daniel Sanders4b7cabf2019-10-08 18:41:32 +0000787 AliasMap[getQualifiedName(DI->getOperatorAsDef(R->getLoc()))].insert(
Craig Topper2be74392018-06-18 01:28:01 +0000788 std::make_pair(CodeGenInstAlias(R, Target), Priority));
Bill Wendling31ca7ef2011-02-26 03:09:12 +0000789 }
790
Bill Wendling7e570b52011-03-21 08:59:17 +0000791 // A map of which conditions need to be met for each instruction operand
792 // before it can be matched to the mnemonic.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000793 std::map<std::string, std::vector<IAPrinter>> IAPrinterMap;
Bill Wendling7e570b52011-03-21 08:59:17 +0000794
Craig Topper674d2382016-01-22 05:59:43 +0000795 std::vector<std::string> PrintMethods;
796
Artyom Skrobov6c8682e2014-06-10 13:11:35 +0000797 // A list of MCOperandPredicates for all operands in use, and the reverse map
798 std::vector<const Record*> MCOpPredicates;
799 DenseMap<const Record*, unsigned> MCOpPredicateMap;
800
Tim Northover9a24f882014-05-20 09:17:16 +0000801 for (auto &Aliases : AliasMap) {
802 for (auto &Alias : Aliases.second) {
David Blaikie4ab57cd2015-08-06 19:23:33 +0000803 const CodeGenInstAlias &CGA = Alias.first;
804 unsigned LastOpNo = CGA.ResultInstOperandIndex.size();
Craig Topper2be74392018-06-18 01:28:01 +0000805 std::string FlatInstAsmString =
806 CodeGenInstruction::FlattenAsmStringVariants(CGA.ResultInst->AsmString,
807 Variant);
808 unsigned NumResultOps = CountNumOperands(FlatInstAsmString, Variant);
809
810 std::string FlatAliasAsmString =
811 CodeGenInstruction::FlattenAsmStringVariants(CGA.AsmString,
812 Variant);
Bill Wendlinge7124492011-06-14 03:17:20 +0000813
814 // Don't emit the alias if it has more operands than what it's aliasing.
Craig Topper2be74392018-06-18 01:28:01 +0000815 if (NumResultOps < CountNumOperands(FlatAliasAsmString, Variant))
Bill Wendlinge7124492011-06-14 03:17:20 +0000816 continue;
817
Craig Topper2be74392018-06-18 01:28:01 +0000818 IAPrinter IAP(CGA.Result->getAsString(), FlatAliasAsmString);
Bill Wendling7e570b52011-03-21 08:59:17 +0000819
Craig Topperbcd3c372017-05-31 21:12:46 +0000820 StringRef Namespace = Target.getName();
Sjoerd Meijer84e2f692016-06-03 13:14:19 +0000821 std::vector<Record *> ReqFeatures;
822 if (PassSubtarget) {
823 // We only consider ReqFeatures predicates if PassSubtarget
824 std::vector<Record *> RF =
825 CGA.TheDef->getValueAsListOfDefs("Predicates");
Sanjoy Das90208722017-02-21 00:38:44 +0000826 copy_if(RF, std::back_inserter(ReqFeatures), [](Record *R) {
827 return R->getValueAsBit("AssemblerMatcherPredicate");
828 });
Sjoerd Meijer84e2f692016-06-03 13:14:19 +0000829 }
830
Tim Northover60091cf2014-05-15 13:36:01 +0000831 unsigned NumMIOps = 0;
Sander de Smalen0c5a29b2017-11-20 14:36:40 +0000832 for (auto &ResultInstOpnd : CGA.ResultInst->Operands)
833 NumMIOps += ResultInstOpnd.MINumOperands;
Tim Northover60091cf2014-05-15 13:36:01 +0000834
Bill Wendling7e570b52011-03-21 08:59:17 +0000835 std::string Cond;
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000836 Cond = std::string("MI->getNumOperands() == ") + utostr(NumMIOps);
David Blaikie4ab57cd2015-08-06 19:23:33 +0000837 IAP.addCond(Cond);
Bill Wendling7e570b52011-03-21 08:59:17 +0000838
Bill Wendling7e570b52011-03-21 08:59:17 +0000839 bool CantHandle = false;
840
Tim Northover60091cf2014-05-15 13:36:01 +0000841 unsigned MIOpNum = 0;
Bill Wendling7e570b52011-03-21 08:59:17 +0000842 for (unsigned i = 0, e = LastOpNo; i != e; ++i) {
Sander de Smalen0c5a29b2017-11-20 14:36:40 +0000843 // Skip over tied operands as they're not part of an alias declaration.
844 auto &Operands = CGA.ResultInst->Operands;
Simon Tatham80391d62018-12-14 11:39:55 +0000845 while (true) {
846 unsigned OpNum = Operands.getSubOperandNumber(MIOpNum).first;
847 if (Operands[OpNum].MINumOperands == 1 &&
848 Operands[OpNum].getTiedRegister() != -1) {
849 // Tied operands of different RegisterClass should be explicit within
850 // an instruction's syntax and so cannot be skipped.
851 int TiedOpNum = Operands[OpNum].getTiedRegister();
852 if (Operands[OpNum].Rec->getName() ==
853 Operands[TiedOpNum].Rec->getName()) {
854 ++MIOpNum;
855 continue;
856 }
857 }
858 break;
Sander de Smalen0c5a29b2017-11-20 14:36:40 +0000859 }
860
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000861 std::string Op = "MI->getOperand(" + utostr(MIOpNum) + ")";
Artyom Skrobovaf3c20f2014-06-10 12:47:23 +0000862
David Blaikie4ab57cd2015-08-06 19:23:33 +0000863 const CodeGenInstAlias::ResultOperand &RO = CGA.ResultOperands[i];
Bill Wendling7e570b52011-03-21 08:59:17 +0000864
865 switch (RO.Kind) {
Bill Wendling7e570b52011-03-21 08:59:17 +0000866 case CodeGenInstAlias::ResultOperand::K_Record: {
867 const Record *Rec = RO.getRecord();
868 StringRef ROName = RO.getName();
Tim Northoveree20caa2014-05-12 18:04:06 +0000869 int PrintMethodIdx = -1;
Bill Wendling7e570b52011-03-21 08:59:17 +0000870
Tim Northoveree20caa2014-05-12 18:04:06 +0000871 // These two may have a PrintMethod, which we want to record (if it's
872 // the first time we've seen it) and provide an index for the aliasing
873 // code to use.
874 if (Rec->isSubClassOf("RegisterOperand") ||
875 Rec->isSubClassOf("Operand")) {
Craig Topperbcd3c372017-05-31 21:12:46 +0000876 StringRef PrintMethod = Rec->getValueAsString("PrintMethod");
Tim Northoveree20caa2014-05-12 18:04:06 +0000877 if (PrintMethod != "" && PrintMethod != "printOperand") {
David Majnemer42531262016-08-12 03:55:06 +0000878 PrintMethodIdx =
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000879 llvm::find(PrintMethods, PrintMethod) - PrintMethods.begin();
Tim Northoveree20caa2014-05-12 18:04:06 +0000880 if (static_cast<unsigned>(PrintMethodIdx) == PrintMethods.size())
881 PrintMethods.push_back(PrintMethod);
882 }
883 }
Owen Andersona84be6c2011-06-27 21:06:21 +0000884
885 if (Rec->isSubClassOf("RegisterOperand"))
886 Rec = Rec->getValueAsDef("RegClass");
Bill Wendling7e570b52011-03-21 08:59:17 +0000887 if (Rec->isSubClassOf("RegisterClass")) {
David Blaikie4ab57cd2015-08-06 19:23:33 +0000888 IAP.addCond(Op + ".isReg()");
Bill Wendling7e570b52011-03-21 08:59:17 +0000889
David Blaikie4ab57cd2015-08-06 19:23:33 +0000890 if (!IAP.isOpMapped(ROName)) {
891 IAP.addOperand(ROName, MIOpNum, PrintMethodIdx);
892 Record *R = CGA.ResultOperands[i].getRecord();
Jack Carter9c1a0272013-02-05 08:32:10 +0000893 if (R->isSubClassOf("RegisterOperand"))
894 R = R->getValueAsDef("RegClass");
Matthias Braun4a86d452016-12-04 05:48:16 +0000895 Cond = std::string("MRI.getRegClass(") + Target.getName().str() +
896 "::" + R->getName().str() + "RegClassID).contains(" + Op +
897 ".getReg())";
Bill Wendling7e570b52011-03-21 08:59:17 +0000898 } else {
Artyom Skrobovaf3c20f2014-06-10 12:47:23 +0000899 Cond = Op + ".getReg() == MI->getOperand(" +
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000900 utostr(IAP.getOpIndex(ROName)) + ").getReg()";
Bill Wendling7e570b52011-03-21 08:59:17 +0000901 }
902 } else {
Tim Northoveree20caa2014-05-12 18:04:06 +0000903 // Assume all printable operands are desired for now. This can be
Alp Tokerbeaca192014-05-15 01:52:21 +0000904 // overridden in the InstAlias instantiation if necessary.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000905 IAP.addOperand(ROName, MIOpNum, PrintMethodIdx);
Bill Wendling7e570b52011-03-21 08:59:17 +0000906
Artyom Skrobov6c8682e2014-06-10 13:11:35 +0000907 // There might be an additional predicate on the MCOperand
908 unsigned Entry = MCOpPredicateMap[Rec];
909 if (!Entry) {
910 if (!Rec->isValueUnset("MCOperandPredicate")) {
911 MCOpPredicates.push_back(Rec);
912 Entry = MCOpPredicates.size();
913 MCOpPredicateMap[Rec] = Entry;
914 } else
915 break; // No conditions on this operand at all
916 }
Craig Topperbcd3c372017-05-31 21:12:46 +0000917 Cond = (Target.getName() + ClassName + "ValidateMCOperand(" + Op +
918 ", STI, " + utostr(Entry) + ")")
919 .str();
Artyom Skrobov6c8682e2014-06-10 13:11:35 +0000920 }
921 // for all subcases of ResultOperand::K_Record:
David Blaikie4ab57cd2015-08-06 19:23:33 +0000922 IAP.addCond(Cond);
Bill Wendling7e570b52011-03-21 08:59:17 +0000923 break;
924 }
Tim Northoverab7689e2013-01-09 13:32:04 +0000925 case CodeGenInstAlias::ResultOperand::K_Imm: {
Tim Northoverab7689e2013-01-09 13:32:04 +0000926 // Just because the alias has an immediate result, doesn't mean the
927 // MCInst will. An MCExpr could be present, for example.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000928 IAP.addCond(Op + ".isImm()");
Tim Northoverab7689e2013-01-09 13:32:04 +0000929
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +0000930 Cond = Op + ".getImm() == " + itostr(CGA.ResultOperands[i].getImm());
David Blaikie4ab57cd2015-08-06 19:23:33 +0000931 IAP.addCond(Cond);
Bill Wendling7e570b52011-03-21 08:59:17 +0000932 break;
Tim Northoverab7689e2013-01-09 13:32:04 +0000933 }
Bill Wendling7e570b52011-03-21 08:59:17 +0000934 case CodeGenInstAlias::ResultOperand::K_Reg:
Jim Grosbach29cdcda2011-11-15 01:46:57 +0000935 // If this is zero_reg, something's playing tricks we're not
936 // equipped to handle.
David Blaikie4ab57cd2015-08-06 19:23:33 +0000937 if (!CGA.ResultOperands[i].getRegister()) {
Jim Grosbach29cdcda2011-11-15 01:46:57 +0000938 CantHandle = true;
939 break;
940 }
941
Matthias Braun4a86d452016-12-04 05:48:16 +0000942 Cond = Op + ".getReg() == " + Target.getName().str() + "::" +
943 CGA.ResultOperands[i].getRegister()->getName().str();
David Blaikie4ab57cd2015-08-06 19:23:33 +0000944 IAP.addCond(Cond);
Bill Wendling7e570b52011-03-21 08:59:17 +0000945 break;
946 }
947
Tim Northover60091cf2014-05-15 13:36:01 +0000948 MIOpNum += RO.getMINumOperands();
Bill Wendling7e570b52011-03-21 08:59:17 +0000949 }
950
951 if (CantHandle) continue;
Sjoerd Meijer84e2f692016-06-03 13:14:19 +0000952
953 for (auto I = ReqFeatures.cbegin(); I != ReqFeatures.cend(); I++) {
954 Record *R = *I;
Craig Topperbcd3c372017-05-31 21:12:46 +0000955 StringRef AsmCondString = R->getValueAsString("AssemblerCondString");
Sjoerd Meijer84e2f692016-06-03 13:14:19 +0000956
957 // AsmCondString has syntax [!]F(,[!]F)*
958 SmallVector<StringRef, 4> Ops;
959 SplitString(AsmCondString, Ops, ",");
960 assert(!Ops.empty() && "AssemblerCondString cannot be empty");
961
962 for (auto &Op : Ops) {
963 assert(!Op.empty() && "Empty operator");
964 if (Op[0] == '!')
Craig Topperbcd3c372017-05-31 21:12:46 +0000965 Cond = ("!STI.getFeatureBits()[" + Namespace + "::" + Op.substr(1) +
966 "]")
967 .str();
Sjoerd Meijer84e2f692016-06-03 13:14:19 +0000968 else
Craig Topperbcd3c372017-05-31 21:12:46 +0000969 Cond =
970 ("STI.getFeatureBits()[" + Namespace + "::" + Op + "]").str();
Sjoerd Meijer84e2f692016-06-03 13:14:19 +0000971 IAP.addCond(Cond);
972 }
973 }
974
David Blaikie4ab57cd2015-08-06 19:23:33 +0000975 IAPrinterMap[Aliases.first].push_back(std::move(IAP));
Bill Wendling7e570b52011-03-21 08:59:17 +0000976 }
977 }
978
Tim Northoveree20caa2014-05-12 18:04:06 +0000979 //////////////////////////////
980 // Write out the printAliasInstr function
981 //////////////////////////////
982
Bill Wendlingf5199de2011-05-23 00:18:33 +0000983 std::string Header;
984 raw_string_ostream HeaderO(Header);
985
986 HeaderO << "bool " << Target.getName() << ClassName
Bill Wendlinge7124492011-06-14 03:17:20 +0000987 << "::printAliasInstr(const MCInst"
Akira Hatanakab46d0232015-03-27 20:36:02 +0000988 << " *MI, " << (PassSubtarget ? "const MCSubtargetInfo &STI, " : "")
989 << "raw_ostream &OS) {\n";
Bill Wendling7e570b52011-03-21 08:59:17 +0000990
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000991 std::string Cases;
992 raw_string_ostream CasesO(Cases);
993
David Blaikie4ab57cd2015-08-06 19:23:33 +0000994 for (auto &Entry : IAPrinterMap) {
995 std::vector<IAPrinter> &IAPs = Entry.second;
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000996 std::vector<IAPrinter*> UniqueIAPs;
997
David Blaikie4ab57cd2015-08-06 19:23:33 +0000998 for (auto &LHS : IAPs) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +0000999 bool IsDup = false;
David Blaikie4ab57cd2015-08-06 19:23:33 +00001000 for (const auto &RHS : IAPs) {
1001 if (&LHS != &RHS && LHS == RHS) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001002 IsDup = true;
1003 break;
1004 }
1005 }
1006
David Blaikie4ab57cd2015-08-06 19:23:33 +00001007 if (!IsDup)
1008 UniqueIAPs.push_back(&LHS);
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001009 }
1010
1011 if (UniqueIAPs.empty()) continue;
1012
David Blaikie4ab57cd2015-08-06 19:23:33 +00001013 CasesO.indent(2) << "case " << Entry.first << ":\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001014
Craig Topper190ecd52016-01-08 07:06:32 +00001015 for (IAPrinter *IAP : UniqueIAPs) {
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001016 CasesO.indent(4);
Evan Cheng4d806e22011-07-06 02:02:33 +00001017 IAP->print(CasesO);
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001018 CasesO << '\n';
1019 }
1020
Eric Christopher2e3fbaa2011-04-18 21:28:11 +00001021 CasesO.indent(4) << "return false;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001022 }
1023
Bill Wendlinge7124492011-06-14 03:17:20 +00001024 if (CasesO.str().empty()) {
Bill Wendlingf5199de2011-05-23 00:18:33 +00001025 O << HeaderO.str();
Eric Christopher2e3fbaa2011-04-18 21:28:11 +00001026 O << " return false;\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001027 O << "}\n\n";
1028 O << "#endif // PRINT_ALIAS_INSTR\n";
1029 return;
1030 }
1031
Alexander Kornienko8c0809c2015-01-15 11:41:30 +00001032 if (!MCOpPredicates.empty())
Artyom Skrobov6c8682e2014-06-10 13:11:35 +00001033 O << "static bool " << Target.getName() << ClassName
Oliver Stannarda34e4702015-12-01 10:48:51 +00001034 << "ValidateMCOperand(const MCOperand &MCOp,\n"
1035 << " const MCSubtargetInfo &STI,\n"
1036 << " unsigned PredicateIndex);\n";
Artyom Skrobov6c8682e2014-06-10 13:11:35 +00001037
Bill Wendlingf5199de2011-05-23 00:18:33 +00001038 O << HeaderO.str();
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001039 O.indent(2) << "const char *AsmString;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001040 O.indent(2) << "switch (MI->getOpcode()) {\n";
Eric Christopher2e3fbaa2011-04-18 21:28:11 +00001041 O.indent(2) << "default: return false;\n";
Bill Wendlingbc3f7902011-04-07 21:20:06 +00001042 O << CasesO.str();
1043 O.indent(2) << "}\n\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001044
1045 // Code that prints the alias, replacing the operands with the ones from the
1046 // MCInst.
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001047 O << " unsigned I = 0;\n";
Sjoerd Meijer3c2f7852016-06-03 13:17:37 +00001048 O << " while (AsmString[I] != ' ' && AsmString[I] != '\\t' &&\n";
1049 O << " AsmString[I] != '$' && AsmString[I] != '\\0')\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001050 O << " ++I;\n";
1051 O << " OS << '\\t' << StringRef(AsmString, I);\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001052
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001053 O << " if (AsmString[I] != '\\0') {\n";
Petar Jovanovicbd57b8b2017-11-13 18:00:24 +00001054 O << " if (AsmString[I] == ' ' || AsmString[I] == '\\t') {\n";
Sjoerd Meijer3c2f7852016-06-03 13:17:37 +00001055 O << " OS << '\\t';\n";
Petar Jovanovicbd57b8b2017-11-13 18:00:24 +00001056 O << " ++I;\n";
1057 O << " }\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001058 O << " do {\n";
1059 O << " if (AsmString[I] == '$') {\n";
1060 O << " ++I;\n";
Tim Northoveree20caa2014-05-12 18:04:06 +00001061 O << " if (AsmString[I] == (char)0xff) {\n";
1062 O << " ++I;\n";
1063 O << " int OpIdx = AsmString[I++] - 1;\n";
1064 O << " int PrintMethodIdx = AsmString[I++] - 1;\n";
Akira Hatanakab46d0232015-03-27 20:36:02 +00001065 O << " printCustomAliasOperand(MI, OpIdx, PrintMethodIdx, ";
1066 O << (PassSubtarget ? "STI, " : "");
1067 O << "OS);\n";
Tim Northoveree20caa2014-05-12 18:04:06 +00001068 O << " } else\n";
Akira Hatanakab46d0232015-03-27 20:36:02 +00001069 O << " printOperand(MI, unsigned(AsmString[I++]) - 1, ";
1070 O << (PassSubtarget ? "STI, " : "");
1071 O << "OS);\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001072 O << " } else {\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001073 O << " OS << AsmString[I++];\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001074 O << " }\n";
Benjamin Kramer17c17bc2013-09-11 15:42:16 +00001075 O << " } while (AsmString[I] != '\\0');\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001076 O << " }\n\n";
Jim Grosbachf4e67082012-04-18 18:56:33 +00001077
Eric Christopher2e3fbaa2011-04-18 21:28:11 +00001078 O << " return true;\n";
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001079 O << "}\n\n";
1080
Tim Northoveree20caa2014-05-12 18:04:06 +00001081 //////////////////////////////
1082 // Write out the printCustomAliasOperand function
1083 //////////////////////////////
1084
1085 O << "void " << Target.getName() << ClassName << "::"
1086 << "printCustomAliasOperand(\n"
1087 << " const MCInst *MI, unsigned OpIdx,\n"
Akira Hatanakab46d0232015-03-27 20:36:02 +00001088 << " unsigned PrintMethodIdx,\n"
1089 << (PassSubtarget ? " const MCSubtargetInfo &STI,\n" : "")
1090 << " raw_ostream &OS) {\n";
Aaron Ballmane58a5702014-05-13 12:52:35 +00001091 if (PrintMethods.empty())
1092 O << " llvm_unreachable(\"Unknown PrintMethod kind\");\n";
1093 else {
1094 O << " switch (PrintMethodIdx) {\n"
1095 << " default:\n"
1096 << " llvm_unreachable(\"Unknown PrintMethod kind\");\n"
Tim Northoveree20caa2014-05-12 18:04:06 +00001097 << " break;\n";
Tim Northoveree20caa2014-05-12 18:04:06 +00001098
Aaron Ballmane58a5702014-05-13 12:52:35 +00001099 for (unsigned i = 0; i < PrintMethods.size(); ++i) {
1100 O << " case " << i << ":\n"
Akira Hatanakab46d0232015-03-27 20:36:02 +00001101 << " " << PrintMethods[i] << "(MI, OpIdx, "
1102 << (PassSubtarget ? "STI, " : "") << "OS);\n"
Aaron Ballmane58a5702014-05-13 12:52:35 +00001103 << " break;\n";
1104 }
1105 O << " }\n";
1106 }
1107 O << "}\n\n";
Tim Northoveree20caa2014-05-12 18:04:06 +00001108
Alexander Kornienko8c0809c2015-01-15 11:41:30 +00001109 if (!MCOpPredicates.empty()) {
Artyom Skrobov6c8682e2014-06-10 13:11:35 +00001110 O << "static bool " << Target.getName() << ClassName
Oliver Stannarda34e4702015-12-01 10:48:51 +00001111 << "ValidateMCOperand(const MCOperand &MCOp,\n"
1112 << " const MCSubtargetInfo &STI,\n"
1113 << " unsigned PredicateIndex) {\n"
Artyom Skrobov6c8682e2014-06-10 13:11:35 +00001114 << " switch (PredicateIndex) {\n"
1115 << " default:\n"
1116 << " llvm_unreachable(\"Unknown MCOperandPredicate kind\");\n"
1117 << " break;\n";
1118
1119 for (unsigned i = 0; i < MCOpPredicates.size(); ++i) {
1120 Init *MCOpPred = MCOpPredicates[i]->getValueInit("MCOperandPredicate");
Tim Northover88403d72016-07-05 21:22:55 +00001121 if (CodeInit *SI = dyn_cast<CodeInit>(MCOpPred)) {
Artyom Skrobov6c8682e2014-06-10 13:11:35 +00001122 O << " case " << i + 1 << ": {\n"
1123 << SI->getValue() << "\n"
1124 << " }\n";
1125 } else
1126 llvm_unreachable("Unexpected MCOperandPredicate field!");
1127 }
1128 O << " }\n"
1129 << "}\n\n";
1130 }
1131
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001132 O << "#endif // PRINT_ALIAS_INSTR\n";
1133}
Chris Lattner06c5eed2009-09-13 20:08:00 +00001134
Ahmed Bougachabd214002013-10-28 18:07:17 +00001135AsmWriterEmitter::AsmWriterEmitter(RecordKeeper &R) : Records(R), Target(R) {
1136 Record *AsmWriter = Target.getAsmWriter();
Craig Topper0bd58742016-01-13 07:20:05 +00001137 unsigned Variant = AsmWriter->getValueAsInt("Variant");
Ahmed Bougachabd214002013-10-28 18:07:17 +00001138
1139 // Get the instruction numbering.
Craig Topperf9265322016-01-17 20:38:14 +00001140 NumberedInstructions = Target.getInstructionsByEnumValue();
Ahmed Bougachabd214002013-10-28 18:07:17 +00001141
Craig Topperf9265322016-01-17 20:38:14 +00001142 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
1143 const CodeGenInstruction *I = NumberedInstructions[i];
Craig Topper9e9ae602016-01-17 08:05:33 +00001144 if (!I->AsmString.empty() && I->TheDef->getName() != "PHI")
1145 Instructions.emplace_back(*I, i, Variant);
1146 }
Ahmed Bougachabd214002013-10-28 18:07:17 +00001147}
1148
Chris Lattner06c5eed2009-09-13 20:08:00 +00001149void AsmWriterEmitter::run(raw_ostream &O) {
Chris Lattner06c5eed2009-09-13 20:08:00 +00001150 EmitPrintInstruction(O);
1151 EmitGetRegisterName(O);
Bill Wendling31ca7ef2011-02-26 03:09:12 +00001152 EmitPrintAliasInstruction(O);
Chris Lattner06c5eed2009-09-13 20:08:00 +00001153}
1154
Jakob Stoklund Olesene6aed132012-06-11 15:37:55 +00001155namespace llvm {
1156
1157void EmitAsmWriter(RecordKeeper &RK, raw_ostream &OS) {
1158 emitSourceFileHeader("Assembly Writer Source Fragment", OS);
1159 AsmWriterEmitter(RK).run(OS);
1160}
1161
Eugene Zelenkoa3fe70d2016-11-30 17:48:10 +00001162} // end namespace llvm