blob: a8f191181766b35909fd0bb4d9708a8371c45a26 [file] [log] [blame]
Chris Lattner2e1f51b2004-08-01 05:59:33 +00001//===- AsmWriterEmitter.cpp - Generate an assembly writer -----------------===//
Misha Brukman3da94ae2005-04-22 00:00:37 +00002//
Chris Lattner2e1f51b2004-08-01 05:59:33 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattner30609102007-12-29 20:37:13 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukman3da94ae2005-04-22 00:00:37 +00007//
Chris Lattner2e1f51b2004-08-01 05:59:33 +00008//===----------------------------------------------------------------------===//
9//
Xinliang David Li2c17b9c2016-02-23 19:18:21 +000010// This tablegen backend emits an assembly printer for the current target.
Chris Lattner2e1f51b2004-08-01 05:59:33 +000011// Note that this is currently fairly skeletal, but will grow over time.
12//
13//===----------------------------------------------------------------------===//
14
Sean Callanand32c02f2010-02-09 21:50:41 +000015#include "AsmWriterInst.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000016#include "CodeGenInstruction.h"
17#include "CodeGenRegisters.h"
Chris Lattner2e1f51b2004-08-01 05:59:33 +000018#include "CodeGenTarget.h"
Jakob Stoklund Olesenc19f72b2012-03-30 21:12:52 +000019#include "SequenceToOffsetTable.h"
Daniel Sanders90085b52016-11-19 12:21:34 +000020#include "Types.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000021#include "llvm/ADT/ArrayRef.h"
22#include "llvm/ADT/DenseMap.h"
Benjamin Kramer7259f142014-04-29 23:26:49 +000023#include "llvm/ADT/SmallString.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000024#include "llvm/ADT/SmallVector.h"
25#include "llvm/ADT/STLExtras.h"
Craig Topperf5535872012-07-27 06:44:02 +000026#include "llvm/ADT/StringExtras.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000027#include "llvm/ADT/StringRef.h"
Owen Andersonbea6f612011-06-27 21:06:21 +000028#include "llvm/ADT/Twine.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000029#include "llvm/Support/Casting.h"
Chris Lattnerbdff5f92006-07-18 17:18:03 +000030#include "llvm/Support/Debug.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000031#include "llvm/Support/ErrorHandling.h"
Benjamin Kramer209a8c82013-09-11 15:42:16 +000032#include "llvm/Support/Format.h"
Chris Lattnerbdff5f92006-07-18 17:18:03 +000033#include "llvm/Support/MathExtras.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000034#include "llvm/Support/raw_ostream.h"
Peter Collingbourne7c788882011-10-01 16:41:13 +000035#include "llvm/TableGen/Error.h"
36#include "llvm/TableGen/Record.h"
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000037#include "llvm/TableGen/TableGenBackend.h"
Jeff Cohen615ed992005-01-22 18:50:10 +000038#include <algorithm>
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000039#include <cassert>
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000040#include <cstddef>
41#include <cstdint>
42#include <deque>
43#include <iterator>
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000044#include <map>
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000045#include <set>
46#include <string>
47#include <tuple>
Benjamin Kramer14aae012016-05-27 14:27:24 +000048#include <utility>
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000049#include <vector>
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000050
Chris Lattner2e1f51b2004-08-01 05:59:33 +000051using namespace llvm;
52
Chandler Carruth283b3992014-04-21 22:55:11 +000053#define DEBUG_TYPE "asm-writer-emitter"
54
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000055namespace {
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000056
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000057class AsmWriterEmitter {
58 RecordKeeper &Records;
Ahmed Bougacha254ce942013-10-28 18:07:17 +000059 CodeGenTarget Target;
Craig Topper3356fb62016-01-17 20:38:14 +000060 ArrayRef<const CodeGenInstruction *> NumberedInstructions;
Ahmed Bougacha254ce942013-10-28 18:07:17 +000061 std::vector<AsmWriterInst> Instructions;
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000062
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000063public:
Ahmed Bougacha254ce942013-10-28 18:07:17 +000064 AsmWriterEmitter(RecordKeeper &R);
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000065
66 void run(raw_ostream &o);
67
68private:
69 void EmitPrintInstruction(raw_ostream &o);
70 void EmitGetRegisterName(raw_ostream &o);
71 void EmitPrintAliasInstruction(raw_ostream &O);
72
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000073 void FindUniqueOperandCommands(std::vector<std::string> &UOC,
Craig Topperaed38efd2016-01-24 07:13:28 +000074 std::vector<std::vector<unsigned>> &InstIdxs,
Craig Topperefefcdd2016-01-14 06:15:07 +000075 std::vector<unsigned> &InstOpsUsed,
76 bool PassSubtarget) const;
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000077};
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000078
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000079} // end anonymous namespace
80
Chris Lattner38c07512005-01-22 20:31:17 +000081static void PrintCases(std::vector<std::pair<std::string,
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000082 AsmWriterOperand>> &OpsToPrint, raw_ostream &O,
Craig Topperefefcdd2016-01-14 06:15:07 +000083 bool PassSubtarget) {
Craig Toppercd0aefe2016-01-13 07:20:13 +000084 O << " case " << OpsToPrint.back().first << ":";
Chris Lattner38c07512005-01-22 20:31:17 +000085 AsmWriterOperand TheOp = OpsToPrint.back().second;
86 OpsToPrint.pop_back();
87
88 // Check to see if any other operands are identical in this list, and if so,
89 // emit a case label for them.
90 for (unsigned i = OpsToPrint.size(); i != 0; --i)
91 if (OpsToPrint[i-1].second == TheOp) {
Craig Toppercd0aefe2016-01-13 07:20:13 +000092 O << "\n case " << OpsToPrint[i-1].first << ":";
Chris Lattner38c07512005-01-22 20:31:17 +000093 OpsToPrint.erase(OpsToPrint.begin()+i-1);
94 }
95
96 // Finally, emit the code.
Craig Topperefefcdd2016-01-14 06:15:07 +000097 O << "\n " << TheOp.getCode(PassSubtarget);
Craig Toppercd0aefe2016-01-13 07:20:13 +000098 O << "\n break;\n";
Chris Lattner38c07512005-01-22 20:31:17 +000099}
100
Chris Lattner870c0162005-01-22 18:38:13 +0000101/// EmitInstructions - Emit the last instruction in the vector and any other
102/// instructions that are suitably similar to it.
103static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
Craig Topperefefcdd2016-01-14 06:15:07 +0000104 raw_ostream &O, bool PassSubtarget) {
Chris Lattner870c0162005-01-22 18:38:13 +0000105 AsmWriterInst FirstInst = Insts.back();
106 Insts.pop_back();
107
108 std::vector<AsmWriterInst> SimilarInsts;
109 unsigned DifferingOperand = ~0;
110 for (unsigned i = Insts.size(); i != 0; --i) {
Chris Lattnerf8766682005-01-22 19:22:23 +0000111 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
112 if (DiffOp != ~1U) {
Chris Lattner870c0162005-01-22 18:38:13 +0000113 if (DifferingOperand == ~0U) // First match!
114 DifferingOperand = DiffOp;
115
116 // If this differs in the same operand as the rest of the instructions in
117 // this class, move it to the SimilarInsts list.
Chris Lattnerf8766682005-01-22 19:22:23 +0000118 if (DifferingOperand == DiffOp || DiffOp == ~0U) {
Chris Lattner870c0162005-01-22 18:38:13 +0000119 SimilarInsts.push_back(Insts[i-1]);
120 Insts.erase(Insts.begin()+i-1);
121 }
122 }
123 }
124
Chris Lattnera1e8a802006-05-01 17:01:17 +0000125 O << " case " << FirstInst.CGI->Namespace << "::"
Chris Lattner870c0162005-01-22 18:38:13 +0000126 << FirstInst.CGI->TheDef->getName() << ":\n";
Craig Topper61614122016-01-08 07:06:32 +0000127 for (const AsmWriterInst &AWI : SimilarInsts)
128 O << " case " << AWI.CGI->Namespace << "::"
129 << AWI.CGI->TheDef->getName() << ":\n";
Chris Lattner870c0162005-01-22 18:38:13 +0000130 for (unsigned i = 0, e = FirstInst.Operands.size(); i != e; ++i) {
131 if (i != DifferingOperand) {
132 // If the operand is the same for all instructions, just print it.
Craig Topperefefcdd2016-01-14 06:15:07 +0000133 O << " " << FirstInst.Operands[i].getCode(PassSubtarget);
Chris Lattner870c0162005-01-22 18:38:13 +0000134 } else {
135 // If this is the operand that varies between all of the instructions,
136 // emit a switch for just this operand now.
137 O << " switch (MI->getOpcode()) {\n";
Craig Toppercd0aefe2016-01-13 07:20:13 +0000138 O << " default: llvm_unreachable(\"Unexpected opcode.\");\n";
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000139 std::vector<std::pair<std::string, AsmWriterOperand>> OpsToPrint;
Craig Topper77eddb72017-07-07 06:22:35 +0000140 OpsToPrint.push_back(std::make_pair(FirstInst.CGI->Namespace.str() + "::" +
Matthias Braun0c517c82016-12-04 05:48:16 +0000141 FirstInst.CGI->TheDef->getName().str(),
Chris Lattner38c07512005-01-22 20:31:17 +0000142 FirstInst.Operands[i]));
Misha Brukman3da94ae2005-04-22 00:00:37 +0000143
Craig Topper61614122016-01-08 07:06:32 +0000144 for (const AsmWriterInst &AWI : SimilarInsts) {
Craig Topper77eddb72017-07-07 06:22:35 +0000145 OpsToPrint.push_back(std::make_pair(AWI.CGI->Namespace.str()+"::" +
Matthias Braun0c517c82016-12-04 05:48:16 +0000146 AWI.CGI->TheDef->getName().str(),
Chris Lattner38c07512005-01-22 20:31:17 +0000147 AWI.Operands[i]));
Chris Lattner870c0162005-01-22 18:38:13 +0000148 }
Chris Lattner38c07512005-01-22 20:31:17 +0000149 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
150 while (!OpsToPrint.empty())
Craig Topperefefcdd2016-01-14 06:15:07 +0000151 PrintCases(OpsToPrint, O, PassSubtarget);
Chris Lattner870c0162005-01-22 18:38:13 +0000152 O << " }";
153 }
154 O << "\n";
155 }
Chris Lattner870c0162005-01-22 18:38:13 +0000156 O << " break;\n";
157}
Chris Lattnerb0b55e72005-01-22 17:32:42 +0000158
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000159void AsmWriterEmitter::
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000160FindUniqueOperandCommands(std::vector<std::string> &UniqueOperandCommands,
Craig Topperaed38efd2016-01-24 07:13:28 +0000161 std::vector<std::vector<unsigned>> &InstIdxs,
Craig Topperefefcdd2016-01-14 06:15:07 +0000162 std::vector<unsigned> &InstOpsUsed,
163 bool PassSubtarget) const {
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000164 // This vector parallels UniqueOperandCommands, keeping track of which
165 // instructions each case are used for. It is a comma separated string of
166 // enums.
167 std::vector<std::string> InstrsForCase;
168 InstrsForCase.resize(UniqueOperandCommands.size());
Chris Lattner96c1ade2006-07-18 18:28:27 +0000169 InstOpsUsed.assign(UniqueOperandCommands.size(), 0);
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000170
Craig Topper73251b72016-01-17 08:05:33 +0000171 for (size_t i = 0, e = Instructions.size(); i != e; ++i) {
172 const AsmWriterInst &Inst = Instructions[i];
173 if (Inst.Operands.empty())
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000174 continue; // Instruction already done.
Chris Lattner191dd1f2006-07-18 17:50:22 +0000175
Craig Topper73251b72016-01-17 08:05:33 +0000176 std::string Command = " "+Inst.Operands[0].getCode(PassSubtarget)+"\n";
Chris Lattner191dd1f2006-07-18 17:50:22 +0000177
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000178 // Check to see if we already have 'Command' in UniqueOperandCommands.
179 // If not, add it.
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000180 auto I = llvm::find(UniqueOperandCommands, Command);
Craig Topper9990e7d2016-01-17 08:05:30 +0000181 if (I != UniqueOperandCommands.end()) {
182 size_t idx = I - UniqueOperandCommands.begin();
Craig Topper9990e7d2016-01-17 08:05:30 +0000183 InstrsForCase[idx] += ", ";
Craig Topper73251b72016-01-17 08:05:33 +0000184 InstrsForCase[idx] += Inst.CGI->TheDef->getName();
Craig Topperaed38efd2016-01-24 07:13:28 +0000185 InstIdxs[idx].push_back(i);
Craig Topper9990e7d2016-01-17 08:05:30 +0000186 } else {
Craig Topperd028f0c2016-01-08 07:06:29 +0000187 UniqueOperandCommands.push_back(std::move(Command));
Craig Topper73251b72016-01-17 08:05:33 +0000188 InstrsForCase.push_back(Inst.CGI->TheDef->getName());
Craig Topperaed38efd2016-01-24 07:13:28 +0000189 InstIdxs.emplace_back();
190 InstIdxs.back().push_back(i);
Chris Lattner96c1ade2006-07-18 18:28:27 +0000191
192 // This command matches one operand so far.
193 InstOpsUsed.push_back(1);
194 }
195 }
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000196
Chris Lattner96c1ade2006-07-18 18:28:27 +0000197 // For each entry of UniqueOperandCommands, there is a set of instructions
198 // that uses it. If the next command of all instructions in the set are
199 // identical, fold it into the command.
Craig Topperaed38efd2016-01-24 07:13:28 +0000200 for (size_t CommandIdx = 0, e = UniqueOperandCommands.size();
Chris Lattner96c1ade2006-07-18 18:28:27 +0000201 CommandIdx != e; ++CommandIdx) {
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000202
Craig Topperaed38efd2016-01-24 07:13:28 +0000203 const auto &Idxs = InstIdxs[CommandIdx];
Chris Lattner96c1ade2006-07-18 18:28:27 +0000204
Craig Topperaed38efd2016-01-24 07:13:28 +0000205 for (unsigned Op = 1; ; ++Op) {
206 // Find the first instruction in the set.
207 const AsmWriterInst &FirstInst = Instructions[Idxs.front()];
Chris Lattner96c1ade2006-07-18 18:28:27 +0000208 // If this instruction has no more operands, we isn't anything to merge
209 // into this command.
Craig Topper73251b72016-01-17 08:05:33 +0000210 if (FirstInst.Operands.size() == Op)
Chris Lattner96c1ade2006-07-18 18:28:27 +0000211 break;
212
213 // Otherwise, scan to see if all of the other instructions in this command
214 // set share the operand.
Craig Topperaed38efd2016-01-24 07:13:28 +0000215 if (std::any_of(Idxs.begin()+1, Idxs.end(),
216 [&](unsigned Idx) {
217 const AsmWriterInst &OtherInst = Instructions[Idx];
218 return OtherInst.Operands.size() == Op ||
219 OtherInst.Operands[Op] != FirstInst.Operands[Op];
220 }))
221 break;
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000222
Chris Lattner96c1ade2006-07-18 18:28:27 +0000223 // Okay, everything in this command set has the same next operand. Add it
224 // to UniqueOperandCommands and remember that it was consumed.
Craig Topperefefcdd2016-01-14 06:15:07 +0000225 std::string Command = " " +
Craig Topper73251b72016-01-17 08:05:33 +0000226 FirstInst.Operands[Op].getCode(PassSubtarget) + "\n";
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000227
Chris Lattner96c1ade2006-07-18 18:28:27 +0000228 UniqueOperandCommands[CommandIdx] += Command;
229 InstOpsUsed[CommandIdx]++;
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000230 }
231 }
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000232
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000233 // Prepend some of the instructions each case is used for onto the case val.
234 for (unsigned i = 0, e = InstrsForCase.size(); i != e; ++i) {
235 std::string Instrs = InstrsForCase[i];
236 if (Instrs.size() > 70) {
237 Instrs.erase(Instrs.begin()+70, Instrs.end());
238 Instrs += "...";
239 }
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000240
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000241 if (!Instrs.empty())
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000242 UniqueOperandCommands[i] = " // " + Instrs + "\n" +
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000243 UniqueOperandCommands[i];
244 }
245}
246
Daniel Dunbar9bd34602009-10-17 20:43:42 +0000247static void UnescapeString(std::string &Str) {
248 for (unsigned i = 0; i != Str.size(); ++i) {
249 if (Str[i] == '\\' && i != Str.size()-1) {
250 switch (Str[i+1]) {
251 default: continue; // Don't execute the code after the switch.
252 case 'a': Str[i] = '\a'; break;
253 case 'b': Str[i] = '\b'; break;
254 case 'e': Str[i] = 27; break;
255 case 'f': Str[i] = '\f'; break;
256 case 'n': Str[i] = '\n'; break;
257 case 'r': Str[i] = '\r'; break;
258 case 't': Str[i] = '\t'; break;
259 case 'v': Str[i] = '\v'; break;
260 case '"': Str[i] = '\"'; break;
261 case '\'': Str[i] = '\''; break;
262 case '\\': Str[i] = '\\'; break;
263 }
264 // Nuke the second character.
265 Str.erase(Str.begin()+i+1);
266 }
267 }
268}
269
Chris Lattner05af2612009-09-13 20:08:00 +0000270/// EmitPrintInstruction - Generate the code for the "printInstruction" method
Ahmed Bougacha254ce942013-10-28 18:07:17 +0000271/// implementation. Destroys all instances of AsmWriterInst information, by
272/// clearing the Instructions vector.
Chris Lattner05af2612009-09-13 20:08:00 +0000273void AsmWriterEmitter::EmitPrintInstruction(raw_ostream &O) {
Chris Lattner175580c2004-08-14 22:50:53 +0000274 Record *AsmWriter = Target.getAsmWriter();
Craig Topper2a129872017-05-31 21:12:46 +0000275 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
Craig Topperefefcdd2016-01-14 06:15:07 +0000276 bool PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000277
Chris Lattner2e1f51b2004-08-01 05:59:33 +0000278 O <<
279 "/// printInstruction - This method is automatically generated by tablegen\n"
Chris Lattner05af2612009-09-13 20:08:00 +0000280 "/// from the instruction set description.\n"
Chris Lattner41aefdc2009-08-08 01:32:19 +0000281 "void " << Target.getName() << ClassName
Akira Hatanakaf0937832015-03-27 20:36:02 +0000282 << "::printInstruction(const MCInst *MI, "
283 << (PassSubtarget ? "const MCSubtargetInfo &STI, " : "")
284 << "raw_ostream &O) {\n";
Chris Lattner2e1f51b2004-08-01 05:59:33 +0000285
Chris Lattner6af022f2006-07-14 22:59:11 +0000286 // Build an aggregate string, and build a table of offsets into it.
Benjamin Kramer94338592012-04-02 09:13:46 +0000287 SequenceToOffsetTable<std::string> StringTable;
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000288
Chris Lattner259bda42006-09-27 16:44:09 +0000289 /// OpcodeInfo - This encodes the index of the string to use for the first
Chris Lattner55616402006-07-18 17:32:27 +0000290 /// chunk of the output as well as indices used for operand printing.
Craig Topper3356fb62016-01-17 20:38:14 +0000291 std::vector<uint64_t> OpcodeInfo(NumberedInstructions.size());
Craig Topper05bdb7c2016-01-13 07:20:12 +0000292 const unsigned OpcodeInfoBits = 64;
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000293
Benjamin Kramer94338592012-04-02 09:13:46 +0000294 // Add all strings to the string table upfront so it can generate an optimized
295 // representation.
Craig Topper73251b72016-01-17 08:05:33 +0000296 for (AsmWriterInst &AWI : Instructions) {
297 if (AWI.Operands[0].OperandType ==
Jim Grosbach016c6792012-04-18 18:56:33 +0000298 AsmWriterOperand::isLiteralTextOperand &&
Craig Topper73251b72016-01-17 08:05:33 +0000299 !AWI.Operands[0].Str.empty()) {
300 std::string Str = AWI.Operands[0].Str;
Benjamin Kramer94338592012-04-02 09:13:46 +0000301 UnescapeString(Str);
302 StringTable.add(Str);
303 }
304 }
305
306 StringTable.layout();
307
Chris Lattner55616402006-07-18 17:32:27 +0000308 unsigned MaxStringIdx = 0;
Craig Topper73251b72016-01-17 08:05:33 +0000309 for (AsmWriterInst &AWI : Instructions) {
Chris Lattner6af022f2006-07-14 22:59:11 +0000310 unsigned Idx;
Craig Topper73251b72016-01-17 08:05:33 +0000311 if (AWI.Operands[0].OperandType != AsmWriterOperand::isLiteralTextOperand ||
312 AWI.Operands[0].Str.empty()) {
Chris Lattnera6dc9fb2006-07-19 01:39:06 +0000313 // Something handled by the asmwriter printer, but with no leading string.
Benjamin Kramer94338592012-04-02 09:13:46 +0000314 Idx = StringTable.get("");
Chris Lattner6af022f2006-07-14 22:59:11 +0000315 } else {
Craig Topper73251b72016-01-17 08:05:33 +0000316 std::string Str = AWI.Operands[0].Str;
Chris Lattner3200fc92009-09-14 01:16:36 +0000317 UnescapeString(Str);
Benjamin Kramer94338592012-04-02 09:13:46 +0000318 Idx = StringTable.get(Str);
Chris Lattner3200fc92009-09-14 01:16:36 +0000319 MaxStringIdx = std::max(MaxStringIdx, Idx);
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000320
Chris Lattner6af022f2006-07-14 22:59:11 +0000321 // Nuke the string from the operand list. It is now handled!
Craig Topper73251b72016-01-17 08:05:33 +0000322 AWI.Operands.erase(AWI.Operands.begin());
Chris Lattnerf8766682005-01-22 19:22:23 +0000323 }
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000324
Chris Lattner3200fc92009-09-14 01:16:36 +0000325 // Bias offset by one since we want 0 as a sentinel.
Craig Topper73251b72016-01-17 08:05:33 +0000326 OpcodeInfo[AWI.CGIIndex] = Idx+1;
Chris Lattnerf8766682005-01-22 19:22:23 +0000327 }
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000328
Chris Lattner55616402006-07-18 17:32:27 +0000329 // Figure out how many bits we used for the string index.
Chris Lattner3200fc92009-09-14 01:16:36 +0000330 unsigned AsmStrBits = Log2_32_Ceil(MaxStringIdx+2);
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000331
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000332 // To reduce code size, we compactify common instructions into a few bits
333 // in the opcode-indexed table.
Craig Topper05bdb7c2016-01-13 07:20:12 +0000334 unsigned BitsLeft = OpcodeInfoBits-AsmStrBits;
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000335
Craig Topper72f70012014-11-25 20:11:25 +0000336 std::vector<std::vector<std::string>> TableDrivenOperandPrinters;
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000337
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000338 while (true) {
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000339 std::vector<std::string> UniqueOperandCommands;
Craig Topperaed38efd2016-01-24 07:13:28 +0000340 std::vector<std::vector<unsigned>> InstIdxs;
Chris Lattner96c1ade2006-07-18 18:28:27 +0000341 std::vector<unsigned> NumInstOpsHandled;
342 FindUniqueOperandCommands(UniqueOperandCommands, InstIdxs,
Craig Topperefefcdd2016-01-14 06:15:07 +0000343 NumInstOpsHandled, PassSubtarget);
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000344
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000345 // If we ran out of operands to print, we're done.
346 if (UniqueOperandCommands.empty()) break;
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000347
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000348 // Compute the number of bits we need to represent these cases, this is
349 // ceil(log2(numentries)).
350 unsigned NumBits = Log2_32_Ceil(UniqueOperandCommands.size());
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000351
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000352 // If we don't have enough bits for this operand, don't include it.
353 if (NumBits > BitsLeft) {
Nicola Zaghen0818e782018-05-14 12:53:11 +0000354 LLVM_DEBUG(errs() << "Not enough bits to densely encode " << NumBits
355 << " more bits\n");
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000356 break;
357 }
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000358
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000359 // Otherwise, we can include this in the initial lookup table. Add it in.
Craig Topperaed38efd2016-01-24 07:13:28 +0000360 for (size_t i = 0, e = InstIdxs.size(); i != e; ++i) {
361 unsigned NumOps = NumInstOpsHandled[i];
362 for (unsigned Idx : InstIdxs[i]) {
363 OpcodeInfo[Instructions[Idx].CGIIndex] |=
364 (uint64_t)i << (OpcodeInfoBits-BitsLeft);
365 // Remove the info about this operand from the instruction.
366 AsmWriterInst &Inst = Instructions[Idx];
367 if (!Inst.Operands.empty()) {
368 assert(NumOps <= Inst.Operands.size() &&
369 "Can't remove this many ops!");
370 Inst.Operands.erase(Inst.Operands.begin(),
371 Inst.Operands.begin()+NumOps);
372 }
Craig Topper73251b72016-01-17 08:05:33 +0000373 }
Chris Lattnerb8462862006-07-18 17:56:07 +0000374 }
Craig Topperaed38efd2016-01-24 07:13:28 +0000375 BitsLeft -= NumBits;
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000376
Chris Lattnerb8462862006-07-18 17:56:07 +0000377 // Remember the handlers for this set of operands.
Craig Topper72f70012014-11-25 20:11:25 +0000378 TableDrivenOperandPrinters.push_back(std::move(UniqueOperandCommands));
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000379 }
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000380
Craig Topperd05b6082016-01-11 05:13:41 +0000381 // Emit the string table itself.
Reid Kleckner55ebcf32014-07-17 19:43:40 +0000382 O << " static const char AsmStrs[] = {\n";
Benjamin Kramer94338592012-04-02 09:13:46 +0000383 StringTable.emit(O, printChar);
384 O << " };\n\n";
Chris Lattner6af022f2006-07-14 22:59:11 +0000385
Craig Topperd05b6082016-01-11 05:13:41 +0000386 // Emit the lookup tables in pieces to minimize wasted bytes.
Craig Topper05bdb7c2016-01-13 07:20:12 +0000387 unsigned BytesNeeded = ((OpcodeInfoBits - BitsLeft) + 7) / 8;
Craig Topperd05b6082016-01-11 05:13:41 +0000388 unsigned Table = 0, Shift = 0;
389 SmallString<128> BitsString;
390 raw_svector_ostream BitsOS(BitsString);
391 // If the total bits is more than 32-bits we need to use a 64-bit type.
Craig Topper05bdb7c2016-01-13 07:20:12 +0000392 BitsOS << " uint" << ((BitsLeft < (OpcodeInfoBits - 32)) ? 64 : 32)
393 << "_t Bits = 0;\n";
Craig Topperd05b6082016-01-11 05:13:41 +0000394 while (BytesNeeded != 0) {
395 // Figure out how big this table section needs to be, but no bigger than 4.
396 unsigned TableSize = std::min(1 << Log2_32(BytesNeeded), 4);
397 BytesNeeded -= TableSize;
398 TableSize *= 8; // Convert to bits;
399 uint64_t Mask = (1ULL << TableSize) - 1;
400 O << " static const uint" << TableSize << "_t OpInfo" << Table
401 << "[] = {\n";
Craig Topper3356fb62016-01-17 20:38:14 +0000402 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
Craig Topperd05b6082016-01-11 05:13:41 +0000403 O << " " << ((OpcodeInfo[i] >> Shift) & Mask) << "U,\t// "
Craig Topper3356fb62016-01-17 20:38:14 +0000404 << NumberedInstructions[i]->TheDef->getName() << "\n";
Craig Topperd05b6082016-01-11 05:13:41 +0000405 }
406 O << " };\n\n";
407 // Emit string to combine the individual table lookups.
408 BitsOS << " Bits |= ";
409 // If the total bits is more than 32-bits we need to use a 64-bit type.
Craig Topper05bdb7c2016-01-13 07:20:12 +0000410 if (BitsLeft < (OpcodeInfoBits - 32))
Craig Topperd05b6082016-01-11 05:13:41 +0000411 BitsOS << "(uint64_t)";
412 BitsOS << "OpInfo" << Table << "[MI->getOpcode()] << " << Shift << ";\n";
413 // Prepare the shift for the next iteration and increment the table count.
414 Shift += TableSize;
415 ++Table;
416 }
417
418 // Emit the initial tab character.
Evan Cheng4eecdeb2008-02-02 08:39:46 +0000419 O << " O << \"\\t\";\n\n";
420
Craig Topperf4d78242012-09-14 08:33:11 +0000421 O << " // Emit the opcode for the instruction.\n";
Craig Topperd05b6082016-01-11 05:13:41 +0000422 O << BitsString;
423
424 // Emit the starting string.
Manman Ren6579cf82012-09-13 17:43:46 +0000425 O << " assert(Bits != 0 && \"Cannot print this instruction.\");\n"
Chris Lattner3200fc92009-09-14 01:16:36 +0000426 << " O << AsmStrs+(Bits & " << (1 << AsmStrBits)-1 << ")-1;\n\n";
David Greenea5bb59f2009-08-05 21:00:52 +0000427
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000428 // Output the table driven operand information.
Craig Topper05bdb7c2016-01-13 07:20:12 +0000429 BitsLeft = OpcodeInfoBits-AsmStrBits;
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000430 for (unsigned i = 0, e = TableDrivenOperandPrinters.size(); i != e; ++i) {
431 std::vector<std::string> &Commands = TableDrivenOperandPrinters[i];
432
433 // Compute the number of bits we need to represent these cases, this is
434 // ceil(log2(numentries)).
435 unsigned NumBits = Log2_32_Ceil(Commands.size());
436 assert(NumBits <= BitsLeft && "consistency error");
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000437
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000438 // Emit code to extract this field from Bits.
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000439 O << "\n // Fragment " << i << " encoded into " << NumBits
Chris Lattnere7a589d2006-07-18 17:43:54 +0000440 << " bits for " << Commands.size() << " unique commands.\n";
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000441
Chris Lattner96c1ade2006-07-18 18:28:27 +0000442 if (Commands.size() == 2) {
Chris Lattnere7a589d2006-07-18 17:43:54 +0000443 // Emit two possibilitys with if/else.
Craig Topperf4d78242012-09-14 08:33:11 +0000444 O << " if ((Bits >> "
Craig Topper05bdb7c2016-01-13 07:20:12 +0000445 << (OpcodeInfoBits-BitsLeft) << ") & "
Chris Lattnere7a589d2006-07-18 17:43:54 +0000446 << ((1 << NumBits)-1) << ") {\n"
447 << Commands[1]
448 << " } else {\n"
449 << Commands[0]
450 << " }\n\n";
Eric Christopher16870502010-09-18 18:50:27 +0000451 } else if (Commands.size() == 1) {
452 // Emit a single possibility.
453 O << Commands[0] << "\n\n";
Chris Lattnere7a589d2006-07-18 17:43:54 +0000454 } else {
Craig Topperf4d78242012-09-14 08:33:11 +0000455 O << " switch ((Bits >> "
Craig Topper05bdb7c2016-01-13 07:20:12 +0000456 << (OpcodeInfoBits-BitsLeft) << ") & "
Chris Lattnere7a589d2006-07-18 17:43:54 +0000457 << ((1 << NumBits)-1) << ") {\n"
Craig Topper170c95f2014-11-24 14:09:52 +0000458 << " default: llvm_unreachable(\"Invalid command number.\");\n";
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000459
Chris Lattnere7a589d2006-07-18 17:43:54 +0000460 // Print out all the cases.
Craig Topper61614122016-01-08 07:06:32 +0000461 for (unsigned j = 0, e = Commands.size(); j != e; ++j) {
462 O << " case " << j << ":\n";
463 O << Commands[j];
Chris Lattnere7a589d2006-07-18 17:43:54 +0000464 O << " break;\n";
465 }
466 O << " }\n\n";
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000467 }
Craig Topperf4d78242012-09-14 08:33:11 +0000468 BitsLeft -= NumBits;
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000469 }
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000470
Chris Lattnerb8462862006-07-18 17:56:07 +0000471 // Okay, delete instructions with no operand info left.
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000472 auto I = llvm::remove_if(Instructions,
David Majnemer5d08e372016-08-12 04:32:37 +0000473 [](AsmWriterInst &Inst) { return Inst.Operands.empty(); });
Craig Topperabfd6302016-01-13 07:20:10 +0000474 Instructions.erase(I, Instructions.end());
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000475
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000476
Chris Lattnerbdff5f92006-07-18 17:18:03 +0000477 // Because this is a vector, we want to emit from the end. Reverse all of the
Chris Lattner870c0162005-01-22 18:38:13 +0000478 // elements in the vector.
479 std::reverse(Instructions.begin(), Instructions.end());
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000480
481
Craig Toppercdef20c2016-01-13 07:20:07 +0000482 // Now that we've emitted all of the operand info that fit into 64 bits, emit
Chris Lattner70067602009-09-18 18:10:19 +0000483 // information for those instructions that are left. This is a less dense
Craig Toppercdef20c2016-01-13 07:20:07 +0000484 // encoding, but we expect the main 64-bit table to handle the majority of
Chris Lattner70067602009-09-18 18:10:19 +0000485 // instructions.
Chris Lattnerb51ecd42006-07-18 17:38:46 +0000486 if (!Instructions.empty()) {
487 // Find the opcode # of inline asm.
488 O << " switch (MI->getOpcode()) {\n";
Craig Toppercd0aefe2016-01-13 07:20:13 +0000489 O << " default: llvm_unreachable(\"Unexpected opcode.\");\n";
Chris Lattnerb51ecd42006-07-18 17:38:46 +0000490 while (!Instructions.empty())
Craig Topperefefcdd2016-01-14 06:15:07 +0000491 EmitInstructions(Instructions, O, PassSubtarget);
Chris Lattner870c0162005-01-22 18:38:13 +0000492
Chris Lattnerb51ecd42006-07-18 17:38:46 +0000493 O << " }\n";
494 }
David Greenec8d06052009-07-29 20:10:24 +0000495
Chris Lattner0a012122006-07-18 19:06:01 +0000496 O << "}\n";
Chris Lattner2e1f51b2004-08-01 05:59:33 +0000497}
Chris Lattner05af2612009-09-13 20:08:00 +0000498
Owen Andersonbea6f612011-06-27 21:06:21 +0000499static void
500emitRegisterNameString(raw_ostream &O, StringRef AltName,
David Blaikiee7227132014-11-29 18:13:39 +0000501 const std::deque<CodeGenRegister> &Registers) {
Jakob Stoklund Olesenc19f72b2012-03-30 21:12:52 +0000502 SequenceToOffsetTable<std::string> StringTable;
503 SmallVector<std::string, 4> AsmNames(Registers.size());
David Blaikiee7227132014-11-29 18:13:39 +0000504 unsigned i = 0;
505 for (const auto &Reg : Registers) {
506 std::string &AsmName = AsmNames[i++];
Owen Andersonbea6f612011-06-27 21:06:21 +0000507
Owen Andersonbea6f612011-06-27 21:06:21 +0000508 // "NoRegAltName" is special. We don't need to do a lookup for that,
509 // as it's just a reference to the default register name.
510 if (AltName == "" || AltName == "NoRegAltName") {
511 AsmName = Reg.TheDef->getValueAsString("AsmName");
512 if (AsmName.empty())
513 AsmName = Reg.getName();
514 } else {
515 // Make sure the register has an alternate name for this index.
516 std::vector<Record*> AltNameList =
517 Reg.TheDef->getValueAsListOfDefs("RegAltNameIndices");
518 unsigned Idx = 0, e;
519 for (e = AltNameList.size();
520 Idx < e && (AltNameList[Idx]->getName() != AltName);
521 ++Idx)
522 ;
523 // If the register has an alternate name for this index, use it.
524 // Otherwise, leave it empty as an error flag.
525 if (Idx < e) {
Craig Topperc469be32017-05-31 19:01:11 +0000526 std::vector<StringRef> AltNames =
Owen Andersonbea6f612011-06-27 21:06:21 +0000527 Reg.TheDef->getValueAsListOfStrings("AltNames");
528 if (AltNames.size() <= Idx)
Joerg Sonnenberger61131ab2012-10-25 20:33:17 +0000529 PrintFatalError(Reg.TheDef->getLoc(),
Benjamin Kramerabe43b52014-03-29 17:17:15 +0000530 "Register definition missing alt name for '" +
531 AltName + "'.");
Owen Andersonbea6f612011-06-27 21:06:21 +0000532 AsmName = AltNames[Idx];
533 }
534 }
Jakob Stoklund Olesenc19f72b2012-03-30 21:12:52 +0000535 StringTable.add(AsmName);
536 }
Owen Andersonbea6f612011-06-27 21:06:21 +0000537
Craig Topper5974c312012-09-15 01:22:42 +0000538 StringTable.layout();
Jakob Stoklund Olesenc19f72b2012-03-30 21:12:52 +0000539 O << " static const char AsmStrs" << AltName << "[] = {\n";
540 StringTable.emit(O, printChar);
541 O << " };\n\n";
542
Daniel Sanders90085b52016-11-19 12:21:34 +0000543 O << " static const " << getMinimalTypeForRange(StringTable.size() - 1, 32)
Craig Topper84d32522014-11-24 02:08:35 +0000544 << " RegAsmOffset" << AltName << "[] = {";
Jakob Stoklund Olesenc19f72b2012-03-30 21:12:52 +0000545 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
Craig Toppera4bd58b2012-04-02 00:47:39 +0000546 if ((i % 14) == 0)
547 O << "\n ";
548 O << StringTable.get(AsmNames[i]) << ", ";
Owen Andersonbea6f612011-06-27 21:06:21 +0000549 }
Craig Topper9b1b25f2012-04-03 06:52:47 +0000550 O << "\n };\n"
Owen Andersonbea6f612011-06-27 21:06:21 +0000551 << "\n";
Owen Andersonbea6f612011-06-27 21:06:21 +0000552}
Chris Lattner05af2612009-09-13 20:08:00 +0000553
554void AsmWriterEmitter::EmitGetRegisterName(raw_ostream &O) {
Chris Lattner05af2612009-09-13 20:08:00 +0000555 Record *AsmWriter = Target.getAsmWriter();
Craig Topper2a129872017-05-31 21:12:46 +0000556 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
David Blaikiee7227132014-11-29 18:13:39 +0000557 const auto &Registers = Target.getRegBank().getRegisters();
Craig Topper8ce1d772016-01-17 20:38:21 +0000558 const std::vector<Record*> &AltNameIndices = Target.getRegAltNameIndices();
Owen Andersonbea6f612011-06-27 21:06:21 +0000559 bool hasAltNames = AltNameIndices.size() > 1;
Craig Topper2a129872017-05-31 21:12:46 +0000560 StringRef Namespace = Registers.front().TheDef->getValueAsString("Namespace");
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000561
Chris Lattner05af2612009-09-13 20:08:00 +0000562 O <<
563 "\n\n/// getRegisterName - This method is automatically generated by tblgen\n"
564 "/// from the register set description. This returns the assembler name\n"
565 "/// for the specified register.\n"
Owen Andersonbea6f612011-06-27 21:06:21 +0000566 "const char *" << Target.getName() << ClassName << "::";
567 if (hasAltNames)
568 O << "\ngetRegisterName(unsigned RegNo, unsigned AltIdx) {\n";
569 else
570 O << "getRegisterName(unsigned RegNo) {\n";
571 O << " assert(RegNo && RegNo < " << (Registers.size()+1)
572 << " && \"Invalid register number!\");\n"
Chris Lattnerf6761be2009-09-14 01:26:18 +0000573 << "\n";
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000574
Owen Andersonbea6f612011-06-27 21:06:21 +0000575 if (hasAltNames) {
Craig Topper61614122016-01-08 07:06:32 +0000576 for (const Record *R : AltNameIndices)
577 emitRegisterNameString(O, R->getName(), Registers);
Owen Andersonbea6f612011-06-27 21:06:21 +0000578 } else
579 emitRegisterNameString(O, "", Registers);
Jim Grosbach9255b8d2010-09-29 22:32:50 +0000580
Owen Andersonbea6f612011-06-27 21:06:21 +0000581 if (hasAltNames) {
Craig Topper84d32522014-11-24 02:08:35 +0000582 O << " switch(AltIdx) {\n"
Craig Topper655b8de2012-02-05 07:21:30 +0000583 << " default: llvm_unreachable(\"Invalid register alt name index!\");\n";
Craig Topper61614122016-01-08 07:06:32 +0000584 for (const Record *R : AltNameIndices) {
Craig Topper2a129872017-05-31 21:12:46 +0000585 StringRef AltName = R->getName();
586 O << " case ";
587 if (!Namespace.empty())
588 O << Namespace << "::";
589 O << AltName << ":\n"
590 << " assert(*(AsmStrs" << AltName << "+RegAsmOffset" << AltName
591 << "[RegNo-1]) &&\n"
Craig Topper84d32522014-11-24 02:08:35 +0000592 << " \"Invalid alt name index for register!\");\n"
Craig Topper2a129872017-05-31 21:12:46 +0000593 << " return AsmStrs" << AltName << "+RegAsmOffset" << AltName
594 << "[RegNo-1];\n";
Owen Andersonbea6f612011-06-27 21:06:21 +0000595 }
Craig Topper84d32522014-11-24 02:08:35 +0000596 O << " }\n";
597 } else {
598 O << " assert (*(AsmStrs+RegAsmOffset[RegNo-1]) &&\n"
599 << " \"Invalid alt name index for register!\");\n"
600 << " return AsmStrs+RegAsmOffset[RegNo-1];\n";
Owen Andersonbea6f612011-06-27 21:06:21 +0000601 }
Craig Topper84d32522014-11-24 02:08:35 +0000602 O << "}\n";
Chris Lattner05af2612009-09-13 20:08:00 +0000603}
604
Bill Wendling2cf6fc62011-03-21 08:31:53 +0000605namespace {
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000606
Bill Wendling4962e612011-03-21 08:40:31 +0000607// IAPrinter - Holds information about an InstAlias. Two InstAliases match if
608// they both have the same conditionals. In which case, we cannot print out the
609// alias for that pattern.
610class IAPrinter {
Bill Wendling4962e612011-03-21 08:40:31 +0000611 std::vector<std::string> Conds;
Tim Northoverd6cd0382014-05-12 18:04:06 +0000612 std::map<StringRef, std::pair<int, int>> OpMap;
Tim Northoverd6cd0382014-05-12 18:04:06 +0000613
Bill Wendling4962e612011-03-21 08:40:31 +0000614 std::string Result;
615 std::string AsmString;
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000616
Bill Wendling4962e612011-03-21 08:40:31 +0000617public:
Benjamin Kramer14aae012016-05-27 14:27:24 +0000618 IAPrinter(std::string R, std::string AS)
619 : Result(std::move(R)), AsmString(std::move(AS)) {}
Bill Wendling4962e612011-03-21 08:40:31 +0000620
621 void addCond(const std::string &C) { Conds.push_back(C); }
Bill Wendling4962e612011-03-21 08:40:31 +0000622
Tim Northoverd6cd0382014-05-12 18:04:06 +0000623 void addOperand(StringRef Op, int OpIdx, int PrintMethodIdx = -1) {
624 assert(OpIdx >= 0 && OpIdx < 0xFE && "Idx out of range");
Tim Northovere9592d02014-05-13 09:37:41 +0000625 assert(PrintMethodIdx >= -1 && PrintMethodIdx < 0xFF &&
Jay Foadae0a8332014-05-13 08:26:53 +0000626 "Idx out of range");
Tim Northoverd6cd0382014-05-12 18:04:06 +0000627 OpMap[Op] = std::make_pair(OpIdx, PrintMethodIdx);
Benjamin Kramer209a8c82013-09-11 15:42:16 +0000628 }
Tim Northoverd6cd0382014-05-12 18:04:06 +0000629
Bill Wendling4962e612011-03-21 08:40:31 +0000630 bool isOpMapped(StringRef Op) { return OpMap.find(Op) != OpMap.end(); }
Tim Northoverd6cd0382014-05-12 18:04:06 +0000631 int getOpIndex(StringRef Op) { return OpMap[Op].first; }
632 std::pair<int, int> &getOpData(StringRef Op) { return OpMap[Op]; }
Bill Wendling4962e612011-03-21 08:40:31 +0000633
Tim Northoverf61a4672014-05-15 11:16:32 +0000634 std::pair<StringRef, StringRef::iterator> parseName(StringRef::iterator Start,
635 StringRef::iterator End) {
636 StringRef::iterator I = Start;
Evgeny Astigeevicha4020f22014-12-16 18:16:17 +0000637 StringRef::iterator Next;
Tim Northoverf61a4672014-05-15 11:16:32 +0000638 if (*I == '{') {
639 // ${some_name}
640 Start = ++I;
641 while (I != End && *I != '}')
642 ++I;
Evgeny Astigeevicha4020f22014-12-16 18:16:17 +0000643 Next = I;
644 // eat the final '}'
645 if (Next != End)
646 ++Next;
Tim Northoverf61a4672014-05-15 11:16:32 +0000647 } else {
648 // $name, just eat the usual suspects.
649 while (I != End &&
650 ((*I >= 'a' && *I <= 'z') || (*I >= 'A' && *I <= 'Z') ||
651 (*I >= '0' && *I <= '9') || *I == '_'))
652 ++I;
Evgeny Astigeevicha4020f22014-12-16 18:16:17 +0000653 Next = I;
Tim Northoverf61a4672014-05-15 11:16:32 +0000654 }
655
Evgeny Astigeevicha4020f22014-12-16 18:16:17 +0000656 return std::make_pair(StringRef(Start, I - Start), Next);
Tim Northoverf61a4672014-05-15 11:16:32 +0000657 }
658
Evan Cheng68ae5b42011-07-06 02:02:33 +0000659 void print(raw_ostream &O) {
Sjoerd Meijer6762cdb2016-06-03 13:14:19 +0000660 if (Conds.empty()) {
Bill Wendling44dcfd32011-04-07 21:20:06 +0000661 O.indent(6) << "return true;\n";
Evan Cheng68ae5b42011-07-06 02:02:33 +0000662 return;
Bill Wendling44dcfd32011-04-07 21:20:06 +0000663 }
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000664
Bill Wendling44dcfd32011-04-07 21:20:06 +0000665 O << "if (";
Bill Wendling4962e612011-03-21 08:40:31 +0000666
667 for (std::vector<std::string>::iterator
668 I = Conds.begin(), E = Conds.end(); I != E; ++I) {
669 if (I != Conds.begin()) {
670 O << " &&\n";
Bill Wendling44dcfd32011-04-07 21:20:06 +0000671 O.indent(8);
Bill Wendling4962e612011-03-21 08:40:31 +0000672 }
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000673
Bill Wendling4962e612011-03-21 08:40:31 +0000674 O << *I;
675 }
676
Bill Wendling44dcfd32011-04-07 21:20:06 +0000677 O << ") {\n";
678 O.indent(6) << "// " << Result << "\n";
Bill Wendling4962e612011-03-21 08:40:31 +0000679
Benjamin Kramer209a8c82013-09-11 15:42:16 +0000680 // Directly mangle mapped operands into the string. Each operand is
681 // identified by a '$' sign followed by a byte identifying the number of the
682 // operand. We add one to the index to avoid zero bytes.
Tim Northoverf61a4672014-05-15 11:16:32 +0000683 StringRef ASM(AsmString);
684 SmallString<128> OutString;
685 raw_svector_ostream OS(OutString);
686 for (StringRef::iterator I = ASM.begin(), E = ASM.end(); I != E;) {
687 OS << *I;
688 if (*I == '$') {
689 StringRef Name;
690 std::tie(Name, I) = parseName(++I, E);
691 assert(isOpMapped(Name) && "Unmapped operand!");
Tim Northoverd6cd0382014-05-12 18:04:06 +0000692
Tim Northoverf61a4672014-05-15 11:16:32 +0000693 int OpIndex, PrintIndex;
694 std::tie(OpIndex, PrintIndex) = getOpData(Name);
695 if (PrintIndex == -1) {
696 // Can use the default printOperand route.
697 OS << format("\\x%02X", (unsigned char)OpIndex + 1);
698 } else
699 // 3 bytes if a PrintMethod is needed: 0xFF, the MCInst operand
700 // number, and which of our pre-detected Methods to call.
701 OS << format("\\xFF\\x%02X\\x%02X", OpIndex + 1, PrintIndex + 1);
702 } else {
703 ++I;
Benjamin Kramer209a8c82013-09-11 15:42:16 +0000704 }
705 }
706
707 // Emit the string.
Yaron Keren1132d0c2015-03-10 07:33:23 +0000708 O.indent(6) << "AsmString = \"" << OutString << "\";\n";
Bill Wendling4962e612011-03-21 08:40:31 +0000709
Bill Wendling44dcfd32011-04-07 21:20:06 +0000710 O.indent(6) << "break;\n";
711 O.indent(4) << '}';
Bill Wendling4962e612011-03-21 08:40:31 +0000712 }
713
David Blaikie01d5be62015-08-06 19:23:33 +0000714 bool operator==(const IAPrinter &RHS) const {
Bill Wendling4962e612011-03-21 08:40:31 +0000715 if (Conds.size() != RHS.Conds.size())
716 return false;
717
718 unsigned Idx = 0;
David Blaikie01d5be62015-08-06 19:23:33 +0000719 for (const auto &str : Conds)
720 if (str != RHS.Conds[Idx++])
Bill Wendling4962e612011-03-21 08:40:31 +0000721 return false;
722
723 return true;
724 }
Bill Wendling4962e612011-03-21 08:40:31 +0000725};
726
Bill Wendling2cf6fc62011-03-21 08:31:53 +0000727} // end anonymous namespace
728
Tim Northovera9a94ce2014-05-16 09:42:04 +0000729static unsigned CountNumOperands(StringRef AsmString, unsigned Variant) {
Tim Northovera9a94ce2014-05-16 09:42:04 +0000730 return AsmString.count(' ') + AsmString.count('\t');
Bill Wendling393c4042011-06-15 04:31:19 +0000731}
Bill Wendling740e5b32011-06-14 03:17:20 +0000732
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000733namespace {
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000734
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000735struct AliasPriorityComparator {
David Blaikie01d5be62015-08-06 19:23:33 +0000736 typedef std::pair<CodeGenInstAlias, int> ValueType;
Eric Fiselier10a1d172016-12-27 23:15:58 +0000737 bool operator()(const ValueType &LHS, const ValueType &RHS) const {
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000738 if (LHS.second == RHS.second) {
739 // We don't actually care about the order, but for consistency it
740 // shouldn't depend on pointer comparisons.
Quentin Colombetdffd4272017-02-10 02:43:09 +0000741 return LessRecordByID()(LHS.first.TheDef, RHS.first.TheDef);
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000742 }
743
744 // Aliases with larger priorities should be considered first.
745 return LHS.second > RHS.second;
746 }
747};
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000748
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000749} // end anonymous namespace
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000750
Bill Wendling2cf6fc62011-03-21 08:31:53 +0000751void AsmWriterEmitter::EmitPrintAliasInstruction(raw_ostream &O) {
Bill Wendling2cf6fc62011-03-21 08:31:53 +0000752 Record *AsmWriter = Target.getAsmWriter();
753
754 O << "\n#ifdef PRINT_ALIAS_INSTR\n";
755 O << "#undef PRINT_ALIAS_INSTR\n\n";
756
Tim Northoverd6cd0382014-05-12 18:04:06 +0000757 //////////////////////////////
758 // Gather information about aliases we need to print
759 //////////////////////////////
760
Bill Wendling7520e3a2011-02-26 03:09:12 +0000761 // Emit the method that prints the alias instruction.
Craig Topper2a129872017-05-31 21:12:46 +0000762 StringRef ClassName = AsmWriter->getValueAsString("AsmWriterClassName");
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000763 unsigned Variant = AsmWriter->getValueAsInt("Variant");
Craig Topperefefcdd2016-01-14 06:15:07 +0000764 bool PassSubtarget = AsmWriter->getValueAsInt("PassSubtarget");
Bill Wendling7520e3a2011-02-26 03:09:12 +0000765
Bill Wendling7520e3a2011-02-26 03:09:12 +0000766 std::vector<Record*> AllInstAliases =
767 Records.getAllDerivedDefinitions("InstAlias");
768
769 // Create a map from the qualified name to a list of potential matches.
David Blaikie01d5be62015-08-06 19:23:33 +0000770 typedef std::set<std::pair<CodeGenInstAlias, int>, AliasPriorityComparator>
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000771 AliasWithPriority;
772 std::map<std::string, AliasWithPriority> AliasMap;
Craig Topper61614122016-01-08 07:06:32 +0000773 for (Record *R : AllInstAliases) {
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000774 int Priority = R->getValueAsInt("EmitPriority");
775 if (Priority < 1)
776 continue; // Aliases with priority 0 are never emitted.
777
Bill Wendling7520e3a2011-02-26 03:09:12 +0000778 const DagInit *DI = R->getValueAsDag("ResultInst");
Sean Silva3f7b7f82012-10-10 20:24:47 +0000779 const DefInit *Op = cast<DefInit>(DI->getOperator());
David Blaikie01d5be62015-08-06 19:23:33 +0000780 AliasMap[getQualifiedName(Op->getDef())].insert(
Craig Topper50ea5bb2018-06-18 01:28:01 +0000781 std::make_pair(CodeGenInstAlias(R, Target), Priority));
Bill Wendling7520e3a2011-02-26 03:09:12 +0000782 }
783
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000784 // A map of which conditions need to be met for each instruction operand
785 // before it can be matched to the mnemonic.
David Blaikie01d5be62015-08-06 19:23:33 +0000786 std::map<std::string, std::vector<IAPrinter>> IAPrinterMap;
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000787
Craig Toppera4f29782016-01-22 05:59:43 +0000788 std::vector<std::string> PrintMethods;
789
Artyom Skrobov45a31492014-06-10 13:11:35 +0000790 // A list of MCOperandPredicates for all operands in use, and the reverse map
791 std::vector<const Record*> MCOpPredicates;
792 DenseMap<const Record*, unsigned> MCOpPredicateMap;
793
Tim Northoverc9ff20e2014-05-20 09:17:16 +0000794 for (auto &Aliases : AliasMap) {
795 for (auto &Alias : Aliases.second) {
David Blaikie01d5be62015-08-06 19:23:33 +0000796 const CodeGenInstAlias &CGA = Alias.first;
797 unsigned LastOpNo = CGA.ResultInstOperandIndex.size();
Craig Topper50ea5bb2018-06-18 01:28:01 +0000798 std::string FlatInstAsmString =
799 CodeGenInstruction::FlattenAsmStringVariants(CGA.ResultInst->AsmString,
800 Variant);
801 unsigned NumResultOps = CountNumOperands(FlatInstAsmString, Variant);
802
803 std::string FlatAliasAsmString =
804 CodeGenInstruction::FlattenAsmStringVariants(CGA.AsmString,
805 Variant);
Bill Wendling740e5b32011-06-14 03:17:20 +0000806
807 // Don't emit the alias if it has more operands than what it's aliasing.
Craig Topper50ea5bb2018-06-18 01:28:01 +0000808 if (NumResultOps < CountNumOperands(FlatAliasAsmString, Variant))
Bill Wendling740e5b32011-06-14 03:17:20 +0000809 continue;
810
Craig Topper50ea5bb2018-06-18 01:28:01 +0000811 IAPrinter IAP(CGA.Result->getAsString(), FlatAliasAsmString);
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000812
Craig Topper2a129872017-05-31 21:12:46 +0000813 StringRef Namespace = Target.getName();
Sjoerd Meijer6762cdb2016-06-03 13:14:19 +0000814 std::vector<Record *> ReqFeatures;
815 if (PassSubtarget) {
816 // We only consider ReqFeatures predicates if PassSubtarget
817 std::vector<Record *> RF =
818 CGA.TheDef->getValueAsListOfDefs("Predicates");
Sanjoy Das81f0f462017-02-21 00:38:44 +0000819 copy_if(RF, std::back_inserter(ReqFeatures), [](Record *R) {
820 return R->getValueAsBit("AssemblerMatcherPredicate");
821 });
Sjoerd Meijer6762cdb2016-06-03 13:14:19 +0000822 }
823
Tim Northoverd0e93f22014-05-15 13:36:01 +0000824 unsigned NumMIOps = 0;
Sander de Smalenb2ea7122017-11-20 14:36:40 +0000825 for (auto &ResultInstOpnd : CGA.ResultInst->Operands)
826 NumMIOps += ResultInstOpnd.MINumOperands;
Tim Northoverd0e93f22014-05-15 13:36:01 +0000827
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000828 std::string Cond;
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000829 Cond = std::string("MI->getNumOperands() == ") + utostr(NumMIOps);
David Blaikie01d5be62015-08-06 19:23:33 +0000830 IAP.addCond(Cond);
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000831
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000832 bool CantHandle = false;
833
Tim Northoverd0e93f22014-05-15 13:36:01 +0000834 unsigned MIOpNum = 0;
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000835 for (unsigned i = 0, e = LastOpNo; i != e; ++i) {
Sander de Smalenb2ea7122017-11-20 14:36:40 +0000836 // Skip over tied operands as they're not part of an alias declaration.
837 auto &Operands = CGA.ResultInst->Operands;
Simon Tathamc25292e2018-12-14 11:39:55 +0000838 while (true) {
839 unsigned OpNum = Operands.getSubOperandNumber(MIOpNum).first;
840 if (Operands[OpNum].MINumOperands == 1 &&
841 Operands[OpNum].getTiedRegister() != -1) {
842 // Tied operands of different RegisterClass should be explicit within
843 // an instruction's syntax and so cannot be skipped.
844 int TiedOpNum = Operands[OpNum].getTiedRegister();
845 if (Operands[OpNum].Rec->getName() ==
846 Operands[TiedOpNum].Rec->getName()) {
847 ++MIOpNum;
848 continue;
849 }
850 }
851 break;
Sander de Smalenb2ea7122017-11-20 14:36:40 +0000852 }
853
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000854 std::string Op = "MI->getOperand(" + utostr(MIOpNum) + ")";
Artyom Skrobov8316a972014-06-10 12:47:23 +0000855
David Blaikie01d5be62015-08-06 19:23:33 +0000856 const CodeGenInstAlias::ResultOperand &RO = CGA.ResultOperands[i];
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000857
858 switch (RO.Kind) {
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000859 case CodeGenInstAlias::ResultOperand::K_Record: {
860 const Record *Rec = RO.getRecord();
861 StringRef ROName = RO.getName();
Tim Northoverd6cd0382014-05-12 18:04:06 +0000862 int PrintMethodIdx = -1;
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000863
Tim Northoverd6cd0382014-05-12 18:04:06 +0000864 // These two may have a PrintMethod, which we want to record (if it's
865 // the first time we've seen it) and provide an index for the aliasing
866 // code to use.
867 if (Rec->isSubClassOf("RegisterOperand") ||
868 Rec->isSubClassOf("Operand")) {
Craig Topper2a129872017-05-31 21:12:46 +0000869 StringRef PrintMethod = Rec->getValueAsString("PrintMethod");
Tim Northoverd6cd0382014-05-12 18:04:06 +0000870 if (PrintMethod != "" && PrintMethod != "printOperand") {
David Majnemer2d62ce62016-08-12 03:55:06 +0000871 PrintMethodIdx =
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000872 llvm::find(PrintMethods, PrintMethod) - PrintMethods.begin();
Tim Northoverd6cd0382014-05-12 18:04:06 +0000873 if (static_cast<unsigned>(PrintMethodIdx) == PrintMethods.size())
874 PrintMethods.push_back(PrintMethod);
875 }
876 }
Owen Andersonbea6f612011-06-27 21:06:21 +0000877
878 if (Rec->isSubClassOf("RegisterOperand"))
879 Rec = Rec->getValueAsDef("RegClass");
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000880 if (Rec->isSubClassOf("RegisterClass")) {
David Blaikie01d5be62015-08-06 19:23:33 +0000881 IAP.addCond(Op + ".isReg()");
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000882
David Blaikie01d5be62015-08-06 19:23:33 +0000883 if (!IAP.isOpMapped(ROName)) {
884 IAP.addOperand(ROName, MIOpNum, PrintMethodIdx);
885 Record *R = CGA.ResultOperands[i].getRecord();
Jack Carter37ef65b2013-02-05 08:32:10 +0000886 if (R->isSubClassOf("RegisterOperand"))
887 R = R->getValueAsDef("RegClass");
Matthias Braun0c517c82016-12-04 05:48:16 +0000888 Cond = std::string("MRI.getRegClass(") + Target.getName().str() +
889 "::" + R->getName().str() + "RegClassID).contains(" + Op +
890 ".getReg())";
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000891 } else {
Artyom Skrobov8316a972014-06-10 12:47:23 +0000892 Cond = Op + ".getReg() == MI->getOperand(" +
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000893 utostr(IAP.getOpIndex(ROName)) + ").getReg()";
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000894 }
895 } else {
Tim Northoverd6cd0382014-05-12 18:04:06 +0000896 // Assume all printable operands are desired for now. This can be
Alp Toker727273b2014-05-15 01:52:21 +0000897 // overridden in the InstAlias instantiation if necessary.
David Blaikie01d5be62015-08-06 19:23:33 +0000898 IAP.addOperand(ROName, MIOpNum, PrintMethodIdx);
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000899
Artyom Skrobov45a31492014-06-10 13:11:35 +0000900 // There might be an additional predicate on the MCOperand
901 unsigned Entry = MCOpPredicateMap[Rec];
902 if (!Entry) {
903 if (!Rec->isValueUnset("MCOperandPredicate")) {
904 MCOpPredicates.push_back(Rec);
905 Entry = MCOpPredicates.size();
906 MCOpPredicateMap[Rec] = Entry;
907 } else
908 break; // No conditions on this operand at all
909 }
Craig Topper2a129872017-05-31 21:12:46 +0000910 Cond = (Target.getName() + ClassName + "ValidateMCOperand(" + Op +
911 ", STI, " + utostr(Entry) + ")")
912 .str();
Artyom Skrobov45a31492014-06-10 13:11:35 +0000913 }
914 // for all subcases of ResultOperand::K_Record:
David Blaikie01d5be62015-08-06 19:23:33 +0000915 IAP.addCond(Cond);
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000916 break;
917 }
Tim Northover7bf2e1b2013-01-09 13:32:04 +0000918 case CodeGenInstAlias::ResultOperand::K_Imm: {
Tim Northover7bf2e1b2013-01-09 13:32:04 +0000919 // Just because the alias has an immediate result, doesn't mean the
920 // MCInst will. An MCExpr could be present, for example.
David Blaikie01d5be62015-08-06 19:23:33 +0000921 IAP.addCond(Op + ".isImm()");
Tim Northover7bf2e1b2013-01-09 13:32:04 +0000922
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000923 Cond = Op + ".getImm() == " + itostr(CGA.ResultOperands[i].getImm());
David Blaikie01d5be62015-08-06 19:23:33 +0000924 IAP.addCond(Cond);
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000925 break;
Tim Northover7bf2e1b2013-01-09 13:32:04 +0000926 }
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000927 case CodeGenInstAlias::ResultOperand::K_Reg:
Jim Grosbachbfc94292011-11-15 01:46:57 +0000928 // If this is zero_reg, something's playing tricks we're not
929 // equipped to handle.
David Blaikie01d5be62015-08-06 19:23:33 +0000930 if (!CGA.ResultOperands[i].getRegister()) {
Jim Grosbachbfc94292011-11-15 01:46:57 +0000931 CantHandle = true;
932 break;
933 }
934
Matthias Braun0c517c82016-12-04 05:48:16 +0000935 Cond = Op + ".getReg() == " + Target.getName().str() + "::" +
936 CGA.ResultOperands[i].getRegister()->getName().str();
David Blaikie01d5be62015-08-06 19:23:33 +0000937 IAP.addCond(Cond);
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000938 break;
939 }
940
Tim Northoverd0e93f22014-05-15 13:36:01 +0000941 MIOpNum += RO.getMINumOperands();
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000942 }
943
944 if (CantHandle) continue;
Sjoerd Meijer6762cdb2016-06-03 13:14:19 +0000945
946 for (auto I = ReqFeatures.cbegin(); I != ReqFeatures.cend(); I++) {
947 Record *R = *I;
Craig Topper2a129872017-05-31 21:12:46 +0000948 StringRef AsmCondString = R->getValueAsString("AssemblerCondString");
Sjoerd Meijer6762cdb2016-06-03 13:14:19 +0000949
950 // AsmCondString has syntax [!]F(,[!]F)*
951 SmallVector<StringRef, 4> Ops;
952 SplitString(AsmCondString, Ops, ",");
953 assert(!Ops.empty() && "AssemblerCondString cannot be empty");
954
955 for (auto &Op : Ops) {
956 assert(!Op.empty() && "Empty operator");
957 if (Op[0] == '!')
Craig Topper2a129872017-05-31 21:12:46 +0000958 Cond = ("!STI.getFeatureBits()[" + Namespace + "::" + Op.substr(1) +
959 "]")
960 .str();
Sjoerd Meijer6762cdb2016-06-03 13:14:19 +0000961 else
Craig Topper2a129872017-05-31 21:12:46 +0000962 Cond =
963 ("STI.getFeatureBits()[" + Namespace + "::" + Op + "]").str();
Sjoerd Meijer6762cdb2016-06-03 13:14:19 +0000964 IAP.addCond(Cond);
965 }
966 }
967
David Blaikie01d5be62015-08-06 19:23:33 +0000968 IAPrinterMap[Aliases.first].push_back(std::move(IAP));
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000969 }
970 }
971
Tim Northoverd6cd0382014-05-12 18:04:06 +0000972 //////////////////////////////
973 // Write out the printAliasInstr function
974 //////////////////////////////
975
Bill Wendlingf415d8b2011-05-23 00:18:33 +0000976 std::string Header;
977 raw_string_ostream HeaderO(Header);
978
979 HeaderO << "bool " << Target.getName() << ClassName
Bill Wendling740e5b32011-06-14 03:17:20 +0000980 << "::printAliasInstr(const MCInst"
Akira Hatanakaf0937832015-03-27 20:36:02 +0000981 << " *MI, " << (PassSubtarget ? "const MCSubtargetInfo &STI, " : "")
982 << "raw_ostream &OS) {\n";
Bill Wendling3ce1b7d2011-03-21 08:59:17 +0000983
Bill Wendling44dcfd32011-04-07 21:20:06 +0000984 std::string Cases;
985 raw_string_ostream CasesO(Cases);
986
David Blaikie01d5be62015-08-06 19:23:33 +0000987 for (auto &Entry : IAPrinterMap) {
988 std::vector<IAPrinter> &IAPs = Entry.second;
Bill Wendling44dcfd32011-04-07 21:20:06 +0000989 std::vector<IAPrinter*> UniqueIAPs;
990
David Blaikie01d5be62015-08-06 19:23:33 +0000991 for (auto &LHS : IAPs) {
Bill Wendling44dcfd32011-04-07 21:20:06 +0000992 bool IsDup = false;
David Blaikie01d5be62015-08-06 19:23:33 +0000993 for (const auto &RHS : IAPs) {
994 if (&LHS != &RHS && LHS == RHS) {
Bill Wendling44dcfd32011-04-07 21:20:06 +0000995 IsDup = true;
996 break;
997 }
998 }
999
David Blaikie01d5be62015-08-06 19:23:33 +00001000 if (!IsDup)
1001 UniqueIAPs.push_back(&LHS);
Bill Wendling44dcfd32011-04-07 21:20:06 +00001002 }
1003
1004 if (UniqueIAPs.empty()) continue;
1005
David Blaikie01d5be62015-08-06 19:23:33 +00001006 CasesO.indent(2) << "case " << Entry.first << ":\n";
Bill Wendling44dcfd32011-04-07 21:20:06 +00001007
Craig Topper61614122016-01-08 07:06:32 +00001008 for (IAPrinter *IAP : UniqueIAPs) {
Bill Wendling44dcfd32011-04-07 21:20:06 +00001009 CasesO.indent(4);
Evan Cheng68ae5b42011-07-06 02:02:33 +00001010 IAP->print(CasesO);
Bill Wendling44dcfd32011-04-07 21:20:06 +00001011 CasesO << '\n';
1012 }
1013
Eric Christopher721ef662011-04-18 21:28:11 +00001014 CasesO.indent(4) << "return false;\n";
Bill Wendling44dcfd32011-04-07 21:20:06 +00001015 }
1016
Bill Wendling740e5b32011-06-14 03:17:20 +00001017 if (CasesO.str().empty()) {
Bill Wendlingf415d8b2011-05-23 00:18:33 +00001018 O << HeaderO.str();
Eric Christopher721ef662011-04-18 21:28:11 +00001019 O << " return false;\n";
Bill Wendling7520e3a2011-02-26 03:09:12 +00001020 O << "}\n\n";
1021 O << "#endif // PRINT_ALIAS_INSTR\n";
1022 return;
1023 }
1024
Alexander Kornienkob4c62672015-01-15 11:41:30 +00001025 if (!MCOpPredicates.empty())
Artyom Skrobov45a31492014-06-10 13:11:35 +00001026 O << "static bool " << Target.getName() << ClassName
Oliver Stannardce8e2a02015-12-01 10:48:51 +00001027 << "ValidateMCOperand(const MCOperand &MCOp,\n"
1028 << " const MCSubtargetInfo &STI,\n"
1029 << " unsigned PredicateIndex);\n";
Artyom Skrobov45a31492014-06-10 13:11:35 +00001030
Bill Wendlingf415d8b2011-05-23 00:18:33 +00001031 O << HeaderO.str();
Benjamin Kramer209a8c82013-09-11 15:42:16 +00001032 O.indent(2) << "const char *AsmString;\n";
Bill Wendling44dcfd32011-04-07 21:20:06 +00001033 O.indent(2) << "switch (MI->getOpcode()) {\n";
Eric Christopher721ef662011-04-18 21:28:11 +00001034 O.indent(2) << "default: return false;\n";
Bill Wendling44dcfd32011-04-07 21:20:06 +00001035 O << CasesO.str();
1036 O.indent(2) << "}\n\n";
Bill Wendling7520e3a2011-02-26 03:09:12 +00001037
1038 // Code that prints the alias, replacing the operands with the ones from the
1039 // MCInst.
Benjamin Kramer209a8c82013-09-11 15:42:16 +00001040 O << " unsigned I = 0;\n";
Sjoerd Meijerd02bd642016-06-03 13:17:37 +00001041 O << " while (AsmString[I] != ' ' && AsmString[I] != '\\t' &&\n";
1042 O << " AsmString[I] != '$' && AsmString[I] != '\\0')\n";
Benjamin Kramer209a8c82013-09-11 15:42:16 +00001043 O << " ++I;\n";
1044 O << " OS << '\\t' << StringRef(AsmString, I);\n";
Bill Wendling7520e3a2011-02-26 03:09:12 +00001045
Benjamin Kramer209a8c82013-09-11 15:42:16 +00001046 O << " if (AsmString[I] != '\\0') {\n";
Petar Jovanovic372866c2017-11-13 18:00:24 +00001047 O << " if (AsmString[I] == ' ' || AsmString[I] == '\\t') {\n";
Sjoerd Meijerd02bd642016-06-03 13:17:37 +00001048 O << " OS << '\\t';\n";
Petar Jovanovic372866c2017-11-13 18:00:24 +00001049 O << " ++I;\n";
1050 O << " }\n";
Benjamin Kramer209a8c82013-09-11 15:42:16 +00001051 O << " do {\n";
1052 O << " if (AsmString[I] == '$') {\n";
1053 O << " ++I;\n";
Tim Northoverd6cd0382014-05-12 18:04:06 +00001054 O << " if (AsmString[I] == (char)0xff) {\n";
1055 O << " ++I;\n";
1056 O << " int OpIdx = AsmString[I++] - 1;\n";
1057 O << " int PrintMethodIdx = AsmString[I++] - 1;\n";
Akira Hatanakaf0937832015-03-27 20:36:02 +00001058 O << " printCustomAliasOperand(MI, OpIdx, PrintMethodIdx, ";
1059 O << (PassSubtarget ? "STI, " : "");
1060 O << "OS);\n";
Tim Northoverd6cd0382014-05-12 18:04:06 +00001061 O << " } else\n";
Akira Hatanakaf0937832015-03-27 20:36:02 +00001062 O << " printOperand(MI, unsigned(AsmString[I++]) - 1, ";
1063 O << (PassSubtarget ? "STI, " : "");
1064 O << "OS);\n";
Bill Wendling7520e3a2011-02-26 03:09:12 +00001065 O << " } else {\n";
Benjamin Kramer209a8c82013-09-11 15:42:16 +00001066 O << " OS << AsmString[I++];\n";
Bill Wendling7520e3a2011-02-26 03:09:12 +00001067 O << " }\n";
Benjamin Kramer209a8c82013-09-11 15:42:16 +00001068 O << " } while (AsmString[I] != '\\0');\n";
Bill Wendling7520e3a2011-02-26 03:09:12 +00001069 O << " }\n\n";
Jim Grosbach016c6792012-04-18 18:56:33 +00001070
Eric Christopher721ef662011-04-18 21:28:11 +00001071 O << " return true;\n";
Bill Wendling7520e3a2011-02-26 03:09:12 +00001072 O << "}\n\n";
1073
Tim Northoverd6cd0382014-05-12 18:04:06 +00001074 //////////////////////////////
1075 // Write out the printCustomAliasOperand function
1076 //////////////////////////////
1077
1078 O << "void " << Target.getName() << ClassName << "::"
1079 << "printCustomAliasOperand(\n"
1080 << " const MCInst *MI, unsigned OpIdx,\n"
Akira Hatanakaf0937832015-03-27 20:36:02 +00001081 << " unsigned PrintMethodIdx,\n"
1082 << (PassSubtarget ? " const MCSubtargetInfo &STI,\n" : "")
1083 << " raw_ostream &OS) {\n";
Aaron Ballmanb37b01d2014-05-13 12:52:35 +00001084 if (PrintMethods.empty())
1085 O << " llvm_unreachable(\"Unknown PrintMethod kind\");\n";
1086 else {
1087 O << " switch (PrintMethodIdx) {\n"
1088 << " default:\n"
1089 << " llvm_unreachable(\"Unknown PrintMethod kind\");\n"
Tim Northoverd6cd0382014-05-12 18:04:06 +00001090 << " break;\n";
Tim Northoverd6cd0382014-05-12 18:04:06 +00001091
Aaron Ballmanb37b01d2014-05-13 12:52:35 +00001092 for (unsigned i = 0; i < PrintMethods.size(); ++i) {
1093 O << " case " << i << ":\n"
Akira Hatanakaf0937832015-03-27 20:36:02 +00001094 << " " << PrintMethods[i] << "(MI, OpIdx, "
1095 << (PassSubtarget ? "STI, " : "") << "OS);\n"
Aaron Ballmanb37b01d2014-05-13 12:52:35 +00001096 << " break;\n";
1097 }
1098 O << " }\n";
1099 }
1100 O << "}\n\n";
Tim Northoverd6cd0382014-05-12 18:04:06 +00001101
Alexander Kornienkob4c62672015-01-15 11:41:30 +00001102 if (!MCOpPredicates.empty()) {
Artyom Skrobov45a31492014-06-10 13:11:35 +00001103 O << "static bool " << Target.getName() << ClassName
Oliver Stannardce8e2a02015-12-01 10:48:51 +00001104 << "ValidateMCOperand(const MCOperand &MCOp,\n"
1105 << " const MCSubtargetInfo &STI,\n"
1106 << " unsigned PredicateIndex) {\n"
Artyom Skrobov45a31492014-06-10 13:11:35 +00001107 << " switch (PredicateIndex) {\n"
1108 << " default:\n"
1109 << " llvm_unreachable(\"Unknown MCOperandPredicate kind\");\n"
1110 << " break;\n";
1111
1112 for (unsigned i = 0; i < MCOpPredicates.size(); ++i) {
1113 Init *MCOpPred = MCOpPredicates[i]->getValueInit("MCOperandPredicate");
Tim Northoveredff0682016-07-05 21:22:55 +00001114 if (CodeInit *SI = dyn_cast<CodeInit>(MCOpPred)) {
Artyom Skrobov45a31492014-06-10 13:11:35 +00001115 O << " case " << i + 1 << ": {\n"
1116 << SI->getValue() << "\n"
1117 << " }\n";
1118 } else
1119 llvm_unreachable("Unexpected MCOperandPredicate field!");
1120 }
1121 O << " }\n"
1122 << "}\n\n";
1123 }
1124
Bill Wendling7520e3a2011-02-26 03:09:12 +00001125 O << "#endif // PRINT_ALIAS_INSTR\n";
1126}
Chris Lattner05af2612009-09-13 20:08:00 +00001127
Ahmed Bougacha254ce942013-10-28 18:07:17 +00001128AsmWriterEmitter::AsmWriterEmitter(RecordKeeper &R) : Records(R), Target(R) {
1129 Record *AsmWriter = Target.getAsmWriter();
Craig Topperced4b132016-01-13 07:20:05 +00001130 unsigned Variant = AsmWriter->getValueAsInt("Variant");
Ahmed Bougacha254ce942013-10-28 18:07:17 +00001131
1132 // Get the instruction numbering.
Craig Topper3356fb62016-01-17 20:38:14 +00001133 NumberedInstructions = Target.getInstructionsByEnumValue();
Ahmed Bougacha254ce942013-10-28 18:07:17 +00001134
Craig Topper3356fb62016-01-17 20:38:14 +00001135 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
1136 const CodeGenInstruction *I = NumberedInstructions[i];
Craig Topper73251b72016-01-17 08:05:33 +00001137 if (!I->AsmString.empty() && I->TheDef->getName() != "PHI")
1138 Instructions.emplace_back(*I, i, Variant);
1139 }
Ahmed Bougacha254ce942013-10-28 18:07:17 +00001140}
1141
Chris Lattner05af2612009-09-13 20:08:00 +00001142void AsmWriterEmitter::run(raw_ostream &O) {
Chris Lattner05af2612009-09-13 20:08:00 +00001143 EmitPrintInstruction(O);
1144 EmitGetRegisterName(O);
Bill Wendling7520e3a2011-02-26 03:09:12 +00001145 EmitPrintAliasInstruction(O);
Chris Lattner05af2612009-09-13 20:08:00 +00001146}
1147
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +00001148namespace llvm {
1149
1150void EmitAsmWriter(RecordKeeper &RK, raw_ostream &OS) {
1151 emitSourceFileHeader("Assembly Writer Source Fragment", OS);
1152 AsmWriterEmitter(RK).run(OS);
1153}
1154
Eugene Zelenkoc02caf52016-11-30 17:48:10 +00001155} // end namespace llvm