ucx/mempool.c

Fri, 09 Aug 2013 14:36:54 +0200

author
Mike Becker <universe@uap-core.de>
date
Fri, 09 Aug 2013 14:36:54 +0200
changeset 135
a0aa1c15f46b
parent 131
fc3af16818a3
child 138
7800811078b8
permissions
-rw-r--r--

documented mempool + some fixes

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

mercurial