Ticket #3976: pool_valgrind_2.patch

boost/pool/pool.hpp

@@ -33 +33 @@
 // boost::simple_segregated_storage
 #include <boost/pool/simple_segregated_storage.hpp>
 
+#ifdef VALGRIND
+#include <valgrind/memcheck.h>
+#endif // VALGRIND
+
 #ifdef BOOST_NO_STDC_NAMESPACE
  namespace std { using ::malloc; using ::free; }
 #endif
@@ -194 +198 @@
     explicit pool(const size_type nrequested_size,
         const size_type nnext_size = 32)
     :list(0, 0), requested_size(nrequested_size), next_size(nnext_size), start_size(nnext_size)
-    { }
+    {
+#ifdef VALGRIND
+      VALGRIND_CREATE_MEMPOOL(this, 0, 0);
+#endif // VALGRIND
+    }
 
-    ~pool() { purge_memory(); }
+    ~pool() {
+      purge_memory();
+#ifdef VALGRIND
+      VALGRIND_DESTROY_MEMPOOL(this);
+#endif // VALGRIND
+    }
 
     // Releases memory blocks that don't have chunks allocated
     // pre: lists are ordered
@@ -218 +231 @@
     // Returns 0 if out-of-memory
     void * malloc()
     {
+      void * result = 0;
       // Look for a non-empty storage
       if (!store().empty())
-        return store().malloc();
-      return malloc_need_resize();
+        result = store().malloc();
+      else
+        result = malloc_need_resize();
+#ifdef VALGRIND
+      if (result != 0)
+        VALGRIND_MEMPOOL_ALLOC(this, result, requested_size);
+#endif // VALGRIND
+      return result;
     }
 
     void * ordered_malloc()
     {
+      void * result = 0;
       // Look for a non-empty storage
       if (!store().empty())
-        return store().malloc();
-      return ordered_malloc_need_resize();
+        result = store().malloc();
+      else
+        result = ordered_malloc_need_resize();
+#ifdef VALGRIND
+      if (result != 0)
+        VALGRIND_MEMPOOL_ALLOC(this, result, requested_size);
+#endif // VALGRIND
+      return result;
     }
 
     // Returns 0 if out-of-memory
@@ -239 +266 @@
     // pre: 'chunk' must have been previously
     //        returned by *this.malloc().
     void free(void * const chunk)
-    { store().free(chunk); }
+    {
+      store().free(chunk);
+#ifdef VALGRIND
+      VALGRIND_MEMPOOL_FREE(this, chunk);
+#endif // VALGRIND
+    }
 
     // pre: 'chunk' must have been previously
     //        returned by *this.malloc().
     void ordered_free(void * const chunk)
-    { store().ordered_free(chunk); }
+    {
+      store().ordered_free(chunk);
+#ifdef VALGRIND
+      VALGRIND_MEMPOOL_FREE(this, chunk);
+#endif // VALGRIND
+    }
 
     // pre: 'chunk' must have been previously
     //        returned by *this.malloc(n).
@@ -256 +293 @@
           ((total_req_size % partition_size) ? true : false);
 
       store().free_n(chunks, num_chunks, partition_size);
+#ifdef VALGRIND
+      VALGRIND_MEMPOOL_FREE(this, chunks);
+#endif // VALGRIND
     }
 
     // pre: 'chunk' must have been previously
@@ -268 +308 @@
           ((total_req_size % partition_size) ? true : false);
 
       store().ordered_free_n(chunks, num_chunks, partition_size);
+#ifdef VALGRIND
+      VALGRIND_MEMPOOL_FREE(this, chunks);
+#endif // VALGRIND
     }
 
     // is_from() tests a chunk to determine if it was allocated from *this
@@ -421 +464 @@
   } while (iter.valid());
 
   list.invalidate();
-  this->first = 0;
+  BOOST_POOL_WITH_DEFINED(this->first,
+    this->first = 0;
+  );
   next_size = start_size;
 
+#ifdef VALGRIND
+  VALGRIND_MEMPOOL_TRIM(this, 0, 0);
+#endif // VALGRIND
+
   return true;
 }
 
@@ -510 +559 @@
 
   void * ret = store().malloc_n(num_chunks, partition_size);
 
-  if (ret != 0)
+  if (ret != 0) {
+#ifdef VALGRIND
+    VALGRIND_MEMPOOL_ALLOC(this, ret, total_req_size);
+#endif // VALGRIND
     return ret;
+  }
 
   // Not enougn memory in our storages; make a new storage,
   BOOST_USING_STD_MAX();
@@ -521 +574 @@
   char * const ptr = UserAllocator::malloc(POD_size);
   if (ptr == 0)
     return 0;
+
+#ifdef VALGRIND
+  VALGRIND_MAKE_MEM_NOACCESS(ptr, POD_size);
+#endif // VALGRIND
+
   const details::PODptr<size_type> node(ptr, POD_size);
 
   // Split up block so we can use what wasn't requested
@@ -559 +617 @@
     prev.next(node);
   }
 
+#ifdef VALGRIND
+    VALGRIND_MEMPOOL_ALLOC(this, node.begin(), total_req_size);
+#endif // VALGRIND
+
   //  and return it.
   return node.begin();
 }

boost/pool/simple_segregated_storage.hpp

@@ -14 +14 @@
 
 #include <boost/pool/poolfwd.hpp>
 
+#ifdef VALGRIND
+#include <valgrind/memcheck.h>
+
+#define BOOST_POOL_WITH_DEFINED(expr, body) \
+  do { \
+    VALGRIND_MAKE_MEM_DEFINED(&(expr), sizeof((expr))); \
+    do {body} while (0); \
+    VALGRIND_MAKE_MEM_NOACCESS(&(expr), sizeof((expr))); \
+  } while (0)
+#else // VALGRIND
+#define BOOST_POOL_WITH_DEFINED(expr, body) do {body} while (0)
+#endif // !VALGRIND
+
 namespace boost {
 
 template <typename SizeType>
@@ -82 +95 @@
       //  in the proper order
 
       // Find where "block" would go in the free list
-      void * const loc = find_prev(block);
+      void * loc = 0;
+      BOOST_POOL_WITH_DEFINED(block,
+        BOOST_POOL_WITH_DEFINED(first,
+          loc = find_prev(block);
+        );
+      );
 
       // Place either at beginning or in middle/end
       if (loc == 0)
-        add_block(block, nsz, npartition_sz);
-      else
-        nextof(loc) = segregate(block, nsz, npartition_sz, nextof(loc));
+        BOOST_POOL_WITH_DEFINED(block,
+          BOOST_POOL_WITH_DEFINED(first,
+            add_block(block, nsz, npartition_sz);
+          );
+        );
+      else {
+        BOOST_POOL_WITH_DEFINED(nextof(loc),
+          BOOST_POOL_WITH_DEFINED(block,
+            nextof(loc) = segregate(block, nsz, npartition_sz, nextof(loc));
+          );
+        );
+      }
     }
 
     // default destructor
@@ -101 +128 @@
       void * const ret = first;
 
       // Increment the "first" pointer to point to the next chunk
-      first = nextof(first);
+      BOOST_POOL_WITH_DEFINED(nextof(first),
+        first = nextof(first);
+      );
       return ret;
     }
 
@@ -110 +139 @@
     // post: !empty()
     void free(void * const chunk)
     {
-      nextof(chunk) = first;
+      BOOST_POOL_WITH_DEFINED(nextof(chunk),
+        nextof(chunk) = first;
+      );
       first = chunk;
     }
 
@@ -130 +161 @@
         free(chunk);
       else
       {
-        nextof(chunk) = nextof(loc);
-        nextof(loc) = chunk;
+        BOOST_POOL_WITH_DEFINED(nextof(chunk),
+          BOOST_POOL_WITH_DEFINED(nextof(loc),
+            {
+              nextof(chunk) = nextof(loc);
+              nextof(loc) = chunk;
+            }
+          );
+        );
       }
     }
 
@@ -174 +211 @@
   {
     // if we're about to hit the end or
     //  if we've found where "ptr" goes
-    if (nextof(iter) == 0 || std::greater<void *>()(nextof(iter), ptr))
+    bool test = false;
+    BOOST_POOL_WITH_DEFINED(nextof(iter),
+      test = (nextof(iter) == 0 || std::greater<void *>()(nextof(iter), ptr));
+    );
+    if (test)
       return iter;
 
-    iter = nextof(iter);
+    BOOST_POOL_WITH_DEFINED(nextof(iter),
+      iter = nextof(iter);
+    );
   }
 }
 
@@ -196 +239 @@
       + ((sz - partition_sz) / partition_sz) * partition_sz;
 
   // Set it to point to the end
-  nextof(old) = end;
+  BOOST_POOL_WITH_DEFINED(nextof(old),
+    nextof(old) = end;
+  );
 
   // Handle border case where sz == partition_sz (i.e., we're handling an array
   //  of 1 element)
@@ -206 +251 @@
   // Iterate backwards, building a singly-linked list of pointers
   for (char * iter = old - partition_sz; iter != block;
       old = iter, iter -= partition_sz)
-    nextof(iter) = old;
+    BOOST_POOL_WITH_DEFINED(nextof(iter),
+      nextof(iter) = old;
+    );
 
   // Point the first pointer, too
-  nextof(block) = old;
+  BOOST_POOL_WITH_DEFINED(nextof(block),
+    nextof(block) = old;
+  );
 
   return block;
 }
@@ -230 +279 @@
 void * simple_segregated_storage<SizeType>::try_malloc_n(
     void * & start, size_type n, const size_type partition_size)
 {
-  void * iter = nextof(start);
+  void * iter = 0;
+  BOOST_POOL_WITH_DEFINED(nextof(start),
+    iter = nextof(start);
+  );
   while (--n != 0)
   {
-    void * next = nextof(iter);
+    void * next = 0;
+    BOOST_POOL_WITH_DEFINED(nextof(iter),
+      next = nextof(iter);
+    );
     if (next != static_cast<char *>(iter) + partition_size)
     {
       // next == 0 (end-of-list) or non-contiguous chunk found
@@ -255 +310 @@
   void * iter;
   do
   {
-    if (nextof(start) == 0)
+    bool nextof_start_is_null = false;
+    BOOST_POOL_WITH_DEFINED(nextof(start),
+      nextof_start_is_null = (nextof(start) == 0);
+    );
+    if (nextof_start_is_null)
       return 0;
     iter = try_malloc_n(start, n, partition_size);
   } while (iter == 0);
-  void * const ret = nextof(start);
-  nextof(start) = nextof(iter);
+  void * ret = 0;
+  BOOST_POOL_WITH_DEFINED(nextof(start),
+    BOOST_POOL_WITH_DEFINED(nextof(iter),
+      {
+        ret = nextof(start);
+        nextof(start) = nextof(iter);
+      }
+    );
+  );
   return ret;
 }