Lines Matching defs:RegClasses

1015   auto &RegClasses = RegBank.getRegClasses();
1018 for (auto I = RegClasses.rbegin(), E = RegClasses.rend(); I != E; ++I) {
1020 RC.SubClasses.resize(RegClasses.size());
1026 for (auto I2 = I.base(), E2 = RegClasses.end(); I2 != E2; ++I2) {
1043 for (auto &RC : RegClasses) {
1045 auto I = RegClasses.begin();
1059 for (auto &RC : RegClasses)
1078 auto &RegClasses = RegBank.getRegClasses();
1087 for (auto &RC : RegClasses)
1097 for (auto &RC : RegClasses) {
1098 BitVector SuperRegClassesBV(RegClasses.size());
1302 RegClasses.emplace_back(*this, R);
1303 CodeGenRegisterClass &RC = RegClasses.back();
1312 RegClasses.sort(TopoOrderRC);
1314 for (auto &RC : RegClasses)
1375 RegClasses.emplace_back(*this, Name, K);
1376 addToMaps(&RegClasses.back());
1377 return &RegClasses.back();
1675 for (auto &RegClass : RegClasses) {
2015 auto &RegClasses = getRegClasses();
2016 for (auto &RC : RegClasses) {
2105 RegClassUnitSets.resize(RegClasses.size());
2107 for (auto &RC : RegClasses) {
2217 for (CodeGenRegisterClass &RC : RegClasses) {
2251 assert(!RegClasses.empty());
2254 for (auto I = RegClasses.begin(), E = std::prev(RegClasses.end());
2366 assert(!RegClasses.empty());
2367 for (auto I = FirstSubRegRC, E = std::prev(RegClasses.end());
2408 assert(!RegClasses.empty());
2415 auto FirstNewRC = std::prev(RegClasses.end());
2419 for (auto I = RegClasses.begin(), E = RegClasses.end(); I != E; ++I) {
2440 auto NextNewRC = std::prev(RegClasses.end());
2441 for (auto I2 = RegClasses.begin(), E2 = std::next(FirstNewRC); I2 != E2;