xref: /llvm-project/llvm/utils/TableGen/WebAssemblyDisassemblerEmitter.cpp (revision 92030635318d615f72cd0cd539e458f9cdd9949b)
1 //===- WebAssemblyDisassemblerEmitter.cpp - Disassembler tables -*- C++ -*-===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file is part of the WebAssembly Disassembler Emitter.
10 // It contains the implementation of the disassembler tables.
11 // Documentation for the disassembler emitter in general can be found in
12 // WebAssemblyDisassemblerEmitter.h.
13 //
14 //===----------------------------------------------------------------------===//
15 
16 #include "WebAssemblyDisassemblerEmitter.h"
17 #include "CodeGenInstruction.h"
18 #include "llvm/ADT/STLExtras.h"
19 #include "llvm/Support/raw_ostream.h"
20 #include "llvm/TableGen/Record.h"
21 
22 namespace llvm {
23 
24 static constexpr int WebAssemblyInstructionTableSize = 256;
25 
26 void emitWebAssemblyDisassemblerTables(
27     raw_ostream &OS,
28     const ArrayRef<const CodeGenInstruction *> &NumberedInstructions) {
29   // First lets organize all opcodes by (prefix) byte. Prefix 0 is the
30   // starting table.
31   std::map<unsigned,
32            std::map<unsigned, std::pair<unsigned, const CodeGenInstruction *>>>
33       OpcodeTable;
34   for (unsigned I = 0; I != NumberedInstructions.size(); ++I) {
35     auto &CGI = *NumberedInstructions[I];
36     auto &Def = *CGI.TheDef;
37     if (!Def.getValue("Inst"))
38       continue;
39     auto &Inst = *Def.getValueAsBitsInit("Inst");
40     RecordKeeper &RK = Inst.getRecordKeeper();
41     unsigned Opc = static_cast<unsigned>(
42         cast<IntInit>(Inst.convertInitializerTo(IntRecTy::get(RK)))
43             ->getValue());
44     if (Opc == 0xFFFFFFFF)
45       continue; // No opcode defined.
46     assert(Opc <= 0xFFFFFF);
47     unsigned Prefix;
48     if (Opc <= 0xFFFF) {
49       Prefix = Opc >> 8;
50       Opc = Opc & 0xFF;
51     } else {
52       Prefix = Opc >> 16;
53       Opc = Opc & 0xFFFF;
54     }
55     auto &CGIP = OpcodeTable[Prefix][Opc];
56     // All wasm instructions have a StackBased field of type string, we only
57     // want the instructions for which this is "true".
58     auto StackString =
59         Def.getValue("StackBased")->getValue()->getCastTo(StringRecTy::get(RK));
60     auto IsStackBased =
61         StackString &&
62         reinterpret_cast<const StringInit *>(StackString)->getValue() == "true";
63     if (!IsStackBased)
64       continue;
65     if (CGIP.second) {
66       // We already have an instruction for this slot, so decide which one
67       // should be the canonical one. This determines which variant gets
68       // printed in a disassembly. We want e.g. "call" not "i32.call", and
69       // "end" when we don't know if its "end_loop" or "end_block" etc.
70       bool IsCanonicalExisting = CGIP.second->TheDef->getValueAsBit("IsCanonical");
71       // We already have one marked explicitly as canonical, so keep it.
72       if (IsCanonicalExisting)
73         continue;
74       bool IsCanonicalNew = Def.getValueAsBit("IsCanonical");
75       // If the new one is explicitly marked as canonical, take it.
76       if (!IsCanonicalNew) {
77         // Neither the existing or new instruction is canonical.
78         // Pick the one with the shortest name as heuristic.
79         // Though ideally IsCanonical is always defined for at least one
80         // variant so this never has to apply.
81         if (CGIP.second->AsmString.size() <= CGI.AsmString.size())
82           continue;
83       }
84     }
85     // Set this instruction as the one to use.
86     CGIP = std::make_pair(I, &CGI);
87   }
88   OS << "#include \"MCTargetDesc/WebAssemblyMCTargetDesc.h\"\n";
89   OS << "\n";
90   OS << "namespace llvm {\n\n";
91   OS << "static constexpr int WebAssemblyInstructionTableSize = ";
92   OS << WebAssemblyInstructionTableSize << ";\n\n";
93   OS << "enum EntryType : uint8_t { ";
94   OS << "ET_Unused, ET_Prefix, ET_Instruction };\n\n";
95   OS << "struct WebAssemblyInstruction {\n";
96   OS << "  uint16_t Opcode;\n";
97   OS << "  EntryType ET;\n";
98   OS << "  uint8_t NumOperands;\n";
99   OS << "  uint16_t OperandStart;\n";
100   OS << "};\n\n";
101   std::vector<std::string> OperandTable, CurOperandList;
102   // Output one table per prefix.
103   for (auto &PrefixPair : OpcodeTable) {
104     if (PrefixPair.second.empty())
105       continue;
106     OS << "WebAssemblyInstruction InstructionTable" << PrefixPair.first;
107     OS << "[] = {\n";
108     for (unsigned I = 0; I < WebAssemblyInstructionTableSize; I++) {
109       auto InstIt = PrefixPair.second.find(I);
110       if (InstIt != PrefixPair.second.end()) {
111         // Regular instruction.
112         assert(InstIt->second.second);
113         auto &CGI = *InstIt->second.second;
114         OS << "  // 0x";
115         OS.write_hex(static_cast<unsigned long long>(I));
116         OS << ": " << CGI.AsmString << "\n";
117         OS << "  { " << InstIt->second.first << ", ET_Instruction, ";
118         OS << CGI.Operands.OperandList.size() << ", ";
119         // Collect operand types for storage in a shared list.
120         CurOperandList.clear();
121         for (auto &Op : CGI.Operands.OperandList) {
122           assert(Op.OperandType != "MCOI::OPERAND_UNKNOWN");
123           CurOperandList.push_back(Op.OperandType);
124         }
125         // See if we already have stored this sequence before. This is not
126         // strictly necessary but makes the table really small.
127         size_t OperandStart = OperandTable.size();
128         if (CurOperandList.size() <= OperandTable.size()) {
129           for (size_t J = 0; J <= OperandTable.size() - CurOperandList.size();
130                ++J) {
131             size_t K = 0;
132             for (; K < CurOperandList.size(); ++K) {
133               if (OperandTable[J + K] != CurOperandList[K]) break;
134             }
135             if (K == CurOperandList.size()) {
136               OperandStart = J;
137               break;
138             }
139           }
140         }
141         // Store operands if no prior occurrence.
142         if (OperandStart == OperandTable.size()) {
143           llvm::append_range(OperandTable, CurOperandList);
144         }
145         OS << OperandStart;
146       } else {
147         auto PrefixIt = OpcodeTable.find(I);
148         // If we have a non-empty table for it that's not 0, this is a prefix.
149         if (PrefixIt != OpcodeTable.end() && I && !PrefixPair.first) {
150           OS << "  { 0, ET_Prefix, 0, 0";
151         } else {
152           OS << "  { 0, ET_Unused, 0, 0";
153         }
154       }
155       OS << "  },\n";
156     }
157     OS << "};\n\n";
158   }
159   // Create a table of all operands:
160   OS << "const uint8_t OperandTable[] = {\n";
161   for (auto &Op : OperandTable) {
162     OS << "  " << Op << ",\n";
163   }
164   OS << "};\n\n";
165   // Create a table of all extension tables:
166   OS << "struct { uint8_t Prefix; const WebAssemblyInstruction *Table; }\n";
167   OS << "PrefixTable[] = {\n";
168   for (auto &PrefixPair : OpcodeTable) {
169     if (PrefixPair.second.empty() || !PrefixPair.first)
170       continue;
171     OS << "  { " << PrefixPair.first << ", InstructionTable"
172        << PrefixPair.first;
173     OS << " },\n";
174   }
175   OS << "  { 0, nullptr }\n};\n\n";
176   OS << "} // end namespace llvm\n";
177 }
178 
179 } // namespace llvm
180