Home
last modified time | relevance | path

Searched refs:m_entries (Results 1 – 25 of 60) sorted by relevance

123

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dhash-table.h496 if (Lazy && m_entries == NULL) in begin()
498 iterator iter (m_entries, m_entries + m_size); in begin()
555 typename Descriptor::value_type *m_entries; variable
626 m_entries = NULL; in hash_table()
628 m_entries = alloc_entries (size PASS_MEM_STAT); in hash_table()
655 if (Lazy && h.m_entries == NULL) in hash_table()
656 m_entries = NULL; in hash_table()
662 value_type &entry = h.m_entries[i]; in hash_table()
668 m_entries = nentries; in hash_table()
678 if (!Lazy || m_entries) in ~hash_table()
[all …]
H A Dgimple-if-to-switch.cc104 if_chain (): m_entries () in if_chain()
106 m_entries.create (2); in if_chain()
112 m_entries.release (); in ~if_chain()
123 vec<condition_info *> m_entries; member
143 for (unsigned i = 0; i < m_entries.length (); i++) in check_non_overlapping_cases()
144 for (unsigned j = 0; j < m_entries[i]->m_ranges.length (); j++) in check_non_overlapping_cases()
145 all_ranges.safe_push (&m_entries[i]->m_ranges[j]); in check_non_overlapping_cases()
195 clusters.create (m_entries.length ()); in is_beneficial()
197 for (unsigned i = 0; i < m_entries.length (); i++) in is_beneficial()
199 condition_info *info = m_entries[i]; in is_beneficial()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dhash-table.h496 if (Lazy && m_entries == NULL) in begin()
498 iterator iter (m_entries, m_entries + m_size); in begin()
555 typename Descriptor::value_type *m_entries; variable
626 m_entries = NULL; in hash_table()
628 m_entries = alloc_entries (size PASS_MEM_STAT); in hash_table()
655 if (Lazy && h.m_entries == NULL) in hash_table()
656 m_entries = NULL; in hash_table()
662 value_type &entry = h.m_entries[i]; in hash_table()
668 m_entries = nentries; in hash_table()
678 if (!Lazy || m_entries) in ~hash_table()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/
H A Dconstructor_destructor_fn_imps.hpp63 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
74 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
86 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
100 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
114 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
129 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
146 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
149 m_entries[i].m_stat = (entry_status)empty_entry_status; in PB_DS_GP_HASH_NAME()
155 m_entries[i].m_stat = other.m_entries[i].m_stat; in PB_DS_GP_HASH_NAME()
156 if (m_entries[i].m_stat == valid_entry_status) in PB_DS_GP_HASH_NAME()
[all …]
H A Dgp_ht_map_.hpp440 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status); in insert_new_imp()
446 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status); in insert_new_imp()
447 entry* const p_e = m_entries + pos; in insert_new_imp()
460 _GLIBCXX_DEBUG_ASSERT(m_entries[r_pos_hash_pair.first].m_stat != in insert_new_imp()
467 _GLIBCXX_DEBUG_ASSERT(m_entries[r_pos_hash_pair.first].m_stat != in insert_new_imp()
470 entry* const p_e = m_entries + r_pos_hash_pair.first; in insert_new_imp()
491 entry_pointer p_e = &m_entries[pos]; in subscript_imp()
507 if (m_entries[pos_hash_pair.first].m_stat != valid_entry_status) in subscript_imp()
512 return (m_entries + pos_hash_pair.first)->m_value.second; in subscript_imp()
528 entry* const p_e = m_entries + pos; in find_key_pointer()
[all …]
H A Dresize_fn_imps.hpp122 erase_all_valid_entries(m_entries, old_size); in resize_imp()
123 s_entry_allocator.deallocate(m_entries, old_size); in resize_imp()
124 m_entries = a_entries_resized; in resize_imp()
134 if (m_entries[pos].m_stat == valid_entry_status) in resize_imp()
135 resize_imp_reassign(m_entries + pos, a_entries_resized, in resize_imp()
H A Dinsert_no_store_hash_fn_imps.hpp61 entry* const p_e = m_entries + pos; in find_ins_pos()
104 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
107 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp50 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k; in constructor_insert_new_imp()
51 entry* const p_e = m_entries + pos; in constructor_insert_new_imp()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/
H A Dconstructor_destructor_fn_imps.hpp63 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
74 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
86 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
100 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
114 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
129 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
146 m_entries(s_entry_allocator.allocate(m_num_e)) in PB_DS_GP_HASH_NAME()
149 m_entries[i].m_stat = (entry_status)empty_entry_status; in PB_DS_GP_HASH_NAME()
155 m_entries[i].m_stat = other.m_entries[i].m_stat; in PB_DS_GP_HASH_NAME()
156 if (m_entries[i].m_stat == valid_entry_status) in PB_DS_GP_HASH_NAME()
[all …]
H A Dgp_ht_map_.hpp440 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status); in insert_new_imp()
446 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status); in insert_new_imp()
447 entry* const p_e = m_entries + pos; in insert_new_imp()
460 _GLIBCXX_DEBUG_ASSERT(m_entries[r_pos_hash_pair.first].m_stat != in insert_new_imp()
467 _GLIBCXX_DEBUG_ASSERT(m_entries[r_pos_hash_pair.first].m_stat != in insert_new_imp()
470 entry* const p_e = m_entries + r_pos_hash_pair.first; in insert_new_imp()
491 entry_pointer p_e = &m_entries[pos]; in subscript_imp()
507 if (m_entries[pos_hash_pair.first].m_stat != valid_entry_status) in subscript_imp()
512 return (m_entries + pos_hash_pair.first)->m_value.second; in subscript_imp()
528 entry* const p_e = m_entries + pos; in find_key_pointer()
[all …]
H A Dresize_fn_imps.hpp122 erase_all_valid_entries(m_entries, old_size); in resize_imp()
123 s_entry_allocator.deallocate(m_entries, old_size); in resize_imp()
124 m_entries = a_entries_resized; in resize_imp()
134 if (m_entries[pos].m_stat == valid_entry_status) in resize_imp()
135 resize_imp_reassign(m_entries + pos, a_entries_resized, in resize_imp()
H A Dinsert_no_store_hash_fn_imps.hpp61 entry* const p_e = m_entries + pos; in find_ins_pos()
104 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
107 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp50 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k; in constructor_insert_new_imp()
51 entry* const p_e = m_entries + pos; in constructor_insert_new_imp()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Dconstructor_destructor_fn_imps.hpp67 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
78 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
90 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
92 std::fill(m_entries, m_entries + m_num_e, (entry_pointer)0); in PB_DS_CC_HASH_NAME()
106 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
122 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
134 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
163 std::swap(m_entries, other.m_entries); in swap()
181 s_entry_pointer_allocator.deallocate(m_entries, m_num_e); in deallocate_all()
189 std::fill(m_entries, m_entries + m_num_e, entry_pointer(0)); in initialize()
H A Derase_fn_imps.hpp66 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
69 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
70 erase_entry_pointer(m_entries[pos]); in erase_if()
71 m_entries[pos] = p_next_e; in erase_if()
74 entry_pointer p_e = m_entries[pos]; in erase_if()
97 while (m_entries[pos] != 0) in clear()
98 erase_entry_pointer(m_entries[pos]); in clear()
H A Dcc_ht_map_.hpp418 entry_pointer p_e = m_entries[pos]; in subscript_imp()
444 entry_pointer p_e = m_entries[pos_hash_pair.first]; in subscript_imp()
484 p_e->m_p_next = m_entries[pos]; in insert_new_imp()
485 m_entries[pos] = p_e; in insert_new_imp()
505 p_e->m_p_next = m_entries[r_pos_hash_pair.first]; in insert_new_imp()
506 m_entries[r_pos_hash_pair.first] = p_e; in insert_new_imp()
516 entry_pointer p_e = m_entries[ranged_hash_fn_base::operator()(r_key)]; in find_key_pointer()
543 entry_pointer p_e = m_entries[pos_hash_pair.first]; in find_key_pointer()
599 if (m_entries[r_pos.second] != 0) in inc_it_state()
601 r_pos.first = m_entries[r_pos.second]; in inc_it_state()
[all …]
H A Dresize_fn_imps.hpp121 entry_pointer p_e = m_entries[pos]; in resize_imp_no_exceptions()
129 s_entry_pointer_allocator.deallocate(m_entries, old_size); in resize_imp_no_exceptions()
130 m_entries = a_p_entries_resized; in resize_imp_no_exceptions()
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp54 p->m_p_next = m_entries[pos]; in constructor_insert_new_imp()
55 m_entries[pos] = p; in constructor_insert_new_imp()
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Dconstructor_destructor_fn_imps.hpp67 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
78 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
90 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
92 std::fill(m_entries, m_entries + m_num_e, (entry_pointer)0); in PB_DS_CC_HASH_NAME()
106 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
122 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
134 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) in PB_DS_CC_HASH_NAME()
163 std::swap(m_entries, other.m_entries); in swap()
181 s_entry_pointer_allocator.deallocate(m_entries, m_num_e); in deallocate_all()
189 std::fill(m_entries, m_entries + m_num_e, entry_pointer(0)); in initialize()
H A Derase_fn_imps.hpp66 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
69 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
70 erase_entry_pointer(m_entries[pos]); in erase_if()
71 m_entries[pos] = p_next_e; in erase_if()
74 entry_pointer p_e = m_entries[pos]; in erase_if()
97 while (m_entries[pos] != 0) in clear()
98 erase_entry_pointer(m_entries[pos]); in clear()
H A Dcc_ht_map_.hpp418 entry_pointer p_e = m_entries[pos]; in subscript_imp()
444 entry_pointer p_e = m_entries[pos_hash_pair.first]; in subscript_imp()
484 p_e->m_p_next = m_entries[pos]; in insert_new_imp()
485 m_entries[pos] = p_e; in insert_new_imp()
505 p_e->m_p_next = m_entries[r_pos_hash_pair.first]; in insert_new_imp()
506 m_entries[r_pos_hash_pair.first] = p_e; in insert_new_imp()
516 entry_pointer p_e = m_entries[ranged_hash_fn_base::operator()(r_key)]; in find_key_pointer()
543 entry_pointer p_e = m_entries[pos_hash_pair.first]; in find_key_pointer()
599 if (m_entries[r_pos.second] != 0) in inc_it_state()
601 r_pos.first = m_entries[r_pos.second]; in inc_it_state()
[all …]
H A Dresize_fn_imps.hpp121 entry_pointer p_e = m_entries[pos]; in resize_imp_no_exceptions()
129 s_entry_pointer_allocator.deallocate(m_entries, old_size); in resize_imp_no_exceptions()
130 m_entries = a_p_entries_resized; in resize_imp_no_exceptions()
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp54 p->m_p_next = m_entries[pos]; in constructor_insert_new_imp()
55 m_entries[pos] = p; in constructor_insert_new_imp()
H A Dconstructor_destructor_store_hash_fn_imps.hpp53 p->m_p_next = m_entries[pos]; in constructor_insert_new_imp()
56 m_entries[pos] = p; in constructor_insert_new_imp()
/netbsd-src/external/bsd/openldap/dist/contrib/ldapc++/src/
H A DLDAPEntryList.cpp15 m_entries = e.m_entries; in LDAPEntryList()
22 return m_entries.size(); in size()
26 return m_entries.empty(); in empty()
30 return m_entries.begin(); in begin()
34 return m_entries.end(); in end()
38 m_entries.push_back(e); in addEntry()

123