comparison: ucx/allocator.c
ucx/allocator.c
- changeset 0
- 1a157da63d7c
- child 11
- 0aa8cbd7912e
equal
deleted
inserted
replaced
| -1:000000000000 | 0:1a157da63d7c |
|---|---|
| 1 /* | |
| 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. | |
| 3 * | |
| 4 * Copyright 2021 Mike Becker, 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 */ | |
| 28 | |
| 29 #include "cx/allocator.h" | |
| 30 | |
| 31 __attribute__((__malloc__, __alloc_size__(2))) | |
| 32 static void *cx_malloc_stdlib( | |
| 33 __attribute__((__unused__)) void *d, | |
| 34 size_t n | |
| 35 ) { | |
| 36 return malloc(n); | |
| 37 } | |
| 38 | |
| 39 __attribute__((__warn_unused_result__, __alloc_size__(3))) | |
| 40 static void *cx_realloc_stdlib( | |
| 41 __attribute__((__unused__)) void *d, | |
| 42 void *mem, | |
| 43 size_t n | |
| 44 ) { | |
| 45 return realloc(mem, n); | |
| 46 } | |
| 47 | |
| 48 __attribute__((__malloc__, __alloc_size__(2, 3))) | |
| 49 static void *cx_calloc_stdlib( | |
| 50 __attribute__((__unused__)) void *d, | |
| 51 size_t nelem, | |
| 52 size_t n | |
| 53 ) { | |
| 54 return calloc(nelem, n); | |
| 55 } | |
| 56 | |
| 57 __attribute__((__nonnull__)) | |
| 58 static void cx_free_stdlib( | |
| 59 __attribute__((__unused__)) void *d, | |
| 60 void *mem | |
| 61 ) { | |
| 62 free(mem); | |
| 63 } | |
| 64 | |
| 65 static cx_allocator_class cx_default_allocator_class = { | |
| 66 cx_malloc_stdlib, | |
| 67 cx_realloc_stdlib, | |
| 68 cx_calloc_stdlib, | |
| 69 cx_free_stdlib | |
| 70 }; | |
| 71 | |
| 72 struct cx_allocator_s cx_default_allocator = { | |
| 73 &cx_default_allocator_class, | |
| 74 NULL | |
| 75 }; | |
| 76 CxAllocator *cxDefaultAllocator = &cx_default_allocator; | |
| 77 | |
| 78 | |
| 79 int cx_reallocate( | |
| 80 void **mem, | |
| 81 size_t n | |
| 82 ) { | |
| 83 void *nmem = realloc(*mem, n); | |
| 84 if (nmem == NULL) { | |
| 85 return 1; | |
| 86 } else { | |
| 87 *mem = nmem; | |
| 88 return 0; | |
| 89 } | |
| 90 } | |
| 91 | |
| 92 // IMPLEMENTATION OF HIGH LEVEL API | |
| 93 | |
| 94 void *cxMalloc( | |
| 95 CxAllocator const *allocator, | |
| 96 size_t n | |
| 97 ) { | |
| 98 return allocator->cl->malloc(allocator->data, n); | |
| 99 } | |
| 100 | |
| 101 void *cxRealloc( | |
| 102 CxAllocator const *allocator, | |
| 103 void *mem, | |
| 104 size_t n | |
| 105 ) { | |
| 106 return allocator->cl->realloc(allocator->data, mem, n); | |
| 107 } | |
| 108 | |
| 109 int cxReallocate( | |
| 110 CxAllocator const *allocator, | |
| 111 void **mem, | |
| 112 size_t n | |
| 113 ) { | |
| 114 void *nmem = allocator->cl->realloc(allocator->data, *mem, n); | |
| 115 if (nmem == NULL) { | |
| 116 return 1; | |
| 117 } else { | |
| 118 *mem = nmem; | |
| 119 return 0; | |
| 120 } | |
| 121 } | |
| 122 | |
| 123 void *cxCalloc( | |
| 124 CxAllocator const *allocator, | |
| 125 size_t nelem, | |
| 126 size_t n | |
| 127 ) { | |
| 128 return allocator->cl->calloc(allocator->data, nelem, n); | |
| 129 } | |
| 130 | |
| 131 void cxFree( | |
| 132 CxAllocator const *allocator, | |
| 133 void *mem | |
| 134 ) { | |
| 135 allocator->cl->free(allocator->data, mem); | |
| 136 } |
