2 * Copyright (C) 2011 Joseph Adams <joeyadams3.14159@gmail.com>
4 * Permission is hereby granted, free of charge, to any person obtaining a copy
5 * of this software and associated documentation files (the "Software"), to deal
6 * in the Software without restriction, including without limitation the rights
7 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8 * copies of the Software, and to permit persons to whom the Software is
9 * furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
26 /* Originally taken from: https://ccodearchive.net/info/darray.html
27 * But modified for libxkbcommon. */
34 #define darray(type) struct { type *item; unsigned size; unsigned alloc; }
36 #define darray_new() { 0, 0, 0 }
38 #define darray_init(arr) do { \
39 (arr).item = 0; (arr).size = 0; (arr).alloc = 0; \
42 #define darray_free(arr) do { \
47 #define darray_steal(arr, to, to_size) do { \
50 *(unsigned int *) (to_size) = (arr).size; \
55 * Typedefs for darrays of common types. These are useful
56 * when you want to pass a pointer to an darray(T) around.
58 * The following will produce an incompatible pointer warning:
60 * void foo(darray(int) *arr);
61 * darray(int) arr = darray_new();
66 * void foo(darray_int *arr);
67 * darray_int arr = darray_new();
71 typedef darray (char) darray_char;
72 typedef darray (signed char) darray_schar;
73 typedef darray (unsigned char) darray_uchar;
75 typedef darray (short) darray_short;
76 typedef darray (int) darray_int;
77 typedef darray (long) darray_long;
79 typedef darray (unsigned short) darray_ushort;
80 typedef darray (unsigned int) darray_uint;
81 typedef darray (unsigned long) darray_ulong;
85 #define darray_item(arr, i) ((arr).item[i])
86 #define darray_size(arr) ((arr).size)
87 #define darray_empty(arr) ((arr).size == 0)
89 /*** Insertion (single item) ***/
91 #define darray_append(arr, ...) do { \
92 darray_resize(arr, (arr).size + 1); \
93 (arr).item[(arr).size - 1] = (__VA_ARGS__); \
96 /*** Insertion (multiple items) ***/
98 #define darray_append_items(arr, items, count) do { \
99 unsigned __count = (count), __oldSize = (arr).size; \
100 darray_resize(arr, __oldSize + __count); \
101 memcpy((arr).item + __oldSize, items, __count * sizeof(*(arr).item)); \
104 #define darray_from_items(arr, items, count) do { \
105 unsigned __count = (count); \
106 darray_resize(arr, __count); \
107 memcpy((arr).item, items, __count * sizeof(*(arr).item)); \
110 #define darray_copy(arr_to, arr_from) \
111 darray_from_items((arr_to), (arr_from).item, (arr_from).size)
113 #define darray_concat(arr_to, arr_from) \
114 darray_append_items((arr_to), (arr_from).item, (arr_from).size)
116 /*** String buffer ***/
118 #define darray_append_string(arr, str) do { \
119 const char *__str = (str); \
120 darray_append_items(arr, __str, strlen(__str) + 1); \
124 #define darray_append_lit(arr, stringLiteral) do { \
125 darray_append_items(arr, stringLiteral, sizeof(stringLiteral)); \
129 #define darray_appends_nullterminate(arr, items, count) do { \
130 unsigned __count = (count), __oldSize = (arr).size; \
131 darray_resize(arr, __oldSize + __count + 1); \
132 memcpy((arr).item + __oldSize, items, __count * sizeof(*(arr).item)); \
133 (arr).item[--(arr).size] = 0; \
136 #define darray_prepends_nullterminate(arr, items, count) do { \
137 unsigned __count = (count), __oldSize = (arr).size; \
138 darray_resize(arr, __count + __oldSize + 1); \
139 memmove((arr).item + __count, (arr).item, \
140 __oldSize * sizeof(*(arr).item)); \
141 memcpy((arr).item, items, __count * sizeof(*(arr).item)); \
142 (arr).item[--(arr).size] = 0; \
145 /*** Size management ***/
147 #define darray_resize(arr, newSize) \
148 darray_growalloc(arr, (arr).size = (newSize))
150 #define darray_resize0(arr, newSize) do { \
151 unsigned __oldSize = (arr).size, __newSize = (newSize); \
152 (arr).size = __newSize; \
153 if (__newSize > __oldSize) { \
154 darray_growalloc(arr, __newSize); \
155 memset(&(arr).item[__oldSize], 0, \
156 (__newSize - __oldSize) * sizeof(*(arr).item)); \
160 #define darray_realloc(arr, newAlloc) do { \
161 (arr).item = realloc((arr).item, \
162 ((arr).alloc = (newAlloc)) * sizeof(*(arr).item)); \
165 #define darray_growalloc(arr, need) do { \
166 unsigned __need = (need); \
167 if (__need > (arr).alloc) \
168 darray_realloc(arr, darray_next_alloc((arr).alloc, __need, \
169 sizeof(*(arr).item))); \
172 #define darray_shrink(arr) do { \
173 if ((arr).size > 0) \
174 (arr).item = realloc((arr).item, \
175 ((arr).alloc = (arr).size) * sizeof(*(arr).item)); \
178 static inline unsigned
179 darray_next_alloc(unsigned alloc, unsigned need, unsigned itemSize)
181 assert(need < UINT_MAX / itemSize / 2); /* Overflow. */
191 #define darray_foreach(i, arr) \
192 for ((i) = &(arr).item[0]; (i) < &(arr).item[(arr).size]; (i)++)
194 #define darray_foreach_from(i, arr, from) \
195 for ((i) = &(arr).item[from]; (i) < &(arr).item[(arr).size]; (i)++)
197 /* Iterate on index and value at the same time, like Python's enumerate. */
198 #define darray_enumerate(idx, val, arr) \
199 for ((idx) = 0, (val) = &(arr).item[0]; \
200 (idx) < (arr).size; \
203 #define darray_enumerate_from(idx, val, arr, from) \
204 for ((idx) = (from), (val) = &(arr).item[0]; \
205 (idx) < (arr).size; \
208 #endif /* CCAN_DARRAY_H */