Lines Matching refs:m_sets
41 m_sets = std::move(info.m_sets); in MoveFrom()
51 const size_t num_sets = m_sets.size(); in MoveFrom()
53 m_sets[set].registers = m_set_reg_nums[set].data(); in MoveFrom()
204 m_sets.push_back({set_name.AsCString(), nullptr, 0, nullptr}); in SetRegisterInfo()
211 m_set_reg_nums.resize(m_sets.size()); in SetRegisterInfo()
300 set >= m_sets.size()) { in SetRegisterInfo()
416 assert(set < m_sets.size()); in SetRegisterInfo()
431 const size_t num_sets = m_sets.size(); in Finalize()
433 assert(m_sets.size() == m_set_reg_nums.size()); in Finalize()
434 m_sets[set].num_registers = m_set_reg_nums[set].size(); in Finalize()
435 m_sets[set].registers = m_set_reg_nums[set].data(); in Finalize()
671 size_t DynamicRegisterInfo::GetNumRegisterSets() const { return m_sets.size(); } in GetNumRegisterSets()
693 if (i < m_sets.size()) in GetRegisterSet()
694 return &m_sets[i]; in GetRegisterSet()
710 m_sets.push_back(new_set); in GetRegisterSetIndexByName()
711 return m_sets.size() - 1; in GetRegisterSetIndexByName()
728 m_sets.clear(); in Clear()
776 const size_t num_sets = m_sets.size(); in Dump()
781 m_sets[i].name); in Dump()
782 for (size_t idx = 0; idx < m_sets[i].num_registers; ++idx) { in Dump()
783 s.Printf("%s ", m_regs[m_sets[i].registers[idx]].name); in Dump()