3 #define POOL_DEF_EXTENT (32 * 1024)
7 size_t size; /* extent size */
8 size_t quantum; /* allocation quantum */
9 struct pool_extent *live; /* current extent for
11 struct pool_extent *free; /* unfreed extent list */
13 /* function to call if
17 /* statistical data */
18 unsigned long e_created; /* extents created */
19 unsigned long e_freed; /* extents detroyed */
20 int64 n_allocated; /* calls to alloc */
21 int64 n_freed; /* calls to free */
22 int64 b_allocated; /* cum. bytes allocated */
23 int64 b_freed; /* cum. bytes freed */
28 void *start; /* starting address */
29 size_t free; /* free bytecount */
30 size_t bound; /* bytes bound by padding,
31 * overhead and freed */
32 struct pool_extent *next;
40 #define MINALIGN offsetof(struct align_test, bar)
42 /* Temporarily cast a void* var into a char* var when adding an offset (to
43 * keep some compilers from complaining about the pointer arithmetic). */
44 #define PTR_ADD(b,o) ( (void*) ((char*)(b) + (o)) )
47 pool_create(size_t size, size_t quantum, void (*bomb)(const char *), int flags)
49 struct alloc_pool *pool;
51 if (!(pool = (struct alloc_pool*) malloc(sizeof (struct alloc_pool))))
53 memset(pool, 0, sizeof (struct alloc_pool));
55 pool->size = size /* round extent size to min alignment reqs */
56 ? (size + MINALIGN - 1) & ~(MINALIGN - 1)
58 if (pool->flags & POOL_INTERN) {
59 pool->size -= sizeof (struct pool_extent);
62 pool->quantum = quantum ? quantum : MINALIGN;
70 pool_destroy(alloc_pool_t p)
72 struct alloc_pool *pool = (struct alloc_pool *) p;
73 struct pool_extent *cur, *next;
81 if (!(pool->flags & POOL_APPEND))
84 for (cur = pool->free; cur; cur = next) {
87 if (!(pool->flags & POOL_APPEND))
94 pool_alloc(alloc_pool_t p, size_t len, const char *bomb)
96 struct alloc_pool *pool = (struct alloc_pool *) p;
102 else if (pool->quantum > 1 && len % pool->quantum)
103 len += pool->quantum - len % pool->quantum;
105 if (len > pool->size)
108 if (!pool->live || len > pool->live->free) {
116 pool->live->next = pool->free;
117 pool->free = pool->live;
124 if (pool->flags & POOL_APPEND)
125 asize += sizeof (struct pool_extent);
127 if (!(start = (void *) malloc(asize)))
130 if (pool->flags & POOL_CLEAR)
131 memset(start, 0, pool->size);
133 if (pool->flags & POOL_APPEND)
134 pool->live = PTR_ADD(start, free);
135 else if (!(pool->live = (struct pool_extent *) malloc(sizeof (struct pool_extent))))
137 if (pool->flags & POOL_QALIGN && pool->quantum > 1
138 && (sqew = (size_t)PTR_ADD(start, free) % pool->quantum)) {
142 pool->live->start = start;
143 pool->live->free = free;
144 pool->live->bound = bound;
145 pool->live->next = NULL;
151 pool->b_allocated += len;
153 pool->live->free -= len;
155 return PTR_ADD(pool->live->start, pool->live->free);
164 pool_free(alloc_pool_t p, size_t len, void *addr)
166 struct alloc_pool *pool = (struct alloc_pool *) p;
167 struct pool_extent *cur;
168 struct pool_extent *prev;
175 else if (pool->quantum > 1 && len % pool->quantum)
176 len += pool->quantum - len % pool->quantum;
178 if (!addr && pool->live) {
179 pool->live->next = pool->free;
180 pool->free = pool->live;
185 pool->b_freed += len;
188 if (cur && addr >= cur->start
189 && addr < PTR_ADD(cur->start, pool->size)) {
190 if (addr == PTR_ADD(cur->start, cur->free)) {
191 if (pool->flags & POOL_CLEAR)
192 memset(addr, 0, len);
193 pool->b_freed += len;
196 if (cur->free + cur->bound >= pool->size) {
199 cur->free = pool->size;
201 if (pool->flags & POOL_QALIGN && pool->quantum > 1
202 && (sqew = (size_t)PTR_ADD(cur->start, cur->free) % pool->quantum)) {
209 for (prev = NULL, cur = pool->free; cur; prev = cur, cur = cur->next) {
210 if (addr >= cur->start
211 && addr < PTR_ADD(cur->start, pool->size))
218 prev->next = cur->next;
219 cur->next = pool->free;
224 if (cur->free + cur->bound >= pool->size) {
225 pool->free = cur->next;
228 if (!(pool->flags & POOL_APPEND))
235 #define FDPRINT(label, value) \
236 snprintf(buf, sizeof buf, label, value), \
237 write(fd, buf, strlen(buf))
239 #define FDEXTSTAT(ext) \
240 snprintf(buf, sizeof buf, " %12ld %5ld\n", \
242 (long) ext->bound), \
243 write(fd, buf, strlen(buf))
246 pool_stats(alloc_pool_t p, int fd, int summarize)
248 struct alloc_pool *pool = (struct alloc_pool *) p;
249 struct pool_extent *cur;
255 FDPRINT(" Extent size: %12ld\n", (long) pool->size);
256 FDPRINT(" Alloc quantum: %12ld\n", (long) pool->quantum);
257 FDPRINT(" Extents created: %12ld\n", pool->e_created);
258 FDPRINT(" Extents freed: %12ld\n", pool->e_freed);
259 FDPRINT(" Alloc count: %12.0f\n", (double) pool->n_allocated);
260 FDPRINT(" Free Count: %12.0f\n", (double) pool->n_freed);
261 FDPRINT(" Alloc bytes: %12.0f\n", (double) pool->b_allocated);
262 FDPRINT(" Free bytes: %12.0f\n", (double) pool->b_freed);
267 if (!pool->live && !pool->free)
273 FDEXTSTAT(pool->live);
274 strlcpy(buf, " FREE BOUND\n", sizeof buf);
275 write(fd, buf, strlen(buf));
277 for (cur = pool->free; cur; cur = cur->next)