blob: 23751a2cbfba09cf0d26c24ba4ff8e34cbca91a7 [file] [log] [blame]
Chris Lattnerc9670ef2003-07-31 04:43:49 +00001//===- CodeEmitterGen.cpp - Code Emitter Generator ------------------------===//
Misha Brukman3da94ae2005-04-22 00:00:37 +00002//
John Criswell01d45822003-10-20 20:20:30 +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//
John Criswell01d45822003-10-20 20:20:30 +00008//===----------------------------------------------------------------------===//
Chris Lattnerc9670ef2003-07-31 04:43:49 +00009//
Misha Brukman4e4f8632004-08-04 22:07:54 +000010// CodeEmitterGen uses the descriptions of instructions and their fields to
11// construct an automated code emitter: a function that, given a MachineInstr,
12// returns the (currently, 32-bit unsigned) value of the instruction.
Chris Lattnerc9670ef2003-07-31 04:43:49 +000013//
14//===----------------------------------------------------------------------===//
15
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000016#include "CodeGenInstruction.h"
Misha Brukmand7a5b282004-08-09 19:10:43 +000017#include "CodeGenTarget.h"
Daniel Sandersb313c742016-11-19 13:05:44 +000018#include "SubtargetFeatureInfo.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000019#include "llvm/ADT/ArrayRef.h"
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000020#include "llvm/ADT/StringExtras.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000021#include "llvm/Support/Casting.h"
22#include "llvm/Support/raw_ostream.h"
Chandler Carruth4ffd89f2012-12-04 10:37:14 +000023#include "llvm/TableGen/Record.h"
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000024#include "llvm/TableGen/TableGenBackend.h"
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000025#include <cassert>
26#include <cstdint>
Bill Wendlingeac8f352010-12-13 01:05:54 +000027#include <map>
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000028#include <set>
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000029#include <string>
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000030#include <utility>
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000031#include <vector>
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000032
Chris Lattner2082ebe2004-08-01 03:55:39 +000033using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000034
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000035namespace {
36
37class CodeEmitterGen {
38 RecordKeeper &Records;
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000039
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000040public:
41 CodeEmitterGen(RecordKeeper &R) : Records(R) {}
42
43 void run(raw_ostream &o);
Eugene Zelenkoc02caf52016-11-30 17:48:10 +000044
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000045private:
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000046 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
47 std::string getInstructionCase(Record *R, CodeGenTarget &Target);
48 void AddCodeToMergeInOperand(Record *R, BitsInit *BI,
49 const std::string &VarName,
50 unsigned &NumberedOp,
Hal Finkel79c15b22014-03-13 07:57:54 +000051 std::set<unsigned> &NamedOpIndices,
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +000052 std::string &Case, CodeGenTarget &Target);
53
54};
55
Jim Laskeycb129032006-07-13 22:17:08 +000056// If the VarBitInit at position 'bit' matches the specified variable then
57// return the variable bit position. Otherwise return -1.
Dan Gohman9b03da62009-12-15 20:21:44 +000058int CodeEmitterGen::getVariableBit(const std::string &VarName,
David Greene05bce0b2011-07-29 22:43:06 +000059 BitsInit *BI, int bit) {
Sean Silva6cfc8062012-10-10 20:24:43 +000060 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) {
61 if (VarInit *VI = dyn_cast<VarInit>(VBI->getBitVar()))
Chris Lattner98e969a2010-11-15 06:42:13 +000062 if (VI->getName() == VarName)
63 return VBI->getBitNum();
Sean Silva6cfc8062012-10-10 20:24:43 +000064 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) {
Owen Anderson4cdcb472011-04-28 17:51:45 +000065 if (VI->getName() == VarName)
66 return 0;
67 }
Jim Grosbach8b892ae2010-10-07 16:56:28 +000068
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000069 return -1;
Jim Grosbach8b892ae2010-10-07 16:56:28 +000070}
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000071
Chris Lattner16201172010-11-15 06:59:17 +000072void CodeEmitterGen::
David Greene05bce0b2011-07-29 22:43:06 +000073AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName,
Eric Christopherd568b3f2011-07-11 23:06:52 +000074 unsigned &NumberedOp,
Hal Finkel79c15b22014-03-13 07:57:54 +000075 std::set<unsigned> &NamedOpIndices,
Chris Lattner16201172010-11-15 06:59:17 +000076 std::string &Case, CodeGenTarget &Target) {
Chris Lattner16201172010-11-15 06:59:17 +000077 CodeGenInstruction &CGI = Target.getInstruction(R);
78
Chris Lattner8ae082b2010-11-15 07:09:28 +000079 // Determine if VarName actually contributes to the Inst encoding.
80 int bit = BI->getNumBits()-1;
81
82 // Scan for a bit that this contributed to.
83 for (; bit >= 0; ) {
84 if (getVariableBit(VarName, BI, bit) != -1)
85 break;
86
87 --bit;
88 }
89
90 // If we found no bits, ignore this value, otherwise emit the call to get the
91 // operand encoding.
92 if (bit < 0) return;
93
94 // If the operand matches by name, reference according to that
95 // operand number. Non-matching operands are assumed to be in
96 // order.
97 unsigned OpIdx;
98 if (CGI.Operands.hasOperandNamed(VarName, OpIdx)) {
99 // Get the machine operand number for the indicated operand.
100 OpIdx = CGI.Operands[OpIdx].MIOperandNo;
101 assert(!CGI.Operands.isFlatOperandNotEmitted(OpIdx) &&
102 "Explicitly used operand also marked as not emitted!");
103 } else {
Evandro Menezesf1bb4212012-11-09 20:29:37 +0000104 unsigned NumberOps = CGI.Operands.size();
Chris Lattner8ae082b2010-11-15 07:09:28 +0000105 /// If this operand is not supposed to be emitted by the
106 /// generated emitter, skip it.
Evandro Menezesf1bb4212012-11-09 20:29:37 +0000107 while (NumberedOp < NumberOps &&
Hal Finkel79c15b22014-03-13 07:57:54 +0000108 (CGI.Operands.isFlatOperandNotEmitted(NumberedOp) ||
Alexander Kornienkob4c62672015-01-15 11:41:30 +0000109 (!NamedOpIndices.empty() && NamedOpIndices.count(
Hal Finkelf20a2192014-03-22 11:33:32 +0000110 CGI.Operands.getSubOperandNumber(NumberedOp).first)))) {
Chris Lattner8ae082b2010-11-15 07:09:28 +0000111 ++NumberedOp;
Evandro Menezesf1adbfe2012-11-09 21:27:03 +0000112
Hal Finkelf20a2192014-03-22 11:33:32 +0000113 if (NumberedOp >= CGI.Operands.back().MIOperandNo +
114 CGI.Operands.back().MINumOperands) {
115 errs() << "Too few operands in record " << R->getName() <<
116 " (no match for variable " << VarName << "):\n";
117 errs() << *R;
118 errs() << '\n';
119
120 return;
121 }
122 }
123
Chris Lattner8ae082b2010-11-15 07:09:28 +0000124 OpIdx = NumberedOp++;
125 }
126
127 std::pair<unsigned, unsigned> SO = CGI.Operands.getSubOperandNumber(OpIdx);
128 std::string &EncoderMethodName = CGI.Operands[SO.first].EncoderMethodName;
129
130 // If the source operand has a custom encoder, use it. This will
131 // get the encoding for all of the suboperands.
132 if (!EncoderMethodName.empty()) {
133 // A custom encoder has all of the information for the
134 // sub-operands, if there are more than one, so only
135 // query the encoder once per source operand.
136 if (SO.second == 0) {
137 Case += " // op: " + VarName + "\n" +
138 " op = " + EncoderMethodName + "(MI, " + utostr(OpIdx);
Eric Christopherd5dd8ce2014-09-02 22:28:02 +0000139 Case += ", Fixups, STI";
Chris Lattner8ae082b2010-11-15 07:09:28 +0000140 Case += ");\n";
141 }
142 } else {
143 Case += " // op: " + VarName + "\n" +
144 " op = getMachineOpValue(MI, MI.getOperand(" + utostr(OpIdx) + ")";
Eric Christopherd5dd8ce2014-09-02 22:28:02 +0000145 Case += ", Fixups, STI";
Chris Lattner8ae082b2010-11-15 07:09:28 +0000146 Case += ");\n";
147 }
148
149 for (; bit >= 0; ) {
Chris Lattner16201172010-11-15 06:59:17 +0000150 int varBit = getVariableBit(VarName, BI, bit);
151
152 // If this bit isn't from a variable, skip it.
153 if (varBit == -1) {
154 --bit;
155 continue;
156 }
157
Bob Wilson9b8c3532011-01-27 23:08:52 +0000158 // Figure out the consecutive range of bits covered by this operand, in
Chris Lattner16201172010-11-15 06:59:17 +0000159 // order to generate better encoding code.
160 int beginInstBit = bit;
161 int beginVarBit = varBit;
162 int N = 1;
163 for (--bit; bit >= 0;) {
164 varBit = getVariableBit(VarName, BI, bit);
165 if (varBit == -1 || varBit != (beginVarBit - N)) break;
166 ++N;
167 --bit;
168 }
Chris Lattner8ae082b2010-11-15 07:09:28 +0000169
NAKAMURA Takumi89d81392012-03-09 14:52:44 +0000170 uint64_t opMask = ~(uint64_t)0 >> (64-N);
Chris Lattner16201172010-11-15 06:59:17 +0000171 int opShift = beginVarBit - N + 1;
172 opMask <<= opShift;
173 opShift = beginInstBit - beginVarBit;
174
175 if (opShift > 0) {
Owen Anderson4f8dc7b2012-01-24 18:37:29 +0000176 Case += " Value |= (op & UINT64_C(" + utostr(opMask) + ")) << " +
Chris Lattner16201172010-11-15 06:59:17 +0000177 itostr(opShift) + ";\n";
178 } else if (opShift < 0) {
Owen Anderson4f8dc7b2012-01-24 18:37:29 +0000179 Case += " Value |= (op & UINT64_C(" + utostr(opMask) + ")) >> " +
Chris Lattner16201172010-11-15 06:59:17 +0000180 itostr(-opShift) + ";\n";
181 } else {
Owen Anderson4f8dc7b2012-01-24 18:37:29 +0000182 Case += " Value |= op & UINT64_C(" + utostr(opMask) + ");\n";
Chris Lattner16201172010-11-15 06:59:17 +0000183 }
184 }
185}
186
Chris Lattner16201172010-11-15 06:59:17 +0000187std::string CodeEmitterGen::getInstructionCase(Record *R,
188 CodeGenTarget &Target) {
189 std::string Case;
David Greene05bce0b2011-07-29 22:43:06 +0000190 BitsInit *BI = R->getValueAsBitsInit("Inst");
Chris Lattner16201172010-11-15 06:59:17 +0000191 unsigned NumberedOp = 0;
Hal Finkel79c15b22014-03-13 07:57:54 +0000192 std::set<unsigned> NamedOpIndices;
Alexander Shaposhnikovd6059bd2017-07-04 06:16:53 +0000193
Hal Finkel79c15b22014-03-13 07:57:54 +0000194 // Collect the set of operand indices that might correspond to named
195 // operand, and skip these when assigning operands based on position.
196 if (Target.getInstructionSet()->
197 getValueAsBit("noNamedPositionallyEncodedOperands")) {
198 CodeGenInstruction &CGI = Target.getInstruction(R);
Alexander Shaposhnikovd6059bd2017-07-04 06:16:53 +0000199 for (const RecordVal &RV : R->getValues()) {
Hal Finkel79c15b22014-03-13 07:57:54 +0000200 unsigned OpIdx;
Alexander Shaposhnikovd6059bd2017-07-04 06:16:53 +0000201 if (!CGI.Operands.hasOperandNamed(RV.getName(), OpIdx))
Hal Finkel79c15b22014-03-13 07:57:54 +0000202 continue;
203
204 NamedOpIndices.insert(OpIdx);
205 }
206 }
207
Chris Lattner16201172010-11-15 06:59:17 +0000208 // Loop over all of the fields in the instruction, determining which are the
209 // operands to the instruction.
Alexander Shaposhnikovd6059bd2017-07-04 06:16:53 +0000210 for (const RecordVal &RV : R->getValues()) {
Chris Lattner16201172010-11-15 06:59:17 +0000211 // Ignore fixed fields in the record, we're looking for values like:
212 // bits<5> RST = { ?, ?, ?, ?, ? };
Alexander Shaposhnikovd6059bd2017-07-04 06:16:53 +0000213 if (RV.getPrefix() || RV.getValue()->isComplete())
Chris Lattner16201172010-11-15 06:59:17 +0000214 continue;
215
Alexander Shaposhnikovd6059bd2017-07-04 06:16:53 +0000216 AddCodeToMergeInOperand(R, BI, RV.getName(), NumberedOp,
Hal Finkel79c15b22014-03-13 07:57:54 +0000217 NamedOpIndices, Case, Target);
Chris Lattner16201172010-11-15 06:59:17 +0000218 }
Craig Topper2a129872017-05-31 21:12:46 +0000219
220 StringRef PostEmitter = R->getValueAsString("PostEncoderMethod");
David Woodhouse4faa8612014-01-28 23:13:18 +0000221 if (!PostEmitter.empty()) {
Craig Topper2a129872017-05-31 21:12:46 +0000222 Case += " Value = ";
223 Case += PostEmitter;
224 Case += "(MI, Value";
Eric Christopherd5dd8ce2014-09-02 22:28:02 +0000225 Case += ", STI";
David Woodhouse4faa8612014-01-28 23:13:18 +0000226 Case += ");\n";
227 }
Chris Lattner16201172010-11-15 06:59:17 +0000228
229 return Case;
230}
231
Daniel Dunbar1a551802009-07-03 00:10:29 +0000232void CodeEmitterGen::run(raw_ostream &o) {
Chris Lattner67db8832010-12-13 00:23:57 +0000233 CodeGenTarget Target(Records);
Chris Lattner048c00d2003-08-01 04:38:18 +0000234 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction");
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000235
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000236 // For little-endian instruction bit encodings, reverse the bit order
Hal Finkelaf73dfe2013-12-17 22:37:50 +0000237 Target.reverseBitsForLittleEndianEncoding();
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000238
Craig Topper3f0462d2016-02-01 01:33:42 +0000239 ArrayRef<const CodeGenInstruction*> NumberedInstructions =
Chris Lattnerf6502782010-03-19 00:34:35 +0000240 Target.getInstructionsByEnumValue();
Misha Brukman9fff7e12003-05-24 00:15:53 +0000241
Misha Brukmanad346ad2004-08-10 20:54:58 +0000242 // Emit function declaration
Owen Anderson4f8dc7b2012-01-24 18:37:29 +0000243 o << "uint64_t " << Target.getName();
Eric Christopherd5dd8ce2014-09-02 22:28:02 +0000244 o << "MCCodeEmitter::getBinaryCodeForInstr(const MCInst &MI,\n"
245 << " SmallVectorImpl<MCFixup> &Fixups,\n"
246 << " const MCSubtargetInfo &STI) const {\n";
Misha Brukmanad346ad2004-08-10 20:54:58 +0000247
Jim Laskeyed393432006-07-12 19:15:43 +0000248 // Emit instruction base values
Owen Anderson40530ad2012-03-06 21:48:32 +0000249 o << " static const uint64_t InstBits[] = {\n";
Craig Topper3f0462d2016-02-01 01:33:42 +0000250 for (const CodeGenInstruction *CGI : NumberedInstructions) {
Jim Laskeyed393432006-07-12 19:15:43 +0000251 Record *R = CGI->TheDef;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000252
Jim Grosbach806fcc02011-07-06 21:33:38 +0000253 if (R->getValueAsString("Namespace") == "TargetOpcode" ||
254 R->getValueAsBit("isPseudo")) {
Owen Anderson4f8dc7b2012-01-24 18:37:29 +0000255 o << " UINT64_C(0),\n";
Jim Laskeyed393432006-07-12 19:15:43 +0000256 continue;
257 }
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000258
David Greene05bce0b2011-07-29 22:43:06 +0000259 BitsInit *BI = R->getValueAsBitsInit("Inst");
Misha Brukman9fff7e12003-05-24 00:15:53 +0000260
Chris Lattner16201172010-11-15 06:59:17 +0000261 // Start by filling in fixed values.
Owen Anderson40530ad2012-03-06 21:48:32 +0000262 uint64_t Value = 0;
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000263 for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i) {
Sean Silva6cfc8062012-10-10 20:24:43 +0000264 if (BitInit *B = dyn_cast<BitInit>(BI->getBit(e-i-1)))
Owen Anderson40530ad2012-03-06 21:48:32 +0000265 Value |= (uint64_t)B->getValue() << (e-i-1);
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000266 }
Owen Anderson4f8dc7b2012-01-24 18:37:29 +0000267 o << " UINT64_C(" << Value << ")," << '\t' << "// " << R->getName() << "\n";
Jim Laskeyed393432006-07-12 19:15:43 +0000268 }
Owen Anderson4f8dc7b2012-01-24 18:37:29 +0000269 o << " UINT64_C(0)\n };\n";
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000270
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000271 // Map to accumulate all the cases.
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000272 std::map<std::string, std::vector<std::string>> CaseMap;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000273
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000274 // Construct all cases statement for each opcode
275 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end();
276 IC != EC; ++IC) {
277 Record *R = *IC;
Jim Grosbach806fcc02011-07-06 21:33:38 +0000278 if (R->getValueAsString("Namespace") == "TargetOpcode" ||
279 R->getValueAsBit("isPseudo"))
Jakob Stoklund Olesen65766ce2010-07-02 21:44:22 +0000280 continue;
Craig Topperc469be32017-05-31 19:01:11 +0000281 std::string InstName =
282 (R->getValueAsString("Namespace") + "::" + R->getName()).str();
Chris Lattner16201172010-11-15 06:59:17 +0000283 std::string Case = getInstructionCase(R, Target);
Dan Gohmanf8c73942009-04-13 15:38:05 +0000284
Craig Topperc469be32017-05-31 19:01:11 +0000285 CaseMap[Case].push_back(std::move(InstName));
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000286 }
Misha Brukman9fff7e12003-05-24 00:15:53 +0000287
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000288 // Emit initial function code
289 o << " const unsigned opcode = MI.getOpcode();\n"
Owen Anderson40530ad2012-03-06 21:48:32 +0000290 << " uint64_t Value = InstBits[opcode];\n"
291 << " uint64_t op = 0;\n"
Jeffrey Yasskin8e68c382010-12-23 00:58:24 +0000292 << " (void)op; // suppress warning\n"
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000293 << " switch (opcode) {\n";
294
295 // Emit each case statement
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000296 std::map<std::string, std::vector<std::string>>::iterator IE, EE;
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000297 for (IE = CaseMap.begin(), EE = CaseMap.end(); IE != EE; ++IE) {
298 const std::string &Case = IE->first;
299 std::vector<std::string> &InstList = IE->second;
300
301 for (int i = 0, N = InstList.size(); i < N; i++) {
302 if (i) o << "\n";
Jim Grosbach0ed92f22011-02-03 23:26:36 +0000303 o << " case " << InstList[i] << ":";
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000304 }
305 o << " {\n";
306 o << Case;
Misha Brukman9fff7e12003-05-24 00:15:53 +0000307 o << " break;\n"
308 << " }\n";
309 }
Misha Brukman7eac4762003-07-15 21:00:32 +0000310
Misha Brukman28eefa52004-10-14 05:53:01 +0000311 // Default case: unhandled opcode
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000312 o << " default:\n"
Alp Toker8dd8d5c2014-06-26 22:52:05 +0000313 << " std::string msg;\n"
314 << " raw_string_ostream Msg(msg);\n"
Torok Edwin804e0fe2009-07-08 19:04:27 +0000315 << " Msg << \"Not supported instr: \" << MI;\n"
Chris Lattner75361b62010-04-07 22:58:41 +0000316 << " report_fatal_error(Msg.str());\n"
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000317 << " }\n"
Misha Brukman9fff7e12003-05-24 00:15:53 +0000318 << " return Value;\n"
Misha Brukman28eefa52004-10-14 05:53:01 +0000319 << "}\n\n";
Daniel Sandersb313c742016-11-19 13:05:44 +0000320
321 const auto &All = SubtargetFeatureInfo::getAll(Records);
322 std::map<Record *, SubtargetFeatureInfo, LessRecordByID> SubtargetFeatures;
323 SubtargetFeatures.insert(All.begin(), All.end());
324
325 o << "#ifdef ENABLE_INSTR_PREDICATE_VERIFIER\n"
326 << "#undef ENABLE_INSTR_PREDICATE_VERIFIER\n"
327 << "#include <sstream>\n\n";
328
329 // Emit the subtarget feature enumeration.
330 SubtargetFeatureInfo::emitSubtargetFeatureFlagEnumeration(SubtargetFeatures,
331 o);
332
333 // Emit the name table for error messages.
334 o << "#ifndef NDEBUG\n";
335 SubtargetFeatureInfo::emitNameTable(SubtargetFeatures, o);
336 o << "#endif // NDEBUG\n";
337
338 // Emit the available features compute function.
Daniel Sanderse8660ea2017-04-21 15:59:56 +0000339 SubtargetFeatureInfo::emitComputeAssemblerAvailableFeatures(
Daniel Sandersb313c742016-11-19 13:05:44 +0000340 Target.getName(), "MCCodeEmitter", "computeAvailableFeatures",
341 SubtargetFeatures, o);
342
343 // Emit the predicate verifier.
344 o << "void " << Target.getName()
345 << "MCCodeEmitter::verifyInstructionPredicates(\n"
346 << " const MCInst &Inst, uint64_t AvailableFeatures) const {\n"
347 << "#ifndef NDEBUG\n"
348 << " static uint64_t RequiredFeatures[] = {\n";
349 unsigned InstIdx = 0;
350 for (const CodeGenInstruction *Inst : Target.getInstructionsByEnumValue()) {
351 o << " ";
352 for (Record *Predicate : Inst->TheDef->getValueAsListOfDefs("Predicates")) {
353 const auto &I = SubtargetFeatures.find(Predicate);
354 if (I != SubtargetFeatures.end())
355 o << I->second.getEnumName() << " | ";
356 }
357 o << "0, // " << Inst->TheDef->getName() << " = " << InstIdx << "\n";
358 InstIdx++;
359 }
360 o << " };\n\n";
361 o << " assert(Inst.getOpcode() < " << InstIdx << ");\n";
362 o << " uint64_t MissingFeatures =\n"
363 << " (AvailableFeatures & RequiredFeatures[Inst.getOpcode()]) ^\n"
364 << " RequiredFeatures[Inst.getOpcode()];\n"
365 << " if (MissingFeatures) {\n"
366 << " std::ostringstream Msg;\n"
Daniel Sandersc1704292016-11-19 14:47:41 +0000367 << " Msg << \"Attempting to emit \" << "
368 "MCII.getName(Inst.getOpcode()).str()\n"
Daniel Sandersb313c742016-11-19 13:05:44 +0000369 << " << \" instruction but the \";\n"
370 << " for (unsigned i = 0; i < 8 * sizeof(MissingFeatures); ++i)\n"
371 << " if (MissingFeatures & (1ULL << i))\n"
372 << " Msg << SubtargetFeatureNames[i] << \" \";\n"
373 << " Msg << \"predicate(s) are not met\";\n"
374 << " report_fatal_error(Msg.str());\n"
375 << " }\n"
Daniel Sandersc1704292016-11-19 14:47:41 +0000376 << "#else\n"
377 << "// Silence unused variable warning on targets that don't use MCII for "
378 "other purposes (e.g. BPF).\n"
379 << "(void)MCII;\n"
Daniel Sandersb313c742016-11-19 13:05:44 +0000380 << "#endif // NDEBUG\n";
381 o << "}\n";
382 o << "#endif\n";
Misha Brukman9fff7e12003-05-24 00:15:53 +0000383}
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +0000384
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000385} // end anonymous namespace
Jakob Stoklund Olesen6f36fa92012-06-11 15:37:55 +0000386
387namespace llvm {
388
389void EmitCodeEmitter(RecordKeeper &RK, raw_ostream &OS) {
390 emitSourceFileHeader("Machine Code Emitter", OS);
391 CodeEmitterGen(RK).run(OS);
392}
393
Eugene Zelenkoc02caf52016-11-30 17:48:10 +0000394} // end namespace llvm