2 * *****************************************************************************
4 * SPDX-License-Identifier: BSD-2-Clause
6 * Copyright (c) 2018-2020 Gavin D. Howard and contributors.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * * Redistributions of source code must retain the above copyright notice, this
12 * list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above copyright notice,
15 * this list of conditions and the following disclaimer in the documentation
16 * and/or other materials provided with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 * POSSIBILITY OF SUCH DAMAGE.
30 * *****************************************************************************
32 * Code to manipulate vectors (resizable arrays).
45 static void bc_vec_grow(BcVec *restrict v, size_t n) {
47 size_t len, cap = v->cap;
50 len = bc_vm_growSize(v->len, n);
52 while (cap < len) cap = bc_vm_growSize(cap, cap);
55 v->v = bc_vm_realloc(v->v, bc_vm_arraySize(cap, v->size));
57 BC_SIG_TRYUNLOCK(lock);
60 void bc_vec_init(BcVec *restrict v, size_t esize, BcVecFree dtor) {
62 assert(v != NULL && esize);
64 v->cap = BC_VEC_START_CAP;
67 v->v = bc_vm_malloc(bc_vm_arraySize(BC_VEC_START_CAP, esize));
70 void bc_vec_expand(BcVec *restrict v, size_t req) {
80 v->v = bc_vm_realloc(v->v, bc_vm_arraySize(req, v->size));
83 BC_SIG_TRYUNLOCK(lock);
87 void bc_vec_npop(BcVec *restrict v, size_t n) {
91 assert(v != NULL && n <= v->len);
95 if (v->dtor == NULL) v->len -= n;
97 size_t len = v->len - n;
98 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
101 BC_SIG_TRYUNLOCK(lock);
104 void bc_vec_npopAt(BcVec *restrict v, size_t n, size_t idx) {
109 assert(idx + n < v->len);
111 ptr = bc_vec_item(v, idx);
112 data = bc_vec_item(v, idx + n);
116 if (v->dtor != NULL) {
120 for (i = 0; i < n; ++i) v->dtor(bc_vec_item(v, idx + i));
124 memmove(ptr, data, (v->len - idx) * v->size);
129 void bc_vec_npush(BcVec *restrict v, size_t n, const void *data) {
133 assert(v != NULL && data != NULL);
135 BC_SIG_TRYLOCK(lock);
137 if (v->len + n > v->cap) bc_vec_grow(v, n);
139 memcpy(v->v + (v->size * v->len), data, v->size * n);
142 BC_SIG_TRYUNLOCK(lock);
145 inline void bc_vec_push(BcVec *restrict v, const void *data) {
146 bc_vec_npush(v, 1, data);
149 void bc_vec_pushByte(BcVec *restrict v, uchar data) {
150 assert(v != NULL && v->size == sizeof(uchar));
151 bc_vec_npush(v, 1, &data);
154 void bc_vec_pushIndex(BcVec *restrict v, size_t idx) {
156 uchar amt, nums[sizeof(size_t) + 1];
159 assert(v->size == sizeof(uchar));
161 for (amt = 0; idx; ++amt) {
162 nums[amt + 1] = (uchar) idx;
163 idx &= ((size_t) ~(UCHAR_MAX));
164 idx >>= sizeof(uchar) * CHAR_BIT;
169 bc_vec_npush(v, amt + 1, nums);
172 static void bc_vec_pushAt(BcVec *restrict v, const void *data, size_t idx) {
176 assert(v != NULL && data != NULL && idx <= v->len);
178 BC_SIG_TRYLOCK(lock);
180 if (idx == v->len) bc_vec_push(v, data);
185 if (v->len == v->cap) bc_vec_grow(v, 1);
187 ptr = v->v + v->size * idx;
189 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
190 memmove(ptr, data, v->size);
193 BC_SIG_TRYUNLOCK(lock);
196 void bc_vec_string(BcVec *restrict v, size_t len, const char *restrict str) {
200 assert(v != NULL && v->size == sizeof(char));
201 assert(v->dtor == NULL);
202 assert(!v->len || !v->v[v->len - 1]);
205 BC_SIG_TRYLOCK(lock);
207 bc_vec_npop(v, v->len);
208 bc_vec_expand(v, bc_vm_growSize(len, 1));
209 memcpy(v->v, str, len);
212 bc_vec_pushByte(v, '\0');
214 BC_SIG_TRYUNLOCK(lock);
217 void bc_vec_concat(BcVec *restrict v, const char *restrict str) {
221 assert(v != NULL && v->size == sizeof(char));
222 assert(v->dtor == NULL);
223 assert(!v->len || !v->v[v->len - 1]);
226 BC_SIG_TRYLOCK(lock);
228 if (v->len) v->len -= 1;
230 bc_vec_npush(v, strlen(str) + 1, str);
232 BC_SIG_TRYUNLOCK(lock);
235 void bc_vec_empty(BcVec *restrict v) {
239 assert(v != NULL && v->size == sizeof(char));
240 assert(v->dtor == NULL);
242 BC_SIG_TRYLOCK(lock);
244 bc_vec_npop(v, v->len);
245 bc_vec_pushByte(v, '\0');
247 BC_SIG_TRYUNLOCK(lock);
250 #if BC_ENABLE_HISTORY
251 void bc_vec_replaceAt(BcVec *restrict v, size_t idx, const void *data) {
255 BC_SIG_ASSERT_LOCKED;
259 ptr = bc_vec_item(v, idx);
261 if (v->dtor != NULL) v->dtor(ptr);
263 memcpy(ptr, data, v->size);
265 #endif // BC_ENABLE_HISTORY
267 inline void* bc_vec_item(const BcVec *restrict v, size_t idx) {
268 assert(v != NULL && v->len && idx < v->len);
269 return v->v + v->size * idx;
272 inline void* bc_vec_item_rev(const BcVec *restrict v, size_t idx) {
273 assert(v != NULL && v->len && idx < v->len);
274 return v->v + v->size * (v->len - idx - 1);
277 inline void bc_vec_clear(BcVec *restrict v) {
278 BC_SIG_ASSERT_LOCKED;
284 void bc_vec_free(void *vec) {
285 BcVec *v = (BcVec*) vec;
286 BC_SIG_ASSERT_LOCKED;
287 bc_vec_npop(v, v->len);
291 static size_t bc_map_find(const BcVec *restrict v, const char *name) {
293 size_t low = 0, high = v->len;
297 size_t mid = (low + high) / 2;
298 const BcId *id = bc_vec_item(v, mid);
299 int result = strcmp(name, id->name);
301 if (!result) return mid;
302 else if (result < 0) high = mid;
309 bool bc_map_insert(BcVec *restrict v, const char *name,
310 size_t idx, size_t *restrict i)
314 BC_SIG_ASSERT_LOCKED;
316 assert(v != NULL && name != NULL && i != NULL);
318 *i = bc_map_find(v, name);
320 assert(*i <= v->len);
322 if (*i != v->len && !strcmp(name, ((BcId*) bc_vec_item(v, *i))->name))
325 id.name = bc_vm_strdup(name);
328 bc_vec_pushAt(v, &id, *i);
333 size_t bc_map_index(const BcVec *restrict v, const char *name) {
337 assert(v != NULL && name != NULL);
339 i = bc_map_find(v, name);
341 if (i >= v->len) return BC_VEC_INVALID_IDX;
343 return strcmp(name, ((BcId*) bc_vec_item(v, i))->name) ?
344 BC_VEC_INVALID_IDX : i;