2 Bacula® - The Network Backup Solution
4 Copyright (C) 2000-2007 Free Software Foundation Europe e.V.
6 The main author of Bacula is Kern Sibbald, with contributions from
7 many others, a complete list can be found in the file AUTHORS.
8 This program is Free Software; you can redistribute it and/or
9 modify it under the terms of version two of the GNU General Public
10 License as published by the Free Software Foundation and included
13 This program is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
23 Bacula® is a registered trademark of John Walker.
24 The licensor of Bacula is the Free Software Foundation Europe
25 (FSFE), Fiduciary Program, Sumatrastrasse 25, 8006 Zürich,
26 Switzerland, email:ftf@fsfeurope.org.
31 Smart Memory Allocator
33 Evolved over several years, starting with the initial
34 SMARTALLOC code for AutoSketch in 1986, guided by the Blind
35 Watchbreaker, John Walker. Isolated in this general-purpose
36 form in September of 1989. Updated with be more POSIX
37 compliant and to include Web-friendly HTML documentation in
38 October of 1998 by the same culprit. For additional
39 information and the current version visit the Web page:
41 http://www.fourmilab.ch/smartall/
49 /* Use the real routines here */
55 /* We normally turn off debugging here.
56 * If you want it, simply #ifdef all the
64 #define Dmsg2(l,f,a1,a2)
65 #define Dmsg3(l,f,a1,a2,a3)
66 #define Dmsg4(l,f,a1,a2,a3,a4)
69 uint64_t sm_max_bytes = 0;
70 uint64_t sm_bytes = 0;
71 uint32_t sm_max_buffers = 0;
72 uint32_t sm_buffers = 0;
76 static pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
78 extern char my_name[]; /* daemon name */
80 typedef unsigned short sm_ushort;
82 #define EOS '\0' /* End of string sentinel */
83 #define sm_min(a, b) ((a) < (b) ? (a) : (b))
85 /* Queue data structures */
87 /* Memory allocation control structures and storage. */
90 struct b_queue abq; /* Links on allocated queue */
91 unsigned ablen; /* Buffer length in bytes */
92 const char *abfname; /* File name pointer */
93 sm_ushort ablineno; /* Line number of allocation */
94 bool abin_use; /* set when malloced and cleared when free */
97 static struct b_queue abqueue = { /* Allocated buffer queue */
102 static bool bufimode = false; /* Buffers not tracked when True */
104 #define HEAD_SIZE BALIGN(sizeof(struct abufhead))
107 /* SMALLOC -- Allocate buffer, enqueing on the orphaned buffer
110 static void *smalloc(const char *fname, int lineno, unsigned int nbytes)
114 /* Note: Unix MALLOC actually permits a zero length to be
115 passed and allocates a valid block with zero user bytes.
116 Such a block can later be expanded with realloc(). We
117 disallow this based on the belief that it's better to make
118 a special case and allocate one byte in the rare case this
119 is desired than to miss all the erroneous occurrences where
120 buffer length calculation code results in a zero. */
124 nbytes += HEAD_SIZE + 1;
125 if ((buf = (char *)malloc(nbytes)) != NULL) {
126 struct abufhead *head = (struct abufhead *)buf;
128 /* Enqueue buffer on allocated list */
129 qinsert(&abqueue, (struct b_queue *) buf);
130 head->ablen = nbytes;
131 head->abfname = bufimode ? NULL : fname;
132 head->ablineno = (sm_ushort)lineno;
133 head->abin_use = true;
134 /* Emplace end-clobber detector at end of buffer */
135 buf[nbytes - 1] = (uint8_t)((((long) buf) & 0xFF) ^ 0xC5);
136 buf += HEAD_SIZE; /* Increment to user data start */
137 if (++sm_buffers > sm_max_buffers) {
138 sm_max_buffers = sm_buffers;
141 if (sm_bytes > sm_max_bytes) {
142 sm_max_bytes = sm_bytes;
146 Emsg0(M_ABORT, 0, _("Out of memory\n"));
148 Dmsg4(1150, "smalloc %d at %x from %s:%d\n", nbytes, buf, fname, lineno);
149 #if SMALLOC_SANITY_CHECK > 0
150 if (sm_bytes > SMALLOC_SANITY_CHECK) {
151 Emsg0(M_ABORT, 0, _("Too much memory used."));
157 /* SM_NEW_OWNER -- Update the File and line number for a buffer
158 This is to accomodate mem_pool. */
160 void sm_new_owner(const char *fname, int lineno, char *buf)
162 buf -= HEAD_SIZE; /* Decrement to header */
163 ((struct abufhead *)buf)->abfname = bufimode ? NULL : fname;
164 ((struct abufhead *)buf)->ablineno = (sm_ushort) lineno;
165 ((struct abufhead *)buf)->abin_use = true;
169 /* SM_FREE -- Update free pool availability. FREE is never called
170 except through this interface or by actuallyfree().
171 free(x) is defined to generate a call to this
174 void sm_free(const char *file, int line, void *fp)
176 char *cp = (char *) fp;
180 Emsg2(M_ABORT, 0, _("Attempt to free NULL called from %s:%d\n"), file, line);
184 qp = (struct b_queue *)cp;
185 struct abufhead *head = (struct abufhead *)cp;
188 Dmsg4(1150, "sm_free %d at %x from %s:%d\n",
190 head->abfname, head->ablineno);
192 if (!head->abin_use) {
194 Emsg2(M_ABORT, 0, _("double free from %s:%d\n"), file, line);
196 head->abin_use = false;
198 /* The following assertions will catch virtually every release
199 of an address which isn't an allocated buffer. */
200 if (qp->qnext->qprev != qp) {
202 Emsg2(M_ABORT, 0, _("qp->qnext->qprev != qp called from %s:%d\n"), file, line);
204 if (qp->qprev->qnext != qp) {
206 Emsg2(M_ABORT, 0, _("qp->qprev->qnext != qp called from %s:%d\n"), file, line);
209 /* The following assertion detects storing off the end of the
210 allocated space in the buffer by comparing the end of buffer
211 checksum with the address of the buffer. */
213 if (((unsigned char *)cp)[head->ablen - 1] != ((((long) cp) & 0xFF) ^ 0xC5)) {
215 Emsg2(M_ABORT, 0, _("Buffer overrun called from %s:%d\n"), file, line);
217 if (sm_buffers > 0) {
219 sm_bytes -= head->ablen;
225 /* Now we wipe the contents of the just-released buffer with
226 "designer garbage" (Duff Kurland's phrase) of alternating
227 bits. This is intended to ruin the day for any miscreant who
228 attempts to access data through a pointer into storage that's
229 been previously released.
231 Modified, kes May, 2007 to not zap the header. This allows us
232 to check the in_use bit and detect doubly freed buffers.
235 memset(cp+HEAD_SIZE, 0xAA, (int)(head->ablen - HEAD_SIZE));
240 /* SM_MALLOC -- Allocate buffer. NULL is returned if no memory
243 void *sm_malloc(const char *fname, int lineno, unsigned int nbytes)
247 if ((buf = smalloc(fname, lineno, nbytes)) != NULL) {
249 /* To catch sloppy code that assumes buffers obtained from
250 malloc() are zeroed, we preset the buffer contents to
251 "designer garbage" consisting of alternating bits. */
253 memset(buf, 0x55, (int) nbytes);
255 Emsg0(M_ABORT, 0, _("Out of memory\n"));
260 /* SM_CALLOC -- Allocate an array and clear it to zero. */
262 void *sm_calloc(const char *fname, int lineno,
263 unsigned int nelem, unsigned int elsize)
267 if ((buf = smalloc(fname, lineno, nelem * elsize)) != NULL) {
268 memset(buf, 0, (int) (nelem * elsize));
270 Emsg0(M_ABORT, 0, _("Out of memory\n"));
275 /* SM_REALLOC -- Adjust the size of a previously allocated buffer.
276 Note that the trick of "resurrecting" a previously
277 freed buffer with realloc() is NOT supported by this
278 function. Further, because of the need to maintain
279 our control storage, SM_REALLOC must always allocate
280 a new block and copy the data in the old block.
281 This may result in programs which make heavy use of
282 realloc() running much slower than normally. */
284 void *sm_realloc(const char *fname, int lineno, void *ptr, unsigned int size)
288 char *cp = (char *) ptr;
290 Dmsg4(400, "sm_realloc %s:%d 0x%x %d\n", fname, lineno, ptr, size);
292 e_msg(fname, lineno, M_ABORT, 0, _("sm_realloc size: %d\n"), size);
295 /* If the old block pointer is NULL, treat realloc() as a
296 malloc(). SVID is silent on this, but many C libraries
299 return sm_malloc(fname, lineno, size);
302 /* If the old and new sizes are the same, be a nice guy and just
303 return the buffer passed in. */
305 struct abufhead *head = (struct abufhead *)cp;
306 osize = head->ablen - (HEAD_SIZE + 1);
311 /* Sizes differ. Allocate a new buffer of the requested size.
312 If we can't obtain such a buffer, act as defined in SVID:
313 return NULL from realloc() and leave the buffer in PTR
317 // sm_bytes -= head->ablen;
319 if ((buf = smalloc(fname, lineno, size)) != NULL) {
320 memcpy(buf, ptr, (int)sm_min(size, osize));
321 /* If the new buffer is larger than the old, fill the balance
322 of it with "designer garbage". */
324 memset(((char *) buf) + osize, 0x55, (int) (size - osize));
327 /* All done. Free and dechain the original buffer. */
328 sm_free(__FILE__, __LINE__, ptr);
330 Dmsg4(150, _("sm_realloc %d at %x from %s:%d\n"), size, buf, fname, lineno);
334 /* ACTUALLYMALLOC -- Call the system malloc() function to obtain
335 storage which will eventually be released
336 by system or library routines not compiled
339 void *actuallymalloc(unsigned int size)
344 /* ACTUALLYCALLOC -- Call the system calloc() function to obtain
345 storage which will eventually be released
346 by system or library routines not compiled
349 void *actuallycalloc(unsigned int nelem, unsigned int elsize)
351 return calloc(nelem, elsize);
354 /* ACTUALLYREALLOC -- Call the system realloc() function to obtain
355 storage which will eventually be released
356 by system or library routines not compiled
359 void *actuallyrealloc(void *ptr, unsigned int size)
361 Dmsg2(400, "Actuallyrealloc 0x%x %d\n", ptr, size);
362 return realloc(ptr, size);
365 /* ACTUALLYFREE -- Interface to system free() function to release
366 buffers allocated by low-level routines. */
368 void actuallyfree(void *cp)
373 /* SM_DUMP -- Print orphaned buffers (and dump them if BUFDUMP is
375 * N.B. DO NOT USE any Bacula print routines (Dmsg, Jmsg, Emsg, ...)
376 * as they have all been shut down at this point.
378 void sm_dump(bool bufdump, bool in_use)
384 ap = (struct abufhead *)abqueue.qnext;
386 while (ap != (struct abufhead *) &abqueue) {
389 (ap->abq.qnext->qprev != (struct b_queue *) ap) ||
390 (ap->abq.qprev->qnext != (struct b_queue *) ap)) {
392 "\nOrphaned buffers exist. Dump terminated following\n"
393 " discovery of bad links in chain of orphaned buffers.\n"
394 " Buffer address with bad links: %p\n"), ap);
398 if (ap->abfname != NULL) {
399 unsigned memsize = ap->ablen - (HEAD_SIZE + 1);
401 char *cp = ((char *)ap) + HEAD_SIZE;
403 bsnprintf(errmsg, sizeof(errmsg),
404 _("%s buffer: %s %6u bytes buf=%p allocated at %s:%d\n"),
405 in_use?"In use":"Orphaned",
406 my_name, memsize, cp, ap->abfname, ap->ablineno
408 fprintf(stderr, "%s", errmsg);
416 bstrncat(errmsg, "\n", sizeof(errmsg));
418 fprintf(stderr, "%s", errmsg);
421 bsnprintf(buf, sizeof(buf), " %02X",
423 bstrncat(errmsg, buf, sizeof(errmsg));
427 fprintf(stderr, "%s\n", errmsg);
430 ap = (struct abufhead *) ap->abq.qnext;
436 /* SM_CHECK -- Check the buffers and dump if any damage exists. */
437 void sm_check(const char *fname, int lineno, bool bufdump)
439 if (!sm_check_rtn(fname, lineno, bufdump)) {
440 Emsg2(M_ABORT, 0, _("Damaged buffer found. Called from %s:%d\n"),
446 /* SM_CHECK_RTN -- Check the buffers and return 1 if OK otherwise 0 */
447 int sm_check_rtn(const char *fname, int lineno, bool bufdump)
453 ap = (struct abufhead *) abqueue.qnext;
454 while (ap != (struct abufhead *) &abqueue) {
457 (ap->abq.qnext->qprev != (struct b_queue *) ap)) {
460 if (ap->abq.qprev->qnext != (struct b_queue *) ap) {
463 if (((unsigned char *) ap)[((struct abufhead *) ap)->ablen - 1] !=
464 ((((long) ap) & 0xFF) ^ 0xC5)) {
470 _("\nDamaged buffers found at %s:%d\n"), fname, lineno);
473 fprintf(stderr, _(" discovery of bad prev link.\n"));
476 fprintf(stderr, _(" discovery of bad next link.\n"));
479 fprintf(stderr, _(" discovery of data overrun.\n"));
482 fprintf(stderr, _(" Buffer address: %p\n"), ap);
484 if (ap->abfname != NULL) {
485 unsigned memsize = ap->ablen - (HEAD_SIZE + 1);
489 _("Damaged buffer: %6u bytes allocated at line %d of %s %s\n"),
490 memsize, ap->ablineno, my_name, ap->abfname
494 char *cp = ((char *) ap) + HEAD_SIZE;
499 strcat(errmsg, "\n");
501 fprintf(stderr, "%s", errmsg);
505 sprintf(errmsg + strlen(errmsg), " %02X",
508 sprintf(errmsg + strlen(errmsg), " %c ",
514 fprintf(stderr, "%s\n", errmsg);
518 ap = (struct abufhead *) ap->abq.qnext;
521 return badbuf ? 0 : 1;
525 /* SM_STATIC -- Orphaned buffer detection can be disabled (for such
526 items as buffers allocated during initialisation) by
527 calling sm_static(1). Normal orphaned buffer
528 detection can be re-enabled with sm_static(0). Note
529 that all the other safeguards still apply to buffers
530 allocated when sm_static(1) mode is in effect. */
532 void sm_static(bool mode)
538 * Here we overload C++'s global new and delete operators
539 * so that the memory is allocated through smartalloc.
543 void * operator new(size_t size)
545 // Dmsg1(000, "new called %d\n", size);
546 return sm_malloc(__FILE__, __LINE__, size);
549 void operator delete(void *buf)
551 // Dmsg1(000, "free called 0x%x\n", buf);
552 sm_free(__FILE__, __LINE__, buf);