Lines Matching refs:RegUnitSets
1555 for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size(); in pruneUnitSets()
1557 const RegUnitSet &SubSet = RegUnitSets[SubIdx]; in pruneUnitSets()
1564 const RegUnitSet &SuperSet = RegUnitSets[SuperIdx]; in pruneUnitSets()
1581 PrunedUnitSets[i].Name = RegUnitSets[SuperIdx].Name; in pruneUnitSets()
1582 PrunedUnitSets[i].Units.swap(RegUnitSets[SuperIdx].Units); in pruneUnitSets()
1584 RegUnitSets.swap(PrunedUnitSets); in pruneUnitSets()
1595 assert(RegUnitSets.empty() && "dirty RegUnitSets"); in computeRegUnitSets()
1604 RegUnitSets.resize(RegUnitSets.size() + 1); in computeRegUnitSets()
1605 RegUnitSets.back().Name = RC.getName(); in computeRegUnitSets()
1608 RC.buildRegUnitSet(RegUnitSets.back().Units); in computeRegUnitSets()
1612 findRegUnitSet(RegUnitSets, RegUnitSets.back()); in computeRegUnitSets()
1613 if (SetI != std::prev(RegUnitSets.end())) in computeRegUnitSets()
1614 RegUnitSets.pop_back(); in computeRegUnitSets()
1618 for (unsigned USIdx = 0, USEnd = RegUnitSets.size(); in computeRegUnitSets()
1620 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name in computeRegUnitSets()
1622 for (auto &U : RegUnitSets[USIdx].Units) in computeRegUnitSets()
1631 for (unsigned USIdx = 0, USEnd = RegUnitSets.size(); in computeRegUnitSets()
1633 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name in computeRegUnitSets()
1635 for (auto &U : RegUnitSets[USIdx].Units) in computeRegUnitSets()
1642 unsigned NumRegUnitSubSets = RegUnitSets.size(); in computeRegUnitSets()
1643 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { in computeRegUnitSets()
1653 std::set_intersection(RegUnitSets[Idx].Units.begin(), in computeRegUnitSets()
1654 RegUnitSets[Idx].Units.end(), in computeRegUnitSets()
1655 RegUnitSets[SearchIdx].Units.begin(), in computeRegUnitSets()
1656 RegUnitSets[SearchIdx].Units.end(), in computeRegUnitSets()
1662 RegUnitSets.resize(RegUnitSets.size() + 1); in computeRegUnitSets()
1663 RegUnitSets.back().Name = in computeRegUnitSets()
1664 RegUnitSets[Idx].Name + "+" + RegUnitSets[SearchIdx].Name; in computeRegUnitSets()
1666 std::set_union(RegUnitSets[Idx].Units.begin(), in computeRegUnitSets()
1667 RegUnitSets[Idx].Units.end(), in computeRegUnitSets()
1668 RegUnitSets[SearchIdx].Units.begin(), in computeRegUnitSets()
1669 RegUnitSets[SearchIdx].Units.end(), in computeRegUnitSets()
1670 std::inserter(RegUnitSets.back().Units, in computeRegUnitSets()
1671 RegUnitSets.back().Units.begin())); in computeRegUnitSets()
1675 findRegUnitSet(RegUnitSets, RegUnitSets.back()); in computeRegUnitSets()
1676 if (SetI != std::prev(RegUnitSets.end())) in computeRegUnitSets()
1677 RegUnitSets.pop_back(); in computeRegUnitSets()
1679 DEBUG(dbgs() << "UnitSet " << RegUnitSets.size()-1 in computeRegUnitSets()
1680 << " " << RegUnitSets.back().Name << ":"; in computeRegUnitSets()
1681 for (auto &U : RegUnitSets.back().Units) in computeRegUnitSets()
1692 for (unsigned USIdx = 0, USEnd = RegUnitSets.size(); in computeRegUnitSets()
1694 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name in computeRegUnitSets()
1696 for (auto &U : RegUnitSets[USIdx].Units) in computeRegUnitSets()
1723 for (unsigned USIdx = 0, USEnd = RegUnitSets.size(); in computeRegUnitSets()
1725 if (isRegUnitSubSet(RCRegUnits, RegUnitSets[USIdx].Units)) { in computeRegUnitSets()
1741 for (unsigned i = 0, e = RegUnitSets.size(); i != e; ++i) { in computeRegUnitSets()
1742 RegUnitSet &RUSet = RegUnitSets[i]; in computeRegUnitSets()
1824 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) in computeDerivedInfo()
1825 RegUnitSets[Idx].Weight = getRegUnitSetWeight(RegUnitSets[Idx].Units); in computeDerivedInfo()
1828 RegUnitSetOrder.reserve(RegUnitSets.size()); in computeDerivedInfo()
1829 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) in computeDerivedInfo()
1837 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { in computeDerivedInfo()
1838 RegUnitSets[RegUnitSetOrder[Idx]].Order = Idx; in computeDerivedInfo()