template.h

Go to the documentation of this file.

 
#include <derive-c/core/includes/def.h>
#if !defined(SKIP_INCLUDES)
    #include "includes.h"
#endif
 
#include <derive-c/core/alloc/def.h>
#include <derive-c/core/self/def.h>
 
#if !defined ITEM
    #if !defined DC_PLACEHOLDERS
TEMPLATE_ERROR("No ITEM")
    #endif
 
typedef struct {
    int x;
} item_t;
    #define ITEM item_t
    #define ITEM_DELETE item_delete
static void ITEM_DELETE(item_t* /* self */) {}
    #define ITEM_CLONE item_clone
static item_t ITEM_CLONE(item_t const* self) { return *self; }
    #define ITEM_DEBUG item_debug
static void ITEM_DEBUG(ITEM const* /* self */, dc_debug_fmt /* fmt */, FILE* /* stream */) {}
#endif
 
#if !defined ITEM_DELETE
    #define ITEM_DELETE DC_NO_DELETE
#endif
 
#if !defined ITEM_CLONE
    #define ITEM_CLONE DC_COPY_CLONE
#endif
 
#if !defined ITEM_DEBUG
    #define ITEM_DEBUG DC_DEFAULT_DEBUG
#endif
 
typedef ITEM NS(SELF, item_t);
typedef ALLOC NS(SELF, alloc_t);
 
typedef struct {
    ITEM* data;
    size_t capacity;
    size_t size; /* Cached size to avoid recalculation */
    size_t head; /* Index of the first element */
    size_t tail; /* Index of the last element */
    bool empty;  /* Used to differentiate between head == tail when 1 element, or empty */
    NS(ALLOC, ref) alloc_ref;
    dc_gdb_marker derive_c_circular;
    mutation_tracker iterator_invalidation_tracker;
} SELF;
 
#define INVARIANT_CHECK(self)                                                                      \
    DC_ASSUME(self);                                                                               \
    DC_ASSUME(DC_WHEN(!(self)->empty,                                                              \
                      (self)->head < (self)->capacity && (self)->tail < (self)->capacity));        \
    DC_ASSUME(DC_WHEN((self)->empty, (self)->head == (self)->tail));                               \
    DC_ASSUME(DC_WHEN(!(self)->data, (self)->head == 0 && (self)->tail == 0));
 
DC_PUBLIC static SELF NS(SELF, new)(NS(ALLOC, ref) alloc_ref) {
    return (SELF){
        .data = NULL,
        .capacity = 0,
        .size = 0,
        .head = 0,
        .tail = 0,
        .empty = true,
        .alloc_ref = alloc_ref,
        .derive_c_circular = dc_gdb_marker_new(),
        .iterator_invalidation_tracker = mutation_tracker_new(),
    };
}
 
DC_PUBLIC static SELF NS(SELF, new_with_capacity_for)(size_t capacity_for,
                                                      NS(ALLOC, ref) alloc_ref) {
    if (capacity_for == 0) {
        return NS(SELF, new)(alloc_ref);
    }
    size_t const capacity = dc_math_next_power_of_2(capacity_for);
    DC_ASSUME(DC_MATH_IS_POWER_OF_2(capacity));
    ITEM* data = (ITEM*)NS(ALLOC, allocate_uninit)(alloc_ref, capacity * sizeof(ITEM));
 
    dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, DC_MEMORY_TRACKER_CAP_NONE, data,
                          capacity * sizeof(ITEM));
 
    return (SELF){
        .data = data,
        .capacity = capacity,
        .size = 0,
        .head = 0,
        .tail = 0,
        .empty = true,
        .alloc_ref = alloc_ref,
        .derive_c_circular = dc_gdb_marker_new(),
        .iterator_invalidation_tracker = mutation_tracker_new(),
    };
}
 
DC_PUBLIC static bool NS(SELF, empty)(SELF const* self) {
    DC_ASSUME(self);
    if (self->empty) {
        DC_ASSUME(self->head == self->tail);
    }
    return self->empty;
}
 
DC_PUBLIC static size_t NS(SELF, size)(SELF const* self) {
    DC_ASSUME(self);
    return self->size;
}
 
static void PRIV(NS(SELF, set_inaccessible_memory_caps))(SELF* self,
                                                         dc_memory_tracker_capability cap) {
    if (self->empty) {
        dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, cap, self->data,
                              self->capacity * sizeof(ITEM));
    } else if (self->head <= self->tail) {
        dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, cap, &self->data[self->tail + 1],
                              (self->capacity - (self->tail + 1)) * sizeof(ITEM));
        dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, cap, self->data,
                              self->head * sizeof(ITEM));
    } else {
        dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, cap, &self->data[self->tail + 1],
                              (self->head - (self->tail + 1)) * sizeof(ITEM));
    }
}
 
DC_PUBLIC static void NS(SELF, reserve)(SELF* self, size_t new_capacity_for) {
    INVARIANT_CHECK(self);
    mutation_tracker_mutate(&self->iterator_invalidation_tracker);
 
    if (new_capacity_for > self->capacity) {
        size_t const new_capacity = dc_math_next_power_of_2(new_capacity_for * 2);
 
        // We set the capability to write for the allocator, and only touch the
        // state for memory that is inaccessible
        PRIV(NS(SELF, set_inaccessible_memory_caps))(self, DC_MEMORY_TRACKER_CAP_WRITE);
 
        ITEM* new_data;
        if (self->data == NULL) {
            new_data =
                (ITEM*)NS(ALLOC, allocate_uninit)(self->alloc_ref, new_capacity * sizeof(ITEM));
        } else {
            new_data = (ITEM*)NS(ALLOC, reallocate)(self->alloc_ref, self->data,
                                                    self->capacity * sizeof(ITEM),
                                                    new_capacity * sizeof(ITEM));
        }
 
        if (self->head > self->tail) {
            // The queue wraps at the old end, so we need to either:
            //  - shift elements of the tail around into the new area at the end of the buffer
            // - shift the head of the queue along to the new arena
            // need to move the wrapped around part to the end of the new buffer
            size_t const old_capacity = self->capacity;
            size_t const additional_capacity = new_capacity - old_capacity;
            size_t const front_tail_items = self->tail + 1;
            size_t const back_head_items = old_capacity - self->head;
 
            if (front_tail_items > back_head_items) {
                size_t const new_head = self->head + additional_capacity;
                memmove(&new_data[new_head], &new_data[self->head], back_head_items * sizeof(ITEM));
                self->head = new_head;
            } else {
                // as we go to the next power of 2 each time, the additional capacity is always >=
                // the number of items at the front. As a result, we never need to consider:
                // - Only copying the first n from the front
                // - Shifting some of the front items to the start of the buffer
                DC_ASSUME(front_tail_items <= additional_capacity);
 
                memcpy(&new_data[old_capacity], &new_data[0], front_tail_items * sizeof(ITEM));
                self->tail = old_capacity + front_tail_items - 1;
            }
        }
        self->capacity = new_capacity;
        self->data = new_data;
 
        // Set the new inaccessible memory
        PRIV(NS(SELF, set_inaccessible_memory_caps))(self, DC_MEMORY_TRACKER_CAP_NONE);
    }
    INVARIANT_CHECK(self);
}
 
DC_PUBLIC static void NS(SELF, push_back)(SELF* self, ITEM item) {
    INVARIANT_CHECK(self);
    mutation_tracker_mutate(&self->iterator_invalidation_tracker);
    NS(SELF, reserve)(self, self->size + 1);
 
    if (!self->empty) {
        self->tail = dc_math_modulus_power_of_2_capacity(self->tail + 1, self->capacity);
    }
    dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, DC_MEMORY_TRACKER_CAP_WRITE,
                          &self->data[self->tail], sizeof(ITEM));
    self->data[self->tail] = item;
    self->empty = false;
    self->size++;
}
 
DC_PUBLIC static void NS(SELF, push_front)(SELF* self, ITEM item) {
    INVARIANT_CHECK(self);
    mutation_tracker_mutate(&self->iterator_invalidation_tracker);
    NS(SELF, reserve)(self, self->size + 1);
 
    if (!self->empty) {
        if (self->head == 0) {
            self->head = self->capacity - 1;
        } else {
            self->head--;
        }
    }
    dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, DC_MEMORY_TRACKER_CAP_WRITE,
                          &self->data[self->head], sizeof(ITEM));
    self->data[self->head] = item;
    self->empty = false;
    self->size++;
}
 
DC_PUBLIC static ITEM NS(SELF, pop_front)(SELF* self) {
    INVARIANT_CHECK(self);
    mutation_tracker_mutate(&self->iterator_invalidation_tracker);
    DC_ASSERT(!NS(SELF, empty)(self), "Cannot pop front, already empty {size=%lu}",
              (size_t)self->size);
 
    ITEM value = self->data[self->head];
    dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, DC_MEMORY_TRACKER_CAP_NONE,
                          &self->data[self->head], sizeof(ITEM));
    dc_memory_tracker_check(DC_MEMORY_TRACKER_LVL_CONTAINER, DC_MEMORY_TRACKER_CAP_NONE,
                            &self->data[self->head], sizeof(ITEM));
 
    self->size--;
    if (self->head == self->tail) {
        self->empty = true;
    } else {
        self->head = dc_math_modulus_power_of_2_capacity(self->head + 1, self->capacity);
    }
    return value;
}
 
DC_PUBLIC static ITEM NS(SELF, pop_back)(SELF* self) {
    INVARIANT_CHECK(self);
    mutation_tracker_mutate(&self->iterator_invalidation_tracker);
    DC_ASSERT(!NS(SELF, empty)(self), "Cannot pop back, already empty {size=%lu}",
              (size_t)self->size);
 
    ITEM value = self->data[self->tail];
    dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, DC_MEMORY_TRACKER_CAP_NONE,
                          &self->data[self->tail], sizeof(ITEM));
    self->size--;
    if (self->head == self->tail) {
        self->empty = true;
    } else {
        if (self->tail == 0) {
            self->tail = self->capacity - 1;
        } else {
            self->tail--;
        }
    }
    return value;
}
 
DC_PUBLIC static ITEM const* NS(SELF, try_read_from_front)(SELF const* self, size_t index) {
    INVARIANT_CHECK(self);
    if (index < self->size) {
        size_t const real_index =
            dc_math_modulus_power_of_2_capacity(self->head + index, self->capacity);
        return &self->data[real_index];
    }
    return NULL;
}
 
DC_PUBLIC static ITEM const* NS(SELF, try_read_from_back)(SELF const* self, size_t index) {
    INVARIANT_CHECK(self);
    if (index >= self->size) {
        return NULL;
    }
    if (index <= self->tail) {
        return &self->data[self->tail - index];
    }
    size_t const from_end = index - self->tail;
    return &self->data[self->capacity - from_end];
}
 
DC_PUBLIC static ITEM* NS(SELF, try_write_from_front)(SELF* self, size_t index) {
    return (ITEM*)NS(SELF, try_read_from_front)(self, index);
}
 
DC_PUBLIC static ITEM* NS(SELF, try_write_from_back)(SELF* self, size_t index) {
    return (ITEM*)NS(SELF, try_read_from_back)(self, index);
}
 
#define ITER NS(SELF, iter)
typedef ITEM* NS(ITER, item);
 
DC_PUBLIC static bool NS(ITER, empty_item)(ITEM* const* item) { return *item == NULL; }
 
typedef struct {
    SELF* circular;
    size_t position;
    mutation_version version;
} ITER;
 
DC_PUBLIC static bool NS(ITER, empty)(ITER const* iter) {
    DC_ASSUME(iter);
    mutation_version_check(&iter->version);
    return !NS(SELF, try_read_from_front)(iter->circular, iter->position);
}
 
DC_PUBLIC static ITEM* NS(ITER, next)(ITER* iter) {
    DC_ASSUME(iter);
    mutation_version_check(&iter->version);
    ITEM* item = NS(SELF, try_write_from_front)(iter->circular, iter->position);
    if (!item) {
        return NULL;
    }
    iter->position++;
    return item;
}
 
DC_PUBLIC static ITER NS(SELF, get_iter)(SELF* self) {
    INVARIANT_CHECK(self);
    return (ITER){
        .circular = self,
        .position = 0,
        .version = mutation_tracker_get(&self->iterator_invalidation_tracker),
    };
}
 
DC_PUBLIC static void NS(SELF, delete)(SELF* self) {
    INVARIANT_CHECK(self);
    if (self->data) {
        ITER iter = NS(SELF, get_iter)(self);
        ITEM* item;
        while ((item = NS(ITER, next)(&iter))) {
            ITEM_DELETE(item);
            dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, DC_MEMORY_TRACKER_CAP_NONE, item,
                                  sizeof(ITEM));
        }
        size_t const size = self->capacity * sizeof(ITEM);
        dc_memory_tracker_set(DC_MEMORY_TRACKER_LVL_CONTAINER, DC_MEMORY_TRACKER_CAP_WRITE,
                              self->data, size);
        NS(ALLOC, deallocate)(self->alloc_ref, self->data, size);
    }
}
 
#undef ITER
 
#define ITER_CONST NS(SELF, iter_const)
typedef ITEM const* NS(ITER_CONST, item);
 
DC_PUBLIC static bool NS(ITER_CONST, empty_item)(ITEM const* const* item) { return *item == NULL; }
 
typedef struct {
    SELF const* circular;
    size_t position;
    mutation_version version;
} ITER_CONST;
 
DC_PUBLIC static bool NS(ITER_CONST, empty)(ITER_CONST const* iter) {
    DC_ASSUME(iter);
    mutation_version_check(&iter->version);
    return !NS(SELF, try_read_from_front)(iter->circular, iter->position);
}
 
DC_PUBLIC static ITEM const* NS(ITER_CONST, next)(ITER_CONST* iter) {
    DC_ASSUME(iter);
    mutation_version_check(&iter->version);
    ITEM const* item = NS(SELF, try_read_from_front)(iter->circular, iter->position);
    if (!item) {
        return NULL;
    }
    iter->position++;
    return item;
}
 
DC_PUBLIC static ITER_CONST NS(SELF, get_iter_const)(SELF const* self) {
    INVARIANT_CHECK(self);
    return (ITER_CONST){
        .circular = self,
        .position = 0,
        .version = mutation_tracker_get(&self->iterator_invalidation_tracker),
    };
}
 
DC_PUBLIC static SELF NS(SELF, clone)(SELF const* self) {
    INVARIANT_CHECK(self);
    ITEM* new_data = NULL;
    size_t tail = 0;
    size_t new_capacity = 0;
    size_t const old_size = self->size;
 
    if (old_size > 0) {
        new_capacity = dc_math_next_power_of_2(old_size);
        new_data = (ITEM*)NS(ALLOC, allocate_uninit)(self->alloc_ref, new_capacity * sizeof(ITEM));
 
        ITER_CONST iter = NS(SELF, get_iter_const)(self);
        ITEM const* item;
        while ((item = NS(ITER_CONST, next)(&iter))) {
            new_data[tail] = ITEM_CLONE(item);
            tail++;
        }
        tail--;
    }
    SELF new_self = {
        .data = new_data,
        .capacity = new_capacity,
        .size = old_size,
        .head = 0,
        .tail = tail,
        .empty = self->empty,
        .alloc_ref = self->alloc_ref,
        .derive_c_circular = dc_gdb_marker_new(),
        .iterator_invalidation_tracker = mutation_tracker_new(),
    };
    PRIV(NS(SELF, set_inaccessible_memory_caps))(&new_self, DC_MEMORY_TRACKER_CAP_NONE);
    return new_self;
}
 
DC_PUBLIC static void NS(SELF, debug)(SELF const* self, dc_debug_fmt fmt, FILE* stream) {
    fprintf(stream, DC_EXPAND_STRING(SELF) "@%p {\n", (void*)self);
    fmt = dc_debug_fmt_scope_begin(fmt);
    dc_debug_fmt_print(fmt, stream, "capacity: %lu,\n", self->capacity);
    dc_debug_fmt_print(fmt, stream, "size: %lu,\n", self->size);
    dc_debug_fmt_print(fmt, stream, "head: %lu,\n", self->head);
    dc_debug_fmt_print(fmt, stream, "tail: %lu,\n", self->tail);
 
    dc_debug_fmt_print(fmt, stream, "alloc: ");
    NS(ALLOC, debug)(NS(NS(ALLOC, ref), deref)(self->alloc_ref), fmt, stream);
    fprintf(stream, ",\n");
 
    dc_debug_fmt_print(fmt, stream, "queue: @%p [\n", (void*)self->data);
    fmt = dc_debug_fmt_scope_begin(fmt);
 
    ITER_CONST iter = NS(SELF, get_iter_const)(self);
    ITEM const* item;
    while ((item = NS(ITER_CONST, next)(&iter))) {
        dc_debug_fmt_print_indents(fmt, stream);
        ITEM_DEBUG(item, fmt, stream);
        fprintf(stream, ",\n");
    }
    fmt = dc_debug_fmt_scope_end(fmt);
    dc_debug_fmt_print(fmt, stream, "],\n");
    fmt = dc_debug_fmt_scope_end(fmt);
    dc_debug_fmt_print(fmt, stream, "}");
}
 
#undef ITER_CONST
#undef INVARIANT_CHECK
#undef ITEM_DEBUG
#undef ITEM_CLONE
#undef ITEM_DELETE
#undef ITEM
 
DC_TRAIT_QUEUE(SELF);
 
#include <derive-c/core/self/undef.h>
#include <derive-c/core/alloc/undef.h>
#include <derive-c/core/includes/undef.h>