test/util_allocator.c

changeset 422
afd87df80b13
child 494
6ce8cfa10a96
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/test/util_allocator.c	Sun Sep 26 14:41:16 2021 +0200
     1.3 @@ -0,0 +1,126 @@
     1.4 +/*
     1.5 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
     1.6 + *
     1.7 + * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
     1.8 + *
     1.9 + * Redistribution and use in source and binary forms, with or without
    1.10 + * modification, are permitted provided that the following conditions are met:
    1.11 + *
    1.12 + *   1. Redistributions of source code must retain the above copyright
    1.13 + *      notice, this list of conditions and the following disclaimer.
    1.14 + *
    1.15 + *   2. Redistributions in binary form must reproduce the above copyright
    1.16 + *      notice, this list of conditions and the following disclaimer in the
    1.17 + *      documentation and/or other materials provided with the distribution.
    1.18 + *
    1.19 + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    1.20 + * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    1.21 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    1.22 + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
    1.23 + * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    1.24 + * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    1.25 + * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    1.26 + * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    1.27 + * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    1.28 + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    1.29 + * POSSIBILITY OF SUCH DAMAGE.
    1.30 + */
    1.31 +
    1.32 +#include "util_allocator.h"
    1.33 +#include <string.h>
    1.34 +
    1.35 +void cx_testing_allocator_add(cx_testing_allocator_s *data, void *ptr) {
    1.36 +    data->tracked[data->live] = ptr;
    1.37 +    data->live++;
    1.38 +}
    1.39 +
    1.40 +int cx_testing_allocator_remove(cx_testing_allocator_s *data, void *ptr) {
    1.41 +    for (int i = 0; i < data->live; i++) {
    1.42 +        if (data->tracked[i] == ptr) {
    1.43 +            data->tracked[i] = data->tracked[data->live - 1];
    1.44 +            data->live--;
    1.45 +            return 0;
    1.46 +        }
    1.47 +    }
    1.48 +    return 1;
    1.49 +}
    1.50 +
    1.51 +void *cx_malloc_testing(void *d, size_t n) {
    1.52 +    cx_testing_allocator_s *data = d;
    1.53 +    void *ptr = malloc(n);
    1.54 +    data->alloc_total++;
    1.55 +    if (ptr == NULL) {
    1.56 +        data->alloc_failed++;
    1.57 +    } else {
    1.58 +        cx_testing_allocator_add(data, ptr);
    1.59 +    }
    1.60 +    return ptr;
    1.61 +}
    1.62 +
    1.63 +void *cx_realloc_testing(void *d, void *mem, size_t n) {
    1.64 +    cx_testing_allocator_s *data = d;
    1.65 +    void *ptr = realloc(mem, n);
    1.66 +    if (ptr == mem) {
    1.67 +        return ptr;
    1.68 +    } else {
    1.69 +        data->alloc_total++;
    1.70 +        if (ptr == NULL) {
    1.71 +            data->alloc_failed++;
    1.72 +        } else {
    1.73 +            data->free_total++;
    1.74 +            if (cx_testing_allocator_remove(data, mem)) {
    1.75 +                data->free_failed++;
    1.76 +            }
    1.77 +            cx_testing_allocator_add(data, ptr);
    1.78 +        }
    1.79 +        return ptr;
    1.80 +    }
    1.81 +}
    1.82 +
    1.83 +void *cx_calloc_testing(void *d, size_t nelem, size_t n) {
    1.84 +    cx_testing_allocator_s *data = d;
    1.85 +    void *ptr = calloc(nelem, n);
    1.86 +    data->alloc_total++;
    1.87 +    if (ptr == NULL) {
    1.88 +        data->alloc_failed++;
    1.89 +    } else {
    1.90 +        cx_testing_allocator_add(data, ptr);
    1.91 +    }
    1.92 +    return ptr;
    1.93 +}
    1.94 +
    1.95 +void cx_free_testing(void *d, void *mem) {
    1.96 +    cx_testing_allocator_s *data = d;
    1.97 +    data->free_total++;
    1.98 +    if (cx_testing_allocator_remove(data, mem)) {
    1.99 +        data->free_failed++;
   1.100 +        // do not even attempt to free mem, because it is likely to segfault
   1.101 +    } else {
   1.102 +        free(mem);
   1.103 +    }
   1.104 +}
   1.105 +
   1.106 +cx_allocator_class cx_testing_allocator_class = {
   1.107 +        cx_malloc_testing,
   1.108 +        cx_realloc_testing,
   1.109 +        cx_calloc_testing,
   1.110 +        cx_free_testing
   1.111 +};
   1.112 +
   1.113 +cx_testing_allocator_s cx_testing_allocator_data;
   1.114 +
   1.115 +struct cx_allocator_s cx_testing_allocator = {
   1.116 +        &cx_testing_allocator_class,
   1.117 +        &cx_testing_allocator_data
   1.118 +};
   1.119 +CxAllocator cxTestingAllocator = &cx_testing_allocator;
   1.120 +
   1.121 +void cxTestingAllocatorReset(void) {
   1.122 +    memset(&cx_testing_allocator_data, 0, sizeof(cx_testing_allocator_s));
   1.123 +}
   1.124 +
   1.125 +int cxTestingAllocatorVerify(void) {
   1.126 +    return cx_testing_allocator_data.live == 0
   1.127 +           && cx_testing_allocator_data.alloc_failed == 0 && cx_testing_allocator_data.free_failed == 0
   1.128 +           && cx_testing_allocator_data.alloc_total == cx_testing_allocator_data.free_total;
   1.129 +}

mercurial