Home
last modified time | relevance | path

Searched refs:p_e (Results 1 – 25 of 64) sorted by relevance

123

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/cc_hash_table_map_/
H A Dentry_list_fn_imps.hpp46 deallocate_links_in_list(entry_pointer p_e) in deallocate_links_in_list() argument
48 while (p_e != 0) in deallocate_links_in_list()
50 entry_pointer p_dealloc_e = p_e; in deallocate_links_in_list()
51 p_e = p_e->m_p_next; in deallocate_links_in_list()
62 entry_pointer p_e = s_entry_allocator.allocate(1); in get_entry() local
65 new (&p_e->m_value) value_type(r_val); in get_entry()
66 return p_e; in get_entry()
75 entry_pointer p_e = s_entry_allocator.allocate(1); in get_entry() local
76 cond_dealtor_t cond(p_e); in get_entry()
79 new (&p_e->m_value) value_type(r_val); in get_entry()
[all …]
H A Dcc_ht_map_.hpp418 entry_pointer p_e = m_entries[pos]; in subscript_imp() local
421 while (p_e != 0 in subscript_imp()
422 && !hash_eq_fn_base::operator()(p_e->m_value.first, r_key)) in subscript_imp()
425 p_e = p_e->m_p_next; in subscript_imp()
429 if (p_e != 0) in subscript_imp()
432 return (p_e->m_value.second); in subscript_imp()
444 entry_pointer p_e = m_entries[pos_hash_pair.first]; in subscript_imp() local
446 while (p_e != 0 && in subscript_imp()
447 !hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, in subscript_imp()
451 p_e = p_e->m_p_next; in subscript_imp()
[all …]
H A Derase_fn_imps.hpp50 entry_pointer p_e = r_p_e; in erase_entry_pointer() local
52 rels_entry(p_e); in erase_entry_pointer()
74 entry_pointer p_e = m_entries[pos]; in erase_if() local
75 while (p_e != 0 && p_e->m_p_next != 0) in erase_if()
77 if (pred(p_e->m_p_next->m_value)) in erase_if()
80 erase_entry_pointer(p_e->m_p_next); in erase_if()
83 p_e = p_e->m_p_next; in erase_if()
H A Dinsert_store_hash_fn_imps.hpp52 entry_pointer p_e = m_entries[pos_hash_pair.first]; in insert_imp() local
55 while (p_e != 0 && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), in insert_imp()
56 p_e->m_hash, in insert_imp()
60 p_e = p_e->m_p_next; in insert_imp()
64 if (p_e != 0) in insert_imp()
67 return std::make_pair(&p_e->m_value, false); in insert_imp()
H A Dinsert_no_store_hash_fn_imps.hpp52 entry_pointer p_e = m_entries[pos]; in insert_imp() local
55 while (p_e != 0 && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), in insert_imp()
59 p_e = p_e->m_p_next; in insert_imp()
63 if (p_e != 0) in insert_imp()
66 return std::make_pair(&p_e->m_value, false); in insert_imp()
H A Derase_store_hash_fn_imps.hpp50 entry_pointer p_e = m_entries[r_pos_hash_pair.first]; in erase_in_pos_imp()
52 if (p_e == 0) in erase_in_pos_imp()
60 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash, in erase_in_pos_imp()
73 entry_pointer p_next_e = p_e->m_p_next; in erase_in_pos_imp()
88 erase_entry_pointer(p_e->m_p_next); in erase_in_pos_imp()
94 p_e = p_next_e; in erase_in_pos_imp()
H A Dresize_store_hash_fn_imps.hpp47 resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resize… in resize_imp_no_exceptions_reassign_pointer() argument
50 ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash); in resize_imp_no_exceptions_reassign_pointer()
52 entry_pointer const p_next_e = p_e->m_p_next; in resize_imp_no_exceptions_reassign_pointer()
53 p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first]; in resize_imp_no_exceptions_reassign_pointer()
54 a_p_entries_resized[pos_hash_pair.first] = p_e; in resize_imp_no_exceptions_reassign_pointer()
H A Derase_no_store_hash_fn_imps.hpp59 entry_pointer p_e = m_entries[pos]; in erase_in_pos_imp()
61 if (p_e == 0) in erase_in_pos_imp()
69 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key)) in erase_in_pos_imp()
81 entry_pointer p_next_e = p_e->m_p_next; in erase_in_pos_imp()
94 erase_entry_pointer(p_e->m_p_next); in erase_in_pos_imp()
100 p_e = p_next_e; in erase_in_pos_imp()
H A Dresize_no_store_hash_fn_imps.hpp47 resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resize… in resize_imp_no_exceptions_reassign_pointer() argument
50 ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value)); in resize_imp_no_exceptions_reassign_pointer()
52 entry_pointer const p_next_e = p_e->m_p_next; in resize_imp_no_exceptions_reassign_pointer()
53 p_e->m_p_next = a_p_entries_resized[hash_pos]; in resize_imp_no_exceptions_reassign_pointer()
54 a_p_entries_resized[hash_pos] = p_e; in resize_imp_no_exceptions_reassign_pointer()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/cc_hash_table_map_/
H A Dentry_list_fn_imps.hpp46 deallocate_links_in_list(entry_pointer p_e) in deallocate_links_in_list() argument
48 while (p_e != 0) in deallocate_links_in_list()
50 entry_pointer p_dealloc_e = p_e; in deallocate_links_in_list()
51 p_e = p_e->m_p_next; in deallocate_links_in_list()
62 entry_pointer p_e = s_entry_allocator.allocate(1); in get_entry() local
65 new (&p_e->m_value) value_type(r_val); in get_entry()
66 return p_e; in get_entry()
75 entry_pointer p_e = s_entry_allocator.allocate(1); in get_entry() local
76 cond_dealtor_t cond(p_e); in get_entry()
79 new (&p_e->m_value) value_type(r_val); in get_entry()
[all …]
H A Dcc_ht_map_.hpp418 entry_pointer p_e = m_entries[pos]; in subscript_imp() local
421 while (p_e != 0 in subscript_imp()
422 && !hash_eq_fn_base::operator()(p_e->m_value.first, r_key)) in subscript_imp()
425 p_e = p_e->m_p_next; in subscript_imp()
429 if (p_e != 0) in subscript_imp()
432 return (p_e->m_value.second); in subscript_imp()
444 entry_pointer p_e = m_entries[pos_hash_pair.first]; in subscript_imp() local
446 while (p_e != 0 && in subscript_imp()
447 !hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, in subscript_imp()
451 p_e = p_e->m_p_next; in subscript_imp()
[all …]
H A Derase_fn_imps.hpp50 entry_pointer p_e = r_p_e; in erase_entry_pointer() local
52 rels_entry(p_e); in erase_entry_pointer()
74 entry_pointer p_e = m_entries[pos]; in erase_if() local
75 while (p_e != 0 && p_e->m_p_next != 0) in erase_if()
77 if (pred(p_e->m_p_next->m_value)) in erase_if()
80 erase_entry_pointer(p_e->m_p_next); in erase_if()
83 p_e = p_e->m_p_next; in erase_if()
H A Dinsert_store_hash_fn_imps.hpp52 entry_pointer p_e = m_entries[pos_hash_pair.first]; in insert_imp() local
55 while (p_e != 0 && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), in insert_imp()
56 p_e->m_hash, in insert_imp()
60 p_e = p_e->m_p_next; in insert_imp()
64 if (p_e != 0) in insert_imp()
67 return std::make_pair(&p_e->m_value, false); in insert_imp()
H A Dinsert_no_store_hash_fn_imps.hpp52 entry_pointer p_e = m_entries[pos]; in insert_imp() local
55 while (p_e != 0 && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), in insert_imp()
59 p_e = p_e->m_p_next; in insert_imp()
63 if (p_e != 0) in insert_imp()
66 return std::make_pair(&p_e->m_value, false); in insert_imp()
H A Derase_store_hash_fn_imps.hpp50 entry_pointer p_e = m_entries[r_pos_hash_pair.first]; in erase_in_pos_imp()
52 if (p_e == 0) in erase_in_pos_imp()
60 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash, in erase_in_pos_imp()
73 entry_pointer p_next_e = p_e->m_p_next; in erase_in_pos_imp()
88 erase_entry_pointer(p_e->m_p_next); in erase_in_pos_imp()
94 p_e = p_next_e; in erase_in_pos_imp()
H A Dresize_store_hash_fn_imps.hpp47 resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resize… in resize_imp_no_exceptions_reassign_pointer() argument
50 ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash); in resize_imp_no_exceptions_reassign_pointer()
52 entry_pointer const p_next_e = p_e->m_p_next; in resize_imp_no_exceptions_reassign_pointer()
53 p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first]; in resize_imp_no_exceptions_reassign_pointer()
54 a_p_entries_resized[pos_hash_pair.first] = p_e; in resize_imp_no_exceptions_reassign_pointer()
H A Derase_no_store_hash_fn_imps.hpp59 entry_pointer p_e = m_entries[pos]; in erase_in_pos_imp()
61 if (p_e == 0) in erase_in_pos_imp()
69 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key)) in erase_in_pos_imp()
81 entry_pointer p_next_e = p_e->m_p_next; in erase_in_pos_imp()
94 erase_entry_pointer(p_e->m_p_next); in erase_in_pos_imp()
100 p_e = p_next_e; in erase_in_pos_imp()
H A Dresize_no_store_hash_fn_imps.hpp47 resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resize… in resize_imp_no_exceptions_reassign_pointer() argument
50 ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value)); in resize_imp_no_exceptions_reassign_pointer()
52 entry_pointer const p_next_e = p_e->m_p_next; in resize_imp_no_exceptions_reassign_pointer()
53 p_e->m_p_next = a_p_entries_resized[hash_pos]; in resize_imp_no_exceptions_reassign_pointer()
54 a_p_entries_resized[hash_pos] = p_e; in resize_imp_no_exceptions_reassign_pointer()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/gp_hash_table_map_/
H A Dgp_ht_map_.hpp447 entry* const p_e = m_entries + pos; in insert_new_imp() local
448 new (&p_e->m_value) value_type(r_val); in insert_new_imp()
449 p_e->m_stat = valid_entry_status; in insert_new_imp()
452 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(p_e->m_value));) in insert_new_imp()
454 return &p_e->m_value; in insert_new_imp()
470 entry* const p_e = m_entries + r_pos_hash_pair.first; in insert_new_imp() local
471 new (&p_e->m_value) value_type(r_val); in insert_new_imp()
472 p_e->m_hash = r_pos_hash_pair.second; in insert_new_imp()
473 p_e->m_stat = valid_entry_status; in insert_new_imp()
477 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(p_e->m_value));) in insert_new_imp()
[all …]
H A Derase_fn_imps.hpp46 erase_entry(entry_pointer p_e) in erase_entry() argument
48 _GLIBCXX_DEBUG_ASSERT(p_e->m_stat = valid_entry_status); in erase_entry()
49 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(p_e->m_value));) in erase_entry()
50 p_e->m_value.~value_type(); in erase_entry()
51 p_e->m_stat = erased_entry_status; in erase_entry()
63 entry_pointer p_e = &m_entries[pos]; in clear() local
64 if (p_e->m_stat == valid_entry_status) in clear()
65 erase_entry(p_e); in clear()
81 entry_pointer p_e = &m_entries[pos]; in erase_if() local
82 if (p_e->m_stat == valid_entry_status) in erase_if()
[all …]
H A Dinsert_store_hash_fn_imps.hpp63 entry* const p_e = m_entries + pos; in find_ins_pos() local
64 switch(p_e->m_stat) in find_ins_pos()
81 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash, in find_ins_pos()
110 entry_pointer p_e =& m_entries[pos_hash_pair.first]; in insert_imp() local
111 if (p_e->m_stat == valid_entry_status) in insert_imp()
114 return std::make_pair(&p_e->m_value, false); in insert_imp()
H A Dconstructor_destructor_store_hash_fn_imps.hpp51 entry* const p_e = m_entries + pos; in constructor_insert_new_imp() local
52 new (&p_e->m_value) mapped_value_type(r_val); in constructor_insert_new_imp()
53 p_e->m_hash = ranged_probe_fn_base::operator()(PB_DS_V2F(r_val)).second; in constructor_insert_new_imp()
54 p_e->m_stat = valid_entry_status; in constructor_insert_new_imp()
55 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(p_e->m_value.first);) in constructor_insert_new_imp()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/gp_hash_table_map_/
H A Dgp_ht_map_.hpp447 entry* const p_e = m_entries + pos; in insert_new_imp() local
448 new (&p_e->m_value) value_type(r_val); in insert_new_imp()
449 p_e->m_stat = valid_entry_status; in insert_new_imp()
452 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(p_e->m_value));) in insert_new_imp()
454 return &p_e->m_value; in insert_new_imp()
470 entry* const p_e = m_entries + r_pos_hash_pair.first; in insert_new_imp() local
471 new (&p_e->m_value) value_type(r_val); in insert_new_imp()
472 p_e->m_hash = r_pos_hash_pair.second; in insert_new_imp()
473 p_e->m_stat = valid_entry_status; in insert_new_imp()
477 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(p_e->m_value));) in insert_new_imp()
[all …]
H A Derase_fn_imps.hpp46 erase_entry(entry_pointer p_e) in erase_entry() argument
48 _GLIBCXX_DEBUG_ASSERT(p_e->m_stat = valid_entry_status); in erase_entry()
49 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(p_e->m_value));) in erase_entry()
50 p_e->m_value.~value_type(); in erase_entry()
51 p_e->m_stat = erased_entry_status; in erase_entry()
63 entry_pointer p_e = &m_entries[pos]; in clear() local
64 if (p_e->m_stat == valid_entry_status) in clear()
65 erase_entry(p_e); in clear()
81 entry_pointer p_e = &m_entries[pos]; in erase_if() local
82 if (p_e->m_stat == valid_entry_status) in erase_if()
[all …]
H A Dinsert_store_hash_fn_imps.hpp63 entry* const p_e = m_entries + pos; in find_ins_pos() local
64 switch(p_e->m_stat) in find_ins_pos()
81 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash, in find_ins_pos()
110 entry_pointer p_e =& m_entries[pos_hash_pair.first]; in insert_imp() local
111 if (p_e->m_stat == valid_entry_status) in insert_imp()
114 return std::make_pair(&p_e->m_value, false); in insert_imp()

123