ucx/mempool.c

Mon, 06 Mar 2017 16:09:42 +0100

author
Mike Becker <universe@uap-core.de>
date
Mon, 06 Mar 2017 16:09:42 +0100
changeset 241
661f33ef20d8
parent 240
8f937a3a6d11
child 242
a3597d704421
permissions
-rw-r--r--

removes unused ucx_mempool_clamp() and changes storage behavior of mempool to increase the capacity by a factor of two

     1 /*
     2  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
     3  *
     4  * Copyright 2016 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 /** Capsule for destructible memory chunks. */
    40 typedef struct {
    41     /** The destructor for the memory chunk. */
    42     ucx_destructor destructor;
    43     /**
    44      * First byte of the memory chunk.
    45      * Note, that the address <code>&amp;c</code> is also the address
    46      * of the whole memory chunk.
    47      */
    48     char c;
    49 } ucx_memchunk;
    51 /** Capsule for data and its destructor. */
    52 typedef struct {
    53     /** The destructor for the data. */
    54     ucx_destructor destructor;
    55     /** A pointer to the data. */
    56     void           *ptr;
    57 } ucx_regdestr;
    59 UCX_EXTERN void ucx_mempool_shared_destr(void* ptr) {
    60     ucx_regdestr *rd = (ucx_regdestr*)ptr;
    61     rd->destructor(rd->ptr);
    62 }
    64 UcxMempool *ucx_mempool_new(size_t n) {
    65     UcxMempool *pool = (UcxMempool*)malloc(sizeof(UcxMempool));
    66     if (!pool) {
    67         return NULL;
    68     }
    70     pool->data = (void**) malloc(n * sizeof(void*));
    71     if (pool->data == NULL) {
    72         free(pool);
    73         return NULL;
    74     }
    76     pool->ndata = 0;
    77     pool->size = n;
    79     UcxAllocator *allocator = (UcxAllocator*)malloc(sizeof(UcxAllocator));
    80     if(!allocator) {
    81         free(pool->data);
    82         free(pool);
    83         return NULL;
    84     }
    85     allocator->malloc = (ucx_allocator_malloc)ucx_mempool_malloc;
    86     allocator->calloc = (ucx_allocator_calloc)ucx_mempool_calloc;
    87     allocator->realloc = (ucx_allocator_realloc)ucx_mempool_realloc;
    88     allocator->free = (ucx_allocator_free)ucx_mempool_free;
    89     allocator->pool = pool;
    90     pool->allocator = allocator;
    92     return pool;
    93 }
    95 int ucx_mempool_chcap(UcxMempool *pool, size_t newcap) {
    96     if (newcap < pool->ndata) {
    97         return 1;
    98     }
   100     void **data = (void**) realloc(pool->data, newcap*sizeof(void*));
   101     if (data) {
   102         pool->data = data; 
   103         pool->size = newcap;
   104         return 0;
   105     } else {
   106         return 1;
   107     }
   108 }
   110 void *ucx_mempool_malloc(UcxMempool *pool, size_t n) {
   111     if (pool->ndata >= pool->size) {
   112         if (pool->size*2 < pool->size /* overflow check */
   113                 || ucx_mempool_chcap(pool, pool->size*2)) {
   114             return NULL;
   115         }
   116     }
   118     ucx_memchunk *mem = (ucx_memchunk*)malloc(sizeof(ucx_destructor) + n);
   119     if (!mem) {
   120         return NULL;
   121     }
   123     mem->destructor = NULL;
   124     pool->data[pool->ndata] = mem;
   125     pool->ndata++;
   127     return &(mem->c);
   128 }
   130 void *ucx_mempool_calloc(UcxMempool *pool, size_t nelem, size_t elsize) {
   131     void *ptr = ucx_mempool_malloc(pool, nelem*elsize);
   132     if (!ptr) {
   133         return NULL;
   134     }
   135     memset(ptr, 0, nelem * elsize);
   136     return ptr;
   137 }
   139 void *ucx_mempool_realloc(UcxMempool *pool, void *ptr, size_t n) {
   140     char *mem = ((char*)ptr) - sizeof(ucx_destructor);
   141     char *newm = (char*) realloc(mem, n + sizeof(ucx_destructor));
   142     if (!newm) {
   143         return NULL;
   144     }
   145     if (mem != newm) {
   146         for(size_t i=0 ; i < pool->ndata ; i++) {
   147             if(pool->data[i] == mem) {
   148                 pool->data[i] = newm;
   149                 return newm + sizeof(ucx_destructor);
   150             }
   151         }
   152         fprintf(stderr, "FATAL: 0x%08" PRIxPTR" not in mpool 0x%08" PRIxPTR"\n",
   153           (intptr_t)ptr, (intptr_t)pool);
   154         abort();
   155     } else {
   156         return newm + sizeof(ucx_destructor);
   157     }
   158 }
   160 void ucx_mempool_free(UcxMempool *pool, void *ptr) {
   161     ucx_memchunk *chunk = (ucx_memchunk*)((char*)ptr-sizeof(ucx_destructor));
   162     for(size_t i=0 ; i<pool->ndata ; i++) {
   163         if(chunk == pool->data[i]) {
   164             if(chunk->destructor != NULL) {
   165                 chunk->destructor(&(chunk->c));
   166             }
   167             free(chunk);
   168             size_t last_index = pool->ndata - 1;
   169             if(i != last_index) {
   170                 pool->data[i] = pool->data[last_index];
   171                 pool->data[last_index] = NULL;
   172             }
   173             pool->ndata--;
   174             return;
   175         }
   176     }
   177     fprintf(stderr, "FATAL: 0x%08" PRIxPTR" not in mpool 0x%08" PRIxPTR"\n",
   178             (intptr_t)ptr, (intptr_t)pool);
   179     abort();
   180 }
   182 void ucx_mempool_destroy(UcxMempool *pool) {
   183     ucx_memchunk *chunk;
   184     for(size_t i=0 ; i<pool->ndata ; i++) {
   185         chunk = (ucx_memchunk*) pool->data[i];
   186         if(chunk) {
   187             if(chunk->destructor) {
   188                 chunk->destructor(&(chunk->c));
   189             }
   190             free(chunk);
   191         }
   192     }
   193     free(pool->data);
   194     free(pool->allocator);
   195     free(pool);
   196 }
   198 void ucx_mempool_set_destr(void *ptr, ucx_destructor func) {
   199     *(ucx_destructor*)((char*)ptr-sizeof(ucx_destructor)) = func;
   200 }
   202 void ucx_mempool_reg_destr(UcxMempool *pool, void *ptr, ucx_destructor destr) {
   203     ucx_regdestr *rd = (ucx_regdestr*)ucx_mempool_malloc(
   204             pool,
   205             sizeof(ucx_regdestr));
   206     rd->destructor = destr;
   207     rd->ptr = ptr;
   208     ucx_mempool_set_destr(rd, ucx_mempool_shared_destr);
   209 }

mercurial