/************************************************************************** * * Copyright 2010 Luca Barbieri * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice (including the * next paragraph) shall be included in all copies or substantial * portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. * IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * **************************************************************************/ #ifndef U_DYNARRAY_H #define U_DYNARRAY_H #include #include #include "ralloc.h" #ifdef __cplusplus extern "C" { #endif /* A zero-initialized version of this is guaranteed to represent an * empty array. * * Also, size <= capacity and data != 0 if and only if capacity != 0 * capacity will always be the allocation size of data */ struct util_dynarray { void *mem_ctx; void *data; unsigned size; unsigned capacity; }; static inline void util_dynarray_init(struct util_dynarray *buf, void *mem_ctx) { memset(buf, 0, sizeof(*buf)); buf->mem_ctx = mem_ctx; } static inline void util_dynarray_fini(struct util_dynarray *buf) { if (buf->data) { if (buf->mem_ctx) { ralloc_free(buf->data); } else { free(buf->data); } util_dynarray_init(buf, buf->mem_ctx); } } static inline void util_dynarray_clear(struct util_dynarray *buf) { buf->size = 0; } #define DYN_ARRAY_INITIAL_SIZE 64 /* use util_dynarray_trim to reduce the allocated storage */ static inline void * util_dynarray_resize(struct util_dynarray *buf, unsigned newsize) { void *p; if (newsize > buf->capacity) { if (buf->capacity == 0) buf->capacity = DYN_ARRAY_INITIAL_SIZE; while (newsize > buf->capacity) buf->capacity *= 2; if (buf->mem_ctx) { buf->data = reralloc_size(buf->mem_ctx, buf->data, buf->capacity); } else { buf->data = realloc(buf->data, buf->capacity); } } p = (void *)((char *)buf->data + buf->size); buf->size = newsize; return p; } static inline void util_dynarray_clone(struct util_dynarray *buf, void *mem_ctx, struct util_dynarray *from_buf) { util_dynarray_init(buf, mem_ctx); util_dynarray_resize(buf, from_buf->size); memcpy(buf->data, from_buf->data, from_buf->size); } static inline void * util_dynarray_grow(struct util_dynarray *buf, int diff) { return util_dynarray_resize(buf, buf->size + diff); } static inline void util_dynarray_trim(struct util_dynarray *buf) { if (buf->size != buf->capacity) { if (buf->size) { if (buf->mem_ctx) { buf->data = reralloc_size(buf->mem_ctx, buf->data, buf->size); } else { buf->data = realloc(buf->data, buf->size); } buf->capacity = buf->size; } else { if (buf->mem_ctx) { ralloc_free(buf->data); } else { free(buf->data); } buf->data = 0; buf->capacity = 0; } } } #define util_dynarray_append(buf, type, v) do {type __v = (v); memcpy(util_dynarray_grow((buf), sizeof(type)), &__v, sizeof(type));} while(0) #define util_dynarray_top_ptr(buf, type) (type*)((char*)(buf)->data + (buf)->size - sizeof(type)) #define util_dynarray_top(buf, type) *util_dynarray_top_ptr(buf, type) #define util_dynarray_pop_ptr(buf, type) (type*)((char*)(buf)->data + ((buf)->size -= sizeof(type))) #define util_dynarray_pop(buf, type) *util_dynarray_pop_ptr(buf, type) #define util_dynarray_contains(buf, type) ((buf)->size >= sizeof(type)) #define util_dynarray_element(buf, type, idx) ((type*)(buf)->data + (idx)) #define util_dynarray_begin(buf) ((buf)->data) #define util_dynarray_end(buf) ((void*)util_dynarray_element((buf), char, (buf)->size)) #define util_dynarray_num_elements(buf, type) ((buf)->size / sizeof(type)) #define util_dynarray_foreach(buf, type, elem) \ for (type *elem = (type *)(buf)->data; \ elem < (type *)((char *)(buf)->data + (buf)->size); elem++) #define util_dynarray_foreach_reverse(buf, type, elem) \ if ((buf)->size > 0) \ for (type *elem = util_dynarray_top_ptr(buf, type); \ elem; \ elem = elem > (type *)(buf)->data ? elem - 1 : NULL) #define util_dynarray_delete_unordered(buf, type, v) \ do { \ unsigned num_elements = (buf)->size / sizeof(type); \ unsigned i; \ for (i = 0; i < num_elements; i++) { \ type __v = *util_dynarray_element((buf), type, (i)); \ if (v == __v) { \ memcpy(util_dynarray_element((buf), type, (i)), \ util_dynarray_pop_ptr((buf), type), sizeof(type)); \ break; \ } \ } \ } while (0) #ifdef __cplusplus } #endif #endif /* U_DYNARRAY_H */