mirror of
https://github.com/CPunch/Laika.git
synced 2024-11-23 13:20:10 +00:00
46 lines
2.3 KiB
C
46 lines
2.3 KiB
C
#ifndef LAIKA_MEM_H
|
|
#define LAIKA_MEM_H
|
|
|
|
#include "laika.h"
|
|
|
|
#define GROW_FACTOR 2
|
|
|
|
/* microsoft strikes again with their lack of support for VLAs */
|
|
#if _MSC_VER
|
|
# define VLA(type, var, sz) type *var = laikaM_malloc(sizeof(type) * sz);
|
|
# define ENDVLA(var) laikaM_free(var);
|
|
#else
|
|
# define VLA(type, var, sz) type var[sz];
|
|
# define ENDVLA(var) ((void)0) /* no op */
|
|
#endif
|
|
|
|
#define laikaM_malloc(sz) laikaM_realloc(NULL, sz)
|
|
#define laikaM_free(buf) laikaM_realloc(buf, 0)
|
|
|
|
#define laikaM_growarray(type, buf, needed, count, capacity) \
|
|
if (count + needed >= capacity || buf == NULL) { \
|
|
capacity = (capacity + needed) * GROW_FACTOR; \
|
|
buf = (type *)laikaM_realloc(buf, sizeof(type) * capacity); \
|
|
}
|
|
|
|
/* moves array elements above indx down by numElem, removing numElem elements at indx */
|
|
#define laikaM_rmvarray(buf, count, indx, numElem) \
|
|
do { \
|
|
int _i, _sz = ((count - indx) - numElem); \
|
|
for (_i = 0; _i < _sz; _i++) \
|
|
buf[indx + _i] = buf[indx + numElem + _i]; \
|
|
count -= numElem; \
|
|
} while (0);
|
|
|
|
/* moves array elements above indx up by numElem, inserting numElem elements at indx */
|
|
#define laikaM_insertarray(buf, count, indx, numElem) \
|
|
do { \
|
|
int _i; \
|
|
for (_i = count; _i > indx; _i--) \
|
|
buf[_i] = buf[_i - 1]; \
|
|
count += numElem; \
|
|
} while (0);
|
|
|
|
void *laikaM_realloc(void *buf, size_t sz);
|
|
|
|
#endif |