2 Bacula(R) - The Network Backup Solution
4 Copyright (C) 2000-2016 Kern Sibbald
6 The original author of Bacula is Kern Sibbald, with contributions
7 from many others, a complete list can be found in the file AUTHORS.
9 You may use this file and others of this release according to the
10 license defined in the LICENSE file, which includes the Affero General
11 Public License, v3.0 ("AGPLv3") and some additional permissions and
12 terms pursuant to its AGPLv3 Section 7.
14 This notice must be preserved when any source code is
15 conveyed and/or propagated.
17 Bacula(R) is a registered trademark of Kern Sibbald.
20 * Bacula memory pool routines.
22 * The idea behind these routines is that there will be
23 * pools of memory that are pre-allocated for quick
24 * access. The pools will have a fixed memory size on allocation
25 * but if need be, the size can be increased. This is
26 * particularly useful for filename
27 * buffers where 256 bytes should be sufficient in 99.99%
28 * of the cases, but when it isn't we want to be able to
31 * A major advantage of the pool memory aside from the speed
32 * is that the buffer carrys around its size, so to ensure that
33 * there is enough memory, simply call the check_pool_memory_size()
34 * with the desired size and it will adjust only if necessary.
41 #define dbglvl DT_MEMORY|800
43 #ifdef HAVE_MALLOC_TRIM
44 extern "C" int malloc_trim (size_t pad);
48 int32_t size; /* default size */
49 int32_t max_allocated; /* max allocated */
50 int32_t max_used; /* max buffers used */
51 int32_t in_use; /* number in use */
52 struct abufhead *free_buf; /* pointer to free buffers */
55 /* Bacula Name length plus extra */
56 #define NLEN (MAX_NAME_LENGTH+2)
58 /* #define STRESS_TEST_POOL */
59 #ifndef STRESS_TEST_POOL
61 * Define default Pool buffer sizes
63 static struct s_pool_ctl pool_ctl[] = {
64 { 256, 256, 0, 0, NULL }, /* PM_NOPOOL no pooling */
65 { NLEN, NLEN,0, 0, NULL }, /* PM_NAME Bacula name */
66 { 256, 256, 0, 0, NULL }, /* PM_FNAME filename buffers */
67 { 512, 512, 0, 0, NULL }, /* PM_MESSAGE message buffer */
68 { 1024, 1024, 0, 0, NULL }, /* PM_EMSG error message buffer */
69 { 4096, 4096, 0, 0, NULL } /* PM_BSOCK message buffer */
73 /* This is used ONLY when stress testing the code */
74 static struct s_pool_ctl pool_ctl[] = {
75 { 20, 20, 0, 0, NULL }, /* PM_NOPOOL no pooling */
76 { NLEN, NLEN,0, 0, NULL }, /* PM_NAME Bacula name */
77 { 20, 20, 0, 0, NULL }, /* PM_FNAME filename buffers */
78 { 20, 20, 0, 0, NULL }, /* PM_MESSAGE message buffer */
79 { 20, 20, 0, 0, NULL }, /* PM_EMSG error message buffer */
80 { 20, 20, 0, 0, NULL } /* PM_BSOCK message buffer */
85 /* Memory allocation control structures and storage. */
87 int32_t ablen; /* Buffer length in bytes */
88 int32_t pool; /* pool */
89 struct abufhead *next; /* pointer to next free buffer */
90 int32_t bnet_size; /* dummy for bnet_send() */
91 int32_t bnet_extension; /* dummy for bnet extension */
94 static pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
96 #define HEAD_SIZE BALIGN(sizeof(struct abufhead))
100 POOLMEM *sm_get_pool_memory(const char *fname, int lineno, int pool)
102 struct abufhead *buf;
105 Emsg2(M_ABORT, 0, _("MemPool index %d larger than max %d\n"), pool, PM_MAX);
108 if (pool_ctl[pool].free_buf) {
109 buf = pool_ctl[pool].free_buf;
110 pool_ctl[pool].free_buf = buf->next;
111 pool_ctl[pool].in_use++;
112 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
113 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
116 Dmsg3(dbglvl, "sm_get_pool_memory reuse %p to %s:%d\n", buf, fname, lineno);
117 sm_new_owner(fname, lineno, (char *)buf);
118 return (POOLMEM *)((char *)buf+HEAD_SIZE);
121 if ((buf = (struct abufhead *)sm_malloc(fname, lineno, pool_ctl[pool].size+HEAD_SIZE)) == NULL) {
123 Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), pool_ctl[pool].size);
125 buf->ablen = pool_ctl[pool].size;
127 pool_ctl[pool].in_use++;
128 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
129 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
132 Dmsg3(dbglvl, "sm_get_pool_memory give %p to %s:%d\n", buf, fname, lineno);
133 return (POOLMEM *)((char *)buf+HEAD_SIZE);
136 /* Get nonpool memory of size requested */
137 POOLMEM *sm_get_memory(const char *fname, int lineno, int32_t size)
139 struct abufhead *buf;
142 if ((buf = (struct abufhead *)sm_malloc(fname, lineno, size+HEAD_SIZE)) == NULL) {
143 Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
148 pool_ctl[pool].in_use++;
149 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used)
150 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
151 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
154 /* Return the size of a memory buffer */
155 int32_t sm_sizeof_pool_memory(const char *fname, int lineno, POOLMEM *obuf)
157 char *cp = (char *)obuf;
160 Emsg0(M_ABORT, 0, _("obuf is NULL\n"));
163 return ((struct abufhead *)cp)->ablen;
166 /* Realloc pool memory buffer */
167 POOLMEM *sm_realloc_pool_memory(const char *fname, int lineno, POOLMEM *obuf, int32_t size)
169 char *cp = (char *)obuf;
176 buf = sm_realloc(fname, lineno, cp, size+HEAD_SIZE);
179 Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
181 ((struct abufhead *)buf)->ablen = size;
182 pool = ((struct abufhead *)buf)->pool;
183 if (size > pool_ctl[pool].max_allocated) {
184 pool_ctl[pool].max_allocated = size;
187 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
190 POOLMEM *sm_check_pool_memory_size(const char *fname, int lineno, POOLMEM *obuf, int32_t size)
193 if (size <= sizeof_pool_memory(obuf)) {
196 return realloc_pool_memory(obuf, size);
199 /* Free a memory buffer */
200 void sm_free_pool_memory(const char *fname, int lineno, POOLMEM *obuf)
202 struct abufhead *buf;
207 buf = (struct abufhead *)((char *)obuf - HEAD_SIZE);
209 pool_ctl[pool].in_use--;
211 free((char *)buf); /* free nonpooled memory */
212 } else { /* otherwise link it to the free pool chain */
214 /* Disabled because it hangs in #5507 */
216 struct abufhead *next;
217 /* Don't let him free the same buffer twice */
218 for (next=pool_ctl[pool].free_buf; next; next=next->next) {
220 Dmsg4(dbglvl, "free_pool_memory %p pool=%d from %s:%d\n", buf, pool, fname, lineno);
221 Dmsg4(dbglvl, "bad free_pool_memory %p pool=%d from %s:%d\n", buf, pool, fname, lineno);
222 V(mutex); /* unblock the pool */
223 ASSERT(next != buf); /* attempt to free twice */
227 buf->next = pool_ctl[pool].free_buf;
228 pool_ctl[pool].free_buf = buf;
230 Dmsg4(dbglvl, "free_pool_memory %p pool=%d from %s:%d\n", buf, pool, fname, lineno);
236 /* ========= NO SMARTALLOC ========================================= */
238 POOLMEM *get_pool_memory(int pool)
240 struct abufhead *buf;
243 if (pool_ctl[pool].free_buf) {
244 buf = pool_ctl[pool].free_buf;
245 pool_ctl[pool].free_buf = buf->next;
247 return (POOLMEM *)((char *)buf+HEAD_SIZE);
250 if ((buf=(struct abufhead*)malloc(pool_ctl[pool].size+HEAD_SIZE)) == NULL) {
252 Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), pool_ctl[pool].size);
254 buf->ablen = pool_ctl[pool].size;
257 pool_ctl[pool].in_use++;
258 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
259 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
262 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
265 /* Get nonpool memory of size requested */
266 POOLMEM *get_memory(int32_t size)
268 struct abufhead *buf;
271 if ((buf=(struct abufhead *)malloc(size+HEAD_SIZE)) == NULL) {
272 Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
277 pool_ctl[pool].in_use++;
278 if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
279 pool_ctl[pool].max_used = pool_ctl[pool].in_use;
281 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
284 /* Return the size of a memory buffer */
285 int32_t sizeof_pool_memory(POOLMEM *obuf)
287 char *cp = (char *)obuf;
291 return ((struct abufhead *)cp)->ablen;
294 /* Realloc pool memory buffer */
295 POOLMEM *realloc_pool_memory(POOLMEM *obuf, int32_t size)
297 char *cp = (char *)obuf;
304 buf = realloc(cp, size+HEAD_SIZE);
307 Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
309 ((struct abufhead *)buf)->ablen = size;
310 pool = ((struct abufhead *)buf)->pool;
311 if (size > pool_ctl[pool].max_allocated) {
312 pool_ctl[pool].max_allocated = size;
315 return (POOLMEM *)(((char *)buf)+HEAD_SIZE);
318 POOLMEM *check_pool_memory_size(POOLMEM *obuf, int32_t size)
321 if (size <= sizeof_pool_memory(obuf)) {
324 return realloc_pool_memory(obuf, size);
327 /* Free a memory buffer */
328 void free_pool_memory(POOLMEM *obuf)
330 struct abufhead *buf;
335 buf = (struct abufhead *)((char *)obuf - HEAD_SIZE);
337 pool_ctl[pool].in_use--;
339 free((char *)buf); /* free nonpooled memory */
340 } else { /* otherwise link it to the free pool chain */
342 struct abufhead *next;
343 /* Don't let him free the same buffer twice */
344 for (next=pool_ctl[pool].free_buf; next; next=next->next) {
347 ASSERT(next != buf); /* attempt to free twice */
351 buf->next = pool_ctl[pool].free_buf;
352 pool_ctl[pool].free_buf = buf;
354 Dmsg2(dbglvl, "free_pool_memory %p pool=%d\n", buf, pool);
357 #endif /* SMARTALLOC */
360 * Clean up memory pool periodically
363 static time_t last_garbage_collection = 0;
364 const int garbage_interval = 24 * 60 * 60; /* garbage collect every 24 hours */
366 void garbage_collect_memory_pool()
370 Dmsg0(200, "garbage collect memory pool\n");
372 if (last_garbage_collection == 0) {
373 last_garbage_collection = time(NULL);
378 if (now >= last_garbage_collection + garbage_interval) {
379 last_garbage_collection = now;
381 garbage_collect_memory();
387 /* Release all freed pooled memory */
388 void close_memory_pool()
390 struct abufhead *buf, *next;
395 sm_check(__FILE__, __LINE__, false);
397 for (int i=1; i<=PM_MAX; i++) {
398 buf = pool_ctl[i].free_buf;
402 bytes += sizeof_pool_memory((char *)buf);
406 pool_ctl[i].free_buf = NULL;
408 Dmsg2(DT_MEMORY|001, "Freed mem_pool count=%d size=%s\n", count, edit_uint64_with_commas(bytes, ed1));
409 if (chk_dbglvl(DT_MEMORY|1)) {
410 print_memory_pool_stats();
417 * Garbage collect and trim memory if possible
418 * This should be called after all big memory usages
421 void garbage_collect_memory()
423 close_memory_pool(); /* release free chain */
424 #ifdef HAVE_MALLOC_TRIM
432 static const char *pool_name(int pool)
434 static const char *name[] = {"NoPool", "NAME ", "FNAME ", "MSG ", "EMSG ", "BSOCK "};
437 if (pool >= 0 && pool <= PM_MAX) {
440 sprintf(buf, "%-6d", pool);
444 /* Print staticstics on memory pool usage
446 void print_memory_pool_stats()
448 Pmsg0(-1, "Pool Maxsize Maxused Inuse\n");
449 for (int i=0; i<=PM_MAX; i++)
450 Pmsg4(-1, "%5s %7d %7d %5d\n", pool_name(i), pool_ctl[i].max_allocated,
451 pool_ctl[i].max_used, pool_ctl[i].in_use);
457 void print_memory_pool_stats() {}
461 * Concatenate a string (str) onto a pool memory buffer pm
462 * Returns: length of concatenated string
464 int pm_strcat(POOLMEM **pm, const char *str)
466 int pmlen = strlen(*pm);
471 len = strlen(str) + 1;
472 *pm = check_pool_memory_size(*pm, pmlen + len);
473 memcpy(*pm+pmlen, str, len);
474 return pmlen + len - 1;
477 int pm_strcat(POOLMEM *&pm, const char *str)
479 int pmlen = strlen(pm);
484 len = strlen(str) + 1;
485 pm = check_pool_memory_size(pm, pmlen + len);
486 memcpy(pm+pmlen, str, len);
487 return pmlen + len - 1;
490 int pm_strcat(POOLMEM *&pm, POOL_MEM &str)
492 int pmlen = strlen(pm);
493 int len = strlen(str.c_str()) + 1;
495 pm = check_pool_memory_size(pm, pmlen + len);
496 memcpy(pm+pmlen, str.c_str(), len);
497 return pmlen + len - 1;
500 int pm_strcat(POOL_MEM &pm, const char *str)
502 int pmlen = strlen(pm.c_str());
507 len = strlen(str) + 1;
508 pm.check_size(pmlen + len);
509 memcpy(pm.c_str()+pmlen, str, len);
510 return pmlen + len - 1;
514 * Copy a string (str) into a pool memory buffer pm
515 * Returns: length of string copied
517 int pm_strcpy(POOLMEM **pm, const char *str)
523 len = strlen(str) + 1;
524 *pm = check_pool_memory_size(*pm, len);
525 memcpy(*pm, str, len);
529 int pm_strcpy(POOLMEM *&pm, const char *str)
535 len = strlen(str) + 1;
536 pm = check_pool_memory_size(pm, len);
537 memcpy(pm, str, len);
541 int pm_strcpy(POOLMEM *&pm, POOL_MEM &str)
543 int len = strlen(str.c_str()) + 1;
545 pm = check_pool_memory_size(pm, len);
546 memcpy(pm, str.c_str(), len);
550 int pm_strcpy(POOL_MEM &pm, const char *str)
556 len = strlen(str) + 1;
558 memcpy(pm.c_str(), str, len);
563 * Copy data into a pool memory buffer pm
564 * Returns: length of data copied
566 int pm_memcpy(POOLMEM **pm, const char *data, int32_t n)
568 *pm = check_pool_memory_size(*pm, n);
569 memcpy(*pm, data, n);
573 int pm_memcpy(POOLMEM *&pm, const char *data, int32_t n)
575 pm = check_pool_memory_size(pm, n);
580 int pm_memcpy(POOLMEM *&pm, POOL_MEM &data, int32_t n)
582 pm = check_pool_memory_size(pm, n);
583 memcpy(pm, data.c_str(), n);
587 int pm_memcpy(POOL_MEM &pm, const char *data, int32_t n)
590 memcpy(pm.c_str(), data, n);
594 /* ============== CLASS POOL_MEM ============== */
596 /* Return the size of a memory buffer */
597 int32_t POOL_MEM::max_size()
602 size = ((struct abufhead *)cp)->ablen;
603 Dmsg1(900, "max_size=%d\n", size);
607 void POOL_MEM::realloc_pm(int32_t size)
615 buf = (char *)realloc(cp, size+HEAD_SIZE);
618 Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
620 Dmsg2(900, "Old buf=%p new buf=%p\n", cp, buf);
621 ((struct abufhead *)buf)->ablen = size;
622 pool = ((struct abufhead *)buf)->pool;
623 if (size > pool_ctl[pool].max_allocated) {
624 pool_ctl[pool].max_allocated = size;
628 Dmsg3(900, "Old buf=%p new buf=%p mem=%p\n", cp, buf, mem);
631 int POOL_MEM::strcat(const char *str)
633 int pmlen = strlen(mem);
638 len = strlen(str) + 1;
639 check_size(pmlen + len);
640 memcpy(mem+pmlen, str, len);
641 return pmlen + len - 1;
644 int POOL_MEM::strcpy(const char *str)
650 len = strlen(str) + 1;
652 memcpy(mem, str, len);