universe@422: /*
universe@422:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@422:  *
universe@422:  * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
universe@422:  *
universe@422:  * Redistribution and use in source and binary forms, with or without
universe@422:  * modification, are permitted provided that the following conditions are met:
universe@422:  *
universe@422:  *   1. Redistributions of source code must retain the above copyright
universe@422:  *      notice, this list of conditions and the following disclaimer.
universe@422:  *
universe@422:  *   2. Redistributions in binary form must reproduce the above copyright
universe@422:  *      notice, this list of conditions and the following disclaimer in the
universe@422:  *      documentation and/or other materials provided with the distribution.
universe@422:  *
universe@422:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@422:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@422:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@422:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@422:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@422:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@422:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@422:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@422:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@422:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@422:  * POSSIBILITY OF SUCH DAMAGE.
universe@422:  */
universe@422: 
universe@422: #include "util_allocator.h"
universe@422: #include <string.h>
universe@422: 
universe@422: void cx_testing_allocator_add(cx_testing_allocator_s *data, void *ptr) {
universe@422:     data->tracked[data->live] = ptr;
universe@422:     data->live++;
universe@422: }
universe@422: 
universe@422: int cx_testing_allocator_remove(cx_testing_allocator_s *data, void *ptr) {
universe@422:     for (int i = 0; i < data->live; i++) {
universe@422:         if (data->tracked[i] == ptr) {
universe@422:             data->tracked[i] = data->tracked[data->live - 1];
universe@422:             data->live--;
universe@422:             return 0;
universe@422:         }
universe@422:     }
universe@422:     return 1;
universe@422: }
universe@422: 
universe@422: void *cx_malloc_testing(void *d, size_t n) {
universe@422:     cx_testing_allocator_s *data = d;
universe@422:     void *ptr = malloc(n);
universe@422:     data->alloc_total++;
universe@422:     if (ptr == NULL) {
universe@422:         data->alloc_failed++;
universe@422:     } else {
universe@422:         cx_testing_allocator_add(data, ptr);
universe@422:     }
universe@422:     return ptr;
universe@422: }
universe@422: 
universe@422: void *cx_realloc_testing(void *d, void *mem, size_t n) {
universe@422:     cx_testing_allocator_s *data = d;
universe@422:     void *ptr = realloc(mem, n);
universe@422:     if (ptr == mem) {
universe@422:         return ptr;
universe@422:     } else {
universe@422:         data->alloc_total++;
universe@422:         if (ptr == NULL) {
universe@422:             data->alloc_failed++;
universe@422:         } else {
universe@422:             data->free_total++;
universe@422:             if (cx_testing_allocator_remove(data, mem)) {
universe@422:                 data->free_failed++;
universe@422:             }
universe@422:             cx_testing_allocator_add(data, ptr);
universe@422:         }
universe@422:         return ptr;
universe@422:     }
universe@422: }
universe@422: 
universe@422: void *cx_calloc_testing(void *d, size_t nelem, size_t n) {
universe@422:     cx_testing_allocator_s *data = d;
universe@422:     void *ptr = calloc(nelem, n);
universe@422:     data->alloc_total++;
universe@422:     if (ptr == NULL) {
universe@422:         data->alloc_failed++;
universe@422:     } else {
universe@422:         cx_testing_allocator_add(data, ptr);
universe@422:     }
universe@422:     return ptr;
universe@422: }
universe@422: 
universe@422: void cx_free_testing(void *d, void *mem) {
universe@422:     cx_testing_allocator_s *data = d;
universe@422:     data->free_total++;
universe@422:     if (cx_testing_allocator_remove(data, mem)) {
universe@422:         data->free_failed++;
universe@422:         // do not even attempt to free mem, because it is likely to segfault
universe@422:     } else {
universe@422:         free(mem);
universe@422:     }
universe@422: }
universe@422: 
universe@422: cx_allocator_class cx_testing_allocator_class = {
universe@422:         cx_malloc_testing,
universe@422:         cx_realloc_testing,
universe@422:         cx_calloc_testing,
universe@422:         cx_free_testing
universe@422: };
universe@422: 
universe@422: cx_testing_allocator_s cx_testing_allocator_data;
universe@422: 
universe@422: struct cx_allocator_s cx_testing_allocator = {
universe@422:         &cx_testing_allocator_class,
universe@422:         &cx_testing_allocator_data
universe@422: };
universe@422: CxAllocator cxTestingAllocator = &cx_testing_allocator;
universe@422: 
universe@422: void cxTestingAllocatorReset(void) {
universe@422:     memset(&cx_testing_allocator_data, 0, sizeof(cx_testing_allocator_s));
universe@422: }
universe@422: 
universe@422: int cxTestingAllocatorVerify(void) {
universe@422:     return cx_testing_allocator_data.live == 0
universe@422:            && cx_testing_allocator_data.alloc_failed == 0 && cx_testing_allocator_data.free_failed == 0
universe@422:            && cx_testing_allocator_data.alloc_total == cx_testing_allocator_data.free_total;
universe@422: }