Lines Matching refs:RegUnitSets
1928 for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size(); in pruneUnitSets()
1930 const RegUnitSet &SubSet = RegUnitSets[SubIdx]; in pruneUnitSets()
1937 const RegUnitSet &SuperSet = RegUnitSets[SuperIdx]; in pruneUnitSets()
1948 if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size()) in pruneUnitSets()
1949 RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name; in pruneUnitSets()
1960 PrunedUnitSets[i].Name = RegUnitSets[SuperIdx].Name; in pruneUnitSets()
1961 PrunedUnitSets[i].Units.swap(RegUnitSets[SuperIdx].Units); in pruneUnitSets()
1963 RegUnitSets.swap(PrunedUnitSets); in pruneUnitSets()
1974 assert(RegUnitSets.empty() && "dirty RegUnitSets"); in computeRegUnitSets()
1983 RegUnitSets.resize(RegUnitSets.size() + 1); in computeRegUnitSets()
1984 RegUnitSets.back().Name = RC.getName(); in computeRegUnitSets()
1987 RC.buildRegUnitSet(*this, RegUnitSets.back().Units); in computeRegUnitSets()
1991 findRegUnitSet(RegUnitSets, RegUnitSets.back()); in computeRegUnitSets()
1992 if (SetI != std::prev(RegUnitSets.end())) in computeRegUnitSets()
1993 RegUnitSets.pop_back(); in computeRegUnitSets()
1996 if (RegUnitSets.empty()) in computeRegUnitSets()
2000 USEnd = RegUnitSets.size(); in computeRegUnitSets()
2002 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":"; in computeRegUnitSets()
2003 for (auto &U : RegUnitSets[USIdx].Units) in computeRegUnitSets()
2012 USEnd = RegUnitSets.size(); in computeRegUnitSets()
2014 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":"; in computeRegUnitSets()
2015 for (auto &U : RegUnitSets[USIdx].Units) in computeRegUnitSets()
2021 unsigned NumRegUnitSubSets = RegUnitSets.size(); in computeRegUnitSets()
2022 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { in computeRegUnitSets()
2032 std::set_intersection(RegUnitSets[Idx].Units.begin(), in computeRegUnitSets()
2033 RegUnitSets[Idx].Units.end(), in computeRegUnitSets()
2034 RegUnitSets[SearchIdx].Units.begin(), in computeRegUnitSets()
2035 RegUnitSets[SearchIdx].Units.end(), in computeRegUnitSets()
2041 RegUnitSets.resize(RegUnitSets.size() + 1); in computeRegUnitSets()
2042 RegUnitSets.back().Name = in computeRegUnitSets()
2043 RegUnitSets[Idx].Name + "_with_" + RegUnitSets[SearchIdx].Name; in computeRegUnitSets()
2045 std::set_union(RegUnitSets[Idx].Units.begin(), in computeRegUnitSets()
2046 RegUnitSets[Idx].Units.end(), in computeRegUnitSets()
2047 RegUnitSets[SearchIdx].Units.begin(), in computeRegUnitSets()
2048 RegUnitSets[SearchIdx].Units.end(), in computeRegUnitSets()
2049 std::inserter(RegUnitSets.back().Units, in computeRegUnitSets()
2050 RegUnitSets.back().Units.begin())); in computeRegUnitSets()
2054 findRegUnitSet(RegUnitSets, RegUnitSets.back()); in computeRegUnitSets()
2055 if (SetI != std::prev(RegUnitSets.end())) in computeRegUnitSets()
2056 RegUnitSets.pop_back(); in computeRegUnitSets()
2058 LLVM_DEBUG(dbgs() << "UnitSet " << RegUnitSets.size() - 1 << " " in computeRegUnitSets()
2059 << RegUnitSets.back().Name << ":"; in computeRegUnitSets()
2061 : RegUnitSets.back().Units) printRegUnitName(U); in computeRegUnitSets()
2071 dbgs() << "\n"; for (unsigned USIdx = 0, USEnd = RegUnitSets.size(); in computeRegUnitSets()
2073 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":"; in computeRegUnitSets()
2074 for (auto &U : RegUnitSets[USIdx].Units) in computeRegUnitSets()
2101 for (unsigned USIdx = 0, USEnd = RegUnitSets.size(); in computeRegUnitSets()
2103 if (isRegUnitSubSet(RCRegUnits, RegUnitSets[USIdx].Units)) { in computeRegUnitSets()
2120 for (unsigned i = 0, e = RegUnitSets.size(); i != e; ++i) { in computeRegUnitSets()
2121 RegUnitSet &RUSet = RegUnitSets[i]; in computeRegUnitSets()
2205 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) in computeDerivedInfo()
2206 RegUnitSets[Idx].Weight = getRegUnitSetWeight(RegUnitSets[Idx].Units); in computeDerivedInfo()
2209 RegUnitSetOrder.reserve(RegUnitSets.size()); in computeDerivedInfo()
2210 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) in computeDerivedInfo()
2217 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { in computeDerivedInfo()
2218 RegUnitSets[RegUnitSetOrder[Idx]].Order = Idx; in computeDerivedInfo()