blob: a7b96564799aab97929ad0851f7681b6d1ae0b3b [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"
Reid Spencer551ccae2004-09-01 22:55:40 +000020#include "llvm/Support/Debug.h"
Chris Lattner2082ebe2004-08-01 03:55:39 +000021using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000022
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000023void CodeEmitterGen::reverseBits(std::vector<Record*> &Insts) {
24 for (std::vector<Record*>::iterator I = Insts.begin(), E = Insts.end();
25 I != E; ++I) {
26 Record *R = *I;
Jakob Stoklund Olesen65766ce2010-07-02 21:44:22 +000027 if (R->getValueAsString("Namespace") == "TargetOpcode")
28 continue;
Dan Gohmanf8c73942009-04-13 15:38:05 +000029
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000030 BitsInit *BI = R->getValueAsBitsInit("Inst");
Misha Brukman28eefa52004-10-14 05:53:01 +000031
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000032 unsigned numBits = BI->getNumBits();
33 BitsInit *NewBI = new BitsInit(numBits);
34 for (unsigned bit = 0, end = numBits / 2; bit != end; ++bit) {
35 unsigned bitSwapIdx = numBits - bit - 1;
36 Init *OrigBit = BI->getBit(bit);
37 Init *BitSwap = BI->getBit(bitSwapIdx);
38 NewBI->setBit(bit, BitSwap);
39 NewBI->setBit(bitSwapIdx, OrigBit);
Misha Brukman28eefa52004-10-14 05:53:01 +000040 }
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000041 if (numBits % 2) {
42 unsigned middle = (numBits + 1) / 2;
43 NewBI->setBit(middle, BI->getBit(middle));
44 }
Jim Grosbach8b892ae2010-10-07 16:56:28 +000045
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000046 // Update the bits in reversed order so that emitInstrOpBits will get the
47 // correct endianness.
48 R->getValue("Inst")->setValue(NewBI);
Misha Brukman28eefa52004-10-14 05:53:01 +000049 }
50}
51
Jim Laskeycb129032006-07-13 22:17:08 +000052// If the VarBitInit at position 'bit' matches the specified variable then
53// return the variable bit position. Otherwise return -1.
Dan Gohman9b03da62009-12-15 20:21:44 +000054int CodeEmitterGen::getVariableBit(const std::string &VarName,
Jim Laskeycb129032006-07-13 22:17:08 +000055 BitsInit *BI, int bit) {
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000056 if (VarBitInit *VBI = dynamic_cast<VarBitInit*>(BI->getBit(bit))) {
57 TypedInit *TI = VBI->getVariable();
Jim Grosbach8b892ae2010-10-07 16:56:28 +000058
Dan Gohman9b03da62009-12-15 20:21:44 +000059 if (VarInit *VI = dynamic_cast<VarInit*>(TI)) {
60 if (VI->getName() == VarName) return VBI->getBitNum();
61 }
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000062 }
Jim Grosbach8b892ae2010-10-07 16:56:28 +000063
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000064 return -1;
Jim Grosbach8b892ae2010-10-07 16:56:28 +000065}
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000066
Daniel Dunbar1a551802009-07-03 00:10:29 +000067void CodeEmitterGen::run(raw_ostream &o) {
Misha Brukmane2ba7782004-08-10 18:31:01 +000068 CodeGenTarget Target;
Chris Lattner048c00d2003-08-01 04:38:18 +000069 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction");
Jim Grosbach8b892ae2010-10-07 16:56:28 +000070
Jim Laskeyf1b05bf2006-07-13 21:02:53 +000071 // For little-endian instruction bit encodings, reverse the bit order
72 if (Target.isLittleEndianEncoding()) reverseBits(Insts);
Misha Brukman9fff7e12003-05-24 00:15:53 +000073
Chris Lattner0e5e49e2003-08-06 04:36:35 +000074 EmitSourceFileHeader("Machine Code Emitter", o);
Misha Brukmane2ba7782004-08-10 18:31:01 +000075 std::string Namespace = Insts[0]->getValueAsString("Namespace") + "::";
Jim Grosbach8b892ae2010-10-07 16:56:28 +000076
Chris Lattnerf6502782010-03-19 00:34:35 +000077 const std::vector<const CodeGenInstruction*> &NumberedInstructions =
78 Target.getInstructionsByEnumValue();
Misha Brukman9fff7e12003-05-24 00:15:53 +000079
Misha Brukmanad346ad2004-08-10 20:54:58 +000080 // Emit function declaration
Misha Brukmane2ba7782004-08-10 18:31:01 +000081 o << "unsigned " << Target.getName() << "CodeEmitter::"
Jim Grosbachbade37b2010-10-08 00:21:28 +000082 << "getBinaryCodeForInstr(const MachineInstr &MI) const {\n";
Misha Brukmanad346ad2004-08-10 20:54:58 +000083
Jim Laskeyed393432006-07-12 19:15:43 +000084 // Emit instruction base values
85 o << " static const unsigned InstBits[] = {\n";
Chris Lattnerf6502782010-03-19 00:34:35 +000086 for (std::vector<const CodeGenInstruction*>::const_iterator
Jim Laskeyed393432006-07-12 19:15:43 +000087 IN = NumberedInstructions.begin(),
88 EN = NumberedInstructions.end();
89 IN != EN; ++IN) {
90 const CodeGenInstruction *CGI = *IN;
91 Record *R = CGI->TheDef;
Jim Grosbach8b892ae2010-10-07 16:56:28 +000092
Jakob Stoklund Olesen65766ce2010-07-02 21:44:22 +000093 if (R->getValueAsString("Namespace") == "TargetOpcode") {
Evan Chengbc95b232008-09-17 06:29:52 +000094 o << " 0U,\n";
Jim Laskeyed393432006-07-12 19:15:43 +000095 continue;
96 }
Jim Grosbach8b892ae2010-10-07 16:56:28 +000097
Chris Lattner6f334ad2003-08-01 04:46:24 +000098 BitsInit *BI = R->getValueAsBitsInit("Inst");
Misha Brukman9fff7e12003-05-24 00:15:53 +000099
Misha Brukman9fff7e12003-05-24 00:15:53 +0000100 // Start by filling in fixed values...
Reid Spencerfa3e3b92006-11-03 01:48:30 +0000101 unsigned Value = 0;
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000102 for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i) {
103 if (BitInit *B = dynamic_cast<BitInit*>(BI->getBit(e-i-1))) {
104 Value |= B->getValue() << (e-i-1);
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000105 }
106 }
Evan Chengbc95b232008-09-17 06:29:52 +0000107 o << " " << Value << "U," << '\t' << "// " << R->getName() << "\n";
Jim Laskeyed393432006-07-12 19:15:43 +0000108 }
Evan Chengbc95b232008-09-17 06:29:52 +0000109 o << " 0U\n };\n";
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000110
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000111 // Map to accumulate all the cases.
112 std::map<std::string, std::vector<std::string> > CaseMap;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000113
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000114 // Construct all cases statement for each opcode
115 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end();
116 IC != EC; ++IC) {
117 Record *R = *IC;
Jakob Stoklund Olesen65766ce2010-07-02 21:44:22 +0000118 if (R->getValueAsString("Namespace") == "TargetOpcode")
119 continue;
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000120 const std::string &InstName = R->getName();
121 std::string Case("");
Dan Gohmanf8c73942009-04-13 15:38:05 +0000122
Jim Laskeyed393432006-07-12 19:15:43 +0000123 BitsInit *BI = R->getValueAsBitsInit("Inst");
124 const std::vector<RecordVal> &Vals = R->getValues();
Chris Lattnerf30187a2010-03-19 00:07:20 +0000125 CodeGenInstruction &CGI = Target.getInstruction(R);
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000126
Misha Brukman28eefa52004-10-14 05:53:01 +0000127 // Loop over all of the fields in the instruction, determining which are the
Misha Brukman3da94ae2005-04-22 00:00:37 +0000128 // operands to the instruction.
Jim Grosbach01855072010-10-11 18:25:51 +0000129 unsigned NumberedOp = 0;
Misha Brukman9fff7e12003-05-24 00:15:53 +0000130 for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
Misha Brukman28eefa52004-10-14 05:53:01 +0000131 if (!Vals[i].getPrefix() && !Vals[i].getValue()->isComplete()) {
Misha Brukman7eac4762003-07-15 21:00:32 +0000132 // Is the operand continuous? If so, we can just mask and OR it in
Misha Brukman3da94ae2005-04-22 00:00:37 +0000133 // instead of doing it bit-by-bit, saving a lot in runtime cost.
Dan Gohman9b03da62009-12-15 20:21:44 +0000134 const std::string &VarName = Vals[i].getName();
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000135 bool gotOp = false;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000136
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000137 for (int bit = BI->getNumBits()-1; bit >= 0; ) {
Dan Gohman9b03da62009-12-15 20:21:44 +0000138 int varBit = getVariableBit(VarName, BI, bit);
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000139
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000140 if (varBit == -1) {
141 --bit;
142 } else {
143 int beginInstBit = bit;
144 int beginVarBit = varBit;
145 int N = 1;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000146
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000147 for (--bit; bit >= 0;) {
Dan Gohman9b03da62009-12-15 20:21:44 +0000148 varBit = getVariableBit(VarName, BI, bit);
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000149 if (varBit == -1 || varBit != (beginVarBit - N)) break;
150 ++N;
151 --bit;
Chris Lattnerd7efef92003-08-05 03:53:04 +0000152 }
Misha Brukman3da94ae2005-04-22 00:00:37 +0000153
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000154 if (!gotOp) {
Jim Grosbach01855072010-10-11 18:25:51 +0000155 // If the operand matches by name, reference according to that
156 // operand number. Non-matching operands are assumed to be in
157 // order.
158 unsigned OpIdx;
Chris Lattnerc240bb02010-11-01 04:03:32 +0000159 if (CGI.Operands.hasOperandNamed(VarName, OpIdx)) {
Jim Grosbach1a7233f2010-10-11 21:31:22 +0000160 // Get the machine operand number for the indicated operand.
Chris Lattnerc240bb02010-11-01 04:03:32 +0000161 OpIdx = CGI.Operands[OpIdx].MIOperandNo;
162 assert (!CGI.Operands.isFlatOperandNotEmitted(OpIdx) &&
Jim Grosbacha1e21942010-10-11 21:41:31 +0000163 "Explicitly used operand also marked as not emitted!");
Jim Grosbach01855072010-10-11 18:25:51 +0000164 } else {
165 /// If this operand is not supposed to be emitted by the
166 /// generated emitter, skip it.
Chris Lattnerc240bb02010-11-01 04:03:32 +0000167 while (CGI.Operands.isFlatOperandNotEmitted(NumberedOp))
Jim Grosbach01855072010-10-11 18:25:51 +0000168 ++NumberedOp;
169 OpIdx = NumberedOp++;
170 }
Chris Lattnerc240bb02010-11-01 04:03:32 +0000171 std::pair<unsigned, unsigned> SO =
172 CGI.Operands.getSubOperandNumber(OpIdx);
Jim Grosbach5013f742010-10-12 22:21:57 +0000173 std::string &EncoderMethodName =
Chris Lattnerc240bb02010-11-01 04:03:32 +0000174 CGI.Operands[SO.first].EncoderMethodName;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000175
Jim Grosbach5013f742010-10-12 22:21:57 +0000176 // If the source operand has a custom encoder, use it. This will
177 // get the encoding for all of the suboperands.
178 if (!EncoderMethodName.empty()) {
179 // A custom encoder has all of the information for the
180 // sub-operands, if there are more than one, so only
181 // query the encoder once per source operand.
182 if (SO.second == 0) {
183 Case += " // op: " + VarName + "\n"
184 + " op = " + EncoderMethodName + "(MI, "
185 + utostr(OpIdx) + ");\n";
186 }
187 } else {
188 Case += " // op: " + VarName + "\n"
189 + " op = getMachineOpValue(MI, MI.getOperand("
190 + utostr(OpIdx) + "));\n";
191 }
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000192 gotOp = true;
193 }
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000194
Chris Lattner1cfa0772008-10-05 18:31:58 +0000195 unsigned opMask = ~0U >> (32-N);
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000196 int opShift = beginVarBit - N + 1;
197 opMask <<= opShift;
198 opShift = beginInstBit - beginVarBit;
Jim Grosbach8b892ae2010-10-07 16:56:28 +0000199
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000200 if (opShift > 0) {
201 Case += " Value |= (op & " + utostr(opMask) + "U) << "
202 + itostr(opShift) + ";\n";
203 } else if (opShift < 0) {
204 Case += " Value |= (op & " + utostr(opMask) + "U) >> "
205 + itostr(-opShift) + ";\n";
206 } else {
207 Case += " Value |= op & " + utostr(opMask) + "U;\n";
208 }
Chris Lattnerd7efef92003-08-05 03:53:04 +0000209 }
Misha Brukman7eac4762003-07-15 21:00:32 +0000210 }
Misha Brukman9fff7e12003-05-24 00:15:53 +0000211 }
212 }
213
Chris Lattnerf64f9a42006-11-15 23:23:02 +0000214 std::vector<std::string> &InstList = CaseMap[Case];
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000215 InstList.push_back(InstName);
216 }
Misha Brukman9fff7e12003-05-24 00:15:53 +0000217
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000218 // Emit initial function code
219 o << " const unsigned opcode = MI.getOpcode();\n"
220 << " unsigned Value = InstBits[opcode];\n"
Evan Chenge3e36262008-09-07 09:00:57 +0000221 << " unsigned op = 0;\n"
Evan Chengacff3392008-09-02 06:51:36 +0000222 << " op = op; // suppress warning\n"
Jim Laskeyf1b05bf2006-07-13 21:02:53 +0000223 << " switch (opcode) {\n";
224
225 // Emit each case statement
226 std::map<std::string, std::vector<std::string> >::iterator IE, EE;
227 for (IE = CaseMap.begin(), EE = CaseMap.end(); IE != EE; ++IE) {
228 const std::string &Case = IE->first;
229 std::vector<std::string> &InstList = IE->second;
230
231 for (int i = 0, N = InstList.size(); i < N; i++) {
232 if (i) o << "\n";
233 o << " case " << Namespace << InstList[i] << ":";
234 }
235 o << " {\n";
236 o << Case;
Misha Brukman9fff7e12003-05-24 00:15:53 +0000237 o << " break;\n"
238 << " }\n";
239 }
Misha Brukman7eac4762003-07-15 21:00:32 +0000240
Misha Brukman28eefa52004-10-14 05:53:01 +0000241 // Default case: unhandled opcode
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000242 o << " default:\n"
Torok Edwin804e0fe2009-07-08 19:04:27 +0000243 << " std::string msg;\n"
244 << " raw_string_ostream Msg(msg);\n"
245 << " Msg << \"Not supported instr: \" << MI;\n"
Chris Lattner75361b62010-04-07 22:58:41 +0000246 << " report_fatal_error(Msg.str());\n"
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000247 << " }\n"
Misha Brukman9fff7e12003-05-24 00:15:53 +0000248 << " return Value;\n"
Misha Brukman28eefa52004-10-14 05:53:01 +0000249 << "}\n\n";
Misha Brukman9fff7e12003-05-24 00:15:53 +0000250}