array.h

   1 /* $OpenBSD$ */
   2
   3 /*
   4  * Copyright (c) 2006 Nicholas Marriott <nicm@users.sourceforge.net>
   5  *
   6  * Permission to use, copy, modify, and distribute this software for any
   7  * purpose with or without fee is hereby granted, provided that the above
   8  * copyright notice and this permission notice appear in all copies.
   9  *
  10  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  11  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  12  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
  13  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  14  * WHATSOEVER RESULTING FROM LOSS OF MIND, USE, DATA OR PROFITS, WHETHER
  15  * IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
  16  * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  17  */
  18
  19 #ifndef ARRAY_H
  20 #define ARRAY_H
  21
  22 #define ARRAY_DECL(n, c)                                                \
  23         struct n {                                                      \
  24                 c       *list;                                          \
  25                 u_int    num;                                           \
  26                 size_t   space;                                         \
  27         }
  28
  29 #define ARRAY_ITEM(a, i) ((a)->list[i])
  30 #define ARRAY_ITEMSIZE(a) (sizeof *(a)->list)
  31 #define ARRAY_INITIALSPACE(a) (10 * ARRAY_ITEMSIZE(a))
  32
  33 #define ARRAY_ENSURE(a, n) do {                                         \
  34         if (UINT_MAX - (n) < (a)->num)                                  \
  35                 fatalx("number too big");                               \
  36         if (SIZE_MAX / ((a)->num + (n)) < ARRAY_ITEMSIZE(a))            \
  37                 fatalx("size too big");                                 \
  38         if ((a)->space == 0) {                                          \
  39                 (a)->space = ARRAY_INITIALSPACE(a);                     \
  40                 (a)->list = xrealloc((a)->list, 1, (a)->space);         \
  41         }                                                               \
  42         while ((a)->space <= ((a)->num + (n)) * ARRAY_ITEMSIZE(a)) {    \
  43                 (a)->list = xrealloc((a)->list, 2, (a)->space);         \
  44                 (a)->space *= 2;                                        \
  45         }                                                               \
  46 } while (0)
  47
  48 #define ARRAY_EMPTY(a) ((a) == NULL || (a)->num == 0)
  49 #define ARRAY_LENGTH(a) ((a)->num)
  50 #define ARRAY_DATA(a) ((a)->list)
  51
  52 #define ARRAY_FIRST(a) ARRAY_ITEM(a, 0)
  53 #define ARRAY_LAST(a) ARRAY_ITEM(a, (a)->num - 1)
  54
  55 #define ARRAY_INIT(a) do {                                              \
  56         (a)->num = 0;                                                   \
  57         (a)->list = NULL;                                               \
  58         (a)->space = 0;                                                 \
  59 } while (0)
  60 #define ARRAY_CLEAR(a) do {                                             \
  61         (a)->num = 0;                                                   \
  62 } while (0)
  63
  64 #define ARRAY_SET(a, i, s) do {                                         \
  65         (a)->list[i] = s;                                               \
  66 } while (0)
  67
  68 #define ARRAY_ADD(a, s) do {                                            \
  69         ARRAY_ENSURE(a, 1);                                             \
  70         (a)->list[(a)->num] = s;                                        \
  71         (a)->num++;                                                     \
  72 } while (0)
  73 #define ARRAY_INSERT(a, i, s) do {                                      \
  74         ARRAY_ENSURE(a, 1);                                             \
  75         if ((i) < (a)->num) {                                           \
  76                 memmove((a)->list + (i) + 1, (a)->list + (i),           \
  77                     ARRAY_ITEMSIZE(a) * ((a)->num - (i)));              \
  78         }                                                               \
  79         (a)->list[i] = s;                                               \
  80         (a)->num++;                                                     \
  81 } while (0)
  82 #define ARRAY_REMOVE(a, i) do {                                         \
  83         if ((i) < (a)->num - 1) {                                       \
  84                 memmove((a)->list + (i), (a)->list + (i) + 1,           \
  85                     ARRAY_ITEMSIZE(a) * ((a)->num - (i) - 1));          \
  86         }                                                               \
  87         (a)->num--;                                                     \
  88         if ((a)->num == 0)                                              \
  89                 ARRAY_FREE(a);                                          \
  90 } while (0)
  91
  92 #define ARRAY_EXPAND(a, n) do {                                         \
  93         ARRAY_ENSURE(a, n);                                             \
  94         (a)->num += n;                                                  \
  95 } while (0)
  96 #define ARRAY_TRUNC(a, n) do {                                          \
  97         if ((a)->num > n)                                               \
  98                 (a)->num -= n;                                          \
  99         else                                                            \
 100                 ARRAY_FREE(a);                                          \
 101 } while (0)
 102
 103 #define ARRAY_CONCAT(a, b) do {                                         \
 104         ARRAY_ENSURE(a, (b)->num);                                      \
 105         memcpy((a)->list + (a)->num, (b)->list, (b)->num * ARRAY_ITEMSIZE(a)); \
 106         (a)->num += (b)->num;                                           \
 107 } while (0)
 108
 109 #define ARRAY_FREE(a) do {                                              \
 110         if ((a)->list != NULL)                                          \
 111                 xfree((a)->list);                                       \
 112         ARRAY_INIT(a);                                                  \
 113 } while (0)
 114 #define ARRAY_FREEALL(a) do {                                           \
 115         ARRAY_FREE(a);                                                  \
 116         xfree(a);                                                       \
 117 } while (0)
 118
 119 #endif