memory.c

Go to the documentation of this file.

/* ************************************************************************** */
/*      ____    _    _____ ____     _    _   _   _____ _  _   ____  ____      */
/*     / ___|  / \  |  ___|  _ \   / \  | \ | | |_   _| || | |  _ \/ ___|     */
/*     \___ \ / _ \ | |_  | |_) | / _ \ |  \| |   | | | || |_| | | \___ \     */
/*      ___) / ___ \|  _| |  _ < / ___ \| |\  |   | | |__   _| |_| |___) |    */
/*     |____/_/   \_|_|   |_| \_/_/   \_|_| \_|   |_|    |_| |____/|____/     */
/*                                                                            */
/* ************************************************************************** */
 
#include "private.h"
 
#include "o2s/array.h"
 
#include <stdlib.h> // reallocarray

size_t array_offset(const array_t* self, size_t count)
{
    return (count * self->type_size);
}

static bool array_realloc(array_t* self, size_t capacity_to_alloc)
{
    void* new_storage = reallocarray(self->start, capacity_to_alloc, self->type_size);
    if (new_storage == NULL)
        return false;
    self->start    = new_storage;
    self->capacity = capacity_to_alloc;
    return true;
}

bool array_reserve(array_t* self, size_t count)
{
    const size_t wanted   = self->count + count;
    size_t       required = self->capacity;
 
    if (wanted <= self->capacity)
        return true;
    if (required == 0)
        required = ARRAY_INITIAL_SIZE;
    while (required < wanted)
        required *= ARRAY_GROWTH_FACTOR;
    return array_realloc(self, required);
}

bool array_trim(array_t* self)
{
    return array_realloc(self, self->count);
}