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
|
/*
* pools.c
*
* MathMap
*
* Copyright (C) 2002-2004 Mark Probst
*
* This program 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <string.h>
#include <assert.h>
#include "pools.h"
void
init_pools (pools_t *pools)
{
int i;
pools->active_pool = -1;
pools->fill_ptr = 0;
for (i = 0; i < NUM_POOLS; ++i)
pools->pools[i] = 0;
}
void
reset_pools (pools_t *pools)
{
pools->active_pool = -1;
pools->fill_ptr = 0;
}
void
free_pools (pools_t *pools)
{
int i;
/* printf("alloced %d pools\n", active_pool + 1); */
for (i = 0; i < NUM_POOLS; ++i)
if (pools->pools[i] != 0)
free(pools->pools[i]);
init_pools(pools);
}
void*
pools_alloc (pools_t *pools, size_t size)
{
size_t pool_size;
void *p;
if (pools->active_pool < 0)
{
pools->active_pool = 0;
if (pools->pools[0] == 0)
pools->pools[0] = (long*)malloc(GRANULARITY * FIRST_POOL_SIZE);
pools->fill_ptr = 0;
memset(pools->pools[0], 0, GRANULARITY * FIRST_POOL_SIZE);
}
pool_size = FIRST_POOL_SIZE << pools->active_pool;
size = (size + GRANULARITY - 1) / GRANULARITY;
if (pools->fill_ptr + size >= pool_size)
{
++pools->active_pool;
assert(pools->active_pool < NUM_POOLS);
if (pools->pools[pools->active_pool] == 0)
pools->pools[pools->active_pool] = (long*)malloc(GRANULARITY * (FIRST_POOL_SIZE << pools->active_pool));
pools->fill_ptr = 0;
memset(pools->pools[pools->active_pool], 0, GRANULARITY * (FIRST_POOL_SIZE << pools->active_pool));
}
assert(pools->fill_ptr + size < pool_size);
p = pools->pools[pools->active_pool] + pools->fill_ptr;
pools->fill_ptr += size;
return p;
}
|
