-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqalloc.c
More file actions
343 lines (289 loc) · 8.64 KB
/
qalloc.c
File metadata and controls
343 lines (289 loc) · 8.64 KB
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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
#include <unistd.h>
#include <sys/mman.h>
#include <stdint.h>
#include <string.h>
#include <stdbool.h>
#include <errno.h>
#include <stddef.h>
#include <stdlib.h>
#include <pthread.h>
#include <stdio.h>
#include <assert.h>
#define INITIAL_SIZE 256 // This is the initial size in pages
#define EXTEND_MIN 16 // This is the minimum sbrk() increment size in pages
#define ALIGNMENT 16 // The byte alignment returned by a call to malloc
typedef struct chunk_t chunk_t;
struct chunk_t {
size_t size;
chunk_t *next;
chunk_t *prev;
bool free;
};
static chunk_t *first_chunk = NULL;
static chunk_t *last_chunk = NULL;
static size_t pagesize;
static pthread_mutex_t mutex;
static void print_chunk(chunk_t *chunk);
static void print_heap();
static void debug_heap();
static chunk_t *extend(size_t);
static chunk_t *best_fit(size_t, size_t);
static void crop(chunk_t *, size_t);
static void *alloc(size_t, size_t);
void *malloc(size_t);
void free(void *);
void *calloc(size_t, size_t);
void *realloc(void *, size_t);
void *reallocarray(void *, size_t, size_t);
size_t malloc_usable_size(void *);
void *aligned_alloc(size_t, size_t);
int posix_memalign(void **, size_t, size_t);
static void print_chunk(chunk_t *chunk) {
fprintf(stderr, "Addr: %p\n", chunk);
fprintf(stderr, "Size: %d\n", chunk->size);
fprintf(stderr, "Next: %p\n", chunk->next);
fprintf(stderr, "Prev: %p\n", chunk->prev);
fprintf(stderr, "Free: %b\n", chunk->free);
if (chunk->next) fprintf(stderr, "Data: %d bytes\n", (size_t)((void *)chunk->next - (void *)chunk) - sizeof(chunk_t));
else fprintf(stderr, "Data: %d bytes\n", (size_t)(sbrk(0) - (void *)chunk) - sizeof(chunk_t));
fprintf(stderr, "\n");
}
static void print_heap() {
for (chunk_t *chunk = first_chunk; chunk != NULL; chunk = chunk->next) print_chunk(chunk);
}
// Walk the chunks and look for discrepancies between size and pointers
static void debug_heap() {
for (chunk_t *chunk = first_chunk; chunk->next != NULL; chunk = chunk->next) {
if ((void *)chunk + chunk->size + sizeof(chunk_t) != (void *)chunk->next) {
fprintf(stderr, "Error, misaligned chunk and chunk->next!\n");
print_chunk(chunk);
print_chunk(chunk->next);
fprintf(stderr, "First chunk: %p\n", first_chunk);
fprintf(stderr, "Last chunk: %p\n", last_chunk);
exit(EXIT_FAILURE);
}
}
for (chunk_t *chunk = last_chunk; chunk != first_chunk; chunk = chunk->prev) {
if ((void *)chunk - chunk->prev->size - sizeof(chunk_t) != (void *)chunk->prev) {
fprintf(stderr, "Error, misaligned chunk and chunk->prev!\n");
print_chunk(chunk);
print_chunk(chunk->prev);
fprintf(stderr, "First chunk: %p\n", first_chunk);
fprintf(stderr, "Last chunk: %p\n", last_chunk);
exit(EXIT_FAILURE);
}
}
}
static void init() {
pagesize = sysconf(_SC_PAGESIZE);
size_t size;
void *start;
void *end;
pthread_mutexattr_t attr;
if (pthread_mutexattr_init(&attr) != 0) {
perror("pthread_mutexattr_init");
exit(EXIT_FAILURE);
}
if (pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_NORMAL) != 0) {
perror("pthread_mutexattr_settype");
exit(EXIT_FAILURE);
}
if (pthread_mutex_init(&mutex, &attr));
size = pagesize * INITIAL_SIZE;
if ((start = (sbrk(size))) == (void *)-1) exit(EXIT_FAILURE);
end = start + size;
assert(end == sbrk(0));
first_chunk = (chunk_t *)start;
first_chunk->size = size - 2 * sizeof(chunk_t);
first_chunk->next = (chunk_t *)(end - sizeof(chunk_t));
first_chunk->prev = NULL;
first_chunk->free = 1;
last_chunk = first_chunk->next;
last_chunk->size = 0;
last_chunk->next = NULL;
last_chunk->prev = first_chunk;
last_chunk->free = 0;
}
static chunk_t *extend(size_t size) {
if (size < EXTEND_MIN * pagesize) size = EXTEND_MIN * pagesize;
size_t size_aligned = (size + sizeof(chunk_t) + pagesize - 1) & ~(pagesize - 1); // Align the size
if (sbrk(size_aligned) == (void *)(-1)) return NULL;
last_chunk->size = size_aligned - sizeof(chunk_t);
last_chunk->next = (chunk_t *)((void *)last_chunk + last_chunk->size + sizeof(chunk_t));
last_chunk->free = 1;
last_chunk->next->prev = last_chunk;
last_chunk = last_chunk->next;
last_chunk->size = 0;
last_chunk->next = NULL;
last_chunk->free = 0;
return last_chunk->prev;
}
// Return the smallest fitting chunk
static chunk_t *best_fit(size_t alignment, size_t size) {
chunk_t *best = NULL;
for (chunk_t *chunk = first_chunk; chunk != NULL; chunk = chunk->next) {
if (chunk->size >= size && chunk->free && ((uintptr_t)chunk + sizeof(chunk_t)) % alignment == 0) {
if (!best) best = chunk;
else if (chunk->size < best->size) best = chunk;
}
}
return best;
}
// Crop the chunk to size.
// A new free chunk is created out of the leftover space.
// Passed size should be aligned to ALIGNMENT!
static void crop(chunk_t *chunk, size_t size) {
ptrdiff_t leftover = chunk->size - size - sizeof(chunk_t);
if (leftover >= ALIGNMENT) {
chunk_t *new = (chunk_t *)((void *)chunk + sizeof(chunk_t) + size);
new->size = leftover;
new->next = chunk->next;
new->prev = chunk;
new->free = 1;
chunk->size = size;
chunk->next = new;
new->next->prev = new;
}
}
static void *alloc(size_t alignment, size_t size) {
size = (size + ALIGNMENT - 1) & ~(ALIGNMENT - 1); // Align the size to ALIGNMENT bytes
if (size > PTRDIFF_MAX) return NULL;
pthread_mutex_lock(&mutex);
if (!first_chunk) init();
chunk_t *chunk;
void *addr = NULL;
chunk = best_fit(alignment, size);
if (!chunk) chunk = extend(size);
if (chunk) {
chunk->free = 0;
crop(chunk, size);
addr = (void *)chunk + sizeof(chunk_t);
}
pthread_mutex_unlock(&mutex);
return addr;
}
void *malloc(size_t size) {
void *addr = alloc(ALIGNMENT, size);
#ifdef DEBUG
fprintf(stderr, "malloc(%d)", size);
fprintf(stderr, " = %p\n", addr);
#endif
return addr;
}
void free(void *ptr) {
#ifdef DEBUG
fprintf(stderr, "free(%p)\n", ptr);
#endif
if (!ptr) return;
pthread_mutex_lock(&mutex);
chunk_t *chunk = (chunk_t *)(ptr - sizeof(chunk_t));
chunk->free = 1;
// Coalesce to the left
if (chunk->prev && chunk->prev->free) {
chunk->prev->size += chunk->size + sizeof(chunk_t);
chunk->prev->next = chunk->next;
chunk->next->prev = chunk->prev;
chunk = chunk->prev;
}
// Coalesce to the right
if (chunk->next->free) {
chunk->size += chunk->next->size + sizeof(chunk_t);
chunk->next = chunk->next->next;
chunk->next->prev = chunk;
}
pthread_mutex_unlock(&mutex);
}
void *calloc(size_t nmemb, size_t size) {
#ifdef DEBUG
fprintf(stderr, "calloc(%d, %d)", nmemb, size);
#endif
void *addr;
if (size > SIZE_MAX / nmemb) return NULL;
size *= nmemb;
addr = malloc(size);
if (addr) memset(addr, 0, size);
#ifdef DEBUG
fprintf(stderr, " = %p\n", addr);
#endif
return addr;
}
void *realloc(void *ptr, size_t size) {
#ifdef DEBUG
fprintf(stderr, "realloc(%p, %d)", ptr, size);
#endif
if (!ptr) return malloc(size);
if (!size) {
free(ptr);
return NULL;
}
size = (size + ALIGNMENT - 1) & ~(ALIGNMENT - 1); // Align the size to ALIGNMENT bytes
chunk_t *chunk = (chunk_t *)(ptr - sizeof(chunk_t));
ptrdiff_t delta = size - chunk->size;
if (delta <= 0) {
pthread_mutex_lock(&mutex);
crop(chunk, size);
pthread_mutex_unlock(&mutex);
}
else {
pthread_mutex_lock(&mutex);
if (chunk->next->free && delta <= chunk->next->size + sizeof(chunk_t)) { // The next chunk is open for business
chunk->size += chunk->next->size + sizeof(chunk_t);
chunk->next = chunk->next->next;
chunk->next->prev = chunk;
crop(chunk, size);
pthread_mutex_unlock(&mutex);
}
else {
pthread_mutex_unlock(&mutex);
void *addr = malloc(size);
memcpy(addr, ptr, chunk->size);
free(ptr);
ptr = addr;
}
}
return ptr;
}
void *reallocarray(void *ptr, size_t nmemb, size_t size) {
#ifdef DEBUG
fprintf(stderr, "reallocarray(%p, %d, %d)", ptr, nmemb, size);
#endif
void *addr;
if (size > SIZE_MAX / nmemb) return NULL;
size *= nmemb;
addr = realloc(ptr, size);
#ifdef DEBUG
fprintf(stderr, " = %p\n", addr);
#endif
return addr;
}
size_t malloc_usable_size(void *ptr) {
chunk_t *chunk = (chunk_t *)(ptr - sizeof(chunk_t));
return chunk->size;
}
void *aligned_alloc(size_t alignment, size_t size) {
#ifdef DEBUG
fprintf(stderr, "aligned_alloc(%d, %d)", alignment, size);
#endif
void *addr;
posix_memalign(&addr, alignment, size);
#ifdef DEBUG
fprintf(stderr, " = %p\n", addr);
#endif
return addr;
}
int posix_memalign(void **memptr, size_t alignment, size_t size) {
void *addr;
if (alignment == 0 || (alignment & (alignment - 1)) != 0) {
return EINVAL;
} // Check whethere alignment is a power of 2 or 0
else if (alignment > pagesize) {
fprintf(stderr, "Alignment larger than pagesize is not supported!\n");
exit(EXIT_FAILURE);
}
else {
addr = alloc(alignment, size);
if (errno == ENOMEM) return ENOMEM;
*memptr = addr;
return 0;
}
}