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