Lines Matching refs:m_sets
48 m_sets = std::move(info.m_sets); in MoveFrom()
58 const size_t num_sets = m_sets.size(); in MoveFrom()
60 m_sets[set].registers = m_set_reg_nums[set].data(); in MoveFrom()
212 m_sets.push_back( in SetRegisterInfo()
220 m_set_reg_nums.resize(m_sets.size()); in SetRegisterInfo()
314 set >= m_sets.size()) { in SetRegisterInfo()
429 assert(set < m_sets.size()); in SetRegisterInfo()
444 const size_t num_sets = m_sets.size(); in Finalize()
446 assert(m_sets.size() == m_set_reg_nums.size()); in Finalize()
447 m_sets[set].num_registers = m_set_reg_nums[set].size(); in Finalize()
448 m_sets[set].registers = m_set_reg_nums[set].data(); in Finalize()
685 size_t DynamicRegisterInfo::GetNumRegisterSets() const { return m_sets.size(); } in GetNumRegisterSets()
707 if (i < m_sets.size()) in GetRegisterSet()
708 return &m_sets[i]; in GetRegisterSet()
724 m_sets.push_back(new_set); in GetRegisterSetIndexByName()
725 return m_sets.size() - 1; in GetRegisterSetIndexByName()
742 m_sets.clear(); in Clear()
790 const size_t num_sets = m_sets.size(); in Dump()
795 m_sets[i].name); in Dump()
796 for (size_t idx = 0; idx < m_sets[i].num_registers; ++idx) { in Dump()
797 s.Printf("%s ", m_regs[m_sets[i].registers[idx]].name); in Dump()