1 //===- CodeEmitterGen.cpp - Code Emitter Generator ------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // 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.
14 //===----------------------------------------------------------------------===//
16 #include "CodeEmitterGen.h"
17 #include "CodeGenTarget.h"
19 #include "llvm/ADT/StringExtras.h"
20 #include "llvm/Support/Debug.h"
23 void CodeEmitterGen::reverseBits(std::vector<Record*> &Insts) {
24 for (std::vector<Record*>::iterator I = Insts.begin(), E = Insts.end();
27 if (R->getName() == "PHI" || R->getName() == "INLINEASM") continue;
29 BitsInit *BI = R->getValueAsBitsInit("Inst");
31 unsigned numBits = BI->getNumBits();
32 BitsInit *NewBI = new BitsInit(numBits);
33 for (unsigned bit = 0, end = numBits / 2; bit != end; ++bit) {
34 unsigned bitSwapIdx = numBits - bit - 1;
35 Init *OrigBit = BI->getBit(bit);
36 Init *BitSwap = BI->getBit(bitSwapIdx);
37 NewBI->setBit(bit, BitSwap);
38 NewBI->setBit(bitSwapIdx, OrigBit);
41 unsigned middle = (numBits + 1) / 2;
42 NewBI->setBit(middle, BI->getBit(middle));
45 // Update the bits in reversed order so that emitInstrOpBits will get the
46 // correct endianness.
47 R->getValue("Inst")->setValue(NewBI);
52 int CodeEmitterGen::getVariableBit(const std::string &VarName, BitsInit *BI, int bit){
53 if (VarBitInit *VBI = dynamic_cast<VarBitInit*>(BI->getBit(bit))) {
54 TypedInit *TI = VBI->getVariable();
56 if (VarInit *VI = dynamic_cast<VarInit*>(TI)) {
57 if (VI->getName() == VarName) return VBI->getBitNum();
65 void CodeEmitterGen::run(std::ostream &o) {
67 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction");
69 // For little-endian instruction bit encodings, reverse the bit order
70 if (Target.isLittleEndianEncoding()) reverseBits(Insts);
72 EmitSourceFileHeader("Machine Code Emitter", o);
73 std::string Namespace = Insts[0]->getValueAsString("Namespace") + "::";
75 std::vector<const CodeGenInstruction*> NumberedInstructions;
76 Target.getInstructionsByEnumValue(NumberedInstructions);
78 // Emit function declaration
79 o << "unsigned " << Target.getName() << "CodeEmitter::"
80 << "getBinaryCodeForInstr(MachineInstr &MI) {\n";
82 // Emit instruction base values
83 o << " static const unsigned InstBits[] = {\n";
84 for (std::vector<const CodeGenInstruction*>::iterator
85 IN = NumberedInstructions.begin(),
86 EN = NumberedInstructions.end();
88 const CodeGenInstruction *CGI = *IN;
89 Record *R = CGI->TheDef;
91 if (IN != NumberedInstructions.begin()) o << ",\n";
93 if (R->getName() == "PHI" || R->getName() == "INLINEASM") {
98 BitsInit *BI = R->getValueAsBitsInit("Inst");
101 const std::vector<RecordVal> &Vals = R->getValues();
103 // Start by filling in fixed values...
104 for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i) {
105 if (BitInit *B = dynamic_cast<BitInit*>(BI->getBit(e-i-1))) {
106 Value |= B->getValue() << (e-i-1);
109 o << " " << Value << "U";
113 // Map to accumulate all the cases.
114 std::map<std::string, std::vector<std::string> > CaseMap;
116 // Construct all cases statement for each opcode
117 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end();
120 const std::string &InstName = R->getName();
121 std::string Case("");
123 if (InstName == "PHI" || InstName == "INLINEASM") continue;
125 BitsInit *BI = R->getValueAsBitsInit("Inst");
126 const std::vector<RecordVal> &Vals = R->getValues();
128 // Loop over all of the fields in the instruction, determining which are the
129 // operands to the instruction.
131 for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
132 if (!Vals[i].getPrefix() && !Vals[i].getValue()->isComplete()) {
133 // Is the operand continuous? If so, we can just mask and OR it in
134 // instead of doing it bit-by-bit, saving a lot in runtime cost.
135 const std::string &VarName = Vals[i].getName();
138 for (int bit = BI->getNumBits()-1; bit >= 0; ) {
139 int varBit = getVariableBit(VarName, BI, bit);
144 int beginInstBit = bit;
145 int beginVarBit = varBit;
148 for (--bit; bit >= 0;) {
149 varBit = getVariableBit(VarName, BI, bit);
150 if (varBit == -1 || varBit != (beginVarBit - N)) break;
156 Case += " // op: " + VarName + "\n"
157 + " op = getMachineOpValue(MI, MI.getOperand("
163 unsigned opMask = (1 << N) - 1;
164 int opShift = beginVarBit - N + 1;
166 opShift = beginInstBit - beginVarBit;
169 Case += " Value |= (op & " + utostr(opMask) + "U) << "
170 + itostr(opShift) + ";\n";
171 } else if (opShift < 0) {
172 Case += " Value |= (op & " + utostr(opMask) + "U) >> "
173 + itostr(-opShift) + ";\n";
175 Case += " Value |= op & " + utostr(opMask) + "U;\n";
182 std::vector<std::string> &InstList = CaseMap[Case];
183 InstList.push_back(InstName);
187 // Emit initial function code
188 o << " const unsigned opcode = MI.getOpcode();\n"
189 << " unsigned Value = InstBits[opcode];\n"
191 << " switch (opcode) {\n";
193 // Emit each case statement
194 std::map<std::string, std::vector<std::string> >::iterator IE, EE;
195 for (IE = CaseMap.begin(), EE = CaseMap.end(); IE != EE; ++IE) {
196 const std::string &Case = IE->first;
197 std::vector<std::string> &InstList = IE->second;
199 for (int i = 0, N = InstList.size(); i < N; i++) {
201 o << " case " << Namespace << InstList[i] << ":";
209 // Default case: unhandled opcode
211 << " std::cerr << \"Not supported instr: \" << MI << \"\\n\";\n"
214 << " return Value;\n"