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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
/**************************************************************************
*
* Copyright 2010 Luca Barbieri
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial
* portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
#ifndef U_DYNARRAY_H
#define U_DYNARRAY_H
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include "ralloc.h"
#ifdef __cplusplus
extern "C" {
#endif
/* A zero-initialized version of this is guaranteed to represent an
* empty array.
*
* Also, size <= capacity and data != 0 if and only if capacity != 0
* capacity will always be the allocation size of data
*/
struct util_dynarray
{
void *mem_ctx;
void *data;
unsigned size;
unsigned capacity;
};
static inline void
util_dynarray_init(struct util_dynarray *buf, void *mem_ctx)
{
memset(buf, 0, sizeof(*buf));
buf->mem_ctx = mem_ctx;
}
static inline void
util_dynarray_fini(struct util_dynarray *buf)
{
if (buf->data) {
if (buf->mem_ctx) {
ralloc_free(buf->data);
} else {
free(buf->data);
}
util_dynarray_init(buf, buf->mem_ctx);
}
}
static inline void
util_dynarray_clear(struct util_dynarray *buf)
{
buf->size = 0;
}
#define DYN_ARRAY_INITIAL_SIZE 64
MUST_CHECK static inline void *
util_dynarray_ensure_cap(struct util_dynarray *buf, unsigned newcap)
{
if (newcap > buf->capacity) {
unsigned capacity = MAX3(DYN_ARRAY_INITIAL_SIZE, buf->capacity * 2, newcap);
void *data;
if (buf->mem_ctx) {
data = reralloc_size(buf->mem_ctx, buf->data, capacity);
} else {
data = realloc(buf->data, capacity);
}
if (!data)
return NULL;
buf->data = data;
buf->capacity = capacity;
}
return (void *)((char *)buf->data + buf->size);
}
/* use util_dynarray_trim to reduce the allocated storage */
MUST_CHECK static inline void *
util_dynarray_resize_bytes(struct util_dynarray *buf, unsigned nelts, size_t eltsize)
{
if (unlikely(nelts > UINT_MAX / eltsize))
return NULL;
unsigned newsize = nelts * eltsize;
void *p = util_dynarray_ensure_cap(buf, newsize);
if (!p)
return NULL;
buf->size = newsize;
return p;
}
static inline void
util_dynarray_clone(struct util_dynarray *buf, void *mem_ctx,
struct util_dynarray *from_buf)
{
util_dynarray_init(buf, mem_ctx);
if (util_dynarray_resize_bytes(buf, from_buf->size, 1))
memcpy(buf->data, from_buf->data, from_buf->size);
}
MUST_CHECK static inline void *
util_dynarray_grow_bytes(struct util_dynarray *buf, unsigned ngrow, size_t eltsize)
{
unsigned growbytes = ngrow * eltsize;
if (unlikely(ngrow > (UINT_MAX / eltsize) ||
growbytes > UINT_MAX - buf->size))
return NULL;
unsigned newsize = buf->size + growbytes;
void *p = util_dynarray_ensure_cap(buf, newsize);
if (!p)
return NULL;
buf->size = newsize;
return p;
}
static inline void
util_dynarray_trim(struct util_dynarray *buf)
{
if (buf->size != buf->capacity) {
if (buf->size) {
if (buf->mem_ctx) {
buf->data = reralloc_size(buf->mem_ctx, buf->data, buf->size);
} else {
buf->data = realloc(buf->data, buf->size);
}
buf->capacity = buf->size;
} else {
if (buf->mem_ctx) {
ralloc_free(buf->data);
} else {
free(buf->data);
}
buf->data = NULL;
buf->capacity = 0;
}
}
}
#define util_dynarray_append(buf, type, v) do {type __v = (v); memcpy(util_dynarray_grow_bytes((buf), 1, sizeof(type)), &__v, sizeof(type));} while(0)
/* Returns a pointer to the space of the first new element (in case of growth) or NULL on failure. */
#define util_dynarray_resize(buf, type, nelts) util_dynarray_resize_bytes(buf, (nelts), sizeof(type))
#define util_dynarray_grow(buf, type, ngrow) util_dynarray_grow_bytes(buf, (ngrow), sizeof(type))
#define util_dynarray_top_ptr(buf, type) (type*)((char*)(buf)->data + (buf)->size - sizeof(type))
#define util_dynarray_top(buf, type) *util_dynarray_top_ptr(buf, type)
#define util_dynarray_pop_ptr(buf, type) (type*)((char*)(buf)->data + ((buf)->size -= sizeof(type)))
#define util_dynarray_pop(buf, type) *util_dynarray_pop_ptr(buf, type)
#define util_dynarray_contains(buf, type) ((buf)->size >= sizeof(type))
#define util_dynarray_element(buf, type, idx) ((type*)(buf)->data + (idx))
#define util_dynarray_begin(buf) ((buf)->data)
#define util_dynarray_end(buf) ((void*)util_dynarray_element((buf), char, (buf)->size))
#define util_dynarray_num_elements(buf, type) ((buf)->size / sizeof(type))
#define util_dynarray_foreach(buf, type, elem) \
for (type *elem = (type *)(buf)->data; \
elem < (type *)((char *)(buf)->data + (buf)->size); elem++)
#define util_dynarray_foreach_reverse(buf, type, elem) \
if ((buf)->size > 0) \
for (type *elem = util_dynarray_top_ptr(buf, type); \
elem; \
elem = elem > (type *)(buf)->data ? elem - 1 : NULL)
#define util_dynarray_delete_unordered(buf, type, v) \
do { \
unsigned num_elements = (buf)->size / sizeof(type); \
unsigned i; \
for (i = 0; i < num_elements; i++) { \
type __v = *util_dynarray_element((buf), type, (i)); \
if (v == __v) { \
memcpy(util_dynarray_element((buf), type, (i)), \
util_dynarray_pop_ptr((buf), type), sizeof(type)); \
break; \
} \
} \
} while (0)
#ifdef __cplusplus
}
#endif
#endif /* U_DYNARRAY_H */
|
