template.h File Reference

#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <derive-c/core.h>
#include <derive-c/panic.h>
#include <derive-c/self.h>
#include <derive-c/allocs/std.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	INDEX
struct	SLOT
struct	SELF
struct	IV_PAIR
struct	IV_PAIR_CONST

Macros
#define	ALLOC   stdalloc
	A vector-backed arena, with support for small indices.
#define	INDEX_BITS   32
#define	V   derive_c_parameter_value
#define	V_DELETE   derive_c_parameter_value_delete
#define	SLOT   NAME(SELF, SLOT)
#define	CHECK_ACCESS_INDEX(self, index)
#define	RESIZE_FACTOR   2
#define	INDEX   NAME(SELF, index)
#define	IV_PAIR   NAME(SELF, iv)
#define	IV_PAIR_CONST   NAME(SELF, iv_const)

Functions
static SELF	new_with_capacity_for (INDEX_TYPE items, ALLOC *alloc)
static INDEX	insert (SELF *self, V value)
static V *	try_write (SELF *self, INDEX index)
static V *	write (SELF *self, INDEX index)
static V const *	try_read (SELF const *self, INDEX index)
static V const *	read (SELF const *self, INDEX index)
static SELF	shallow_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, V *destination)
static V	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 size_t	position (ITER const *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 size_t	position (ITER_CONST 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

ALLOC

#define ALLOC   stdalloc

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

Definition at line 15 of file template.h.

CHECK_ACCESS_INDEX

#define CHECK_ACCESS_INDEX	(		self,
			index )

Value:

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

Definition at line 66 of file template.h.

INDEX

#define INDEX   NAME(SELF, index)

Definition at line 73 of file template.h.

INDEX_BITS

#define INDEX_BITS   32

Definition at line 22 of file template.h.

IV_PAIR

#define IV_PAIR   NAME(SELF, iv)

Definition at line 267 of file template.h.

IV_PAIR_CONST

#define IV_PAIR_CONST   NAME(SELF, iv_const)

Definition at line 341 of file template.h.

RESIZE_FACTOR

#define RESIZE_FACTOR   2

Definition at line 70 of file template.h.

SLOT

#define SLOT   NAME(SELF, SLOT)

Definition at line 64 of file template.h.

V

#define V   derive_c_parameter_value

Definition at line 32 of file template.h.

V_DELETE

#define V_DELETE   derive_c_parameter_value_delete

Definition at line 34 of file template.h.

Function Documentation

delete()

void delete ( SELF * self )

static

Definition at line 327 of file template.h.

                                           {
    DEBUG_ASSERT(self);
    ITER iter = NAME(SELF, get_iter)(self);
    IV_PAIR const* entry;
    while ((entry = NAME(ITER, next)(&iter))) {
        V_DELETE(entry->value);
    }
 
    NAME(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 249 of file template.h.

                                                              {
    DEBUG_ASSERT(self);
    if (!CHECK_ACCESS_INDEX(self, index)) {
        return false;
    }
 
    SLOT* entry = &self->slots[index.index];
    if (entry->present) {
        V_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 281 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 360 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 212 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 312 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,
        .pos = 0,
        .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 389 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,
        .pos = 0,
        .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, V value )

static

Definition at line 126 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 110 of file template.h.

                                                                              {
    DEBUG_ASSERT(items > 0);
    size_t capacity = next_power_of_2(items);
    ASSERT(capacity <= MAX_CAPACITY);
    SLOT* slots = (SLOT*)NAME(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 289 of file template.h.

                                                   {
    DEBUG_ASSERT(iter);
 
    if (NAME(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++;
    }
 
    iter->pos++;
    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 365 of file template.h.

                                                                     {
    DEBUG_ASSERT(iter);
 
    if (NAME(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++;
    }
 
    iter->pos++;
    return &iter->curr;
}

Here is the call graph for this function:

position() [1/2]

size_t position ( ITER const * iter )

static

Definition at line 307 of file template.h.

                                                     {
    DEBUG_ASSERT(iter);
    return iter->pos;
}

Here is the call graph for this function:

Here is the caller graph for this function:

position() [2/2]

size_t position ( ITER_CONST const * iter )

static

Definition at line 384 of file template.h.

                                                                 {
    DEBUG_ASSERT(iter);
    return iter->pos;
}

Here is the call graph for this function:

read()

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

static

Definition at line 186 of file template.h.

                                                                {
    V const* value = NAME(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()

V remove ( SELF * self, INDEX index )

static

Definition at line 243 of file template.h.

                                                     {
    V value;
    ASSERT(NAME(SELF, try_remove)(self, index, &value));
    return value;
}

Here is the call graph for this function:

Here is the caller graph for this function:

shallow_clone()

SELF shallow_clone ( SELF const * self )

static

Definition at line 192 of file template.h.

                                                        {
    DEBUG_ASSERT(self);
    SLOT* slots = (SLOT*)NAME(ALLOC, calloc)(self->alloc, self->capacity, sizeof(SLOT));
    ASSERT(slots);
    memcpy(slots, self->slots, self->exclusive_end * sizeof(SLOT));
    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:

size()

INDEX_TYPE size ( SELF const * self )

static

Examples

complex/prime_sieve.c.

Definition at line 207 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()

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

static

Definition at line 174 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, V * destination )

static

Definition at line 225 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()

V * try_write ( SELF * self, INDEX index )

static

Definition at line 156 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:

write()

V * write ( SELF * self, INDEX index )

static

Definition at line 168 of file template.h.

                                                     {
    V* value = NAME(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 347 of file template.h.

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

max_capacity

size_t max_capacity = MAX_CAPACITY

static

Definition at line 222 of file template.h.

max_index

size_t max_index = MAX_INDEX

static

Definition at line 223 of file template.h.