1 /******************************************************************************/
2 /* pfixtools: a collection of postfix related tools */
4 /* ________________________________________________________________________ */
6 /* Redistribution and use in source and binary forms, with or without */
7 /* modification, are permitted provided that the following conditions */
10 /* 1. Redistributions of source code must retain the above copyright */
11 /* notice, this list of conditions and the following disclaimer. */
12 /* 2. Redistributions in binary form must reproduce the above copyright */
13 /* notice, this list of conditions and the following disclaimer in the */
14 /* documentation and/or other materials provided with the distribution. */
15 /* 3. The names of its contributors may not be used to endorse or promote */
16 /* products derived from this software without specific prior written */
19 /* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND */
20 /* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE */
21 /* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
22 /* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS */
23 /* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR */
24 /* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF */
25 /* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS */
26 /* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */
27 /* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) */
28 /* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF */
29 /* THE POSSIBILITY OF SUCH DAMAGE. */
30 /******************************************************************************/
33 * Copyright © 2008 Florent Bruneau
36 #ifndef PFIXTOOLS_ARRAY_H
37 #define PFIXTOOLS_ARRAY_H
43 #define PRIV_ARRAY(Type) \
48 unsigned locked : 1; \
51 #define PARRAY(Type) \
52 typedef PRIV_ARRAY(Type*) Type ## _ptr_array_t; \
53 static inline Type ## _ptr_array_t *Type ## _ptr_array_new(void) \
55 return p_new(Type ## _ptr_array_t, 1); \
58 static inline void Type ## _ptr_array_delete(Type ## _ptr_array_t **array) \
61 if ((*array)->locked) { \
62 array_unlock(**array); \
64 array_wipe(**array); \
70 typedef PRIV_ARRAY(Type) Type ## _array_t; \
72 static inline Type ## _array_t *Type ## _array_new(void) \
74 return p_new(Type ## _array_t, 1); \
77 static inline void Type ## _array_delete(Type ## _array_t **array) \
80 if ((*array)->locked) { \
81 array_unlock(**array); \
83 array_wipe(**array); \
90 #define A(Type) Type ## _array_t
91 #define PA(Type) Type ## _ptr_array_t
93 #define ARRAY_INIT { NULL, 0, 0, false }
95 #define array_init(array) (array) = ARRAY_INIT
97 #define array_can_edit(array) (!(array).locked)
99 #define array_ensure_can_edit(array) \
100 assert(array_can_edit(array) && "Trying to edit array while it is locked")
102 #define array_wipe(array) \
104 array_ensure_can_edit(array); \
105 p_delete(&(array).data); \
109 #define array_add(array, obj) \
111 array_ensure_capacity_delta(array, 1); \
112 (array).data[(array).len++] = (obj); \
114 #define array_append(array, objs, len) \
116 const typeof((array).len) __len = (len); \
117 array_ensure_capacity_delta(array, __len); \
118 memcpy((array).data + (array).len, objs, \
119 __len * sizeof(*(array).data)); \
120 (array).len += __len; \
122 #define array_ensure_capacity(array, goal) \
124 array_ensure_can_edit(array); \
125 if ((array).size < (goal)) { \
126 const typeof((array).size) required_size = (goal); \
127 typeof((array).size) next_size = (array).size; \
129 next_size = p_alloc_nr(next_size); \
130 } while (next_size < required_size); \
131 p_allocgrow(&(array).data, next_size, &(array).size); \
134 #define array_ensure_capacity_delta(array, delta) \
135 array_ensure_capacity(array, (array).len + (delta))
136 #define array_ensure_exact_capacity(array, goal) \
137 if ((array).size < (goal)) { \
138 array_ensure_can_edit(array); \
139 p_allocgrow(&(array).data, (goal), &(array).size); \
141 #define array_adjust(array) \
143 array_ensure_can_edit(array); \
144 p_shrink(&(array).data, (array).len, &(array).size); \
146 #define array_elt(array, n) (array).data[(n)]
147 #define array_ptr(array, n) (array).data + (n)
149 #define foreach(var, array) \
150 for (uint32_t __Ai = 0 ; __Ai < (array).len ; ++__Ai) { \
151 var = array_ptr(array, __Ai);
153 #define array_foreach(array, action) \
154 for (uint32_t __Ai = 0 ; __Ai < (array).len ; ++__Ai) { \
155 action(array_ptr(array, __Ai)); \
157 #define array_deep_wipe(array, wipe) \
159 array_foreach(array, wipe); \
163 #define array_len(array) (array).len
164 #define array_size(array) (array).size
165 #define array_elt_len(array) sizeof(*(array).data)
166 #define array_byte_len(array) ((array).len * array_elt_len(array))
168 #define array_lock(array) \
170 || (mlock((array).data, array_byte_len(array)) == 0 \
171 && ((array).locked = true)))
172 #define array_unlock(array) \
173 if ((array).locked) { \
174 (void)munlock((array).data, array_byte_len(array)); \
175 (array).locked = false; \