Searched refs:m_values (Results 1 – 11 of 11) sorted by relevance
43 m_values.clear(); in Clear()64 if (idx < m_values.size())65 value_sp = m_values[idx];71 if (idx < m_values.size()) in GetValueAtIndex()72 value_sp = m_values[idx]; in GetValueAtIndex()90 if (idx < m_values.size()) in InsertValue()91 m_values.insert(m_values.begin() + idx, value_sp); in InsertValue()104 m_values[idx] = value_sp; in ReplaceValue()112 if (idx < m_values.size()) { in DeleteValue()113 m_values.erase(m_values.begin() + idx); in DeleteValue()[all …]
23 : OptionValue(), m_type_mask(type_mask), m_values(), in OptionValue()42 m_values.clear(); in Clear()59 size_t GetNumValues() const { return m_values.size(); } in GetNumValues()83 collection m_values; variable
31 const uint32_t size = m_values.size(); in DumpValue()123 if (m_values[new_idx]) { in GetSubValue()128 return m_values[new_idx]; in GetSubValue()149 const uint32_t size = m_values.size(); in GetArgs()186 if (idx >= m_values.size()) in SetArgs()189 m_values.insert(m_values.begin() + idx, value_sp); in SetArgs()229 m_values.erase(m_values.begin() + *pos); in SetArgs()233 m_values.erase(m_values.begin() + remove_indexes.front()); in SetArgs()267 m_values[idx] = value_sp; in SetArgs()284 m_values.clear(); in SetArgs()[all …]
36 collection::iterator pos, end = m_values.end(); in DumpValue()41 for (pos = m_values.begin(); pos != end; ++pos) { in DumpValue()87 collection::const_iterator pos, end = m_values.end(); in GetArgs()88 for (pos = m_values.begin(); pos != end; ++pos) { in GetArgs()283 if (pos != m_values.end()) in GetValueForKey()296 if (pos != m_values.end()) in SetValueForKey()299 m_values[key] = value_sp; in SetValueForKey()306 collection::iterator pos = m_values.find(key); in DeleteValueForKey()307 if (pos != m_values.end()) { in DeleteValueForKey()308 m_values.erase(pos); in DeleteValueForKey()[all …]
19 for (auto value : m_values) { in GetArgs()
23 ValueListImpl() : m_values() {} in ValueListImpl()25 ValueListImpl(const ValueListImpl &rhs) : m_values(rhs.m_values) {} in ValueListImpl()30 m_values = rhs.m_values; in operator =()34 uint32_t GetSize() { return m_values.size(); } in GetSize()36 void Append(const lldb::SBValue &sb_value) { m_values.push_back(sb_value); } in Append()39 for (auto val : list.m_values) in Append()46 return m_values[index]; in GetValueAtIndex()50 for (auto val : m_values) { in FindValueByUID()59 for (auto val : m_values) { in GetFirstValueByName()68 std::vector<lldb::SBValue> m_values; member in ValueListImpl
691 ValueList::ValueList(const ValueList &rhs) { m_values = rhs.m_values; } in ValueList()694 m_values = rhs.m_values; in operator =()698 void ValueList::PushValue(const Value &value) { m_values.push_back(value); } in PushValue()700 size_t ValueList::GetSize() { return m_values.size(); } in GetSize()704 return &(m_values[idx]); in GetValueAtIndex()709 void ValueList::Clear() { m_values.clear(); } in Clear()
250 ValueList() : m_values() {} in ValueList()268 collection m_values; variable
96 ValueMap m_values; member in InterpreterStackFrame140 ValueMap::iterator i = m_values.find(value); in SummarizeValue()142 if (i != m_values.end()) { in SummarizeValue()324 m_values[value] = data_address; in MakeArgument()409 ValueMap::iterator i = m_values.find(value); in ResolveValue()411 if (i != m_values.end()) in ResolveValue()426 m_values[value] = data_address; in ResolveValue()881 frame.m_values[alloca_inst] = P; in Interpret()
623 FunctionValueMap m_values; variable
48 : m_maker(maker), m_values() {} in FunctionValueCache()54 if (!m_values.count(function)) { in GetValue()56 m_values[function] = ret; in GetValue()59 return m_values[function]; in GetValue()