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
|
/*
* Copyright 2010-2012 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Colm.
*
* Colm is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Colm is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Colm; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <string.h>
#include <stdlib.h>
#include <colm/pdarun.h>
#include <colm/pool.h>
#include <colm/debug.h>
void init_pool_alloc( struct pool_alloc *pool_alloc, int sizeofT )
{
pool_alloc->head = 0;
pool_alloc->nextel = FRESH_BLOCK;
pool_alloc->pool = 0;
pool_alloc->sizeofT = sizeofT;
}
static void *pool_alloc_allocate( struct pool_alloc *pool_alloc )
{
//debug( REALM_POOL, "pool allocation\n" );
#ifdef POOL_MALLOC
void *res = malloc( pool_alloc->sizeofT );
memset( res, 0, pool_alloc->sizeofT );
return res;
#else
void *new_el = 0;
if ( pool_alloc->pool == 0 ) {
if ( pool_alloc->nextel == FRESH_BLOCK ) {
struct pool_block *new_block = (struct pool_block*)malloc( sizeof(struct pool_block) );
new_block->data = malloc( pool_alloc->sizeofT * FRESH_BLOCK );
new_block->next = pool_alloc->head;
pool_alloc->head = new_block;
pool_alloc->nextel = 0;
}
new_el = (char*)pool_alloc->head->data + pool_alloc->sizeofT * pool_alloc->nextel++;
}
else {
new_el = pool_alloc->pool;
pool_alloc->pool = pool_alloc->pool->next;
}
memset( new_el, 0, pool_alloc->sizeofT );
return new_el;
#endif
}
void pool_alloc_free( struct pool_alloc *pool_alloc, void *el )
{
#if 0
/* Some sanity checking. Best not to normally run with this on. */
char *p = (char*)el + sizeof(struct pool_item*);
char *pe = (char*)el + sizeof(T);
for ( ; p < pe; p++ )
assert( *p != 0xcc );
memset( el, 0xcc, sizeof(T) );
#endif
#ifdef POOL_MALLOC
free( el );
#else
struct pool_item *pi = (struct pool_item*) el;
pi->next = pool_alloc->pool;
pool_alloc->pool = pi;
#endif
}
void pool_alloc_clear( struct pool_alloc *pool_alloc )
{
struct pool_block *block = pool_alloc->head;
while ( block != 0 ) {
struct pool_block *next = block->next;
free( block->data );
free( block );
block = next;
}
pool_alloc->head = 0;
pool_alloc->nextel = 0;
pool_alloc->pool = 0;
}
long pool_alloc_num_lost( struct pool_alloc *pool_alloc )
{
/* Count the number of items allocated. */
long lost = 0;
struct pool_block *block = pool_alloc->head;
if ( block != 0 ) {
lost = pool_alloc->nextel;
block = block->next;
while ( block != 0 ) {
lost += FRESH_BLOCK;
block = block->next;
}
}
/* Subtract. Items that are on the free list. */
struct pool_item *pi = pool_alloc->pool;
while ( pi != 0 ) {
lost -= 1;
pi = pi->next;
}
return lost;
}
/*
* kid_t
*/
kid_t *kid_allocate( program_t *prg )
{
return (kid_t*) pool_alloc_allocate( &prg->kid_pool );
}
void kid_free( program_t *prg, kid_t *el )
{
pool_alloc_free( &prg->kid_pool, el );
}
void kid_clear( program_t *prg )
{
pool_alloc_clear( &prg->kid_pool );
}
long kid_num_lost( program_t *prg )
{
return pool_alloc_num_lost( &prg->kid_pool );
}
/*
* tree_t
*/
tree_t *tree_allocate( program_t *prg )
{
return (tree_t*) pool_alloc_allocate( &prg->tree_pool );
}
void tree_free( program_t *prg, tree_t *el )
{
pool_alloc_free( &prg->tree_pool, el );
}
void tree_clear( program_t *prg )
{
pool_alloc_clear( &prg->tree_pool );
}
long tree_num_lost( program_t *prg )
{
return pool_alloc_num_lost( &prg->tree_pool );
}
/*
* parse_tree_t
*/
parse_tree_t *parse_tree_allocate( struct pda_run *pda_run )
{
return (parse_tree_t*) pool_alloc_allocate( pda_run->parse_tree_pool );
}
void parse_tree_free( struct pda_run *pda_run, parse_tree_t *el )
{
pool_alloc_free( pda_run->parse_tree_pool, el );
}
void parse_tree_clear( struct pool_alloc *pool_alloc )
{
pool_alloc_clear( pool_alloc );
}
long parse_tree_num_lost( struct pool_alloc *pool_alloc )
{
return pool_alloc_num_lost( pool_alloc );
}
/*
* head_t
*/
head_t *head_allocate( program_t *prg )
{
return (head_t*) pool_alloc_allocate( &prg->head_pool );
}
void head_free( program_t *prg, head_t *el )
{
pool_alloc_free( &prg->head_pool, el );
}
void head_clear( program_t *prg )
{
pool_alloc_clear( &prg->head_pool );
}
long head_num_lost( program_t *prg )
{
return pool_alloc_num_lost( &prg->head_pool );
}
/*
* location_t
*/
location_t *location_allocate( program_t *prg )
{
return (location_t*) pool_alloc_allocate( &prg->location_pool );
}
void location_free( program_t *prg, location_t *el )
{
pool_alloc_free( &prg->location_pool, el );
}
void location_clear( program_t *prg )
{
pool_alloc_clear( &prg->location_pool );
}
long location_num_lost( program_t *prg )
{
return pool_alloc_num_lost( &prg->location_pool );
}
|
