Lines Matching refs:Super
130 // Also compute leading super-registers. Each register has a list of
131 // covered-by-subregs super-registers where it appears as the first explicit
425 // Look at the leading super-registers of each sub-register. Those are the
441 "Super-register has no sub-registers");
495 // Make sure all sub-registers have been visited first, so the super-reg
501 // Now add this as a super-register on all sub-registers.
600 // Copy Proto super-classes.
723 // Most properties will be inherited from the closest super-class after the
744 assert(!SuperClasses.empty() && "Synthesized class without super class");
746 // The last super-class is the smallest one.
747 CodeGenRegisterClass &Super = *SuperClasses.back();
751 Namespace = Super.Namespace;
752 VTs = Super.VTs;
753 CopyCost = Super.CopyCost;
754 Allocatable = Super.Allocatable;
755 AltOrderSelect = Super.AltOrderSelect;
758 // super-class.
759 Orders.resize(Super.Orders.size());
760 for (unsigned i = 0, ie = Super.Orders.size(); i != ie; ++i)
761 for (unsigned j = 0, je = Super.Orders[i].size(); j != je; ++j)
762 if (contains(RegBank.getReg(Super.Orders[i][j])))
763 Orders[i].push_back(Super.Orders[i][j]);
889 // properties from their closest super-class. The iteration order here can
979 // Infer even more sub-registers by combining leading super-registers.
1207 // If some super-registers without CoveredBySubRegs use this index, we can
1838 // Build list of (Super, Sub) pairs for this SubIdx.
1843 const CodeGenRegister *Super = *RI;
1844 const CodeGenRegister *Sub = Super->getSubRegs().find(SubIdx)->second;
1846 SSPairs.push_back(std::make_pair(Super, Sub));
1904 // to match old super-register classes with sub-register classes created
1976 // Second, find all super-registers that are completely covered by the set.
1980 const CodeGenRegister *Super = SR[j];
1981 if (!Super->CoveredBySubRegs || Set.count(Super))
1983 // This new super-register is covered by its sub-registers.
1985 const CodeGenRegister::SubRegMap &SRM = Super->getSubRegs();
1992 // All sub-registers in Set, add Super as well.
1993 // We will visit Super later to recheck its super-registers.
1995 Set.insert(Super);
