139     CodeGenSubRegIndex *SubIdx = *I;  in computeConcatTransitiveClosure()  local
140     SubIdx->computeConcatTransitiveClosure();  in computeConcatTransitiveClosure()
142     for (CodeGenSubRegIndex *SRI : SubIdx->ConcatenationOf)  in computeConcatTransitiveClosure()
146     if (SubIdx->ConcatenationOf.empty()) {  in computeConcatTransitiveClosure()
150       I = ConcatenationOf.insert(I, SubIdx->ConcatenationOf.begin(),  in computeConcatTransitiveClosure()
151                                  SubIdx->ConcatenationOf.end());  in computeConcatTransitiveClosure()
152       I += SubIdx->ConcatenationOf.size();  in computeConcatTransitiveClosure()
547       CodeGenSubRegIndex *SubIdx = getSubRegIndex(SubReg.second);  in computeSecondarySubRegs()  local
548       if (!SubIdx)  in computeSecondarySubRegs()
552       NewIdx->addComposite(SubReg.first, SubIdx, RegBank.getHwModes());  in computeSecondarySubRegs()
1058     CodeGenRegBank &RegBank, const CodeGenSubRegIndex *SubIdx) const {  in getMatchingSubClassWithSubRegs()
1074   CodeGenRegisterClass *BiggestSuperRegRC = getSubClassWithSubReg(SubIdx);  in getMatchingSubClassWithSubRegs()
1091     RC.getSuperRegClasses(SubIdx, SuperRegClassesBV);  in getMatchingSubClassWithSubRegs()
1142 void CodeGenRegisterClass::getSuperRegClasses(const CodeGenSubRegIndex *SubIdx,  in getSuperRegClasses()  argument
1144   auto FindI = SuperRegClasses.find(SubIdx);  in getSuperRegClasses()
1965   for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size(); SubIdx != EndIdx;  in pruneUnitSets()  local
1966        ++SubIdx) {  in pruneUnitSets()
1967     const RegUnitSet &SubSet = RegUnitSets[SubIdx];  in pruneUnitSets()
1970       if (SuperIdx == SubIdx)  in pruneUnitSets()
1979         LLVM_DEBUG(dbgs() << "UnitSet " << SubIdx << " subsumed by " << SuperIdx  in pruneUnitSets()
1985         if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size())  in pruneUnitSets()
1986           RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name;  in pruneUnitSets()
1991       SuperSetIDs.push_back(SubIdx);  in pruneUnitSets()
2313   for (const auto &SubIdx : SubRegIndices) {  in inferSubClassWithSubReg()  local
2314     if (SubIdx.Artificial)  in inferSubClassWithSubReg()
2316     SubReg2SetMap::const_iterator I = SRSets.find(&SubIdx);  in inferSubClassWithSubReg()
2322       RC->setSubClassWithSubReg(&SubIdx, RC);  in inferSubClassWithSubReg()
2328     RC->setSubClassWithSubReg(&SubIdx, SubRC);  in inferSubClassWithSubReg()
2347   for (auto &SubIdx : SubRegIndices) {  in inferMatchingSuperRegClass()  local
2351     if (RC->getSubClassWithSubReg(&SubIdx) != RC)  in inferMatchingSuperRegClass()
2358       const CodeGenRegister *Sub = Super->getSubRegs().find(&SubIdx)->second;  in inferMatchingSuperRegClass()
2393         SubRC.addSuperRegClass(&SubIdx, RC);  in inferMatchingSuperRegClass()
2400                           RC->getName() + "_with_" + SubIdx.getName() + "_in_" +  in inferMatchingSuperRegClass()