RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 11:13:28 +01:00
Code Issues Projects Releases Wiki Activity

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

Browse Source 
- 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).

llvm-svn: 151773
This commit is contained in:
Benjamin Kramer 2012-02-29 23:46:50 +00:00
parent 46c639cf8a
commit 16bdd01e87
1 changed files with 6 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
utils/TableGen/RegisterInfoEmitter.cpp
View File

@ -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";