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
|
#include <stddef.h>
#include "alloc.h"
#include "list.h"
#ifndef FALSE
#define FALSE 0
#endif
#ifndef TRUE
#define TRUE 1
#endif
struct block_t
{
link_t link;
uint8_t data[1];
};
void
allocator_init (allocator_t *allocator)
{
list_init (&allocator->blocks);
}
void *
allocator_alloc (allocator_t *allocator, size_t size)
{
block_t *block = malloc (sizeof (block_t) - 1 + size);
if (!block)
return NULL;
list_prepend (&allocator->blocks, &block->link);
return &(block->data[1]);
}
#define GET_BLOCK(mem) \
((block_t *)(((uint8_t *)mem) - offsetof (block_t, data)))
void *
allocator_realloc (allocator_t *allocator, void *mem, size_t size)
{
block_t *old_block, *new_block;
if (mem == NULL)
return allocator_alloc (allocator, size);
old_block = GET_BLOCK (mem);
list_unlink (&old_block->link);
new_block = realloc (old_block, sizeof (block_t) - 1 + size);
if (!new_block)
{
list_prepend (&allocator->blocks, &old_block->link);
return NULL;
}
else
{
list_prepend (&allocator->blocks, &new_block->link);
return new_block->data;
}
}
void
allocator_free (allocator_t *allocator, void *mem)
{
block_t *block = GET_BLOCK (mem);
list_unlink (&block->link);
free (block);
}
void
allocator_fini (allocator_t *allocator)
{
while (!list_is_empty (&allocator->blocks))
{
block_t *block = CONTAINER_OF (block_t, link, allocator->blocks.head);
list_unlink (&block->link);
free (block);
}
}
|
