RegisterInfoEmitter.cpp 54 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503
  1. //===- RegisterInfoEmitter.cpp - Generate a Register File Desc. -*- C++ -*-===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is distributed under the University of Illinois Open Source
  6. // License. See LICENSE.TXT for details.
  7. //
  8. //===----------------------------------------------------------------------===//
  9. //
  10. // This tablegen backend is responsible for emitting a description of a target
  11. // register file for a code generator. It uses instances of the Register,
  12. // RegisterAliases, and RegisterClass classes to gather this information.
  13. //
  14. //===----------------------------------------------------------------------===//
  15. #include "CodeGenRegisters.h"
  16. #include "CodeGenTarget.h"
  17. #include "SequenceToOffsetTable.h"
  18. #include "llvm/ADT/BitVector.h"
  19. #include "llvm/ADT/STLExtras.h"
  20. #include "llvm/ADT/StringExtras.h"
  21. #include "llvm/ADT/Twine.h"
  22. #include "llvm/Support/Format.h"
  23. #include "llvm/TableGen/Error.h"
  24. #include "llvm/TableGen/Record.h"
  25. #include "llvm/TableGen/TableGenBackend.h"
  26. #include <algorithm>
  27. #include <set>
  28. #include <vector>
  29. using namespace llvm;
  30. namespace {
  31. class RegisterInfoEmitter {
  32. RecordKeeper &Records;
  33. public:
  34. RegisterInfoEmitter(RecordKeeper &R) : Records(R) {}
  35. // runEnums - Print out enum values for all of the registers.
  36. void runEnums(raw_ostream &o, CodeGenTarget &Target, CodeGenRegBank &Bank);
  37. // runMCDesc - Print out MC register descriptions.
  38. void runMCDesc(raw_ostream &o, CodeGenTarget &Target, CodeGenRegBank &Bank);
  39. // runTargetHeader - Emit a header fragment for the register info emitter.
  40. void runTargetHeader(raw_ostream &o, CodeGenTarget &Target,
  41. CodeGenRegBank &Bank);
  42. // runTargetDesc - Output the target register and register file descriptions.
  43. void runTargetDesc(raw_ostream &o, CodeGenTarget &Target,
  44. CodeGenRegBank &Bank);
  45. // run - Output the register file description.
  46. void run(raw_ostream &o);
  47. private:
  48. void EmitRegMapping(raw_ostream &o, const std::deque<CodeGenRegister> &Regs,
  49. bool isCtor);
  50. void EmitRegMappingTables(raw_ostream &o,
  51. const std::deque<CodeGenRegister> &Regs,
  52. bool isCtor);
  53. void EmitRegUnitPressure(raw_ostream &OS, const CodeGenRegBank &RegBank,
  54. const std::string &ClassName);
  55. void emitComposeSubRegIndices(raw_ostream &OS, CodeGenRegBank &RegBank,
  56. const std::string &ClassName);
  57. void emitComposeSubRegIndexLaneMask(raw_ostream &OS, CodeGenRegBank &RegBank,
  58. const std::string &ClassName);
  59. };
  60. } // End anonymous namespace
  61. // runEnums - Print out enum values for all of the registers.
  62. void RegisterInfoEmitter::runEnums(raw_ostream &OS,
  63. CodeGenTarget &Target, CodeGenRegBank &Bank) {
  64. const auto &Registers = Bank.getRegisters();
  65. // Register enums are stored as uint16_t in the tables. Make sure we'll fit.
  66. assert(Registers.size() <= 0xffff && "Too many regs to fit in tables");
  67. std::string Namespace =
  68. Registers.front().TheDef->getValueAsString("Namespace");
  69. emitSourceFileHeader("Target Register Enum Values", OS);
  70. OS << "\n#ifdef GET_REGINFO_ENUM\n";
  71. OS << "#undef GET_REGINFO_ENUM\n";
  72. OS << "namespace llvm {\n\n";
  73. OS << "class MCRegisterClass;\n"
  74. << "extern const MCRegisterClass " << Namespace
  75. << "MCRegisterClasses[];\n\n";
  76. if (!Namespace.empty())
  77. OS << "namespace " << Namespace << " {\n";
  78. OS << "enum {\n NoRegister,\n";
  79. for (const auto &Reg : Registers)
  80. OS << " " << Reg.getName() << " = " << Reg.EnumValue << ",\n";
  81. assert(Registers.size() == Registers.back().EnumValue &&
  82. "Register enum value mismatch!");
  83. OS << " NUM_TARGET_REGS \t// " << Registers.size()+1 << "\n";
  84. OS << "};\n";
  85. if (!Namespace.empty())
  86. OS << "}\n";
  87. const auto &RegisterClasses = Bank.getRegClasses();
  88. if (!RegisterClasses.empty()) {
  89. // RegisterClass enums are stored as uint16_t in the tables.
  90. assert(RegisterClasses.size() <= 0xffff &&
  91. "Too many register classes to fit in tables");
  92. OS << "\n// Register classes\n";
  93. if (!Namespace.empty())
  94. OS << "namespace " << Namespace << " {\n";
  95. OS << "enum {\n";
  96. for (const auto &RC : RegisterClasses)
  97. OS << " " << RC.getName() << "RegClassID"
  98. << " = " << RC.EnumValue << ",\n";
  99. OS << "\n };\n";
  100. if (!Namespace.empty())
  101. OS << "}\n";
  102. }
  103. const std::vector<Record*> &RegAltNameIndices = Target.getRegAltNameIndices();
  104. // If the only definition is the default NoRegAltName, we don't need to
  105. // emit anything.
  106. if (RegAltNameIndices.size() > 1) {
  107. OS << "\n// Register alternate name indices\n";
  108. if (!Namespace.empty())
  109. OS << "namespace " << Namespace << " {\n";
  110. OS << "enum {\n";
  111. for (unsigned i = 0, e = RegAltNameIndices.size(); i != e; ++i)
  112. OS << " " << RegAltNameIndices[i]->getName() << ",\t// " << i << "\n";
  113. OS << " NUM_TARGET_REG_ALT_NAMES = " << RegAltNameIndices.size() << "\n";
  114. OS << "};\n";
  115. if (!Namespace.empty())
  116. OS << "}\n";
  117. }
  118. auto &SubRegIndices = Bank.getSubRegIndices();
  119. if (!SubRegIndices.empty()) {
  120. OS << "\n// Subregister indices\n";
  121. std::string Namespace = SubRegIndices.front().getNamespace();
  122. if (!Namespace.empty())
  123. OS << "namespace " << Namespace << " {\n";
  124. OS << "enum {\n NoSubRegister,\n";
  125. unsigned i = 0;
  126. for (const auto &Idx : SubRegIndices)
  127. OS << " " << Idx.getName() << ",\t// " << ++i << "\n";
  128. OS << " NUM_TARGET_SUBREGS\n};\n";
  129. if (!Namespace.empty())
  130. OS << "}\n";
  131. }
  132. OS << "} // End llvm namespace\n";
  133. OS << "#endif // GET_REGINFO_ENUM\n\n";
  134. }
  135. static void printInt(raw_ostream &OS, int Val) {
  136. OS << Val;
  137. }
  138. static const char *getMinimalTypeForRange(uint64_t Range) {
  139. assert(Range < 0xFFFFFFFFULL && "Enum too large");
  140. if (Range > 0xFFFF)
  141. return "uint32_t";
  142. if (Range > 0xFF)
  143. return "uint16_t";
  144. return "uint8_t";
  145. }
  146. void RegisterInfoEmitter::
  147. EmitRegUnitPressure(raw_ostream &OS, const CodeGenRegBank &RegBank,
  148. const std::string &ClassName) {
  149. unsigned NumRCs = RegBank.getRegClasses().size();
  150. unsigned NumSets = RegBank.getNumRegPressureSets();
  151. OS << "/// Get the weight in units of pressure for this register class.\n"
  152. << "const RegClassWeight &" << ClassName << "::\n"
  153. << "getRegClassWeight(const TargetRegisterClass *RC) const {\n"
  154. << " static const RegClassWeight RCWeightTable[] = {\n";
  155. for (const auto &RC : RegBank.getRegClasses()) {
  156. const CodeGenRegister::Vec &Regs = RC.getMembers();
  157. if (Regs.empty())
  158. OS << " {0, 0";
  159. else {
  160. std::vector<unsigned> RegUnits;
  161. RC.buildRegUnitSet(RegUnits);
  162. OS << " {" << (*Regs.begin())->getWeight(RegBank)
  163. << ", " << RegBank.getRegUnitSetWeight(RegUnits);
  164. }
  165. OS << "}, \t// " << RC.getName() << "\n";
  166. }
  167. OS << " };\n"
  168. << " return RCWeightTable[RC->getID()];\n"
  169. << "}\n\n";
  170. // Reasonable targets (not ARMv7) have unit weight for all units, so don't
  171. // bother generating a table.
  172. bool RegUnitsHaveUnitWeight = true;
  173. for (unsigned UnitIdx = 0, UnitEnd = RegBank.getNumNativeRegUnits();
  174. UnitIdx < UnitEnd; ++UnitIdx) {
  175. if (RegBank.getRegUnit(UnitIdx).Weight > 1)
  176. RegUnitsHaveUnitWeight = false;
  177. }
  178. OS << "/// Get the weight in units of pressure for this register unit.\n"
  179. << "unsigned " << ClassName << "::\n"
  180. << "getRegUnitWeight(unsigned RegUnit) const {\n"
  181. << " assert(RegUnit < " << RegBank.getNumNativeRegUnits()
  182. << " && \"invalid register unit\");\n";
  183. if (!RegUnitsHaveUnitWeight) {
  184. OS << " static const uint8_t RUWeightTable[] = {\n ";
  185. for (unsigned UnitIdx = 0, UnitEnd = RegBank.getNumNativeRegUnits();
  186. UnitIdx < UnitEnd; ++UnitIdx) {
  187. const RegUnit &RU = RegBank.getRegUnit(UnitIdx);
  188. assert(RU.Weight < 256 && "RegUnit too heavy");
  189. OS << RU.Weight << ", ";
  190. }
  191. OS << "};\n"
  192. << " return RUWeightTable[RegUnit];\n";
  193. }
  194. else {
  195. OS << " // All register units have unit weight.\n"
  196. << " return 1;\n";
  197. }
  198. OS << "}\n\n";
  199. OS << "\n"
  200. << "// Get the number of dimensions of register pressure.\n"
  201. << "unsigned " << ClassName << "::getNumRegPressureSets() const {\n"
  202. << " return " << NumSets << ";\n}\n\n";
  203. OS << "// Get the name of this register unit pressure set.\n"
  204. << "const char *" << ClassName << "::\n"
  205. << "getRegPressureSetName(unsigned Idx) const {\n"
  206. << " static const char *const PressureNameTable[] = {\n";
  207. unsigned MaxRegUnitWeight = 0;
  208. for (unsigned i = 0; i < NumSets; ++i ) {
  209. const RegUnitSet &RegUnits = RegBank.getRegSetAt(i);
  210. MaxRegUnitWeight = std::max(MaxRegUnitWeight, RegUnits.Weight);
  211. OS << " \"" << RegUnits.Name << "\",\n";
  212. }
  213. OS << " nullptr };\n"
  214. << " return PressureNameTable[Idx];\n"
  215. << "}\n\n";
  216. OS << "// Get the register unit pressure limit for this dimension.\n"
  217. << "// This limit must be adjusted dynamically for reserved registers.\n"
  218. << "unsigned " << ClassName << "::\n"
  219. << "getRegPressureSetLimit(const MachineFunction &MF, unsigned Idx) const {\n"
  220. << " static const " << getMinimalTypeForRange(MaxRegUnitWeight)
  221. << " PressureLimitTable[] = {\n";
  222. for (unsigned i = 0; i < NumSets; ++i ) {
  223. const RegUnitSet &RegUnits = RegBank.getRegSetAt(i);
  224. OS << " " << RegUnits.Weight << ", \t// " << i << ": "
  225. << RegUnits.Name << "\n";
  226. }
  227. OS << " };\n"
  228. << " return PressureLimitTable[Idx];\n"
  229. << "}\n\n";
  230. SequenceToOffsetTable<std::vector<int>> PSetsSeqs;
  231. // This table may be larger than NumRCs if some register units needed a list
  232. // of unit sets that did not correspond to a register class.
  233. unsigned NumRCUnitSets = RegBank.getNumRegClassPressureSetLists();
  234. std::vector<std::vector<int>> PSets(NumRCUnitSets);
  235. for (unsigned i = 0, e = NumRCUnitSets; i != e; ++i) {
  236. ArrayRef<unsigned> PSetIDs = RegBank.getRCPressureSetIDs(i);
  237. PSets[i].reserve(PSetIDs.size());
  238. for (ArrayRef<unsigned>::iterator PSetI = PSetIDs.begin(),
  239. PSetE = PSetIDs.end(); PSetI != PSetE; ++PSetI) {
  240. PSets[i].push_back(RegBank.getRegPressureSet(*PSetI).Order);
  241. }
  242. std::sort(PSets[i].begin(), PSets[i].end());
  243. PSetsSeqs.add(PSets[i]);
  244. }
  245. PSetsSeqs.layout();
  246. OS << "/// Table of pressure sets per register class or unit.\n"
  247. << "static const int RCSetsTable[] = {\n";
  248. PSetsSeqs.emit(OS, printInt, "-1");
  249. OS << "};\n\n";
  250. OS << "/// Get the dimensions of register pressure impacted by this "
  251. << "register class.\n"
  252. << "/// Returns a -1 terminated array of pressure set IDs\n"
  253. << "const int* " << ClassName << "::\n"
  254. << "getRegClassPressureSets(const TargetRegisterClass *RC) const {\n";
  255. OS << " static const " << getMinimalTypeForRange(PSetsSeqs.size()-1)
  256. << " RCSetStartTable[] = {\n ";
  257. for (unsigned i = 0, e = NumRCs; i != e; ++i) {
  258. OS << PSetsSeqs.get(PSets[i]) << ",";
  259. }
  260. OS << "};\n"
  261. << " return &RCSetsTable[RCSetStartTable[RC->getID()]];\n"
  262. << "}\n\n";
  263. OS << "/// Get the dimensions of register pressure impacted by this "
  264. << "register unit.\n"
  265. << "/// Returns a -1 terminated array of pressure set IDs\n"
  266. << "const int* " << ClassName << "::\n"
  267. << "getRegUnitPressureSets(unsigned RegUnit) const {\n"
  268. << " assert(RegUnit < " << RegBank.getNumNativeRegUnits()
  269. << " && \"invalid register unit\");\n";
  270. OS << " static const " << getMinimalTypeForRange(PSetsSeqs.size()-1)
  271. << " RUSetStartTable[] = {\n ";
  272. for (unsigned UnitIdx = 0, UnitEnd = RegBank.getNumNativeRegUnits();
  273. UnitIdx < UnitEnd; ++UnitIdx) {
  274. OS << PSetsSeqs.get(PSets[RegBank.getRegUnit(UnitIdx).RegClassUnitSetsIdx])
  275. << ",";
  276. }
  277. OS << "};\n"
  278. << " return &RCSetsTable[RUSetStartTable[RegUnit]];\n"
  279. << "}\n\n";
  280. }
  281. void RegisterInfoEmitter::EmitRegMappingTables(
  282. raw_ostream &OS, const std::deque<CodeGenRegister> &Regs, bool isCtor) {
  283. // Collect all information about dwarf register numbers
  284. typedef std::map<Record*, std::vector<int64_t>, LessRecordRegister> DwarfRegNumsMapTy;
  285. DwarfRegNumsMapTy DwarfRegNums;
  286. // First, just pull all provided information to the map
  287. unsigned maxLength = 0;
  288. for (auto &RE : Regs) {
  289. Record *Reg = RE.TheDef;
  290. std::vector<int64_t> RegNums = Reg->getValueAsListOfInts("DwarfNumbers");
  291. maxLength = std::max((size_t)maxLength, RegNums.size());
  292. if (DwarfRegNums.count(Reg))
  293. PrintWarning(Reg->getLoc(), Twine("DWARF numbers for register ") +
  294. getQualifiedName(Reg) + "specified multiple times");
  295. DwarfRegNums[Reg] = RegNums;
  296. }
  297. if (!maxLength)
  298. return;
  299. // Now we know maximal length of number list. Append -1's, where needed
  300. for (DwarfRegNumsMapTy::iterator
  301. I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I)
  302. for (unsigned i = I->second.size(), e = maxLength; i != e; ++i)
  303. I->second.push_back(-1);
  304. std::string Namespace = Regs.front().TheDef->getValueAsString("Namespace");
  305. OS << "// " << Namespace << " Dwarf<->LLVM register mappings.\n";
  306. // Emit reverse information about the dwarf register numbers.
  307. for (unsigned j = 0; j < 2; ++j) {
  308. for (unsigned i = 0, e = maxLength; i != e; ++i) {
  309. OS << "extern const MCRegisterInfo::DwarfLLVMRegPair " << Namespace;
  310. OS << (j == 0 ? "DwarfFlavour" : "EHFlavour");
  311. OS << i << "Dwarf2L[]";
  312. if (!isCtor) {
  313. OS << " = {\n";
  314. // Store the mapping sorted by the LLVM reg num so lookup can be done
  315. // with a binary search.
  316. std::map<uint64_t, Record*> Dwarf2LMap;
  317. for (DwarfRegNumsMapTy::iterator
  318. I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I) {
  319. int DwarfRegNo = I->second[i];
  320. if (DwarfRegNo < 0)
  321. continue;
  322. Dwarf2LMap[DwarfRegNo] = I->first;
  323. }
  324. for (std::map<uint64_t, Record*>::iterator
  325. I = Dwarf2LMap.begin(), E = Dwarf2LMap.end(); I != E; ++I)
  326. OS << " { " << I->first << "U, " << getQualifiedName(I->second)
  327. << " },\n";
  328. OS << "};\n";
  329. } else {
  330. OS << ";\n";
  331. }
  332. // We have to store the size in a const global, it's used in multiple
  333. // places.
  334. OS << "extern const unsigned " << Namespace
  335. << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i << "Dwarf2LSize";
  336. if (!isCtor)
  337. OS << " = array_lengthof(" << Namespace
  338. << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i
  339. << "Dwarf2L);\n\n";
  340. else
  341. OS << ";\n\n";
  342. }
  343. }
  344. for (auto &RE : Regs) {
  345. Record *Reg = RE.TheDef;
  346. const RecordVal *V = Reg->getValue("DwarfAlias");
  347. if (!V || !V->getValue())
  348. continue;
  349. DefInit *DI = cast<DefInit>(V->getValue());
  350. Record *Alias = DI->getDef();
  351. DwarfRegNums[Reg] = DwarfRegNums[Alias];
  352. }
  353. // Emit information about the dwarf register numbers.
  354. for (unsigned j = 0; j < 2; ++j) {
  355. for (unsigned i = 0, e = maxLength; i != e; ++i) {
  356. OS << "extern const MCRegisterInfo::DwarfLLVMRegPair " << Namespace;
  357. OS << (j == 0 ? "DwarfFlavour" : "EHFlavour");
  358. OS << i << "L2Dwarf[]";
  359. if (!isCtor) {
  360. OS << " = {\n";
  361. // Store the mapping sorted by the Dwarf reg num so lookup can be done
  362. // with a binary search.
  363. for (DwarfRegNumsMapTy::iterator
  364. I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I) {
  365. int RegNo = I->second[i];
  366. if (RegNo == -1) // -1 is the default value, don't emit a mapping.
  367. continue;
  368. OS << " { " << getQualifiedName(I->first) << ", " << RegNo
  369. << "U },\n";
  370. }
  371. OS << "};\n";
  372. } else {
  373. OS << ";\n";
  374. }
  375. // We have to store the size in a const global, it's used in multiple
  376. // places.
  377. OS << "extern const unsigned " << Namespace
  378. << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i << "L2DwarfSize";
  379. if (!isCtor)
  380. OS << " = array_lengthof(" << Namespace
  381. << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i << "L2Dwarf);\n\n";
  382. else
  383. OS << ";\n\n";
  384. }
  385. }
  386. }
  387. void RegisterInfoEmitter::EmitRegMapping(
  388. raw_ostream &OS, const std::deque<CodeGenRegister> &Regs, bool isCtor) {
  389. // Emit the initializer so the tables from EmitRegMappingTables get wired up
  390. // to the MCRegisterInfo object.
  391. unsigned maxLength = 0;
  392. for (auto &RE : Regs) {
  393. Record *Reg = RE.TheDef;
  394. maxLength = std::max((size_t)maxLength,
  395. Reg->getValueAsListOfInts("DwarfNumbers").size());
  396. }
  397. if (!maxLength)
  398. return;
  399. std::string Namespace = Regs.front().TheDef->getValueAsString("Namespace");
  400. // Emit reverse information about the dwarf register numbers.
  401. for (unsigned j = 0; j < 2; ++j) {
  402. OS << " switch (";
  403. if (j == 0)
  404. OS << "DwarfFlavour";
  405. else
  406. OS << "EHFlavour";
  407. OS << ") {\n"
  408. << " default:\n"
  409. << " llvm_unreachable(\"Unknown DWARF flavour\");\n";
  410. for (unsigned i = 0, e = maxLength; i != e; ++i) {
  411. OS << " case " << i << ":\n";
  412. OS << " ";
  413. if (!isCtor)
  414. OS << "RI->";
  415. std::string Tmp;
  416. raw_string_ostream(Tmp) << Namespace
  417. << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i
  418. << "Dwarf2L";
  419. OS << "mapDwarfRegsToLLVMRegs(" << Tmp << ", " << Tmp << "Size, ";
  420. if (j == 0)
  421. OS << "false";
  422. else
  423. OS << "true";
  424. OS << ");\n";
  425. OS << " break;\n";
  426. }
  427. OS << " }\n";
  428. }
  429. // Emit information about the dwarf register numbers.
  430. for (unsigned j = 0; j < 2; ++j) {
  431. OS << " switch (";
  432. if (j == 0)
  433. OS << "DwarfFlavour";
  434. else
  435. OS << "EHFlavour";
  436. OS << ") {\n"
  437. << " default:\n"
  438. << " llvm_unreachable(\"Unknown DWARF flavour\");\n";
  439. for (unsigned i = 0, e = maxLength; i != e; ++i) {
  440. OS << " case " << i << ":\n";
  441. OS << " ";
  442. if (!isCtor)
  443. OS << "RI->";
  444. std::string Tmp;
  445. raw_string_ostream(Tmp) << Namespace
  446. << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i
  447. << "L2Dwarf";
  448. OS << "mapLLVMRegsToDwarfRegs(" << Tmp << ", " << Tmp << "Size, ";
  449. if (j == 0)
  450. OS << "false";
  451. else
  452. OS << "true";
  453. OS << ");\n";
  454. OS << " break;\n";
  455. }
  456. OS << " }\n";
  457. }
  458. }
  459. // Print a BitVector as a sequence of hex numbers using a little-endian mapping.
  460. // Width is the number of bits per hex number.
  461. static void printBitVectorAsHex(raw_ostream &OS,
  462. const BitVector &Bits,
  463. unsigned Width) {
  464. assert(Width <= 32 && "Width too large");
  465. unsigned Digits = (Width + 3) / 4;
  466. for (unsigned i = 0, e = Bits.size(); i < e; i += Width) {
  467. unsigned Value = 0;
  468. for (unsigned j = 0; j != Width && i + j != e; ++j)
  469. Value |= Bits.test(i + j) << j;
  470. OS << format("0x%0*x, ", Digits, Value);
  471. }
  472. }
  473. // Helper to emit a set of bits into a constant byte array.
  474. class BitVectorEmitter {
  475. BitVector Values;
  476. public:
  477. void add(unsigned v) {
  478. if (v >= Values.size())
  479. Values.resize(((v/8)+1)*8); // Round up to the next byte.
  480. Values[v] = true;
  481. }
  482. void print(raw_ostream &OS) {
  483. printBitVectorAsHex(OS, Values, 8);
  484. }
  485. };
  486. static void printSimpleValueType(raw_ostream &OS, MVT::SimpleValueType VT) {
  487. OS << getEnumName(VT);
  488. }
  489. static void printSubRegIndex(raw_ostream &OS, const CodeGenSubRegIndex *Idx) {
  490. OS << Idx->EnumValue;
  491. }
  492. // Differentially encoded register and regunit lists allow for better
  493. // compression on regular register banks. The sequence is computed from the
  494. // differential list as:
  495. //
  496. // out[0] = InitVal;
  497. // out[n+1] = out[n] + diff[n]; // n = 0, 1, ...
  498. //
  499. // The initial value depends on the specific list. The list is terminated by a
  500. // 0 differential which means we can't encode repeated elements.
  501. typedef SmallVector<uint16_t, 4> DiffVec;
  502. typedef SmallVector<unsigned, 4> MaskVec;
  503. // Differentially encode a sequence of numbers into V. The starting value and
  504. // terminating 0 are not added to V, so it will have the same size as List.
  505. static
  506. DiffVec &diffEncode(DiffVec &V, unsigned InitVal, SparseBitVector<> List) {
  507. assert(V.empty() && "Clear DiffVec before diffEncode.");
  508. uint16_t Val = uint16_t(InitVal);
  509. for (uint16_t Cur : List) {
  510. V.push_back(Cur - Val);
  511. Val = Cur;
  512. }
  513. return V;
  514. }
  515. template<typename Iter>
  516. static
  517. DiffVec &diffEncode(DiffVec &V, unsigned InitVal, Iter Begin, Iter End) {
  518. assert(V.empty() && "Clear DiffVec before diffEncode.");
  519. uint16_t Val = uint16_t(InitVal);
  520. for (Iter I = Begin; I != End; ++I) {
  521. uint16_t Cur = (*I)->EnumValue;
  522. V.push_back(Cur - Val);
  523. Val = Cur;
  524. }
  525. return V;
  526. }
  527. static void printDiff16(raw_ostream &OS, uint16_t Val) {
  528. OS << Val;
  529. }
  530. static void printMask(raw_ostream &OS, unsigned Val) {
  531. OS << format("0x%08X", Val);
  532. }
  533. // Try to combine Idx's compose map into Vec if it is compatible.
  534. // Return false if it's not possible.
  535. static bool combine(const CodeGenSubRegIndex *Idx,
  536. SmallVectorImpl<CodeGenSubRegIndex*> &Vec) {
  537. const CodeGenSubRegIndex::CompMap &Map = Idx->getComposites();
  538. for (const auto &I : Map) {
  539. CodeGenSubRegIndex *&Entry = Vec[I.first->EnumValue - 1];
  540. if (Entry && Entry != I.second)
  541. return false;
  542. }
  543. // All entries are compatible. Make it so.
  544. for (const auto &I : Map) {
  545. auto *&Entry = Vec[I.first->EnumValue - 1];
  546. assert((!Entry || Entry == I.second) &&
  547. "Expected EnumValue to be unique");
  548. Entry = I.second;
  549. }
  550. return true;
  551. }
  552. void
  553. RegisterInfoEmitter::emitComposeSubRegIndices(raw_ostream &OS,
  554. CodeGenRegBank &RegBank,
  555. const std::string &ClName) {
  556. const auto &SubRegIndices = RegBank.getSubRegIndices();
  557. OS << "unsigned " << ClName
  558. << "::composeSubRegIndicesImpl(unsigned IdxA, unsigned IdxB) const {\n";
  559. // Many sub-register indexes are composition-compatible, meaning that
  560. //
  561. // compose(IdxA, IdxB) == compose(IdxA', IdxB)
  562. //
  563. // for many IdxA, IdxA' pairs. Not all sub-register indexes can be composed.
  564. // The illegal entries can be use as wildcards to compress the table further.
  565. // Map each Sub-register index to a compatible table row.
  566. SmallVector<unsigned, 4> RowMap;
  567. SmallVector<SmallVector<CodeGenSubRegIndex*, 4>, 4> Rows;
  568. auto SubRegIndicesSize =
  569. std::distance(SubRegIndices.begin(), SubRegIndices.end());
  570. for (const auto &Idx : SubRegIndices) {
  571. unsigned Found = ~0u;
  572. for (unsigned r = 0, re = Rows.size(); r != re; ++r) {
  573. if (combine(&Idx, Rows[r])) {
  574. Found = r;
  575. break;
  576. }
  577. }
  578. if (Found == ~0u) {
  579. Found = Rows.size();
  580. Rows.resize(Found + 1);
  581. Rows.back().resize(SubRegIndicesSize);
  582. combine(&Idx, Rows.back());
  583. }
  584. RowMap.push_back(Found);
  585. }
  586. // Output the row map if there is multiple rows.
  587. if (Rows.size() > 1) {
  588. OS << " static const " << getMinimalTypeForRange(Rows.size()) << " RowMap["
  589. << SubRegIndicesSize << "] = {\n ";
  590. for (unsigned i = 0, e = SubRegIndicesSize; i != e; ++i)
  591. OS << RowMap[i] << ", ";
  592. OS << "\n };\n";
  593. }
  594. // Output the rows.
  595. OS << " static const " << getMinimalTypeForRange(SubRegIndicesSize + 1)
  596. << " Rows[" << Rows.size() << "][" << SubRegIndicesSize << "] = {\n";
  597. for (unsigned r = 0, re = Rows.size(); r != re; ++r) {
  598. OS << " { ";
  599. for (unsigned i = 0, e = SubRegIndicesSize; i != e; ++i)
  600. if (Rows[r][i])
  601. OS << Rows[r][i]->EnumValue << ", ";
  602. else
  603. OS << "0, ";
  604. OS << "},\n";
  605. }
  606. OS << " };\n\n";
  607. OS << " --IdxA; assert(IdxA < " << SubRegIndicesSize << ");\n"
  608. << " --IdxB; assert(IdxB < " << SubRegIndicesSize << ");\n";
  609. if (Rows.size() > 1)
  610. OS << " return Rows[RowMap[IdxA]][IdxB];\n";
  611. else
  612. OS << " return Rows[0][IdxB];\n";
  613. OS << "}\n\n";
  614. }
  615. void
  616. RegisterInfoEmitter::emitComposeSubRegIndexLaneMask(raw_ostream &OS,
  617. CodeGenRegBank &RegBank,
  618. const std::string &ClName) {
  619. // See the comments in computeSubRegLaneMasks() for our goal here.
  620. const auto &SubRegIndices = RegBank.getSubRegIndices();
  621. // Create a list of Mask+Rotate operations, with equivalent entries merged.
  622. SmallVector<unsigned, 4> SubReg2SequenceIndexMap;
  623. SmallVector<SmallVector<MaskRolPair, 1>, 4> Sequences;
  624. for (const auto &Idx : SubRegIndices) {
  625. const SmallVector<MaskRolPair, 1> &IdxSequence
  626. = Idx.CompositionLaneMaskTransform;
  627. unsigned Found = ~0u;
  628. unsigned SIdx = 0;
  629. unsigned NextSIdx;
  630. for (size_t s = 0, se = Sequences.size(); s != se; ++s, SIdx = NextSIdx) {
  631. SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s];
  632. NextSIdx = SIdx + Sequence.size() + 1;
  633. if (Sequence == IdxSequence) {
  634. Found = SIdx;
  635. break;
  636. }
  637. }
  638. if (Found == ~0u) {
  639. Sequences.push_back(IdxSequence);
  640. Found = SIdx;
  641. }
  642. SubReg2SequenceIndexMap.push_back(Found);
  643. }
  644. OS << "unsigned " << ClName
  645. << "::composeSubRegIndexLaneMaskImpl(unsigned IdxA, unsigned LaneMask)"
  646. " const {\n";
  647. OS << " struct MaskRolOp {\n"
  648. " unsigned Mask;\n"
  649. " uint8_t RotateLeft;\n"
  650. " };\n"
  651. " static const MaskRolOp Seqs[] = {\n";
  652. unsigned Idx = 0;
  653. for (size_t s = 0, se = Sequences.size(); s != se; ++s) {
  654. OS << " ";
  655. const SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s];
  656. for (size_t p = 0, pe = Sequence.size(); p != pe; ++p) {
  657. const MaskRolPair &P = Sequence[p];
  658. OS << format("{ 0x%08X, %2u }, ", P.Mask, P.RotateLeft);
  659. }
  660. OS << "{ 0, 0 }";
  661. if (s+1 != se)
  662. OS << ", ";
  663. OS << " // Sequence " << Idx << "\n";
  664. Idx += Sequence.size() + 1;
  665. }
  666. OS << " };\n"
  667. " static const MaskRolOp *const CompositeSequences[] = {\n";
  668. for (size_t i = 0, e = SubRegIndices.size(); i != e; ++i) {
  669. OS << " ";
  670. unsigned Idx = SubReg2SequenceIndexMap[i];
  671. OS << format("&Seqs[%u]", Idx);
  672. if (i+1 != e)
  673. OS << ",";
  674. OS << " // to " << SubRegIndices[i].getName() << "\n";
  675. }
  676. OS << " };\n\n";
  677. OS << " --IdxA; assert(IdxA < " << SubRegIndices.size()
  678. << " && \"Subregister index out of bounds\");\n"
  679. " unsigned Result = 0;\n"
  680. " for (const MaskRolOp *Ops = CompositeSequences[IdxA]; Ops->Mask != 0; ++Ops)"
  681. " {\n"
  682. " unsigned Masked = LaneMask & Ops->Mask;\n"
  683. " Result |= (Masked << Ops->RotateLeft) & 0xFFFFFFFF;\n"
  684. " Result |= (Masked >> ((32 - Ops->RotateLeft) & 0x1F));\n"
  685. " }\n"
  686. " return Result;\n"
  687. "}\n";
  688. }
  689. //
  690. // runMCDesc - Print out MC register descriptions.
  691. //
  692. void
  693. RegisterInfoEmitter::runMCDesc(raw_ostream &OS, CodeGenTarget &Target,
  694. CodeGenRegBank &RegBank) {
  695. emitSourceFileHeader("MC Register Information", OS);
  696. OS << "\n#ifdef GET_REGINFO_MC_DESC\n";
  697. OS << "#undef GET_REGINFO_MC_DESC\n";
  698. const auto &Regs = RegBank.getRegisters();
  699. auto &SubRegIndices = RegBank.getSubRegIndices();
  700. // The lists of sub-registers and super-registers go in the same array. That
  701. // allows us to share suffixes.
  702. typedef std::vector<const CodeGenRegister*> RegVec;
  703. // Differentially encoded lists.
  704. SequenceToOffsetTable<DiffVec> DiffSeqs;
  705. SmallVector<DiffVec, 4> SubRegLists(Regs.size());
  706. SmallVector<DiffVec, 4> SuperRegLists(Regs.size());
  707. SmallVector<DiffVec, 4> RegUnitLists(Regs.size());
  708. SmallVector<unsigned, 4> RegUnitInitScale(Regs.size());
  709. // List of lane masks accompanying register unit sequences.
  710. SequenceToOffsetTable<MaskVec> LaneMaskSeqs;
  711. SmallVector<MaskVec, 4> RegUnitLaneMasks(Regs.size());
  712. // Keep track of sub-register names as well. These are not differentially
  713. // encoded.
  714. typedef SmallVector<const CodeGenSubRegIndex*, 4> SubRegIdxVec;
  715. SequenceToOffsetTable<SubRegIdxVec, deref<llvm::less>> SubRegIdxSeqs;
  716. SmallVector<SubRegIdxVec, 4> SubRegIdxLists(Regs.size());
  717. SequenceToOffsetTable<std::string> RegStrings;
  718. // Precompute register lists for the SequenceToOffsetTable.
  719. unsigned i = 0;
  720. for (auto I = Regs.begin(), E = Regs.end(); I != E; ++I, ++i) {
  721. const auto &Reg = *I;
  722. RegStrings.add(Reg.getName());
  723. // Compute the ordered sub-register list.
  724. SetVector<const CodeGenRegister*> SR;
  725. Reg.addSubRegsPreOrder(SR, RegBank);
  726. diffEncode(SubRegLists[i], Reg.EnumValue, SR.begin(), SR.end());
  727. DiffSeqs.add(SubRegLists[i]);
  728. // Compute the corresponding sub-register indexes.
  729. SubRegIdxVec &SRIs = SubRegIdxLists[i];
  730. for (unsigned j = 0, je = SR.size(); j != je; ++j)
  731. SRIs.push_back(Reg.getSubRegIndex(SR[j]));
  732. SubRegIdxSeqs.add(SRIs);
  733. // Super-registers are already computed.
  734. const RegVec &SuperRegList = Reg.getSuperRegs();
  735. diffEncode(SuperRegLists[i], Reg.EnumValue, SuperRegList.begin(),
  736. SuperRegList.end());
  737. DiffSeqs.add(SuperRegLists[i]);
  738. // Differentially encode the register unit list, seeded by register number.
  739. // First compute a scale factor that allows more diff-lists to be reused:
  740. //
  741. // D0 -> (S0, S1)
  742. // D1 -> (S2, S3)
  743. //
  744. // A scale factor of 2 allows D0 and D1 to share a diff-list. The initial
  745. // value for the differential decoder is the register number multiplied by
  746. // the scale.
  747. //
  748. // Check the neighboring registers for arithmetic progressions.
  749. unsigned ScaleA = ~0u, ScaleB = ~0u;
  750. SparseBitVector<> RUs = Reg.getNativeRegUnits();
  751. if (I != Regs.begin() &&
  752. std::prev(I)->getNativeRegUnits().count() == RUs.count())
  753. ScaleB = *RUs.begin() - *std::prev(I)->getNativeRegUnits().begin();
  754. if (std::next(I) != Regs.end() &&
  755. std::next(I)->getNativeRegUnits().count() == RUs.count())
  756. ScaleA = *std::next(I)->getNativeRegUnits().begin() - *RUs.begin();
  757. unsigned Scale = std::min(ScaleB, ScaleA);
  758. // Default the scale to 0 if it can't be encoded in 4 bits.
  759. if (Scale >= 16)
  760. Scale = 0;
  761. RegUnitInitScale[i] = Scale;
  762. DiffSeqs.add(diffEncode(RegUnitLists[i], Scale * Reg.EnumValue, RUs));
  763. const auto &RUMasks = Reg.getRegUnitLaneMasks();
  764. MaskVec &LaneMaskVec = RegUnitLaneMasks[i];
  765. assert(LaneMaskVec.empty());
  766. LaneMaskVec.insert(LaneMaskVec.begin(), RUMasks.begin(), RUMasks.end());
  767. // Terminator mask should not be used inside of the list.
  768. #ifndef NDEBUG
  769. for (unsigned M : LaneMaskVec) {
  770. assert(M != ~0u && "terminator mask should not be part of the list");
  771. }
  772. #endif
  773. LaneMaskSeqs.add(LaneMaskVec);
  774. }
  775. // Compute the final layout of the sequence table.
  776. DiffSeqs.layout();
  777. LaneMaskSeqs.layout();
  778. SubRegIdxSeqs.layout();
  779. OS << "namespace llvm {\n\n";
  780. const std::string &TargetName = Target.getName();
  781. // Emit the shared table of differential lists.
  782. OS << "extern const MCPhysReg " << TargetName << "RegDiffLists[] = {\n";
  783. DiffSeqs.emit(OS, printDiff16);
  784. OS << "};\n\n";
  785. // Emit the shared table of regunit lane mask sequences.
  786. OS << "extern const unsigned " << TargetName << "LaneMaskLists[] = {\n";
  787. LaneMaskSeqs.emit(OS, printMask, "~0u");
  788. OS << "};\n\n";
  789. // Emit the table of sub-register indexes.
  790. OS << "extern const uint16_t " << TargetName << "SubRegIdxLists[] = {\n";
  791. SubRegIdxSeqs.emit(OS, printSubRegIndex);
  792. OS << "};\n\n";
  793. // Emit the table of sub-register index sizes.
  794. OS << "extern const MCRegisterInfo::SubRegCoveredBits "
  795. << TargetName << "SubRegIdxRanges[] = {\n";
  796. OS << " { " << (uint16_t)-1 << ", " << (uint16_t)-1 << " },\n";
  797. for (const auto &Idx : SubRegIndices) {
  798. OS << " { " << Idx.Offset << ", " << Idx.Size << " },\t// "
  799. << Idx.getName() << "\n";
  800. }
  801. OS << "};\n\n";
  802. // Emit the string table.
  803. RegStrings.layout();
  804. OS << "extern const char " << TargetName << "RegStrings[] = {\n";
  805. RegStrings.emit(OS, printChar);
  806. OS << "};\n\n";
  807. OS << "extern const MCRegisterDesc " << TargetName
  808. << "RegDesc[] = { // Descriptors\n";
  809. OS << " { " << RegStrings.get("") << ", 0, 0, 0, 0, 0 },\n";
  810. // Emit the register descriptors now.
  811. i = 0;
  812. for (const auto &Reg : Regs) {
  813. OS << " { " << RegStrings.get(Reg.getName()) << ", "
  814. << DiffSeqs.get(SubRegLists[i]) << ", " << DiffSeqs.get(SuperRegLists[i])
  815. << ", " << SubRegIdxSeqs.get(SubRegIdxLists[i]) << ", "
  816. << (DiffSeqs.get(RegUnitLists[i]) * 16 + RegUnitInitScale[i]) << ", "
  817. << LaneMaskSeqs.get(RegUnitLaneMasks[i]) << " },\n";
  818. ++i;
  819. }
  820. OS << "};\n\n"; // End of register descriptors...
  821. // Emit the table of register unit roots. Each regunit has one or two root
  822. // registers.
  823. OS << "extern const MCPhysReg " << TargetName << "RegUnitRoots[][2] = {\n";
  824. for (unsigned i = 0, e = RegBank.getNumNativeRegUnits(); i != e; ++i) {
  825. ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots();
  826. assert(!Roots.empty() && "All regunits must have a root register.");
  827. assert(Roots.size() <= 2 && "More than two roots not supported yet.");
  828. OS << " { " << getQualifiedName(Roots.front()->TheDef);
  829. for (unsigned r = 1; r != Roots.size(); ++r)
  830. OS << ", " << getQualifiedName(Roots[r]->TheDef);
  831. OS << " },\n";
  832. }
  833. OS << "};\n\n";
  834. const auto &RegisterClasses = RegBank.getRegClasses();
  835. // Loop over all of the register classes... emitting each one.
  836. OS << "namespace { // Register classes...\n";
  837. SequenceToOffsetTable<std::string> RegClassStrings;
  838. // Emit the register enum value arrays for each RegisterClass
  839. for (const auto &RC : RegisterClasses) {
  840. ArrayRef<Record*> Order = RC.getOrder();
  841. // Give the register class a legal C name if it's anonymous.
  842. std::string Name = RC.getName();
  843. RegClassStrings.add(Name);
  844. // Emit the register list now.
  845. OS << " // " << Name << " Register Class...\n"
  846. << " const MCPhysReg " << Name
  847. << "[] = {\n ";
  848. for (unsigned i = 0, e = Order.size(); i != e; ++i) {
  849. Record *Reg = Order[i];
  850. OS << getQualifiedName(Reg) << ", ";
  851. }
  852. OS << "\n };\n\n";
  853. OS << " // " << Name << " Bit set.\n"
  854. << " const uint8_t " << Name
  855. << "Bits[] = {\n ";
  856. BitVectorEmitter BVE;
  857. for (unsigned i = 0, e = Order.size(); i != e; ++i) {
  858. Record *Reg = Order[i];
  859. BVE.add(Target.getRegBank().getReg(Reg)->EnumValue);
  860. }
  861. BVE.print(OS);
  862. OS << "\n };\n\n";
  863. }
  864. OS << "}\n\n";
  865. RegClassStrings.layout();
  866. OS << "extern const char " << TargetName << "RegClassStrings[] = {\n";
  867. RegClassStrings.emit(OS, printChar);
  868. OS << "};\n\n";
  869. OS << "extern const MCRegisterClass " << TargetName
  870. << "MCRegisterClasses[] = {\n";
  871. for (const auto &RC : RegisterClasses) {
  872. // Asserts to make sure values will fit in table assuming types from
  873. // MCRegisterInfo.h
  874. assert((RC.SpillSize/8) <= 0xffff && "SpillSize too large.");
  875. assert((RC.SpillAlignment/8) <= 0xffff && "SpillAlignment too large.");
  876. assert(RC.CopyCost >= -128 && RC.CopyCost <= 127 && "Copy cost too large.");
  877. OS << " { " << RC.getName() << ", " << RC.getName() << "Bits, "
  878. << RegClassStrings.get(RC.getName()) << ", "
  879. << RC.getOrder().size() << ", sizeof(" << RC.getName() << "Bits), "
  880. << RC.getQualifiedName() + "RegClassID" << ", "
  881. << RC.SpillSize/8 << ", "
  882. << RC.SpillAlignment/8 << ", "
  883. << RC.CopyCost << ", "
  884. << RC.Allocatable << " },\n";
  885. }
  886. OS << "};\n\n";
  887. EmitRegMappingTables(OS, Regs, false);
  888. // Emit Reg encoding table
  889. OS << "extern const uint16_t " << TargetName;
  890. OS << "RegEncodingTable[] = {\n";
  891. // Add entry for NoRegister
  892. OS << " 0,\n";
  893. for (const auto &RE : Regs) {
  894. Record *Reg = RE.TheDef;
  895. BitsInit *BI = Reg->getValueAsBitsInit("HWEncoding");
  896. uint64_t Value = 0;
  897. for (unsigned b = 0, be = BI->getNumBits(); b != be; ++b) {
  898. if (BitInit *B = dyn_cast<BitInit>(BI->getBit(b)))
  899. Value |= (uint64_t)B->getValue() << b;
  900. }
  901. OS << " " << Value << ",\n";
  902. }
  903. OS << "};\n"; // End of HW encoding table
  904. // MCRegisterInfo initialization routine.
  905. OS << "static inline void Init" << TargetName
  906. << "MCRegisterInfo(MCRegisterInfo *RI, unsigned RA, "
  907. << "unsigned DwarfFlavour = 0, unsigned EHFlavour = 0, unsigned PC = 0) "
  908. "{\n"
  909. << " RI->InitMCRegisterInfo(" << TargetName << "RegDesc, "
  910. << Regs.size() + 1 << ", RA, PC, " << TargetName << "MCRegisterClasses, "
  911. << RegisterClasses.size() << ", " << TargetName << "RegUnitRoots, "
  912. << RegBank.getNumNativeRegUnits() << ", " << TargetName << "RegDiffLists, "
  913. << TargetName << "LaneMaskLists, " << TargetName << "RegStrings, "
  914. << TargetName << "RegClassStrings, " << TargetName << "SubRegIdxLists, "
  915. << (std::distance(SubRegIndices.begin(), SubRegIndices.end()) + 1) << ",\n"
  916. << TargetName << "SubRegIdxRanges, " << TargetName
  917. << "RegEncodingTable);\n\n";
  918. EmitRegMapping(OS, Regs, false);
  919. OS << "}\n\n";
  920. OS << "} // End llvm namespace\n";
  921. OS << "#endif // GET_REGINFO_MC_DESC\n\n";
  922. }
  923. void
  924. RegisterInfoEmitter::runTargetHeader(raw_ostream &OS, CodeGenTarget &Target,
  925. CodeGenRegBank &RegBank) {
  926. emitSourceFileHeader("Register Information Header Fragment", OS);
  927. OS << "\n#ifdef GET_REGINFO_HEADER\n";
  928. OS << "#undef GET_REGINFO_HEADER\n";
  929. const std::string &TargetName = Target.getName();
  930. std::string ClassName = TargetName + "GenRegisterInfo";
  931. OS << "#include \"llvm/Target/TargetRegisterInfo.h\"\n\n";
  932. OS << "namespace llvm {\n\n";
  933. OS << "class " << TargetName << "FrameLowering;\n\n";
  934. OS << "struct " << ClassName << " : public TargetRegisterInfo {\n"
  935. << " explicit " << ClassName
  936. << "(unsigned RA, unsigned D = 0, unsigned E = 0, unsigned PC = 0);\n"
  937. << " bool needsStackRealignment(const MachineFunction &) const override\n"
  938. << " { return false; }\n";
  939. if (!RegBank.getSubRegIndices().empty()) {
  940. OS << " unsigned composeSubRegIndicesImpl"
  941. << "(unsigned, unsigned) const override;\n"
  942. << " unsigned composeSubRegIndexLaneMaskImpl"
  943. << "(unsigned, unsigned) const override;\n"
  944. << " const TargetRegisterClass *getSubClassWithSubReg"
  945. << "(const TargetRegisterClass*, unsigned) const override;\n";
  946. }
  947. OS << " const RegClassWeight &getRegClassWeight("
  948. << "const TargetRegisterClass *RC) const override;\n"
  949. << " unsigned getRegUnitWeight(unsigned RegUnit) const override;\n"
  950. << " unsigned getNumRegPressureSets() const override;\n"
  951. << " const char *getRegPressureSetName(unsigned Idx) const override;\n"
  952. << " unsigned getRegPressureSetLimit(const MachineFunction &MF, unsigned "
  953. "Idx) const override;\n"
  954. << " const int *getRegClassPressureSets("
  955. << "const TargetRegisterClass *RC) const override;\n"
  956. << " const int *getRegUnitPressureSets("
  957. << "unsigned RegUnit) const override;\n"
  958. << " ArrayRef<const char *> getRegMaskNames() const override;\n"
  959. << " ArrayRef<const uint32_t *> getRegMasks() const override;\n"
  960. << " /// Devirtualized TargetFrameLowering.\n"
  961. << " static const " << TargetName << "FrameLowering *getFrameLowering(\n"
  962. << " const MachineFunction &MF);\n"
  963. << "};\n\n";
  964. const auto &RegisterClasses = RegBank.getRegClasses();
  965. if (!RegisterClasses.empty()) {
  966. OS << "namespace " << RegisterClasses.front().Namespace
  967. << " { // Register classes\n";
  968. for (const auto &RC : RegisterClasses) {
  969. const std::string &Name = RC.getName();
  970. // Output the extern for the instance.
  971. OS << " extern const TargetRegisterClass " << Name << "RegClass;\n";
  972. }
  973. OS << "} // end of namespace " << TargetName << "\n\n";
  974. }
  975. OS << "} // End llvm namespace\n";
  976. OS << "#endif // GET_REGINFO_HEADER\n\n";
  977. }
  978. //
  979. // runTargetDesc - Output the target register and register file descriptions.
  980. //
  981. void
  982. RegisterInfoEmitter::runTargetDesc(raw_ostream &OS, CodeGenTarget &Target,
  983. CodeGenRegBank &RegBank){
  984. emitSourceFileHeader("Target Register and Register Classes Information", OS);
  985. OS << "\n#ifdef GET_REGINFO_TARGET_DESC\n";
  986. OS << "#undef GET_REGINFO_TARGET_DESC\n";
  987. OS << "namespace llvm {\n\n";
  988. // Get access to MCRegisterClass data.
  989. OS << "extern const MCRegisterClass " << Target.getName()
  990. << "MCRegisterClasses[];\n";
  991. // Start out by emitting each of the register classes.
  992. const auto &RegisterClasses = RegBank.getRegClasses();
  993. const auto &SubRegIndices = RegBank.getSubRegIndices();
  994. // Collect all registers belonging to any allocatable class.
  995. std::set<Record*> AllocatableRegs;
  996. // Collect allocatable registers.
  997. for (const auto &RC : RegisterClasses) {
  998. ArrayRef<Record*> Order = RC.getOrder();
  999. if (RC.Allocatable)
  1000. AllocatableRegs.insert(Order.begin(), Order.end());
  1001. }
  1002. // Build a shared array of value types.
  1003. SequenceToOffsetTable<SmallVector<MVT::SimpleValueType, 4> > VTSeqs;
  1004. for (const auto &RC : RegisterClasses)
  1005. VTSeqs.add(RC.VTs);
  1006. VTSeqs.layout();
  1007. OS << "\nstatic const MVT::SimpleValueType VTLists[] = {\n";
  1008. VTSeqs.emit(OS, printSimpleValueType, "MVT::Other");
  1009. OS << "};\n";
  1010. // Emit SubRegIndex names, skipping 0.
  1011. OS << "\nstatic const char *const SubRegIndexNameTable[] = { \"";
  1012. for (const auto &Idx : SubRegIndices) {
  1013. OS << Idx.getName();
  1014. OS << "\", \"";
  1015. }
  1016. OS << "\" };\n\n";
  1017. // Emit SubRegIndex lane masks, including 0.
  1018. OS << "\nstatic const unsigned SubRegIndexLaneMaskTable[] = {\n ~0u,\n";
  1019. for (const auto &Idx : SubRegIndices) {
  1020. OS << format(" 0x%08x, // ", Idx.LaneMask) << Idx.getName() << '\n';
  1021. }
  1022. OS << " };\n\n";
  1023. OS << "\n";
  1024. // Now that all of the structs have been emitted, emit the instances.
  1025. if (!RegisterClasses.empty()) {
  1026. OS << "\nstatic const TargetRegisterClass *const "
  1027. << "NullRegClasses[] = { nullptr };\n\n";
  1028. // Emit register class bit mask tables. The first bit mask emitted for a
  1029. // register class, RC, is the set of sub-classes, including RC itself.
  1030. //
  1031. // If RC has super-registers, also create a list of subreg indices and bit
  1032. // masks, (Idx, Mask). The bit mask has a bit for every superreg regclass,
  1033. // SuperRC, that satisfies:
  1034. //
  1035. // For all SuperReg in SuperRC: SuperReg:Idx in RC
  1036. //
  1037. // The 0-terminated list of subreg indices starts at:
  1038. //
  1039. // RC->getSuperRegIndices() = SuperRegIdxSeqs + ...
  1040. //
  1041. // The corresponding bitmasks follow the sub-class mask in memory. Each
  1042. // mask has RCMaskWords uint32_t entries.
  1043. //
  1044. // Every bit mask present in the list has at least one bit set.
  1045. // Compress the sub-reg index lists.
  1046. typedef std::vector<const CodeGenSubRegIndex*> IdxList;
  1047. SmallVector<IdxList, 8> SuperRegIdxLists(RegisterClasses.size());
  1048. SequenceToOffsetTable<IdxList, deref<llvm::less>> SuperRegIdxSeqs;
  1049. BitVector MaskBV(RegisterClasses.size());
  1050. for (const auto &RC : RegisterClasses) {
  1051. OS << "static const uint32_t " << RC.getName() << "SubClassMask[] = {\n ";
  1052. printBitVectorAsHex(OS, RC.getSubClasses(), 32);
  1053. // Emit super-reg class masks for any relevant SubRegIndices that can
  1054. // project into RC.
  1055. IdxList &SRIList = SuperRegIdxLists[RC.EnumValue];
  1056. for (auto &Idx : SubRegIndices) {
  1057. MaskBV.reset();
  1058. RC.getSuperRegClasses(&Idx, MaskBV);
  1059. if (MaskBV.none())
  1060. continue;
  1061. SRIList.push_back(&Idx);
  1062. OS << "\n ";
  1063. printBitVectorAsHex(OS, MaskBV, 32);
  1064. OS << "// " << Idx.getName();
  1065. }
  1066. SuperRegIdxSeqs.add(SRIList);
  1067. OS << "\n};\n\n";
  1068. }
  1069. OS << "static const uint16_t SuperRegIdxSeqs[] = {\n";
  1070. SuperRegIdxSeqs.layout();
  1071. SuperRegIdxSeqs.emit(OS, printSubRegIndex);
  1072. OS << "};\n\n";
  1073. // Emit NULL terminated super-class lists.
  1074. for (const auto &RC : RegisterClasses) {
  1075. ArrayRef<CodeGenRegisterClass*> Supers = RC.getSuperClasses();
  1076. // Skip classes without supers. We can reuse NullRegClasses.
  1077. if (Supers.empty())
  1078. continue;
  1079. OS << "static const TargetRegisterClass *const "
  1080. << RC.getName() << "Superclasses[] = {\n";
  1081. for (const auto *Super : Supers)
  1082. OS << " &" << Super->getQualifiedName() << "RegClass,\n";
  1083. OS << " nullptr\n};\n\n";
  1084. }
  1085. // Emit methods.
  1086. for (const auto &RC : RegisterClasses) {
  1087. if (!RC.AltOrderSelect.empty()) {
  1088. OS << "\nstatic inline unsigned " << RC.getName()
  1089. << "AltOrderSelect(const MachineFunction &MF) {"
  1090. << RC.AltOrderSelect << "}\n\n"
  1091. << "static ArrayRef<MCPhysReg> " << RC.getName()
  1092. << "GetRawAllocationOrder(const MachineFunction &MF) {\n";
  1093. for (unsigned oi = 1 , oe = RC.getNumOrders(); oi != oe; ++oi) {
  1094. ArrayRef<Record*> Elems = RC.getOrder(oi);
  1095. if (!Elems.empty()) {
  1096. OS << " static const MCPhysReg AltOrder" << oi << "[] = {";
  1097. for (unsigned elem = 0; elem != Elems.size(); ++elem)
  1098. OS << (elem ? ", " : " ") << getQualifiedName(Elems[elem]);
  1099. OS << " };\n";
  1100. }
  1101. }
  1102. OS << " const MCRegisterClass &MCR = " << Target.getName()
  1103. << "MCRegisterClasses[" << RC.getQualifiedName() + "RegClassID];\n"
  1104. << " const ArrayRef<MCPhysReg> Order[] = {\n"
  1105. << " makeArrayRef(MCR.begin(), MCR.getNumRegs()";
  1106. for (unsigned oi = 1, oe = RC.getNumOrders(); oi != oe; ++oi)
  1107. if (RC.getOrder(oi).empty())
  1108. OS << "),\n ArrayRef<MCPhysReg>(";
  1109. else
  1110. OS << "),\n makeArrayRef(AltOrder" << oi;
  1111. OS << ")\n };\n const unsigned Select = " << RC.getName()
  1112. << "AltOrderSelect(MF);\n assert(Select < " << RC.getNumOrders()
  1113. << ");\n return Order[Select];\n}\n";
  1114. }
  1115. }
  1116. // Now emit the actual value-initialized register class instances.
  1117. OS << "\nnamespace " << RegisterClasses.front().Namespace
  1118. << " { // Register class instances\n";
  1119. for (const auto &RC : RegisterClasses) {
  1120. OS << " extern const TargetRegisterClass " << RC.getName()
  1121. << "RegClass = {\n " << '&' << Target.getName()
  1122. << "MCRegisterClasses[" << RC.getName() << "RegClassID],\n "
  1123. << "VTLists + " << VTSeqs.get(RC.VTs) << ",\n " << RC.getName()
  1124. << "SubClassMask,\n SuperRegIdxSeqs + "
  1125. << SuperRegIdxSeqs.get(SuperRegIdxLists[RC.EnumValue]) << ",\n "
  1126. << format("0x%08x,\n ", RC.LaneMask)
  1127. << (unsigned)RC.AllocationPriority << ",\n "
  1128. << (RC.HasDisjunctSubRegs?"true":"false")
  1129. << ", /* HasDisjunctSubRegs */\n ";
  1130. if (RC.getSuperClasses().empty())
  1131. OS << "NullRegClasses,\n ";
  1132. else
  1133. OS << RC.getName() << "Superclasses,\n ";
  1134. if (RC.AltOrderSelect.empty())
  1135. OS << "nullptr\n";
  1136. else
  1137. OS << RC.getName() << "GetRawAllocationOrder\n";
  1138. OS << " };\n\n";
  1139. }
  1140. OS << "}\n";
  1141. }
  1142. OS << "\nnamespace {\n";
  1143. OS << " const TargetRegisterClass* const RegisterClasses[] = {\n";
  1144. for (const auto &RC : RegisterClasses)
  1145. OS << " &" << RC.getQualifiedName() << "RegClass,\n";
  1146. OS << " };\n";
  1147. OS << "}\n"; // End of anonymous namespace...
  1148. // Emit extra information about registers.
  1149. const std::string &TargetName = Target.getName();
  1150. OS << "\nstatic const TargetRegisterInfoDesc "
  1151. << TargetName << "RegInfoDesc[] = { // Extra Descriptors\n";
  1152. OS << " { 0, 0 },\n";
  1153. const auto &Regs = RegBank.getRegisters();
  1154. for (const auto &Reg : Regs) {
  1155. OS << " { ";
  1156. OS << Reg.CostPerUse << ", "
  1157. << int(AllocatableRegs.count(Reg.TheDef)) << " },\n";
  1158. }
  1159. OS << "};\n"; // End of register descriptors...
  1160. std::string ClassName = Target.getName() + "GenRegisterInfo";
  1161. auto SubRegIndicesSize =
  1162. std::distance(SubRegIndices.begin(), SubRegIndices.end());
  1163. if (!SubRegIndices.empty()) {
  1164. emitComposeSubRegIndices(OS, RegBank, ClassName);
  1165. emitComposeSubRegIndexLaneMask(OS, RegBank, ClassName);
  1166. }
  1167. // Emit getSubClassWithSubReg.
  1168. if (!SubRegIndices.empty()) {
  1169. OS << "const TargetRegisterClass *" << ClassName
  1170. << "::getSubClassWithSubReg(const TargetRegisterClass *RC, unsigned Idx)"
  1171. << " const {\n";
  1172. // Use the smallest type that can hold a regclass ID with room for a
  1173. // sentinel.
  1174. if (RegisterClasses.size() < UINT8_MAX)
  1175. OS << " static const uint8_t Table[";
  1176. else if (RegisterClasses.size() < UINT16_MAX)
  1177. OS << " static const uint16_t Table[";
  1178. else
  1179. PrintFatalError("Too many register classes.");
  1180. OS << RegisterClasses.size() << "][" << SubRegIndicesSize << "] = {\n";
  1181. for (const auto &RC : RegisterClasses) {
  1182. OS << " {\t// " << RC.getName() << "\n";
  1183. for (auto &Idx : SubRegIndices) {
  1184. if (CodeGenRegisterClass *SRC = RC.getSubClassWithSubReg(&Idx))
  1185. OS << " " << SRC->EnumValue + 1 << ",\t// " << Idx.getName()
  1186. << " -> " << SRC->getName() << "\n";
  1187. else
  1188. OS << " 0,\t// " << Idx.getName() << "\n";
  1189. }
  1190. OS << " },\n";
  1191. }
  1192. OS << " };\n assert(RC && \"Missing regclass\");\n"
  1193. << " if (!Idx) return RC;\n --Idx;\n"
  1194. << " assert(Idx < " << SubRegIndicesSize << " && \"Bad subreg\");\n"
  1195. << " unsigned TV = Table[RC->getID()][Idx];\n"
  1196. << " return TV ? getRegClass(TV - 1) : nullptr;\n}\n\n";
  1197. }
  1198. EmitRegUnitPressure(OS, RegBank, ClassName);
  1199. // Emit the constructor of the class...
  1200. OS << "extern const MCRegisterDesc " << TargetName << "RegDesc[];\n";
  1201. OS << "extern const MCPhysReg " << TargetName << "RegDiffLists[];\n";
  1202. OS << "extern const unsigned " << TargetName << "LaneMaskLists[];\n";
  1203. OS << "extern const char " << TargetName << "RegStrings[];\n";
  1204. OS << "extern const char " << TargetName << "RegClassStrings[];\n";
  1205. OS << "extern const MCPhysReg " << TargetName << "RegUnitRoots[][2];\n";
  1206. OS << "extern const uint16_t " << TargetName << "SubRegIdxLists[];\n";
  1207. OS << "extern const MCRegisterInfo::SubRegCoveredBits "
  1208. << TargetName << "SubRegIdxRanges[];\n";
  1209. OS << "extern const uint16_t " << TargetName << "RegEncodingTable[];\n";
  1210. EmitRegMappingTables(OS, Regs, true);
  1211. OS << ClassName << "::\n" << ClassName
  1212. << "(unsigned RA, unsigned DwarfFlavour, unsigned EHFlavour, unsigned PC)\n"
  1213. << " : TargetRegisterInfo(" << TargetName << "RegInfoDesc"
  1214. << ", RegisterClasses, RegisterClasses+" << RegisterClasses.size() <<",\n"
  1215. << " SubRegIndexNameTable, SubRegIndexLaneMaskTable, 0x";
  1216. OS.write_hex(RegBank.CoveringLanes);
  1217. OS << ") {\n"
  1218. << " InitMCRegisterInfo(" << TargetName << "RegDesc, " << Regs.size() + 1
  1219. << ", RA, PC,\n " << TargetName
  1220. << "MCRegisterClasses, " << RegisterClasses.size() << ",\n"
  1221. << " " << TargetName << "RegUnitRoots,\n"
  1222. << " " << RegBank.getNumNativeRegUnits() << ",\n"
  1223. << " " << TargetName << "RegDiffLists,\n"
  1224. << " " << TargetName << "LaneMaskLists,\n"
  1225. << " " << TargetName << "RegStrings,\n"
  1226. << " " << TargetName << "RegClassStrings,\n"
  1227. << " " << TargetName << "SubRegIdxLists,\n"
  1228. << " " << SubRegIndicesSize + 1 << ",\n"
  1229. << " " << TargetName << "SubRegIdxRanges,\n"
  1230. << " " << TargetName << "RegEncodingTable);\n\n";
  1231. EmitRegMapping(OS, Regs, true);
  1232. OS << "}\n\n";
  1233. // Emit CalleeSavedRegs information.
  1234. std::vector<Record*> CSRSets =
  1235. Records.getAllDerivedDefinitions("CalleeSavedRegs");
  1236. for (unsigned i = 0, e = CSRSets.size(); i != e; ++i) {
  1237. Record *CSRSet = CSRSets[i];
  1238. const SetTheory::RecVec *Regs = RegBank.getSets().expand(CSRSet);
  1239. assert(Regs && "Cannot expand CalleeSavedRegs instance");
  1240. // Emit the *_SaveList list of callee-saved registers.
  1241. OS << "static const MCPhysReg " << CSRSet->getName()
  1242. << "_SaveList[] = { ";
  1243. for (unsigned r = 0, re = Regs->size(); r != re; ++r)
  1244. OS << getQualifiedName((*Regs)[r]) << ", ";
  1245. OS << "0 };\n";
  1246. // Emit the *_RegMask bit mask of call-preserved registers.
  1247. BitVector Covered = RegBank.computeCoveredRegisters(*Regs);
  1248. // Check for an optional OtherPreserved set.
  1249. // Add those registers to RegMask, but not to SaveList.
  1250. if (DagInit *OPDag =
  1251. dyn_cast<DagInit>(CSRSet->getValueInit("OtherPreserved"))) {
  1252. SetTheory::RecSet OPSet;
  1253. RegBank.getSets().evaluate(OPDag, OPSet, CSRSet->getLoc());
  1254. Covered |= RegBank.computeCoveredRegisters(
  1255. ArrayRef<Record*>(OPSet.begin(), OPSet.end()));
  1256. }
  1257. OS << "static const uint32_t " << CSRSet->getName()
  1258. << "_RegMask[] = { ";
  1259. printBitVectorAsHex(OS, Covered, 32);
  1260. OS << "};\n";
  1261. }
  1262. OS << "\n\n";
  1263. OS << "ArrayRef<const uint32_t *> " << ClassName
  1264. << "::getRegMasks() const {\n";
  1265. OS << " static const uint32_t *Masks[] = {\n";
  1266. for (Record *CSRSet : CSRSets)
  1267. OS << " " << CSRSet->getName() << "_RegMask, \n";
  1268. OS << " nullptr\n };\n";
  1269. OS << " return ArrayRef<const uint32_t *>(Masks, (size_t)" << CSRSets.size()
  1270. << ");\n";
  1271. OS << "}\n\n";
  1272. OS << "ArrayRef<const char *> " << ClassName
  1273. << "::getRegMaskNames() const {\n";
  1274. OS << " static const char *Names[] = {\n";
  1275. for (Record *CSRSet : CSRSets)
  1276. OS << " " << '"' << CSRSet->getName() << '"' << ",\n";
  1277. OS << " nullptr\n };\n";
  1278. OS << " return ArrayRef<const char *>(Names, (size_t)" << CSRSets.size()
  1279. << ");\n";
  1280. OS << "}\n\n";
  1281. OS << "const " << TargetName << "FrameLowering *"
  1282. << TargetName << "GenRegisterInfo::\n"
  1283. << " getFrameLowering(const MachineFunction &MF) {\n"
  1284. << " return static_cast<const " << TargetName << "FrameLowering *>(\n"
  1285. << " MF.getSubtarget().getFrameLowering());\n"
  1286. << "}\n\n";
  1287. OS << "} // End llvm namespace\n";
  1288. OS << "#endif // GET_REGINFO_TARGET_DESC\n\n";
  1289. }
  1290. void RegisterInfoEmitter::run(raw_ostream &OS) {
  1291. CodeGenTarget Target(Records);
  1292. CodeGenRegBank &RegBank = Target.getRegBank();
  1293. RegBank.computeDerivedInfo();
  1294. runEnums(OS, Target, RegBank);
  1295. runMCDesc(OS, Target, RegBank);
  1296. runTargetHeader(OS, Target, RegBank);
  1297. runTargetDesc(OS, Target, RegBank);
  1298. }
  1299. namespace llvm {
  1300. void EmitRegisterInfo(RecordKeeper &RK, raw_ostream &OS) {
  1301. RegisterInfoEmitter(RK).run(OS);
  1302. }
  1303. } // End llvm namespace