Lines Matching refs:SubIdx
131 CodeGenSubRegIndex *SubIdx = *I; in computeConcatTransitiveClosure() local
132 SubIdx->computeConcatTransitiveClosure(); in computeConcatTransitiveClosure()
134 for (CodeGenSubRegIndex *SRI : SubIdx->ConcatenationOf) in computeConcatTransitiveClosure()
138 if (SubIdx->ConcatenationOf.empty()) { in computeConcatTransitiveClosure()
142 I = ConcatenationOf.insert(I, SubIdx->ConcatenationOf.begin(), in computeConcatTransitiveClosure()
143 SubIdx->ConcatenationOf.end()); in computeConcatTransitiveClosure()
144 I += SubIdx->ConcatenationOf.size(); in computeConcatTransitiveClosure()
534 CodeGenSubRegIndex *SubIdx = getSubRegIndex(SubReg.second); in computeSecondarySubRegs() local
535 if (!SubIdx) in computeSecondarySubRegs()
539 NewIdx->addComposite(SubReg.first, SubIdx); in computeSecondarySubRegs()
1025 CodeGenRegBank &RegBank, const CodeGenSubRegIndex *SubIdx) const { in getMatchingSubClassWithSubRegs()
1041 CodeGenRegisterClass *BiggestSuperRegRC = getSubClassWithSubReg(SubIdx); in getMatchingSubClassWithSubRegs()
1058 RC.getSuperRegClasses(SubIdx, SuperRegClassesBV); in getMatchingSubClassWithSubRegs()
1109 void CodeGenRegisterClass::getSuperRegClasses(const CodeGenSubRegIndex *SubIdx, in getSuperRegClasses() argument
1111 auto FindI = SuperRegClasses.find(SubIdx); in getSuperRegClasses()
1892 for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size(); in pruneUnitSets() local
1893 SubIdx != EndIdx; ++SubIdx) { in pruneUnitSets()
1894 const RegUnitSet &SubSet = RegUnitSets[SubIdx]; in pruneUnitSets()
1897 if (SuperIdx == SubIdx) in pruneUnitSets()
1906 LLVM_DEBUG(dbgs() << "UnitSet " << SubIdx << " subsumed by " << SuperIdx in pruneUnitSets()
1912 if (RegUnitSets[SubIdx].Name.size() < RegUnitSets[SuperIdx].Name.size()) in pruneUnitSets()
1913 RegUnitSets[SuperIdx].Name = RegUnitSets[SubIdx].Name; in pruneUnitSets()
1918 SuperSetIDs.push_back(SubIdx); in pruneUnitSets()
2255 for (const auto &SubIdx : SubRegIndices) { in inferSubClassWithSubReg() local
2256 if (SubIdx.Artificial) in inferSubClassWithSubReg()
2258 SubReg2SetMap::const_iterator I = SRSets.find(&SubIdx); in inferSubClassWithSubReg()
2264 RC->setSubClassWithSubReg(&SubIdx, RC); in inferSubClassWithSubReg()
2271 RC->setSubClassWithSubReg(&SubIdx, SubRC); in inferSubClassWithSubReg()
2289 for (auto &SubIdx : SubRegIndices) { in inferMatchingSuperRegClass() local
2293 if (RC->getSubClassWithSubReg(&SubIdx) != RC) in inferMatchingSuperRegClass()
2300 const CodeGenRegister *Sub = Super->getSubRegs().find(&SubIdx)->second; in inferMatchingSuperRegClass()
2331 SubRC.addSuperRegClass(&SubIdx, RC); in inferMatchingSuperRegClass()
2338 SubIdx.getName() + "_in_" + in inferMatchingSuperRegClass()