maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

TableGen'd regpressure: register unit set pruning. 

The pruning is more complete if it is not done incrementally. The code
is also a tad less convluted.

llvm-svn: 154510
This commit is contained in:
Andrew Trick 2012-04-11 17:35:26 +00:00
parent cd42f9446b
commit a5eee987e0
1 changed files with 14 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
llvm/utils/TableGen/CodeGenRegisters.cpp
View File

@ -1167,8 +1167,7 @@ void CodeGenRegBank::pruneUnitSets() {
assert(RegClassUnitSets.empty() && "this invalidates RegClassUnitSets"); assert(RegClassUnitSets.empty() && "this invalidates RegClassUnitSets");
// Form an equivalence class of UnitSets with no significant difference. // Form an equivalence class of UnitSets with no significant difference.
// Populate PrunedUnitSets with each equivalence class's superset. std::vector<unsigned> SuperSetIDs;
std::vector<RegUnitSet> PrunedUnitSets;
for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size(); for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size();
SubIdx != EndIdx; ++SubIdx) { SubIdx != EndIdx; ++SubIdx) {
const RegUnitSet &SubSet = RegUnitSets[SubIdx]; const RegUnitSet &SubSet = RegUnitSets[SubIdx];
@ -1176,25 +1175,22 @@ void CodeGenRegBank::pruneUnitSets() {
for (; SuperIdx != EndIdx; ++SuperIdx) { for (; SuperIdx != EndIdx; ++SuperIdx) {
if (SuperIdx == SubIdx) if (SuperIdx == SubIdx)
continue; continue;
const RegUnitSet *SuperSet = 0;
if (SuperIdx > SubIdx) const RegUnitSet &SuperSet = RegUnitSets[SuperIdx];
SuperSet = &RegUnitSets[SuperIdx]; if (isRegUnitSubSet(SubSet.Units, SuperSet.Units)
else { && (SubSet.Units.size() + 3 > SuperSet.Units.size())) {
// Compare with already-pruned sets.
if (SuperIdx >= PrunedUnitSets.size())
continue;
SuperSet = &PrunedUnitSets[SuperIdx];
}
if (isRegUnitSubSet(SubSet.Units, SuperSet->Units)
&& (SubSet.Units.size() + 3 > SuperSet->Units.size())) {
break; break;
} }
} }
if (SuperIdx != EndIdx) if (SuperIdx == EndIdx)
continue; SuperSetIDs.push_back(SubIdx);
PrunedUnitSets.resize(PrunedUnitSets.size()+1); }
PrunedUnitSets.back().Name = RegUnitSets[SubIdx].Name; // Populate PrunedUnitSets with each equivalence class's superset.
PrunedUnitSets.back().Units.swap(RegUnitSets[SubIdx].Units); std::vector<RegUnitSet> PrunedUnitSets(SuperSetIDs.size());
for (unsigned i = 0, e = SuperSetIDs.size(); i != e; ++i) {
unsigned SuperIdx = SuperSetIDs[i];
PrunedUnitSets[i].Name = RegUnitSets[SuperIdx].Name;
PrunedUnitSets[i].Units.swap(RegUnitSets[SuperIdx].Units);
} }
RegUnitSets.swap(PrunedUnitSets); RegUnitSets.swap(PrunedUnitSets);
} }