1 //===- RegisterInfoEmitter.cpp - Generate a Register File Desc. -*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
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.
14 //===----------------------------------------------------------------------===//
16 #include "RegisterInfoEmitter.h"
17 #include "CodeGenTarget.h"
18 #include "CodeGenRegisters.h"
19 #include "SequenceToOffsetTable.h"
20 #include "llvm/TableGen/Error.h"
21 #include "llvm/TableGen/Record.h"
22 #include "llvm/ADT/BitVector.h"
23 #include "llvm/ADT/StringExtras.h"
24 #include "llvm/ADT/STLExtras.h"
25 #include "llvm/ADT/Twine.h"
26 #include "llvm/Support/Format.h"
31 // runEnums - Print out enum values for all of the registers.
32 void RegisterInfoEmitter::runEnums(raw_ostream &OS,
33 CodeGenTarget &Target, CodeGenRegBank &Bank) {
34 const std::vector<CodeGenRegister*> &Registers = Bank.getRegisters();
36 // Register enums are stored as uint16_t in the tables. Make sure we'll fit.
37 assert(Registers.size() <= 0xffff && "Too many regs to fit in tables");
39 std::string Namespace = Registers[0]->TheDef->getValueAsString("Namespace");
41 EmitSourceFileHeader("Target Register Enum Values", OS);
43 OS << "\n#ifdef GET_REGINFO_ENUM\n";
44 OS << "#undef GET_REGINFO_ENUM\n";
46 OS << "namespace llvm {\n\n";
48 OS << "class MCRegisterClass;\n"
49 << "extern const MCRegisterClass " << Namespace
50 << "MCRegisterClasses[];\n\n";
52 if (!Namespace.empty())
53 OS << "namespace " << Namespace << " {\n";
54 OS << "enum {\n NoRegister,\n";
56 for (unsigned i = 0, e = Registers.size(); i != e; ++i)
57 OS << " " << Registers[i]->getName() << " = " <<
58 Registers[i]->EnumValue << ",\n";
59 assert(Registers.size() == Registers[Registers.size()-1]->EnumValue &&
60 "Register enum value mismatch!");
61 OS << " NUM_TARGET_REGS \t// " << Registers.size()+1 << "\n";
63 if (!Namespace.empty())
66 ArrayRef<CodeGenRegisterClass*> RegisterClasses = Bank.getRegClasses();
67 if (!RegisterClasses.empty()) {
69 // RegisterClass enums are stored as uint16_t in the tables.
70 assert(RegisterClasses.size() <= 0xffff &&
71 "Too many register classes to fit in tables");
73 OS << "\n// Register classes\n";
74 if (!Namespace.empty())
75 OS << "namespace " << Namespace << " {\n";
77 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i) {
79 OS << " " << RegisterClasses[i]->getName() << "RegClassID";
83 if (!Namespace.empty())
87 const std::vector<Record*> RegAltNameIndices = Target.getRegAltNameIndices();
88 // If the only definition is the default NoRegAltName, we don't need to
90 if (RegAltNameIndices.size() > 1) {
91 OS << "\n// Register alternate name indices\n";
92 if (!Namespace.empty())
93 OS << "namespace " << Namespace << " {\n";
95 for (unsigned i = 0, e = RegAltNameIndices.size(); i != e; ++i)
96 OS << " " << RegAltNameIndices[i]->getName() << ",\t// " << i << "\n";
97 OS << " NUM_TARGET_REG_ALT_NAMES = " << RegAltNameIndices.size() << "\n";
99 if (!Namespace.empty())
103 ArrayRef<CodeGenSubRegIndex*> SubRegIndices = Bank.getSubRegIndices();
104 if (!SubRegIndices.empty()) {
105 OS << "\n// Subregister indices\n";
106 std::string Namespace =
107 SubRegIndices[0]->getNamespace();
108 if (!Namespace.empty())
109 OS << "namespace " << Namespace << " {\n";
110 OS << "enum {\n NoSubRegister,\n";
111 for (unsigned i = 0, e = Bank.getNumNamedIndices(); i != e; ++i)
112 OS << " " << SubRegIndices[i]->getName() << ",\t// " << i+1 << "\n";
113 OS << " NUM_TARGET_NAMED_SUBREGS\n};\n";
114 if (!Namespace.empty())
118 OS << "} // End llvm namespace \n";
119 OS << "#endif // GET_REGINFO_ENUM\n\n";
122 void RegisterInfoEmitter::
123 EmitRegUnitPressure(raw_ostream &OS, const CodeGenRegBank &RegBank,
124 const std::string &ClassName) {
125 unsigned NumRCs = RegBank.getRegClasses().size();
126 unsigned NumSets = RegBank.getNumRegPressureSets();
128 OS << "/// Get the weight in units of pressure for this register class.\n"
129 << "const RegClassWeight &" << ClassName << "::\n"
130 << "getRegClassWeight(const TargetRegisterClass *RC) const {\n"
131 << " static const RegClassWeight RCWeightTable[] = {\n";
132 for (unsigned i = 0, e = NumRCs; i != e; ++i) {
133 const CodeGenRegisterClass &RC = *RegBank.getRegClasses()[i];
134 const CodeGenRegister::Set &Regs = RC.getMembers();
138 std::vector<unsigned> RegUnits;
139 RC.buildRegUnitSet(RegUnits);
140 OS << " {" << (*Regs.begin())->getWeight(RegBank)
141 << ", " << RegBank.getRegUnitSetWeight(RegUnits);
143 OS << "}, \t// " << RC.getName() << "\n";
146 << " return RCWeightTable[RC->getID()];\n"
150 << "// Get the number of dimensions of register pressure.\n"
151 << "unsigned " << ClassName << "::getNumRegPressureSets() const {\n"
152 << " return " << NumSets << ";\n}\n\n";
154 OS << "// Get the name of this register unit pressure set.\n"
155 << "const char *" << ClassName << "::\n"
156 << "getRegPressureSetName(unsigned Idx) const {\n"
157 << " static const char *PressureNameTable[] = {\n";
158 for (unsigned i = 0; i < NumSets; ++i ) {
159 OS << " \"" << RegBank.getRegPressureSet(i).Name << "\",\n";
162 << " return PressureNameTable[Idx];\n"
165 OS << "// Get the register unit pressure limit for this dimension.\n"
166 << "// This limit must be adjusted dynamically for reserved registers.\n"
167 << "unsigned " << ClassName << "::\n"
168 << "getRegPressureSetLimit(unsigned Idx) const {\n"
169 << " static const unsigned PressureLimitTable[] = {\n";
170 for (unsigned i = 0; i < NumSets; ++i ) {
171 const RegUnitSet &RegUnits = RegBank.getRegPressureSet(i);
172 OS << " " << RegBank.getRegUnitSetWeight(RegUnits.Units)
173 << ", \t// " << i << ": " << RegUnits.Name << "\n";
176 << " return PressureLimitTable[Idx];\n"
179 OS << "/// Get the dimensions of register pressure "
180 << "impacted by this register class.\n"
181 << "/// Returns a -1 terminated array of pressure set IDs\n"
182 << "const int* " << ClassName << "::\n"
183 << "getRegClassPressureSets(const TargetRegisterClass *RC) const {\n"
184 << " static const int RCSetsTable[] = {\n ";
185 std::vector<unsigned> RCSetStarts(NumRCs);
186 for (unsigned i = 0, StartIdx = 0, e = NumRCs; i != e; ++i) {
187 RCSetStarts[i] = StartIdx;
188 ArrayRef<unsigned> PSetIDs = RegBank.getRCPressureSetIDs(i);
189 for (ArrayRef<unsigned>::iterator PSetI = PSetIDs.begin(),
190 PSetE = PSetIDs.end(); PSetI != PSetE; ++PSetI) {
191 OS << *PSetI << ", ";
194 OS << "-1, \t// " << RegBank.getRegClasses()[i]->getName() << "\n ";
198 OS << " static const unsigned RCSetStartTable[] = {\n ";
199 for (unsigned i = 0, e = NumRCs; i != e; ++i) {
200 OS << RCSetStarts[i] << ",";
203 << " unsigned SetListStart = RCSetStartTable[RC->getID()];\n"
204 << " return &RCSetsTable[SetListStart];\n"
209 RegisterInfoEmitter::EmitRegMappingTables(raw_ostream &OS,
210 const std::vector<CodeGenRegister*> &Regs,
212 // Collect all information about dwarf register numbers
213 typedef std::map<Record*, std::vector<int64_t>, LessRecord> DwarfRegNumsMapTy;
214 DwarfRegNumsMapTy DwarfRegNums;
216 // First, just pull all provided information to the map
217 unsigned maxLength = 0;
218 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
219 Record *Reg = Regs[i]->TheDef;
220 std::vector<int64_t> RegNums = Reg->getValueAsListOfInts("DwarfNumbers");
221 maxLength = std::max((size_t)maxLength, RegNums.size());
222 if (DwarfRegNums.count(Reg))
223 PrintWarning(Reg->getLoc(), Twine("DWARF numbers for register ") +
224 getQualifiedName(Reg) + "specified multiple times");
225 DwarfRegNums[Reg] = RegNums;
231 // Now we know maximal length of number list. Append -1's, where needed
232 for (DwarfRegNumsMapTy::iterator
233 I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I)
234 for (unsigned i = I->second.size(), e = maxLength; i != e; ++i)
235 I->second.push_back(-1);
237 std::string Namespace = Regs[0]->TheDef->getValueAsString("Namespace");
239 OS << "// " << Namespace << " Dwarf<->LLVM register mappings.\n";
241 // Emit reverse information about the dwarf register numbers.
242 for (unsigned j = 0; j < 2; ++j) {
243 for (unsigned i = 0, e = maxLength; i != e; ++i) {
244 OS << "extern const MCRegisterInfo::DwarfLLVMRegPair " << Namespace;
245 OS << (j == 0 ? "DwarfFlavour" : "EHFlavour");
246 OS << i << "Dwarf2L[]";
251 // Store the mapping sorted by the LLVM reg num so lookup can be done
252 // with a binary search.
253 std::map<uint64_t, Record*> Dwarf2LMap;
254 for (DwarfRegNumsMapTy::iterator
255 I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I) {
256 int DwarfRegNo = I->second[i];
259 Dwarf2LMap[DwarfRegNo] = I->first;
262 for (std::map<uint64_t, Record*>::iterator
263 I = Dwarf2LMap.begin(), E = Dwarf2LMap.end(); I != E; ++I)
264 OS << " { " << I->first << "U, " << getQualifiedName(I->second)
272 // We have to store the size in a const global, it's used in multiple
274 OS << "extern const unsigned " << Namespace
275 << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i << "Dwarf2LSize";
277 OS << " = sizeof(" << Namespace
278 << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i
279 << "Dwarf2L)/sizeof(MCRegisterInfo::DwarfLLVMRegPair);\n\n";
285 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
286 Record *Reg = Regs[i]->TheDef;
287 const RecordVal *V = Reg->getValue("DwarfAlias");
288 if (!V || !V->getValue())
291 DefInit *DI = dynamic_cast<DefInit*>(V->getValue());
292 Record *Alias = DI->getDef();
293 DwarfRegNums[Reg] = DwarfRegNums[Alias];
296 // Emit information about the dwarf register numbers.
297 for (unsigned j = 0; j < 2; ++j) {
298 for (unsigned i = 0, e = maxLength; i != e; ++i) {
299 OS << "extern const MCRegisterInfo::DwarfLLVMRegPair " << Namespace;
300 OS << (j == 0 ? "DwarfFlavour" : "EHFlavour");
301 OS << i << "L2Dwarf[]";
304 // Store the mapping sorted by the Dwarf reg num so lookup can be done
305 // with a binary search.
306 for (DwarfRegNumsMapTy::iterator
307 I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I) {
308 int RegNo = I->second[i];
309 if (RegNo == -1) // -1 is the default value, don't emit a mapping.
312 OS << " { " << getQualifiedName(I->first) << ", " << RegNo
320 // We have to store the size in a const global, it's used in multiple
322 OS << "extern const unsigned " << Namespace
323 << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i << "L2DwarfSize";
325 OS << " = sizeof(" << Namespace
326 << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i
327 << "L2Dwarf)/sizeof(MCRegisterInfo::DwarfLLVMRegPair);\n\n";
335 RegisterInfoEmitter::EmitRegMapping(raw_ostream &OS,
336 const std::vector<CodeGenRegister*> &Regs,
338 // Emit the initializer so the tables from EmitRegMappingTables get wired up
339 // to the MCRegisterInfo object.
340 unsigned maxLength = 0;
341 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
342 Record *Reg = Regs[i]->TheDef;
343 maxLength = std::max((size_t)maxLength,
344 Reg->getValueAsListOfInts("DwarfNumbers").size());
350 std::string Namespace = Regs[0]->TheDef->getValueAsString("Namespace");
352 // Emit reverse information about the dwarf register numbers.
353 for (unsigned j = 0; j < 2; ++j) {
356 OS << "DwarfFlavour";
361 << " llvm_unreachable(\"Unknown DWARF flavour\");\n";
363 for (unsigned i = 0, e = maxLength; i != e; ++i) {
364 OS << " case " << i << ":\n";
369 raw_string_ostream(Tmp) << Namespace
370 << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i
372 OS << "mapDwarfRegsToLLVMRegs(" << Tmp << ", " << Tmp << "Size, ";
383 // Emit information about the dwarf register numbers.
384 for (unsigned j = 0; j < 2; ++j) {
387 OS << "DwarfFlavour";
392 << " llvm_unreachable(\"Unknown DWARF flavour\");\n";
394 for (unsigned i = 0, e = maxLength; i != e; ++i) {
395 OS << " case " << i << ":\n";
400 raw_string_ostream(Tmp) << Namespace
401 << (j == 0 ? "DwarfFlavour" : "EHFlavour") << i
403 OS << "mapLLVMRegsToDwarfRegs(" << Tmp << ", " << Tmp << "Size, ";
415 // Print a BitVector as a sequence of hex numbers using a little-endian mapping.
416 // Width is the number of bits per hex number.
417 static void printBitVectorAsHex(raw_ostream &OS,
418 const BitVector &Bits,
420 assert(Width <= 32 && "Width too large");
421 unsigned Digits = (Width + 3) / 4;
422 for (unsigned i = 0, e = Bits.size(); i < e; i += Width) {
424 for (unsigned j = 0; j != Width && i + j != e; ++j)
425 Value |= Bits.test(i + j) << j;
426 OS << format("0x%0*x, ", Digits, Value);
430 // Helper to emit a set of bits into a constant byte array.
431 class BitVectorEmitter {
434 void add(unsigned v) {
435 if (v >= Values.size())
436 Values.resize(((v/8)+1)*8); // Round up to the next byte.
440 void print(raw_ostream &OS) {
441 printBitVectorAsHex(OS, Values, 8);
445 static void printRegister(raw_ostream &OS, const CodeGenRegister *Reg) {
446 OS << getQualifiedName(Reg->TheDef);
449 static void printSimpleValueType(raw_ostream &OS, MVT::SimpleValueType VT) {
450 OS << getEnumName(VT);
453 static void printSubRegIndex(raw_ostream &OS, const CodeGenSubRegIndex *Idx) {
454 OS << Idx->getQualifiedName();
458 // runMCDesc - Print out MC register descriptions.
461 RegisterInfoEmitter::runMCDesc(raw_ostream &OS, CodeGenTarget &Target,
462 CodeGenRegBank &RegBank) {
463 EmitSourceFileHeader("MC Register Information", OS);
465 OS << "\n#ifdef GET_REGINFO_MC_DESC\n";
466 OS << "#undef GET_REGINFO_MC_DESC\n";
468 const std::vector<CodeGenRegister*> &Regs = RegBank.getRegisters();
469 std::map<const CodeGenRegister*, CodeGenRegister::Set> Overlaps;
470 RegBank.computeOverlaps(Overlaps);
472 // The lists of sub-registers, super-registers, and overlaps all go in the
473 // same array. That allows us to share suffixes.
474 typedef std::vector<const CodeGenRegister*> RegVec;
475 SmallVector<RegVec, 4> SubRegLists(Regs.size());
476 SmallVector<RegVec, 4> OverlapLists(Regs.size());
477 SequenceToOffsetTable<RegVec, CodeGenRegister::Less> RegSeqs;
479 // Precompute register lists for the SequenceToOffsetTable.
480 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
481 const CodeGenRegister *Reg = Regs[i];
483 // Compute the ordered sub-register list.
484 SetVector<const CodeGenRegister*> SR;
485 Reg->addSubRegsPreOrder(SR, RegBank);
486 RegVec &SubRegList = SubRegLists[i];
487 SubRegList.assign(SR.begin(), SR.end());
488 RegSeqs.add(SubRegList);
490 // Super-registers are already computed.
491 const RegVec &SuperRegList = Reg->getSuperRegs();
492 RegSeqs.add(SuperRegList);
494 // The list of overlaps doesn't need to have any particular order, except
495 // Reg itself must be the first element. Pick an ordering that has one of
496 // the other lists as a suffix.
497 RegVec &OverlapList = OverlapLists[i];
498 const RegVec &Suffix = SubRegList.size() > SuperRegList.size() ?
499 SubRegList : SuperRegList;
500 CodeGenRegister::Set Omit(Suffix.begin(), Suffix.end());
502 // First element is Reg itself.
503 OverlapList.push_back(Reg);
506 // Any elements not in Suffix.
507 const CodeGenRegister::Set &OSet = Overlaps[Reg];
508 std::set_difference(OSet.begin(), OSet.end(),
509 Omit.begin(), Omit.end(),
510 std::back_inserter(OverlapList),
511 CodeGenRegister::Less());
513 // Finally, Suffix itself.
514 OverlapList.insert(OverlapList.end(), Suffix.begin(), Suffix.end());
515 RegSeqs.add(OverlapList);
518 // Compute the final layout of the sequence table.
521 OS << "namespace llvm {\n\n";
523 const std::string &TargetName = Target.getName();
525 // Emit the shared table of register lists.
526 OS << "extern const uint16_t " << TargetName << "RegLists[] = {\n";
527 RegSeqs.emit(OS, printRegister);
530 OS << "extern const MCRegisterDesc " << TargetName
531 << "RegDesc[] = { // Descriptors\n";
532 OS << " { \"NOREG\", 0, 0, 0 },\n";
534 // Emit the register descriptors now.
535 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
536 const CodeGenRegister *Reg = Regs[i];
537 OS << " { \"" << Reg->getName() << "\", "
538 << RegSeqs.get(OverlapLists[i]) << ", "
539 << RegSeqs.get(SubRegLists[i]) << ", "
540 << RegSeqs.get(Reg->getSuperRegs()) << " },\n";
542 OS << "};\n\n"; // End of register descriptors...
544 ArrayRef<CodeGenRegisterClass*> RegisterClasses = RegBank.getRegClasses();
546 // Loop over all of the register classes... emitting each one.
547 OS << "namespace { // Register classes...\n";
549 // Emit the register enum value arrays for each RegisterClass
550 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
551 const CodeGenRegisterClass &RC = *RegisterClasses[rc];
552 ArrayRef<Record*> Order = RC.getOrder();
554 // Give the register class a legal C name if it's anonymous.
555 std::string Name = RC.getName();
557 // Emit the register list now.
558 OS << " // " << Name << " Register Class...\n"
559 << " const uint16_t " << Name
561 for (unsigned i = 0, e = Order.size(); i != e; ++i) {
562 Record *Reg = Order[i];
563 OS << getQualifiedName(Reg) << ", ";
567 OS << " // " << Name << " Bit set.\n"
568 << " const uint8_t " << Name
570 BitVectorEmitter BVE;
571 for (unsigned i = 0, e = Order.size(); i != e; ++i) {
572 Record *Reg = Order[i];
573 BVE.add(Target.getRegBank().getReg(Reg)->EnumValue);
581 OS << "extern const MCRegisterClass " << TargetName
582 << "MCRegisterClasses[] = {\n";
584 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
585 const CodeGenRegisterClass &RC = *RegisterClasses[rc];
587 // Asserts to make sure values will fit in table assuming types from
589 assert((RC.SpillSize/8) <= 0xffff && "SpillSize too large.");
590 assert((RC.SpillAlignment/8) <= 0xffff && "SpillAlignment too large.");
591 assert(RC.CopyCost >= -128 && RC.CopyCost <= 127 && "Copy cost too large.");
593 OS << " { " << '\"' << RC.getName() << "\", "
594 << RC.getName() << ", " << RC.getName() << "Bits, "
595 << RC.getOrder().size() << ", sizeof(" << RC.getName() << "Bits), "
596 << RC.getQualifiedName() + "RegClassID" << ", "
597 << RC.SpillSize/8 << ", "
598 << RC.SpillAlignment/8 << ", "
599 << RC.CopyCost << ", "
600 << RC.Allocatable << " },\n";
605 // Emit the data table for getSubReg().
606 ArrayRef<CodeGenSubRegIndex*> SubRegIndices = RegBank.getSubRegIndices();
607 if (SubRegIndices.size()) {
608 OS << "const uint16_t " << TargetName << "SubRegTable[]["
609 << SubRegIndices.size() << "] = {\n";
610 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
611 const CodeGenRegister::SubRegMap &SRM = Regs[i]->getSubRegs();
612 OS << " /* " << Regs[i]->TheDef->getName() << " */\n";
618 for (unsigned j = 0, je = SubRegIndices.size(); j != je; ++j) {
619 // FIXME: We really should keep this to 80 columns...
620 CodeGenRegister::SubRegMap::const_iterator SubReg =
621 SRM.find(SubRegIndices[j]);
622 if (SubReg != SRM.end())
623 OS << getQualifiedName(SubReg->second->TheDef);
629 OS << "}" << (i != e ? "," : "") << "\n";
632 OS << "const uint16_t *get" << TargetName
633 << "SubRegTable() {\n return (const uint16_t *)" << TargetName
634 << "SubRegTable;\n}\n\n";
637 EmitRegMappingTables(OS, Regs, false);
639 // MCRegisterInfo initialization routine.
640 OS << "static inline void Init" << TargetName
641 << "MCRegisterInfo(MCRegisterInfo *RI, unsigned RA, "
642 << "unsigned DwarfFlavour = 0, unsigned EHFlavour = 0) {\n";
643 OS << " RI->InitMCRegisterInfo(" << TargetName << "RegDesc, "
644 << Regs.size()+1 << ", RA, " << TargetName << "MCRegisterClasses, "
645 << RegisterClasses.size() << ", " << TargetName << "RegLists, ";
646 if (SubRegIndices.size() != 0)
647 OS << "(uint16_t*)" << TargetName << "SubRegTable, "
648 << SubRegIndices.size() << ");\n\n";
650 OS << "NULL, 0);\n\n";
652 EmitRegMapping(OS, Regs, false);
656 OS << "} // End llvm namespace \n";
657 OS << "#endif // GET_REGINFO_MC_DESC\n\n";
661 RegisterInfoEmitter::runTargetHeader(raw_ostream &OS, CodeGenTarget &Target,
662 CodeGenRegBank &RegBank) {
663 EmitSourceFileHeader("Register Information Header Fragment", OS);
665 OS << "\n#ifdef GET_REGINFO_HEADER\n";
666 OS << "#undef GET_REGINFO_HEADER\n";
668 const std::string &TargetName = Target.getName();
669 std::string ClassName = TargetName + "GenRegisterInfo";
671 OS << "#include \"llvm/Target/TargetRegisterInfo.h\"\n\n";
673 OS << "namespace llvm {\n\n";
675 OS << "struct " << ClassName << " : public TargetRegisterInfo {\n"
676 << " explicit " << ClassName
677 << "(unsigned RA, unsigned D = 0, unsigned E = 0);\n"
678 << " virtual bool needsStackRealignment(const MachineFunction &) const\n"
679 << " { return false; }\n";
680 if (!RegBank.getSubRegIndices().empty()) {
681 OS << " unsigned composeSubRegIndices(unsigned, unsigned) const;\n"
682 << " const TargetRegisterClass *"
683 "getSubClassWithSubReg(const TargetRegisterClass*, unsigned) const;\n"
684 << " const TargetRegisterClass *getMatchingSuperRegClass("
685 "const TargetRegisterClass*, const TargetRegisterClass*, "
686 "unsigned) const;\n";
688 OS << " const RegClassWeight &getRegClassWeight("
689 << "const TargetRegisterClass *RC) const;\n"
690 << " unsigned getNumRegPressureSets() const;\n"
691 << " const char *getRegPressureSetName(unsigned Idx) const;\n"
692 << " unsigned getRegPressureSetLimit(unsigned Idx) const;\n"
693 << " const int *getRegClassPressureSets("
694 << "const TargetRegisterClass *RC) const;\n"
697 ArrayRef<CodeGenRegisterClass*> RegisterClasses = RegBank.getRegClasses();
699 if (!RegisterClasses.empty()) {
700 OS << "namespace " << RegisterClasses[0]->Namespace
701 << " { // Register classes\n";
703 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i) {
704 const CodeGenRegisterClass &RC = *RegisterClasses[i];
705 const std::string &Name = RC.getName();
707 // Output the extern for the instance.
708 OS << " extern const TargetRegisterClass " << Name << "RegClass;\n";
710 OS << "} // end of namespace " << TargetName << "\n\n";
712 OS << "} // End llvm namespace \n";
713 OS << "#endif // GET_REGINFO_HEADER\n\n";
717 // runTargetDesc - Output the target register and register file descriptions.
720 RegisterInfoEmitter::runTargetDesc(raw_ostream &OS, CodeGenTarget &Target,
721 CodeGenRegBank &RegBank){
722 EmitSourceFileHeader("Target Register and Register Classes Information", OS);
724 OS << "\n#ifdef GET_REGINFO_TARGET_DESC\n";
725 OS << "#undef GET_REGINFO_TARGET_DESC\n";
727 OS << "namespace llvm {\n\n";
729 // Get access to MCRegisterClass data.
730 OS << "extern const MCRegisterClass " << Target.getName()
731 << "MCRegisterClasses[];\n";
733 // Start out by emitting each of the register classes.
734 ArrayRef<CodeGenRegisterClass*> RegisterClasses = RegBank.getRegClasses();
736 // Collect all registers belonging to any allocatable class.
737 std::set<Record*> AllocatableRegs;
739 // Collect allocatable registers.
740 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
741 const CodeGenRegisterClass &RC = *RegisterClasses[rc];
742 ArrayRef<Record*> Order = RC.getOrder();
745 AllocatableRegs.insert(Order.begin(), Order.end());
748 // Build a shared array of value types.
749 SequenceToOffsetTable<std::vector<MVT::SimpleValueType> > VTSeqs;
750 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc)
751 VTSeqs.add(RegisterClasses[rc]->VTs);
753 OS << "\nstatic const MVT::SimpleValueType VTLists[] = {\n";
754 VTSeqs.emit(OS, printSimpleValueType, "MVT::Other");
757 // Now that all of the structs have been emitted, emit the instances.
758 if (!RegisterClasses.empty()) {
759 std::map<unsigned, std::set<unsigned> > SuperRegClassMap;
761 OS << "\nstatic const TargetRegisterClass *const "
762 << "NullRegClasses[] = { NULL };\n\n";
764 unsigned NumSubRegIndices = RegBank.getSubRegIndices().size();
766 if (NumSubRegIndices) {
767 // Compute the super-register classes for each RegisterClass
768 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
769 const CodeGenRegisterClass &RC = *RegisterClasses[rc];
770 for (DenseMap<Record*,Record*>::const_iterator
771 i = RC.SubRegClasses.begin(),
772 e = RC.SubRegClasses.end(); i != e; ++i) {
773 // Find the register class number of i->second for SuperRegClassMap.
774 const CodeGenRegisterClass *RC2 = RegBank.getRegClass(i->second);
775 assert(RC2 && "Invalid register class in SubRegClasses");
776 SuperRegClassMap[RC2->EnumValue].insert(rc);
780 // Emit the super-register classes for each RegisterClass
781 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
782 const CodeGenRegisterClass &RC = *RegisterClasses[rc];
784 // Give the register class a legal C name if it's anonymous.
785 std::string Name = RC.getName();
788 << " Super-register Classes...\n"
789 << "static const TargetRegisterClass *const "
790 << Name << "SuperRegClasses[] = {\n ";
793 std::map<unsigned, std::set<unsigned> >::iterator I =
794 SuperRegClassMap.find(rc);
795 if (I != SuperRegClassMap.end()) {
796 for (std::set<unsigned>::iterator II = I->second.begin(),
797 EE = I->second.end(); II != EE; ++II) {
798 const CodeGenRegisterClass &RC2 = *RegisterClasses[*II];
801 OS << "&" << RC2.getQualifiedName() << "RegClass";
806 OS << (!Empty ? ", " : "") << "NULL";
811 // Emit the sub-classes array for each RegisterClass
812 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
813 const CodeGenRegisterClass &RC = *RegisterClasses[rc];
815 // Give the register class a legal C name if it's anonymous.
816 std::string Name = RC.getName();
818 OS << "static const uint32_t " << Name << "SubclassMask[] = {\n ";
819 printBitVectorAsHex(OS, RC.getSubClasses(), 32);
823 // Emit NULL terminated super-class lists.
824 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
825 const CodeGenRegisterClass &RC = *RegisterClasses[rc];
826 ArrayRef<CodeGenRegisterClass*> Supers = RC.getSuperClasses();
828 // Skip classes without supers. We can reuse NullRegClasses.
832 OS << "static const TargetRegisterClass *const "
833 << RC.getName() << "Superclasses[] = {\n";
834 for (unsigned i = 0; i != Supers.size(); ++i)
835 OS << " &" << Supers[i]->getQualifiedName() << "RegClass,\n";
836 OS << " NULL\n};\n\n";
840 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i) {
841 const CodeGenRegisterClass &RC = *RegisterClasses[i];
842 if (!RC.AltOrderSelect.empty()) {
843 OS << "\nstatic inline unsigned " << RC.getName()
844 << "AltOrderSelect(const MachineFunction &MF) {"
845 << RC.AltOrderSelect << "}\n\n"
846 << "static ArrayRef<uint16_t> " << RC.getName()
847 << "GetRawAllocationOrder(const MachineFunction &MF) {\n";
848 for (unsigned oi = 1 , oe = RC.getNumOrders(); oi != oe; ++oi) {
849 ArrayRef<Record*> Elems = RC.getOrder(oi);
850 if (!Elems.empty()) {
851 OS << " static const uint16_t AltOrder" << oi << "[] = {";
852 for (unsigned elem = 0; elem != Elems.size(); ++elem)
853 OS << (elem ? ", " : " ") << getQualifiedName(Elems[elem]);
857 OS << " const MCRegisterClass &MCR = " << Target.getName()
858 << "MCRegisterClasses[" << RC.getQualifiedName() + "RegClassID];\n"
859 << " const ArrayRef<uint16_t> Order[] = {\n"
860 << " makeArrayRef(MCR.begin(), MCR.getNumRegs()";
861 for (unsigned oi = 1, oe = RC.getNumOrders(); oi != oe; ++oi)
862 if (RC.getOrder(oi).empty())
863 OS << "),\n ArrayRef<uint16_t>(";
865 OS << "),\n makeArrayRef(AltOrder" << oi;
866 OS << ")\n };\n const unsigned Select = " << RC.getName()
867 << "AltOrderSelect(MF);\n assert(Select < " << RC.getNumOrders()
868 << ");\n return Order[Select];\n}\n";
872 // Now emit the actual value-initialized register class instances.
873 OS << "namespace " << RegisterClasses[0]->Namespace
874 << " { // Register class instances\n";
876 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i) {
877 const CodeGenRegisterClass &RC = *RegisterClasses[i];
878 OS << " extern const TargetRegisterClass "
879 << RegisterClasses[i]->getName() << "RegClass = {\n "
880 << '&' << Target.getName() << "MCRegisterClasses[" << RC.getName()
882 << "VTLists + " << VTSeqs.get(RC.VTs) << ",\n "
883 << RC.getName() << "SubclassMask,\n ";
884 if (RC.getSuperClasses().empty())
885 OS << "NullRegClasses,\n ";
887 OS << RC.getName() << "Superclasses,\n ";
888 OS << (NumSubRegIndices ? RC.getName() + "Super" : std::string("Null"))
890 if (RC.AltOrderSelect.empty())
893 OS << RC.getName() << "GetRawAllocationOrder\n";
900 OS << "\nnamespace {\n";
901 OS << " const TargetRegisterClass* const RegisterClasses[] = {\n";
902 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i)
903 OS << " &" << RegisterClasses[i]->getQualifiedName()
906 OS << "}\n"; // End of anonymous namespace...
908 // Emit extra information about registers.
909 const std::string &TargetName = Target.getName();
910 OS << "\nstatic const TargetRegisterInfoDesc "
911 << TargetName << "RegInfoDesc[] = { // Extra Descriptors\n";
912 OS << " { 0, 0 },\n";
914 const std::vector<CodeGenRegister*> &Regs = RegBank.getRegisters();
915 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
916 const CodeGenRegister &Reg = *Regs[i];
918 OS << Reg.CostPerUse << ", "
919 << int(AllocatableRegs.count(Reg.TheDef)) << " },\n";
921 OS << "};\n"; // End of register descriptors...
924 // Calculate the mapping of subregister+index pairs to physical registers.
925 // This will also create further anonymous indices.
926 unsigned NamedIndices = RegBank.getNumNamedIndices();
928 // Emit SubRegIndex names, skipping 0
929 ArrayRef<CodeGenSubRegIndex*> SubRegIndices = RegBank.getSubRegIndices();
930 OS << "\nstatic const char *const " << TargetName
931 << "SubRegIndexTable[] = { \"";
932 for (unsigned i = 0, e = SubRegIndices.size(); i != e; ++i) {
933 OS << SubRegIndices[i]->getName();
939 // Emit names of the anonymous subreg indices.
940 if (SubRegIndices.size() > NamedIndices) {
942 for (unsigned i = NamedIndices, e = SubRegIndices.size(); i != e; ++i) {
943 OS << "\n " << SubRegIndices[i]->getName() << " = " << i+1;
951 std::string ClassName = Target.getName() + "GenRegisterInfo";
953 // Emit composeSubRegIndices
954 if (!SubRegIndices.empty()) {
955 OS << "unsigned " << ClassName
956 << "::composeSubRegIndices(unsigned IdxA, unsigned IdxB) const {\n"
957 << " switch (IdxA) {\n"
958 << " default:\n return IdxB;\n";
959 for (unsigned i = 0, e = SubRegIndices.size(); i != e; ++i) {
961 for (unsigned j = 0; j != e; ++j) {
962 if (CodeGenSubRegIndex *Comp =
963 SubRegIndices[i]->compose(SubRegIndices[j])) {
965 OS << " case " << SubRegIndices[i]->getQualifiedName()
966 << ": switch(IdxB) {\n default: return IdxB;\n";
969 OS << " case " << SubRegIndices[j]->getQualifiedName()
970 << ": return " << Comp->getQualifiedName() << ";\n";
979 // Emit getSubClassWithSubReg.
980 if (!SubRegIndices.empty()) {
981 OS << "const TargetRegisterClass *" << ClassName
982 << "::getSubClassWithSubReg(const TargetRegisterClass *RC, unsigned Idx)"
984 // Use the smallest type that can hold a regclass ID with room for a
986 if (RegisterClasses.size() < UINT8_MAX)
987 OS << " static const uint8_t Table[";
988 else if (RegisterClasses.size() < UINT16_MAX)
989 OS << " static const uint16_t Table[";
991 throw "Too many register classes.";
992 OS << RegisterClasses.size() << "][" << SubRegIndices.size() << "] = {\n";
993 for (unsigned rci = 0, rce = RegisterClasses.size(); rci != rce; ++rci) {
994 const CodeGenRegisterClass &RC = *RegisterClasses[rci];
995 OS << " {\t// " << RC.getName() << "\n";
996 for (unsigned sri = 0, sre = SubRegIndices.size(); sri != sre; ++sri) {
997 CodeGenSubRegIndex *Idx = SubRegIndices[sri];
998 if (CodeGenRegisterClass *SRC = RC.getSubClassWithSubReg(Idx))
999 OS << " " << SRC->EnumValue + 1 << ",\t// " << Idx->getName()
1000 << " -> " << SRC->getName() << "\n";
1002 OS << " 0,\t// " << Idx->getName() << "\n";
1006 OS << " };\n assert(RC && \"Missing regclass\");\n"
1007 << " if (!Idx) return RC;\n --Idx;\n"
1008 << " assert(Idx < " << SubRegIndices.size() << " && \"Bad subreg\");\n"
1009 << " unsigned TV = Table[RC->getID()][Idx];\n"
1010 << " return TV ? getRegClass(TV - 1) : 0;\n}\n\n";
1013 if (!SubRegIndices.empty()) {
1014 // Bitvector table is NumRCs x NumSubIndexes x BVWords, where BVWords is
1015 // the number of 32-bit words required to represent all register classes.
1016 const unsigned BVWords = (RegisterClasses.size()+31)/32;
1017 BitVector BV(RegisterClasses.size());
1019 // Emit super-register class tables. For each register class, RC, create a
1020 // list of subreg indices and bit masks, (Idx, Mask). The bit mask has a
1021 // bit for every superreg regclass, SuperRC, that satisfies:
1023 // For all SuperReg in SuperRC: SuperReg:Idx in RC
1025 // The 0-terminated list of subreg indices starts at:
1027 // SuperRegIdxSeqs + SuperRegIdxOffset[RC]
1029 // The corresponding bitmasks start at:
1031 // SuperRegMasks + SuperRegMaskOffset[RC]
1033 // Every bit mask present in the list has at least one bit set.
1035 // Compress the sub-reg index lists.
1036 SmallVector<std::vector<const CodeGenSubRegIndex*>, 8>
1037 SRILists(RegisterClasses.size());
1038 SequenceToOffsetTable<std::vector<const CodeGenSubRegIndex*> > SRISeqs;
1040 // Emit the SuperRegMasks table while computing per-RC offsets.
1041 SmallVector<unsigned, 8> MaskOffsets;
1042 unsigned MaskOffset = 0;
1043 OS << "static const uint32_t SuperRegMasks[][" << BVWords << "] = {\n";
1044 for (unsigned rci = 0, rce = RegisterClasses.size(); rci != rce; ++rci) {
1045 const CodeGenRegisterClass &RC = *RegisterClasses[rci];
1046 OS << " // " << RC.getName() << '\n';
1047 MaskOffsets.push_back(MaskOffset);
1048 std::vector<const CodeGenSubRegIndex*> &SRIList = SRILists[rci];
1049 for (unsigned sri = 0, sre = SubRegIndices.size(); sri != sre; ++sri) {
1050 CodeGenSubRegIndex *Idx = SubRegIndices[sri];
1052 RC.getSuperRegClasses(Idx, BV);
1055 SRIList.push_back(Idx);
1057 printBitVectorAsHex(OS, BV, 32);
1058 OS << "},\t// " << Idx->getName() << '\n';
1061 SRISeqs.add(SRIList);
1063 OS << "};\n\nstatic const unsigned SuperRegMaskOffset[] = {\n ";
1064 for (unsigned rci = 0, rce = RegisterClasses.size(); rci != rce; ++rci)
1065 OS << ' ' << MaskOffsets[rci] << ',';
1066 OS << "\n};\n\nstatic const uint16_t SuperRegIdxSeqs[] = {\n";
1068 SRISeqs.emit(OS, printSubRegIndex);
1069 OS << "};\n\nstatic const unsigned SuperRegIdxOffset[] = {\n ";
1070 for (unsigned rci = 0, rce = RegisterClasses.size(); rci != rce; ++rci)
1071 OS << ' ' << SRISeqs.get(SRILists[rci]) << ',';
1074 // Emit getMatchingSuperRegClass.
1075 // We need to find the largest sub-class of A such that every register has
1076 // an Idx sub-register in B. Map (B, Idx) to a bit-vector of
1077 // super-register classes that map into B. Then compute the largest common
1078 // sub-class with A by taking advantage of the register class ordering,
1079 // like getCommonSubClass().
1080 OS << "const TargetRegisterClass *" << ClassName
1081 << "::getMatchingSuperRegClass(const TargetRegisterClass *A,"
1082 << " const TargetRegisterClass *B, unsigned Idx) const {\n"
1083 << " assert(A && B && \"Missing regclass\");\n"
1084 << " assert(Idx && Idx <= " << SubRegIndices.size()
1085 << " && \"Bad subreg\");\n"
1086 << " unsigned MOff = SuperRegMaskOffset[B->getID()];\n"
1087 << " unsigned IOff = SuperRegIdxOffset[B->getID()];\n"
1088 << " while (SuperRegIdxSeqs[IOff] != Idx) {\n"
1089 << " if (!SuperRegIdxSeqs[IOff])\n return 0;\n"
1090 << " ++IOff, ++MOff;\n }\n"
1091 << " const uint32_t *TV = SuperRegMasks[MOff];\n"
1092 << " const uint32_t *SC = A->getSubClassMask();\n"
1093 << " for (unsigned i = 0; i != " << BVWords << "; ++i)\n"
1094 << " if (unsigned Common = TV[i] & SC[i])\n"
1095 << " return getRegClass(32*i + CountTrailingZeros_32(Common));\n"
1096 << " return 0;\n}\n\n";
1099 EmitRegUnitPressure(OS, RegBank, ClassName);
1101 // Emit the constructor of the class...
1102 OS << "extern const MCRegisterDesc " << TargetName << "RegDesc[];\n";
1103 OS << "extern const uint16_t " << TargetName << "RegLists[];\n";
1104 if (SubRegIndices.size() != 0)
1105 OS << "extern const uint16_t *get" << TargetName
1106 << "SubRegTable();\n";
1108 EmitRegMappingTables(OS, Regs, true);
1110 OS << ClassName << "::\n" << ClassName
1111 << "(unsigned RA, unsigned DwarfFlavour, unsigned EHFlavour)\n"
1112 << " : TargetRegisterInfo(" << TargetName << "RegInfoDesc"
1113 << ", RegisterClasses, RegisterClasses+" << RegisterClasses.size() <<",\n"
1114 << " " << TargetName << "SubRegIndexTable) {\n"
1115 << " InitMCRegisterInfo(" << TargetName << "RegDesc, "
1116 << Regs.size()+1 << ", RA,\n " << TargetName
1117 << "MCRegisterClasses, " << RegisterClasses.size() << ",\n"
1118 << " " << TargetName << "RegLists,\n"
1120 if (SubRegIndices.size() != 0)
1121 OS << "get" << TargetName << "SubRegTable(), "
1122 << SubRegIndices.size() << ");\n\n";
1124 OS << "NULL, 0);\n\n";
1126 EmitRegMapping(OS, Regs, true);
1131 // Emit CalleeSavedRegs information.
1132 std::vector<Record*> CSRSets =
1133 Records.getAllDerivedDefinitions("CalleeSavedRegs");
1134 for (unsigned i = 0, e = CSRSets.size(); i != e; ++i) {
1135 Record *CSRSet = CSRSets[i];
1136 const SetTheory::RecVec *Regs = RegBank.getSets().expand(CSRSet);
1137 assert(Regs && "Cannot expand CalleeSavedRegs instance");
1139 // Emit the *_SaveList list of callee-saved registers.
1140 OS << "static const uint16_t " << CSRSet->getName()
1141 << "_SaveList[] = { ";
1142 for (unsigned r = 0, re = Regs->size(); r != re; ++r)
1143 OS << getQualifiedName((*Regs)[r]) << ", ";
1146 // Emit the *_RegMask bit mask of call-preserved registers.
1147 OS << "static const uint32_t " << CSRSet->getName()
1148 << "_RegMask[] = { ";
1149 printBitVectorAsHex(OS, RegBank.computeCoveredRegisters(*Regs), 32);
1154 OS << "} // End llvm namespace \n";
1155 OS << "#endif // GET_REGINFO_TARGET_DESC\n\n";
1158 void RegisterInfoEmitter::run(raw_ostream &OS) {
1159 CodeGenTarget Target(Records);
1160 CodeGenRegBank &RegBank = Target.getRegBank();
1161 RegBank.computeDerivedInfo();
1163 runEnums(OS, Target, RegBank);
1164 runMCDesc(OS, Target, RegBank);
1165 runTargetHeader(OS, Target, RegBank);
1166 runTargetDesc(OS, Target, RegBank);