//===- CodeEmitterGen.cpp - Code Emitter Generator ------------------------===// // // FIXME: Document. // //===----------------------------------------------------------------------===// #include "CodeEmitterGen.h" #include "Record.h" #include "Support/Statistic.h" bool CodeEmitterGen::run(std::ostream &o) { std::vector Insts; if (Records.getAllDerivedDefinitions("Instruction", Insts)) return true; std::string Namespace = "V9::"; std::string ClassName = "SparcV9CodeEmitter::"; //const std::string &Namespace = Inst->getValue("Namespace")->getName(); o << "unsigned " << ClassName << "getBinaryCodeForInstr(MachineInstr &MI) {\n" << " unsigned Value = 0;\n" << " DEBUG(std::cerr << MI);\n" << " switch (MI.getOpcode()) {\n"; for (std::vector::iterator I = Insts.begin(), E = Insts.end(); I != E; ++I) { Record *R = *I; o << " case " << Namespace << R->getName() << ": {\n" << " DEBUG(std::cerr << \"Emitting " << R->getName() << "\\n\");\n"; const RecordVal *InstVal = R->getValue("Inst"); if (!InstVal) { std::cerr << "No 'Inst' record found in target description file!\n"; return true; } Init *InitVal = InstVal->getValue(); assert(dynamic_cast(InitVal) && "Can only handle undefined bits<> types!"); BitsInit *BI = (BitsInit*)InitVal; unsigned Value = 0; const std::vector &Vals = R->getValues(); DEBUG(o << " // prefilling: "); // Start by filling in fixed values... for (unsigned i = 0, e = BI->getNumBits(); i != e; ++i) { if (BitInit *B = dynamic_cast(BI->getBit(e-i-1))) { Value |= B->getValue() << (e-i-1); DEBUG(o << B->getValue()); } else { DEBUG(o << "0"); } } DEBUG(o << "\n"); DEBUG(o << " // " << *InstVal << "\n"); o << " Value = " << Value << "U;\n\n"; // Loop over all of the fields in the instruction adding in any // contributions to this value (due to bit references). // unsigned op = 0; std::map OpOrder; std::map OpContinuous; for (unsigned i = 0, e = Vals.size(); i != e; ++i) { if (Vals[i].getName() != "Inst" && !Vals[i].getValue()->isComplete() && /* ignore annul and predict bits since no one sets them yet */ Vals[i].getName() != "annul" && Vals[i].getName() != "predict") { o << " // op" << op << ": " << Vals[i].getName() << "\n" << " int64_t op" << op <<" = getMachineOpValue(MI, MI.getOperand("<getNumBits()-1; bit >= 0; --bit) { if (VarBitInit *VBI = dynamic_cast(InstInit->getBit(bit))) { TypedInit *TI = VBI->getVariable(); if (VarInit *VI = dynamic_cast(TI)) { // only process the current variable if (VI->getName() != Vals[i].getName()) continue; if (beginBitInVar == -1) beginBitInVar = VBI->getBitNum(); if (endBitInVar == -1) endBitInVar = VBI->getBitNum(); else { if (endBitInVar == (int)VBI->getBitNum() + 1) endBitInVar = VBI->getBitNum(); else { continuous = false; break; } } if (beginBitInInst == -1) beginBitInInst = bit; if (endBitInInst == -1) endBitInInst = bit; else { if (endBitInInst == bit + 1) endBitInInst = bit; else { continuous = false; break; } } // maintain same distance between bits in field and bits in // instruction. if the relative distances stay the same // throughout, if ((beginBitInVar - (int)VBI->getBitNum()) != (beginBitInInst - bit)) { continuous = false; break; } } } } DEBUG(o << " // Var: begin = " << beginBitInVar << ", end = " << endBitInVar << "; Inst: begin = " << beginBitInInst << ", end = " << endBitInInst << "\n"); if (continuous) { DEBUG(o << " // continuous: op" << OpOrder[Vals[i].getName()] << "\n"); // Mask off the right bits // Low mask (ie. shift, if necessary) if (endBitInVar != 0) { o << " op" << OpOrder[Vals[i].getName()] << " >>= " << endBitInVar << ";\n"; beginBitInVar -= endBitInVar; endBitInVar = 0; } // High mask o << " op" << OpOrder[Vals[i].getName()] << " &= (1<<" << beginBitInVar+1 << ") - 1;\n"; // Shift the value to the correct place (according to place in instr) if (endBitInInst != 0) o << " op" << OpOrder[Vals[i].getName()] << " <<= " << endBitInInst << ";\n"; // Just OR in the result o << " Value |= op" << OpOrder[Vals[i].getName()] << ";\n"; } // otherwise, will be taken care of in the loop below using this value: OpContinuous[Vals[i].getName()] = continuous; } } for (unsigned f = 0, e = Vals.size(); f != e; ++f) { if (Vals[f].getPrefix()) { BitsInit *FieldInitializer = (BitsInit*)Vals[f].getValue(); // Scan through the field looking for bit initializers of the current // variable... for (int i = FieldInitializer->getNumBits()-1; i >= 0; --i) { if (BitInit *BI=dynamic_cast(FieldInitializer->getBit(i))) { DEBUG(o << " // bit init: f: " << f << ", i: " << i << "\n"); } else if (UnsetInit *UI = dynamic_cast(FieldInitializer->getBit(i))) { DEBUG(o << " // unset init: f: " << f << ", i: " << i << "\n"); } else if (VarBitInit *VBI = dynamic_cast(FieldInitializer->getBit(i))) { TypedInit *TI = VBI->getVariable(); if (VarInit *VI = dynamic_cast(TI)) { // If the bits of the field are laid out consecutively in the // instruction, then instead of separately ORing in bits, just // mask and shift the entire field for efficiency. if (OpContinuous[VI->getName()]) { // already taken care of in the loop above, thus there is no // need to individually OR in the bits // for debugging, output the regular version anyway, commented DEBUG(o << " // Value |= getValueBit(op" << OpOrder[VI->getName()] << ", " << VBI->getBitNum() << ")" << " << " << i << ";\n"); } else { o << " Value |= getValueBit(op" << OpOrder[VI->getName()] << ", " << VBI->getBitNum() << ")" << " << " << i << ";\n"; } } else if (FieldInit *FI = dynamic_cast(TI)) { // FIXME: implement this! o << "FIELD INIT not implemented yet!\n"; } else { o << "Error: UNIMPLEMENTED\n"; } } } } else { // ignore annul and predict bits since no one sets them yet if (Vals[f].getName() == "annul" || Vals[f].getName() == "predict") { o << " // found " << Vals[f].getName() << "\n"; } } } o << " break;\n" << " }\n"; } o << " default:\n" << " DEBUG(std::cerr << \"Not supported instr: \" << MI << \"\\n\");\n" << " abort();\n" << " }\n" << " return Value;\n" << "}\n"; return false; }