blob: 0619967f7708d0dddf47096b91fa69f664d3daee [file] [log] [blame]
Chris Lattnerc9670ef2003-07-31 04:43:49 +00001//===- CodeEmitterGen.cpp - Code Emitter Generator ------------------------===//
2//
3// FIXME: Document.
4//
5//===----------------------------------------------------------------------===//
6
Misha Brukman9fff7e12003-05-24 00:15:53 +00007#include "CodeEmitterGen.h"
Chris Lattnerc9670ef2003-07-31 04:43:49 +00008#include "Record.h"
9#include "Support/Statistic.h"
Misha Brukman9fff7e12003-05-24 00:15:53 +000010
Chris Lattner048c00d2003-08-01 04:38:18 +000011void CodeEmitterGen::run(std::ostream &o) {
12 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction");
Misha Brukman9fff7e12003-05-24 00:15:53 +000013
14 std::string Namespace = "V9::";
15 std::string ClassName = "SparcV9CodeEmitter::";
16
17 //const std::string &Namespace = Inst->getValue("Namespace")->getName();
Misha Brukmanb9dd8152003-05-27 22:29:02 +000018 o << "unsigned " << ClassName
Misha Brukman9fff7e12003-05-24 00:15:53 +000019 << "getBinaryCodeForInstr(MachineInstr &MI) {\n"
20 << " unsigned Value = 0;\n"
Misha Brukmanf4ef4c82003-06-06 00:27:02 +000021 << " DEBUG(std::cerr << MI);\n"
Misha Brukman9fff7e12003-05-24 00:15:53 +000022 << " switch (MI.getOpcode()) {\n";
23 for (std::vector<Record*>::iterator I = Insts.begin(), E = Insts.end();
Chris Lattnercf1b5852003-08-01 04:15:25 +000024 I != E; ++I) {
Misha Brukman9fff7e12003-05-24 00:15:53 +000025 Record *R = *I;
Misha Brukmanecc7fd32003-05-28 18:29:10 +000026 o << " case " << Namespace << R->getName() << ": {\n"
Misha Brukmanf4ef4c82003-06-06 00:27:02 +000027 << " DEBUG(std::cerr << \"Emitting " << R->getName() << "\\n\");\n";
Misha Brukman9fff7e12003-05-24 00:15:53 +000028
29 const RecordVal *InstVal = R->getValue("Inst");
Chris Lattner048c00d2003-08-01 04:38:18 +000030 if (!InstVal)
31 throw std::string("No 'Inst' record found in target description file!");
Misha Brukman9fff7e12003-05-24 00:15:53 +000032
Chris Lattner30709542003-07-29 23:00:08 +000033 Init *InitVal = InstVal->getValue();
Misha Brukman9fff7e12003-05-24 00:15:53 +000034 assert(dynamic_cast<BitsInit*>(InitVal) &&
35 "Can only handle undefined bits<> types!");
36 BitsInit *BI = (BitsInit*)InitVal;
37
38 unsigned Value = 0;
39 const std::vector<RecordVal> &Vals = R->getValues();
40
Misha Brukmanf6e52172003-07-15 21:26:09 +000041 DEBUG(o << " // prefilling: ");
Misha Brukman9fff7e12003-05-24 00:15:53 +000042 // Start by filling in fixed values...
Misha Brukmancbfde0a2003-05-27 22:19:58 +000043 for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i) {
44 if (BitInit *B = dynamic_cast<BitInit*>(BI->getBit(e-i-1))) {
45 Value |= B->getValue() << (e-i-1);
Misha Brukmanf6e52172003-07-15 21:26:09 +000046 DEBUG(o << B->getValue());
Misha Brukmancbfde0a2003-05-27 22:19:58 +000047 } else {
Misha Brukmanf6e52172003-07-15 21:26:09 +000048 DEBUG(o << "0");
Misha Brukmancbfde0a2003-05-27 22:19:58 +000049 }
50 }
Misha Brukmanf6e52172003-07-15 21:26:09 +000051 DEBUG(o << "\n");
Misha Brukman9fff7e12003-05-24 00:15:53 +000052
Misha Brukmanf6e52172003-07-15 21:26:09 +000053 DEBUG(o << " // " << *InstVal << "\n");
Misha Brukmancbfde0a2003-05-27 22:19:58 +000054 o << " Value = " << Value << "U;\n\n";
Misha Brukman9fff7e12003-05-24 00:15:53 +000055
56 // Loop over all of the fields in the instruction adding in any
57 // contributions to this value (due to bit references).
58 //
Misha Brukmancbfde0a2003-05-27 22:19:58 +000059 unsigned op = 0;
Misha Brukman9fff7e12003-05-24 00:15:53 +000060 std::map<const std::string,unsigned> OpOrder;
Misha Brukman7eac4762003-07-15 21:00:32 +000061 std::map<const std::string,bool> OpContinuous;
Misha Brukman9fff7e12003-05-24 00:15:53 +000062 for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
63 if (Vals[i].getName() != "Inst" &&
64 !Vals[i].getValue()->isComplete() &&
Misha Brukman3d194ac2003-06-05 23:15:25 +000065 /* ignore annul and predict bits since no one sets them yet */
Misha Brukman9fff7e12003-05-24 00:15:53 +000066 Vals[i].getName() != "annul" &&
Misha Brukman9fff7e12003-05-24 00:15:53 +000067 Vals[i].getName() != "predict")
68 {
Misha Brukmancbfde0a2003-05-27 22:19:58 +000069 o << " // op" << op << ": " << Vals[i].getName() << "\n"
70 << " int64_t op" << op
Misha Brukmane7800b52003-05-30 20:32:01 +000071 <<" = getMachineOpValue(MI, MI.getOperand("<<op<<"));\n";
Misha Brukmancbfde0a2003-05-27 22:19:58 +000072 //<< " MachineOperand &op" << op <<" = MI.getOperand("<<op<<");\n";
73 OpOrder[Vals[i].getName()] = op++;
Misha Brukman7eac4762003-07-15 21:00:32 +000074
75 // Is the operand continuous? If so, we can just mask and OR it in
76 // instead of doing it bit-by-bit, saving a lot in runtime cost.
77 const BitsInit *InstInit = BI;
78 int beginBitInVar = -1, endBitInVar = -1,
79 beginBitInInst = -1, endBitInInst = -1;
80 bool continuous = true;
81
82 for (int bit = InstInit->getNumBits()-1; bit >= 0; --bit) {
83 if (VarBitInit *VBI =
84 dynamic_cast<VarBitInit*>(InstInit->getBit(bit))) {
85 TypedInit *TI = VBI->getVariable();
86 if (VarInit *VI = dynamic_cast<VarInit*>(TI)) {
87 // only process the current variable
88 if (VI->getName() != Vals[i].getName())
89 continue;
90
91 if (beginBitInVar == -1)
92 beginBitInVar = VBI->getBitNum();
93
94 if (endBitInVar == -1)
95 endBitInVar = VBI->getBitNum();
96 else {
97 if (endBitInVar == (int)VBI->getBitNum() + 1)
98 endBitInVar = VBI->getBitNum();
99 else {
100 continuous = false;
101 break;
102 }
103 }
104
105 if (beginBitInInst == -1)
106 beginBitInInst = bit;
107 if (endBitInInst == -1)
108 endBitInInst = bit;
109 else {
110 if (endBitInInst == bit + 1)
111 endBitInInst = bit;
112 else {
113 continuous = false;
114 break;
115 }
116 }
117
118 // maintain same distance between bits in field and bits in
119 // instruction. if the relative distances stay the same
120 // throughout,
121 if ((beginBitInVar - (int)VBI->getBitNum()) !=
122 (beginBitInInst - bit))
123 {
124 continuous = false;
125 break;
126 }
127 }
128 }
129 }
130
Misha Brukmanf6e52172003-07-15 21:26:09 +0000131 DEBUG(o << " // Var: begin = " << beginBitInVar
132 << ", end = " << endBitInVar
133 << "; Inst: begin = " << beginBitInInst
134 << ", end = " << endBitInInst << "\n");
135
Misha Brukman7eac4762003-07-15 21:00:32 +0000136 if (continuous) {
Misha Brukmanc86516f2003-07-18 18:03:45 +0000137 DEBUG(o << " // continuous: op" << OpOrder[Vals[i].getName()]
138 << "\n");
Misha Brukman7eac4762003-07-15 21:00:32 +0000139
140 // Mask off the right bits
141 // Low mask (ie. shift, if necessary)
142 if (endBitInVar != 0) {
143 o << " op" << OpOrder[Vals[i].getName()]
Misha Brukmanf6e52172003-07-15 21:26:09 +0000144 << " >>= " << endBitInVar << ";\n";
Misha Brukman7eac4762003-07-15 21:00:32 +0000145 beginBitInVar -= endBitInVar;
146 endBitInVar = 0;
147 }
148
149 // High mask
150 o << " op" << OpOrder[Vals[i].getName()]
151 << " &= (1<<" << beginBitInVar+1 << ") - 1;\n";
152
153 // Shift the value to the correct place (according to place in instr)
154 if (endBitInInst != 0)
155 o << " op" << OpOrder[Vals[i].getName()]
156 << " <<= " << endBitInInst << ";\n";
157
158 // Just OR in the result
159 o << " Value |= op" << OpOrder[Vals[i].getName()] << ";\n";
160 }
161
162 // otherwise, will be taken care of in the loop below using this value:
163 OpContinuous[Vals[i].getName()] = continuous;
Misha Brukman9fff7e12003-05-24 00:15:53 +0000164 }
165 }
166
Misha Brukman48aa8242003-07-07 22:30:44 +0000167 for (unsigned f = 0, e = Vals.size(); f != e; ++f) {
Misha Brukman9fff7e12003-05-24 00:15:53 +0000168 if (Vals[f].getPrefix()) {
169 BitsInit *FieldInitializer = (BitsInit*)Vals[f].getValue();
170
171 // Scan through the field looking for bit initializers of the current
172 // variable...
173 for (int i = FieldInitializer->getNumBits()-1; i >= 0; --i) {
Misha Brukman7eac4762003-07-15 21:00:32 +0000174 if (BitInit *BI=dynamic_cast<BitInit*>(FieldInitializer->getBit(i)))
175 {
Misha Brukmanf6e52172003-07-15 21:26:09 +0000176 DEBUG(o << " // bit init: f: " << f << ", i: " << i << "\n");
Misha Brukman7eac4762003-07-15 21:00:32 +0000177 } else if (UnsetInit *UI =
Misha Brukman9fff7e12003-05-24 00:15:53 +0000178 dynamic_cast<UnsetInit*>(FieldInitializer->getBit(i))) {
Misha Brukmanf6e52172003-07-15 21:26:09 +0000179 DEBUG(o << " // unset init: f: " << f << ", i: " << i << "\n");
Misha Brukman9fff7e12003-05-24 00:15:53 +0000180 } else if (VarBitInit *VBI =
181 dynamic_cast<VarBitInit*>(FieldInitializer->getBit(i))) {
182 TypedInit *TI = VBI->getVariable();
183 if (VarInit *VI = dynamic_cast<VarInit*>(TI)) {
Misha Brukman7eac4762003-07-15 21:00:32 +0000184 // If the bits of the field are laid out consecutively in the
185 // instruction, then instead of separately ORing in bits, just
186 // mask and shift the entire field for efficiency.
187 if (OpContinuous[VI->getName()]) {
188 // already taken care of in the loop above, thus there is no
189 // need to individually OR in the bits
190
191 // for debugging, output the regular version anyway, commented
Misha Brukmanf6e52172003-07-15 21:26:09 +0000192 DEBUG(o << " // Value |= getValueBit(op"
193 << OpOrder[VI->getName()] << ", " << VBI->getBitNum()
194 << ")" << " << " << i << ";\n");
Misha Brukman7eac4762003-07-15 21:00:32 +0000195 } else {
196 o << " Value |= getValueBit(op" << OpOrder[VI->getName()]
197 << ", " << VBI->getBitNum()
198 << ")" << " << " << i << ";\n";
199 }
Misha Brukman9fff7e12003-05-24 00:15:53 +0000200 } else if (FieldInit *FI = dynamic_cast<FieldInit*>(TI)) {
201 // FIXME: implement this!
202 o << "FIELD INIT not implemented yet!\n";
203 } else {
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000204 o << "Error: UNIMPLEMENTED\n";
Misha Brukman9fff7e12003-05-24 00:15:53 +0000205 }
206 }
Misha Brukman7eac4762003-07-15 21:00:32 +0000207 }
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000208 } else {
Misha Brukman3d194ac2003-06-05 23:15:25 +0000209 // ignore annul and predict bits since no one sets them yet
Misha Brukman48aa8242003-07-07 22:30:44 +0000210 if (Vals[f].getName() == "annul" || Vals[f].getName() == "predict") {
211 o << " // found " << Vals[f].getName() << "\n";
212 }
Misha Brukman9fff7e12003-05-24 00:15:53 +0000213 }
214 }
215
216 o << " break;\n"
217 << " }\n";
218 }
Misha Brukman7eac4762003-07-15 21:00:32 +0000219
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000220 o << " default:\n"
Misha Brukmanf4ef4c82003-06-06 00:27:02 +0000221 << " DEBUG(std::cerr << \"Not supported instr: \" << MI << \"\\n\");\n"
Misha Brukmancbfde0a2003-05-27 22:19:58 +0000222 << " abort();\n"
223 << " }\n"
Misha Brukman9fff7e12003-05-24 00:15:53 +0000224 << " return Value;\n"
225 << "}\n";
Misha Brukman9fff7e12003-05-24 00:15:53 +0000226}