2 * Bacula memory pool routines.
4 * The idea behind these routines is that there will be
5 * pools of memory that are pre-allocated for quick
6 * access. The pools will have a fixed memory size on allocation
7 * but if need be, the size can be increased. This is
8 * particularly useful for filename
9 * buffers where 256 bytes should be sufficient in 99.99%
10 * of the cases, but when it isn't we want to be able to
13 * A major advantage of the pool memory aside from the speed
14 * is that the buffer carrys around its size, so to ensure that
15 * there is enough memory, simply call the check_pool_memory_size()
16 * with the desired size and it will adjust only if necessary.
24 Copyright (C) 2000-2003 Kern Sibbald and John Walker
26 This program is free software; you can redistribute it and/or
27 modify it under the terms of the GNU General Public License as
28 published by the Free Software Foundation; either version 2 of
29 the License, or (at your option) any later version.
31 This program is distributed in the hope that it will be useful,
32 but WITHOUT ANY WARRANTY; without even the implied warranty of
33 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
34 General Public License for more details.
36 You should have received a copy of the GNU General Public
37 License along with this program; if not, write to the Free
38 Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
46 size_t size; /* default size */
47 size_t max_size; /* max allocated */
48 size_t max_used; /* max buffers used */
49 size_t in_use; /* number in use */
50 struct abufhead *free_buf; /* pointer to free buffers */
53 /* #define STRESS_TEST_POOL */
54 #ifndef STRESS_TEST_POOL
56 * Define default Pool buffer sizes
58 static struct s_pool_ctl pool_ctl[] = {
59 { 256, 256, 0, 0, NULL }, /* PM_NOPOOL no pooling */
60 { 256, 256, 0, 0, NULL }, /* PM_FNAME filename buffers */
61 { 512, 512, 0, 0, NULL }, /* PM_MESSAGE message buffer */
62 { 1024, 1024, 0, 0, NULL } /* PM_EMSG error message buffer */
66 /* This is used ONLY when stress testing the code */
67 static struct s_pool_ctl pool_ctl[] = {
68 { 20, 20, 0, 0, NULL }, /* PM_NOPOOL no pooling */
69 { 20, 20, 0, 0, NULL }, /* PM_FNAME filename buffers */
70 { 20, 20, 0, 0, NULL }, /* PM_MESSAGE message buffer */
71 { 20, 20, 0, 0, NULL } /* PM_EMSG error message buffer */
76 /* Memory allocation control structures and storage. */
78 size_t ablen; /* Buffer length in bytes */
79 int32_t pool; /* pool */
80 struct abufhead *next; /* pointer to next free buffer */
83 static pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
88 #define HEAD_SIZE BALIGN(sizeof(struct abufhead))
90 POOLMEM *sm_get_pool_memory(char *fname, int lineno, int pool)
95 Emsg2(M_ABORT, 0, "MemPool index %d larger than max %d\n", pool, PM_MAX);
98 if (pool_ctl[pool].free_buf) {
99 buf = pool_ctl[pool].free_buf;
100 pool_ctl[pool].free_buf = buf->next;
101 pool_ctl[pool].in_use++;
102 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
103 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
106 Dmsg3(150, "sm_get_pool_memory reuse %x to %s:%d\n", buf, fname, lineno);
107 sm_new_owner(fname, lineno, (char *)buf);
108 return (POOLMEM *)((char *)buf+HEAD_SIZE);
111 if ((buf = (struct abufhead *) sm_malloc(fname, lineno, pool_ctl[pool].size+HEAD_SIZE)) == NULL) {
113 Emsg1(M_ABORT, 0, "Out of memory requesting %d bytes\n", pool_ctl[pool].size);
115 buf->ablen = pool_ctl[pool].size;
117 pool_ctl[pool].in_use++;
118 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
119 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
122 Dmsg3(150, "sm_get_pool_memory give %x to %s:%d\n", buf, fname, lineno);
123 return (POOLMEM *)((char *)buf+HEAD_SIZE);
126 /* Get nonpool memory of size requested */
127 POOLMEM *sm_get_memory(char *fname, int lineno, size_t size)
129 struct abufhead *buf;
132 if ((buf = (struct abufhead *) sm_malloc(fname, lineno, size+HEAD_SIZE)) == NULL) {
133 Emsg1(M_ABORT, 0, "Out of memory requesting %d bytes\n", size);
138 pool_ctl[pool].in_use++;
139 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used)
140 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
141 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
145 /* Return the size of a memory buffer */
146 size_t sm_sizeof_pool_memory(char *fname, int lineno, POOLMEM *obuf)
148 char *cp = (char *)obuf;
152 return ((struct abufhead *)cp)->ablen;
155 /* Realloc pool memory buffer */
156 POOLMEM *sm_realloc_pool_memory(char *fname, int lineno, POOLMEM *obuf, size_t size)
158 char *cp = (char *)obuf;
165 buf = sm_realloc(fname, lineno, cp, size+HEAD_SIZE);
168 Emsg1(M_ABORT, 0, "Out of memory requesting %d bytes\n", size);
170 ((struct abufhead *)buf)->ablen = size;
171 pool = ((struct abufhead *)buf)->pool;
172 if (size > pool_ctl[pool].max_size) {
173 pool_ctl[pool].max_size = size;
176 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
179 POOLMEM *sm_check_pool_memory_size(char *fname, int lineno, POOLMEM *obuf, size_t size)
182 if (size <= sizeof_pool_memory(obuf)) {
185 return realloc_pool_memory(obuf, size);
188 /* Free a memory buffer */
189 void sm_free_pool_memory(char *fname, int lineno, POOLMEM *obuf)
191 struct abufhead *buf;
196 buf = (struct abufhead *)((char *)obuf - HEAD_SIZE);
198 pool_ctl[pool].in_use--;
200 free((char *)buf); /* free nonpooled memory */
201 } else { /* otherwise link it to the free pool chain */
203 struct abufhead *next;
204 /* Don't let him free the same buffer twice */
205 for (next=pool_ctl[pool].free_buf; next; next=next->next) {
206 ASSERT(next != buf); /* attempt to free twice */
209 buf->next = pool_ctl[pool].free_buf;
210 pool_ctl[pool].free_buf = buf;
212 Dmsg2(150, "free_pool_memory %x pool=%d\n", buf, pool);
219 /* =================================================================== */
221 POOLMEM *get_pool_memory(int pool)
223 struct abufhead *buf;
226 if (pool_ctl[pool].free_buf) {
227 buf = pool_ctl[pool].free_buf;
228 pool_ctl[pool].free_buf = buf->next;
230 return (POOLMEM *)((char *)buf+HEAD_SIZE);
233 if ((buf=malloc(pool_ctl[pool].size+HEAD_SIZE)) == NULL) {
235 Emsg1(M_ABORT, 0, "Out of memory requesting %d bytes\n", pool_ctl[pool].size);
237 buf->ablen = pool_ctl[pool].size;
240 pool_ctl[pool].in_use++;
241 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
242 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
245 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
248 /* Get nonpool memory of size requested */
249 POOLMEM *get_memory(size_t size)
251 struct abufhead *buf;
254 if ((buf=malloc(size+HEAD_SIZE)) == NULL) {
255 Emsg1(M_ABORT, 0, "Out of memory requesting %d bytes\n", size);
260 pool_ctl[pool].in_use++;
261 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
262 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
264 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
268 /* Return the size of a memory buffer */
269 size_t sizeof_pool_memory(POOLMEM *obuf)
271 char *cp = (char *)obuf;
275 return ((struct abufhead *)cp)->ablen;
278 /* Realloc pool memory buffer */
279 POOLMEM *realloc_pool_memory(POOLMEM *obuf, size_t size)
281 char *cp = (char *)obuf;
288 buf = realloc(cp, size+HEAD_SIZE);
291 Emsg1(M_ABORT, 0, "Out of memory requesting %d bytes\n", size);
293 ((struct abufhead *)buf)->ablen = size;
294 pool = ((struct abufhead *)buf)->pool;
295 if (size > pool_ctl[pool].max_size) {
296 pool_ctl[pool].max_size = size;
299 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
302 POOLMEM *check_pool_memory_size(POOLMEM *obuf, size_t size)
305 if (size <= sizeof_pool_memory(obuf)) {
308 return realloc_pool_memory(obuf, size);
311 /* Free a memory buffer */
312 void free_pool_memory(POOLMEM *obuf)
314 struct abufhead *buf;
319 buf = (struct abufhead *)((char *)obuf - HEAD_SIZE);
321 pool_ctl[pool].in_use--;
323 free((char *)buf); /* free nonpooled memory */
324 } else { /* otherwise link it to the free pool chain */
326 struct abufhead *next;
327 /* Don't let him free the same buffer twice */
328 for (next=pool_ctl[pool].free_buf; next; next=next->next) {
329 ASSERT(next != buf); /* attempt to free twice */
332 buf->next = pool_ctl[pool].free_buf;
333 pool_ctl[pool].free_buf = buf;
335 Dmsg2(150, "free_pool_memory %x pool=%d\n", buf, pool);
339 #endif /* SMARTALLOC */
346 /* Release all pooled memory */
347 void close_memory_pool()
349 struct abufhead *buf, *next;
352 sm_check(__FILE__, __LINE__, False);
354 for (i=1; i<=PM_MAX; i++) {
355 buf = pool_ctl[i].free_buf;
361 pool_ctl[i].free_buf = NULL;
368 static char *pool_name(int pool)
370 static char *name[] = {"NoPool", "FNAME ", "MSG ", "EMSG "};
373 if (pool >= 0 && pool <= PM_MAX) {
376 sprintf(buf, "%-6d", pool);
380 /* Print staticstics on memory pool usage
382 void print_memory_pool_stats()
386 Dmsg0(-1, "Pool Maxsize Maxused Inuse\n");
387 for (i=0; i<=PM_MAX; i++)
388 Dmsg4(-1, "%5s %7d %7d %5d\n", pool_name(i), pool_ctl[i].max_size,
389 pool_ctl[i].max_used, pool_ctl[i].in_use);
395 void print_memory_pool_stats() {}