@@ -1954,11 +1954,12 @@ void CodeGenRegBank::pruneUnitSets() {
1954
1954
SuperSetIDs.push_back (SubIdx);
1955
1955
}
1956
1956
// Populate PrunedUnitSets with each equivalence class's superset.
1957
- std::vector<RegUnitSet> PrunedUnitSets (SuperSetIDs.size ());
1957
+ std::vector<RegUnitSet> PrunedUnitSets;
1958
+ PrunedUnitSets.reserve (SuperSetIDs.size ());
1958
1959
for (unsigned i = 0 , e = SuperSetIDs.size (); i != e; ++i) {
1959
1960
unsigned SuperIdx = SuperSetIDs[i];
1960
- PrunedUnitSets[i]. Name = RegUnitSets[SuperIdx].Name ;
1961
- PrunedUnitSets[i] .Units = std::move (RegUnitSets[SuperIdx].Units );
1961
+ PrunedUnitSets. emplace_back ( RegUnitSets[SuperIdx].Name ) ;
1962
+ PrunedUnitSets. back () .Units = std::move (RegUnitSets[SuperIdx].Units );
1962
1963
}
1963
1964
RegUnitSets = std::move (PrunedUnitSets);
1964
1965
}
@@ -1980,8 +1981,7 @@ void CodeGenRegBank::computeRegUnitSets() {
1980
1981
continue ;
1981
1982
1982
1983
// Compute a sorted list of units in this class.
1983
- RegUnitSet RUSet;
1984
- RUSet.Name = RC.getName ();
1984
+ RegUnitSet RUSet (RC.getName ());
1985
1985
RC.buildRegUnitSet (*this , RUSet.Units );
1986
1986
1987
1987
// Find an existing RegUnitSet.
@@ -2032,9 +2032,8 @@ void CodeGenRegBank::computeRegUnitSets() {
2032
2032
if (Intersection.empty ())
2033
2033
continue ;
2034
2034
2035
- RegUnitSet RUSet;
2036
- RUSet.Name =
2037
- RegUnitSets[Idx].Name + " _with_" + RegUnitSets[SearchIdx].Name ;
2035
+ RegUnitSet RUSet (RegUnitSets[Idx].Name + " _with_" +
2036
+ RegUnitSets[SearchIdx].Name );
2038
2037
std::set_union (RegUnitSets[Idx].Units .begin (),
2039
2038
RegUnitSets[Idx].Units .end (),
2040
2039
RegUnitSets[SearchIdx].Units .begin (),
0 commit comments