1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/* Copyright (C) 2022 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
/*!
* \brief Simple write-once allocation-optimal dynamic array.
*
* Include it into your .c file
*
* prefix - identifier prefix, e.g. ptr -> struct ptr_dynarray, ptr_dynarray_add(), ...
* ntype - data type to be stored. Let it be a number, pointer or small struct
* initial_capacity - how many data items will be allocated on stac and copied with assignment
*
* prefix_dynarray_add() - add a data item
* prefix_dynarray_fix() - call EVERYTIME the array is copied from some already invalid stack
* prefix_dynarray_free() - call EVERYTIME you dismiss all copies of the array
*
*/
#include <stdlib.h>
#include <assert.h>
#include "libknot/attribute.h"
#pragma once
#define DYNARRAY_VISIBILITY_NORMAL
#define DYNARRAY_VISIBILITY_STATIC static
#define DYNARRAY_VISIBILITY_PUBLIC _public_
#define knot_dynarray_declare(prefix, ntype, visibility, initial_capacity) \
typedef struct prefix ## _dynarray { \
ssize_t capacity; \
ssize_t size; \
ntype *(*arr)(struct prefix ## _dynarray *dynarray); \
ntype init[initial_capacity]; \
ntype *_arr; \
} prefix ## _dynarray_t; \
\
visibility ntype *prefix ## _dynarray_arr(prefix ## _dynarray_t *dynarray); \
visibility ntype *prefix ## _dynarray_add(prefix ## _dynarray_t *dynarray, \
ntype const *to_add); \
visibility void prefix ## _dynarray_remove(prefix ## _dynarray_t *dynarray, \
ntype const *to_remove); \
visibility void prefix ## _dynarray_sort(prefix ## _dynarray_t *dynarray); \
visibility ntype *prefix ## _dynarray_bsearch(prefix ## _dynarray_t *dynarray, \
const ntype *bskey); \
visibility void prefix ## _dynarray_sort_dedup(prefix ## _dynarray_t *dynarray); \
visibility void prefix ## _dynarray_free(prefix ## _dynarray_t *dynarray);
#define knot_dynarray_foreach(prefix, ntype, ptr, array) \
for (ntype *ptr = prefix ## _dynarray_arr(&(array)); \
ptr < prefix ## _dynarray_arr(&(array)) + (array).size; ptr++)
#define knot_dynarray_define(prefix, ntype, visibility) \
\
static void prefix ## _dynarray_free__(struct prefix ## _dynarray *dynarray) \
{ \
if (dynarray->capacity > sizeof(dynarray->init) / sizeof(*dynarray->init)) { \
free(dynarray->_arr); \
} \
} \
\
_unused_ \
visibility ntype *prefix ## _dynarray_arr(struct prefix ## _dynarray *dynarray) \
{ \
assert(dynarray->size <= dynarray->capacity); \
return (dynarray->capacity <= sizeof(dynarray->init) / sizeof(*dynarray->init) ? \
dynarray->init : dynarray->_arr); \
} \
\
static ntype *prefix ## _dynarray_arr_init__(struct prefix ## _dynarray *dynarray) \
{ \
assert(dynarray->capacity == sizeof(dynarray->init) / sizeof(*dynarray->init)); \
return dynarray->init; \
} \
\
static ntype *prefix ## _dynarray_arr_arr__(struct prefix ## _dynarray *dynarray) \
{ \
assert(dynarray->capacity > sizeof(dynarray->init) / sizeof(*dynarray->init)); \
return dynarray->_arr; \
} \
\
_unused_ \
visibility ntype *prefix ## _dynarray_add(struct prefix ## _dynarray *dynarray, \
ntype const *to_add) \
{ \
if (dynarray->capacity < 0) { \
return NULL; \
} \
if (dynarray->capacity == 0) { \
dynarray->capacity = sizeof(dynarray->init) / sizeof(*dynarray->init); \
dynarray->arr = prefix ## _dynarray_arr_init__; \
} \
if (dynarray->size >= dynarray->capacity) { \
ssize_t new_capacity = dynarray->capacity * 2 + 1; \
ntype *new_arr = calloc(new_capacity, sizeof(ntype)); \
if (new_arr == NULL) { \
prefix ## _dynarray_free__(dynarray); \
dynarray->capacity = dynarray->size = -1; \
return NULL; \
} \
if (dynarray->capacity > 0) { \
memcpy(new_arr, prefix ## _dynarray_arr(dynarray), \
dynarray->capacity * sizeof(ntype)); \
} \
prefix ## _dynarray_free__(dynarray); \
dynarray->_arr = new_arr; \
dynarray->capacity = new_capacity; \
dynarray->arr = prefix ## _dynarray_arr_arr__; \
} \
ntype *add_to = &prefix ## _dynarray_arr(dynarray)[dynarray->size++]; \
*add_to = *to_add; \
return add_to; \
} \
\
_unused_ \
visibility void prefix ## _dynarray_remove(struct prefix ## _dynarray *dynarray, \
ntype const *to_remove) \
{ \
ntype *orig_arr = prefix ## _dynarray_arr(dynarray); \
knot_dynarray_foreach(prefix, ntype, removable, *dynarray) { \
if (memcmp(removable, to_remove, sizeof(*to_remove)) == 0) { \
if (removable != orig_arr + --dynarray->size) { \
*(removable--) = orig_arr[dynarray->size]; \
} \
} \
} /* TODO enable lowering capacity, take care of capacity going back to initial! */ \
} \
\
static int prefix ## _dynarray_memb_cmp(const void *a, const void *b) \
{ \
return memcmp(a, b, sizeof(ntype)); \
} \
\
_unused_ \
visibility void prefix ## _dynarray_sort(struct prefix ## _dynarray *dynarray) \
{ \
ntype *arr = prefix ## _dynarray_arr(dynarray); \
qsort(arr, dynarray->size, sizeof(*arr), prefix ## _dynarray_memb_cmp); \
} \
\
_unused_ \
visibility ntype *prefix ## _dynarray_bsearch(struct prefix ## _dynarray *dynarray, const ntype *bskey) \
{ \
ntype *arr = prefix ## _dynarray_arr(dynarray); \
return bsearch(bskey, arr, dynarray->size, sizeof(*arr), prefix ## _dynarray_memb_cmp); \
} \
\
_unused_ \
visibility void prefix ## _dynarray_sort_dedup(struct prefix ## _dynarray *dynarray) \
{ \
if (dynarray->size > 1) { \
prefix ## _dynarray_sort(dynarray); \
ntype *arr = prefix ## _dynarray_arr(dynarray); \
ntype *rd = arr + 1; \
ntype *wr = arr + 1; \
ntype *end = arr + dynarray->size; \
while (rd != end) { \
if (memcmp(rd - 1, rd, sizeof(*rd)) != 0) { \
if (wr != rd) { \
*wr = *rd; \
} \
wr++; \
} \
rd++; \
} \
dynarray->size = wr - arr; \
} \
} \
_unused_ \
visibility void prefix ## _dynarray_free(struct prefix ## _dynarray *dynarray) \
{ \
prefix ## _dynarray_free__(dynarray); \
memset(dynarray, 0, sizeof(*dynarray)); \
}
|
