-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdynarr.c
162 lines (127 loc) · 2.86 KB
/
dynarr.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
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
// SPDX-License-Identifier: GPL-3.0-or-later
// SPDX-FileCopyrightText: 2024 kurth4cker <[email protected]>
#include <sys/types.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include "dynarr.h"
#define CAPACITY_OK(arr, idx) ((idx) < (arr)->capacity)
#define LENGTH_OK(arr, idx) ((idx) < (arr)->len)
static const struct dynarr initial_array = {
.data = NULL,
.size = 0,
.len = 0,
.capacity = 64,
};
static int expand(struct dynarr *);
static void move(struct dynarr *, size_t, ssize_t);
static int
expand(struct dynarr *arr)
{
const size_t capacity = arr->capacity * 2;
void *data = realloc(arr->data, capacity);
if (!data)
return 0;
arr->data = data;
arr->capacity = capacity;
return 1;
}
static void
move(struct dynarr *arr, size_t idx, ssize_t direction)
{
const void *src = dynarr_get(arr, idx);
void *dest = dynarr_get(arr, idx + direction);
size_t size = (arr->len - idx) * arr->size;
assert(CAPACITY_OK(arr, idx + direction));
assert(CAPACITY_OK(arr, idx));
assert(LENGTH_OK(arr, idx));
memmove(dest, src, size);
arr->len += direction;
}
int
dynarr_capacity_ok(const struct dynarr *arr, size_t idx)
{
return CAPACITY_OK(arr, idx);
}
void
dynarr_free(struct dynarr *arr)
{
free(arr->data);
free(arr);
}
void *
dynarr_get(const struct dynarr *arr, size_t idx)
{
assert(CAPACITY_OK(arr, idx));
return (char *)arr->data + idx * arr->size;
}
int
dynarr_insert(struct dynarr *arr, size_t idx, const void *obj)
{
static const ssize_t direction = 1;
if (!LENGTH_OK(arr, idx))
return dynarr_push(arr, obj);
if (!CAPACITY_OK(arr, arr->len + direction) && !expand(arr))
return 0;
move(arr, idx, direction);
dynarr_set(arr, idx, obj);
return 1;
}
int
dynarr_length_ok(const struct dynarr *arr, size_t idx)
{
return LENGTH_OK(arr, idx);
}
struct dynarr *
dynarr_new(size_t size)
{
struct dynarr *arr = malloc(sizeof(struct dynarr));
if (!arr)
return NULL;
arr->data = calloc(initial_array.capacity, size);
if (!arr->data) {
free(arr);
return NULL;
}
arr->capacity = initial_array.capacity;
arr->len = initial_array.len;
arr->size = size;
return arr;
}
int
dynarr_pop(struct dynarr *arr)
{
if (arr->len == 0)
return 0;
arr->len--;
void *obj = dynarr_get(arr, arr->len);
memset(obj, 0, arr->size);
return 1;
}
int
dynarr_push(struct dynarr *arr, const void *obj)
{
const size_t idx = arr->len;
if (!CAPACITY_OK(arr, idx) && !expand(arr))
return 0;
dynarr_set(arr, idx, obj);
arr->len++;
return 1;
}
void
dynarr_remove(struct dynarr *arr, size_t idx)
{
static const ssize_t direction = -1;
assert(LENGTH_OK(arr, idx));
assert(CAPACITY_OK(arr, idx));
move(arr, idx + 1, direction);
void *obj = dynarr_get(arr, arr->len);
memset(obj, 0, arr->size);
}
void
dynarr_set(struct dynarr *arr, size_t idx, const void *obj)
{
assert(CAPACITY_OK(arr, idx));
void *dest = dynarr_get(arr, idx);
memcpy(dest, obj, arr->size);
}