| /third_party/boost/boost/container/detail/ |
| D | multiallocation_chain.hpp | 147 …void_pointer incorporate_after(iterator after_this, const void_pointer &b, size_type unit_bytes, s… in incorporate_after() function in boost::container::dtl::basic_multiallocation_chain
158 … slist_impl_.incorporate_after(after_this, to_node_ptr(b), to_node_ptr(prev_elem), num_units); in incorporate_after()
163 void incorporate_after(iterator after_this, void_pointer b, void_pointer before_e, size_type n) in incorporate_after() function in boost::container::dtl::basic_multiallocation_chain
164 { slist_impl_.incorporate_after(after_this, to_node_ptr(b), to_node_ptr(before_e), n); } in incorporate_after()
252 void incorporate_after(iterator after_this, pointer b, pointer before_e, size_type n) in incorporate_after() function in boost::container::dtl::transform_multiallocation_chain
253 { this->MultiallocationChain::incorporate_after(after_this.base(), b, before_e, n); } in incorporate_after()
|
| D | adaptive_node_pool_impl.hpp | 633 … (chain.incorporate_after(chain.last(), void_pointer(mem_address), real_node_size, add_to_chain))); in priv_fill_chain_remaining_to_block()
637 …free_nodes.incorporate_after(free_nodes.last(), void_pointer(free_mem_address), real_node_size, fr… in priv_fill_chain_remaining_to_block()
788 chain.incorporate_after(chain.last(), &*it_beg, &*it_bend, num_elems); in priv_allocate_nodes()
795 chain.incorporate_after(chain.last(), &*it_beg, &*it_bend, num_elems); in priv_allocate_nodes()
859 …prev_block_info->free_nodes.incorporate_after(prev_block_info->free_nodes.last(), &*it, &*itbf, sp… in priv_deallocate_nodes()
876 …prev_block_info->free_nodes.incorporate_after(prev_block_info->free_nodes.last(), &*itfirst, &*itl… in priv_deallocate_nodes()
|
| D | node_pool_impl.hpp | 131 chain.incorporate_after(chain.before_begin(), &*first_node, &*last_node, n); in allocate_nodes()
|
| D | node_alloc_holder.hpp | 371 chain.incorporate_after(chain.last(), &*itbeg, &*itlast, n); in allocate_many_and_construct()
|
| /third_party/boost/boost/container/ |
| D | node_allocator.hpp | 229 chain.incorporate_after(chain.before_begin(), (T*)&*ch.begin(), (T*)&*ch.last(), ch.size()); in allocate_individual()
264 chain.incorporate_after( chain.before_begin() in allocate_many()
280 chain.incorporate_after( chain.before_begin() in allocate_many()
|
| D | allocator.hpp | 293 chain.incorporate_after(chain.before_begin() in allocate_many()
314 chain.incorporate_after(chain.before_begin() in allocate_many()
|
| D | stable_vector.hpp | 1933 holder.incorporate_after( holder.before_begin() in priv_clear_pool()
1948 holder.incorporate_after( holder.before_begin() in priv_increase_pool()
1966 holder.incorporate_after( holder.before_begin() in priv_put_in_pool()
1981 ch.incorporate_after( ch.before_begin() in priv_put_in_pool()
1998 holder.incorporate_after( holder.before_begin() in priv_get_from_pool()
2106 holder.incorporate_after( holder.before_begin() in priv_invariant()
|
| /third_party/boost/boost/intrusive/detail/ |
| D | common_slist_algorithms.hpp | 82 BOOST_INTRUSIVE_FORCEINLINE static void incorporate_after(node_ptr bp, node_ptr b, node_ptr be) in incorporate_after() function in boost::intrusive::detail::common_slist_algorithms
|
| /third_party/boost/boost/intrusive/ |
| D | slist.hpp | 1885 void incorporate_after(const_iterator prev_pos, const node_ptr & f, const node_ptr & before_l) in incorporate_after() function in boost::intrusive::slist_impl
1888 …this->incorporate_after(prev_pos, f, before_l, node_algorithms::distance(f.pointed_node(), before_… in incorporate_after()
1909 …void incorporate_after(const_iterator prev_pos, const node_ptr & f, const node_ptr & before_l, siz… in incorporate_after() function in boost::intrusive::slist_impl
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|