common/array.h

   1 /******************************************************************************/
   2 /*          pfixtools: a collection of postfix related tools                  */
   3 /*          ~~~~~~~~~                                                         */
   4 /*  ________________________________________________________________________  */
   5 /*                                                                            */
   6 /*  Redistribution and use in source and binary forms, with or without        */
   7 /*  modification, are permitted provided that the following conditions        */
   8 /*  are met:                                                                  */
   9 /*                                                                            */
  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     */
  17 /*     permission.                                                            */
  18 /*                                                                            */
  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 /******************************************************************************/
  31
  32 /*
  33  * Copyright © 2008 Florent Bruneau
  34  */
  35
  36 #ifndef PFIXTOOLS_ARRAY_H
  37 #define PFIXTOOLS_ARRAY_H
  38
  39 #include "common.h"
  40 #include "mem.h"
  41 #include <sys/mman.h>
  42
  43 #define PRIV_ARRAY(Type)                                                       \
  44     struct {                                                                   \
  45         Type    *data;                                                         \
  46         ssize_t len;                                                           \
  47         ssize_t size;                                                          \
  48     }
  49 #define ARRAY(Type)                                                            \
  50     typedef PRIV_ARRAY(Type) Type ## _array_t;                                 \
  51     typedef PRIV_ARRAY(Type*) Type ## _ptr_array_t;                            \
  52                                                                                \
  53     static inline Type ## _array_t *Type ## _array_new(void)                   \
  54     {                                                                          \
  55         return p_new(Type ## _array_t, 1);                                     \
  56     }                                                                          \
  57                                                                                \
  58     static inline void Type ## _array_delete(Type ## _array_t **array)         \
  59     {                                                                          \
  60         if (*array) {                                                          \
  61             array_wipe(**array);                                               \
  62             p_delete(array);                                                   \
  63         }                                                                      \
  64     }                                                                          \
  65                                                                                \
  66     static inline Type ## _ptr_array_t *Type ## _ptr_array_new(void)           \
  67     {                                                                          \
  68         return p_new(Type ## _ptr_array_t, 1);                                 \
  69     }                                                                          \
  70                                                                                \
  71     static inline void Type ## _ptr_array_delete(Type ## _ptr_array_t **array) \
  72     {                                                                          \
  73         if (*array) {                                                          \
  74             array_wipe(**array);                                               \
  75             p_delete(array);                                                   \
  76         }                                                                      \
  77     }
  78 #define A(Type) Type ## _array_t
  79 #define PA(Type) Type ## _ptr_array_t
  80
  81 #define ARRAY_INIT { NULL, 0, 0 }
  82
  83 #define array_init(array) (array) = ARRAY_INIT
  84 #define array_wipe(array)                                                      \
  85     do {                                                                       \
  86         p_delete(&(array).data);                                               \
  87         (array).len  = 0;                                                      \
  88         (array).size = 0;                                                      \
  89     } while (0)
  90 #define array_add(array, obj)                                                  \
  91     do {                                                                       \
  92         array_ensure_capacity_delta(array, 1);                                 \
  93         (array).data[(array).len++] = (obj);                                   \
  94     } while (0)
  95 #define array_append(array, objs, len)                                         \
  96     do {                                                                       \
  97         const ssize_t __len = (len);                                           \
  98         array_ensure_capacity_delta(array, __len);                             \
  99         memcpy((array).data + (array).len, objs,                               \
 100                __len * sizeof(*(array).data));                                 \
 101         (array).len += __len;                                                  \
 102     } while (0)
 103 #define array_ensure_capacity(array, goal)                                     \
 104     do {                                                                       \
 105         if ((array).size < (goal)) {                                           \
 106             const ssize_t required_size = (goal);                              \
 107             ssize_t next_size = (array).size;                                  \
 108             do {                                                               \
 109                 next_size = p_alloc_nr(next_size);                             \
 110             } while (next_size < required_size);                               \
 111             p_allocgrow(&(array).data, next_size, &(array).size);              \
 112         }                                                                      \
 113     } while (0)
 114 #define array_ensure_capacity_delta(array, delta)                              \
 115     array_ensure_capacity(array, (array).len + (delta))
 116 #define array_ensure_exact_capacity(array, goal)                               \
 117     if (array_size(array) < (goal)) {                                          \
 118         p_allocgrow(&(array).data, (goal), &(array).size);                     \
 119     }
 120 #define array_adjust(array)                                                    \
 121     do {                                                                       \
 122         p_shrink(&(array).data, (array).len, &(array).size);                   \
 123     } while (0)
 124 #define array_elt(array, n) (array).data[(n)]
 125 #define array_ptr(array, n) (array).data + (n)
 126
 127 #define foreach(var, array)                                                    \
 128     for (int __Ai = 0 ; __Ai < (array).len ; ++__Ai) {                         \
 129         var = array_ptr(array, __Ai);
 130
 131 #define array_foreach(array, action)                                           \
 132     for (int __Ai = 0 ; __Ai < (array).len ; ++__Ai) {                         \
 133         action(array_ptr(array, __Ai));                                        \
 134     }
 135 #define array_deep_wipe(array, wipe)                                           \
 136     do {                                                                       \
 137         array_foreach(array, wipe);                                            \
 138         array_wipe(array);                                                     \
 139     } while (0)
 140
 141 #define array_lock(array)                                                      \
 142     !(mlock((array).data, (array).len * sizeof(*(array).data)) != 0)
 143 #define array_unlock(array)                                                    \
 144     (void)munlock((array).data, (array).len * sizeof(*(array).data))
 145
 146 ARRAY(char)
 147 ARRAY(int)
 148 ARRAY(uint32_t)
 149
 150 #endif