-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalloc.c
243 lines (176 loc) · 5.41 KB
/
alloc.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
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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
#include "alloc.h"
#include "codegen.h"
#include "log.h"
#include "util.h"
#include "vector.h"
#include <stdlib.h>
// TODO: allow larger allocs
#ifdef ALWAYS_MALLOC
#define BLOCK_SIZE (0)
#else
#define BLOCK_SIZE (4096 * 32)
#endif
struct arena;
struct arena_allocator {
struct arena *first;
struct arena *last;
struct vector *large_allocs;
};
// TODO: use this metadata to walk on free
struct alloc_metadata {
struct arena *arena;
// the size NOT including this metadata
size_t size;
};
struct arena {
char *block;
size_t size;
size_t pos;
struct arena *succ;
struct arena *pred;
struct arena_allocator *allocator;
};
#define ALIGNMENT (16)
void arena_allocator_create(struct arena_allocator **allocator) {
struct arena_allocator value = {.first = NULL, .last = NULL, .large_allocs = vector_create(sizeof(void *)) };
struct arena_allocator *p = nonnull_malloc(sizeof(value));
*p = value;
*allocator = p;
}
void arena_allocator_free(struct arena_allocator **allocator) {
while (vector_length((*allocator)->large_allocs)) {
void *alloc = *(void **)vector_pop((*allocator)->large_allocs);
DEBUG_ASSERT(alloc, "expected alloc");
free(alloc);
}
vector_free(&(*allocator)->large_allocs);
struct arena *arena = (*allocator)->first;
while (arena) {
void *p = arena;
free(arena->block);
arena = arena->succ;
free(p);
}
free(*allocator);
*allocator = NULL;
}
bool try_alloc_in_arena(struct arena *arena, size_t size, void **allocation);
struct arena new_arena(struct arena_allocator *allocator, size_t size);
void *arena_alloc_strndup(struct arena_allocator *allocator, const char *str, size_t len) {
len = MIN(len, strlen(str));
char *cp = arena_alloc(allocator, len + 1);
memcpy(cp, str, len * sizeof(*str));
cp[len] = '\0';
return cp;
}
void *arena_alloc_strdup(struct arena_allocator *allocator, const char *str) {
size_t len = strlen(str);
char *cp = arena_alloc(allocator, len + 1);
memcpy(cp, str, len * sizeof(*str));
cp[len] = '\0';
return cp;
}
PRINTF_ARGS(1) char *arena_alloc_snprintf(struct arena_allocator *allocator,
const char *format, ...) {
va_list args, args_copy;
va_start(args, format);
va_copy(args_copy, args);
int len = vsnprintf(NULL, 0, format, args_copy);
va_end(args_copy);
DEBUG_ASSERT(len > 0, "vnsprintf call failed");
char *buf = arena_alloc(allocator, len + 1);
if (!buf) {
va_end(args);
return NULL;
}
vsnprintf(buf, len + 1, format, args);
va_end(args);
return buf;
}
void *arena_realloc(struct arena_allocator *allocator, void *ptr, size_t size) {
if (!ptr) {
return arena_alloc(allocator, size);
}
// TODO: make this actually try to not realloc
struct alloc_metadata *metadata = ((struct alloc_metadata *)ptr) - 1;
void *new = arena_alloc(allocator, size);
memcpy(new, ptr, MIN(size, metadata->size));
return new;
}
void *arena_alloc_init(struct arena_allocator *allocator, size_t size,
void *data) {
void *p = arena_alloc(allocator, size);
memcpy(p, data, size);
return p;
}
void *arena_alloc(struct arena_allocator *allocator, size_t size) {
if (!size) {
return 0;
}
size_t aligned = ROUND_UP(size, ALIGNMENT);
struct arena *arena;
size_t next_arena_size;
if (aligned > BLOCK_SIZE) {
// FIXME: code is old in this file and should be neatened up
size_t adj_size = ROUND_UP(size + sizeof(struct alloc_metadata), ALIGNMENT);
void *alloc = nonnull_malloc(adj_size);
struct alloc_metadata *metadata = (struct alloc_metadata *)alloc;
metadata->arena = NULL;
metadata->size = size;
vector_push_back(allocator->large_allocs, &alloc);
return metadata + 1;
} else {
arena = allocator->last;
next_arena_size = BLOCK_SIZE;
// first try last arena
// FIXME: not _that_ efficient as walks all the allocations
while (arena) {
void *allocation;
if (try_alloc_in_arena(arena, aligned, &allocation)) {
return allocation;
}
arena = arena->pred;
}
}
// need to create a new arena
struct arena **next;
if (allocator->last) {
next = &allocator->last->succ;
} else {
next = &allocator->first;
}
*next = nonnull_malloc(sizeof(*allocator->last->succ));
**next = new_arena(allocator, next_arena_size);
if (allocator->last) {
allocator->last->succ = *next;
}
allocator->last = *next;
void *allocation;
invariant_assert(
try_alloc_in_arena(allocator->last, aligned, &allocation),
"allocating into new arena should be infallible (%zu bytes requested)",
aligned);
return allocation;
}
bool try_alloc_in_arena(struct arena *arena, size_t size, void **allocation) {
size_t adj_size = ROUND_UP(size + sizeof(struct alloc_metadata), ALIGNMENT);
if (arena->size - arena->pos < adj_size) {
return false;
}
*allocation = &arena->block[arena->pos];
struct alloc_metadata *metadata = (struct alloc_metadata *)*allocation;
metadata->arena = arena;
metadata->size = size;
*allocation = metadata + 1;
arena->pos += adj_size;
return true;
}
struct arena new_arena(struct arena_allocator *allocator, size_t size) {
struct arena arena = {.allocator = allocator,
.pred = allocator->last,
.succ = NULL,
.block = nonnull_malloc(size),
.pos = 0,
.size = size};
return arena;
}