-
Notifications
You must be signed in to change notification settings - Fork 256
/
mem_pool.c
682 lines (583 loc) · 16.9 KB
/
mem_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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
/*
BAREOS® - Backup Archiving REcovery Open Sourced
Copyright (C) 2000-2011 Free Software Foundation Europe e.V.
This program is Free Software; you can redistribute it and/or
modify it under the terms of version three of the GNU Affero General Public
License as published by the Free Software Foundation and included
in the file LICENSE.
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
Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
/*
* BAREOS memory pool routines.
*
* The idea behind these routines is that there will be pools of memory that
* are pre-allocated for quick access. The pools will have a fixed memory size
* on allocation but if need be, the size can be increased. This is particularly
* useful for filename buffers where 256 bytes should be sufficient in 99.99%
* of the cases, but when it isn't we want to be able to increase the size.
*
* A major advantage of the pool memory aside from the speed is that the buffer
* carries around its size, so to ensure that there is enough memory, simply call
* the check_pool_memory_size() with the desired size and it will adjust only
* if necessary.
*
* Kern E. Sibbald
*/
#include "bareos.h"
#ifdef HAVE_MALLOC_TRIM
extern "C" int malloc_trim (size_t pad);
#endif
struct s_pool_ctl {
int32_t size; /* default size */
int32_t max_allocated; /* max allocated */
int32_t max_used; /* max buffers used */
int32_t in_use; /* number in use */
struct abufhead *free_buf; /* pointer to free buffers */
};
/*
* Bareos Name length plus extra
*/
#define NLEN (MAX_NAME_LENGTH + 2)
/*
* Bareos Record length
*/
#define RLEN 128
/* #define STRESS_TEST_POOL */
/*
* Define default Pool buffer sizes
*/
#ifndef STRESS_TEST_POOL
static struct s_pool_ctl pool_ctl[] = {
{ 256, 256, 0, 0, NULL }, /* PM_NOPOOL no pooling */
{ NLEN, NLEN,0, 0, NULL }, /* PM_NAME Bareos name */
{ 256, 256, 0, 0, NULL }, /* PM_FNAME filename buffers */
{ 512, 512, 0, 0, NULL }, /* PM_MESSAGE message buffer */
{ 1024, 1024, 0, 0, NULL }, /* PM_EMSG error message buffer */
{ 4096, 4096, 0, 0, NULL }, /* PM_BSOCK message buffer */
{ RLEN, RLEN, 0, 0, NULL } /* PM_RECORD message buffer */
};
#else
/*
* This is used ONLY when stress testing the code
*/
static struct s_pool_ctl pool_ctl[] = {
{ 20, 20, 0, 0, NULL }, /* PM_NOPOOL no pooling */
{ NLEN, NLEN,0, 0, NULL }, /* PM_NAME Bareos name */
{ 20, 20, 0, 0, NULL }, /* PM_FNAME filename buffers */
{ 20, 20, 0, 0, NULL }, /* PM_MESSAGE message buffer */
{ 20, 20, 0, 0, NULL }, /* PM_EMSG error message buffer */
{ 20, 20, 0, 0, NULL } /* PM_BSOCK message buffer */
{ RLEN, RLEN, 0, 0, NULL } /* PM_RECORD message buffer */
};
#endif
/*
* Memory allocation control structures and storage.
*/
struct abufhead {
int32_t ablen; /* Buffer length in bytes */
int32_t pool; /* pool */
struct abufhead *next; /* pointer to next free buffer */
int32_t bnet_size; /* dummy for bnet_send() */
};
static pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
#ifdef SMARTALLOC
#define HEAD_SIZE BALIGN(sizeof(struct abufhead))
POOLMEM *sm_get_pool_memory(const char *fname, int lineno, int pool)
{
struct abufhead *buf;
if (pool > PM_MAX) {
Emsg2(M_ABORT, 0, _("MemPool index %d larger than max %d\n"), pool, PM_MAX);
return NULL;
}
P(mutex);
if (pool_ctl[pool].free_buf) {
buf = pool_ctl[pool].free_buf;
pool_ctl[pool].free_buf = buf->next;
pool_ctl[pool].in_use++;
if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
pool_ctl[pool].max_used = pool_ctl[pool].in_use;
}
V(mutex);
Dmsg3(1800, "sm_get_pool_memory reuse %p to %s:%d\n", buf, fname, lineno);
sm_new_owner(fname, lineno, (char *)buf);
return (POOLMEM *)((char *)buf + HEAD_SIZE);
}
if ((buf = (struct abufhead *)sm_malloc(fname, lineno, pool_ctl[pool].size + HEAD_SIZE)) == NULL) {
V(mutex);
Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), pool_ctl[pool].size);
return NULL;
}
buf->ablen = pool_ctl[pool].size;
buf->pool = pool;
pool_ctl[pool].in_use++;
if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
pool_ctl[pool].max_used = pool_ctl[pool].in_use;
}
V(mutex);
Dmsg3(1800, "sm_get_pool_memory give %p to %s:%d\n", buf, fname, lineno);
return (POOLMEM *)((char *)buf + HEAD_SIZE);
}
/* Get nonpool memory of size requested */
POOLMEM *sm_get_memory(const char *fname, int lineno, int32_t size)
{
struct abufhead *buf;
int pool = 0;
if ((buf = (struct abufhead *)sm_malloc(fname, lineno, size + HEAD_SIZE)) == NULL) {
Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
return NULL;
}
buf->ablen = size;
buf->pool = pool;
buf->next = NULL;
pool_ctl[pool].in_use++;
if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
pool_ctl[pool].max_used = pool_ctl[pool].in_use;
}
return (POOLMEM *)(((char *)buf) + HEAD_SIZE);
}
/* Return the size of a memory buffer */
int32_t sm_sizeof_pool_memory(const char *fname, int lineno, POOLMEM *obuf)
{
char *cp = (char *)obuf;
if (obuf == NULL) {
Emsg0(M_ABORT, 0, _("obuf is NULL\n"));
return 0;
}
cp -= HEAD_SIZE;
return ((struct abufhead *)cp)->ablen;
}
/* Realloc pool memory buffer */
POOLMEM *sm_realloc_pool_memory(const char *fname, int lineno, POOLMEM *obuf, int32_t size)
{
char *cp = (char *)obuf;
void *buf;
int pool;
ASSERT(obuf);
P(mutex);
cp -= HEAD_SIZE;
buf = sm_realloc(fname, lineno, cp, size + HEAD_SIZE);
if (buf == NULL) {
V(mutex);
Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
return NULL;
}
((struct abufhead *)buf)->ablen = size;
pool = ((struct abufhead *)buf)->pool;
if (size > pool_ctl[pool].max_allocated) {
pool_ctl[pool].max_allocated = size;
}
V(mutex);
return (POOLMEM *)(((char *)buf) + HEAD_SIZE);
}
POOLMEM *sm_check_pool_memory_size(const char *fname, int lineno, POOLMEM *obuf, int32_t size)
{
ASSERT(obuf);
if (size <= sizeof_pool_memory(obuf)) {
return obuf;
}
return realloc_pool_memory(obuf, size);
}
/* Free a memory buffer */
void sm_free_pool_memory(const char *fname, int lineno, POOLMEM *obuf)
{
struct abufhead *buf;
int pool;
ASSERT(obuf);
P(mutex);
buf = (struct abufhead *)((char *)obuf - HEAD_SIZE);
pool = buf->pool;
pool_ctl[pool].in_use--;
if (pool == 0) {
free((char *)buf); /* free nonpooled memory */
} else { /* otherwise link it to the free pool chain */
#ifdef DEBUG
struct abufhead *next;
/* Don't let him free the same buffer twice */
for (next=pool_ctl[pool].free_buf; next; next=next->next) {
if (next == buf) {
Dmsg4(1800, "free_pool_memory %p pool=%d from %s:%d\n", buf, pool, fname, lineno);
Dmsg4(1800, "bad free_pool_memory %p pool=%d from %s:%d\n", buf, pool, fname, lineno);
V(mutex); /* unblock the pool */
ASSERT(next != buf); /* attempt to free twice */
}
}
#endif
buf->next = pool_ctl[pool].free_buf;
pool_ctl[pool].free_buf = buf;
}
Dmsg4(1800, "free_pool_memory %p pool=%d from %s:%d\n", buf, pool, fname, lineno);
V(mutex);
}
#else
/* ========= NO SMARTALLOC ========================================= */
POOLMEM *get_pool_memory(int pool)
{
struct abufhead *buf;
P(mutex);
if (pool_ctl[pool].free_buf) {
buf = pool_ctl[pool].free_buf;
pool_ctl[pool].free_buf = buf->next;
V(mutex);
return (POOLMEM *)((char *)buf + HEAD_SIZE);
}
if ((buf=malloc(pool_ctl[pool].size + HEAD_SIZE)) == NULL) {
V(mutex);
Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), pool_ctl[pool].size);
return NULL;
}
buf->ablen = pool_ctl[pool].size;
buf->pool = pool;
buf->next = NULL;
pool_ctl[pool].in_use++;
if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
pool_ctl[pool].max_used = pool_ctl[pool].in_use;
}
V(mutex);
return (POOLMEM *)(((char *)buf) + HEAD_SIZE);
}
/* Get nonpool memory of size requested */
POOLMEM *get_memory(int32_t size)
{
struct abufhead *buf;
int pool = 0;
if ((buf=malloc(size + HEAD_SIZE)) == NULL) {
Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
return NULL;
}
buf->ablen = size;
buf->pool = pool;
buf->next = NULL;
pool_ctl[pool].in_use++;
if (pool_ctl[pool].in_use > pool_ctl[pool].max_used) {
pool_ctl[pool].max_used = pool_ctl[pool].in_use;
}
return (POOLMEM *)(((char *)buf) + HEAD_SIZE);
}
/* Return the size of a memory buffer */
int32_t sizeof_pool_memory(POOLMEM *obuf)
{
char *cp = (char *)obuf;
ASSERT(obuf);
cp -= HEAD_SIZE;
return ((struct abufhead *)cp)->ablen;
}
/* Realloc pool memory buffer */
POOLMEM *realloc_pool_memory(POOLMEM *obuf, int32_t size)
{
char *cp = (char *)obuf;
void *buf;
int pool;
ASSERT(obuf);
P(mutex);
cp -= HEAD_SIZE;
buf = realloc(cp, size + HEAD_SIZE);
if (buf == NULL) {
V(mutex);
Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
return NULL;
}
((struct abufhead *)buf)->ablen = size;
pool = ((struct abufhead *)buf)->pool;
if (size > pool_ctl[pool].max_allocated) {
pool_ctl[pool].max_allocated = size;
}
V(mutex);
return (POOLMEM *)(((char *)buf) + HEAD_SIZE);
}
POOLMEM *check_pool_memory_size(POOLMEM *obuf, int32_t size)
{
ASSERT(obuf);
if (size <= sizeof_pool_memory(obuf)) {
return obuf;
}
return realloc_pool_memory(obuf, size);
}
/* Free a memory buffer */
void free_pool_memory(POOLMEM *obuf)
{
struct abufhead *buf;
int pool;
ASSERT(obuf);
P(mutex);
buf = (struct abufhead *)((char *)obuf - HEAD_SIZE);
pool = buf->pool;
pool_ctl[pool].in_use--;
if (pool == 0) {
free((char *)buf); /* free nonpooled memory */
} else { /* otherwise link it to the free pool chain */
#ifdef DEBUG
struct abufhead *next;
/* Don't let him free the same buffer twice */
for (next=pool_ctl[pool].free_buf; next; next=next->next) {
if (next == buf) {
V(mutex);
ASSERT(next != buf); /* attempt to free twice */
}
}
#endif
buf->next = pool_ctl[pool].free_buf;
pool_ctl[pool].free_buf = buf;
}
Dmsg2(1800, "free_pool_memory %p pool=%d\n", buf, pool);
V(mutex);
}
#endif /* SMARTALLOC */
/*
* Clean up memory pool periodically
*
*/
static time_t last_garbage_collection = 0;
const int garbage_interval = 24 * 60 * 60; /* garbage collect every 24 hours */
void garbage_collect_memory_pool()
{
time_t now;
Dmsg0(200, "garbage collect memory pool\n");
P(mutex);
if (last_garbage_collection == 0) {
last_garbage_collection = time(NULL);
V(mutex);
return;
}
now = time(NULL);
if (now >= last_garbage_collection + garbage_interval) {
last_garbage_collection = now;
V(mutex);
garbage_collect_memory();
} else {
V(mutex);
}
}
/* Release all freed pooled memory */
void close_memory_pool()
{
struct abufhead *buf, *next;
int count = 0;
uint64_t bytes = 0;
char ed1[50];
sm_check(__FILE__, __LINE__, false);
P(mutex);
for (int i=1; i<=PM_MAX; i++) {
buf = pool_ctl[i].free_buf;
while (buf) {
next = buf->next;
count++;
bytes += sizeof_pool_memory((char *)buf);
free((char *)buf);
buf = next;
}
pool_ctl[i].free_buf = NULL;
}
Dmsg2(001, "Freed mem_pool count=%d size=%s\n", count, edit_uint64_with_commas(bytes, ed1));
if (debug_level >= 1) {
print_memory_pool_stats();
}
V(mutex);
}
/*
* Garbage collect and trim memory if possible
* This should be called after all big memory usages if possible.
*/
void garbage_collect_memory()
{
close_memory_pool(); /* release free chain */
#ifdef HAVE_MALLOC_TRIM
P(mutex);
malloc_trim(8192);
V(mutex);
#endif
}
#ifdef DEBUG
static const char *pool_name(int pool)
{
static char buf[30];
static const char *name[] = {
"NoPool",
"NAME ",
"FNAME ",
"MSG ",
"EMSG ",
"BSOCK ",
"RECORD"
};
if (pool >= 0 && pool <= PM_MAX) {
return name[pool];
}
sprintf(buf, "%-6d", pool);
return buf;
}
/*
* Print staticstics on memory pool usage
*/
void print_memory_pool_stats()
{
Pmsg0(-1, "Pool Maxsize Maxused Inuse\n");
for (int i = 0; i <= PM_MAX; i++) {
Pmsg4(-1, "%5s %7d %7d %5d\n",
pool_name(i),
pool_ctl[i].max_allocated,
pool_ctl[i].max_used,
pool_ctl[i].in_use);
}
Pmsg0(-1, "\n");
}
#else
void print_memory_pool_stats() {}
#endif /* DEBUG */
/*
* Concatenate a string (str) onto a pool memory buffer pm
* Returns: length of concatenated string
*/
int pm_strcat(POOLMEM **pm, const char *str)
{
int pmlen = strlen(*pm);
int len;
if (!str) str = "";
len = strlen(str) + 1;
*pm = check_pool_memory_size(*pm, pmlen + len);
memcpy(*pm+pmlen, str, len);
return pmlen + len - 1;
}
int pm_strcat(POOLMEM *&pm, const char *str)
{
int pmlen = strlen(pm);
int len;
if (!str) str = "";
len = strlen(str) + 1;
pm = check_pool_memory_size(pm, pmlen + len);
memcpy(pm+pmlen, str, len);
return pmlen + len - 1;
}
int pm_strcat(POOLMEM *&pm, POOL_MEM &str)
{
int pmlen = strlen(pm);
int len = strlen(str.c_str()) + 1;
pm = check_pool_memory_size(pm, pmlen + len);
memcpy(pm+pmlen, str.c_str(), len);
return pmlen + len - 1;
}
int pm_strcat(POOL_MEM &pm, const char *str)
{
int pmlen = strlen(pm.c_str());
int len;
if (!str) str = "";
len = strlen(str) + 1;
pm.check_size(pmlen + len);
memcpy(pm.c_str()+pmlen, str, len);
return pmlen + len - 1;
}
/*
* Copy a string (str) into a pool memory buffer pm
* Returns: length of string copied
*/
int pm_strcpy(POOLMEM **pm, const char *str)
{
int len;
if (!str) str = "";
len = strlen(str) + 1;
*pm = check_pool_memory_size(*pm, len);
memcpy(*pm, str, len);
return len - 1;
}
int pm_strcpy(POOLMEM *&pm, const char *str)
{
int len;
if (!str) str = "";
len = strlen(str) + 1;
pm = check_pool_memory_size(pm, len);
memcpy(pm, str, len);
return len - 1;
}
int pm_strcpy(POOLMEM *&pm, POOL_MEM &str)
{
int len = strlen(str.c_str()) + 1;
pm = check_pool_memory_size(pm, len);
memcpy(pm, str.c_str(), len);
return len - 1;
}
int pm_strcpy(POOL_MEM &pm, const char *str)
{
int len;
if (!str) str = "";
len = strlen(str) + 1;
pm.check_size(len);
memcpy(pm.c_str(), str, len);
return len - 1;
}
/*
* Copy data into a pool memory buffer pm
* Returns: length of data copied
*/
int pm_memcpy(POOLMEM **pm, const char *data, int32_t n)
{
*pm = check_pool_memory_size(*pm, n);
memcpy(*pm, data, n);
return n;
}
int pm_memcpy(POOLMEM *&pm, const char *data, int32_t n)
{
pm = check_pool_memory_size(pm, n);
memcpy(pm, data, n);
return n;
}
int pm_memcpy(POOLMEM *&pm, POOL_MEM &data, int32_t n)
{
pm = check_pool_memory_size(pm, n);
memcpy(pm, data.c_str(), n);
return n;
}
int pm_memcpy(POOL_MEM &pm, const char *data, int32_t n)
{
pm.check_size(n);
memcpy(pm.c_str(), data, n);
return n;
}
/* ============== CLASS POOL_MEM ============== */
void POOL_MEM::realloc_pm(int32_t size)
{
char *cp = mem;
char *buf;
int pool;
P(mutex);
cp -= HEAD_SIZE;
buf = (char *)realloc(cp, size+HEAD_SIZE);
if (buf == NULL) {
V(mutex);
Emsg1(M_ABORT, 0, _("Out of memory requesting %d bytes\n"), size);
return;
}
Dmsg2(900, "Old buf=%p new buf=%p\n", cp, buf);
((struct abufhead *)buf)->ablen = size;
pool = ((struct abufhead *)buf)->pool;
if (size > pool_ctl[pool].max_allocated) {
pool_ctl[pool].max_allocated = size;
}
mem = buf+HEAD_SIZE;
V(mutex);
Dmsg3(900, "Old buf=%p new buf=%p mem=%p\n", cp, buf, mem);
}
int POOL_MEM::strcat(const char *str)
{
int pmlen = strlen(mem);
int len;
if (!str) str = "";
len = strlen(str) + 1;
check_size(pmlen + len);
memcpy(mem+pmlen, str, len);
return pmlen + len - 1;
}
int POOL_MEM::strcpy(const char *str)
{
int len;
if (!str) str = "";
len = strlen(str) + 1;
check_size(len);
memcpy(mem, str, len);
return len - 1;
}