template.h File Reference

#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <derive-c/core/helpers.h>
#include <derive-c/core/panic.h>
#include <derive-c/core/alloc/def.h>
#include <derive-c/core/self/def.h>
#include <derive-c/core/alloc/undef.h>
#include <derive-c/core/self/undef.h>

Include dependency graph for template.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	value_t
struct	INDEX
struct	SLOT
struct	SELF
	An allocator that prints to stdout when it allocates or frees memory. More...
struct	IV_PAIR
struct	IV_PAIR_CONST

Macros
#define	INDEX_BITS   32
	A vector-backed arena, with support for small indices.
#define	VALUE   value_t
#define	VALUE_DELETE   value_delete
#define	VALUE_CLONE   value_clone
#define	SLOT   NS(SELF, slot)
#define	CHECK_ACCESS_INDEX(self, index)
#define	RESIZE_FACTOR   2
#define	INDEX   NS(SELF, index)
#define	IV_PAIR   NS(SELF, iv)
#define	IV_PAIR_CONST   NS(SELF, iv_const)

Functions
static void	value_delete (value_t *UNUSED(self))
static value_t	value_clone (value_t const *self)
static SELF	new_with_capacity_for (INDEX_TYPE items, ALLOC *alloc)
static INDEX	insert (SELF *self, VALUE value)
static VALUE *	try_write (SELF *self, INDEX index)
static VALUE *	write (SELF *self, INDEX index)
static VALUE const *	try_read (SELF const *self, INDEX index)
static VALUE const *	read (SELF const *self, INDEX index)
static SELF	clone (SELF const *self)
static INDEX_TYPE	size (SELF const *self)
static bool	full (SELF const *self)
static bool	try_remove (SELF *self, INDEX index, VALUE *destination)
static VALUE	remove (SELF *self, INDEX index)
static bool	delete_entry (SELF *self, INDEX index)
static bool	empty (ITER const *iter)
static IV_PAIR const *	next (ITER *iter)
static ITER	get_iter (SELF *self)
static void	delete (SELF *self)
static bool	empty (ITER_CONST const *iter)
static IV_PAIR_CONST const *	next (ITER_CONST *iter)
static ITER_CONST	get_iter_const (SELF const *self)

Variables
static size_t	max_capacity = MAX_CAPACITY
static size_t	max_index = MAX_INDEX
static IV_PAIR_CONST	iv_const_empty

Macro Definition Documentation

CHECK_ACCESS_INDEX

#define CHECK_ACCESS_INDEX	(		self,
			index )

Value:

((index).index < (self)->exclusive_end)

Definition at line 69 of file template.h.

INDEX

#define INDEX   NS(SELF, index)

Definition at line 76 of file template.h.

INDEX_BITS

#define INDEX_BITS   32

A vector-backed arena, with support for small indices.

Definition at line 19 of file template.h.

IV_PAIR

#define IV_PAIR   NS(SELF, iv)

Definition at line 280 of file template.h.

IV_PAIR_CONST

#define IV_PAIR_CONST   NS(SELF, iv_const)

Definition at line 346 of file template.h.

RESIZE_FACTOR

#define RESIZE_FACTOR   2

Definition at line 73 of file template.h.

SLOT

#define SLOT   NS(SELF, slot)

Definition at line 67 of file template.h.

VALUE

#define VALUE   value_t

Definition at line 29 of file template.h.

VALUE_CLONE

#define VALUE_CLONE   value_clone

Definition at line 33 of file template.h.

VALUE_DELETE

#define VALUE_DELETE   value_delete

Definition at line 31 of file template.h.

Function Documentation

clone()

SELF clone ( SELF const * self )

static

Definition at line 195 of file template.h.

                                              {
    DEBUG_ASSERT(self);
    SLOT* slots = (SLOT*)NS(ALLOC, calloc)(self->alloc, self->capacity, sizeof(SLOT));
    ASSERT(slots);
 
    for (INDEX_TYPE index = 0; index < self->exclusive_end; index++) {
        if (self->slots[index].present) {
            slots[index].present = true;
            slots[index].value = VALUE_CLONE(&self->slots[index].value);
        } else {
            slots[index].present = false;
            slots[index].next_free = self->slots[index].next_free;
        }
    }
 
    return (SELF){
        .slots = slots,
        .capacity = self->capacity,
        .free_list = self->free_list,
        .exclusive_end = self->exclusive_end,
        .count = self->count,
        .alloc = self->alloc,
    };
}

Here is the call graph for this function:

Here is the caller graph for this function:

delete()

void delete ( SELF * self )

static

Definition at line 332 of file template.h.

                                         {
    DEBUG_ASSERT(self);
    ITER iter = NS(SELF, get_iter)(self);
    IV_PAIR const* entry;
    while ((entry = NS(ITER, next)(&iter))) {
        VALUE_DELETE(entry->value);
    }
 
    NS(ALLOC, free)(self->alloc, self->slots);
}

Here is the call graph for this function:

delete_entry()

bool delete_entry ( SELF * self, INDEX index )

static

Definition at line 262 of file template.h.

                                                            {
    DEBUG_ASSERT(self);
    if (!CHECK_ACCESS_INDEX(self, index)) {
        return false;
    }
 
    SLOT* entry = &self->slots[index.index];
    if (entry->present) {
        VALUE_DELETE(&entry->value);
        entry->present = false;
        entry->next_free = self->free_list;
        self->free_list = index.index;
        self->count--;
        return true;
    }
    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

empty() [1/2]

bool empty ( ITER const * iter )

static

Definition at line 293 of file template.h.

                                              {
    DEBUG_ASSERT(iter);
    // JUSTIFY: If no entries are left, then the previous '.._next' call moved
    //          the index to the exclusive end
    // NOTE: `index + 1 > exclusive_end` implies `index >= exclusive_end`
    return iter->next_index == INDEX_NONE || iter->next_index >= iter->arena->exclusive_end;
}

Here is the call graph for this function:

Here is the caller graph for this function:

empty() [2/2]

bool empty ( ITER_CONST const * iter )

static

Definition at line 364 of file template.h.

                                                          {
    DEBUG_ASSERT(iter);
    return iter->next_index == INDEX_NONE || iter->next_index >= iter->arena->exclusive_end;
}

Here is the call graph for this function:

full()

bool full ( SELF const * self )

static

Definition at line 225 of file template.h.

                                             {
    DEBUG_ASSERT(self);
    if (self->capacity == MAX_CAPACITY) {
        if (self->free_list == INDEX_NONE) {
            return true;
        }
    }
    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

get_iter()

ITER get_iter ( SELF * self )

static

Definition at line 318 of file template.h.

                                           {
    DEBUG_ASSERT(self);
    INDEX_TYPE index = 0;
    while (index < INDEX_NONE && index < self->exclusive_end && !self->slots[index].present) {
        index++;
    }
 
    return (ITER){
        .arena = self,
        .next_index = index,
        .curr = (IV_PAIR){.index = (INDEX){.index = INDEX_NONE}, .value = NULL},
    };
}

Here is the call graph for this function:

Here is the caller graph for this function:

get_iter_const()

ITER_CONST get_iter_const ( SELF const * self )

static

Definition at line 387 of file template.h.

                                                             {
    DEBUG_ASSERT(self);
    INDEX_TYPE index = 0;
    while (index < INDEX_NONE && index < self->exclusive_end && !self->slots[index].present) {
        index++;
    }
 
    return (ITER_CONST){
        .arena = self,
        .next_index = index,
        .curr = (IV_PAIR_CONST){.index = (INDEX){.index = INDEX_NONE}, .value = NULL},
    };
}

Here is the call graph for this function:

Here is the caller graph for this function:

insert()

INDEX insert ( SELF * self, VALUE value )

static

Definition at line 129 of file template.h.

                                                       {
    DEBUG_ASSERT(self);
    if (self->free_list != INDEX_NONE) {
        INDEX_TYPE free_index = self->free_list;
        SLOT* slot = &self->slots[free_index];
        DEBUG_ASSERT(!slot->present);
        self->free_list = slot->next_free;
        slot->present = true;
        slot->value = value;
        self->count++;
        return (INDEX){.index = free_index};
    }
 
    if (self->exclusive_end == self->capacity) {
        ASSERT(self->capacity <= (MAX_CAPACITY / RESIZE_FACTOR));
        self->capacity *= RESIZE_FACTOR;
        SLOT* new_alloc = (SLOT*)realloc(self->slots, self->capacity * sizeof(SLOT));
        ASSERT(new_alloc);
        self->slots = new_alloc;
    }
 
    INDEX_TYPE new_index = self->exclusive_end;
    SLOT* slot = &self->slots[new_index];
    slot->present = true;
    slot->value = value;
    self->count++;
    self->exclusive_end++;
    return (INDEX){.index = new_index};
}

Here is the call graph for this function:

Here is the caller graph for this function:

new_with_capacity_for()

SELF new_with_capacity_for ( INDEX_TYPE items, ALLOC * alloc )

static

Definition at line 113 of file template.h.

                                                                            {
    DEBUG_ASSERT(items > 0);
    size_t capacity = next_power_of_2(items);
    ASSERT(capacity <= MAX_CAPACITY);
    SLOT* slots = (SLOT*)NS(ALLOC, calloc)(alloc, capacity, sizeof(SLOT));
    ASSERT(slots);
    return (SELF){
        .slots = slots,
        .capacity = (INDEX_TYPE)capacity,
        .free_list = INDEX_NONE,
        .exclusive_end = 0,
        .count = 0,
        .alloc = alloc,
    };
}

Here is the call graph for this function:

Here is the caller graph for this function:

next() [1/2]

IV_PAIR const * next ( ITER * iter )

static

Definition at line 301 of file template.h.

                                                 {
    DEBUG_ASSERT(iter);
 
    if (NS(ITER, empty)(iter)) {
        return NULL;
    }
    iter->curr = (IV_PAIR){.index = (INDEX){.index = iter->next_index},
                           .value = &iter->arena->slots[iter->next_index].value};
    iter->next_index++;
    while (iter->next_index < INDEX_NONE && iter->next_index < iter->arena->exclusive_end &&
           !iter->arena->slots[iter->next_index].present) {
        iter->next_index++;
    }
 
    return &iter->curr;
}

Here is the call graph for this function:

Here is the caller graph for this function:

next() [2/2]

IV_PAIR_CONST const * next ( ITER_CONST * iter )

static

Definition at line 369 of file template.h.

                                                                   {
    DEBUG_ASSERT(iter);
 
    if (NS(ITER_CONST, empty)(iter)) {
        return NULL;
    }
 
    iter->curr = (IV_PAIR_CONST){.index = (INDEX){.index = iter->next_index},
                                 .value = &iter->arena->slots[iter->next_index].value};
    iter->next_index++;
    while (iter->next_index != INDEX_NONE && iter->next_index < iter->arena->exclusive_end &&
           !iter->arena->slots[iter->next_index].present) {
        iter->next_index++;
    }
 
    return &iter->curr;
}

Here is the call graph for this function:

read()

VALUE const * read ( SELF const * self, INDEX index )

static

Definition at line 189 of file template.h.

                                                                  {
    VALUE const* value = NS(SELF, try_read)(self, index);
    ASSERT(value);
    return value;
}

Here is the call graph for this function:

Here is the caller graph for this function:

remove()

VALUE remove ( SELF * self, INDEX index )

static

Definition at line 256 of file template.h.

                                                       {
    VALUE value;
    ASSERT(NS(SELF, try_remove)(self, index, &value));
    return value;
}

Here is the call graph for this function:

Here is the caller graph for this function:

size()

INDEX_TYPE size ( SELF const * self )

static

Examples

complex/prime_sieve.c.

Definition at line 220 of file template.h.

                                                   {
    DEBUG_ASSERT(self);
    return self->count;
}

Here is the call graph for this function:

Here is the caller graph for this function:

try_read()

VALUE const * try_read ( SELF const * self, INDEX index )

static

Definition at line 177 of file template.h.

                                                                      {
    DEBUG_ASSERT(self);
    if (!CHECK_ACCESS_INDEX(self, index)) {
        return NULL;
    }
    SLOT* slot = &self->slots[index.index];
    if (!slot->present) {
        return NULL;
    }
    return &slot->value;
}

Here is the call graph for this function:

Here is the caller graph for this function:

try_remove()

bool try_remove ( SELF * self, INDEX index, VALUE * destination )

static

Definition at line 238 of file template.h.

                                                                              {
    DEBUG_ASSERT(self);
    if (!CHECK_ACCESS_INDEX(self, index)) {
        return false;
    }
 
    SLOT* entry = &self->slots[index.index];
    if (entry->present) {
        *destination = entry->value;
        entry->present = false;
        entry->next_free = self->free_list;
        self->free_list = index.index;
        self->count--;
        return true;
    }
    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

try_write()

VALUE * try_write ( SELF * self, INDEX index )

static

Definition at line 159 of file template.h.

                                                           {
    DEBUG_ASSERT(self);
    if (!CHECK_ACCESS_INDEX(self, index)) {
        return NULL;
    }
    SLOT* slot = &self->slots[index.index];
    if (!slot->present) {
        return NULL;
    }
    return &slot->value;
}

Here is the call graph for this function:

Here is the caller graph for this function:

value_clone()

value_t value_clone ( value_t const * self )

static

Definition at line 32 of file template.h.

{ return *self; }

value_delete()

void value_delete ( value_t * UNUSEDself )

static

Definition at line 30 of file template.h.

{}

write()

VALUE * write ( SELF * self, INDEX index )

static

Definition at line 171 of file template.h.

                                                       {
    VALUE* value = NS(SELF, try_write)(self, index);
    ASSERT(value);
    return value;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

iv_const_empty

IV_PAIR_CONST iv_const_empty

static

Initial value:

= {
    .index = {.index = INDEX_NONE},
    .value = NULL,
}

Definition at line 352 of file template.h.

                                                {
    .index = {.index = INDEX_NONE},
    .value = NULL,
};

max_capacity

size_t max_capacity = MAX_CAPACITY

static

Definition at line 235 of file template.h.

max_index

size_t max_index = MAX_INDEX

static

Definition at line 236 of file template.h.