mirror of
https://github.com/Mercantec-GHC/h4-projekt-gruppe-0-sm.git
synced 2025-04-28 08:44:06 +02:00
173 lines
13 KiB
C
173 lines
13 KiB
C
#pragma once
|
|
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
|
|
#define MAYBE_UNUSED __attribute__((unused))
|
|
|
|
#define DECLARE_VEC_TYPE(TYPE, VEC_TYPE, FN_PREFIX, FN_SPECIFIER) \
|
|
typedef TYPE VEC_TYPE##T; \
|
|
typedef struct { \
|
|
VEC_TYPE##T* data; \
|
|
size_t capacity; \
|
|
size_t size; \
|
|
} VEC_TYPE; \
|
|
FN_SPECIFIER int FN_PREFIX##_construct(VEC_TYPE* vec); \
|
|
FN_SPECIFIER void FN_PREFIX##_destroy(VEC_TYPE* vec); \
|
|
FN_SPECIFIER VEC_TYPE* FN_PREFIX##_new(void); \
|
|
FN_SPECIFIER void FN_PREFIX##_free(VEC_TYPE* vec); \
|
|
FN_SPECIFIER int FN_PREFIX##_push(VEC_TYPE* vec, VEC_TYPE##T value); \
|
|
FN_SPECIFIER VEC_TYPE##T* FN_PREFIX##_at(VEC_TYPE* vec, size_t idx); \
|
|
FN_SPECIFIER const VEC_TYPE##T* FN_PREFIX##_at_const( \
|
|
const VEC_TYPE* vec, size_t idx); \
|
|
FN_SPECIFIER VEC_TYPE##T FN_PREFIX##_get(const VEC_TYPE* vec, size_t idx);
|
|
|
|
#define DEFINE_VEC_IMPL(TYPE, VEC_TYPE, FN_PREFIX, FN_SPECIFIER) \
|
|
FN_SPECIFIER int FN_PREFIX##_construct(VEC_TYPE* vec) \
|
|
{ \
|
|
const size_t capacity \
|
|
= 8 / sizeof(VEC_TYPE##T) > 2 ? 8 / sizeof(VEC_TYPE##T) : 2; \
|
|
VEC_TYPE##T* data = malloc(sizeof(VEC_TYPE##T) * capacity); \
|
|
if (!data) \
|
|
return -1; \
|
|
*vec = (VEC_TYPE) { data, capacity, .size = 0 }; \
|
|
return 0; \
|
|
} \
|
|
\
|
|
FN_SPECIFIER void FN_PREFIX##_destroy(VEC_TYPE* vec) \
|
|
{ \
|
|
free(vec->data); \
|
|
} \
|
|
\
|
|
FN_SPECIFIER VEC_TYPE* FN_PREFIX##_new(void) \
|
|
{ \
|
|
VEC_TYPE* vec = malloc(sizeof(VEC_TYPE)); \
|
|
if (!vec) \
|
|
return NULL; \
|
|
int res = FN_PREFIX##_construct(vec); \
|
|
if (res != 0) \
|
|
return NULL; \
|
|
return vec; \
|
|
} \
|
|
\
|
|
FN_SPECIFIER void FN_PREFIX##_free(VEC_TYPE* vec) \
|
|
{ \
|
|
FN_PREFIX##_destroy(vec); \
|
|
free(vec); \
|
|
} \
|
|
\
|
|
FN_SPECIFIER int FN_PREFIX##_push(VEC_TYPE* vec, VEC_TYPE##T value) \
|
|
{ \
|
|
if (vec->size + 1 > vec->capacity) { \
|
|
size_t new_capacity = vec->capacity * 2; \
|
|
TYPE* new_data = realloc(vec->data, new_capacity * sizeof(TYPE)); \
|
|
if (!new_data) \
|
|
return -1; \
|
|
vec->data = new_data; \
|
|
vec->capacity = new_capacity; \
|
|
} \
|
|
vec->data[vec->size] = value; \
|
|
vec->size += 1; \
|
|
return 0; \
|
|
} \
|
|
\
|
|
FN_SPECIFIER VEC_TYPE##T* FN_PREFIX##_at(VEC_TYPE* vec, size_t idx) \
|
|
{ \
|
|
return &vec->data[idx]; \
|
|
} \
|
|
\
|
|
FN_SPECIFIER const VEC_TYPE##T* FN_PREFIX##_at_const( \
|
|
const VEC_TYPE* vec, size_t idx) \
|
|
{ \
|
|
return &vec->data[idx]; \
|
|
} \
|
|
\
|
|
FN_SPECIFIER VEC_TYPE##T FN_PREFIX##_get(const VEC_TYPE* vec, size_t idx) \
|
|
{ \
|
|
return vec->data[idx]; \
|
|
}
|
|
|
|
#define DEFINE_VEC(TYPE, VEC_TYPE, FN_PREFIX) \
|
|
DECLARE_VEC_TYPE(TYPE, VEC_TYPE, FN_PREFIX, MAYBE_UNUSED static inline) \
|
|
DEFINE_VEC_IMPL(TYPE, VEC_TYPE, FN_PREFIX, MAYBE_UNUSED static inline)
|
|
|
|
#define DEFINE_STATIC_QUEUE(TYPE, QUEUE_TYPE, FN_PREFIX) \
|
|
typedef struct { \
|
|
TYPE* data; \
|
|
size_t capacity; \
|
|
size_t back; \
|
|
size_t front; \
|
|
} QUEUE_TYPE; \
|
|
\
|
|
MAYBE_UNUSED static inline int FN_PREFIX##_construct( \
|
|
QUEUE_TYPE* queue, size_t capacity) \
|
|
{ \
|
|
*queue = (QUEUE_TYPE) { \
|
|
.data = malloc(sizeof(TYPE) * capacity), \
|
|
.capacity = capacity, \
|
|
.back = 0, \
|
|
.front = 0, \
|
|
}; \
|
|
return 0; \
|
|
} \
|
|
\
|
|
MAYBE_UNUSED static inline void FN_PREFIX##_destroy(QUEUE_TYPE* queue) \
|
|
{ \
|
|
free(queue->data); \
|
|
} \
|
|
\
|
|
MAYBE_UNUSED static inline QUEUE_TYPE* FN_PREFIX##_new(size_t capacity) \
|
|
{ \
|
|
QUEUE_TYPE* queue = malloc(sizeof(QUEUE_TYPE)); \
|
|
if (!queue) \
|
|
return NULL; \
|
|
int res = FN_PREFIX##_construct(queue, capacity); \
|
|
if (res != 0) \
|
|
return NULL; \
|
|
return queue; \
|
|
} \
|
|
\
|
|
MAYBE_UNUSED static inline void FN_PREFIX##_free(QUEUE_TYPE* queue) \
|
|
{ \
|
|
FN_PREFIX##_destroy(queue); \
|
|
free(queue); \
|
|
} \
|
|
\
|
|
MAYBE_UNUSED static inline int FN_PREFIX##_push( \
|
|
QUEUE_TYPE* queue, TYPE req) \
|
|
{ \
|
|
size_t front = queue->front + 1; \
|
|
if (front >= queue->capacity) { \
|
|
front = 0; \
|
|
} \
|
|
if (front == queue->back) { \
|
|
return -1; \
|
|
} \
|
|
queue->data[queue->front] = req; \
|
|
queue->front = front; \
|
|
return 0; \
|
|
} \
|
|
\
|
|
MAYBE_UNUSED static inline size_t FN_PREFIX##_size( \
|
|
const QUEUE_TYPE* queue) \
|
|
{ \
|
|
return queue->front >= queue->back \
|
|
? queue->front - queue->back \
|
|
: (queue->capacity - queue->back) + queue->front; \
|
|
} \
|
|
\
|
|
MAYBE_UNUSED static inline int FN_PREFIX##_pop( \
|
|
QUEUE_TYPE* queue, TYPE* req) \
|
|
{ \
|
|
if (queue->back == queue->front) { \
|
|
return -1; \
|
|
} \
|
|
*req = queue->data[queue->back]; \
|
|
size_t back = queue->back + 1; \
|
|
if (back >= queue->capacity) { \
|
|
back = 0; \
|
|
} \
|
|
queue->back = back; \
|
|
return 0; \
|
|
}
|