Fri, 09 Aug 2013 14:36:54 +0200
documented mempool + some fixes
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2013 Olaf Wintermann. All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
27 */
29 #include <stdlib.h>
30 #include <string.h>
31 #include <stdio.h>
32 #ifdef __cplusplus
33 #define __STDC_FORMAT_MACROS
34 #endif
35 #include <inttypes.h>
37 #include "mempool.h"
39 typedef struct {
40 ucx_destructor destructor;
41 char c;
42 } ucx_memchunk;
44 typedef struct {
45 ucx_destructor destructor;
46 void *ptr;
47 } ucx_regdestr;
49 UCX_EXTERN void ucx_mempool_shared_destr(void* ptr) {
50 ucx_regdestr *rd = (ucx_regdestr*)ptr;
51 rd->destructor(rd->ptr);
52 }
54 UcxMempool *ucx_mempool_new(size_t n) {
55 UcxMempool *pool = (UcxMempool*)malloc(sizeof(UcxMempool));
56 if (!pool) {
57 return NULL;
58 }
60 pool->data = (void**) malloc(n * sizeof(void*));
61 if (pool->data == NULL) {
62 free(pool);
63 return NULL;
64 }
66 pool->ndata = 0;
67 pool->size = n;
68 return pool;
69 }
71 int ucx_mempool_chcap(UcxMempool *pool, size_t newcap) {
72 void **data = (void**) realloc(pool->data, newcap*sizeof(void*));
73 if (data) {
74 pool->data = data;
75 pool->size = newcap;
76 return EXIT_SUCCESS;
77 } else {
78 return EXIT_FAILURE;
79 }
80 }
82 void *ucx_mempool_malloc(UcxMempool *pool, size_t n) {
83 ucx_memchunk *mem = (ucx_memchunk*)malloc(sizeof(ucx_destructor) + n);
84 if (!mem) {
85 return NULL;
86 }
88 if (pool->ndata >= pool->size) {
89 // The hard coded 16 is documented for this function and ucx_mempool_new
90 ucx_mempool_chcap(pool, pool->size + 16);
91 }
93 mem->destructor = NULL;
94 pool->data[pool->ndata] = mem;
95 pool->ndata++;
97 return &(mem->c);
98 }
100 void *ucx_mempool_calloc(UcxMempool *pool, size_t nelem, size_t elsize) {
101 void *ptr = ucx_mempool_malloc(pool, nelem*elsize);
102 if (!ptr) {
103 return NULL;
104 }
105 memset(ptr, 0, nelem * elsize);
106 return ptr;
107 }
109 void *ucx_mempool_realloc(UcxMempool *pool, void *ptr, size_t n) {
110 char *mem = ((char*)ptr) - sizeof(ucx_destructor);
111 char *newm = (char*) realloc(mem, n + sizeof(ucx_destructor));
112 if (!newm) {
113 return NULL;
114 }
115 if (mem != newm) {
116 for(size_t i=0 ; i < pool->ndata ; i++) {
117 if(pool->data[i] == mem) {
118 pool->data[i] = newm;
119 return newm + sizeof(ucx_destructor);
120 }
121 }
122 fprintf(stderr, "FATAL: 0x%08" PRIxPTR" not in mpool 0x%08" PRIxPTR"\n",
123 (intptr_t)ptr, (intptr_t)pool);
124 exit(1);
125 } else {
126 return newm + sizeof(ucx_destructor);
127 }
128 }
130 void ucx_mempool_free(UcxMempool *pool, void *ptr) {
131 ucx_memchunk *chunk = (ucx_memchunk*)((char*)ptr-sizeof(ucx_destructor));
132 for(size_t i=0 ; i<pool->ndata ; i++) {
133 if(chunk == pool->data[i]) {
134 if(chunk->destructor != NULL) {
135 chunk->destructor(&chunk->c);
136 }
137 free(chunk);
138 size_t last_index = pool->ndata - 1;
139 if(i != last_index) {
140 pool->data[i] = pool->data[last_index];
141 }
142 pool->ndata--;
143 return;
144 }
145 }
146 fprintf(stderr, "FATAL: 0x%08" PRIxPTR" not in mpool 0x%08" PRIxPTR"\n",
147 (intptr_t)ptr, (intptr_t)pool);
148 exit(EXIT_FAILURE);
149 }
151 void ucx_mempool_destroy(UcxMempool *pool) {
152 ucx_memchunk *chunk;
153 for(size_t i=0 ; i<pool->ndata ; i++) {
154 chunk = (ucx_memchunk*) pool->data[i];
155 if(chunk) {
156 if(chunk->destructor) {
157 chunk->destructor(&(chunk->c));
158 }
159 free(chunk);
160 }
161 }
162 free(pool->data);
163 free(pool);
164 }
166 void ucx_mempool_set_destr(void *ptr, ucx_destructor func) {
167 *(ucx_destructor*)((char*)ptr-sizeof(ucx_destructor)) = func;
168 }
170 void ucx_mempool_reg_destr(UcxMempool *pool, void *ptr, ucx_destructor destr) {
171 ucx_regdestr *rd = (ucx_regdestr*)ucx_mempool_malloc(
172 pool,
173 sizeof(ucx_regdestr));
174 rd->destructor = destr;
175 rd->ptr = ptr;
176 ucx_mempool_set_destr(rd, ucx_mempool_shared_destr);
177 }
179 UcxAllocator* ucx_mempool_allocator(UcxMempool *pool) {
180 UcxAllocator *allocator = (UcxAllocator*)ucx_mempool_malloc(
181 pool, sizeof(UcxAllocator));
182 if(!allocator) {
183 return NULL;
184 }
185 allocator->malloc = (ucx_allocator_malloc)ucx_mempool_malloc;
186 allocator->calloc = (ucx_allocator_calloc)ucx_mempool_calloc;
187 allocator->realloc = (ucx_allocator_realloc)ucx_mempool_realloc;
188 allocator->free = (ucx_allocator_free)ucx_mempool_free;
189 allocator->pool = pool;
190 return allocator;
191 }