22 #include <spot/misc/common.hh>
23 #include <unordered_map>
25 #if SPOT_DEBUG && __has_include(<valgrind/memcheck.h>)
26 #undef USES_MEMCHECK_H
27 #define USES_MEMCHECK_H 1
28 #include <valgrind/memcheck.h>
37 static const size_t alignment_ = 2 *
sizeof(size_t) - 1;
41 : free_start_(nullptr), free_end_(nullptr), chunklist_(nullptr)
50 chunk_* prev = chunklist_->prev;
56 size_t fixsize(
size_t size)
const
58 if (size <
sizeof(block_))
59 size =
sizeof(block_);
61 return (size + alignment_ - 1) & ~(alignment_ - 1);
70 block_*& f = freelist_[size];
75 #ifdef USES_MEMCHECK_H
76 VALGRIND_MALLOCLIKE_BLOCK(f, size, 0,
false);
79 VALGRIND_MAKE_MEM_DEFINED(f,
sizeof(block_*));
89 if (free_start_ + size > free_end_)
91 const size_t requested = (size > 128 ? size : 128) * 8192 - 64;
92 chunk_* c =
reinterpret_cast<chunk_*
>(malloc(requested));
94 throw std::bad_alloc();
98 free_start_ = c->data_ + size;
99 free_end_ = c->data_ + requested;
102 void* res = free_start_;
104 #ifdef USES_MEMCHECK_H
105 VALGRIND_MALLOCLIKE_BLOCK(res, size, 0,
false);
123 size = fixsize(size);
124 block_* b =
reinterpret_cast<block_*
>(
const_cast<void*
>(ptr));
125 block_*& f = freelist_[size];
128 #ifdef USES_MEMCHECK_H
129 VALGRIND_FREELIKE_BLOCK(ptr, 0);
134 struct block_ { block_* next; };
135 std::unordered_map<size_t, block_*> freelist_;
139 union chunk_ { chunk_* prev;
char data_[1]; }* chunklist_;
A multiple-size memory pool implementation.
Definition: mspool.hh:36
void * allocate(size_t size)
Allocate size bytes of memory.
Definition: mspool.hh:66
~multiple_size_pool()
Free any memory allocated by this pool.
Definition: mspool.hh:46
void deallocate(const void *ptr, size_t size)
Recycle size bytes of memory.
Definition: mspool.hh:120
multiple_size_pool()
Create a pool.
Definition: mspool.hh:40
Definition: automata.hh:27