1850   for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size();  in pruneUnitSets()
1852     const RegUnitSet &SubSet = RegUnitSets[SubIdx];  in pruneUnitSets()
1859       const RegUnitSet &SuperSet = RegUnitSets[SuperIdx];  in pruneUnitSets()
1870         if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size())  in pruneUnitSets()
1871           RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name;  in pruneUnitSets()
1882     PrunedUnitSets[i].Name = RegUnitSets[SuperIdx].Name;  in pruneUnitSets()
1883     PrunedUnitSets[i].Units.swap(RegUnitSets[SuperIdx].Units);  in pruneUnitSets()
1885   RegUnitSets.swap(PrunedUnitSets);  in pruneUnitSets()
1896   assert(RegUnitSets.empty() && "dirty RegUnitSets");  in computeRegUnitSets()
1905     RegUnitSets.resize(RegUnitSets.size() + 1);  in computeRegUnitSets()
1906     RegUnitSets.back().Name = RC.getName();  in computeRegUnitSets()
1909     RC.buildRegUnitSet(*this, RegUnitSets.back().Units);  in computeRegUnitSets()
1913       findRegUnitSet(RegUnitSets, RegUnitSets.back());  in computeRegUnitSets()
1914     if (SetI != std::prev(RegUnitSets.end()))  in computeRegUnitSets()
1915       RegUnitSets.pop_back();  in computeRegUnitSets()
1919                                                    USEnd = RegUnitSets.size();  in computeRegUnitSets()
1921     dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1922     for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1931                                                  USEnd = RegUnitSets.size();  in computeRegUnitSets()
1933     dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1934     for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1940   unsigned NumRegUnitSubSets = RegUnitSets.size();  in computeRegUnitSets()
1941   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {  in computeRegUnitSets()
1951       std::set_intersection(RegUnitSets[Idx].Units.begin(),  in computeRegUnitSets()
1952                             RegUnitSets[Idx].Units.end(),  in computeRegUnitSets()
1953                             RegUnitSets[SearchIdx].Units.begin(),  in computeRegUnitSets()
1954                             RegUnitSets[SearchIdx].Units.end(),  in computeRegUnitSets()
1960       RegUnitSets.resize(RegUnitSets.size() + 1);  in computeRegUnitSets()
1961       RegUnitSets.back().Name =  in computeRegUnitSets()
1962         RegUnitSets[Idx].Name + "_with_" + RegUnitSets[SearchIdx].Name;  in computeRegUnitSets()
1964       std::set_union(RegUnitSets[Idx].Units.begin(),  in computeRegUnitSets()
1965                      RegUnitSets[Idx].Units.end(),  in computeRegUnitSets()
1966                      RegUnitSets[SearchIdx].Units.begin(),  in computeRegUnitSets()
1967                      RegUnitSets[SearchIdx].Units.end(),  in computeRegUnitSets()
1968                      std::inserter(RegUnitSets.back().Units,  in computeRegUnitSets()
1969                                    RegUnitSets.back().Units.begin()));  in computeRegUnitSets()
1973         findRegUnitSet(RegUnitSets, RegUnitSets.back());  in computeRegUnitSets()
1974       if (SetI != std::prev(RegUnitSets.end()))  in computeRegUnitSets()
1975         RegUnitSets.pop_back();  in computeRegUnitSets()
1977         LLVM_DEBUG(dbgs() << "UnitSet " << RegUnitSets.size() - 1 << " "  in computeRegUnitSets()
1978                           << RegUnitSets.back().Name << ":";  in computeRegUnitSets()
1980                         : RegUnitSets.back().Units) printRegUnitName(U);  in computeRegUnitSets()
1990       dbgs() << "\n"; for (unsigned USIdx = 0, USEnd = RegUnitSets.size();  in computeRegUnitSets()
1992         dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1993         for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
2020     for (unsigned USIdx = 0, USEnd = RegUnitSets.size();  in computeRegUnitSets()
2022       if (isRegUnitSubSet(RCRegUnits, RegUnitSets[USIdx].Units)) {  in computeRegUnitSets()
2038     for (unsigned i = 0, e = RegUnitSets.size(); i != e; ++i) {  in computeRegUnitSets()
2039       RegUnitSet &RUSet = RegUnitSets[i];  in computeRegUnitSets()
2124   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)  in computeDerivedInfo()
2125     RegUnitSets[Idx].Weight = getRegUnitSetWeight(RegUnitSets[Idx].Units);  in computeDerivedInfo()
2128   RegUnitSetOrder.reserve(RegUnitSets.size());  in computeDerivedInfo()
2129   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)  in computeDerivedInfo()
2136   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {  in computeDerivedInfo()
2137     RegUnitSets[RegUnitSetOrder[Idx]].Order = Idx;  in computeDerivedInfo()