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
|
/* This file is dedicated to the public domain. */
#ifndef INC_VEC_H
#define INC_VEC_H
#include <errno.h>
#include <stdbool.h>
#include <stdlib.h>
#include "../intdefs.h"
struct _vec {
uint sz;
uint max;
void *data;
};
/*
* A dynamic array with push, pop and concatenate operations.
*
* Usage: struct VEC(my_type) myvec = {0};
* Or: struct myvec VEC(my_type);
* Or: typedef struct VEC(my_type) myvec;
*/
#define VEC(type) { \
uint sz; \
uint max; \
type *data; \
}
#if defined(__GNUC__) || defined(__clang__)
__attribute__((unused)) // heck off gcc
#endif
static bool _vec_ensure(struct _vec *v, uint tsize, uint newmax) {
// FIXME: potential overflow at least on 32-bit hosts (if any!?).
// should use reallocarray or something but didn't feel like porting right
// now. consider doing later.
void *new = realloc(v->data, tsize * newmax);
if (new) { v->data = new; v->max = newmax; }
return !!new;
}
#if defined(__GNUC__) || defined(__clang__)
__attribute__((unused)) // heck off gcc 2
#endif
static bool _vec_make_room(struct _vec *v, uint tsize, uint addcnt) {
// this overflow check is probably unnecessary, but just in case
u64 chk = v->max + addcnt;
if (chk > 1u << 30) { errno = ENOMEM; return false; }
u32 x = chk;
if (x < 16) {
x = 16;
}
else {
// round up to next 2*n
--x;
x |= x >> 1; x |= x >> 2; x |= x >> 4; x |= x >> 8; x |= x >> 16;
x++;
}
return _vec_ensure(v, tsize, x);
}
// internal: for reuse by vec0
#define _vec_push(v, val, slack) ( \
((v)->sz + (slack) < (v)->max || \
_vec_make_room((struct _vec *)(v), sizeof(val), 1)) && \
((v)->data[(v)->sz++ - slack] = (val), true) \
)
#define _vec_pushall(v, vals, n, slack) ( \
((v)->sz + (n) + (slack) <= (v)->max || \
_vec_make_room((struct _vec *)(v), sizeof(*(vals)), (n))) && \
(memcpy((v)->data + (v)->sz - (slack), (vals), (n) * sizeof(*(vals))), \
(v)->sz += (n), true) \
)
/*
* Appends an item to the end of a vector. Gives true on success and false if
* memory allocation fails.
*/
#define vec_push(v, val) _vec_push(v, val, 0)
/*
* Appends n items from an array to the end of a vector. Gives true on success
* and false if memory allocation fails.
*/
#define vec_pushall(v, vals, n) _vec_pushall(v, vals, n, 0)
/*
* Removes an item from the end of a vector and gives that item.
*/
#define vec_pop(v) ((v)->data[--(v)->sz])
#endif
// vi: sw=4 ts=4 noet tw=80 cc=80
|
