/freebsd-12-stable/contrib/llvm-project/lldb/source/Core/ |
H A D | ValueObjectChild.cpp | 116 m_value.SetCompilerType(GetCompilerType()); 120 m_value.GetScalar() = parent->GetValue().GetScalar(); 122 m_value.SetValueType(value_type); 131 m_value.GetScalar() = addr; 138 m_value.GetScalar() += m_byte_offset; 145 m_value.SetValueType(Value::eValueTypeLoadAddress); 147 m_value.SetValueType(Value::eValueTypeFileAddress); 150 m_value.SetValueType(is_instance_ptr_base 155 m_value.SetValueType(Value::eValueTypeHostAddress); 159 m_value [all...] |
H A D | ValueObjectConstResult.cpp | 73 m_value.GetScalar() = (uintptr_t)m_data.GetDataStart(); 74 m_value.SetValueType(Value::eValueTypeHostAddress); 75 m_value.SetCompilerType(compiler_type); 111 m_value.GetScalar() = (uintptr_t)data_sp->GetBytes(); 112 m_value.SetValueType(Value::eValueTypeHostAddress); 113 // m_value.SetContext(Value::eContextTypeClangType, compiler_type); 114 m_value.SetCompilerType(compiler_type); 138 m_value.GetScalar() = address; 140 m_value.GetScalar().GetData(m_data, addr_byte_size); 141 // m_value [all...] |
H A D | ValueObjectVariable.cpp | 134 m_value.SetContext(Value::eContextTypeVariable, variable); 157 Value old_value(m_value); 159 nullptr, m_value, &m_error)) { 160 m_resolved_value = m_value; 161 m_value.SetContext(Value::eContextTypeVariable, variable); 165 m_value.SetCompilerType(compiler_type); 167 Value::ValueType value_type = m_value.GetValueType(); 176 // The variable value is in the Scalar value inside the m_value. We can 179 m_value.GetValueAsData(&exe_ctx, m_data, GetModule().get()); 194 m_value [all...] |
H A D | Value.cpp | 42 : m_value(), m_vector(), m_compiler_type(), m_context(nullptr), 47 : m_value(scalar), m_vector(), m_compiler_type(), m_context(nullptr), 52 : m_value(), m_vector(), m_compiler_type(), m_context(nullptr), 59 : m_value(v.m_value), m_vector(v.m_vector), 64 (uintptr_t)v.m_value.ULongLong(LLDB_INVALID_ADDRESS); 70 m_value = (uintptr_t)m_data_buffer.GetBytes(); 76 m_value = rhs.m_value; 83 (uintptr_t)rhs.m_value [all...] |
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | cond_key_dtor_entry_dealtor.hpp | 75 m_p_nd->m_value.first.~Key();
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | resize_no_store_hash_fn_imps.hpp | 54 ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value));
|
H A D | resize_store_hash_fn_imps.hpp | 54 ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash);
|
H A D | insert_no_store_hash_fn_imps.hpp | 59 while (p_e != NULL && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), 70 return std::make_pair(&p_e->m_value, false);
|
H A D | insert_store_hash_fn_imps.hpp | 59 while (p_e != NULL && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), 71 return std::make_pair(&p_e->m_value, false);
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 58 p->m_hash = ranged_hash_fn_base::operator()((const_key_reference)(PB_DS_V2F(p->m_value))).second;
|
H A D | erase_fn_imps.hpp | 52 _GLIBCXX_DEBUG_ONLY(map_debug_base::erase_existing(PB_DS_V2F(r_p_e->m_value))); 70 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) 81 if (pred(p_e->m_p_next->m_value))
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | insert_fn_imps.hpp | 60 return std::make_pair(point_iterator(&p_l->m_value), false); 69 return std::make_pair(point_iterator(&p_l->m_value), true); 79 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value))) 94 new (&p_l->m_value) value_type(r_val);
|
H A D | trace_fn_imps.hpp | 58 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl;
|
H A D | erase_fn_imps.hpp | 56 if (s_eq_fn(r_key, PB_DS_V2F(m_p_l->m_value))) 66 if (s_eq_fn(r_key, PB_DS_V2F(p_l->m_p_next->m_value))) 92 while (m_p_l != NULL && pred(m_p_l->m_value)) 106 if (pred(p_l->m_p_next->m_value)) 137 _GLIBCXX_DEBUG_ONLY(map_debug_base::erase_existing(PB_DS_V2F(p_l->m_value));)
|
H A D | find_fn_imps.hpp | 54 if (s_eq_fn(r_key, PB_DS_V2F(m_p_l->m_value))) 65 if (s_eq_fn(r_key, PB_DS_V2F(p_next->m_value)))
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | node.hpp | 97 std::cout << PB_DS_V2F(m_value) <<(m_red? " <r> " : " <b> ") 105 value_type m_value; member in struct:pb_ds::detail::rb_tree_node_ 132 { std::cout << PB_DS_V2F(m_value) <<(m_red? " <r> " : " <b> "); } 138 value_type m_value; member in struct:pb_ds::detail::rb_tree_node_
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | find_fn_imps.hpp | 77 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key)) 79 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value))) 96 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key)) 98 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
|
H A D | node.hpp | 77 { std::cout << PB_DS_V2F(m_value) << "(" << m_metadata << ")"; } 92 value_type m_value; member in struct:pb_ds::detail::splay_tree_node_ 119 { std::cout << PB_DS_V2F(m_value); } 125 value_type m_value; member in struct:pb_ds::detail::splay_tree_node_
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | insert_fn_imps.hpp | 97 if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) 142 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) 186 const bool bubble_up = Cmp_Fn::operator()(p_nd->m_value, r_new_val); 188 p_nd->m_value = r_new_val; 195 Cmp_Fn::operator()(p_parent->m_value, p_nd->m_value))
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | node.hpp | 81 value_type m_value; member in struct:pb_ds::detail::left_child_next_sibling_heap_node_ 117 value_type m_value; member in struct:pb_ds::detail::left_child_next_sibling_heap_node_
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | debug_no_store_hash_fn_imps.hpp | 65 const_key_reference r_key = PB_DS_V2F(p_e->m_value);
|
H A D | trace_fn_imps.hpp | 70 std::cerr << PB_DS_V2F(m_entries[i].m_value);
|
H A D | erase_fn_imps.hpp | 53 _GLIBCXX_DEBUG_ONLY(map_debug_base::erase_existing(PB_DS_V2F(p_e->m_value));) 54 p_e->m_value.~value_type(); 87 if (pred(p_e->m_value))
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | leaf.hpp | 130 value_type m_value; member in struct:pb_ds::detail::pat_trie_leaf 136 PB_DS_BASE_C_DEC(pat_trie_leaf_node_type), m_value(r_val) 143 { return m_value; } 149 { return m_value; }
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | insert_fn_imps.hpp | 76 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) 101 it.m_p_nd->m_value = r_new_val;
|