////////////////////////////////////////////////////////////////////////////// // // (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_NODE_POOL_HPP #define BOOST_CONTAINER_DETAIL_NODE_POOL_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include #include #include #include #include #include #include #include //std::unary_function #include //std::swap #include namespace boost { namespace container { namespace container_detail { //!Pooled memory allocator using single segregated storage. 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 > class private_node_pool //Inherit from the implementation to avoid template bloat : public boost::container::container_detail:: private_node_pool_impl { typedef boost::container::container_detail:: private_node_pool_impl base_t; //Non-copyable private_node_pool(const private_node_pool &); private_node_pool &operator=(const private_node_pool &); public: typedef typename base_t::multiallocation_chain multiallocation_chain; static const std::size_t nodes_per_block = NodesPerBlock; //!Constructor from a segment manager. Never throws private_node_pool() : base_t(0, NodeSize, NodesPerBlock) {} }; template< std::size_t NodeSize , std::size_t NodesPerBlock > class shared_node_pool : public private_node_pool { private: typedef private_node_pool private_node_allocator_t; public: typedef typename private_node_allocator_t::free_nodes_t free_nodes_t; typedef typename private_node_allocator_t::multiallocation_chain multiallocation_chain; //!Constructor from a segment manager. Never throws shared_node_pool() : private_node_allocator_t(){} //!Destructor. Deallocates all allocated blocks. Never throws ~shared_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(); } //!Deallocates all blocks. Never throws void purge_blocks() { //----------------------- scoped_lock guard(mutex_); //----------------------- private_node_allocator_t::purge_blocks(); } std::size_t num_free_nodes() { //----------------------- scoped_lock guard(mutex_); //----------------------- return private_node_allocator_t::num_free_nodes(); } private: default_mutex mutex_; }; } //namespace container_detail { } //namespace container { } //namespace boost { #include #endif //#ifndef BOOST_CONTAINER_DETAIL_NODE_POOL_HPP