1843   for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size();  in pruneUnitSets()
1845     const RegUnitSet &SubSet = RegUnitSets[SubIdx];  in pruneUnitSets()
1852       const RegUnitSet &SuperSet = RegUnitSets[SuperIdx];  in pruneUnitSets()
1863         if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size())  in pruneUnitSets()
1864           RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name;  in pruneUnitSets()
1875     PrunedUnitSets[i].Name = RegUnitSets[SuperIdx].Name;  in pruneUnitSets()
1876     PrunedUnitSets[i].Units.swap(RegUnitSets[SuperIdx].Units);  in pruneUnitSets()
1878   RegUnitSets.swap(PrunedUnitSets);  in pruneUnitSets()
1889   assert(RegUnitSets.empty() && "dirty RegUnitSets");  in computeRegUnitSets()
1898     RegUnitSets.resize(RegUnitSets.size() + 1);  in computeRegUnitSets()
1899     RegUnitSets.back().Name = RC.getName();  in computeRegUnitSets()
1902     RC.buildRegUnitSet(*this, RegUnitSets.back().Units);  in computeRegUnitSets()
1906       findRegUnitSet(RegUnitSets, RegUnitSets.back());  in computeRegUnitSets()
1907     if (SetI != std::prev(RegUnitSets.end()))  in computeRegUnitSets()
1908       RegUnitSets.pop_back();  in computeRegUnitSets()
1912                                                    USEnd = RegUnitSets.size();  in computeRegUnitSets()
1914     dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1915     for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1924                                                  USEnd = RegUnitSets.size();  in computeRegUnitSets()
1926     dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1927     for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1933   unsigned NumRegUnitSubSets = RegUnitSets.size();  in computeRegUnitSets()
1934   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {  in computeRegUnitSets()
1944       std::set_intersection(RegUnitSets[Idx].Units.begin(),  in computeRegUnitSets()
1945                             RegUnitSets[Idx].Units.end(),  in computeRegUnitSets()
1946                             RegUnitSets[SearchIdx].Units.begin(),  in computeRegUnitSets()
1947                             RegUnitSets[SearchIdx].Units.end(),  in computeRegUnitSets()
1953       RegUnitSets.resize(RegUnitSets.size() + 1);  in computeRegUnitSets()
1954       RegUnitSets.back().Name =  in computeRegUnitSets()
1955         RegUnitSets[Idx].Name + "_with_" + RegUnitSets[SearchIdx].Name;  in computeRegUnitSets()
1957       std::set_union(RegUnitSets[Idx].Units.begin(),  in computeRegUnitSets()
1958                      RegUnitSets[Idx].Units.end(),  in computeRegUnitSets()
1959                      RegUnitSets[SearchIdx].Units.begin(),  in computeRegUnitSets()
1960                      RegUnitSets[SearchIdx].Units.end(),  in computeRegUnitSets()
1961                      std::inserter(RegUnitSets.back().Units,  in computeRegUnitSets()
1962                                    RegUnitSets.back().Units.begin()));  in computeRegUnitSets()
1966         findRegUnitSet(RegUnitSets, RegUnitSets.back());  in computeRegUnitSets()
1967       if (SetI != std::prev(RegUnitSets.end()))  in computeRegUnitSets()
1968         RegUnitSets.pop_back();  in computeRegUnitSets()
1970         LLVM_DEBUG(dbgs() << "UnitSet " << RegUnitSets.size() - 1 << " "  in computeRegUnitSets()
1971                           << RegUnitSets.back().Name << ":";  in computeRegUnitSets()
1973                         : RegUnitSets.back().Units) printRegUnitName(U);  in computeRegUnitSets()
1983       dbgs() << "\n"; for (unsigned USIdx = 0, USEnd = RegUnitSets.size();  in computeRegUnitSets()
1985         dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1986         for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
2013     for (unsigned USIdx = 0, USEnd = RegUnitSets.size();  in computeRegUnitSets()
2015       if (isRegUnitSubSet(RCRegUnits, RegUnitSets[USIdx].Units)) {  in computeRegUnitSets()
2031     for (unsigned i = 0, e = RegUnitSets.size(); i != e; ++i) {  in computeRegUnitSets()
2032       RegUnitSet &RUSet = RegUnitSets[i];  in computeRegUnitSets()
2116   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)  in computeDerivedInfo()
2117     RegUnitSets[Idx].Weight = getRegUnitSetWeight(RegUnitSets[Idx].Units);  in computeDerivedInfo()
2120   RegUnitSetOrder.reserve(RegUnitSets.size());  in computeDerivedInfo()
2121   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)  in computeDerivedInfo()
2128   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {  in computeDerivedInfo()
2129     RegUnitSets[RegUnitSetOrder[Idx]].Order = Idx;  in computeDerivedInfo()