reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1831 for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size(); 1833 const RegUnitSet &SubSet = RegUnitSets[SubIdx]; 1840 const RegUnitSet &SuperSet = RegUnitSets[SuperIdx]; 1851 if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size()) 1851 if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size()) 1852 RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name; 1852 RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name; 1863 PrunedUnitSets[i].Name = RegUnitSets[SuperIdx].Name; 1864 PrunedUnitSets[i].Units.swap(RegUnitSets[SuperIdx].Units); 1866 RegUnitSets.swap(PrunedUnitSets); 1877 assert(RegUnitSets.empty() && "dirty RegUnitSets"); 1886 RegUnitSets.resize(RegUnitSets.size() + 1); 1886 RegUnitSets.resize(RegUnitSets.size() + 1); 1887 RegUnitSets.back().Name = RC.getName(); 1890 RC.buildRegUnitSet(*this, RegUnitSets.back().Units); 1894 findRegUnitSet(RegUnitSets, RegUnitSets.back()); 1894 findRegUnitSet(RegUnitSets, RegUnitSets.back()); 1895 if (SetI != std::prev(RegUnitSets.end())) 1896 RegUnitSets.pop_back(); 1900 USEnd = RegUnitSets.size(); 1902 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":"; 1903 for (auto &U : RegUnitSets[USIdx].Units) 1912 USEnd = RegUnitSets.size(); 1914 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":"; 1915 for (auto &U : RegUnitSets[USIdx].Units) 1921 unsigned NumRegUnitSubSets = RegUnitSets.size(); 1922 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { 1932 std::set_intersection(RegUnitSets[Idx].Units.begin(), 1933 RegUnitSets[Idx].Units.end(), 1934 RegUnitSets[SearchIdx].Units.begin(), 1935 RegUnitSets[SearchIdx].Units.end(), 1941 RegUnitSets.resize(RegUnitSets.size() + 1); 1941 RegUnitSets.resize(RegUnitSets.size() + 1); 1942 RegUnitSets.back().Name = 1943 RegUnitSets[Idx].Name + "+" + RegUnitSets[SearchIdx].Name; 1943 RegUnitSets[Idx].Name + "+" + RegUnitSets[SearchIdx].Name; 1945 std::set_union(RegUnitSets[Idx].Units.begin(), 1946 RegUnitSets[Idx].Units.end(), 1947 RegUnitSets[SearchIdx].Units.begin(), 1948 RegUnitSets[SearchIdx].Units.end(), 1949 std::inserter(RegUnitSets.back().Units, 1950 RegUnitSets.back().Units.begin())); 1954 findRegUnitSet(RegUnitSets, RegUnitSets.back()); 1954 findRegUnitSet(RegUnitSets, RegUnitSets.back()); 1955 if (SetI != std::prev(RegUnitSets.end())) 1956 RegUnitSets.pop_back(); 1958 LLVM_DEBUG(dbgs() << "UnitSet " << RegUnitSets.size() - 1 << " " 1959 << RegUnitSets.back().Name << ":"; 1961 : RegUnitSets.back().Units) printRegUnitName(U); 1971 dbgs() << "\n"; for (unsigned USIdx = 0, USEnd = RegUnitSets.size(); 1973 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":"; 1974 for (auto &U : RegUnitSets[USIdx].Units) 2001 for (unsigned USIdx = 0, USEnd = RegUnitSets.size(); 2003 if (isRegUnitSubSet(RCRegUnits, RegUnitSets[USIdx].Units)) { 2019 for (unsigned i = 0, e = RegUnitSets.size(); i != e; ++i) { 2020 RegUnitSet &RUSet = RegUnitSets[i]; 2105 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) 2106 RegUnitSets[Idx].Weight = getRegUnitSetWeight(RegUnitSets[Idx].Units); 2106 RegUnitSets[Idx].Weight = getRegUnitSetWeight(RegUnitSets[Idx].Units); 2109 RegUnitSetOrder.reserve(RegUnitSets.size()); 2110 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) 2117 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { 2118 RegUnitSets[RegUnitSetOrder[Idx]].Order = Idx;utils/TableGen/CodeGenRegisters.h
737 return RegUnitSets[RegUnitSetOrder[Order]]; 746 unsigned getNumRegPressureSets() const { return RegUnitSets.size(); } 750 return RegUnitSets[Idx];