| /freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| D | insert_join_fn_imps.hpp | 108 rec_join_prep(const_node_pointer p_l, const_node_pointer p_r, split_join_branch_bag& r_bag) in rec_join_prep() argument 110 if (p_l->m_type == pat_trie_leaf_node_type) in rec_join_prep() 114 rec_join_prep(static_cast<const_leaf_pointer>(p_l), in rec_join_prep() 120 rec_join_prep(static_cast<const_leaf_pointer>(p_l), in rec_join_prep() 125 _GLIBCXX_DEBUG_ASSERT(p_l->m_type == pat_trie_internal_node_type); in rec_join_prep() 128 rec_join_prep(static_cast<const_internal_node_pointer>(p_l), in rec_join_prep() 135 rec_join_prep(static_cast<const_internal_node_pointer>(p_l), in rec_join_prep() 163 rec_join_prep(const_internal_node_pointer p_l, const_internal_node_pointer p_r, in rec_join_prep() argument 166 if (p_l->get_e_ind() == p_r->get_e_ind() && in rec_join_prep() 167 synth_e_access_traits::equal_prefixes(p_l->pref_b_it(), p_l->pref_e_it(), in rec_join_prep() [all …]
|
| D | erase_fn_imps.hpp | 123 actual_erase_leaf(leaf_pointer p_l) in actual_erase_leaf() argument 127 _GLIBCXX_DEBUG_ONLY(erase_existing(PB_DS_V2F(p_l->value()))); in actual_erase_leaf() 128 p_l->~leaf(); in actual_erase_leaf() 129 s_leaf_allocator.deallocate(p_l, 1); in actual_erase_leaf() 277 erase_leaf(leaf_pointer p_l) in erase_leaf() argument 279 update_min_max_for_erased_leaf(p_l); in erase_leaf() 280 if (p_l->m_p_parent->m_type == pat_trie_head_node_type) in erase_leaf() 288 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == in erase_leaf() 292 static_cast<internal_node_pointer>(p_l->m_p_parent); in erase_leaf() 294 p_parent->remove_child(p_l); in erase_leaf() [all …]
|
| /freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
| D | erase_fn_imps.hpp | 64 entry_pointer p_l = m_p_l; in erase() local 65 while (p_l->m_p_next != NULL) in erase() 66 if (s_eq_fn(r_key, PB_DS_V2F(p_l->m_p_next->m_value))) in erase() 68 erase_next(p_l); in erase() 72 p_l = p_l->m_p_next; in erase() 103 entry_pointer p_l = m_p_l; in erase_if() local 104 while (p_l->m_p_next != NULL) in erase_if() 106 if (pred(p_l->m_p_next->m_value)) in erase_if() 109 erase_next(p_l); in erase_if() 112 p_l = p_l->m_p_next; in erase_if() [all …]
|
| D | insert_fn_imps.hpp | 55 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); in insert() 57 if (p_l != NULL) in insert() 60 return std::make_pair(point_iterator(&p_l->m_value), false); in insert() 65 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); in insert() 66 p_l->m_p_next = m_p_l; in insert() 67 m_p_l = p_l; in insert() 69 return std::make_pair(point_iterator(&p_l->m_value), true); in insert() 77 entry_pointer p_l = s_entry_allocator.allocate(1); in allocate_new_entry() local 78 cond_dealtor_t cond(p_l); in allocate_new_entry() 79 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value))) in allocate_new_entry() [all …]
|
| D | find_fn_imps.hpp | 61 entry_pointer p_l = m_p_l; in find_imp() local 62 while (p_l->m_p_next != NULL) in find_imp() 64 entry_pointer p_next = p_l->m_p_next; in find_imp() 69 p_l->m_p_next = p_next->m_p_next; in find_imp() 77 p_l = p_next; in find_imp() 88 apply_update(entry_pointer p_l, type_to_type<Metadata>) in apply_update() argument 89 { return s_update_policy(p_l->m_update_metadata); } in apply_update()
|
| D | constructor_destructor_fn_imps.hpp | 100 entry_pointer p_l = allocate_new_entry(*it, in PB_DS_CLASS_NAME() local 103 p_l->m_p_next = m_p_l; in PB_DS_CLASS_NAME() 104 m_p_l = p_l; in PB_DS_CLASS_NAME() 133 entry_pointer p_l = m_p_l; in deallocate_all() local 134 while (p_l != NULL) in deallocate_all() 136 entry_pointer p_next_l = p_l->m_p_next; in deallocate_all() 137 actual_erase_entry(p_l); in deallocate_all() 138 p_l = p_next_l; in deallocate_all()
|
| D | trace_fn_imps.hpp | 55 const_entry_pointer p_l = m_p_l; in trace() local 56 while (p_l != NULL) in trace() 58 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; in trace() 59 p_l = p_l->m_p_next; in trace()
|
| /freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
| D | split_join_fn_imps.hpp | 158 find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r) in find_join_pos_right() argument 168 if (p_l->m_red == false) in find_join_pos_right() 174 p_l_parent = p_l; in find_join_pos_right() 175 p_l = p_l->m_p_right; in find_join_pos_right() 178 if (!is_effectively_black(p_l)) in find_join_pos_right() 180 p_l_parent = p_l; in find_join_pos_right() 181 p_l = p_l->m_p_right; in find_join_pos_right() 184 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_l)); in find_join_pos_right() 185 _GLIBCXX_DEBUG_ASSERT(black_height(p_l) == h_r); in find_join_pos_right() 186 _GLIBCXX_DEBUG_ASSERT(p_l == NULL || p_l->m_p_parent == p_l_parent); in find_join_pos_right() [all …]
|
| /freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| D | trace_fn_imps.hpp | 68 trace_list(const_entry_pointer p_l) const in trace_list() 71 while (p_l != NULL) in trace_list() 73 std::cerr << PB_DS_V2F(p_l->m_value) << " "; in trace_list() 74 p_l = p_l->m_p_next; in trace_list()
|
| /freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
| D | erase_fn_imps.hpp | 123 node_pointer p_l = p_nd->m_p_left; in erase_node() local 130 base_type::m_p_head->m_p_parent = p_l; in erase_node() 131 if (p_l != NULL) in erase_node() 132 p_l->m_p_parent = base_type::m_p_head; in erase_node() 147 p_target_r->m_p_left = p_l; in erase_node() 148 if (p_l != NULL) in erase_node() 149 p_l->m_p_parent = p_target_r; in erase_node()
|
| /freebsd-10-stable/lib/msun/src/ |
| D | e_powf.c | 58 float z,ax,z_h,z_l,p_h,p_l; in __ieee754_powf() local 191 p_l = v-(p_h-u); in __ieee754_powf() 193 z_l = cp_l*p_h+p_l*cp+dp_l[k]; in __ieee754_powf() 205 p_l = (y-y1)*t1+y*t2; in __ieee754_powf() 207 z = p_l+p_h; in __ieee754_powf() 212 if(p_l+ovt>z-p_h) return sn*huge*huge; /* overflow */ in __ieee754_powf() 217 if(p_l<=z-p_h) return sn*tiny*tiny; /* underflow */ in __ieee754_powf() 233 t = p_l+p_h; in __ieee754_powf() 237 v = (p_l-(t-p_h))*lg2+t*lg2_l; in __ieee754_powf()
|
| D | e_pow.c | 99 double z,ax,z_h,z_l,p_h,p_l; in __ieee754_pow() local 246 p_l = v-(p_h-u); in __ieee754_pow() 248 z_l = cp_l*p_h+p_l*cp+dp_l[k]; in __ieee754_pow() 259 p_l = (y-y1)*t1+y*t2; in __ieee754_pow() 261 z = p_l+p_h; in __ieee754_pow() 267 if(p_l+ovt>z-p_h) return s*huge*huge; /* overflow */ in __ieee754_pow() 273 if(p_l<=z-p_h) return s*tiny*tiny; /* underflow */ in __ieee754_pow() 291 t = p_l+p_h; in __ieee754_pow() 294 v = (p_l-(t-p_h))*lg2+t*lg2_l; in __ieee754_pow()
|