Lines Matching full:subregs
119 std::vector<Record*> SRs = TheDef->getValueAsListOfDefs("SubRegs");
123 "SubRegs and SubRegIndices must have the same size");
131 // covered-by-subregs super-registers where it appears as the first explicit
213 for (SubRegMap::const_iterator I = SubRegs.begin(), E = SubRegs.end();
226 return SubRegs;
229 // First insert the explicit subregs and make sure they are fully indexed.
233 if (!SubRegs.insert(std::make_pair(Idx, SR)).second)
241 // Keep track of inherited subregs and how they can be reached.
244 // Clone inherited subregs and place duplicate entries in Orphans.
245 // Here the order is important - earlier subregs take precedence.
252 if (!SubRegs.insert(*SI).second)
265 CodeGenRegister *SR = SubRegs[Idx];
277 if (SubRegs.count(I->second) || !Orphans.erase(SRI->second))
280 SubRegs.insert(std::make_pair(I->second, SRI->second));
287 // Work backwards in the Indices vector in order to compose subregs bottom-up.
299 // dsub_1, dsub_2] subregs without necessarily having a qsub_1 subreg. The
303 CodeGenRegister *SR = SubRegs[Idx];
308 SubRegs[RegBank.getCompositeSubRegIndex(Idx, SI->first)] = SI->second;
312 for (SubRegMap::const_iterator SI = SubRegs.begin(), SE = SubRegs.end();
405 return SubRegs;
428 for (SubRegMap::iterator I = SubRegs.begin(), E = SubRegs.end(); I != E; ++I){
466 if (!SubRegs.insert(NewSubRegs[i]).second)
478 for (SubRegMap::const_iterator SI = NewSubReg->SubRegs.begin(),
479 SE = NewSubReg->SubRegs.end(); SI != SE; ++SI) {
497 for (SubRegMap::const_iterator I = SubRegs.begin(), E = SubRegs.end();
504 for (SubRegMap::const_iterator I = SubRegs.begin(), E = SubRegs.end();
529 for (SubRegMap::const_iterator I = SubRegs.begin(), E = SubRegs.end();
556 ListInit *SubRegs = Def->getValueAsListInit("SubRegs");
557 if (Dim != SubRegs->getSize())
558 PrintFatalError(Def->getLoc(), "SubRegIndices and SubRegs size mismatch");
567 ST.evaluate(SubRegs->getElement(i), Lists[i], Def->getLoc());
617 if (Field == "SubRegs")
