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