13#define restrict __restrict__
34#define PASTE(a, b) a##b
42#define XPASTE(a, b) PASTE(a, b)
50#define JOIN(a, b) XPASTE(a, XPASTE(_, b))
63#ifndef FSTACK_FOR_EACH
64#define FSTACK_FOR_EACH(self, index, value) \
65 for ((index) = (self)->count; (index) > 0 && ((value) = (self)->values[(index) - 1], true); (index)--)
78#ifndef FSTACK_FOR_EACH_REVERSE
79#define FSTACK_FOR_EACH_REVERSE(self, index, value) \
80 for ((index) = 0; (index) < (self)->count && ((value) = (self)->values[(index)], true); (index)++)
93#ifndef FSTACK_CALC_SIZEOF
94#define FSTACK_CALC_SIZEOF(fstack_name, capacity) \
95 (uint32_t)(offsetof(struct fstack_name, values) + capacity * sizeof(((struct fstack_name *)0)->values[0]))
108#ifndef FSTACK_CALC_SIZEOF_OVERFLOWS
109#define FSTACK_CALC_SIZEOF_OVERFLOWS(fstack_name, capacity) \
110 (capacity > (UINT32_MAX - offsetof(struct fstack_name, values)) / sizeof(((struct fstack_name *)0)->values[0]))
122#error "Must define NAME."
124#define FSTACK_NAME NAME
135#define VALUE_TYPE int
136#define FUNCTION_DEFINITIONS
137#define TYPE_DEFINITIONS
138#error "Must define VALUE_TYPE."
145#ifndef FUNCTION_LINKAGE
146#define FUNCTION_LINKAGE
150#define FSTACK_TYPE struct FSTACK_NAME
151#define FSTACK_IS_EMPTY JOIN(FSTACK_NAME, is_empty)
152#define FSTACK_IS_FULL JOIN(FSTACK_NAME, is_full)
153#define FSTACK_INIT JOIN(FSTACK_NAME, init)
164#ifdef TYPE_DEFINITIONS
187FUNCTION_LINKAGE FSTACK_TYPE *
JOIN(FSTACK_NAME, init)(FSTACK_TYPE *self,
const uint32_t capacity);
298FUNCTION_LINKAGE void JOIN(FSTACK_NAME, copy)(FSTACK_TYPE *restrict dest_ptr,
const FSTACK_TYPE *restrict src_ptr);
308#ifdef FUNCTION_DEFINITIONS
315 self->capacity = capacity;
328 FSTACK_TYPE *self = (FSTACK_TYPE *)calloc(1, size);
334 FSTACK_INIT(self, capacity);
341 assert(self != NULL);
348 assert(self != NULL);
350 return self->count == 0;
355 assert(self != NULL);
357 return self->count == self->capacity;
362 assert(self != NULL);
363 assert(index < self->count);
365 return self->values[self->count - 1 - index];
370 assert(self != NULL);
371 assert(FSTACK_IS_EMPTY(self) ==
false);
373 return self->values[self->count - 1];
378 assert(self != NULL);
379 assert(FSTACK_IS_EMPTY(self) ==
false);
381 return self->values[0];
386 return JOIN(FSTACK_NAME, get_top)(self);
391 assert(self != NULL);
392 assert(FSTACK_IS_FULL(self) ==
false);
394 self->values[self->count++] = value;
399 assert(self != NULL);
400 assert(FSTACK_IS_EMPTY(self) ==
false);
402 return self->values[--self->count];
407 assert(self != NULL);
411FUNCTION_LINKAGE void JOIN(FSTACK_NAME, copy)(FSTACK_TYPE *restrict dest_ptr,
const FSTACK_TYPE *restrict src_ptr)
413 assert(src_ptr != NULL);
414 assert(dest_ptr != NULL);
415 assert(src_ptr->count <= dest_ptr->capacity);
416 assert(FSTACK_IS_EMPTY(dest_ptr));
418 for (uint32_t i = 0; i < src_ptr->count; i++) {
419 dest_ptr->values[i] = src_ptr->values[i];
421 dest_ptr->count = src_ptr->count;
431#undef FUNCTION_LINKAGE
432#undef FUNCTION_DEFINITIONS
433#undef TYPE_DEFINITIONS
437#undef FSTACK_IS_EMPTY
#define FUNCTION_LINKAGE
Specify function linkage e.g. static inline.
Definition fstack_template.h:146
#define JOIN(a, b)
First expand tokens, then paste them together with a _ in between.
Definition fstack_template.h:50
#define VALUE_TYPE
Stack value type. This must be manually defined before including this header file.
Definition fstack_template.h:135
#define FSTACK_CALC_SIZEOF(fstack_name, capacity)
Calculate the size of the stack struct. No overflow checks.
Definition fstack_template.h:94
#define FSTACK_CALC_SIZEOF_OVERFLOWS(fstack_name, capacity)
Check for a given capacity, if the equivalent size of the stack struct overflows.
Definition fstack_template.h:109
uint32_t capacity
maximum number of values allocated for.
Definition fstack_template.h:171
VALUE_TYPE values[]
array of values.
Definition fstack_template.h:172
uint32_t count
number of values.
Definition fstack_template.h:170