134     CodeGenSubRegIndex *SubIdx = *I;  in computeConcatTransitiveClosure()  local
135     SubIdx->computeConcatTransitiveClosure();  in computeConcatTransitiveClosure()
137     for (CodeGenSubRegIndex *SRI : SubIdx->ConcatenationOf)  in computeConcatTransitiveClosure()
141     if (SubIdx->ConcatenationOf.empty()) {  in computeConcatTransitiveClosure()
145       I = ConcatenationOf.insert(I, SubIdx->ConcatenationOf.begin(),  in computeConcatTransitiveClosure()
146                                  SubIdx->ConcatenationOf.end());  in computeConcatTransitiveClosure()
147       I += SubIdx->ConcatenationOf.size();  in computeConcatTransitiveClosure()
502             for (CodeGenSubRegIndex *SubIdx : SubRegIdx->ConcatenationOf)  in computeSecondarySubRegs()
503               Parts.push_back(SubIdx);  in computeSecondarySubRegs()
537       CodeGenSubRegIndex *SubIdx = getSubRegIndex(SI->second);  in computeSecondarySubRegs()  local
538       if (!SubIdx)  in computeSecondarySubRegs()
541       NewIdx->addComposite(SI->first, SubIdx);  in computeSecondarySubRegs()
997     CodeGenRegBank &RegBank, const CodeGenSubRegIndex *SubIdx) const {  in getMatchingSubClassWithSubRegs()
1013   CodeGenRegisterClass *BiggestSuperRegRC = getSubClassWithSubReg(SubIdx);  in getMatchingSubClassWithSubRegs()
1030     RC.getSuperRegClasses(SubIdx, SuperRegClassesBV);  in getMatchingSubClassWithSubRegs()
1081 void CodeGenRegisterClass::getSuperRegClasses(const CodeGenSubRegIndex *SubIdx,  in getSuperRegClasses()  argument
1083   auto FindI = SuperRegClasses.find(SubIdx);  in getSuperRegClasses()
1850   for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size();  in pruneUnitSets()  local
1851        SubIdx != EndIdx; ++SubIdx) {  in pruneUnitSets()
1852     const RegUnitSet &SubSet = RegUnitSets[SubIdx];  in pruneUnitSets()
1855       if (SuperIdx == SubIdx)  in pruneUnitSets()
1864         LLVM_DEBUG(dbgs() << "UnitSet " << SubIdx << " subsumed by " << SuperIdx  in pruneUnitSets()
1870         if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size())  in pruneUnitSets()
1871           RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name;  in pruneUnitSets()
1876       SuperSetIDs.push_back(SubIdx);  in pruneUnitSets()
2211   for (const auto &SubIdx : SubRegIndices) {  in inferSubClassWithSubReg()  local
2212     if (SubIdx.Artificial)  in inferSubClassWithSubReg()
2214     SubReg2SetMap::const_iterator I = SRSets.find(&SubIdx);  in inferSubClassWithSubReg()
2220       RC->setSubClassWithSubReg(&SubIdx, RC);  in inferSubClassWithSubReg()
2227     RC->setSubClassWithSubReg(&SubIdx, SubRC);  in inferSubClassWithSubReg()
2245   for (auto &SubIdx : SubRegIndices) {  in inferMatchingSuperRegClass()  local
2249     if (RC->getSubClassWithSubReg(&SubIdx) != RC)  in inferMatchingSuperRegClass()
2256       const CodeGenRegister *Sub = Super->getSubRegs().find(&SubIdx)->second;  in inferMatchingSuperRegClass()
2287         SubRC.addSuperRegClass(&SubIdx, RC);  in inferMatchingSuperRegClass()
2294                                           SubIdx.getName() + "_in_" +  in inferMatchingSuperRegClass()