1892   for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size();  in pruneUnitSets()
1894     const RegUnitSet &SubSet = RegUnitSets[SubIdx];  in pruneUnitSets()
1901       const RegUnitSet &SuperSet = RegUnitSets[SuperIdx];  in pruneUnitSets()
1912         if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size())  in pruneUnitSets()
1913           RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name;  in pruneUnitSets()
1924     PrunedUnitSets[i].Name = RegUnitSets[SuperIdx].Name;  in pruneUnitSets()
1925     PrunedUnitSets[i].Units.swap(RegUnitSets[SuperIdx].Units);  in pruneUnitSets()
1927   RegUnitSets.swap(PrunedUnitSets);  in pruneUnitSets()
1938   assert(RegUnitSets.empty() && "dirty RegUnitSets");  in computeRegUnitSets()
1947     RegUnitSets.resize(RegUnitSets.size() + 1);  in computeRegUnitSets()
1948     RegUnitSets.back().Name = RC.getName();  in computeRegUnitSets()
1951     RC.buildRegUnitSet(*this, RegUnitSets.back().Units);  in computeRegUnitSets()
1955       findRegUnitSet(RegUnitSets, RegUnitSets.back());  in computeRegUnitSets()
1956     if (SetI != std::prev(RegUnitSets.end()))  in computeRegUnitSets()
1957       RegUnitSets.pop_back();  in computeRegUnitSets()
1960   if (RegUnitSets.empty())  in computeRegUnitSets()
1964                                                    USEnd = RegUnitSets.size();  in computeRegUnitSets()
1966     dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1967     for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1976                                                  USEnd = RegUnitSets.size();  in computeRegUnitSets()
1978     dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1979     for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1985   unsigned NumRegUnitSubSets = RegUnitSets.size();  in computeRegUnitSets()
1986   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {  in computeRegUnitSets()
1996       std::set_intersection(RegUnitSets[Idx].Units.begin(),  in computeRegUnitSets()
1997                             RegUnitSets[Idx].Units.end(),  in computeRegUnitSets()
1998                             RegUnitSets[SearchIdx].Units.begin(),  in computeRegUnitSets()
1999                             RegUnitSets[SearchIdx].Units.end(),  in computeRegUnitSets()
2005       RegUnitSets.resize(RegUnitSets.size() + 1);  in computeRegUnitSets()
2006       RegUnitSets.back().Name =  in computeRegUnitSets()
2007         RegUnitSets[Idx].Name + "_with_" + RegUnitSets[SearchIdx].Name;  in computeRegUnitSets()
2009       std::set_union(RegUnitSets[Idx].Units.begin(),  in computeRegUnitSets()
2010                      RegUnitSets[Idx].Units.end(),  in computeRegUnitSets()
2011                      RegUnitSets[SearchIdx].Units.begin(),  in computeRegUnitSets()
2012                      RegUnitSets[SearchIdx].Units.end(),  in computeRegUnitSets()
2013                      std::inserter(RegUnitSets.back().Units,  in computeRegUnitSets()
2014                                    RegUnitSets.back().Units.begin()));  in computeRegUnitSets()
2018         findRegUnitSet(RegUnitSets, RegUnitSets.back());  in computeRegUnitSets()
2019       if (SetI != std::prev(RegUnitSets.end()))  in computeRegUnitSets()
2020         RegUnitSets.pop_back();  in computeRegUnitSets()
2022         LLVM_DEBUG(dbgs() << "UnitSet " << RegUnitSets.size() - 1 << " "  in computeRegUnitSets()
2023                           << RegUnitSets.back().Name << ":";  in computeRegUnitSets()
2025                         : RegUnitSets.back().Units) printRegUnitName(U);  in computeRegUnitSets()
2035       dbgs() << "\n"; for (unsigned USIdx = 0, USEnd = RegUnitSets.size();  in computeRegUnitSets()
2037         dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
2038         for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
2065     for (unsigned USIdx = 0, USEnd = RegUnitSets.size();  in computeRegUnitSets()
2067       if (isRegUnitSubSet(RCRegUnits, RegUnitSets[USIdx].Units)) {  in computeRegUnitSets()
2084     for (unsigned i = 0, e = RegUnitSets.size(); i != e; ++i) {  in computeRegUnitSets()
2085       RegUnitSet &RUSet = RegUnitSets[i];  in computeRegUnitSets()
2169   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)  in computeDerivedInfo()
2170     RegUnitSets[Idx].Weight = getRegUnitSetWeight(RegUnitSets[Idx].Units);  in computeDerivedInfo()
2173   RegUnitSetOrder.reserve(RegUnitSets.size());  in computeDerivedInfo()
2174   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)  in computeDerivedInfo()
2181   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {  in computeDerivedInfo()
2182     RegUnitSets[RegUnitSetOrder[Idx]].Order = Idx;  in computeDerivedInfo()