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) \
50 typedef PRIV_ARRAY(Type) Type ## _array_t; \
52 static inline Type ## _array_t *Type ## _array_new(void) \
54 return p_new(Type ## _array_t, 1); \
57 static inline void Type ## _array_delete(Type ## _array_t **array) \
60 array_wipe(**array); \
64 #define A(Type) Type ## _array_t
66 #define ARRAY_INIT { NULL, 0, 0 }
68 #define array_init(array) (array) = ARRAY_INIT
69 #define array_wipe(array) \
71 p_delete(&(array).data); \
75 #define array_add(array, obj) \
77 array_ensure_capacity_delta(array, 1); \
78 (array).data[(array).len++] = (obj); \
80 #define array_append(array, objs, len) \
82 const ssize_t __len = (len); \
83 array_ensure_capacity_delta(array, __len); \
84 memcpy((array).data + (array).len, objs, \
85 __len * sizeof(*(array).data)); \
86 (array).len += __len; \
88 #define array_ensure_capacity(array, goal) \
90 if ((array).size < (goal)) { \
91 const ssize_t required_size = (goal); \
92 ssize_t next_size = (array).size; \
94 next_size = p_alloc_nr(next_size); \
95 } while (next_size < required_size); \
96 p_allocgrow(&(array).data, next_size, &(array).size); \
99 #define array_ensure_capacity_delta(array, delta) \
100 array_ensure_capacity(array, (array).len + (delta))
101 #define array_ensure_exact_capacity(array, goal) \
102 if (array_size(array) < (goal)) { \
103 p_allocgrow(&(array).data, (goal), &(array).size); \
105 #define array_adjust(array) \
107 p_shrink(&(array).data, (array).len, &(array).size); \
109 #define array_elt(array, n) (array).data[(n)]
110 #define array_ptr(array, n) (array).data + (n)
112 #define array_foreach(array, action) \
113 for (int __Ai = 0 ; __Ai < (array).len ; ++__Ai) { \
114 action(array_ptr(array, __Ai)); \
116 #define array_deep_wipe(array, wipe) \
118 array_foreach(array, wipe); \
122 #define array_lock(array) \
123 !(mlock((array).data, (array).len * sizeof(*(array).data)) != 0)
124 #define array_unlock(array) \
125 (void)munlock((array).data, (array).len * sizeof(*(array).data))