21#include <spot/misc/common.hh>
22#include <unordered_map>
24#if SPOT_DEBUG && __has_include(<valgrind/memcheck.h>)
26#define USES_MEMCHECK_H 1
27#include <valgrind/memcheck.h>
36 static const size_t alignment_ = 2 *
sizeof(size_t) - 1;
40 : free_start_(nullptr), free_end_(nullptr), chunklist_(nullptr)
49 chunk_* prev = chunklist_->prev;
55 size_t fixsize(
size_t size)
const
57 if (size <
sizeof(block_))
58 size =
sizeof(block_);
60 return (size + alignment_ - 1) & ~(alignment_ - 1);
69 block_*& f = freelist_[size];
75 VALGRIND_MALLOCLIKE_BLOCK(f, size, 0,
false);
78 VALGRIND_MAKE_MEM_DEFINED(f,
sizeof(block_*));
88 if (free_start_ + size > free_end_)
90 const size_t requested = (size > 128 ? size : 128) * 8192 - 64;
91 chunk_* c =
reinterpret_cast<chunk_*
>(malloc(requested));
93 throw std::bad_alloc();
97 free_start_ = c->data_ + size;
98 free_end_ = c->data_ + requested;
101 void* res = free_start_;
103#ifdef USES_MEMCHECK_H
104 VALGRIND_MALLOCLIKE_BLOCK(res, size, 0,
false);
122 size = fixsize(size);
123 block_* b =
reinterpret_cast<block_*
>(
const_cast<void*
>(ptr));
124 block_*& f = freelist_[size];
127#ifdef USES_MEMCHECK_H
128 VALGRIND_FREELIKE_BLOCK(ptr, 0);
133 struct block_ { block_* next; };
134 std::unordered_map<size_t, block_*> freelist_;
138 union chunk_ { chunk_* prev;
char data_[1]; }* chunklist_;
A multiple-size memory pool implementation.
Definition: mspool.hh:35
~multiple_size_pool()
Free any memory allocated by this pool.
Definition: mspool.hh:45
void * allocate(size_t size)
Allocate size bytes of memory.
Definition: mspool.hh:65
void deallocate(const void *ptr, size_t size)
Recycle size bytes of memory.
Definition: mspool.hh:119
multiple_size_pool()
Create a pool.
Definition: mspool.hh:39
Definition: automata.hh:26