Tue, 28 Dec 2021 17:49:52 +0100
fix missing cleanup in test_hl_linked_list_from_array
universe@391 | 1 | /* |
universe@391 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@391 | 3 | * |
universe@391 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
universe@391 | 5 | * |
universe@391 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@391 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@391 | 8 | * |
universe@391 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@391 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@391 | 11 | * |
universe@391 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@391 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@391 | 14 | * documentation and/or other materials provided with the distribution. |
universe@391 | 15 | * |
universe@391 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@391 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@391 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@391 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@391 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@391 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@391 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@391 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@391 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@391 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@391 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@391 | 27 | */ |
universe@391 | 28 | |
universe@391 | 29 | #include "cx/allocator.h" |
universe@391 | 30 | |
universe@391 | 31 | #include <stdlib.h> |
universe@391 | 32 | |
universe@452 | 33 | __attribute__((__malloc__, __alloc_size__(2))) |
universe@450 | 34 | static void *cx_malloc_stdlib(__attribute__((__unused__)) void *d, size_t n) { |
universe@397 | 35 | return malloc(n); |
universe@397 | 36 | } |
universe@397 | 37 | |
universe@452 | 38 | __attribute__((__warn_unused_result__, __alloc_size__(3))) |
universe@450 | 39 | static void *cx_realloc_stdlib(__attribute__((__unused__)) void *d, void *mem, size_t n) { |
universe@397 | 40 | return realloc(mem, n); |
universe@397 | 41 | } |
universe@397 | 42 | |
universe@452 | 43 | __attribute__((__malloc__, __alloc_size__(2, 3))) |
universe@450 | 44 | static void *cx_calloc_stdlib(__attribute__((__unused__)) void *d, size_t nelem, size_t n) { |
universe@397 | 45 | return calloc(nelem, n); |
universe@397 | 46 | } |
universe@397 | 47 | |
universe@450 | 48 | __attribute__((__nonnull__)) |
universe@450 | 49 | static void cx_free_stdlib(__attribute__((__unused__)) void *d, void *mem) { |
universe@397 | 50 | free(mem); |
universe@397 | 51 | } |
universe@397 | 52 | |
universe@450 | 53 | static cx_allocator_class cx_default_allocator_class = { |
universe@396 | 54 | cx_malloc_stdlib, |
universe@396 | 55 | cx_realloc_stdlib, |
universe@396 | 56 | cx_calloc_stdlib, |
universe@396 | 57 | cx_free_stdlib |
universe@396 | 58 | }; |
universe@396 | 59 | |
universe@391 | 60 | struct cx_allocator_s cx_default_allocator = { |
universe@396 | 61 | &cx_default_allocator_class, |
universe@391 | 62 | NULL |
universe@391 | 63 | }; |
universe@391 | 64 | CxAllocator cxDefaultAllocator = &cx_default_allocator; |
universe@391 | 65 | |
universe@434 | 66 | /* IMPLEMENTATION OF HIGH LEVEL API */ |
universe@434 | 67 | |
universe@397 | 68 | void *cxMalloc(CxAllocator allocator, size_t n) { |
universe@396 | 69 | return allocator->cl->malloc(allocator->data, n); |
universe@394 | 70 | } |
universe@394 | 71 | |
universe@397 | 72 | void *cxRealloc(CxAllocator allocator, void *mem, size_t n) { |
universe@396 | 73 | return allocator->cl->realloc(allocator->data, mem, n); |
universe@394 | 74 | } |
universe@394 | 75 | |
universe@414 | 76 | int cxReallocate(CxAllocator allocator, void **mem, size_t n) { |
universe@450 | 77 | void *nmem = allocator->cl->realloc(allocator->data, *mem, n); |
universe@414 | 78 | if (nmem == NULL) { |
universe@414 | 79 | return 1; |
universe@414 | 80 | } else { |
universe@414 | 81 | *mem = nmem; |
universe@414 | 82 | return 0; |
universe@414 | 83 | } |
universe@414 | 84 | } |
universe@414 | 85 | |
universe@397 | 86 | void *cxCalloc(CxAllocator allocator, size_t nelem, size_t n) { |
universe@396 | 87 | return allocator->cl->calloc(allocator->data, nelem, n); |
universe@394 | 88 | } |
universe@394 | 89 | |
universe@397 | 90 | void cxFree(CxAllocator allocator, void *mem) { |
universe@396 | 91 | allocator->cl->free(allocator->data, mem); |
universe@397 | 92 | } |