1 /*************************************************
2 * Exim - an Internet mail transport agent *
3 *************************************************/
5 /* Copyright (c) University of Cambridge 1995 - 2018 */
6 /* Copyright (c) The Exim maintainers 2019 */
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.
50 /* keep config.h before memcheck.h, for NVALGRIND */
57 /* We need to know how to align blocks of data for general use. I'm not sure
58 how to get an alignment factor in general. In the current world, a value of 8
59 is probably right, and this is sizeof(double) on some systems and sizeof(void
60 *) on others, so take the larger of those. Since everything in this expression
61 is a constant, the compiler should optimize it to a simple constant wherever it
62 appears (I checked that gcc does do this). */
65 (sizeof(void *) > sizeof(double) ? sizeof(void *) : sizeof(double))
67 /* store_reset() will not free the following block if the last used block has
68 less than this much left in it. */
70 #define STOREPOOL_MIN_SIZE 256
72 /* Structure describing the beginning of each big block. */
74 typedef struct storeblock {
75 struct storeblock *next;
79 /* Just in case we find ourselves on a system where the structure above has a
80 length that is not a multiple of the alignment, set up a macro for the padded
83 #define ALIGNED_SIZEOF_STOREBLOCK \
84 (((sizeof(storeblock) + alignment - 1) / alignment) * alignment)
86 /* Size of block to get from malloc to carve up into smaller ones. This
87 must be a multiple of the alignment. We assume that 8192 is going to be
90 #define STORE_BLOCK_SIZE (8192 - ALIGNED_SIZEOF_STOREBLOCK)
92 /* Variables holding data for the local pools of store. The current pool number
93 is held in store_pool, which is global so that it can be changed from outside.
94 Setting the initial length values to -1 forces a malloc for the first call,
95 even if the length is zero (which is used for getting a point to reset to). */
97 int store_pool = POOL_MAIN;
100 static storeblock *chainbase[NPOOLS];
101 static storeblock *current_block[NPOOLS];
102 static void *next_yield[NPOOLS];
103 static int yield_length[NPOOLS] = { -1, -1, -1, -1, -1, -1 };
105 /* The limits of the tainted pools. Tracking these on new allocations enables
106 a fast is_tainted implementation. We assume the kernel only allocates mmaps using
107 one side or the other of data+heap, not both. */
109 void * tainted_base = (void *)-1;
110 void * tainted_top = (void *)0;
112 /* pool_malloc holds the amount of memory used by the store pools; this goes up
113 and down as store is reset or released. nonpool_malloc is the total got by
114 malloc from other calls; this doesn't go down because it is just freed by
117 static int pool_malloc;
118 static int nonpool_malloc;
120 /* This variable is set by store_get() to its yield, and by store_reset() to
121 NULL. This enables string_cat() to optimize its store handling for very long
122 strings. That's why the variable is global. */
124 void *store_last_get[NPOOLS];
126 /* These are purely for stats-gathering */
128 static int nbytes[NPOOLS]; /* current bytes allocated */
129 static int maxbytes[NPOOLS]; /* max number reached */
130 static int nblocks[NPOOLS]; /* current number of blocks allocated */
131 static int maxblocks[NPOOLS];
132 static int n_nonpool_blocks; /* current number of direct store_malloc() blocks */
133 static int max_nonpool_blocks;
134 static int max_pool_malloc; /* max value for pool_malloc */
135 static int max_nonpool_malloc; /* max value for nonpool_malloc */
138 static const uschar * pooluse[NPOOLS] = {
139 [POOL_MAIN] = US"main",
140 [POOL_PERM] = US"perm",
141 [POOL_SEARCH] = US"search",
142 [POOL_TAINT_MAIN] = US"main",
143 [POOL_TAINT_PERM] = US"perm",
144 [POOL_TAINT_SEARCH] = US"search",
146 static const uschar * poolclass[NPOOLS] = {
147 [POOL_MAIN] = US"untainted",
148 [POOL_PERM] = US"untainted",
149 [POOL_SEARCH] = US"untainted",
150 [POOL_TAINT_MAIN] = US"tainted",
151 [POOL_TAINT_PERM] = US"tainted",
152 [POOL_TAINT_SEARCH] = US"tainted",
156 static void * store_mmap(int, const char *, int);
157 static void * internal_store_malloc(int, const char *, int);
158 static void internal_store_free(void *, const char *, int linenumber);
160 /******************************************************************************/
163 die_tainted(const uschar * msg, const uschar * func, int line)
165 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "Taint mismatch, %s: %s %d\n",
170 /*************************************************
171 * Get a block from the current pool *
172 *************************************************/
174 /* Running out of store is a total disaster. This function is called via the
175 macro store_get(). It passes back a block of store within the current big
176 block, getting a new one if necessary. The address is saved in
181 func function from which called
182 linenumber line number in source file
184 Returns: pointer to store (panic on malloc failure)
188 store_get_3(int size, BOOL tainted, const char *func, int linenumber)
190 int pool = tainted ? store_pool + POOL_TAINT_BASE : store_pool;
192 /* Round up the size to a multiple of the alignment. Although this looks a
193 messy statement, because "alignment" is a constant expression, the compiler can
194 do a reasonable job of optimizing, especially if the value of "alignment" is a
195 power of two. I checked this with -O2, and gcc did very well, compiling it to 4
196 instructions on a Sparc (alignment = 8). */
198 if (size % alignment != 0) size += alignment - (size % alignment);
200 /* If there isn't room in the current block, get a new one. The minimum
201 size is STORE_BLOCK_SIZE, and we would expect this to be the norm, since
202 these functions are mostly called for small amounts of store. */
204 if (size > yield_length[pool])
206 int length = size <= STORE_BLOCK_SIZE ? STORE_BLOCK_SIZE : size;
207 int mlength = length + ALIGNED_SIZEOF_STOREBLOCK;
208 storeblock * newblock;
210 /* Sometimes store_reset() may leave a block for us; check if we can use it */
212 if ( (newblock = current_block[pool])
213 && (newblock = newblock->next)
214 && newblock->length < length
217 /* Give up on this block, because it's too small */
219 if (pool < POOL_TAINT_BASE)
220 internal_store_free(newblock, func, linenumber);
223 #ifndef COMPILE_UTILITY
225 debug_printf("---Unmap %6p %-20s %4d\n", newblock, func, linenumber);
227 munmap(newblock, newblock->length + ALIGNED_SIZEOF_STOREBLOCK);
232 /* If there was no free block, get a new one */
236 if ((nbytes[pool] += mlength) > maxbytes[pool])
237 maxbytes[pool] = nbytes[pool];
238 if ((pool_malloc += mlength) > max_pool_malloc) /* Used in pools */
239 max_pool_malloc = pool_malloc;
240 nonpool_malloc -= mlength; /* Exclude from overall total */
241 if (++nblocks[pool] > maxblocks[pool])
242 maxblocks[pool] = nblocks[pool];
245 ? store_mmap(mlength, func, linenumber)
246 : internal_store_malloc(mlength, func, linenumber);
247 newblock->next = NULL;
248 newblock->length = length;
250 if (!chainbase[pool])
251 chainbase[pool] = newblock;
253 current_block[pool]->next = newblock;
256 current_block[pool] = newblock;
257 yield_length[pool] = newblock->length;
259 (void *)(CS current_block[pool] + ALIGNED_SIZEOF_STOREBLOCK);
260 (void) VALGRIND_MAKE_MEM_NOACCESS(next_yield[pool], yield_length[pool]);
263 /* There's (now) enough room in the current block; the yield is the next
266 store_last_get[pool] = next_yield[pool];
268 /* Cut out the debugging stuff for utilities, but stop picky compilers from
271 #ifdef COMPILE_UTILITY
273 linenumber = linenumber;
276 debug_printf("---%d Get %6p %5d %-14s %4d\n", pool,
277 store_last_get[pool], size, func, linenumber);
278 #endif /* COMPILE_UTILITY */
280 (void) VALGRIND_MAKE_MEM_UNDEFINED(store_last_get[pool], size);
281 /* Update next pointer and number of bytes left in the current block. */
283 next_yield[pool] = (void *)(CS next_yield[pool] + size);
284 yield_length[pool] -= size;
285 return store_last_get[pool];
290 /*************************************************
291 * Get a block from the PERM pool *
292 *************************************************/
294 /* This is just a convenience function, useful when just a single block is to
299 func function from which called
300 linenumber line number in source file
302 Returns: pointer to store (panic on malloc failure)
306 store_get_perm_3(int size, BOOL tainted, const char *func, int linenumber)
309 int old_pool = store_pool;
310 store_pool = POOL_PERM;
311 yield = store_get_3(size, tainted, func, linenumber);
312 store_pool = old_pool;
318 /*************************************************
319 * Extend a block if it is at the top *
320 *************************************************/
322 /* While reading strings of unknown length, it is often the case that the
323 string is being read into the block at the top of the stack. If it needs to be
324 extended, it is more efficient just to extend within the top block rather than
325 allocate a new block and then have to copy the data. This function is provided
326 for the use of string_cat(), but of course can be used elsewhere too.
327 The block itself is not expanded; only the top allocation from it.
330 ptr pointer to store block
331 oldsize current size of the block, as requested by user
332 newsize new size required
333 func function from which called
334 linenumber line number in source file
336 Returns: TRUE if the block is at the top of the stack and has been
337 extended; FALSE if it isn't at the top of the stack, or cannot
342 store_extend_3(void *ptr, BOOL tainted, int oldsize, int newsize,
343 const char *func, int linenumber)
345 int pool = tainted ? store_pool + POOL_TAINT_BASE : store_pool;
346 int inc = newsize - oldsize;
347 int rounded_oldsize = oldsize;
349 /* Check that the block being extended was already of the required taint status;
350 refuse to extend if not. */
352 if (is_tainted(ptr) != tainted)
355 if (rounded_oldsize % alignment != 0)
356 rounded_oldsize += alignment - (rounded_oldsize % alignment);
358 if (CS ptr + rounded_oldsize != CS (next_yield[pool]) ||
359 inc > yield_length[pool] + rounded_oldsize - oldsize)
362 /* Cut out the debugging stuff for utilities, but stop picky compilers from
365 #ifdef COMPILE_UTILITY
367 linenumber = linenumber;
370 debug_printf("---%d Ext %6p %5d %-14s %4d\n", pool, ptr, newsize,
372 #endif /* COMPILE_UTILITY */
374 if (newsize % alignment != 0) newsize += alignment - (newsize % alignment);
375 next_yield[pool] = CS ptr + newsize;
376 yield_length[pool] -= newsize - rounded_oldsize;
377 (void) VALGRIND_MAKE_MEM_UNDEFINED(ptr + oldsize, inc);
384 /*************************************************
385 * Back up to a previous point on the stack *
386 *************************************************/
388 /* This function resets the next pointer, freeing any subsequent whole blocks
389 that are now unused. Call with a cookie obtained from store_mark() only; do
390 not call with a pointer returned by store_get(). Both the untainted and tainted
391 pools corresposding to store_pool are reset.
394 r place to back up to
395 func function from which called
396 linenumber line number in source file
402 internal_store_reset(void * ptr, int pool, const char *func, int linenumber)
405 storeblock * b = current_block[pool];
406 char * bc = CS b + ALIGNED_SIZEOF_STOREBLOCK;
407 int newlength, count;
408 #ifndef COMPILE_UTILITY
409 int oldmalloc = pool_malloc;
412 /* Last store operation was not a get */
414 store_last_get[pool] = NULL;
416 /* See if the place is in the current block - as it often will be. Otherwise,
417 search for the block in which it lies. */
419 if (CS ptr < bc || CS ptr > bc + b->length)
421 for (b = chainbase[pool]; b; b = b->next)
423 bc = CS b + ALIGNED_SIZEOF_STOREBLOCK;
424 if (CS ptr >= bc && CS ptr <= bc + b->length) break;
427 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "internal error: store_reset(%p) "
428 "failed: pool=%d %-14s %4d", ptr, pool, func, linenumber);
431 /* Back up, rounding to the alignment if necessary. When testing, flatten
432 the released memory. */
434 newlength = bc + b->length - CS ptr;
435 #ifndef COMPILE_UTILITY
438 assert_no_variables(ptr, newlength, func, linenumber);
439 if (f.running_in_test_harness)
441 (void) VALGRIND_MAKE_MEM_DEFINED(ptr, newlength);
442 memset(ptr, 0xF0, newlength);
446 (void) VALGRIND_MAKE_MEM_NOACCESS(ptr, newlength);
447 next_yield[pool] = CS ptr + (newlength % alignment);
448 count = yield_length[pool];
449 count = (yield_length[pool] = newlength - (newlength % alignment)) - count;
450 current_block[pool] = b;
452 /* Free any subsequent block. Do NOT free the first
453 successor, if our current block has less than 256 bytes left. This should
454 prevent us from flapping memory. However, keep this block only when it has
457 if ( yield_length[pool] < STOREPOOL_MIN_SIZE
459 && b->next->length == STORE_BLOCK_SIZE)
462 #ifndef COMPILE_UTILITY
464 assert_no_variables(b, b->length + ALIGNED_SIZEOF_STOREBLOCK,
467 (void) VALGRIND_MAKE_MEM_NOACCESS(CS b + ALIGNED_SIZEOF_STOREBLOCK,
468 b->length - ALIGNED_SIZEOF_STOREBLOCK);
476 int siz = b->length + ALIGNED_SIZEOF_STOREBLOCK;
477 #ifndef COMPILE_UTILITY
479 assert_no_variables(b, b->length + ALIGNED_SIZEOF_STOREBLOCK,
486 if (pool < POOL_TAINT_BASE)
487 internal_store_free(b, func, linenumber);
490 #ifndef COMPILE_UTILITY
492 debug_printf("---Unmap %6p %-20s %4d\n", b, func, linenumber);
494 munmap(b, b->length + ALIGNED_SIZEOF_STOREBLOCK);
498 /* Cut out the debugging stuff for utilities, but stop picky compilers from
501 #ifdef COMPILE_UTILITY
503 linenumber = linenumber;
506 debug_printf("---%d Rst %6p %5d %-14s %4d %d\n", pool, ptr,
507 count + oldmalloc - pool_malloc,
508 func, linenumber, pool_malloc);
509 #endif /* COMPILE_UTILITY */
514 store_reset_3(rmark r, int pool, const char *func, int linenumber)
518 if (pool >= POOL_TAINT_BASE)
519 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
520 "store_reset called for pool %d: %s %d\n", pool, func, linenumber);
522 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
523 "store_reset called with bad mark: %s %d\n", func, linenumber);
525 internal_store_reset(*ptr, pool + POOL_TAINT_BASE, func, linenumber);
526 internal_store_reset(ptr, pool, func, linenumber);
532 /* Free tail-end unused allocation. This lets us allocate a big chunk
533 early, for cases when we only discover later how much was really needed.
535 Can be called with a value from store_get(), or an offset after such. Only
536 the tainted or untainted pool that serviced the store_get() will be affected.
538 This is mostly a cut-down version of internal_store_reset().
539 XXX needs rationalising
543 store_release_above_3(void *ptr, const char *func, int linenumber)
545 /* Search all pools' "current" blocks. If it isn't one of those,
546 ignore it (it usually will be). */
548 for (int pool = 0; pool < nelem(current_block); pool++)
550 storeblock * b = current_block[pool];
552 int count, newlength;
557 bc = CS b + ALIGNED_SIZEOF_STOREBLOCK;
558 if (CS ptr < bc || CS ptr > bc + b->length)
561 /* Last store operation was not a get */
563 store_last_get[pool] = NULL;
565 /* Back up, rounding to the alignment if necessary. When testing, flatten
566 the released memory. */
568 newlength = bc + b->length - CS ptr;
569 #ifndef COMPILE_UTILITY
572 assert_no_variables(ptr, newlength, func, linenumber);
573 if (f.running_in_test_harness)
575 (void) VALGRIND_MAKE_MEM_DEFINED(ptr, newlength);
576 memset(ptr, 0xF0, newlength);
580 (void) VALGRIND_MAKE_MEM_NOACCESS(ptr, newlength);
581 next_yield[pool] = CS ptr + (newlength % alignment);
582 count = yield_length[pool];
583 count = (yield_length[pool] = newlength - (newlength % alignment)) - count;
585 /* Cut out the debugging stuff for utilities, but stop picky compilers from
588 #ifdef COMPILE_UTILITY
590 linenumber = linenumber;
593 debug_printf("---%d Rel %6p %5d %-14s %4d %d\n", pool, ptr, count,
594 func, linenumber, pool_malloc);
598 #ifndef COMPILE_UTILITY
600 debug_printf("non-last memory release try: %s %d\n", func, linenumber);
607 store_mark_3(const char *func, int linenumber)
611 if (store_pool >= POOL_TAINT_BASE)
612 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
613 "store_mark called for pool %d: %s %d\n", store_pool, func, linenumber);
615 /* Stash a mark for the tainted-twin release, in the untainted twin. Return
616 a cookie (actually the address in the untainted pool) to the caller.
617 Reset uses the cookie to recover the t-mark, winds back the tainted pool with it
618 and winds back the untainted pool with the cookie. */
620 p = store_get_3(sizeof(void *), FALSE, func, linenumber);
621 *p = store_get_3(0, TRUE, func, linenumber);
628 /************************************************
630 ************************************************/
632 /* This function checks that the pointer it is given is the first thing in a
633 block, and if so, releases that block.
636 block block of store to consider
637 func function from which called
638 linenumber line number in source file
644 store_release_3(void * block, int pool, const char * func, int linenumber)
646 /* It will never be the first block, so no need to check that. */
648 for (storeblock * b = chainbase[pool]; b; b = b->next)
650 storeblock * bb = b->next;
651 if (bb && CS block == CS bb + ALIGNED_SIZEOF_STOREBLOCK)
653 int siz = bb->length + ALIGNED_SIZEOF_STOREBLOCK;
659 /* Cut out the debugging stuff for utilities, but stop picky compilers
660 from giving warnings. */
662 #ifdef COMPILE_UTILITY
664 linenumber = linenumber;
667 debug_printf("-Release %6p %-20s %4d %d\n", (void *)bb, func,
668 linenumber, pool_malloc);
670 if (f.running_in_test_harness)
671 memset(bb, 0xF0, bb->length+ALIGNED_SIZEOF_STOREBLOCK);
672 #endif /* COMPILE_UTILITY */
681 /************************************************
683 ************************************************/
685 /* Allocate a new block big enough to expend to the given size and
686 copy the current data into it. Free the old one if possible.
688 This function is specifically provided for use when reading very
689 long strings, e.g. header lines. When the string gets longer than a
690 complete block, it gets copied to a new block. It is helpful to free
691 the old block iff the previous copy of the string is at its start,
692 and therefore the only thing in it. Otherwise, for very long strings,
693 dead store can pile up somewhat disastrously. This function checks that
694 the pointer it is given is the first thing in a block, and that nothing
695 has been allocated since. If so, releases that block.
702 Returns: new location of data
706 store_newblock_3(void * block, BOOL tainted, int newsize, int len,
707 const char * func, int linenumber)
709 int pool = tainted ? store_pool + POOL_TAINT_BASE : store_pool;
710 BOOL release_ok = !tainted && store_last_get[pool] == block;
714 if (is_tainted(block) != tainted)
715 die_tainted(US"store_newblock", CUS func, linenumber);
718 newtext = store_get(newsize, tainted);
719 memcpy(newtext, block, len);
720 if (release_ok) store_release_3(block, pool, func, linenumber);
721 return (void *)newtext;
727 /******************************************************************************/
729 store_alloc_tail(void * yield, int size, const char * func, int line,
732 if ((nonpool_malloc += size) > max_nonpool_malloc)
733 max_nonpool_malloc = nonpool_malloc;
735 /* Cut out the debugging stuff for utilities, but stop picky compilers from
738 #ifdef COMPILE_UTILITY
739 func = func; line = line; type = type;
742 /* If running in test harness, spend time making sure all the new store
743 is not filled with zeros so as to catch problems. */
745 if (f.running_in_test_harness)
746 memset(yield, 0xF0, (size_t)size);
747 DEBUG(D_memory) debug_printf("--%6s %6p %5d bytes\t%-14s %4d\tpool %5d nonpool %5d\n",
748 type, yield, size, func, line, pool_malloc, nonpool_malloc);
749 #endif /* COMPILE_UTILITY */
754 /*************************************************
756 *************************************************/
759 store_mmap(int size, const char * func, int line)
763 if (size < 16) size = 16;
765 if (!(yield = mmap(NULL, (size_t)size,
766 PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0)))
767 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "failed to mmap %d bytes of memory: "
768 "called from line %d of %s", size, line, func);
770 if (yield < tainted_base) tainted_base = yield;
771 if ((top = yield + size) > tainted_top) tainted_top = top;
773 return store_alloc_tail(yield, size, func, line, US"Mmap");
776 /*************************************************
778 *************************************************/
780 /* Running out of store is a total disaster for exim. Some malloc functions
781 do not run happily on very small sizes, nor do they document this fact. This
782 function is called via the macro store_malloc().
785 size amount of store wanted
786 func function from which called
787 linenumber line number in source file
789 Returns: pointer to gotten store (panic on failure)
793 internal_store_malloc(int size, const char *func, int linenumber)
797 if (size < 16) size = 16;
799 if (!(yield = malloc((size_t)size)))
800 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "failed to malloc %d bytes of memory: "
801 "called from line %d in %s", size, linenumber, func);
803 return store_alloc_tail(yield, size, func, linenumber, US"Malloc");
807 store_malloc_3(int size, const char *func, int linenumber)
809 if (n_nonpool_blocks++ > max_nonpool_blocks)
810 max_nonpool_blocks = n_nonpool_blocks;
811 return internal_store_malloc(size, func, linenumber);
815 /************************************************
817 ************************************************/
819 /* This function is called by the macro store_free().
822 block block of store to free
823 func function from which called
824 linenumber line number in source file
830 internal_store_free(void *block, const char *func, int linenumber)
832 #ifdef COMPILE_UTILITY
834 linenumber = linenumber;
837 debug_printf("----Free %6p %-20s %4d\n", block, func, linenumber);
838 #endif /* COMPILE_UTILITY */
843 store_free_3(void *block, const char *func, int linenumber)
846 internal_store_free(block, func, linenumber);
849 /******************************************************************************/
850 /* Stats output on process exit */
854 #ifndef COMPILE_UTILITY
857 debug_printf("----Exit nonpool max: %3d kB in %d blocks\n",
858 (max_nonpool_malloc+1023)/1024, max_nonpool_blocks);
859 debug_printf("----Exit npools max: %3d kB\n", max_pool_malloc/1024);
860 for (int i = 0; i < NPOOLS; i++)
861 debug_printf("----Exit pool %d max: %3d kB in %d blocks\t%s %s\n",
862 i, maxbytes[i]/1024, maxblocks[i], poolclass[i], pooluse[i]);