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"
20 #include "llvm/ADT/StringExtras.h"
21 #include "llvm/ADT/STLExtras.h"
22 #include "llvm/Support/Format.h"
27 // runEnums - Print out enum values for all of the registers.
28 void RegisterInfoEmitter::runEnums(raw_ostream &OS) {
29 CodeGenTarget Target(Records);
30 CodeGenRegBank &Bank = Target.getRegBank();
31 const std::vector<CodeGenRegister> &Registers = Target.getRegisters();
33 std::string Namespace = Registers[0].TheDef->getValueAsString("Namespace");
35 EmitSourceFileHeader("Target Register Enum Values", OS);
36 OS << "namespace llvm {\n\n";
38 if (!Namespace.empty())
39 OS << "namespace " << Namespace << " {\n";
40 OS << "enum {\n NoRegister,\n";
42 for (unsigned i = 0, e = Registers.size(); i != e; ++i)
43 OS << " " << Registers[i].getName() << " = " <<
44 Registers[i].EnumValue << ",\n";
45 assert(Registers.size() == Registers[Registers.size()-1].EnumValue &&
46 "Register enum value mismatch!");
47 OS << " NUM_TARGET_REGS \t// " << Registers.size()+1 << "\n";
49 if (!Namespace.empty())
52 const std::vector<Record*> &SubRegIndices = Bank.getSubRegIndices();
53 if (!SubRegIndices.empty()) {
54 OS << "\n// Subregister indices\n";
55 Namespace = SubRegIndices[0]->getValueAsString("Namespace");
56 if (!Namespace.empty())
57 OS << "namespace " << Namespace << " {\n";
58 OS << "enum {\n NoSubRegister,\n";
59 for (unsigned i = 0, e = Bank.getNumNamedIndices(); i != e; ++i)
60 OS << " " << SubRegIndices[i]->getName() << ",\t// " << i+1 << "\n";
61 OS << " NUM_TARGET_NAMED_SUBREGS = " << SubRegIndices.size()+1 << "\n";
63 if (!Namespace.empty())
66 OS << "} // End llvm namespace \n";
69 void RegisterInfoEmitter::runHeader(raw_ostream &OS) {
70 EmitSourceFileHeader("Register Information Header Fragment", OS);
71 CodeGenTarget Target(Records);
72 const std::string &TargetName = Target.getName();
73 std::string ClassName = TargetName + "GenRegisterInfo";
75 OS << "#include \"llvm/Target/TargetRegisterInfo.h\"\n";
76 OS << "#include <string>\n\n";
78 OS << "namespace llvm {\n\n";
80 OS << "struct " << ClassName << " : public TargetRegisterInfo {\n"
81 << " explicit " << ClassName
82 << "(int CallFrameSetupOpcode = -1, int CallFrameDestroyOpcode = -1);\n"
83 << " virtual int getDwarfRegNumFull(unsigned RegNum, "
84 << "unsigned Flavour) const;\n"
85 << " virtual int getLLVMRegNumFull(unsigned DwarfRegNum, "
86 << "unsigned Flavour) const;\n"
87 << " virtual int getDwarfRegNum(unsigned RegNum, bool isEH) const = 0;\n"
88 << " virtual bool needsStackRealignment(const MachineFunction &) const\n"
89 << " { return false; }\n"
90 << " unsigned getSubReg(unsigned RegNo, unsigned Index) const;\n"
91 << " unsigned getSubRegIndex(unsigned RegNo, unsigned SubRegNo) const;\n"
92 << " unsigned composeSubRegIndices(unsigned, unsigned) const;\n"
95 const std::vector<CodeGenRegisterClass> &RegisterClasses =
96 Target.getRegisterClasses();
98 if (!RegisterClasses.empty()) {
99 OS << "namespace " << RegisterClasses[0].Namespace
100 << " { // Register classes\n";
103 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i) {
105 OS << " " << RegisterClasses[i].getName() << "RegClassID";
110 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i) {
111 const std::string &Name = RegisterClasses[i].getName();
113 // Output the register class definition.
114 OS << " struct " << Name << "Class : public TargetRegisterClass {\n"
115 << " " << Name << "Class();\n"
116 << RegisterClasses[i].MethodProtos << " };\n";
118 // Output the extern for the instance.
119 OS << " extern " << Name << "Class\t" << Name << "RegClass;\n";
120 // Output the extern for the pointer to the instance (should remove).
121 OS << " static TargetRegisterClass * const "<< Name <<"RegisterClass = &"
122 << Name << "RegClass;\n";
124 OS << "} // end of namespace " << TargetName << "\n\n";
126 OS << "} // End llvm namespace \n";
129 typedef std::pair<unsigned, unsigned> UUPair;
130 typedef std::vector<UUPair> UUVector;
132 // Generate and print a quadratically probed hash table of unsigned pairs.
133 // The pair (0,0) is used as a sentinel, so it cannot be a data point.
134 static void generateHashTable(raw_ostream &OS, const char *Name,
135 const UUVector &Data) {
136 const UUPair Sentinel(0, 0);
137 unsigned HSize = Data.size();
140 // Hashtable size must be a power of two.
141 HSize = 2 * NextPowerOf2(2 * HSize);
142 HT.assign(HSize, Sentinel);
144 // Insert all entries.
145 unsigned MaxProbes = 0;
146 for (unsigned i = 0, e = Data.size(); i != e; ++i) {
148 unsigned Idx = (D.first + D.second * 37) & (HSize - 1);
149 unsigned ProbeAmt = 2;
150 while (HT[Idx] != Sentinel) {
151 Idx = (Idx + ProbeAmt) & (HSize - 1);
155 MaxProbes = std::max(MaxProbes, ProbeAmt/2);
158 // Print the hash table.
159 OS << "\n\n // Max number of probes: " << MaxProbes
160 << "\n // Used entries: " << Data.size()
161 << "\n const unsigned " << Name << "Size = " << HSize << ';'
162 << "\n const unsigned " << Name << "[] = {\n";
164 for (unsigned i = 0, e = HSize; i != e; ++i) {
166 OS << format(" %3u,%3u,", D.first, D.second);
167 if (i % 8 == 7 && i + 1 != e)
174 // RegisterInfoEmitter::run - Main register file description emitter.
176 void RegisterInfoEmitter::run(raw_ostream &OS) {
177 CodeGenTarget Target(Records);
178 CodeGenRegBank &RegBank = Target.getRegBank();
179 RegBank.computeDerivedInfo();
180 std::map<const CodeGenRegister*, CodeGenRegister::Set> Overlaps;
181 RegBank.computeOverlaps(Overlaps);
183 EmitSourceFileHeader("Register Information Source Fragment", OS);
185 OS << "namespace llvm {\n\n";
187 // Start out by emitting each of the register classes.
188 const std::vector<CodeGenRegisterClass> &RegisterClasses =
189 Target.getRegisterClasses();
191 // Collect all registers belonging to any allocatable class.
192 std::set<Record*> AllocatableRegs;
194 // Loop over all of the register classes... emitting each one.
195 OS << "namespace { // Register classes...\n";
197 // Emit the register enum value arrays for each RegisterClass
198 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
199 const CodeGenRegisterClass &RC = RegisterClasses[rc];
201 // Collect allocatable registers.
203 AllocatableRegs.insert(RC.Elements.begin(), RC.Elements.end());
205 // Give the register class a legal C name if it's anonymous.
206 std::string Name = RC.TheDef->getName();
208 // Emit the register list now.
209 OS << " // " << Name << " Register Class...\n"
210 << " static const unsigned " << Name
212 for (unsigned i = 0, e = RC.Elements.size(); i != e; ++i) {
213 Record *Reg = RC.Elements[i];
214 OS << getQualifiedName(Reg) << ", ";
219 // Emit the ValueType arrays for each RegisterClass
220 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
221 const CodeGenRegisterClass &RC = RegisterClasses[rc];
223 // Give the register class a legal C name if it's anonymous.
224 std::string Name = RC.TheDef->getName() + "VTs";
226 // Emit the register list now.
228 << " Register Class Value Types...\n"
229 << " static const EVT " << Name
231 for (unsigned i = 0, e = RC.VTs.size(); i != e; ++i)
232 OS << getEnumName(RC.VTs[i]) << ", ";
233 OS << "MVT::Other\n };\n\n";
235 OS << "} // end anonymous namespace\n\n";
237 // Now that all of the structs have been emitted, emit the instances.
238 if (!RegisterClasses.empty()) {
239 OS << "namespace " << RegisterClasses[0].Namespace
240 << " { // Register class instances\n";
241 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i)
242 OS << " " << RegisterClasses[i].getName() << "Class\t"
243 << RegisterClasses[i].getName() << "RegClass;\n";
245 std::map<unsigned, std::set<unsigned> > SuperClassMap;
246 std::map<unsigned, std::set<unsigned> > SuperRegClassMap;
249 unsigned NumSubRegIndices = RegBank.getSubRegIndices().size();
251 if (NumSubRegIndices) {
252 // Emit the sub-register classes for each RegisterClass
253 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
254 const CodeGenRegisterClass &RC = RegisterClasses[rc];
255 std::vector<Record*> SRC(NumSubRegIndices);
256 for (DenseMap<Record*,Record*>::const_iterator
257 i = RC.SubRegClasses.begin(),
258 e = RC.SubRegClasses.end(); i != e; ++i) {
260 unsigned idx = RegBank.getSubRegIndexNo(i->first);
261 SRC.at(idx-1) = i->second;
263 // Find the register class number of i->second for SuperRegClassMap.
264 for (unsigned rc2 = 0, e2 = RegisterClasses.size(); rc2 != e2; ++rc2) {
265 const CodeGenRegisterClass &RC2 = RegisterClasses[rc2];
266 if (RC2.TheDef == i->second) {
267 SuperRegClassMap[rc2].insert(rc);
273 // Give the register class a legal C name if it's anonymous.
274 std::string Name = RC.TheDef->getName();
277 << " Sub-register Classes...\n"
278 << " static const TargetRegisterClass* const "
279 << Name << "SubRegClasses[] = {\n ";
281 for (unsigned idx = 0; idx != NumSubRegIndices; ++idx) {
285 OS << "&" << getQualifiedName(SRC[idx]) << "RegClass";
292 // Emit the super-register classes for each RegisterClass
293 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
294 const CodeGenRegisterClass &RC = RegisterClasses[rc];
296 // Give the register class a legal C name if it's anonymous.
297 std::string Name = RC.TheDef->getName();
300 << " Super-register Classes...\n"
301 << " static const TargetRegisterClass* const "
302 << Name << "SuperRegClasses[] = {\n ";
305 std::map<unsigned, std::set<unsigned> >::iterator I =
306 SuperRegClassMap.find(rc);
307 if (I != SuperRegClassMap.end()) {
308 for (std::set<unsigned>::iterator II = I->second.begin(),
309 EE = I->second.end(); II != EE; ++II) {
310 const CodeGenRegisterClass &RC2 = RegisterClasses[*II];
313 OS << "&" << getQualifiedName(RC2.TheDef) << "RegClass";
318 OS << (!Empty ? ", " : "") << "NULL";
322 // No subregindices in this target
323 OS << " static const TargetRegisterClass* const "
324 << "NullRegClasses[] = { NULL };\n\n";
327 // Emit the sub-classes array for each RegisterClass
328 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
329 const CodeGenRegisterClass &RC = RegisterClasses[rc];
331 // Give the register class a legal C name if it's anonymous.
332 std::string Name = RC.TheDef->getName();
335 << " Register Class sub-classes...\n"
336 << " static const TargetRegisterClass* const "
337 << Name << "Subclasses[] = {\n ";
340 for (unsigned rc2 = 0, e2 = RegisterClasses.size(); rc2 != e2; ++rc2) {
341 const CodeGenRegisterClass &RC2 = RegisterClasses[rc2];
343 // Sub-classes are used to determine if a virtual register can be used
344 // as an instruction operand, or if it must be copied first.
345 if (rc == rc2 || !RC.hasSubClass(&RC2)) continue;
347 if (!Empty) OS << ", ";
348 OS << "&" << getQualifiedName(RC2.TheDef) << "RegClass";
351 std::map<unsigned, std::set<unsigned> >::iterator SCMI =
352 SuperClassMap.find(rc2);
353 if (SCMI == SuperClassMap.end()) {
354 SuperClassMap.insert(std::make_pair(rc2, std::set<unsigned>()));
355 SCMI = SuperClassMap.find(rc2);
357 SCMI->second.insert(rc);
360 OS << (!Empty ? ", " : "") << "NULL";
364 for (unsigned rc = 0, e = RegisterClasses.size(); rc != e; ++rc) {
365 const CodeGenRegisterClass &RC = RegisterClasses[rc];
367 // Give the register class a legal C name if it's anonymous.
368 std::string Name = RC.TheDef->getName();
371 << " Register Class super-classes...\n"
372 << " static const TargetRegisterClass* const "
373 << Name << "Superclasses[] = {\n ";
376 std::map<unsigned, std::set<unsigned> >::iterator I =
377 SuperClassMap.find(rc);
378 if (I != SuperClassMap.end()) {
379 for (std::set<unsigned>::iterator II = I->second.begin(),
380 EE = I->second.end(); II != EE; ++II) {
381 const CodeGenRegisterClass &RC2 = RegisterClasses[*II];
382 if (!Empty) OS << ", ";
383 OS << "&" << getQualifiedName(RC2.TheDef) << "RegClass";
388 OS << (!Empty ? ", " : "") << "NULL";
393 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i) {
394 const CodeGenRegisterClass &RC = RegisterClasses[i];
395 OS << RC.MethodBodies << "\n";
396 OS << RC.getName() << "Class::" << RC.getName()
397 << "Class() : TargetRegisterClass("
398 << RC.getName() + "RegClassID" << ", "
399 << '\"' << RC.getName() << "\", "
400 << RC.getName() + "VTs" << ", "
401 << RC.getName() + "Subclasses" << ", "
402 << RC.getName() + "Superclasses" << ", "
403 << (NumSubRegIndices ? RC.getName() + "Sub" : std::string("Null"))
405 << (NumSubRegIndices ? RC.getName() + "Super" : std::string("Null"))
407 << RC.SpillSize/8 << ", "
408 << RC.SpillAlignment/8 << ", "
409 << RC.CopyCost << ", "
410 << RC.Allocatable << ", "
411 << RC.getName() << ", " << RC.getName() << " + " << RC.Elements.size()
418 OS << "\nnamespace {\n";
419 OS << " const TargetRegisterClass* const RegisterClasses[] = {\n";
420 for (unsigned i = 0, e = RegisterClasses.size(); i != e; ++i)
421 OS << " &" << getQualifiedName(RegisterClasses[i].TheDef)
425 typedef std::map<Record*, std::vector<int64_t>, LessRecord> DwarfRegNumsMapTy;
426 DwarfRegNumsMapTy DwarfRegNums;
427 const std::vector<CodeGenRegister> &Regs = Target.getRegisters();
429 // Print the SubregHashTable, a simple quadratically probed
430 // hash table for determining if a register is a subregister
431 // of another register.
433 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
434 unsigned RegNo = Regs[i].EnumValue;
435 const CodeGenRegister::SuperRegList &SR = Regs[i].getSuperRegs();
436 for (CodeGenRegister::SuperRegList::const_iterator I = SR.begin(),
437 E = SR.end(); I != E; ++I)
438 HTData.push_back(UUPair((*I)->EnumValue, RegNo));
440 generateHashTable(OS, "SubregHashTable", HTData);
442 // Print the AliasHashTable, a simple quadratically probed
443 // hash table for determining if a register aliases another register.
445 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
446 unsigned RegNo = Regs[i].EnumValue;
447 const CodeGenRegister::Set &O = Overlaps[&Regs[i]];
448 for (CodeGenRegister::Set::const_iterator I = O.begin(), E = O.end();
451 HTData.push_back(UUPair(RegNo, (*I)->EnumValue));
453 generateHashTable(OS, "AliasesHashTable", HTData);
455 // Emit an overlap list for all registers.
456 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
457 const CodeGenRegister *Reg = &Regs[i];
458 const CodeGenRegister::Set &O = Overlaps[Reg];
459 // Move Reg to the front so TRI::getAliasSet can share the list.
460 OS << " const unsigned " << Reg->getName() << "_Overlaps[] = { "
461 << getQualifiedName(Reg->TheDef) << ", ";
462 for (CodeGenRegister::Set::const_iterator I = O.begin(), E = O.end();
465 OS << getQualifiedName((*I)->TheDef) << ", ";
469 // Emit the empty sub-registers list
470 OS << " const unsigned Empty_SubRegsSet[] = { 0 };\n";
471 // Loop over all of the registers which have sub-registers, emitting the
472 // sub-registers list to memory.
473 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
474 const CodeGenRegister &Reg = Regs[i];
475 if (Reg.getSubRegs().empty())
477 // getSubRegs() orders by SubRegIndex. We want a topological order.
478 SetVector<CodeGenRegister*> SR;
479 Reg.addSubRegsPreOrder(SR);
480 OS << " const unsigned " << Reg.getName() << "_SubRegsSet[] = { ";
481 for (unsigned j = 0, je = SR.size(); j != je; ++j)
482 OS << getQualifiedName(SR[j]->TheDef) << ", ";
486 // Emit the empty super-registers list
487 OS << " const unsigned Empty_SuperRegsSet[] = { 0 };\n";
488 // Loop over all of the registers which have super-registers, emitting the
489 // super-registers list to memory.
490 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
491 const CodeGenRegister &Reg = Regs[i];
492 const CodeGenRegister::SuperRegList &SR = Reg.getSuperRegs();
495 OS << " const unsigned " << Reg.getName() << "_SuperRegsSet[] = { ";
496 for (unsigned j = 0, je = SR.size(); j != je; ++j)
497 OS << getQualifiedName(SR[j]->TheDef) << ", ";
501 OS<<"\n const TargetRegisterDesc RegisterDescriptors[] = { // Descriptors\n";
502 OS << " { \"NOREG\",\t0,\t0,\t0,\t0,\t0 },\n";
504 // Now that register alias and sub-registers sets have been emitted, emit the
505 // register descriptors now.
506 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
507 const CodeGenRegister &Reg = Regs[i];
509 OS << Reg.getName() << "\",\t" << Reg.getName() << "_Overlaps,\t";
510 if (!Reg.getSubRegs().empty())
511 OS << Reg.getName() << "_SubRegsSet,\t";
513 OS << "Empty_SubRegsSet,\t";
514 if (!Reg.getSuperRegs().empty())
515 OS << Reg.getName() << "_SuperRegsSet,\t";
517 OS << "Empty_SuperRegsSet,\t";
518 OS << Reg.CostPerUse << ",\t"
519 << int(AllocatableRegs.count(Reg.TheDef)) << " },\n";
521 OS << " };\n"; // End of register descriptors...
523 // Calculate the mapping of subregister+index pairs to physical registers.
524 // This will also create further anonymous indexes.
525 unsigned NamedIndices = RegBank.getNumNamedIndices();
527 // Emit SubRegIndex names, skipping 0
528 const std::vector<Record*> &SubRegIndices = RegBank.getSubRegIndices();
529 OS << "\n const char *const SubRegIndexTable[] = { \"";
530 for (unsigned i = 0, e = SubRegIndices.size(); i != e; ++i) {
531 OS << SubRegIndices[i]->getName();
537 // Emit names of the anonymus subreg indexes.
538 if (SubRegIndices.size() > NamedIndices) {
540 for (unsigned i = NamedIndices, e = SubRegIndices.size(); i != e; ++i) {
541 OS << "\n " << SubRegIndices[i]->getName() << " = " << i+1;
547 OS << "}\n\n"; // End of anonymous namespace...
549 std::string ClassName = Target.getName() + "GenRegisterInfo";
551 // Emit the subregister + index mapping function based on the information
553 OS << "unsigned " << ClassName
554 << "::getSubReg(unsigned RegNo, unsigned Index) const {\n"
555 << " switch (RegNo) {\n"
556 << " default:\n return 0;\n";
557 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
558 const CodeGenRegister::SubRegMap &SRM = Regs[i].getSubRegs();
561 OS << " case " << getQualifiedName(Regs[i].TheDef) << ":\n";
562 OS << " switch (Index) {\n";
563 OS << " default: return 0;\n";
564 for (CodeGenRegister::SubRegMap::const_iterator ii = SRM.begin(),
565 ie = SRM.end(); ii != ie; ++ii)
566 OS << " case " << getQualifiedName(ii->first)
567 << ": return " << getQualifiedName(ii->second->TheDef) << ";\n";
568 OS << " };\n" << " break;\n";
571 OS << " return 0;\n";
574 OS << "unsigned " << ClassName
575 << "::getSubRegIndex(unsigned RegNo, unsigned SubRegNo) const {\n"
576 << " switch (RegNo) {\n"
577 << " default:\n return 0;\n";
578 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
579 const CodeGenRegister::SubRegMap &SRM = Regs[i].getSubRegs();
582 OS << " case " << getQualifiedName(Regs[i].TheDef) << ":\n";
583 for (CodeGenRegister::SubRegMap::const_iterator ii = SRM.begin(),
584 ie = SRM.end(); ii != ie; ++ii)
585 OS << " if (SubRegNo == " << getQualifiedName(ii->second->TheDef)
586 << ") return " << getQualifiedName(ii->first) << ";\n";
587 OS << " return 0;\n";
590 OS << " return 0;\n";
593 // Emit composeSubRegIndices
594 OS << "unsigned " << ClassName
595 << "::composeSubRegIndices(unsigned IdxA, unsigned IdxB) const {\n"
596 << " switch (IdxA) {\n"
597 << " default:\n return IdxB;\n";
598 for (unsigned i = 0, e = SubRegIndices.size(); i != e; ++i) {
600 for (unsigned j = 0; j != e; ++j) {
601 if (Record *Comp = RegBank.getCompositeSubRegIndex(SubRegIndices[i],
604 OS << " case " << getQualifiedName(SubRegIndices[i])
605 << ": switch(IdxB) {\n default: return IdxB;\n";
608 OS << " case " << getQualifiedName(SubRegIndices[j])
609 << ": return " << getQualifiedName(Comp) << ";\n";
617 // Emit the constructor of the class...
618 OS << ClassName << "::" << ClassName
619 << "(int CallFrameSetupOpcode, int CallFrameDestroyOpcode)\n"
620 << " : TargetRegisterInfo(RegisterDescriptors, " << Regs.size()+1
621 << ", RegisterClasses, RegisterClasses+" << RegisterClasses.size() <<",\n"
622 << " SubRegIndexTable,\n"
623 << " CallFrameSetupOpcode, CallFrameDestroyOpcode,\n"
624 << " SubregHashTable, SubregHashTableSize,\n"
625 << " AliasesHashTable, AliasesHashTableSize) {\n"
628 // Collect all information about dwarf register numbers
630 // First, just pull all provided information to the map
631 unsigned maxLength = 0;
632 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
633 Record *Reg = Regs[i].TheDef;
634 std::vector<int64_t> RegNums = Reg->getValueAsListOfInts("DwarfNumbers");
635 maxLength = std::max((size_t)maxLength, RegNums.size());
636 if (DwarfRegNums.count(Reg))
637 errs() << "Warning: DWARF numbers for register " << getQualifiedName(Reg)
638 << "specified multiple times\n";
639 DwarfRegNums[Reg] = RegNums;
642 // Now we know maximal length of number list. Append -1's, where needed
643 for (DwarfRegNumsMapTy::iterator
644 I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I)
645 for (unsigned i = I->second.size(), e = maxLength; i != e; ++i)
646 I->second.push_back(-1);
648 // Emit reverse information about the dwarf register numbers.
649 OS << "int " << ClassName << "::getLLVMRegNumFull(unsigned DwarfRegNum, "
650 << "unsigned Flavour) const {\n"
651 << " switch (Flavour) {\n"
653 << " assert(0 && \"Unknown DWARF flavour\");\n"
656 for (unsigned i = 0, e = maxLength; i != e; ++i) {
657 OS << " case " << i << ":\n"
658 << " switch (DwarfRegNum) {\n"
660 << " assert(0 && \"Invalid DwarfRegNum\");\n"
663 for (DwarfRegNumsMapTy::iterator
664 I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I) {
665 int DwarfRegNo = I->second[i];
667 OS << " case " << DwarfRegNo << ":\n"
668 << " return " << getQualifiedName(I->first) << ";\n";
675 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
676 Record *Reg = Regs[i].TheDef;
677 const RecordVal *V = Reg->getValue("DwarfAlias");
678 if (!V || !V->getValue())
681 DefInit *DI = dynamic_cast<DefInit*>(V->getValue());
682 Record *Alias = DI->getDef();
683 DwarfRegNums[Reg] = DwarfRegNums[Alias];
686 // Emit information about the dwarf register numbers.
687 OS << "int " << ClassName << "::getDwarfRegNumFull(unsigned RegNum, "
688 << "unsigned Flavour) const {\n"
689 << " switch (Flavour) {\n"
691 << " assert(0 && \"Unknown DWARF flavour\");\n"
694 for (unsigned i = 0, e = maxLength; i != e; ++i) {
695 OS << " case " << i << ":\n"
696 << " switch (RegNum) {\n"
698 << " assert(0 && \"Invalid RegNum\");\n"
701 // Sort by name to get a stable order.
704 for (DwarfRegNumsMapTy::iterator
705 I = DwarfRegNums.begin(), E = DwarfRegNums.end(); I != E; ++I) {
706 int RegNo = I->second[i];
707 OS << " case " << getQualifiedName(I->first) << ":\n"
708 << " return " << RegNo << ";\n";
715 OS << "} // End llvm namespace \n";