#include <pool.h>
Inheritance diagram for CrossThreadPool:
Public Member Functions | |
| CrossThreadPool (std::string n, unsigned long isize, unsigned long nitems, PerThreadPool *) | |
| void * | alloc () |
| void | push (void *) |
| PerThreadPool * | parent () const |
| bool | empty () |
| guint | pending_size () const |
| void | flush_pending () |
| void | flush_pending_with_ev (void *) |
 Public Member Functions inherited from Pool | |
| Pool (std::string name, unsigned long item_size, unsigned long nitems) | |
| virtual | ~Pool () |
| virtual void | release (void *) |
| std::string | name () const |
| guint | available () const |
| guint | used () const |
| guint | total () const |
Private Attributes | |
| RingBuffer< void * > | pending |
| PerThreadPool * | _parent |
Additional Inherited Members | |
| Protected Attributes inherited from Pool | |
| RingBuffer< void * > | free_list |
| a list of pointers to free items within block More... | |
| std::string | _name |
Detailed Description
Management of a per-thread pool of data that is allocated by one thread and freed by one other thread. Not safe for use when there is more than 1 reader and 1 writer.
This is basically a wrapper around a thread-local storage instance of a ringbuffer, made safe for use in the case where multiple threads allocate from the ringbuffer and a single thread "frees" the allocations.
Rather than using locks, each thread has its own ringbuffer (and associated data), and so it calls alloc(), passes a pointer to the result of the alloc to another thread, which later calls push() to "free" it.
Constructor & Destructor Documentation
| CrossThreadPool::CrossThreadPool | ( | std::string | n, |
| unsigned long | isize, | ||
| unsigned long | nitems, | ||
| PerThreadPool * | |||
| ) |
Member Function Documentation
|
virtual |
| bool CrossThreadPool::empty | ( | ) |
|
inline |
Member Data Documentation
|
private |
|
private |
The documentation for this class was generated from the following files:
