Lines Matching refs:Registers
78 // Add this as a super-register of SR now all sub-registers are in the list.
80 // order getSubRegs is called on all registers.
146 assert(SubRegsComplete && "Must precompute sub-registers");
159 // A RegisterTuples def is used to generate pseudo-registers from lists of
160 // sub-registers. We provide a SetTheory expander class that returns the new
161 // registers.
171 throw TGError(Def->getLoc(), "Tuples must have at least 2 sub-registers");
281 // Default allocation order always contains all registers.
366 // Copy all allocation orders, filter out foreign registers from the larger
406 // 1. All RC registers are also in this.
422 registers, spill size, and alignment form a
525 Registers.reserve(Regs.size());
530 // Expand tuples and number the new registers.
539 // Precompute all sub-register maps now all the registers are known.
541 for (unsigned i = 0, e = Registers.size(); i != e; ++i)
542 Registers[i]->getSubRegs(*this);
568 Reg = new CodeGenRegister(Def, Registers.size() + 1);
569 Registers.push_back(Reg);
614 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
615 CodeGenRegister *Reg1 = Registers[i];
664 // Compute sets of overlapping registers.
666 // The standard set is all super-registers and all sub-registers, but the
667 // target description can add arbitrary overlapping registers via the 'Aliases'
685 // This also implies that registers with a common sub-register are considered
700 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
701 CodeGenRegister *Reg = Registers[i];
707 // All super-registers overlap.
726 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
727 CodeGenRegister *Reg = Registers[i];
744 // For every register class RC, make sure that the set of registers in RC with
758 // Compute the set of registers supporting each SubRegIndex.
776 // In most cases, all RC registers support the SubRegIndex.
