469       CodeGenSubRegIndex *SubIdx = getSubRegIndex(SI->second);  in computeSecondarySubRegs()  local
470       if (!SubIdx)  in computeSecondarySubRegs()
473       NewIdx->addComposite(SI->first, SubIdx);  in computeSecondarySubRegs()
898 void CodeGenRegisterClass::getSuperRegClasses(const CodeGenSubRegIndex *SubIdx,  in getSuperRegClasses()  argument
900   auto FindI = SuperRegClasses.find(SubIdx);  in getSuperRegClasses()
1565   for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size();  in pruneUnitSets()  local
1566        SubIdx != EndIdx; ++SubIdx) {  in pruneUnitSets()
1567     const RegUnitSet &SubSet = RegUnitSets[SubIdx];  in pruneUnitSets()
1570       if (SuperIdx == SubIdx)  in pruneUnitSets()
1579         DEBUG(dbgs() << "UnitSet " << SubIdx << " subsumed by " << SuperIdx  in pruneUnitSets()
1585         if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size())  in pruneUnitSets()
1586           RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name;  in pruneUnitSets()
1591       SuperSetIDs.push_back(SubIdx);  in pruneUnitSets()
1927   for (const auto &SubIdx : SubRegIndices) {  in inferSubClassWithSubReg()  local
1928     SubReg2SetMap::const_iterator I = SRSets.find(&SubIdx);  in inferSubClassWithSubReg()
1934       RC->setSubClassWithSubReg(&SubIdx, RC);  in inferSubClassWithSubReg()
1941     RC->setSubClassWithSubReg(&SubIdx, SubRC);  in inferSubClassWithSubReg()
1959   for (auto &SubIdx : SubRegIndices) {  in inferMatchingSuperRegClass()  local
1963     if (RC->getSubClassWithSubReg(&SubIdx) != RC)  in inferMatchingSuperRegClass()
1970       const CodeGenRegister *Sub = Super->getSubRegs().find(&SubIdx)->second;  in inferMatchingSuperRegClass()
1999         SubRC.addSuperRegClass(&SubIdx, RC);  in inferMatchingSuperRegClass()
2006                                           SubIdx.getName() + "_in_" +  in inferMatchingSuperRegClass()