7#include <botan/internal/mem_pool.h>
9#include <botan/mem_ops.h>
10#include <botan/internal/target_info.h>
15#if defined(BOTAN_HAS_VALGRIND) || defined(BOTAN_ENABLE_DEBUG_ASSERTS)
29 #define BOTAN_MEM_POOL_USE_MMU_PROTECTIONS
32#if defined(BOTAN_MEM_POOL_USE_MMU_PROTECTIONS) && defined(BOTAN_HAS_OS_UTILS)
33 #include <botan/internal/os_utils.h>
112size_t choose_bucket(
size_t n) {
113 constexpr size_t MINIMUM_ALLOCATION = 16;
114 constexpr size_t MAXIMUM_ALLOCATION = 256;
116 if(n < MINIMUM_ALLOCATION || n > MAXIMUM_ALLOCATION) {
122 constexpr size_t buckets[] = {
138 for(
size_t i = 0; buckets[i] != 0; ++i) {
139 if(n <= buckets[i]) {
147inline bool ptr_in_pool(
const void* pool_ptr,
size_t poolsize,
const void* buf_ptr,
size_t bufsize) {
148 const uintptr_t pool =
reinterpret_cast<uintptr_t
>(pool_ptr);
149 const uintptr_t buf =
reinterpret_cast<uintptr_t
>(buf_ptr);
150 return (buf >= pool) && (buf + bufsize <= pool + poolsize);
155size_t find_set_bit(T b) {
156 size_t s = 8 *
sizeof(T) / 2;
161 const T mask = (
static_cast<T
>(1) << s) - 1;
162 if((b & mask) == 0) {
174 explicit BitMap(
size_t bits) : m_len(bits) {
175 m_bits.resize((bits + BITMASK_BITS - 1) / BITMASK_BITS);
177 if(bits % BITMASK_BITS != 0) {
178 m_last_mask = (
static_cast<bitmask_type
>(1) << (bits % BITMASK_BITS)) - 1;
182 std::optional<size_t> find_free();
184 void free(
size_t bit) {
186 const size_t w = bit / BITMASK_BITS;
188 const bitmask_type mask =
static_cast<bitmask_type
>(1) << (bit % BITMASK_BITS);
189 m_bits[w] = m_bits[w] & (~mask);
193 for(
const auto bitset : m_bits) {
203#if defined(BOTAN_ENABLE_DEBUG_ASSERTS)
204 using bitmask_type = uint8_t;
206 using bitmask_type =
word;
209 static const size_t BITMASK_BITS =
sizeof(bitmask_type) * 8;
213 bitmask_type m_main_mask =
static_cast<bitmask_type
>(~0);
214 bitmask_type m_last_mask =
static_cast<bitmask_type
>(~0);
215 std::vector<bitmask_type> m_bits;
218std::optional<size_t> BitMap::find_free() {
219 for(
size_t i = 0; i != m_bits.size(); ++i) {
220 const bitmask_type mask = (i == m_bits.size() - 1) ? m_last_mask : m_main_mask;
221 if((m_bits[i] & mask) != mask) {
222 const size_t free_bit = find_set_bit(~m_bits[i]);
223 const bitmask_type bmask =
static_cast<bitmask_type
>(1) << (free_bit % BITMASK_BITS);
226 return BITMASK_BITS * i + free_bit;
237 Bucket(uint8_t* mem,
size_t mem_size,
size_t item_size) :
238 m_item_size(item_size),
239 m_page_size(mem_size),
241 m_bitmap(mem_size / item_size),
250 auto offset = m_bitmap.find_free();
256 BOTAN_ASSERT(*offset * m_item_size < m_page_size,
"Offset is in range");
257 return m_range + m_item_size * (*offset);
262 if(!in_this_bucket(p)) {
270 std::memset(p, 0, m_item_size);
272 const size_t offset = (
reinterpret_cast<uintptr_t
>(p) -
reinterpret_cast<uintptr_t
>(m_range)) / m_item_size;
274 m_bitmap.free(offset);
280 bool in_this_bucket(
void* p)
const {
return ptr_in_pool(m_range, m_page_size, p, m_item_size); }
282 bool empty()
const {
return m_bitmap.empty(); }
284 uint8_t* ptr()
const {
return m_range; }
295 for(
auto* page : pages) {
296 const uintptr_t p =
reinterpret_cast<uintptr_t
>(page);
298 m_min_page_ptr = std::min(p, m_min_page_ptr);
299 m_max_page_ptr = std::max(p, m_max_page_ptr);
302#if defined(BOTAN_MEM_POOL_USE_MMU_PROTECTIONS)
305 m_free_pages.push_back(
static_cast<uint8_t*
>(page));
312 m_max_page_ptr += page_size;
317#if defined(BOTAN_MEM_POOL_USE_MMU_PROTECTIONS)
318 for(
size_t i = 0; i != m_free_pages.size(); ++i) {
325 if(n > m_page_size) {
329 const size_t n_bucket = choose_bucket(n);
334 std::deque<Bucket>& buckets = m_buckets_for[n_bucket];
342 for(
auto& bucket : buckets) {
344 if(uint8_t* p = bucket.alloc()) {
352 if(!m_free_pages.empty()) {
353 uint8_t* ptr = m_free_pages[0];
354 m_free_pages.pop_front();
355#if defined(BOTAN_MEM_POOL_USE_MMU_PROTECTIONS)
358 buckets.push_front(Bucket(ptr, m_page_size, n_bucket));
360 void* p = buckets[0].alloc();
372 const uintptr_t p_val =
reinterpret_cast<uintptr_t
>(p);
373 if(p_val < m_min_page_ptr || p_val > m_max_page_ptr) {
377 const size_t n_bucket = choose_bucket(len);
383 std::deque<Bucket>& buckets = m_buckets_for[n_bucket];
385 for(
size_t i = 0; i != buckets.size(); ++i) {
386 Bucket& bucket = buckets[i];
389#if defined(BOTAN_MEM_POOL_USE_MMU_PROTECTIONS)
392 m_free_pages.push_back(bucket.ptr());
394 if(i != buckets.size() - 1) {
395 std::swap(buckets.back(), buckets[i]);
#define BOTAN_ASSERT_NOMSG(expr)
#define BOTAN_ASSERT(expr, assertion_made)
Memory_Pool(const std::vector< void * > &pages, size_t page_size)
bool deallocate(void *p, size_t size) noexcept
void * allocate(size_t size)
void page_allow_access(void *page)
void page_prohibit_access(void *page)
secure_vector< T > lock(const std::vector< T > &in)
constexpr void clear_bytes(void *ptr, size_t bytes)
lock_guard< T > lock_guard_type
std::conditional_t< HasNative64BitRegisters, std::uint64_t, uint32_t > word
The native machine word, used as the limb type for multiprecision integers.