blob: 3a846ef366c57e3bfd603d713c17728995f45ae2 [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
Misha Brukman9fff7e12003-05-24 00:15:53 +000016#include "CodeEmitterGen.h"
Misha Brukmand7a5b282004-08-09 19:10:43 +000017#include "CodeGenTarget.h"
Chris Lattnerc9670ef2003-07-31 04:43:49 +000018#include "Record.h"
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000019#include "llvm/ADT/StringExtras.h"
Jim Grosbachab3d00e2010-11-02 17:35:25 +000020#include "llvm/Support/CommandLine.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000021#include "llvm/Support/Debug.h"
Bill Wendlingeac8f352010-12-13 01:05:54 +000022#include <map>
Chris Lattner2082ebe2004-08-01 03:55:39 +000023using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000024
Jim Grosbach60aaa762010-11-03 23:38:14 +000025// FIXME: Somewhat hackish to use a command line option for this. There should
26// be a CodeEmitter class in the Target.td that controls this sort of thing
27// instead.
Jim Grosbachab3d00e2010-11-02 17:35:25 +000028static cl::opt<bool>
Jim Grosbach60aaa762010-11-03 23:38:14 +000029MCEmitter("mc-emitter",
Jim Grosbachab3d00e2010-11-02 17:35:25 +000030 cl::desc("Generate CodeEmitter for use with the MC library."),
31 cl::init(false));
32
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000033void CodeEmitterGen::reverseBits(std::vector<Record*> &Insts) {
34 for (std::vector<Record*>::iterator I = Insts.begin(), E = Insts.end();
35 I != E; ++I) {
36 Record *R = *I;
Jim Grosbach806fcc02011-07-06 21:33:38 +000037 if (R->getValueAsString("Namespace") == "TargetOpcode" ||
38 R->getValueAsBit("isPseudo"))
Jakob Stoklund Olesen65766ce2010-07-02 21:44:22 +000039 continue;
Dan Gohmanf8c73942009-04-13 15:38:05 +000040
David Greened4a90662011-07-11 18:25:51 +000041 const BitsInit *BI = R->getValueAsBitsInit("Inst");
Misha Brukman28eefa52004-10-14 05:53:01 +000042
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000043 unsigned numBits = BI->getNumBits();
David Greened4a90662011-07-11 18:25:51 +000044
45 SmallVector<const Init *, 16> NewBits(numBits);
46
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000047 for (unsigned bit = 0, end = numBits / 2; bit != end; ++bit) {
48 unsigned bitSwapIdx = numBits - bit - 1;
David Greened4a90662011-07-11 18:25:51 +000049 const Init *OrigBit = BI->getBit(bit);
50 const Init *BitSwap = BI->getBit(bitSwapIdx);
51 NewBits[bit] = BitSwap;
52 NewBits[bitSwapIdx] = OrigBit;
Misha Brukman28eefa52004-10-14 05:53:01 +000053 }
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000054 if (numBits % 2) {
55 unsigned middle = (numBits + 1) / 2;
David Greened4a90662011-07-11 18:25:51 +000056 NewBits[middle] = BI->getBit(middle);
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000057 }
David Greened4a90662011-07-11 18:25:51 +000058
David Greene5e3cb472011-07-11 20:55:22 +000059 const BitsInit *NewBI = BitsInit::get(NewBits.begin(), NewBits.end());
Jim Grosbach8b892ae2010-10-07 16:56:28 +000060
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000061 // Update the bits in reversed order so that emitInstrOpBits will get the
62 // correct endianness.
63 R->getValue("Inst")->setValue(NewBI);
Misha Brukman28eefa52004-10-14 05:53:01 +000064 }
65}
66
Jim Laskeycb129032006-07-13 22:17:08 +000067// If the VarBitInit at position 'bit' matches the specified variable then
68// return the variable bit position. Otherwise return -1.
Dan Gohman9b03da62009-12-15 20:21:44 +000069int CodeEmitterGen::getVariableBit(const std::string &VarName,
David Greened4a90662011-07-11 18:25:51 +000070 const BitsInit *BI, int bit) {
71 if (const VarBitInit *VBI =
72 dynamic_cast<const VarBitInit*>(BI->getBit(bit))) {
73 if (const VarInit *VI = dynamic_cast<const VarInit*>(VBI->getVariable()))
Chris Lattner98e969a2010-11-15 06:42:13 +000074 if (VI->getName() == VarName)
75 return VBI->getBitNum();
David Greened4a90662011-07-11 18:25:51 +000076 } else if (const VarInit *VI =
77 dynamic_cast<const VarInit*>(BI->getBit(bit))) {
Owen Anderson4cdcb472011-04-28 17:51:45 +000078 if (VI->getName() == VarName)
79 return 0;
80 }
Jim Grosbach8b892ae2010-10-07 16:56:28 +000081
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000082 return -1;
Jim Grosbach8b892ae2010-10-07 16:56:28 +000083}
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000084
Chris Lattner16201172010-11-15 06:59:17 +000085void CodeEmitterGen::
David Greened4a90662011-07-11 18:25:51 +000086AddCodeToMergeInOperand(Record *R, const BitsInit *BI,
87 const std::string &VarName, unsigned &NumberedOp,
Chris Lattner16201172010-11-15 06:59:17 +000088 std::string &Case, CodeGenTarget &Target) {
Chris Lattner16201172010-11-15 06:59:17 +000089 CodeGenInstruction &CGI = Target.getInstruction(R);
90
Chris Lattner8ae082b2010-11-15 07:09:28 +000091 // Determine if VarName actually contributes to the Inst encoding.
92 int bit = BI->getNumBits()-1;
93
94 // Scan for a bit that this contributed to.
95 for (; bit >= 0; ) {
96 if (getVariableBit(VarName, BI, bit) != -1)
97 break;
98
99 --bit;
100 }
101
102 // If we found no bits, ignore this value, otherwise emit the call to get the
103 // operand encoding.
104 if (bit < 0) return;
105
106 // If the operand matches by name, reference according to that
107 // operand number. Non-matching operands are assumed to be in
108 // order.
109 unsigned OpIdx;
110 if (CGI.Operands.hasOperandNamed(VarName, OpIdx)) {
111 // Get the machine operand number for the indicated operand.
112 OpIdx = CGI.Operands[OpIdx].MIOperandNo;
113 assert(!CGI.Operands.isFlatOperandNotEmitted(OpIdx) &&
114 "Explicitly used operand also marked as not emitted!");
115 } else {
116 /// If this operand is not supposed to be emitted by the
117 /// generated emitter, skip it.
118 while (CGI.Operands.isFlatOperandNotEmitted(NumberedOp))
119 ++NumberedOp;
120 OpIdx = NumberedOp++;
121 }
122
123 std::pair<unsigned, unsigned> SO = CGI.Operands.getSubOperandNumber(OpIdx);
124 std::string &EncoderMethodName = CGI.Operands[SO.first].EncoderMethodName;
125
126 // If the source operand has a custom encoder, use it. This will
127 // get the encoding for all of the suboperands.
128 if (!EncoderMethodName.empty()) {
129 // A custom encoder has all of the information for the
130 // sub-operands, if there are more than one, so only
131 // query the encoder once per source operand.
132 if (SO.second == 0) {
133 Case += " // op: " + VarName + "\n" +
134 " op = " + EncoderMethodName + "(MI, " + utostr(OpIdx);
135 if (MCEmitter)
136 Case += ", Fixups";
137 Case += ");\n";
138 }
139 } else {
140 Case += " // op: " + VarName + "\n" +
141 " op = getMachineOpValue(MI, MI.getOperand(" + utostr(OpIdx) + ")";
142 if (MCEmitter)
143 Case += ", Fixups";
144 Case += ");\n";
145 }
146
147 for (; bit >= 0; ) {
Chris Lattner16201172010-11-15 06:59:17 +0000148 int varBit = getVariableBit(VarName, BI, bit);
149
150 // If this bit isn't from a variable, skip it.
151 if (varBit == -1) {
152 --bit;
153 continue;
154 }
155
Bob Wilson9b8c3532011-01-27 23:08:52 +0000156 // Figure out the consecutive range of bits covered by this operand, in
Chris Lattner16201172010-11-15 06:59:17 +0000157 // order to generate better encoding code.
158 int beginInstBit = bit;
159 int beginVarBit = varBit;
160 int N = 1;
161 for (--bit; bit >= 0;) {
162 varBit = getVariableBit(VarName, BI, bit);
163 if (varBit == -1 || varBit != (beginVarBit - N)) break;
164 ++N;
165 --bit;
166 }
Chris Lattner8ae082b2010-11-15 07:09:28 +0000167
Chris Lattner16201172010-11-15 06:59:17 +0000168 unsigned opMask = ~0U >> (32-N);
169 int opShift = beginVarBit - N + 1;
170 opMask <<= opShift;
171 opShift = beginInstBit - beginVarBit;
172
173 if (opShift > 0) {
174 Case += " Value |= (op & " + utostr(opMask) + "U) << " +
175 itostr(opShift) + ";\n";
176 } else if (opShift < 0) {
177 Case += " Value |= (op & " + utostr(opMask) + "U) >> " +
178 itostr(-opShift) + ";\n";
179 } else {
180 Case += " Value |= op & " + utostr(opMask) + "U;\n";
181 }
182 }
183}
184
185
186std::string CodeEmitterGen::getInstructionCase(Record *R,
187 CodeGenTarget &Target) {
188 std::string Case;
189
David Greened4a90662011-07-11 18:25:51 +0000190 const BitsInit *BI = R->getValueAsBitsInit("Inst");
Chris Lattner16201172010-11-15 06:59:17 +0000191 const std::vector<RecordVal> &Vals = R->getValues();
192 unsigned NumberedOp = 0;
193
194 // Loop over all of the fields in the instruction, determining which are the
195 // operands to the instruction.
196 for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
197 // Ignore fixed fields in the record, we're looking for values like:
198 // bits<5> RST = { ?, ?, ?, ?, ? };
199 if (Vals[i].getPrefix() || Vals[i].getValue()->isComplete())
200 continue;
201
202 AddCodeToMergeInOperand(R, BI, Vals[i].getName(), NumberedOp, Case, Target);
203 }
204
205 std::string PostEmitter = R->getValueAsString("PostEncoderMethod");
206 if (!PostEmitter.empty())
207 Case += " Value = " + PostEmitter + "(MI, Value);\n";
208
209 return Case;
210}
211
Daniel Dunbar1a551802009-07-03 00:10:29 +0000212void CodeEmitterGen::run(raw_ostream &o) {
Chris Lattner67db8832010-12-13 00:23:57 +0000213 CodeGenTarget Target(Records);
Chris Lattner048c00d2003-08-01 04:38:18 +0000214 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction");
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000215
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000216 // For little-endian instruction bit encodings, reverse the bit order
217 if (Target.isLittleEndianEncoding()) reverseBits(Insts);
Misha Brukman9fff7e12003-05-24 00:15:53 +0000218
Chris Lattner0e5e49e2003-08-06 04:36:35 +0000219 EmitSourceFileHeader("Machine Code Emitter", o);
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000220
Chris Lattnerf6502782010-03-19 00:34:35 +0000221 const std::vector<const CodeGenInstruction*> &NumberedInstructions =
222 Target.getInstructionsByEnumValue();
Misha Brukman9fff7e12003-05-24 00:15:53 +0000223
Misha Brukmanad346ad2004-08-10 20:54:58 +0000224 // Emit function declaration
Jim Grosbach60aaa762010-11-03 23:38:14 +0000225 o << "unsigned " << Target.getName();
226 if (MCEmitter)
227 o << "MCCodeEmitter::getBinaryCodeForInstr(const MCInst &MI,\n"
228 << " SmallVectorImpl<MCFixup> &Fixups) const {\n";
229 else
230 o << "CodeEmitter::getBinaryCodeForInstr(const MachineInstr &MI) const {\n";
Misha Brukmanad346ad2004-08-10 20:54:58 +0000231
Jim Laskeyed393432006-07-12 19:15:43 +0000232 // Emit instruction base values
233 o << " static const unsigned InstBits[] = {\n";
Chris Lattnerf6502782010-03-19 00:34:35 +0000234 for (std::vector<const CodeGenInstruction*>::const_iterator
Jim Laskeyed393432006-07-12 19:15:43 +0000235 IN = NumberedInstructions.begin(),
236 EN = NumberedInstructions.end();
237 IN != EN; ++IN) {
238 const CodeGenInstruction *CGI = *IN;
239 Record *R = CGI->TheDef;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000240
Jim Grosbach806fcc02011-07-06 21:33:38 +0000241 if (R->getValueAsString("Namespace") == "TargetOpcode" ||
242 R->getValueAsBit("isPseudo")) {
Evan Chengbc95b232008-09-17 06:29:52 +0000243 o << " 0U,\n";
Jim Laskeyed393432006-07-12 19:15:43 +0000244 continue;
245 }
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000246
David Greened4a90662011-07-11 18:25:51 +0000247 const BitsInit *BI = R->getValueAsBitsInit("Inst");
Misha Brukman9fff7e12003-05-24 00:15:53 +0000248
Chris Lattner16201172010-11-15 06:59:17 +0000249 // Start by filling in fixed values.
Reid Spencerfa3e3b92006-11-03 01:48:30 +0000250 unsigned Value = 0;
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000251 for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i) {
David Greened4a90662011-07-11 18:25:51 +0000252 if (const BitInit *B = dynamic_cast<const BitInit*>(BI->getBit(e-i-1)))
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000253 Value |= B->getValue() << (e-i-1);
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000254 }
Evan Chengbc95b232008-09-17 06:29:52 +0000255 o << " " << Value << "U," << '\t' << "// " << R->getName() << "\n";
Jim Laskeyed393432006-07-12 19:15:43 +0000256 }
Evan Chengbc95b232008-09-17 06:29:52 +0000257 o << " 0U\n };\n";
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000258
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000259 // Map to accumulate all the cases.
260 std::map<std::string, std::vector<std::string> > CaseMap;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000261
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000262 // Construct all cases statement for each opcode
263 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end();
264 IC != EC; ++IC) {
265 Record *R = *IC;
Jim Grosbach806fcc02011-07-06 21:33:38 +0000266 if (R->getValueAsString("Namespace") == "TargetOpcode" ||
267 R->getValueAsBit("isPseudo"))
Jakob Stoklund Olesen65766ce2010-07-02 21:44:22 +0000268 continue;
Jim Grosbach0ed92f22011-02-03 23:26:36 +0000269 const std::string &InstName = R->getValueAsString("Namespace") + "::"
270 + R->getName();
Chris Lattner16201172010-11-15 06:59:17 +0000271 std::string Case = getInstructionCase(R, Target);
Dan Gohmanf8c73942009-04-13 15:38:05 +0000272
Chris Lattner16201172010-11-15 06:59:17 +0000273 CaseMap[Case].push_back(InstName);
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000274 }
Misha Brukman9fff7e12003-05-24 00:15:53 +0000275
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000276 // Emit initial function code
277 o << " const unsigned opcode = MI.getOpcode();\n"
278 << " unsigned Value = InstBits[opcode];\n"
Evan Chenge3e36262008-09-07 09:00:57 +0000279 << " unsigned op = 0;\n"
Jeffrey Yasskin8e68c382010-12-23 00:58:24 +0000280 << " (void)op; // suppress warning\n"
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000281 << " switch (opcode) {\n";
282
283 // Emit each case statement
284 std::map<std::string, std::vector<std::string> >::iterator IE, EE;
285 for (IE = CaseMap.begin(), EE = CaseMap.end(); IE != EE; ++IE) {
286 const std::string &Case = IE->first;
287 std::vector<std::string> &InstList = IE->second;
288
289 for (int i = 0, N = InstList.size(); i < N; i++) {
290 if (i) o << "\n";
Jim Grosbach0ed92f22011-02-03 23:26:36 +0000291 o << " case " << InstList[i] << ":";
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000292 }
293 o << " {\n";
294 o << Case;
Misha Brukman9fff7e12003-05-24 00:15:53 +0000295 o << " break;\n"
296 << " }\n";
297 }
Misha Brukman7eac4762003-07-15 21:00:32 +0000298
Misha Brukman28eefa52004-10-14 05:53:01 +0000299 // Default case: unhandled opcode
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000300 o << " default:\n"
Torok Edwin804e0fe2009-07-08 19:04:27 +0000301 << " std::string msg;\n"
302 << " raw_string_ostream Msg(msg);\n"
303 << " Msg << \"Not supported instr: \" << MI;\n"
Chris Lattner75361b62010-04-07 22:58:41 +0000304 << " report_fatal_error(Msg.str());\n"
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000305 << " }\n"
Misha Brukman9fff7e12003-05-24 00:15:53 +0000306 << " return Value;\n"
Misha Brukman28eefa52004-10-14 05:53:01 +0000307 << "}\n\n";
Misha Brukman9fff7e12003-05-24 00:15:53 +0000308}