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
|
/*
** pool.c - memory pool
**
** See Copyright Notice in mruby.h
*/
#include "pool.h"
#include <string.h>
#undef TEST_POOL
#ifdef TEST_POOL
#include <stdio.h>
#define mrb_malloc(m,s) malloc(s)
#define mrb_free(m,p) free(p)
#endif
#define POOL_PAGE_SIZE 16000
mrb_pool*
mrb_pool_open(mrb_state *mrb)
{
mrb_pool *pool = mrb_malloc(mrb, sizeof(mrb_pool));
if (pool) {
pool->mrb = mrb;
pool->pages = 0;
}
return pool;
}
void
mrb_pool_close(mrb_pool *pool)
{
struct mrb_pool_page *page, *tmp;
if (!pool) return;
page = pool->pages;
while (page) {
tmp = page;
page = page->next;
mrb_free(pool->mrb, tmp);
}
mrb_free(pool->mrb, pool);
}
static struct mrb_pool_page*
page_alloc(mrb_pool *pool, size_t len)
{
struct mrb_pool_page *page;
if (len < POOL_PAGE_SIZE)
len = POOL_PAGE_SIZE;
page = mrb_malloc(pool->mrb, sizeof(struct mrb_pool_page)+len-1);
if (page) {
page->offset = 0;
page->len = len;
}
return page;
}
void*
mrb_pool_alloc(mrb_pool *pool, size_t len)
{
struct mrb_pool_page *page;
size_t n;
if (!pool) return 0;
page = pool->pages;
while (page) {
if (page->offset + len <= page->len) {
n = page->offset;
page->offset += len;
page->last = (char*)page->page+n;
return page->last;
}
page = page->next;
}
page = page_alloc(pool, len);
if (!page) return 0;
page->offset = len;
page->next = pool->pages;
pool->pages = page;
page->last = (void*)page->page;
return page->last;
}
int
mrb_pool_can_realloc(mrb_pool *pool, void *p, size_t len)
{
struct mrb_pool_page *page;
if (!pool) return 0;
page = pool->pages;
while (page) {
if (page->last == p) {
size_t beg;
beg = (char*)p - page->page;
if (beg + len > page->len) return 0;
return 1;
}
page = page->next;
}
return 0;
}
void*
mrb_pool_realloc(mrb_pool *pool, void *p, size_t oldlen, size_t newlen)
{
struct mrb_pool_page *page;
void *np;
if (!pool) return 0;
page = pool->pages;
while (page) {
if (page->last == p) {
size_t beg;
beg = (char*)p - page->page;
if (beg + oldlen != page->offset) break;
if (beg + newlen > page->len) {
page->offset = beg;
break;
}
page->offset = beg + newlen;
return p;
}
page = page->next;
}
np = mrb_pool_alloc(pool, newlen);
memcpy(np, p, oldlen);
return np;
}
#ifdef TEST_POOL
int
main()
{
int i, len = 250;
mrb_pool *pool;
void *p;
pool = mrb_pool_open(0);
p = mrb_pool_alloc(pool, len);
for (i=1; i<20; i++) {
printf("%p (len=%d) %d\n", p, len, mrb_pool_can_realloc(pool, p, len*2));
p = mrb_pool_realloc(pool, p, len, len*2);
len *= 2;
}
mrb_pool_close(pool);
return 0;
}
#endif
|
