forked from andoma/movian
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pool.c
283 lines (226 loc) · 5.04 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
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
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
/*
* Pool allocator
* Copyright (C) 2008 Andreas Öman
*
* 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 3 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, see <http:https://www.gnu.org/licenses/>.
*/
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "arch/halloc.h"
#include "arch/threads.h"
#include "queue.h"
#include "showtime.h"
#include "pool.h"
LIST_HEAD(pool_segment_list, pool_segment);
/**
*
*/
typedef struct pool_item_dbg {
const char *file;
intptr_t line;
} pool_item_dbg_t;
/**
*
*/
typedef struct pool_item {
struct pool_item *link;
} pool_item_t;
/**
*
*/
typedef struct pool_segment {
LIST_ENTRY(pool_segment) ps_link;
void *ps_addr;
size_t ps_size;
#ifdef POOL_DEBUG
uint8_t *ps_mark;
#endif
} pool_segment_t;
/**
*
*/
struct pool {
struct pool_segment_list p_segments;
size_t p_item_size;
int p_flags;
hts_mutex_t p_mutex;
pool_item_t *p_item;
int p_num_out;
char *p_name;
};
/**
*
*/
static void
pool_segment_create(pool_t *p)
{
pool_segment_t *ps = malloc(sizeof(pool_segment_t));
size_t i;
pool_item_t *pi, *prev = NULL;
ps->ps_size = 65536;
ps->ps_addr = halloc(ps->ps_size);
for(i = 0; i <= ps->ps_size - p->p_item_size; i += p->p_item_size) {
pi = ps->ps_addr + i;
pi->link = prev;
prev = pi;
}
LIST_INSERT_HEAD(&p->p_segments, ps, ps_link);
p->p_item = pi;
}
#define ROUND_UP(p, round) ((p + round - 1) & ~(round - 1))
/**
*
*/
pool_t *
pool_create(const char *name, size_t item_size, int flags)
{
pool_t *p = calloc(1, sizeof(pool_t));
item_size = ROUND_UP(item_size, 8);
p->p_name = strdup(name);
#ifdef POOL_DEBUG
item_size += sizeof(pool_item_dbg_t);
#endif
p->p_item_size = item_size;
p->p_flags = flags;
if(flags & POOL_REENTRANT)
hts_mutex_init(&p->p_mutex);
return p;
}
/**
*
*/
void
pool_destroy(pool_t *p)
{
pool_segment_t *ps;
#ifdef POOL_DEBUG
if(1) {
pool_item_t *pi;
LIST_FOREACH(ps, &p->p_segments, ps_link) {
ps->ps_mark = malloc(ps->ps_size / p->p_item_size);
memset(ps->ps_mark, 0xff, ps->ps_size / p->p_item_size);
}
for(pi = p->p_item; pi != NULL; pi = pi->link) {
LIST_FOREACH(ps, &p->p_segments, ps_link) {
if((intptr_t)pi >= (intptr_t)ps->ps_addr &&
(intptr_t)pi < (intptr_t)ps->ps_addr + ps->ps_size) {
size_t off = ((void *)pi - ps->ps_addr) / p->p_item_size;
ps->ps_mark[off] = 0;
}
}
}
LIST_FOREACH(ps, &p->p_segments, ps_link) {
int items = ps->ps_size / p->p_item_size;
int i;
for(i = 0; i < items; i++) {
if(ps->ps_mark[i]) {
#ifdef POOL_DEBUG
pool_item_dbg_t *pid = ps->ps_addr + i * p->p_item_size;
printf("Leak at %p (%s:%d)\n",
pid, pid->file, (int)pid->line);
#else
printf("Leak at %p\n",
ps->ps_addr + i * p->p_item_size);
#endif
}
}
}
}
#endif
while((ps = LIST_FIRST(&p->p_segments)) != NULL) {
hfree(ps->ps_addr, ps->ps_size);
LIST_REMOVE(ps, ps_link);
#ifdef POOL_DEBUG
free(ps->ps_mark);
#endif
free(ps);
}
if(p->p_num_out)
TRACE(TRACE_INFO, "pool", "Destroying pool '%s', %d items out",
p->p_name, p->p_num_out);
if(p->p_flags & POOL_REENTRANT)
hts_mutex_destroy(&p->p_mutex);
free(p->p_name);
free(p);
}
/**
*
*/
void *
#ifdef POOL_DEBUG
pool_get_ex(pool_t *p, const char *file, int line)
#else
pool_get(pool_t *p)
#endif
{
if(p->p_flags & POOL_REENTRANT)
hts_mutex_lock(&p->p_mutex);
pool_item_t *pi = p->p_item;
if(pi == NULL) {
pool_segment_create(p);
pi = p->p_item;
}
p->p_item = pi->link;
p->p_num_out++;
if(p->p_flags & POOL_REENTRANT)
hts_mutex_unlock(&p->p_mutex);
if(p->p_flags & POOL_ZERO_MEM)
memset(pi, 0, p->p_item_size);
#ifdef POOL_DEBUG
pool_item_dbg_t *pid = (void *)pi;
pid->file = file;
pid->line = line;
return (void *)pi + sizeof(pool_item_dbg_t);
#else
return pi;
#endif
}
/**
*
*/
void
pool_put(pool_t *p, void *ptr)
{
#ifdef POOL_DEBUG
pool_item_t *pi = ptr - sizeof(pool_item_dbg_t);
#else
pool_item_t *pi = ptr;
#endif
#ifdef POOL_DEBUG
pool_segment_t *ps;
LIST_FOREACH(ps, &p->p_segments, ps_link)
if((intptr_t)pi >= (intptr_t)ps->ps_addr &&
(intptr_t)pi < (intptr_t)ps->ps_addr + ps->ps_size)
break;
assert(ps != NULL);
memset(pi, 0xff, p->p_item_size);
#endif
if(p->p_flags & POOL_REENTRANT)
hts_mutex_lock(&p->p_mutex);
pi->link = p->p_item;
p->p_item = pi;
p->p_num_out--;
if(p->p_flags & POOL_REENTRANT)
hts_mutex_unlock(&p->p_mutex);
}
/**
*
*/
int
pool_num(pool_t *p)
{
return p->p_num_out;
}