1 /*************************************************
2 * Exim - an Internet mail transport agent *
3 *************************************************/
5 /* Copyright (c) University of Cambridge 1995 - 2018 */
6 /* Copyright (c) The Exim maintainers 2019 - 2020 */
7 /* See the file NOTICE for conditions of use and distribution. */
9 /* Exim gets and frees all its store through these functions. In the original
10 implementation there was a lot of mallocing and freeing of small bits of store.
11 The philosophy has now changed to a scheme which includes the concept of
12 "stacking pools" of store. For the short-lived processes, there isn't any real
13 need to do any garbage collection, but the stack concept allows quick resetting
14 in places where this seems sensible.
16 Obviously the long-running processes (the daemon, the queue runner, and eximon)
17 must take care not to eat store.
19 The following different types of store are recognized:
21 . Long-lived, large blocks: This is implemented by retaining the original
22 malloc/free functions, and it used for permanent working buffers and for
23 getting blocks to cut up for the other types.
25 . Long-lived, small blocks: This is used for blocks that have to survive until
26 the process exits. It is implemented as a stacking pool (POOL_PERM). This is
27 functionally the same as store_malloc(), except that the store can't be
28 freed, but I expect it to be more efficient for handling small blocks.
30 . Short-lived, short blocks: Most of the dynamic store falls into this
31 category. It is implemented as a stacking pool (POOL_MAIN) which is reset
32 after accepting a message when multiple messages are received by a single
33 process. Resetting happens at some other times as well, usually fairly
34 locally after some specific processing that needs working store.
36 . There is a separate pool (POOL_SEARCH) that is used only for lookup storage.
37 This means it can be freed when search_tidyup() is called to close down all
40 . Orthogonal to the three pool types, there are two classes of memory: untainted
41 and tainted. The latter is used for values derived from untrusted input, and
42 the string-expansion mechanism refuses to operate on such values (obviously,
43 it can expand an untainted value to return a tainted result). The classes
44 are implemented by duplicating the three pool types. Pool resets are requested
45 against the nontainted sibling and apply to both siblings.
47 Only memory blocks requested for tainted use are regarded as tainted; anything
48 else (including stack auto variables) is untainted. Care is needed when coding
49 to not copy untrusted data into untainted memory, as downstream taint-checks
52 Intermediate layers (eg. the string functions) can test for taint, and use this
53 for ensurinng that results have proper state. For example the
54 string_vformat_trc() routing supporting the string_sprintf() interface will
55 recopy a string being built into a tainted allocation if it meets a %s for a
56 tainted argument. Any intermediate-layer function that (can) return a new
57 allocation should behave this way; returning a tainted result if any tainted
58 content is used. Intermediate-layer functions (eg. Ustrncpy) that modify
59 existing allocations fail if tainted data is written into an untainted area.
60 Users of functions that modify existing allocations should check if a tainted
61 source and an untainted destination is used, and fail instead (sprintf() being
67 /* keep config.h before memcheck.h, for NVALGRIND */
74 /* We need to know how to align blocks of data for general use. I'm not sure
75 how to get an alignment factor in general. In the current world, a value of 8
76 is probably right, and this is sizeof(double) on some systems and sizeof(void
77 *) on others, so take the larger of those. Since everything in this expression
78 is a constant, the compiler should optimize it to a simple constant wherever it
79 appears (I checked that gcc does do this). */
82 (sizeof(void *) > sizeof(double) ? sizeof(void *) : sizeof(double))
84 /* store_reset() will not free the following block if the last used block has
85 less than this much left in it. */
87 #define STOREPOOL_MIN_SIZE 256
89 /* Structure describing the beginning of each big block. */
91 typedef struct storeblock {
92 struct storeblock *next;
96 /* Just in case we find ourselves on a system where the structure above has a
97 length that is not a multiple of the alignment, set up a macro for the padded
100 #define ALIGNED_SIZEOF_STOREBLOCK \
101 (((sizeof(storeblock) + alignment - 1) / alignment) * alignment)
103 /* Size of block to get from malloc to carve up into smaller ones. This
104 must be a multiple of the alignment. We assume that 8192 is going to be
107 #define STORE_BLOCK_SIZE (8192 - ALIGNED_SIZEOF_STOREBLOCK)
109 /* Variables holding data for the local pools of store. The current pool number
110 is held in store_pool, which is global so that it can be changed from outside.
111 Setting the initial length values to -1 forces a malloc for the first call,
112 even if the length is zero (which is used for getting a point to reset to). */
114 int store_pool = POOL_MAIN;
117 static storeblock *chainbase[NPOOLS];
118 static storeblock *current_block[NPOOLS];
119 static void *next_yield[NPOOLS];
120 static int yield_length[NPOOLS] = { -1, -1, -1, -1, -1, -1 };
122 /* pool_malloc holds the amount of memory used by the store pools; this goes up
123 and down as store is reset or released. nonpool_malloc is the total got by
124 malloc from other calls; this doesn't go down because it is just freed by
127 static int pool_malloc;
128 static int nonpool_malloc;
130 /* This variable is set by store_get() to its yield, and by store_reset() to
131 NULL. This enables string_cat() to optimize its store handling for very long
132 strings. That's why the variable is global. */
134 void *store_last_get[NPOOLS];
136 /* These are purely for stats-gathering */
138 static int nbytes[NPOOLS]; /* current bytes allocated */
139 static int maxbytes[NPOOLS]; /* max number reached */
140 static int nblocks[NPOOLS]; /* current number of blocks allocated */
141 static int maxblocks[NPOOLS];
142 static int n_nonpool_blocks; /* current number of direct store_malloc() blocks */
143 static int max_nonpool_blocks;
144 static int max_pool_malloc; /* max value for pool_malloc */
145 static int max_nonpool_malloc; /* max value for nonpool_malloc */
148 #ifndef COMPILE_UTILITY
149 static const uschar * pooluse[NPOOLS] = {
150 [POOL_MAIN] = US"main",
151 [POOL_PERM] = US"perm",
152 [POOL_SEARCH] = US"search",
153 [POOL_TAINT_MAIN] = US"main",
154 [POOL_TAINT_PERM] = US"perm",
155 [POOL_TAINT_SEARCH] = US"search",
157 static const uschar * poolclass[NPOOLS] = {
158 [POOL_MAIN] = US"untainted",
159 [POOL_PERM] = US"untainted",
160 [POOL_SEARCH] = US"untainted",
161 [POOL_TAINT_MAIN] = US"tainted",
162 [POOL_TAINT_PERM] = US"tainted",
163 [POOL_TAINT_SEARCH] = US"tainted",
168 static void * internal_store_malloc(int, const char *, int);
169 static void internal_store_free(void *, const char *, int linenumber);
171 /******************************************************************************/
173 /* Test if a pointer refers to tainted memory.
175 Slower version check, for use when platform intermixes malloc and mmap area
176 addresses. Test against the current-block of all tainted pools first, then all
177 blocks of all tainted pools.
179 Return: TRUE iff tainted
183 is_tainted_fn(const void * p)
187 for (int pool = POOL_TAINT_BASE; pool < nelem(chainbase); pool++)
188 if ((b = current_block[pool]))
190 uschar * bc = US b + ALIGNED_SIZEOF_STOREBLOCK;
191 if (US p >= bc && US p < bc + b->length) return TRUE;
194 for (int pool = POOL_TAINT_BASE; pool < nelem(chainbase); pool++)
195 for (b = chainbase[pool]; b; b = b->next)
197 uschar * bc = US b + ALIGNED_SIZEOF_STOREBLOCK;
198 if (US p >= bc && US p < bc + b->length) return TRUE;
205 die_tainted(const uschar * msg, const uschar * func, int line)
207 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "Taint mismatch, %s: %s %d\n",
213 /*************************************************
214 * Get a block from the current pool *
215 *************************************************/
217 /* Running out of store is a total disaster. This function is called via the
218 macro store_get(). It passes back a block of store within the current big
219 block, getting a new one if necessary. The address is saved in
223 size amount wanted, bytes
224 tainted class: set to true for untrusted data (eg. from smtp input)
225 func function from which called
226 linenumber line number in source file
228 Returns: pointer to store (panic on malloc failure)
232 store_get_3(int size, BOOL tainted, const char *func, int linenumber)
234 int pool = tainted ? store_pool + POOL_TAINT_BASE : store_pool;
236 /* Ensure we've been asked to allocate memory.
237 A negative size is a sign of a security problem.
238 A zero size might be also suspect, but our internal usage deliberately
239 does this to return a current watermark value for a later release of
244 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
245 "bad memory allocation requested (%d bytes) at %s %d",
246 size, func, linenumber);
249 /* Round up the size to a multiple of the alignment. Although this looks a
250 messy statement, because "alignment" is a constant expression, the compiler can
251 do a reasonable job of optimizing, especially if the value of "alignment" is a
252 power of two. I checked this with -O2, and gcc did very well, compiling it to 4
253 instructions on a Sparc (alignment = 8). */
255 if (size % alignment != 0) size += alignment - (size % alignment);
257 /* If there isn't room in the current block, get a new one. The minimum
258 size is STORE_BLOCK_SIZE, and we would expect this to be the norm, since
259 these functions are mostly called for small amounts of store. */
261 if (size > yield_length[pool])
263 int length = size <= STORE_BLOCK_SIZE ? STORE_BLOCK_SIZE : size;
264 int mlength = length + ALIGNED_SIZEOF_STOREBLOCK;
265 storeblock * newblock;
267 /* Sometimes store_reset() may leave a block for us; check if we can use it */
269 if ( (newblock = current_block[pool])
270 && (newblock = newblock->next)
271 && newblock->length < length
274 /* Give up on this block, because it's too small */
276 internal_store_free(newblock, func, linenumber);
280 /* If there was no free block, get a new one */
284 if ((nbytes[pool] += mlength) > maxbytes[pool])
285 maxbytes[pool] = nbytes[pool];
286 if ((pool_malloc += mlength) > max_pool_malloc) /* Used in pools */
287 max_pool_malloc = pool_malloc;
288 nonpool_malloc -= mlength; /* Exclude from overall total */
289 if (++nblocks[pool] > maxblocks[pool])
290 maxblocks[pool] = nblocks[pool];
292 newblock = internal_store_malloc(mlength, func, linenumber);
293 newblock->next = NULL;
294 newblock->length = length;
296 if (!chainbase[pool])
297 chainbase[pool] = newblock;
299 current_block[pool]->next = newblock;
302 current_block[pool] = newblock;
303 yield_length[pool] = newblock->length;
305 (void *)(CS current_block[pool] + ALIGNED_SIZEOF_STOREBLOCK);
306 (void) VALGRIND_MAKE_MEM_NOACCESS(next_yield[pool], yield_length[pool]);
309 /* There's (now) enough room in the current block; the yield is the next
312 store_last_get[pool] = next_yield[pool];
314 /* Cut out the debugging stuff for utilities, but stop picky compilers from
317 #ifdef COMPILE_UTILITY
319 linenumber = linenumber;
322 debug_printf("---%d Get %6p %5d %-14s %4d\n", pool,
323 store_last_get[pool], size, func, linenumber);
324 #endif /* COMPILE_UTILITY */
326 (void) VALGRIND_MAKE_MEM_UNDEFINED(store_last_get[pool], size);
327 /* Update next pointer and number of bytes left in the current block. */
329 next_yield[pool] = (void *)(CS next_yield[pool] + size);
330 yield_length[pool] -= size;
331 return store_last_get[pool];
336 /*************************************************
337 * Get a block from the PERM pool *
338 *************************************************/
340 /* This is just a convenience function, useful when just a single block is to
345 func function from which called
346 linenumber line number in source file
348 Returns: pointer to store (panic on malloc failure)
352 store_get_perm_3(int size, BOOL tainted, const char *func, int linenumber)
355 int old_pool = store_pool;
356 store_pool = POOL_PERM;
357 yield = store_get_3(size, tainted, func, linenumber);
358 store_pool = old_pool;
364 /*************************************************
365 * Extend a block if it is at the top *
366 *************************************************/
368 /* While reading strings of unknown length, it is often the case that the
369 string is being read into the block at the top of the stack. If it needs to be
370 extended, it is more efficient just to extend within the top block rather than
371 allocate a new block and then have to copy the data. This function is provided
372 for the use of string_cat(), but of course can be used elsewhere too.
373 The block itself is not expanded; only the top allocation from it.
376 ptr pointer to store block
377 oldsize current size of the block, as requested by user
378 newsize new size required
379 func function from which called
380 linenumber line number in source file
382 Returns: TRUE if the block is at the top of the stack and has been
383 extended; FALSE if it isn't at the top of the stack, or cannot
388 store_extend_3(void *ptr, BOOL tainted, int oldsize, int newsize,
389 const char *func, int linenumber)
391 int pool = tainted ? store_pool + POOL_TAINT_BASE : store_pool;
392 int inc = newsize - oldsize;
393 int rounded_oldsize = oldsize;
397 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
398 "bad memory extension requested (%d -> %d bytes) at %s %d",
399 oldsize, newsize, func, linenumber);
402 /* Check that the block being extended was already of the required taint status;
403 refuse to extend if not. */
405 if (is_tainted(ptr) != tainted)
408 if (rounded_oldsize % alignment != 0)
409 rounded_oldsize += alignment - (rounded_oldsize % alignment);
411 if (CS ptr + rounded_oldsize != CS (next_yield[pool]) ||
412 inc > yield_length[pool] + rounded_oldsize - oldsize)
415 /* Cut out the debugging stuff for utilities, but stop picky compilers from
418 #ifdef COMPILE_UTILITY
420 linenumber = linenumber;
423 debug_printf("---%d Ext %6p %5d %-14s %4d\n", pool, ptr, newsize,
425 #endif /* COMPILE_UTILITY */
427 if (newsize % alignment != 0) newsize += alignment - (newsize % alignment);
428 next_yield[pool] = CS ptr + newsize;
429 yield_length[pool] -= newsize - rounded_oldsize;
430 (void) VALGRIND_MAKE_MEM_UNDEFINED(ptr + oldsize, inc);
437 /*************************************************
438 * Back up to a previous point on the stack *
439 *************************************************/
441 /* This function resets the next pointer, freeing any subsequent whole blocks
442 that are now unused. Call with a cookie obtained from store_mark() only; do
443 not call with a pointer returned by store_get(). Both the untainted and tainted
444 pools corresposding to store_pool are reset.
447 r place to back up to
448 func function from which called
449 linenumber line number in source file
455 internal_store_reset(void * ptr, int pool, const char *func, int linenumber)
458 storeblock * b = current_block[pool];
459 char * bc = CS b + ALIGNED_SIZEOF_STOREBLOCK;
460 int newlength, count;
461 #ifndef COMPILE_UTILITY
462 int oldmalloc = pool_malloc;
465 /* Last store operation was not a get */
467 store_last_get[pool] = NULL;
469 /* See if the place is in the current block - as it often will be. Otherwise,
470 search for the block in which it lies. */
472 if (CS ptr < bc || CS ptr > bc + b->length)
474 for (b = chainbase[pool]; b; b = b->next)
476 bc = CS b + ALIGNED_SIZEOF_STOREBLOCK;
477 if (CS ptr >= bc && CS ptr <= bc + b->length) break;
480 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "internal error: store_reset(%p) "
481 "failed: pool=%d %-14s %4d", ptr, pool, func, linenumber);
484 /* Back up, rounding to the alignment if necessary. When testing, flatten
485 the released memory. */
487 newlength = bc + b->length - CS ptr;
488 #ifndef COMPILE_UTILITY
491 assert_no_variables(ptr, newlength, func, linenumber);
492 if (f.running_in_test_harness)
494 (void) VALGRIND_MAKE_MEM_DEFINED(ptr, newlength);
495 memset(ptr, 0xF0, newlength);
499 (void) VALGRIND_MAKE_MEM_NOACCESS(ptr, newlength);
500 next_yield[pool] = CS ptr + (newlength % alignment);
501 count = yield_length[pool];
502 count = (yield_length[pool] = newlength - (newlength % alignment)) - count;
503 current_block[pool] = b;
505 /* Free any subsequent block. Do NOT free the first
506 successor, if our current block has less than 256 bytes left. This should
507 prevent us from flapping memory. However, keep this block only when it has
510 if ( yield_length[pool] < STOREPOOL_MIN_SIZE
512 && b->next->length == STORE_BLOCK_SIZE)
515 #ifndef COMPILE_UTILITY
517 assert_no_variables(b, b->length + ALIGNED_SIZEOF_STOREBLOCK,
520 (void) VALGRIND_MAKE_MEM_NOACCESS(CS b + ALIGNED_SIZEOF_STOREBLOCK,
521 b->length - ALIGNED_SIZEOF_STOREBLOCK);
529 int siz = b->length + ALIGNED_SIZEOF_STOREBLOCK;
530 #ifndef COMPILE_UTILITY
532 assert_no_variables(b, b->length + ALIGNED_SIZEOF_STOREBLOCK,
539 internal_store_free(b, func, linenumber);
542 /* Cut out the debugging stuff for utilities, but stop picky compilers from
545 #ifdef COMPILE_UTILITY
547 linenumber = linenumber;
550 debug_printf("---%d Rst %6p %5d %-14s %4d %d\n", pool, ptr,
551 count + oldmalloc - pool_malloc,
552 func, linenumber, pool_malloc);
553 #endif /* COMPILE_UTILITY */
558 store_reset_3(rmark r, int pool, const char *func, int linenumber)
562 if (pool >= POOL_TAINT_BASE)
563 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
564 "store_reset called for pool %d: %s %d\n", pool, func, linenumber);
566 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
567 "store_reset called with bad mark: %s %d\n", func, linenumber);
569 internal_store_reset(*ptr, pool + POOL_TAINT_BASE, func, linenumber);
570 internal_store_reset(ptr, pool, func, linenumber);
576 /* Free tail-end unused allocation. This lets us allocate a big chunk
577 early, for cases when we only discover later how much was really needed.
579 Can be called with a value from store_get(), or an offset after such. Only
580 the tainted or untainted pool that serviced the store_get() will be affected.
582 This is mostly a cut-down version of internal_store_reset().
583 XXX needs rationalising
587 store_release_above_3(void *ptr, const char *func, int linenumber)
589 /* Search all pools' "current" blocks. If it isn't one of those,
590 ignore it (it usually will be). */
592 for (int pool = 0; pool < nelem(current_block); pool++)
594 storeblock * b = current_block[pool];
596 int count, newlength;
601 bc = CS b + ALIGNED_SIZEOF_STOREBLOCK;
602 if (CS ptr < bc || CS ptr > bc + b->length)
605 /* Last store operation was not a get */
607 store_last_get[pool] = NULL;
609 /* Back up, rounding to the alignment if necessary. When testing, flatten
610 the released memory. */
612 newlength = bc + b->length - CS ptr;
613 #ifndef COMPILE_UTILITY
616 assert_no_variables(ptr, newlength, func, linenumber);
617 if (f.running_in_test_harness)
619 (void) VALGRIND_MAKE_MEM_DEFINED(ptr, newlength);
620 memset(ptr, 0xF0, newlength);
624 (void) VALGRIND_MAKE_MEM_NOACCESS(ptr, newlength);
625 next_yield[pool] = CS ptr + (newlength % alignment);
626 count = yield_length[pool];
627 count = (yield_length[pool] = newlength - (newlength % alignment)) - count;
629 /* Cut out the debugging stuff for utilities, but stop picky compilers from
632 #ifdef COMPILE_UTILITY
634 linenumber = linenumber;
637 debug_printf("---%d Rel %6p %5d %-14s %4d %d\n", pool, ptr, count,
638 func, linenumber, pool_malloc);
642 #ifndef COMPILE_UTILITY
644 debug_printf("non-last memory release try: %s %d\n", func, linenumber);
651 store_mark_3(const char *func, int linenumber)
655 if (store_pool >= POOL_TAINT_BASE)
656 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
657 "store_mark called for pool %d: %s %d\n", store_pool, func, linenumber);
659 /* Stash a mark for the tainted-twin release, in the untainted twin. Return
660 a cookie (actually the address in the untainted pool) to the caller.
661 Reset uses the cookie to recover the t-mark, winds back the tainted pool with it
662 and winds back the untainted pool with the cookie. */
664 p = store_get_3(sizeof(void *), FALSE, func, linenumber);
665 *p = store_get_3(0, TRUE, func, linenumber);
672 /************************************************
674 ************************************************/
676 /* This function checks that the pointer it is given is the first thing in a
677 block, and if so, releases that block.
680 block block of store to consider
681 func function from which called
682 linenumber line number in source file
688 store_release_3(void * block, int pool, const char * func, int linenumber)
690 /* It will never be the first block, so no need to check that. */
692 for (storeblock * b = chainbase[pool]; b; b = b->next)
694 storeblock * bb = b->next;
695 if (bb && CS block == CS bb + ALIGNED_SIZEOF_STOREBLOCK)
697 int siz = bb->length + ALIGNED_SIZEOF_STOREBLOCK;
703 /* Cut out the debugging stuff for utilities, but stop picky compilers
704 from giving warnings. */
706 #ifdef COMPILE_UTILITY
708 linenumber = linenumber;
711 debug_printf("-Release %6p %-20s %4d %d\n", (void *)bb, func,
712 linenumber, pool_malloc);
714 if (f.running_in_test_harness)
715 memset(bb, 0xF0, bb->length+ALIGNED_SIZEOF_STOREBLOCK);
716 #endif /* COMPILE_UTILITY */
725 /************************************************
727 ************************************************/
729 /* Allocate a new block big enough to expend to the given size and
730 copy the current data into it. Free the old one if possible.
732 This function is specifically provided for use when reading very
733 long strings, e.g. header lines. When the string gets longer than a
734 complete block, it gets copied to a new block. It is helpful to free
735 the old block iff the previous copy of the string is at its start,
736 and therefore the only thing in it. Otherwise, for very long strings,
737 dead store can pile up somewhat disastrously. This function checks that
738 the pointer it is given is the first thing in a block, and that nothing
739 has been allocated since. If so, releases that block.
746 Returns: new location of data
750 store_newblock_3(void * block, BOOL tainted, int newsize, int len,
751 const char * func, int linenumber)
753 int pool = tainted ? store_pool + POOL_TAINT_BASE : store_pool;
754 BOOL release_ok = !tainted && store_last_get[pool] == block;
757 #if !defined(MACRO_PREDEF) && !defined(COMPILE_UTILITY)
758 if (is_tainted(block) != tainted)
759 die_tainted(US"store_newblock", CUS func, linenumber);
762 newtext = store_get(newsize, tainted);
763 memcpy(newtext, block, len);
764 if (release_ok) store_release_3(block, pool, func, linenumber);
765 return (void *)newtext;
771 /*************************************************
773 *************************************************/
775 /* Running out of store is a total disaster for exim. Some malloc functions
776 do not run happily on very small sizes, nor do they document this fact. This
777 function is called via the macro store_malloc().
780 size amount of store wanted
781 func function from which called
782 line line number in source file
784 Returns: pointer to gotten store (panic on failure)
788 internal_store_malloc(int size, const char *func, int line)
792 if (size < 16) size = 16;
794 if (!(yield = malloc((size_t)size)))
795 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "failed to malloc %d bytes of memory: "
796 "called from line %d in %s", size, line, func);
798 if ((nonpool_malloc += size) > max_nonpool_malloc)
799 max_nonpool_malloc = nonpool_malloc;
801 /* Cut out the debugging stuff for utilities, but stop picky compilers from
804 #ifdef COMPILE_UTILITY
805 func = func; line = line;
808 /* If running in test harness, spend time making sure all the new store
809 is not filled with zeros so as to catch problems. */
811 if (f.running_in_test_harness)
812 memset(yield, 0xF0, (size_t)size);
813 DEBUG(D_memory) debug_printf("--Malloc %6p %5d bytes\t%-14s %4d\tpool %5d nonpool %5d\n",
814 yield, size, func, line, pool_malloc, nonpool_malloc);
815 #endif /* COMPILE_UTILITY */
821 store_malloc_3(int size, const char *func, int linenumber)
823 if (n_nonpool_blocks++ > max_nonpool_blocks)
824 max_nonpool_blocks = n_nonpool_blocks;
825 return internal_store_malloc(size, func, linenumber);
829 /************************************************
831 ************************************************/
833 /* This function is called by the macro store_free().
836 block block of store to free
837 func function from which called
838 linenumber line number in source file
844 internal_store_free(void * block, const char * func, int linenumber)
846 #ifdef COMPILE_UTILITY
848 linenumber = linenumber;
851 debug_printf("----Free %6p %-20s %4d\n", block, func, linenumber);
852 #endif /* COMPILE_UTILITY */
857 store_free_3(void * block, const char * func, int linenumber)
860 internal_store_free(block, func, linenumber);
863 /******************************************************************************/
864 /* Stats output on process exit */
868 #ifndef COMPILE_UTILITY
871 debug_printf("----Exit nonpool max: %3d kB in %d blocks\n",
872 (max_nonpool_malloc+1023)/1024, max_nonpool_blocks);
873 debug_printf("----Exit npools max: %3d kB\n", max_pool_malloc/1024);
874 for (int i = 0; i < NPOOLS; i++)
875 debug_printf("----Exit pool %d max: %3d kB in %d blocks\t%s %s\n",
876 i, maxbytes[i]/1024, maxblocks[i], poolclass[i], pooluse[i]);