ucx: ucx/mempool.c@1cf2eabf94ed

     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 /** 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;

    78     return pool;

    79 }

    81 int ucx_mempool_chcap(UcxMempool *pool, size_t newcap) {

    82     void **data = (void**) realloc(pool->data, newcap*sizeof(void*));

    83     if (data) {

    84         pool->data = data;

    85         pool->size = newcap;

    86         return EXIT_SUCCESS;

    87     } else {

    88         return EXIT_FAILURE;

    89     }

    90 }

    92 void *ucx_mempool_malloc(UcxMempool *pool, size_t n) {

    93     if (pool->ndata >= pool->size) {

    94         // The hard coded 16 is documented for this function and ucx_mempool_new

    95         if (ucx_mempool_chcap(pool, pool->size + 16) == EXIT_FAILURE) {

    96             return NULL;

    97         }

    98     }

   100     ucx_memchunk *mem = (ucx_memchunk*)malloc(sizeof(ucx_destructor) + n);

   101     if (!mem) {

   102         return NULL;

   103     }

   105     mem->destructor = NULL;

   106     pool->data[pool->ndata] = mem;

   107     pool->ndata++;

   109     return &(mem->c);

   110 }

   112 void *ucx_mempool_calloc(UcxMempool *pool, size_t nelem, size_t elsize) {

   113     void *ptr = ucx_mempool_malloc(pool, nelem*elsize);

   114     if (!ptr) {

   115         return NULL;

   116     }

   117     memset(ptr, 0, nelem * elsize);

   118     return ptr;

   119 }

   121 void *ucx_mempool_realloc(UcxMempool *pool, void *ptr, size_t n) {

   122     char *mem = ((char*)ptr) - sizeof(ucx_destructor);

   123     char *newm = (char*) realloc(mem, n + sizeof(ucx_destructor));

   124     if (!newm) {

   125         return NULL;

   126     }

   127     if (mem != newm) {

   128         for(size_t i=0 ; i < pool->ndata ; i++) {

   129             if(pool->data[i] == mem) {

   130                 pool->data[i] = newm;

   131                 return newm + sizeof(ucx_destructor);

   132             }

   133         }

   134         fprintf(stderr, "FATAL: 0x%08" PRIxPTR" not in mpool 0x%08" PRIxPTR"\n",

   135           (intptr_t)ptr, (intptr_t)pool);

   136         exit(EXIT_FAILURE);

   137     } else {

   138         return newm + sizeof(ucx_destructor);

   139     }

   140 }

   142 void ucx_mempool_free(UcxMempool *pool, void *ptr) {

   143     ucx_memchunk *chunk = (ucx_memchunk*)((char*)ptr-sizeof(ucx_destructor));

   144     for(size_t i=0 ; i<pool->ndata ; i++) {

   145         if(chunk == pool->data[i]) {

   146             if(chunk->destructor != NULL) {

   147                 chunk->destructor(&(chunk->c));

   148             }

   149             free(chunk);

   150             size_t last_index = pool->ndata - 1;

   151             if(i != last_index) {

   152                 pool->data[i] = pool->data[last_index];

   153                 pool->data[last_index] = NULL;

   154             }

   155             pool->ndata--;

   156             return;

   157         }

   158     }

   159     fprintf(stderr, "FATAL: 0x%08" PRIxPTR" not in mpool 0x%08" PRIxPTR"\n",

   160             (intptr_t)ptr, (intptr_t)pool);

   161     exit(EXIT_FAILURE);

   162 }

   164 void ucx_mempool_destroy(UcxMempool *pool) {

   165     ucx_memchunk *chunk;

   166     for(size_t i=0 ; i<pool->ndata ; i++) {

   167         chunk = (ucx_memchunk*) pool->data[i];

   168         if(chunk) {

   169             if(chunk->destructor) {

   170                 chunk->destructor(&(chunk->c));

   171             }

   172             free(chunk);

   173         }

   174     }

   175     free(pool->data);

   176     free(pool);

   177 }

   179 void ucx_mempool_set_destr(void *ptr, ucx_destructor func) {

   180     *(ucx_destructor*)((char*)ptr-sizeof(ucx_destructor)) = func;

   181 }

   183 void ucx_mempool_reg_destr(UcxMempool *pool, void *ptr, ucx_destructor destr) {

   184     ucx_regdestr *rd = (ucx_regdestr*)ucx_mempool_malloc(

   185             pool,

   186             sizeof(ucx_regdestr));

   187     rd->destructor = destr;

   188     rd->ptr = ptr;

   189     ucx_mempool_set_destr(rd, ucx_mempool_shared_destr);

   190 }

   192 UcxAllocator* ucx_mempool_allocator(UcxMempool *pool) {

   193     UcxAllocator *allocator = (UcxAllocator*)ucx_mempool_malloc(

   194             pool, sizeof(UcxAllocator));

   195     if(!allocator) {

   196         return NULL;

   197     }

   198     allocator->malloc = (ucx_allocator_malloc)ucx_mempool_malloc;

   199     allocator->calloc = (ucx_allocator_calloc)ucx_mempool_calloc;

   200     allocator->realloc = (ucx_allocator_realloc)ucx_mempool_realloc;

   201     allocator->free = (ucx_allocator_free)ucx_mempool_free;

   202     allocator->pool = pool;

   203     return allocator;

   204 }

Mercurial > hg > ucx / file revision