Lines Matching defs:Super
204 // Add this as a super-register of SR now all sub-registers are in the list.
406 // Copy Proto super-classes.
543 // Most properties will be inherited from the closest super-class after the
559 assert(!SuperClasses.empty() && "Synthesized class without super class");
561 // The last super-class is the smallest one.
562 CodeGenRegisterClass &Super = *SuperClasses.back();
566 Namespace = Super.Namespace;
567 VTs = Super.VTs;
568 CopyCost = Super.CopyCost;
569 Allocatable = Super.Allocatable;
570 AltOrderSelect = Super.AltOrderSelect;
573 // super-class.
574 Orders.resize(Super.Orders.size());
575 for (unsigned i = 0, ie = Super.Orders.size(); i != ie; ++i)
576 for (unsigned j = 0, je = Super.Orders[i].size(); j != je; ++j)
577 if (contains(RegBank.getReg(Super.Orders[i][j])))
578 Orders[i].push_back(Super.Orders[i][j]);
706 // properties from their closest super-class. The iteration order here can
1299 // The standard set is all super-registers and all sub-registers, but the
1340 // All super-registers overlap.
1484 // Build list of (Super, Sub) pairs for this SubIdx.
1488 const CodeGenRegister *Super = *RI;
1489 const CodeGenRegister *Sub = Super->getSubRegs().find(SubIdx)->second;
1491 SSPairs.push_back(std::make_pair(Super, Sub));
1545 // to match old super-register classes with sub-register classes created
1617 // Second, find all super-registers that are completely covered by the set.
1621 const CodeGenRegister *Super = SR[j];
1622 if (!Super->CoveredBySubRegs || Set.count(Super))
1624 // This new super-register is covered by its sub-registers.
1626 const CodeGenRegister::SubRegMap &SRM = Super->getSubRegs();
1633 // All sub-registers in Set, add Super as well.
1634 // We will visit Super later to recheck its super-registers.
1636 Set.insert(Super);
