1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
|
/* SPDX-License-Identifier: LGPL-3.0-or-later */
/*
* mempool.c
*
* Copyright (C) 2021 David Oberhollenzer <goliath@infraroot.at>
*/
#include "mempool.h"
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include <assert.h>
#include <sys/mman.h>
#define DEF_POOL_SIZE (65536)
#define MEM_ALIGN (8)
typedef struct pool_t {
struct pool_t *next;
unsigned char *data;
unsigned char *limit;
unsigned int *bitmap;
size_t obj_free;
unsigned char blob[];
} pool_t;
struct mem_pool_t {
size_t obj_size;
size_t pool_size;
size_t bitmap_count;
pool_t *pool_list;
};
static size_t pool_size_from_bitmap_count(size_t count, size_t obj_size)
{
size_t size, byte_count, bit_count;
size = sizeof(pool_t);
if (size % sizeof(unsigned int))
size += sizeof(unsigned int) - size % sizeof(unsigned int);
byte_count = count * sizeof(unsigned int);
bit_count = byte_count * CHAR_BIT;
size += byte_count;
if (size % obj_size)
size += obj_size - size % obj_size;
size += bit_count * obj_size;
return size;
}
static pool_t *create_pool(const mem_pool_t *mem)
{
unsigned char *ptr;
pool_t *pool;
ptr = mmap(NULL, mem->pool_size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
if (ptr == MAP_FAILED)
return NULL;
pool = (pool_t *)ptr;
ptr = pool->blob;
if (((intptr_t)ptr) % sizeof(unsigned int)) {
ptr += sizeof(unsigned int);
ptr -= ((intptr_t)ptr) % sizeof(unsigned int);
}
pool->bitmap = (unsigned int *)ptr;
pool->obj_free = mem->bitmap_count * sizeof(unsigned int) * CHAR_BIT;
ptr += mem->bitmap_count * sizeof(unsigned int);
if (((intptr_t)ptr) % mem->obj_size) {
ptr += mem->obj_size;
ptr -= ((intptr_t)ptr) % mem->obj_size;
}
pool->data = ptr;
pool->limit = pool->data + pool->obj_free * mem->obj_size - 1;
memset(pool->bitmap, 0, mem->bitmap_count * sizeof(unsigned int));
return pool;
}
mem_pool_t *mem_pool_create(size_t obj_size)
{
mem_pool_t *mem = calloc(1, sizeof(*mem));
size_t count = 1, total;
if (mem == NULL)
return NULL;
if (obj_size % MEM_ALIGN)
obj_size += MEM_ALIGN - obj_size % MEM_ALIGN;
for (;;) {
total = pool_size_from_bitmap_count(count, obj_size);
if (total > DEF_POOL_SIZE)
break;
++count;
}
--count;
mem->obj_size = obj_size;
mem->pool_size = DEF_POOL_SIZE;
mem->bitmap_count = count;
return mem;
}
void mem_pool_destroy(mem_pool_t *mem)
{
while (mem->pool_list != NULL) {
pool_t *pool = mem->pool_list;
mem->pool_list = pool->next;
munmap(pool, mem->pool_size);
}
free(mem);
}
void *mem_pool_allocate(mem_pool_t *mem)
{
size_t idx, i, j;
void *ptr = NULL;
pool_t *it;
for (it = mem->pool_list; it != NULL; it = it->next) {
if (it->obj_free > 0)
break;
}
if (it == NULL) {
it = create_pool(mem);
if (it == NULL)
return NULL;
it->next = mem->pool_list;
mem->pool_list = it;
}
for (i = 0; i < mem->bitmap_count; ++i) {
if (it->bitmap[i] < UINT_MAX)
break;
}
for (j = 0; j < (sizeof(it->bitmap[i]) * CHAR_BIT); ++j) {
if (!(it->bitmap[i] & (1UL << j)))
break;
}
idx = i * sizeof(unsigned int) * CHAR_BIT + j;
ptr = it->data + idx * mem->obj_size;
it->bitmap[i] |= (1UL << j);
it->obj_free -= 1;
memset(ptr, 0, mem->obj_size);
return ptr;
}
void mem_pool_free(mem_pool_t *mem, void *ptr)
{
size_t idx, i, j;
pool_t *it;
for (it = mem->pool_list; it != NULL; it = it->next) {
if ((unsigned char *)ptr >= it->data &&
(unsigned char *)ptr < it->limit) {
break;
}
}
assert(it != NULL);
idx = (size_t)((unsigned char *)ptr - it->data);
assert((idx % mem->obj_size) == 0);
idx /= mem->obj_size;
i = idx / (sizeof(unsigned int) * CHAR_BIT);
j = idx % (sizeof(unsigned int) * CHAR_BIT);
assert((it->bitmap[i] & (1 << j)) != 0);
it->bitmap[i] &= ~(1 << j);
}
|
