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