1 /**************************************************************************
3 * Copyright 2010 Luca Barbieri
5 * Permission is hereby granted, free of charge, to any person obtaining
6 * a copy of this software and associated documentation files (the
7 * "Software"), to deal in the Software without restriction, including
8 * without limitation the rights to use, copy, modify, merge, publish,
9 * distribute, sublicense, and/or sell copies of the Software, and to
10 * permit persons to whom the Software is furnished to do so, subject to
11 * the following conditions:
13 * The above copyright notice and this permission notice (including the
14 * next paragraph) shall be included in all copies or substantial
15 * portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
18 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
19 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
20 * IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
21 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
22 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
23 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 **************************************************************************/
38 /* A zero-initialized version of this is guaranteed to represent an
41 * Also, size <= capacity and data != 0 if and only if capacity != 0
42 * capacity will always be the allocation size of data
53 util_dynarray_init(struct util_dynarray
*buf
, void *mem_ctx
)
55 memset(buf
, 0, sizeof(*buf
));
56 buf
->mem_ctx
= mem_ctx
;
60 util_dynarray_fini(struct util_dynarray
*buf
)
64 ralloc_free(buf
->data
);
68 util_dynarray_init(buf
, buf
->mem_ctx
);
73 util_dynarray_clear(struct util_dynarray
*buf
)
78 #define DYN_ARRAY_INITIAL_SIZE 64
80 /* use util_dynarray_trim to reduce the allocated storage */
82 util_dynarray_resize(struct util_dynarray
*buf
, unsigned newsize
)
85 if (newsize
> buf
->capacity
) {
86 if (buf
->capacity
== 0)
87 buf
->capacity
= DYN_ARRAY_INITIAL_SIZE
;
89 while (newsize
> buf
->capacity
)
93 buf
->data
= reralloc_size(buf
->mem_ctx
, buf
->data
, buf
->capacity
);
95 buf
->data
= realloc(buf
->data
, buf
->capacity
);
99 p
= (void *)((char *)buf
->data
+ buf
->size
);
106 util_dynarray_grow(struct util_dynarray
*buf
, int diff
)
108 return util_dynarray_resize(buf
, buf
->size
+ diff
);
112 util_dynarray_trim(struct util_dynarray
*buf
)
114 if (buf
->size
!= buf
->capacity
) {
117 buf
->data
= reralloc_size(buf
->mem_ctx
, buf
->data
, buf
->size
);
119 buf
->data
= realloc(buf
->data
, buf
->size
);
121 buf
->capacity
= buf
->size
;
124 ralloc_free(buf
->data
);
134 #define util_dynarray_append(buf, type, v) do {type __v = (v); memcpy(util_dynarray_grow((buf), sizeof(type)), &__v, sizeof(type));} while(0)
135 #define util_dynarray_top_ptr(buf, type) (type*)((char*)(buf)->data + (buf)->size - sizeof(type))
136 #define util_dynarray_top(buf, type) *util_dynarray_top_ptr(buf, type)
137 #define util_dynarray_pop_ptr(buf, type) (type*)((char*)(buf)->data + ((buf)->size -= sizeof(type)))
138 #define util_dynarray_pop(buf, type) *util_dynarray_pop_ptr(buf, type)
139 #define util_dynarray_contains(buf, type) ((buf)->size >= sizeof(type))
140 #define util_dynarray_element(buf, type, idx) ((type*)(buf)->data + (idx))
141 #define util_dynarray_begin(buf) ((buf)->data)
142 #define util_dynarray_end(buf) ((void*)util_dynarray_element((buf), char, (buf)->size))
144 #define util_dynarray_foreach(buf, type, elem) \
145 for (type *elem = (type *)(buf)->data; \
146 elem < (type *)((char *)(buf)->data + (buf)->size); elem++)
148 #define util_dynarray_delete_unordered(buf, type, v) \
150 unsigned num_elements = (buf)->size / sizeof(type); \
152 for (i = 0; i < num_elements; i++) { \
153 type __v = *util_dynarray_element((buf), type, (i)); \
155 memcpy(util_dynarray_element((buf), type, (i)), \
156 util_dynarray_pop_ptr((buf), type), sizeof(type)); \
166 #endif /* U_DYNARRAY_H */