-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvec.c
131 lines (99 loc) · 2.33 KB
/
vec.c
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
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <stdint.h>
#include <errno.h>
#define DEFAULT_VEC_SIZE 16
// TODO: every vector allocated is limited to 4GB of raw memory size because of the limit of size_t,
// switch it to ll to allow bigger allocations
struct vec {
size_t len; /* number of members */
size_t mem_size; /* size of a single element */
size_t capacity; /* in bytes */
char *raw;
};
int __vec__expand(struct vec *vec, size_t size_least);
// reserve num number of elements for the vector, do so by allocating memory exponentially
int vec__reserve(void *__vec, size_t num)
{
struct vec *vec = __vec;
int err = 0;
if (num <= vec->len)
return 0;
err = __vec__expand(vec, num);
if (err)
return err;
vec->len = num;
return err;
}
void *vec__new(size_t mem_size)
{
struct vec *vec = malloc(sizeof(struct vec));
if (vec == NULL)
return NULL;
vec->raw = malloc(DEFAULT_VEC_SIZE);
if (vec->raw == NULL)
return NULL;
vec->len = 0;
vec->mem_size = mem_size;
vec->capacity = DEFAULT_VEC_SIZE;
return vec;
}
void vec__free(void *__vec)
{
struct vec *vec = __vec;
free(vec->raw);
free(vec);
}
int __vec__expand(struct vec *vec, size_t size_least)
{
size_t capacity = vec->capacity, capacity_old = capacity;
void *__new;
while (capacity < size_least) {
capacity <<= 1;
// to prevent overflow
if (capacity <= capacity_old)
return -ENOMEM;
capacity_old = capacity;
}
__new = realloc(vec->raw, capacity);
if (__new == NULL)
return -ENOMEM;
vec->raw = __new;
vec->capacity = capacity;
return 0;
}
int __vec__push(void *__vec, void *elem, size_t elem_size)
{
struct vec *vec = __vec;
size_t size_least;
assert(vec->mem_size == elem_size);
assert(vec->len * vec->mem_size <= SIZE_MAX - elem_size);
size_least = vec->len * vec->mem_size + elem_size;
if (size_least > vec->capacity && __vec__expand(vec, size_least))
return -1;
memcpy(vec->raw + vec->len * vec->mem_size, elem, elem_size);
++vec->len;
return 0;
}
void vec__pop(void *__vec)
{
struct vec *vec = __vec;
if (vec->len > 0)
--vec->len;
}
void *__vec__at(void *__vec, size_t pos)
{
struct vec *vec = __vec;
return vec->raw + pos * vec->mem_size;
}
size_t vec__len_st(void *__vec)
{
struct vec *vec = __vec;
return vec->len;
}
size_t vec__cap(void *__vec)
{
struct vec *vec = __vec;
return vec->capacity;
}