amath/lib/clib/mem.c

/*
 * Copyright (c) 2015-2017 Carsten Sonne Larsen  <cs@innolan.dk>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 */

#include "mem.h"
#include "clib.h"

#ifdef AMIGA
#include <stddef.h>
#include <exec/types.h>
#include <exec/memory.h>
#include <exec/semaphores.h>
#include <clib/exec_protos.h>
#define ALLOC_MEM(x) AllocVec(x, MEMF_ANY | MEMF_CLEAR)
#define FREE_MEM(x) FreeVec(x)
#define Debug(x,y,z)
#else
#include <stdlib.h>
#define ALLOC_MEM(x) calloc(1L,x)
#define FREE_MEM(x) free(x)
#define Debug(x,y,z)
#endif

#if defined(__x86_64__) || defined(__aarch64__) || \
    defined(_M_AMD64)   || defined(_M_ARM64)    || \
    defined(__powerpc64__)
#define P64BIT
#endif

/**
 * @brief Block of allocated memory.
 */
struct MemoryBlock
{
    struct MemoryBlock *next;
    size_t size;
    void *address;
};

/**
 * @brief List of allocated memory. Uses the LIFO principle.
 */
struct MemoryList
{
    struct MemoryBlock *first;
    size_t peak;
    size_t size;
    long count;
};

/**
 * @brief Global list of allocated memory.
 */
struct MemoryList *list = NULL;

void alloc_error(char*, size_t);
void dealloc_error(char*, void*);

/**
 * @brief Allocate memory and add it to the global memory list.
 */
void* AllocMemSafe(size_t size)
{
    struct MemoryBlock *newblock;
    size_t allocsize;

    if (list == NULL) {
        list = (struct MemoryList*)ALLOC_MEM(sizeof(struct MemoryList));
        if (!list) {
            alloc_error("list", sizeof(struct MemoryList));
            return 0;
        }

        list->first = NULL;
        list->peak = 0;
        list->size = 0;
        list->count = 0;
    }

#ifdef P64BIT
    // Align to bytes of 8
    allocsize = (size + 7) & ~0x07;
#else
    // Align to bytes of 4
    allocsize = (size + 3) & ~0x03;
#endif

    newblock = (struct MemoryBlock*)ALLOC_MEM(sizeof(struct MemoryBlock));
    if (!newblock) {
        alloc_error("block", sizeof(struct MemoryBlock));
        return 0;
    }

    newblock->address = (struct MemoryBlock*)ALLOC_MEM(allocsize);
    if (!newblock->address) {
        FREE_MEM(newblock);
        alloc_error("memory", allocsize);
        return 0;
    }

    newblock->size = allocsize;
    newblock->next = list->first;
    list->first = newblock;
    list->size += allocsize;
    list->count++;

    if (list->size > list->peak) {
        list->peak = list->size;
    }

    // Memory allocated
    return newblock->address;
}

/**
 * @brief Deallocate memory from the global memory list.
 */
void FreeMemSafe(void* block)
{
    struct MemoryBlock *current, *previous;

    if (list == NULL || block == NULL) {
        dealloc_error("list", 0);
        return;
    }

    if (block == NULL) {
        dealloc_error("memory", 0);
        return;
    }

    previous = NULL;
    current = list->first;
    while (current != NULL && current->address != block) {
        previous = current;
        current = current->next;
    }

    if (current == NULL) {
        dealloc_error("address not found", block);
        return;
    }

    if (previous == NULL) {
        list->first = current->next;
    } else {
        previous->next = current->next;
    }

    list->size -= current->size;
    list->count--;

    FREE_MEM(current->address);
    current->address = NULL;
    current->next = NULL;
    current->size = 0;
    FREE_MEM(current);
}

/**
 * @brief Deallocate all memory in the global memory list.
 */
void FreeAllSafe()
{
    struct MemoryBlock *current, *next;

    if (list == NULL) {
        return;
    }

    current = list->first;
    while (current != NULL) {
        next = current->next;
        FREE_MEM(current->address);
        FREE_MEM(current);
        current = next;
    }

    FREE_MEM(list);
    list = NULL;
}

/**
 * @brief Get memory usage in the global memory list.
 */
void MemUsage(long *blocks, long *size, long *peak)
{
    *blocks = list->count;
    *size = (long)list->size;
    *peak = (long)list->peak;;
}

/**
 * @brief Log a memory allocation error
 */
void alloc_error(char *descr, size_t size)
{
    Debug("Memory allocation error (%s) with size (%d)\n", descr, size);
}

/**
 * @brief Log a memory deallocation error
 */
void dealloc_error(char *descr, void *p)
{
    Debug("Memory deallocation error (%s) address (%x)\n", descr, p);
}