-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpool.c
81 lines (73 loc) · 1.42 KB
/
pool.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
#include <stddef.h>
#include <stdlib.h>
#include <stdio.h>
#include "pool.h"
pool pool_alloc(size_t cap, POOL_TAG t){
void* mem = malloc(cap);
if (mem == NULL || t == NO_POOL){
return (pool){.tag=NO_POOL};
}
return (pool){
.tag = t,
.buffer = mem,
.ptr = mem,
.left = cap,
.next = NULL
};
}
void pool_empty(pool* const p){
p->left += p->ptr - p->buffer;
p->ptr = p->buffer;
if (p->next != NULL){
pool_empty(p->next);
}
}
void pool_dealloc(pool* const p){
free(p->buffer);
if (p->next != NULL){
pool_dealloc(p->next);
}
free(p->next);
}
void* pool_request(pool* const p, size_t bytes){
if (p->left < bytes){
size_t capacity = p->left + (p->ptr-p->buffer);
if (p->tag == POOL_STATIC || bytes > capacity){
return NULL;
}
if (p->next == NULL){
p->next = malloc(sizeof(pool));
*p->next = pool_alloc(p->left + (p->ptr-p->buffer), POOL_DYNAMIC);
}
return pool_request(p->next, bytes);
}
p->left -= bytes;
void* addr = p->ptr;
p->ptr += bytes;
return addr;
}
void* pool_byte(pool* const p){
if (p->left <= 0 || p->tag == POOL_DYNAMIC){
return NULL;
}
p->left -= 1;
void* addr = p->ptr;
p->ptr += 1;
return addr;
}
void pool_save(pool* const p){
if (p->next != NULL){
pool_save(p->next);
return;
}
p->ptr_save = p->ptr;
p->left_save = p->left;
}
void pool_load(pool* const p){
if (p->next != NULL){
pool_load(p);
return;
}
p->ptr = p->ptr_save;
p->left = p->left_save;
}