virtual void release (void *);
std::string name() const { return _name; }
-
+ guint available() const { return free_list.read_space(); }
+ guint used() const { return free_list.bufsize() - available(); }
+ guint total() const { return free_list.bufsize(); }
+
protected:
RingBuffer<void*> free_list; ///< a list of pointers to free items within block
std::string _name;
}
bool empty ();
-
+ guint pending_size() const { return pending.read_space(); }
+
+ void flush_pending ();
+ void flush_pending_with_ev (void*);
+
private:
RingBuffer<void*> pending;
PerThreadPool* _parent;
}
-void*
-CrossThreadPool::alloc ()
+void
+CrossThreadPool::flush_pending_with_ev (void *ptr)
{
- void* ptr;
+ push (ptr);
+ flush_pending ();
+}
- DEBUG_TRACE (DEBUG::Pool, string_compose ("%1 %2 has %3 pending free entries waiting\n", pthread_name(), name(), pending.read_space()));
+void
+CrossThreadPool::flush_pending ()
+{
+ void* ptr;
+ bool did_release = false;
+
+ DEBUG_TRACE (DEBUG::Pool, string_compose ("%1 %2 has %3 pending free entries waiting, status size %4 free %5 used %6\n", pthread_name(), name(), pending.read_space(),
+ total(), available(), used()));
+
while (pending.read (&ptr, 1) == 1) {
DEBUG_TRACE (DEBUG::Pool, string_compose ("%1 %2 pushes back a pending free list entry before allocating\n", pthread_name(), name()));
free_list.write (&ptr, 1);
+ did_release = true;
+ }
+
+ if (did_release) {
+ DEBUG_TRACE (DEBUG::Pool, string_compose ("Pool size: %1 free %2 used %3 pending now %4\n", total(), available(), used(), pending_size()));
}
+}
+
+void*
+CrossThreadPool::alloc ()
+{
+ /* process anything waiting to be deleted (i.e. moved back to the free list) */
+ flush_pending ();
+ /* now allocate from the potentially larger free list */
return Pool::alloc ();
}