![]() |
Home | Libraries | People | FAQ | More |
boost::interprocess::private_adaptive_pool
// In header: <boost/interprocess/allocators/private_adaptive_pool.hpp> template<typename T, typename SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent> class private_adaptive_pool { public: // types typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; // member classes/structs/unions template<typename T2> struct rebind { // types typedef private_adaptive_pool< ; }; // construct/copy/destruct (); (private_adaptive_pool &); template<typename T2> (private_adaptive_pool< ); template<typename T2, typename SegmentManager2, N2, F2, OP2> private_adaptive_pool & (private_adaptive_pool< ); private_adaptive_pool & (private_adaptive_pool &); ~(); // public member functions () ; () ; () ; (, = ); (, ); (); () ; () ; (, ); (); () ; (, , , ); (, , ); (, , ); (); (); (, ); (); (); // friend functions (, ); };
An STL node allocator that uses a segment manager as memory source. The internal pointer type will of the same type (raw, smart) as "typename SegmentManager::void_pointer" type. This allows placing the allocator in shared memory, memory mapped-files, etc... This allocator has its own node pool.
NodesPerBlock is the minimum number of nodes of nodes allocated at once when the allocator needs runs out of nodes. MaxFreeBlocks is the maximum number of totally free blocks that the adaptive node pool will hold. The rest of the totally free blocks will be deallocated with the segment manager.
OverheadPercent is the (approximated) maximum size overhead (1-20%) of the allocator: (memory usable for nodes / total memory allocated from the segment manager)
private_adaptive_pool
public
construct/copy/destruct( segment_mngr);
Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc
(private_adaptive_pool & other);
Copy constructor from other private_adaptive_pool
. Increments the reference count of the associated node pool. Never throws
template<typename T2> (private_adaptive_pool< other);
Copy constructor from related private_adaptive_pool
. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc
template<typename T2, typename SegmentManager2, N2, F2, OP2> private_adaptive_pool & (private_adaptive_pool< );
Not assignable from related private_adaptive_pool
private_adaptive_pool & (private_adaptive_pool &);
Not assignable from other private_adaptive_pool
~();
Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws
private_adaptive_pool
public member functions() ;
Returns a pointer to the node pool. Never throws
() ;
Returns the segment manager. Never throws
() ;
Returns the number of elements that could be allocated. Never throws
( count, hint = );
Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc
if there is no enough memory
( ptr, count);
Deallocate allocated memory. Never throws
();
Deallocates all free blocks of the pool
( value) ;
Returns address of mutable object. Never throws
( value) ;
Returns address of non mutable object. Never throws
( ptr, v);
Copy construct an object. Throws if T's copy constructor throws
( ptr);
Destroys object. Throws if object's destructor throws
( p) ;
Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.
( command, limit_size, prefer_in_recvd_out_size, reuse);
( elem_size, num_elements, chain);
Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...)
( elem_sizes, n_elements, chain);
Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated
( chain);
Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...)
();
Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc
if there is no enough memory
( num_elements, chain);
Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one().
( p);
Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws
( chain);
Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one().