1822   for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size();  in pruneUnitSets()
1824     const RegUnitSet &SubSet = RegUnitSets[SubIdx];  in pruneUnitSets()
1831       const RegUnitSet &SuperSet = RegUnitSets[SuperIdx];  in pruneUnitSets()
1842         if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size())  in pruneUnitSets()
1843           RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name;  in pruneUnitSets()
1854     PrunedUnitSets[i].Name = RegUnitSets[SuperIdx].Name;  in pruneUnitSets()
1855     PrunedUnitSets[i].Units.swap(RegUnitSets[SuperIdx].Units);  in pruneUnitSets()
1857   RegUnitSets.swap(PrunedUnitSets);  in pruneUnitSets()
1868   assert(RegUnitSets.empty() && "dirty RegUnitSets");  in computeRegUnitSets()
1877     RegUnitSets.resize(RegUnitSets.size() + 1);  in computeRegUnitSets()
1878     RegUnitSets.back().Name = RC.getName();  in computeRegUnitSets()
1881     RC.buildRegUnitSet(*this, RegUnitSets.back().Units);  in computeRegUnitSets()
1885       findRegUnitSet(RegUnitSets, RegUnitSets.back());  in computeRegUnitSets()
1886     if (SetI != std::prev(RegUnitSets.end()))  in computeRegUnitSets()
1887       RegUnitSets.pop_back();  in computeRegUnitSets()
1891                                                    USEnd = RegUnitSets.size();  in computeRegUnitSets()
1893     dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1894     for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1903                                                  USEnd = RegUnitSets.size();  in computeRegUnitSets()
1905     dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1906     for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1912   unsigned NumRegUnitSubSets = RegUnitSets.size();  in computeRegUnitSets()
1913   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {  in computeRegUnitSets()
1923       std::set_intersection(RegUnitSets[Idx].Units.begin(),  in computeRegUnitSets()
1924                             RegUnitSets[Idx].Units.end(),  in computeRegUnitSets()
1925                             RegUnitSets[SearchIdx].Units.begin(),  in computeRegUnitSets()
1926                             RegUnitSets[SearchIdx].Units.end(),  in computeRegUnitSets()
1932       RegUnitSets.resize(RegUnitSets.size() + 1);  in computeRegUnitSets()
1933       RegUnitSets.back().Name =  in computeRegUnitSets()
1934         RegUnitSets[Idx].Name + "+" + RegUnitSets[SearchIdx].Name;  in computeRegUnitSets()
1936       std::set_union(RegUnitSets[Idx].Units.begin(),  in computeRegUnitSets()
1937                      RegUnitSets[Idx].Units.end(),  in computeRegUnitSets()
1938                      RegUnitSets[SearchIdx].Units.begin(),  in computeRegUnitSets()
1939                      RegUnitSets[SearchIdx].Units.end(),  in computeRegUnitSets()
1940                      std::inserter(RegUnitSets.back().Units,  in computeRegUnitSets()
1941                                    RegUnitSets.back().Units.begin()));  in computeRegUnitSets()
1945         findRegUnitSet(RegUnitSets, RegUnitSets.back());  in computeRegUnitSets()
1946       if (SetI != std::prev(RegUnitSets.end()))  in computeRegUnitSets()
1947         RegUnitSets.pop_back();  in computeRegUnitSets()
1949         LLVM_DEBUG(dbgs() << "UnitSet " << RegUnitSets.size() - 1 << " "  in computeRegUnitSets()
1950                           << RegUnitSets.back().Name << ":";  in computeRegUnitSets()
1952                         : RegUnitSets.back().Units) printRegUnitName(U);  in computeRegUnitSets()
1962       dbgs() << "\n"; for (unsigned USIdx = 0, USEnd = RegUnitSets.size();  in computeRegUnitSets()
1964         dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";  in computeRegUnitSets()
1965         for (auto &U : RegUnitSets[USIdx].Units)  in computeRegUnitSets()
1992     for (unsigned USIdx = 0, USEnd = RegUnitSets.size();  in computeRegUnitSets()
1994       if (isRegUnitSubSet(RCRegUnits, RegUnitSets[USIdx].Units)) {  in computeRegUnitSets()
2010     for (unsigned i = 0, e = RegUnitSets.size(); i != e; ++i) {  in computeRegUnitSets()
2011       RegUnitSet &RUSet = RegUnitSets[i];  in computeRegUnitSets()
2096   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)  in computeDerivedInfo()
2097     RegUnitSets[Idx].Weight = getRegUnitSetWeight(RegUnitSets[Idx].Units);  in computeDerivedInfo()
2100   RegUnitSetOrder.reserve(RegUnitSets.size());  in computeDerivedInfo()
2101   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)  in computeDerivedInfo()
2109   for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {  in computeDerivedInfo()
2110     RegUnitSets[RegUnitSetOrder[Idx]].Order = Idx;  in computeDerivedInfo()