Implement getSubRegIndex as a linear search on the SubRegTable instead of using a...

- The search bounds are constant, in the worst case (ARM target) it will scan over 30 uint16_ts.
- This method isn't very hot, I had problems finding a testcase where it's called more than a dozen of times (no perf impact).

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@151773 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/utils/TableGen/RegisterInfoEmitter.cpp b/utils/TableGen/RegisterInfoEmitter.cpp
index 899f5523e21ad15fe63af8912471c2b93f419da2..5528777a232396a79e42aa46dbe3d26f61a1a22f 100644 (file)
--- a/utils/TableGen/RegisterInfoEmitter.cpp
+++ b/utils/TableGen/RegisterInfoEmitter.cpp
@@ -774,21 +774,13 @@ RegisterInfoEmitter::runTargetDesc(raw_ostream &OS, CodeGenTarget &Target,
     OS << "  return 0;\n}\n\n";
 
   OS << "unsigned " << ClassName
-     << "::getSubRegIndex(unsigned RegNo, unsigned SubRegNo) const {\n"
-     << "  switch (RegNo) {\n"
-     << "  default:\n    return 0;\n";
-   for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
-     const CodeGenRegister::SubRegMap &SRM = Regs[i]->getSubRegs();
-     if (SRM.empty())
-       continue;
-    OS << "  case " << getQualifiedName(Regs[i]->TheDef) << ":\n";
-    for (CodeGenRegister::SubRegMap::const_iterator ii = SRM.begin(),
-         ie = SRM.end(); ii != ie; ++ii)
-      OS << "    if (SubRegNo == " << getQualifiedName(ii->second->TheDef)
-         << ")  return " << ii->first->getQualifiedName() << ";\n";
-    OS << "    return 0;\n";
+     << "::getSubRegIndex(unsigned RegNo, unsigned SubRegNo) const {\n";
+  if (SubRegIndices.size()) {
+    OS << "  for (unsigned I = 0; I != array_lengthof("
+       << TargetName << "SubRegTable[0]); ++I)\n"
+       << "    if (" << TargetName << "SubRegTable[RegNo - 1][I] == SubRegNo)\n"
+       << "      return I + 1;\n";
   }
-  OS << "  };\n";
   OS << "  return 0;\n";
   OS << "}\n\n";