FM / detail

/usr/include/boost/container/detail

Name	Size	Mode	Actions
adaptive_node_pool.hpp	5569	0644	edit dl rm
adaptive_node_pool_impl.hpp	54088	0644	edit dl rm
addressof.hpp	1063	0644	edit dl rm
advanced_insert_int.hpp	17668	0644	edit dl rm
algorithm.hpp	3880	0644	edit dl rm
allocation_type.hpp	2017	0644	edit dl rm
allocator_version_traits.hpp	5632	0644	edit dl rm
alloc_helpers.hpp	1867	0644	edit dl rm
alloc_lib.h	11742	0644	edit dl rm
auto_link.hpp	1657	0644	edit dl rm
block_list.hpp	4199	0644	edit dl rm
block_slist.hpp	4503	0644	edit dl rm
compare_functors.hpp	3992	0644	edit dl rm
config_begin.hpp	3637	0644	edit dl rm
config_end.hpp	480	0644	edit dl rm
construct_in_place.hpp	2952	0644	edit dl rm
container_or_allocator_rebind.hpp	1743	0644	edit dl rm
container_rebind.hpp	6610	0644	edit dl rm
copy_move_algo.hpp	38531	0644	edit dl rm
destroyers.hpp	9338	0644	edit dl rm
dispatch_uses_allocator.hpp	19733	0644	edit dl rm
dlmalloc.hpp	3444	0644	edit dl rm
flat_tree.hpp	61663	0644	edit dl rm
function_detector.hpp	3558	0644	edit dl rm
is_container.hpp	2213	0644	edit dl rm
is_contiguous_container.hpp	1712	0644	edit dl rm
is_sorted.hpp	1465	0644	edit dl rm
iterator.hpp	2590	0644	edit dl rm
iterators.hpp	29882	0644	edit dl rm
iterator_to_raw_pointer.hpp	971	0644	edit dl rm
math_functions.hpp	3872	0644	edit dl rm
minimal_char_traits_header.hpp	1057	0644	edit dl rm
min_max.hpp	997	0644	edit dl rm
mpl.hpp	3834	0644	edit dl rm
multiallocation_chain.hpp	10317	0644	edit dl rm
mutex.hpp	8665	0644	edit dl rm
next_capacity.hpp	2140	0644	edit dl rm
node_alloc_holder.hpp	17651	0644	edit dl rm
node_pool.hpp	4808	0644	edit dl rm
node_pool_impl.hpp	13171	0644	edit dl rm
pair.hpp	21281	0644	edit dl rm
pair_key_mapped_of_value.hpp	1466	0644	edit dl rm
placement_new.hpp	914	0644	edit dl rm
pool_common.hpp	1606	0644	edit dl rm
pool_common_alloc.hpp	2730	0644	edit dl rm
pool_resource.hpp	7744	0644	edit dl rm
singleton.hpp	4465	0644	edit dl rm
std_fwd.hpp	1450	0644	edit dl rm
thread_mutex.hpp	4449	0644	edit dl rm
transform_iterator.hpp	5103	0644	edit dl rm
tree.hpp	57038	0644	edit dl rm
type_traits.hpp	2714	0644	edit dl rm
value_functors.hpp	1118	0644	edit dl rm
value_init.hpp	1135	0644	edit dl rm
variadic_templates_tools.hpp	4959	0644	edit dl rm
version_type.hpp	2416	0644	edit dl rm
workaround.hpp	4501	0644	edit dl rm

Edit: /usr/include/boost/container/detail/adaptive_node_pool.hpp (5569B)

#ifndef BOOST_CONTAINER_DETAIL_ADAPTIVE_NODE_POOL_HPP
#define BOOST_CONTAINER_DETAIL_ADAPTIVE_NODE_POOL_HPP

#ifndef BOOST_CONFIG_HPP
#  include <boost/config.hpp>
#endif

#if defined(BOOST_HAS_PRAGMA_ONCE)
#  pragma once
#endif

#include <boost/container/detail/config_begin.hpp>
#include <boost/container/detail/workaround.hpp>

#include <boost/intrusive/set.hpp>
#include <boost/container/detail/multiallocation_chain.hpp>
#include <boost/container/detail/pool_common_alloc.hpp>
#include <boost/container/detail/mutex.hpp>
#include <boost/container/detail/adaptive_node_pool_impl.hpp>
#include <boost/container/detail/multiallocation_chain.hpp>
#include <boost/container/detail/type_traits.hpp>

#include <cstddef>
#include <cmath>
#include <cassert>

namespace boost {
namespace container {
namespace dtl {

//!Pooled memory allocator using an smart adaptive pool. Includes
//!a reference count but the class does not delete itself, this is
//!responsibility of user classes. Node size (NodeSize) and the number of
//!nodes allocated per block (NodesPerBlock) are known at compile time.
template< std::size_t NodeSize
        , std::size_t NodesPerBlock
        , std::size_t MaxFreeBlocks
        , std::size_t OverheadPercent
        >
class private_adaptive_node_pool
   :  public private_adaptive_node_pool_impl_ct
            < fake_segment_manager
            , MaxFreeBlocks
            , NodeSize
            , NodesPerBlock
            , OverheadPercent
            , unsigned(OverheadPercent == 0)*::boost::container::adaptive_pool_flag::align_only
               | ::boost::container::adaptive_pool_flag::size_ordered
               | ::boost::container::adaptive_pool_flag::address_ordered
            >
{
   typedef private_adaptive_node_pool_impl_ct
            < fake_segment_manager
            , MaxFreeBlocks
            , NodeSize
            , NodesPerBlock
            , OverheadPercent
            , unsigned(OverheadPercent == 0)*::boost::container::adaptive_pool_flag::align_only
               | ::boost::container::adaptive_pool_flag::size_ordered
               | ::boost::container::adaptive_pool_flag::address_ordered
            > base_t;

//Non-copyable
   private_adaptive_node_pool(const private_adaptive_node_pool &);
   private_adaptive_node_pool &operator=(const private_adaptive_node_pool &);

public:
   static const std::size_t nodes_per_block = NodesPerBlock;

//!Constructor. Never throws
   private_adaptive_node_pool()
      : base_t(0)
   {}
};

//!Pooled memory allocator using adaptive pool. Includes
//!a reference count but the class does not delete itself, this is
//!responsibility of user classes. Node size (NodeSize) and the number of
//!nodes allocated per block (NodesPerBlock) are known at compile time
template< std::size_t NodeSize
        , std::size_t NodesPerBlock
        , std::size_t MaxFreeBlocks
        , std::size_t OverheadPercent
        >
class shared_adaptive_node_pool
   : public private_adaptive_node_pool
      <NodeSize, NodesPerBlock, MaxFreeBlocks, OverheadPercent>
{
 private:
   typedef private_adaptive_node_pool
      <NodeSize, NodesPerBlock, MaxFreeBlocks, OverheadPercent> private_node_allocator_t;
 public:
   typedef typename private_node_allocator_t::multiallocation_chain multiallocation_chain;

//!Constructor. Never throws
   shared_adaptive_node_pool()
   : private_node_allocator_t(){}

//!Destructor. Deallocates all allocated blocks. Never throws
   ~shared_adaptive_node_pool()
   {}

//!Allocates array of count elements. Can throw std::bad_alloc
   void *allocate_node()
   {
      //-----------------------
      scoped_lock<default_mutex> guard(mutex_);
      //-----------------------
      return private_node_allocator_t::allocate_node();
   }

//!Deallocates an array pointed by ptr. Never throws
   void deallocate_node(void *ptr)
   {
      //-----------------------
      scoped_lock<default_mutex> guard(mutex_);
      //-----------------------
      private_node_allocator_t::deallocate_node(ptr);
   }

//!Allocates a singly linked list of n nodes ending in null pointer.
   //!can throw std::bad_alloc
   void allocate_nodes(const std::size_t n, multiallocation_chain &chain)
   {
      //-----------------------
      scoped_lock<default_mutex> guard(mutex_);
      //-----------------------
      return private_node_allocator_t::allocate_nodes(n, chain);
   }

void deallocate_nodes(multiallocation_chain &chain)
   {
      //-----------------------
      scoped_lock<default_mutex> guard(mutex_);
      //-----------------------
      private_node_allocator_t::deallocate_nodes(chain);
   }

//!Deallocates all the free blocks of memory. Never throws
   void deallocate_free_blocks()
   {
      //-----------------------
      scoped_lock<default_mutex> guard(mutex_);
      //-----------------------
      private_node_allocator_t::deallocate_free_blocks();
   }

private:
   default_mutex mutex_;
};

}  //namespace dtl {
}  //namespace container {
}  //namespace boost {

#include <boost/container/detail/config_end.hpp>

#endif   //#ifndef BOOST_CONTAINER_DETAIL_ADAPTIVE_NODE_POOL_HPP

////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/container for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_CONTAINER_DETAIL_ADAPTIVE_NODE_POOL_HPP #define BOOST_CONTAINER_DETAIL_ADAPTIVE_NODE_POOL_HPP #ifndef BOOST_CONFIG_HPP # include #endif #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace container { namespace dtl { //!Pooled memory allocator using an smart adaptive pool. Includes //!a reference count but the class does not delete itself, this is //!responsibility of user classes. Node size (NodeSize) and the number of //!nodes allocated per block (NodesPerBlock) are known at compile time. template< std::size_t NodeSize , std::size_t NodesPerBlock , std::size_t MaxFreeBlocks , std::size_t OverheadPercent > class private_adaptive_node_pool : public private_adaptive_node_pool_impl_ct < fake_segment_manager , MaxFreeBlocks , NodeSize , NodesPerBlock , OverheadPercent , unsigned(OverheadPercent == 0)*::boost::container::adaptive_pool_flag::align_only | ::boost::container::adaptive_pool_flag::size_ordered | ::boost::container::adaptive_pool_flag::address_ordered > { typedef private_adaptive_node_pool_impl_ct < fake_segment_manager , MaxFreeBlocks , NodeSize , NodesPerBlock , OverheadPercent , unsigned(OverheadPercent == 0)*::boost::container::adaptive_pool_flag::align_only | ::boost::container::adaptive_pool_flag::size_ordered | ::boost::container::adaptive_pool_flag::address_ordered > base_t; //Non-copyable private_adaptive_node_pool(const private_adaptive_node_pool &); private_adaptive_node_pool &operator=(const private_adaptive_node_pool &); public: static const std::size_t nodes_per_block = NodesPerBlock; //!Constructor. Never throws private_adaptive_node_pool() : base_t(0) {} }; //!Pooled memory allocator using adaptive pool. Includes //!a reference count but the class does not delete itself, this is //!responsibility of user classes. Node size (NodeSize) and the number of //!nodes allocated per block (NodesPerBlock) are known at compile time template< std::size_t NodeSize , std::size_t NodesPerBlock , std::size_t MaxFreeBlocks , std::size_t OverheadPercent > class shared_adaptive_node_pool : public private_adaptive_node_pool { private: typedef private_adaptive_node_pool private_node_allocator_t; public: typedef typename private_node_allocator_t::multiallocation_chain multiallocation_chain; //!Constructor. Never throws shared_adaptive_node_pool() : private_node_allocator_t(){} //!Destructor. Deallocates all allocated blocks. Never throws ~shared_adaptive_node_pool() {} //!Allocates array of count elements. Can throw std::bad_alloc void *allocate_node() { //----------------------- scoped_lock guard(mutex_); //----------------------- return private_node_allocator_t::allocate_node(); } //!Deallocates an array pointed by ptr. Never throws void deallocate_node(void *ptr) { //----------------------- scoped_lock guard(mutex_); //----------------------- private_node_allocator_t::deallocate_node(ptr); } //!Allocates a singly linked list of n nodes ending in null pointer. //!can throw std::bad_alloc void allocate_nodes(const std::size_t n, multiallocation_chain &chain) { //----------------------- scoped_lock guard(mutex_); //----------------------- return private_node_allocator_t::allocate_nodes(n, chain); } void deallocate_nodes(multiallocation_chain &chain) { //----------------------- scoped_lock guard(mutex_); //----------------------- private_node_allocator_t::deallocate_nodes(chain); } //!Deallocates all the free blocks of memory. Never throws void deallocate_free_blocks() { //----------------------- scoped_lock guard(mutex_); //----------------------- private_node_allocator_t::deallocate_free_blocks(); } private: default_mutex mutex_; }; } //namespace dtl { } //namespace container { } //namespace boost { #include #endif //#ifndef BOOST_CONTAINER_DETAIL_ADAPTIVE_NODE_POOL_HPP