/usr/src/lib/libc/stdlib/malloc.c

Bug Summary

File:	src/lib/libc/stdlib/malloc.c
Warning:	line 1803, column 14 Assigned value is garbage or undefined
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name malloc.c -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 1 -fhalf-no-semantic-interposition -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -target-feature +retpoline-indirect-calls -target-feature +retpoline-indirect-branches -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/lib/libc/obj -resource-dir /usr/local/lib/clang/13.0.0 -include namespace.h -I /usr/src/lib/libc/include -I /usr/src/lib/libc/hidden -D __LIBC__ -D APIWARN -D YP -I /usr/src/lib/libc/yp -I /usr/src/lib/libc -I /usr/src/lib/libc/gdtoa -I /usr/src/lib/libc/arch/amd64/gdtoa -D INFNAN_CHECK -D MULTIPLE_THREADS -D NO_FENV_H -D USE_LOCALE -I /usr/src/lib/libc -I /usr/src/lib/libc/citrus -D RESOLVSORT -D FLOATING_POINT -D PRINTF_WIDE_CHAR -D SCANF_WIDE_CHAR -D FUTEX -D PIC -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -fdebug-compilation-dir=/usr/src/lib/libc/obj -ferror-limit 19 -fwrapv -D_RET_PROTECTOR -ret-protector -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c /usr/src/lib/libc/stdlib/malloc.c
1/*	$OpenBSD: malloc.c,v 1.272 2021/09/19 09:15:22 tb Exp $	*/
2/*
* Copyright (c) 2008, 2010, 2011, 2016 Otto Moerbeek <otto@drijf.net>
* Copyright (c) 2012 Matthew Dempsky <matthew@openbsd.org>
* Copyright (c) 2008 Damien Miller <djm@openbsd.org>
* Copyright (c) 2000 Poul-Henning Kamp <phk@FreeBSD.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/

21/*
* If we meet some day, and you think this stuff is worth it, you
* can buy me a beer in return. Poul-Henning Kamp
*/

26/* #define MALLOC_STATS */

28#include <sys/types.h>
29#include <sys/queue.h>
30#include <sys/mman.h>
31#include <sys/sysctl.h>
32#include <uvm/uvmexp.h>
33#include <errno(*__errno()).h>
34#include <stdarg.h>
35#include <stdint.h>
36#include <stdio.h>
37#include <stdlib.h>
38#include <string.h>
39#include <unistd.h>

41#ifdef MALLOC_STATS
42#include <sys/tree.h>
43#include <fcntl.h>
44#endif

46#include "thread_private.h"
47#include <tib.h>

49#define MALLOC_PAGESHIFT12	_MAX_PAGE_SHIFT12

51#define MALLOC_MINSHIFT4		4
52#define MALLOC_MAXSHIFT(12 - 1)		(MALLOC_PAGESHIFT12 - 1)
53#define MALLOC_PAGESIZE(1UL << 12)		(1UL << MALLOC_PAGESHIFT12)
54#define MALLOC_MINSIZE(1UL << 4)		(1UL << MALLOC_MINSHIFT4)
55#define MALLOC_PAGEMASK((1UL << 12) - 1)		(MALLOC_PAGESIZE(1UL << 12) - 1)
56#define MASK_POINTER(p)((void *)(((uintptr_t)(p)) & ~((1UL << 12) - 1)))		((void *)(((uintptr_t)(p)) & ~MALLOC_PAGEMASK((1UL << 12) - 1)))

58#define MALLOC_MAXCHUNK(1 << (12 - 1))		(1 << MALLOC_MAXSHIFT(12 - 1))
59#define MALLOC_MAXCACHE256		256
60#define MALLOC_DELAYED_CHUNK_MASK15	15
61#ifdef MALLOC_STATS
62#define MALLOC_INITIAL_REGIONS((1UL << 12) / sizeof(struct region_info))	512
63#else
64#define MALLOC_INITIAL_REGIONS((1UL << 12) / sizeof(struct region_info))	(MALLOC_PAGESIZE(1UL << 12) / sizeof(struct region_info))
65#endif
66#define MALLOC_DEFAULT_CACHE64	64
67#define MALLOC_CHUNK_LISTS4	4
68#define CHUNK_CHECK_LENGTH32	32

70/*
* We move allocations between half a page and a whole page towards the end,
* subject to alignment constraints. This is the extra headroom we allow.
* Set to zero to be the most strict.
*/
75#define MALLOC_LEEWAY0		0
76#define MALLOC_MOVE_COND(sz)((sz) - malloc_readonly.mopts.malloc_guard < (1UL <<
 12) - 0)	((sz) - moptsmalloc_readonly.mopts.malloc_guard < 		\
		    MALLOC_PAGESIZE(1UL << 12) - MALLOC_LEEWAY0)
78#define MALLOC_MOVE(p, sz)(((char *)(p)) + (((1UL << 12) - 0 - ((sz) - malloc_readonly
.mopts.malloc_guard)) & ~((1UL << 4) - 1)))  	(((char *)(p)) +			\
		    ((MALLOC_PAGESIZE(1UL << 12) - MALLOC_LEEWAY0 -	\
	    	    ((sz) - moptsmalloc_readonly.mopts.malloc_guard)) & 	\
		    ~(MALLOC_MINSIZE(1UL << 4) - 1)))

83#define PAGEROUND(x)(((x) + (((1UL << 12) - 1))) & ~((1UL << 12) -
 1))  (((x) + (MALLOC_PAGEMASK((1UL << 12) - 1))) & ~MALLOC_PAGEMASK((1UL << 12) - 1))

85/*
* What to use for Junk.  This is the byte value we use to fill with
* when the 'J' option is enabled. Use SOME_JUNK right after alloc,
* and SOME_FREEJUNK right before free.
*/
90#define SOME_JUNK0xdb		0xdb	/* deadbeef */
91#define SOME_FREEJUNK0xdf		0xdf	/* dead, free */
92#define SOME_FREEJUNK_ULL0xdfdfdfdfdfdfdfdfULL	0xdfdfdfdfdfdfdfdfULL

94#define MMAP(sz,f)mmap(((void*)0), (sz), 0x01 | 0x02, 0x1000 | 0x0002 | (f), -1
, 0)	mmap(NULL((void*)0), (sz), PROT_READ0x01 | PROT_WRITE0x02, \
  MAP_ANON0x1000 | MAP_PRIVATE0x0002 | (f), -1, 0)

97#define MMAPNONE(sz,f)mmap(((void*)0), (sz), 0x00, 0x1000 | 0x0002 | (f), -1, 0)	mmap(NULL((void*)0), (sz), PROT_NONE0x00, \
  MAP_ANON0x1000 | MAP_PRIVATE0x0002 | (f), -1, 0)

100#define MMAPA(a,sz,f)mmap((a), (sz), 0x01 | 0x02, 0x1000 | 0x0002 | (f), -1, 0)	mmap((a), (sz), PROT_READ0x01 | PROT_WRITE0x02, \
  MAP_ANON0x1000 | MAP_PRIVATE0x0002 | (f), -1, 0)

103#define MQUERY(a,sz,f)mquery((a), (sz), 0x01 | 0x02, 0x1000 | 0x0002 | 0x0010 | (f)
, -1, 0)	mquery((a), (sz), PROT_READ0x01 | PROT_WRITE0x02, \
  MAP_ANON0x1000 | MAP_PRIVATE0x0002 | MAP_FIXED0x0010 | (f), -1, 0)

106struct region_info {
void *p;		/* page; low bits used to mark chunks */
uintptr_t size;		/* size for pages, or chunk_info pointer */
109#ifdef MALLOC_STATS
void *f;		/* where allocated from */
111#endif
112};

114LIST_HEAD(chunk_head, chunk_info)struct chunk_head { struct chunk_info *lh_first; };

116#define MAX_CACHEABLE_SIZE32	32
117struct cache {
void *pages[MALLOC_MAXCACHE256];
ushort length;
ushort max;
121};

123struct dir_info {
u_int32_t canary1;
int active;			/* status of malloc */
struct region_info *r;		/* region slots */
size_t regions_total;		/* number of region slots */
size_t regions_free;		/* number of free slots */
size_t rbytesused;		/* random bytes used */
char *func;			/* current function */
int malloc_junk;		/* junk fill? */
int mmap_flag;			/* extra flag for mmap */
int mutex;
			/* lists of free chunk info structs */
struct chunk_head chunk_info_list[MALLOC_MAXSHIFT(12 - 1) + 1];
			/* lists of chunks with free slots */
struct chunk_head chunk_dir[MALLOC_MAXSHIFT(12 - 1) + 1][MALLOC_CHUNK_LISTS4];
			/* delayed free chunk slots */
void *delayed_chunks[MALLOC_DELAYED_CHUNK_MASK15 + 1];
u_char rbytes[32];		/* random bytes */
			/* free pages cache */
struct cache cache[MAX_CACHEABLE_SIZE32];
143#ifdef MALLOC_STATS
size_t inserts;
size_t insert_collisions;
size_t finds;
size_t find_collisions;
size_t deletes;
size_t delete_moves;
size_t cheap_realloc_tries;
size_t cheap_reallocs;
size_t malloc_used;		/* bytes allocated */
size_t malloc_guarded;		/* bytes used for guards */
size_t pool_searches;		/* searches for pool */
size_t other_pool;		/* searches in other pool */
156#define STATS_ADD(x,y)	((x) += (y))
157#define STATS_SUB(x,y)	((x) -= (y))
158#define STATS_INC(x)	((x)++)
159#define STATS_ZERO(x)	((x) = 0)
160#define STATS_SETF(x,y)	((x)->f = (y))
161#else
162#define STATS_ADD(x,y)	/* nothing */
163#define STATS_SUB(x,y)	/* nothing */
164#define STATS_INC(x)	/* nothing */
165#define STATS_ZERO(x)	/* nothing */
166#define STATS_SETF(x,y)	/* nothing */
167#endif /* MALLOC_STATS */
u_int32_t canary2;
169};
170#define DIR_INFO_RSZ((sizeof(struct dir_info) + ((1UL << 12) - 1)) & ~(
(1UL << 12) - 1))	((sizeof(struct dir_info) + MALLOC_PAGEMASK((1UL << 12) - 1)) & \
	~MALLOC_PAGEMASK((1UL << 12) - 1))

173static void unmap(struct dir_info *d, void *p, size_t sz, size_t clear);

175/*
* This structure describes a page worth of chunks.
*
* How many bits per u_short in the bitmap
*/
180#define MALLOC_BITS(8 * sizeof(u_short))		(NBBY8 * sizeof(u_short))
181struct chunk_info {
LIST_ENTRY(chunk_info)struct { struct chunk_info *le_next; struct chunk_info **le_prev
; } entries;
void *page;			/* pointer to the page */
u_short canary;
u_short size;			/* size of this page's chunks */
u_short shift;			/* how far to shift for this size */
u_short free;			/* how many free chunks */
u_short total;			/* how many chunks */
u_short offset;			/* requested size table offset */
u_short bits[1];		/* which chunks are free */
191};

193struct malloc_readonly {
			/* Main bookkeeping information */
struct dir_info *malloc_pool[_MALLOC_MUTEXES32];
u_int	malloc_mutexes;		/* how much in actual use? */
int	malloc_mt;		/* multi-threaded mode? */
int	malloc_freecheck;	/* Extensive double free check */
int	malloc_freeunmap;	/* mprotect free pages PROT_NONE? */
int	def_malloc_junk;	/* junk fill? */
int	malloc_realloc;		/* always realloc? */
int	malloc_xmalloc;		/* xmalloc behaviour? */
u_int	chunk_canaries;		/* use canaries after chunks? */
int	internal_funcs;		/* use better recallocarray/freezero? */
u_int	def_maxcache;		/* free pages we cache */
size_t	malloc_guard;		/* use guard pages after allocations? */
207#ifdef MALLOC_STATS
int	malloc_stats;		/* dump statistics at end */
209#endif
u_int32_t malloc_canary;	/* Matched against ones in malloc_pool */
211};

213/* This object is mapped PROT_READ after initialisation to prevent tampering */
214static union {
struct malloc_readonly moptsmalloc_readonly.mopts;
u_char _pad[MALLOC_PAGESIZE(1UL << 12)];
217} malloc_readonly __attribute__((aligned(MALLOC_PAGESIZE(1UL << 12))));
218#define moptsmalloc_readonly.mopts	malloc_readonly.moptsmalloc_readonly.mopts

220char		*malloc_options;	/* compile-time options */

222static __dead__attribute__((__noreturn__)) void wrterror(struct dir_info *d, char *msg, ...)
  __attribute__((__format__ (printf, 2, 3)));

225#ifdef MALLOC_STATS
226void malloc_dump(int, int, struct dir_info *);
227PROTO_NORMAL(malloc_dump)__attribute__((__visibility__("hidden"))) typeof(malloc_dump)
 malloc_dump asm("_libc_" "malloc_dump");
228void malloc_gdump(int);
229PROTO_NORMAL(malloc_gdump)__attribute__((__visibility__("hidden"))) typeof(malloc_gdump
) malloc_gdump asm("_libc_" "malloc_gdump");
230static void malloc_exit(void);
231#define CALLER((void*)0)	__builtin_return_address(0)
232#else
233#define CALLER((void*)0)	NULL((void*)0)
234#endif

236/* low bits of r->p determine size: 0 means >= page size and r->size holding
* real size, otherwise low bits are a shift count, or 1 for malloc(0)
*/
239#define REALSIZE(sz, r)(sz) = (uintptr_t)(r)->p & ((1UL << 12) - 1), (sz
) = ((sz) == 0 ? (r)->size : ((sz) == 1 ? 0 : (1 << (
(sz)-1))))						\
(sz) = (uintptr_t)(r)->p & MALLOC_PAGEMASK((1UL << 12) - 1),		\
(sz) = ((sz) == 0 ? (r)->size : ((sz) == 1 ? 0 : (1 << ((sz)-1))))

243static inline void
244_MALLOC_LEAVE(struct dir_info *d)
245{
if (moptsmalloc_readonly.mopts.malloc_mt) {
d->active--;
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
}
250}

252static inline void
253_MALLOC_ENTER(struct dir_info *d)
254{
if (moptsmalloc_readonly.mopts.malloc_mt) {
_MALLOC_LOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_lock(d->mutex)
; } while (0);
d->active++;
}
259}

261static inline size_t
262hash(void *p)
263{
size_t sum;
uintptr_t u;

u = (uintptr_t)p >> MALLOC_PAGESHIFT12;
sum = u;
sum = (sum << 7) - sum + (u >> 16);
270#ifdef __LP64__1
sum = (sum << 7) - sum + (u >> 32);
sum = (sum << 7) - sum + (u >> 48);
273#endif
return sum;
275}

277static inline struct dir_info *
278getpool(void)
279{
if (!moptsmalloc_readonly.mopts.malloc_mt)
return moptsmalloc_readonly.mopts.malloc_pool[1];
else	/* first one reserved for special pool */
return moptsmalloc_readonly.mopts.malloc_pool[1 + TIB_GET()((struct tib *)((char *)(__amd64_read_tcb(0)) - (__builtin_offsetof
(struct tib, __tib_self) + 0)))->tib_tid %
    (moptsmalloc_readonly.mopts.malloc_mutexes - 1)];
285}

287static __dead__attribute__((__noreturn__)) void
288wrterror(struct dir_info *d, char *msg, ...)
289{
int		saved_errno = errno(*__errno());
va_list		ap;

dprintf(STDERR_FILENO2, "%s(%d) in %s(): ", __progname,
   getpid(), (d != NULL((void*)0) && d->func) ? d->func : "unknown");
va_start(ap, msg)__builtin_va_start(ap, msg);
vdprintf(STDERR_FILENO2, msg, ap);
va_end(ap)__builtin_va_end(ap);
dprintf(STDERR_FILENO2, "\n");

300#ifdef MALLOC_STATS
if (moptsmalloc_readonly.mopts.malloc_stats)
malloc_gdump(STDERR_FILENO2);
303#endif /* MALLOC_STATS */

errno(*__errno()) = saved_errno;

abort();
308}

310static void
311rbytes_init(struct dir_info *d)
312{
arc4random_buf(d->rbytes, sizeof(d->rbytes));
/* add 1 to account for using d->rbytes[0] */
d->rbytesused = 1 + d->rbytes[0] % (sizeof(d->rbytes) / 2);
316}

318static inline u_char
319getrbyte(struct dir_info *d)
320{
u_char x;

if (d->rbytesused >= sizeof(d->rbytes))
rbytes_init(d);
x = d->rbytes[d->rbytesused++];
return x;
327}

329static void
330omalloc_parseopt(char opt)
331{
switch (opt) {
case '+':
moptsmalloc_readonly.mopts.malloc_mutexes <<= 1;
if (moptsmalloc_readonly.mopts.malloc_mutexes > _MALLOC_MUTEXES32)
	moptsmalloc_readonly.mopts.malloc_mutexes = _MALLOC_MUTEXES32;
break;
case '-':
moptsmalloc_readonly.mopts.malloc_mutexes >>= 1;
if (moptsmalloc_readonly.mopts.malloc_mutexes < 2)
	moptsmalloc_readonly.mopts.malloc_mutexes = 2;
break;
case '>':
moptsmalloc_readonly.mopts.def_maxcache <<= 1;
if (moptsmalloc_readonly.mopts.def_maxcache > MALLOC_MAXCACHE256)
	moptsmalloc_readonly.mopts.def_maxcache = MALLOC_MAXCACHE256;
break;
case '<':
moptsmalloc_readonly.mopts.def_maxcache >>= 1;
break;
case 'c':
moptsmalloc_readonly.mopts.chunk_canaries = 0;
break;
case 'C':
moptsmalloc_readonly.mopts.chunk_canaries = 1;
break;
357#ifdef MALLOC_STATS
case 'd':
moptsmalloc_readonly.mopts.malloc_stats = 0;
break;
case 'D':
moptsmalloc_readonly.mopts.malloc_stats = 1;
break;
364#endif /* MALLOC_STATS */
case 'f':
moptsmalloc_readonly.mopts.malloc_freecheck = 0;
moptsmalloc_readonly.mopts.malloc_freeunmap = 0;
break;
case 'F':
moptsmalloc_readonly.mopts.malloc_freecheck = 1;
moptsmalloc_readonly.mopts.malloc_freeunmap = 1;
break;
case 'g':
moptsmalloc_readonly.mopts.malloc_guard = 0;
break;
case 'G':
moptsmalloc_readonly.mopts.malloc_guard = MALLOC_PAGESIZE(1UL << 12);
break;
case 'j':
if (moptsmalloc_readonly.mopts.def_malloc_junk > 0)
	moptsmalloc_readonly.mopts.def_malloc_junk--;
break;
case 'J':
if (moptsmalloc_readonly.mopts.def_malloc_junk < 2)
	moptsmalloc_readonly.mopts.def_malloc_junk++;
break;
case 'r':
moptsmalloc_readonly.mopts.malloc_realloc = 0;
break;
case 'R':
moptsmalloc_readonly.mopts.malloc_realloc = 1;
break;
case 'u':
moptsmalloc_readonly.mopts.malloc_freeunmap = 0;
break;
case 'U':
moptsmalloc_readonly.mopts.malloc_freeunmap = 1;
break;
case 'x':
moptsmalloc_readonly.mopts.malloc_xmalloc = 0;
break;
case 'X':
moptsmalloc_readonly.mopts.malloc_xmalloc = 1;
break;
default:
dprintf(STDERR_FILENO2, "malloc() warning: "
                  "unknown char in MALLOC_OPTIONS\n");
break;
}
410}

412static void
413omalloc_init(void)
414{
char *p, *q, b[16];
int i, j;
const int mib[2] = { CTL_VM2, VM_MALLOC_CONF12 };
size_t sb;

/*
* Default options
*/
moptsmalloc_readonly.mopts.malloc_mutexes = 8;
moptsmalloc_readonly.mopts.def_malloc_junk = 1;
moptsmalloc_readonly.mopts.def_maxcache = MALLOC_DEFAULT_CACHE64;

for (i = 0; i < 3; i++) {
switch (i) {
case 0:
	sb = sizeof(b);
	j = sysctl(mib, 2, b, &sb, NULL((void*)0), 0);
	if (j != 0)
		continue;
	p = b;
	break;
case 1:
	if (issetugid() == 0)
		p = getenv("MALLOC_OPTIONS");
	else
		continue;
	break;
case 2:
	p = malloc_options;
	break;
default:
	p = NULL((void*)0);
}

for (; p != NULL((void*)0) && *p != '\0'; p++) {
	switch (*p) {
	case 'S':
		for (q = "CFGJ"; *q != '\0'; q++)
			omalloc_parseopt(*q);
		moptsmalloc_readonly.mopts.def_maxcache = 0;
		break;
	case 's':
		for (q = "cfgj"; *q != '\0'; q++)
			omalloc_parseopt(*q);
		moptsmalloc_readonly.mopts.def_maxcache = MALLOC_DEFAULT_CACHE64;
		break;
	default:
		omalloc_parseopt(*p);
		break;
	}
}
}

468#ifdef MALLOC_STATS
if (moptsmalloc_readonly.mopts.malloc_stats && (atexit(malloc_exit) == -1)) {
dprintf(STDERR_FILENO2, "malloc() warning: atexit(2) failed."
    " Will not be able to dump stats on exit\n");
}
473#endif /* MALLOC_STATS */

while ((moptsmalloc_readonly.mopts.malloc_canary = arc4random()) == 0)
;
if (moptsmalloc_readonly.mopts.chunk_canaries)
do {
	moptsmalloc_readonly.mopts.chunk_canaries = arc4random();
} while ((u_char)moptsmalloc_readonly.mopts.chunk_canaries == 0 ||
    (u_char)moptsmalloc_readonly.mopts.chunk_canaries == SOME_FREEJUNK0xdf); 
482}

484static void
485omalloc_poolinit(struct dir_info **dp, int mmap_flag)
486{
char *p;
size_t d_avail, regioninfo_size;
struct dir_info *d;
int i, j;

/*
* Allocate dir_info with a guard page on either side. Also
* randomise offset inside the page at which the dir_info
* lies (subject to alignment by 1 << MALLOC_MINSHIFT)
*/
if ((p = MMAPNONE(DIR_INFO_RSZ + (MALLOC_PAGESIZE * 2), mmap_flag)mmap(((void*)0), (((sizeof(struct dir_info) + ((1UL << 12
) - 1)) & ~((1UL << 12) - 1)) + ((1UL << 12) *
 2)), 0x00, 0x1000 | 0x0002 | (mmap_flag), -1, 0)) ==
   MAP_FAILED((void *)-1))
wrterror(NULL((void*)0), "malloc init mmap failed");
mprotect(p + MALLOC_PAGESIZE(1UL << 12), DIR_INFO_RSZ((sizeof(struct dir_info) + ((1UL << 12) - 1)) & ~(
(1UL << 12) - 1)), PROT_READ0x01 | PROT_WRITE0x02);
d_avail = (DIR_INFO_RSZ((sizeof(struct dir_info) + ((1UL << 12) - 1)) & ~(
(1UL << 12) - 1)) - sizeof(*d)) >> MALLOC_MINSHIFT4;
d = (struct dir_info *)(p + MALLOC_PAGESIZE(1UL << 12) +
   (arc4random_uniform(d_avail) << MALLOC_MINSHIFT4));

rbytes_init(d);
d->regions_free = d->regions_total = MALLOC_INITIAL_REGIONS((1UL << 12) / sizeof(struct region_info));
regioninfo_size = d->regions_total * sizeof(struct region_info);
d->r = MMAP(regioninfo_size, mmap_flag)mmap(((void*)0), (regioninfo_size), 0x01 | 0x02, 0x1000 | 0x0002
 | (mmap_flag), -1, 0);
if (d->r == MAP_FAILED((void *)-1)) {
d->regions_total = 0;
wrterror(NULL((void*)0), "malloc init mmap failed");
}
for (i = 0; i <= MALLOC_MAXSHIFT(12 - 1); i++) {
LIST_INIT(&d->chunk_info_list[i])do { ((&d->chunk_info_list[i])->lh_first) = ((void*
)0); } while (0);
for (j = 0; j < MALLOC_CHUNK_LISTS4; j++)
	LIST_INIT(&d->chunk_dir[i][j])do { ((&d->chunk_dir[i][j])->lh_first) = ((void*)0)
; } while (0);
}
STATS_ADD(d->malloc_used, regioninfo_size + 3 * MALLOC_PAGESIZE);
d->mmap_flag = mmap_flag;
d->malloc_junk = moptsmalloc_readonly.mopts.def_malloc_junk;
d->canary1 = moptsmalloc_readonly.mopts.malloc_canary ^ (u_int32_t)(uintptr_t)d;
d->canary2 = ~d->canary1;

*dp = d;
525}

527static int
528omalloc_grow(struct dir_info *d)
529{
size_t newtotal;
size_t newsize;
size_t mask;
size_t i, oldpsz;
struct region_info *p;

if (d->regions_total > SIZE_MAX0xffffffffffffffffUL / sizeof(struct region_info) / 2)
return 1;

newtotal = d->regions_total * 2;
newsize = PAGEROUND(newtotal * sizeof(struct region_info))(((newtotal * sizeof(struct region_info)) + (((1UL << 12
) - 1))) & ~((1UL << 12) - 1));
mask = newtotal - 1;

/* Don't use cache here, we don't want user uaf touch this */
p = MMAP(newsize, d->mmap_flag)mmap(((void*)0), (newsize), 0x01 | 0x02, 0x1000 | 0x0002 | (d
->mmap_flag), -1, 0);
if (p == MAP_FAILED((void *)-1))
return 1;

STATS_ADD(d->malloc_used, newsize);
STATS_ZERO(d->inserts);
STATS_ZERO(d->insert_collisions);
for (i = 0; i < d->regions_total; i++) {
void *q = d->r[i].p;
if (q != NULL((void*)0)) {
	size_t index = hash(q) & mask;
	STATS_INC(d->inserts);
	while (p[index].p != NULL((void*)0)) {
		index = (index - 1) & mask;
		STATS_INC(d->insert_collisions);
	}
	p[index] = d->r[i];
}
}

oldpsz = PAGEROUND(d->regions_total * sizeof(struct region_info))(((d->regions_total * sizeof(struct region_info)) + (((1UL
 << 12) - 1))) & ~((1UL << 12) - 1));
/* clear to avoid meta info ending up in the cache */
unmap(d, d->r, oldpsz, oldpsz);
d->regions_free += d->regions_total;
d->regions_total = newtotal;
d->r = p;
return 0;
571}

573/*
* The hashtable uses the assumption that p is never NULL. This holds since
* non-MAP_FIXED mappings with hint 0 start at BRKSIZ.
*/
577static int
578insert(struct dir_info *d, void *p, size_t sz, void *f)
579{
size_t index;
size_t mask;
void *q;

if (d->regions_free * 4 < d->regions_total) {
if (omalloc_grow(d))
	return 1;
}
mask = d->regions_total - 1;
index = hash(p) & mask;
q = d->r[index].p;
STATS_INC(d->inserts);
while (q != NULL((void*)0)) {
index = (index - 1) & mask;
q = d->r[index].p;
STATS_INC(d->insert_collisions);
}
d->r[index].p = p;
d->r[index].size = sz;
599#ifdef MALLOC_STATS
d->r[index].f = f;
601#endif
d->regions_free--;
return 0;
604}

606static struct region_info *
607find(struct dir_info *d, void *p)
608{
size_t index;
size_t mask = d->regions_total - 1;
void *q, *r;

if (moptsmalloc_readonly.mopts.malloc_canary != (d->canary1 ^ (u_int32_t)(uintptr_t)d) ||
   d->canary1 != ~d->canary2)
wrterror(d, "internal struct corrupt");
p = MASK_POINTER(p)((void *)(((uintptr_t)(p)) & ~((1UL << 12) - 1)));
index = hash(p) & mask;
r = d->r[index].p;
q = MASK_POINTER(r)((void *)(((uintptr_t)(r)) & ~((1UL << 12) - 1)));
STATS_INC(d->finds);
while (q != p && r != NULL((void*)0)) {
index = (index - 1) & mask;
r = d->r[index].p;
q = MASK_POINTER(r)((void *)(((uintptr_t)(r)) & ~((1UL << 12) - 1)));
STATS_INC(d->find_collisions);
}
return (q == p && r != NULL((void*)0)) ? &d->r[index] : NULL((void*)0);
628}

630static void
631delete(struct dir_info *d, struct region_info *ri)
632{
/* algorithm R, Knuth Vol III section 6.4 */
size_t mask = d->regions_total - 1;
size_t i, j, r;

if (d->regions_total & (d->regions_total - 1))
wrterror(d, "regions_total not 2^x");
d->regions_free++;
STATS_INC(d->deletes);

i = ri - d->r;
for (;;) {
d->r[i].p = NULL((void*)0);
d->r[i].size = 0;
j = i;
for (;;) {
	i = (i - 1) & mask;
	if (d->r[i].p == NULL((void*)0))
		return;
	r = hash(d->r[i].p) & mask;
	if ((i <= r && r < j) || (r < j && j < i) ||
	    (j < i && i <= r))
		continue;
	d->r[j] = d->r[i];
	STATS_INC(d->delete_moves);
	break;
}

}
661}

663static inline void
664junk_free(int junk, void *p, size_t sz)
665{
size_t i, step = 1;
uint64_t *lp = p;

if (junk == 0 || sz == 0)
return;
sz /= sizeof(uint64_t);
if (junk == 1) {
if (sz > MALLOC_PAGESIZE(1UL << 12) / sizeof(uint64_t))
	sz = MALLOC_PAGESIZE(1UL << 12) / sizeof(uint64_t);
step = sz / 4;
if (step == 0)
	step = 1;
}
for (i = 0; i < sz; i += step)
lp[i] = SOME_FREEJUNK_ULL0xdfdfdfdfdfdfdfdfULL;
681}

683static inline void
684validate_junk(struct dir_info *pool, void *p, size_t sz)
685{
size_t i, step = 1;
uint64_t *lp = p;

if (pool->malloc_junk == 0 || sz == 0)
return;
sz /= sizeof(uint64_t);
if (pool->malloc_junk == 1) {
if (sz > MALLOC_PAGESIZE(1UL << 12) / sizeof(uint64_t))
	sz = MALLOC_PAGESIZE(1UL << 12) / sizeof(uint64_t);
step = sz / 4;
if (step == 0)
	step = 1;
}
for (i = 0; i < sz; i += step) {
if (lp[i] != SOME_FREEJUNK_ULL0xdfdfdfdfdfdfdfdfULL)
	wrterror(pool, "write after free %p", p);
}
703}


706/*
* Cache maintenance. 
* Opposed to the regular region data structure, the sizes in the
* cache are in MALLOC_PAGESIZE units.
*/
711static void
712unmap(struct dir_info *d, void *p, size_t sz, size_t clear)
713{
size_t psz = sz >> MALLOC_PAGESHIFT12;
void *r;
u_short i;
struct cache *cache;

if (sz != PAGEROUND(sz)(((sz) + (((1UL << 12) - 1))) & ~((1UL << 12)
 - 1)) || psz == 0)
wrterror(d, "munmap round");

if (psz > MAX_CACHEABLE_SIZE32 || d->cache[psz - 1].max == 0) {
if (munmap(p, sz))
	wrterror(d, "munmap %p", p);
STATS_SUB(d->malloc_used, sz);
return;
}
cache = &d->cache[psz - 1];
if (cache->length == cache->max) {
/* use a random slot */
i = getrbyte(d) % cache->max;
r = cache->pages[i];
if (!moptsmalloc_readonly.mopts.malloc_freeunmap)
	validate_junk(d, r, sz);
if (munmap(r, sz))
	wrterror(d, "munmap %p", r);
STATS_SUB(d->malloc_used, sz);
cache->length--;
} else
i = cache->length;

/* fill slot */
if (clear > 0)
explicit_bzero(p, clear);
if (moptsmalloc_readonly.mopts.malloc_freeunmap)
mprotect(p, sz, PROT_NONE0x00);
else
junk_free(d->malloc_junk, p, sz);
cache->pages[i] = p;
cache->length++;
751}

753static void *
754map(struct dir_info *d, size_t sz, int zero_fill)
755{
size_t i, psz = sz >> MALLOC_PAGESHIFT12;
void *p;
struct cache *cache;

if (moptsmalloc_readonly.mopts.malloc_canary != (d->canary1 ^ (u_int32_t)(uintptr_t)d) ||
   d->canary1 != ~d->canary2)
wrterror(d, "internal struct corrupt");
if (sz != PAGEROUND(sz)(((sz) + (((1UL << 12) - 1))) & ~((1UL << 12)
 - 1)) || psz == 0)
wrterror(d, "map round");


if (psz <= MAX_CACHEABLE_SIZE32 && d->cache[psz - 1].max > 0) {
cache = &d->cache[psz - 1];
if (cache->length > 0) {
	if (cache->length == 1)
		p = cache->pages[--cache->length];
	else {
		i = getrbyte(d) % cache->length;
		p = cache->pages[i];
		cache->pages[i] = cache->pages[--cache->length];
	}
	if (!moptsmalloc_readonly.mopts.malloc_freeunmap)
		validate_junk(d, p, sz);
	if (moptsmalloc_readonly.mopts.malloc_freeunmap)
		mprotect(p, sz, PROT_READ0x01 | PROT_WRITE0x02);
	if (zero_fill)
		memset(p, 0, sz);
	else if (moptsmalloc_readonly.mopts.malloc_freeunmap)
		junk_free(d->malloc_junk, p, sz);
	return p;
}
if (psz <= 1) {
	_MALLOC_LEAVE(d);
	p = MMAP(cache->max * sz, d->mmap_flag)mmap(((void*)0), (cache->max * sz), 0x01 | 0x02, 0x1000 | 0x0002
 | (d->mmap_flag), -1, 0);
	_MALLOC_ENTER(d);
	if (p != MAP_FAILED((void *)-1)) {
		STATS_ADD(d->malloc_used, cache->max * sz);
		cache->length = cache->max - 1;
		for (i = 0; i < cache->max - 1; i++) {
			void *q = (char*)p + i * sz;
			cache->pages[i] = q;
			if (!moptsmalloc_readonly.mopts.malloc_freeunmap)
				junk_free(d->malloc_junk, q, sz);
		}
		if (moptsmalloc_readonly.mopts.malloc_freeunmap)
			mprotect(p, (cache->max - 1) * sz, PROT_NONE0x00);
		p = (char*)p + (cache->max - 1) * sz;
		/* zero fill not needed */
		return p;
	}
}

}
_MALLOC_LEAVE(d);
p = MMAP(sz, d->mmap_flag)mmap(((void*)0), (sz), 0x01 | 0x02, 0x1000 | 0x0002 | (d->
mmap_flag), -1, 0);
_MALLOC_ENTER(d);
if (p != MAP_FAILED((void *)-1))
STATS_ADD(d->malloc_used, sz);
/* zero fill not needed */
return p;
816}

818static void
819init_chunk_info(struct dir_info *d, struct chunk_info *p, int bits)
820{
int i;

if (bits == 0) {
p->shift = MALLOC_MINSHIFT4;
p->total = p->free = MALLOC_PAGESIZE(1UL << 12) >> p->shift;
p->size = 0;
p->offset = 0xdead;
} else {
p->shift = bits;
p->total = p->free = MALLOC_PAGESIZE(1UL << 12) >> p->shift;
p->size = 1U << bits;
p->offset = howmany(p->total, MALLOC_BITS)(((p->total) + (((8 * sizeof(u_short))) - 1)) / ((8 * sizeof
(u_short))));
}
p->canary = (u_short)d->canary1;

/* set all valid bits in the bitmap */
i = p->total - 1;	
memset(p->bits, 0xff, sizeof(p->bits[0]) * (i / MALLOC_BITS(8 * sizeof(u_short))));
p->bits[i / MALLOC_BITS(8 * sizeof(u_short))] = (2U << (i % MALLOC_BITS(8 * sizeof(u_short)))) - 1;
840}

842static struct chunk_info *
843alloc_chunk_info(struct dir_info *d, int bits)
844{
struct chunk_info *p;

if (LIST_EMPTY(&d->chunk_info_list[bits])(((&d->chunk_info_list[bits])->lh_first) == ((void*
)0))) {
size_t size, count, i;
char *q;

if (bits == 0)
	count = MALLOC_PAGESIZE(1UL << 12) / MALLOC_MINSIZE(1UL << 4);
else
	count = MALLOC_PAGESIZE(1UL << 12) >> bits;

size = howmany(count, MALLOC_BITS)(((count) + (((8 * sizeof(u_short))) - 1)) / ((8 * sizeof(u_short
))));
size = sizeof(struct chunk_info) + (size - 1) * sizeof(u_short);
if (moptsmalloc_readonly.mopts.chunk_canaries)
	size += count * sizeof(u_short);
size = _ALIGN(size)(((unsigned long)(size) + (sizeof(long) - 1)) &~(sizeof(long
) - 1));

/* Don't use cache here, we don't want user uaf touch this */
q = MMAP(MALLOC_PAGESIZE, d->mmap_flag)mmap(((void*)0), ((1UL << 12)), 0x01 | 0x02, 0x1000 | 0x0002
 | (d->mmap_flag), -1, 0);
if (q == MAP_FAILED((void *)-1))
	return NULL((void*)0);
STATS_ADD(d->malloc_used, MALLOC_PAGESIZE);
count = MALLOC_PAGESIZE(1UL << 12) / size;

for (i = 0; i < count; i++, q += size) {
	p = (struct chunk_info *)q;
	LIST_INSERT_HEAD(&d->chunk_info_list[bits], p, entries)do { if (((p)->entries.le_next = (&d->chunk_info_list
[bits])->lh_first) != ((void*)0)) (&d->chunk_info_list
[bits])->lh_first->entries.le_prev = &(p)->entries
.le_next; (&d->chunk_info_list[bits])->lh_first = (
p); (p)->entries.le_prev = &(&d->chunk_info_list
[bits])->lh_first; } while (0);
}
}
p = LIST_FIRST(&d->chunk_info_list[bits])((&d->chunk_info_list[bits])->lh_first);
LIST_REMOVE(p, entries)do { if ((p)->entries.le_next != ((void*)0)) (p)->entries
.le_next->entries.le_prev = (p)->entries.le_prev; *(p)->
entries.le_prev = (p)->entries.le_next; ; ; } while (0);
if (p->shift == 0)
init_chunk_info(d, p, bits);
return p;
879}

881/*
* Allocate a page of chunks
*/
884static struct chunk_info *
885omalloc_make_chunks(struct dir_info *d, int bits, int listnum)
886{
struct chunk_info *bp;
void *pp;

/* Allocate a new bucket */
pp = map(d, MALLOC_PAGESIZE(1UL << 12), 0);
if (pp == MAP_FAILED((void *)-1))
return NULL((void*)0);

/* memory protect the page allocated in the malloc(0) case */
if (bits == 0 && mprotect(pp, MALLOC_PAGESIZE(1UL << 12), PROT_NONE0x00) == -1)
goto err;

bp = alloc_chunk_info(d, bits);
if (bp == NULL((void*)0))
goto err;
bp->page = pp;

if (insert(d, (void *)((uintptr_t)pp | (bits + 1)), (uintptr_t)bp,
   NULL((void*)0)))
goto err;
LIST_INSERT_HEAD(&d->chunk_dir[bits][listnum], bp, entries)do { if (((bp)->entries.le_next = (&d->chunk_dir[bits
][listnum])->lh_first) != ((void*)0)) (&d->chunk_dir
[bits][listnum])->lh_first->entries.le_prev = &(bp)
->entries.le_next; (&d->chunk_dir[bits][listnum])->
lh_first = (bp); (bp)->entries.le_prev = &(&d->
chunk_dir[bits][listnum])->lh_first; } while (0);
return bp;

910err:
unmap(d, pp, MALLOC_PAGESIZE(1UL << 12), 0);
return NULL((void*)0);
913}

915static int
916find_chunksize(size_t size)
917{
int r;

/* malloc(0) is special */
if (size == 0)
return 0;

if (size < MALLOC_MINSIZE(1UL << 4))
size = MALLOC_MINSIZE(1UL << 4);
size--;

r = MALLOC_MINSHIFT4;
while (size >> r)
r++;
return r;
932}

934static void
935fill_canary(char *ptr, size_t sz, size_t allocated)
936{
size_t check_sz = allocated - sz;

if (check_sz > CHUNK_CHECK_LENGTH32)
check_sz = CHUNK_CHECK_LENGTH32;
memset(ptr + sz, moptsmalloc_readonly.mopts.chunk_canaries, check_sz);
942}

944/*
* Allocate a chunk
*/
947static void *
948malloc_bytes(struct dir_info *d, size_t size, void *f)
949{
u_int i, r;
int j, listnum;
size_t k;
u_short	*lp;
struct chunk_info *bp;
void *p;

if (moptsmalloc_readonly.mopts.malloc_canary != (d->canary1 ^ (u_int32_t)(uintptr_t)d) ||
   d->canary1 != ~d->canary2)
wrterror(d, "internal struct corrupt");

j = find_chunksize(size);

r = ((u_int)getrbyte(d) << 8) | getrbyte(d);
listnum = r % MALLOC_CHUNK_LISTS4;
/* If it's empty, make a page more of that size chunks */
if ((bp = LIST_FIRST(&d->chunk_dir[j][listnum])((&d->chunk_dir[j][listnum])->lh_first)) == NULL((void*)0)) {
bp = omalloc_make_chunks(d, j, listnum);
if (bp == NULL((void*)0))
	return NULL((void*)0);
}

if (bp->canary != (u_short)d->canary1)
wrterror(d, "chunk info corrupted");

i = (r / MALLOC_CHUNK_LISTS4) & (bp->total - 1);

/* start somewhere in a short */
lp = &bp->bits[i / MALLOC_BITS(8 * sizeof(u_short))];
if (*lp) {
j = i % MALLOC_BITS(8 * sizeof(u_short));
k = ffs(*lp >> j);
if (k != 0) {
	k += j - 1;
	goto found;
}
}
/* no bit halfway, go to next full short */
i /= MALLOC_BITS(8 * sizeof(u_short));
for (;;) {
if (++i >= bp->total / MALLOC_BITS(8 * sizeof(u_short)))
	i = 0;
lp = &bp->bits[i];
if (*lp) {
	k = ffs(*lp) - 1;
	break;
}
}
998found:
999#ifdef MALLOC_STATS
if (i == 0 && k == 0) {
struct region_info *r = find(d, bp->page);
r->f = f;
}
1004#endif

*lp ^= 1 << k;

/* If there are no more free, remove from free-list */
if (--bp->free == 0)
LIST_REMOVE(bp, entries)do { if ((bp)->entries.le_next != ((void*)0)) (bp)->entries
.le_next->entries.le_prev = (bp)->entries.le_prev; *(bp
)->entries.le_prev = (bp)->entries.le_next; ; ; } while
 (0);

/* Adjust to the real offset of that chunk */
k += (lp - bp->bits) * MALLOC_BITS(8 * sizeof(u_short));

if (moptsmalloc_readonly.mopts.chunk_canaries && size > 0)
bp->bits[bp->offset + k] = size;

k <<= bp->shift;

p = (char *)bp->page + k;
if (bp->size > 0) {
if (d->malloc_junk == 2)
	memset(p, SOME_JUNK0xdb, bp->size);
else if (moptsmalloc_readonly.mopts.chunk_canaries)
	fill_canary(p, size, bp->size);
}
return p;
1028}

1030static void
1031validate_canary(struct dir_info *d, u_char *ptr, size_t sz, size_t allocated)
1032{
size_t check_sz = allocated - sz;
u_char *p, *q;

if (check_sz > CHUNK_CHECK_LENGTH32)
check_sz = CHUNK_CHECK_LENGTH32;
p = ptr + sz;
q = p + check_sz;

while (p < q) {
if (*p != (u_char)moptsmalloc_readonly.mopts.chunk_canaries && *p != SOME_JUNK0xdb) {
	wrterror(d, "chunk canary corrupted %p %#tx@%#zx%s",
	    ptr, p - ptr, sz,
	    *p == SOME_FREEJUNK0xdf ? " (double free?)" : "");
}
p++;
}
1049}

1051static uint32_t
1052find_chunknum(struct dir_info *d, struct chunk_info *info, void *ptr, int check)
1053{
uint32_t chunknum;

if (info->canary != (u_short)d->canary1)
wrterror(d, "chunk info corrupted");

/* Find the chunk number on the page */
chunknum = ((uintptr_t)ptr & MALLOC_PAGEMASK((1UL << 12) - 1)) >> info->shift;

if ((uintptr_t)ptr & ((1U << (info->shift)) - 1))
wrterror(d, "modified chunk-pointer %p", ptr);
if (info->bits[chunknum / MALLOC_BITS(8 * sizeof(u_short))] &
   (1U << (chunknum % MALLOC_BITS(8 * sizeof(u_short)))))
wrterror(d, "chunk is already free %p", ptr);
if (check && info->size > 0) {
validate_canary(d, ptr, info->bits[info->offset + chunknum],
    info->size);
}
return chunknum;
1072}

1074/*
* Free a chunk, and possibly the page it's on, if the page becomes empty.
*/
1077static void
1078free_bytes(struct dir_info *d, struct region_info *r, void *ptr)
1079{
struct chunk_head *mp;
struct chunk_info *info;
uint32_t chunknum;
int listnum;

info = (struct chunk_info *)r->size;
chunknum = find_chunknum(d, info, ptr, 0);

info->bits[chunknum / MALLOC_BITS(8 * sizeof(u_short))] |= 1U << (chunknum % MALLOC_BITS(8 * sizeof(u_short)));
info->free++;

if (info->free == 1) {
/* Page became non-full */
listnum = getrbyte(d) % MALLOC_CHUNK_LISTS4;
if (info->size != 0)
	mp = &d->chunk_dir[info->shift][listnum];
else
	mp = &d->chunk_dir[0][listnum];

LIST_INSERT_HEAD(mp, info, entries)do { if (((info)->entries.le_next = (mp)->lh_first) != (
(void*)0)) (mp)->lh_first->entries.le_prev = &(info
)->entries.le_next; (mp)->lh_first = (info); (info)->
entries.le_prev = &(mp)->lh_first; } while (0);
return;
}

if (info->free != info->total)
return;

LIST_REMOVE(info, entries)do { if ((info)->entries.le_next != ((void*)0)) (info)->
entries.le_next->entries.le_prev = (info)->entries.le_prev
; *(info)->entries.le_prev = (info)->entries.le_next; ;
 ; } while (0);

if (info->size == 0 && !moptsmalloc_readonly.mopts.malloc_freeunmap)
mprotect(info->page, MALLOC_PAGESIZE(1UL << 12), PROT_READ0x01 | PROT_WRITE0x02);
unmap(d, info->page, MALLOC_PAGESIZE(1UL << 12), 0);

delete(d, r);
if (info->size != 0)
mp = &d->chunk_info_list[info->shift];
else
mp = &d->chunk_info_list[0];
LIST_INSERT_HEAD(mp, info, entries)do { if (((info)->entries.le_next = (mp)->lh_first) != (
(void*)0)) (mp)->lh_first->entries.le_prev = &(info
)->entries.le_next; (mp)->lh_first = (info); (info)->
entries.le_prev = &(mp)->lh_first; } while (0);
1118}



1122static void *
1123omalloc(struct dir_info *pool, size_t sz, int zero_fill, void *f)
1124{
void *p;
size_t psz;

if (sz > MALLOC_MAXCHUNK(1 << (12 - 1))) {
if (sz >= SIZE_MAX0xffffffffffffffffUL - moptsmalloc_readonly.mopts.malloc_guard - MALLOC_PAGESIZE(1UL << 12)) {
	errno(*__errno()) = ENOMEM12;
	return NULL((void*)0);
}
sz += moptsmalloc_readonly.mopts.malloc_guard;
psz = PAGEROUND(sz)(((sz) + (((1UL << 12) - 1))) & ~((1UL << 12)
 - 1));
p = map(pool, psz, zero_fill);
if (p == MAP_FAILED((void *)-1)) {
	errno(*__errno()) = ENOMEM12;
	return NULL((void*)0);
}
if (insert(pool, p, sz, f)) {
	unmap(pool, p, psz, 0);
	errno(*__errno()) = ENOMEM12;
	return NULL((void*)0);
}
if (moptsmalloc_readonly.mopts.malloc_guard) {
	if (mprotect((char *)p + psz - moptsmalloc_readonly.mopts.malloc_guard,
	    moptsmalloc_readonly.mopts.malloc_guard, PROT_NONE0x00))
		wrterror(pool, "mprotect");
	STATS_ADD(pool->malloc_guarded, mopts.malloc_guard);
}

if (MALLOC_MOVE_COND(sz)((sz) - malloc_readonly.mopts.malloc_guard < (1UL <<
 12) - 0)) {
	/* fill whole allocation */
	if (pool->malloc_junk == 2)
		memset(p, SOME_JUNK0xdb, psz - moptsmalloc_readonly.mopts.malloc_guard);
	/* shift towards the end */
	p = MALLOC_MOVE(p, sz)(((char *)(p)) + (((1UL << 12) - 0 - ((sz) - malloc_readonly
.mopts.malloc_guard)) & ~((1UL << 4) - 1)));
	/* fill zeros if needed and overwritten above */
	if (zero_fill && pool->malloc_junk == 2)
		memset(p, 0, sz - moptsmalloc_readonly.mopts.malloc_guard);
} else {
	if (pool->malloc_junk == 2) {
		if (zero_fill)
			memset((char *)p + sz - moptsmalloc_readonly.mopts.malloc_guard,
			    SOME_JUNK0xdb, psz - sz);
		else
			memset(p, SOME_JUNK0xdb,
			    psz - moptsmalloc_readonly.mopts.malloc_guard);
	} else if (moptsmalloc_readonly.mopts.chunk_canaries)
		fill_canary(p, sz - moptsmalloc_readonly.mopts.malloc_guard,
		    psz - moptsmalloc_readonly.mopts.malloc_guard);
}

} else {
/* takes care of SOME_JUNK */
p = malloc_bytes(pool, sz, f);
if (zero_fill && p != NULL((void*)0) && sz > 0)
	memset(p, 0, sz);
}

return p;
1182}

1184/*
* Common function for handling recursion.  Only
* print the error message once, to avoid making the problem
* potentially worse.
*/
1189static void
1190malloc_recurse(struct dir_info *d)
1191{
static int noprint;

if (noprint == 0) {
noprint = 1;
wrterror(d, "recursive call");
}
d->active--;
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
errno(*__errno()) = EDEADLK11;
1201}

1203void
1204_malloc_init(int from_rthreads)
1205{
u_int i, j, nmutexes;
struct dir_info *d;

_MALLOC_LOCK(1)do { if (__isthreaded) _thread_cb.tc_malloc_lock(1); } while (
0);
if (!from_rthreads && moptsmalloc_readonly.mopts.malloc_pool[1]) {
_MALLOC_UNLOCK(1)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(1); } while
 (0);
return;
}
if (!moptsmalloc_readonly.mopts.malloc_canary)
omalloc_init();

nmutexes = from_rthreads ? moptsmalloc_readonly.mopts.malloc_mutexes : 2;
if (((uintptr_t)&malloc_readonly & MALLOC_PAGEMASK((1UL << 12) - 1)) == 0)
mprotect(&malloc_readonly, sizeof(malloc_readonly),
    PROT_READ0x01 | PROT_WRITE0x02);
for (i = 0; i < nmutexes; i++) {
if (moptsmalloc_readonly.mopts.malloc_pool[i])
	continue;
if (i == 0) {
	omalloc_poolinit(&d, MAP_CONCEAL0x8000);
	d->malloc_junk = 2;
	for (j = 0; j < MAX_CACHEABLE_SIZE32; j++)
		d->cache[j].max = 0;
} else {
	omalloc_poolinit(&d, 0);
	d->malloc_junk = moptsmalloc_readonly.mopts.def_malloc_junk;
	for (j = 0; j < MAX_CACHEABLE_SIZE32; j++)
		d->cache[j].max = moptsmalloc_readonly.mopts.def_maxcache >> (j / 8);
}
d->mutex = i;
moptsmalloc_readonly.mopts.malloc_pool[i] = d;
}

if (from_rthreads)
moptsmalloc_readonly.mopts.malloc_mt = 1;
else
moptsmalloc_readonly.mopts.internal_funcs = 1;

/*
* Options have been set and will never be reset.
* Prevent further tampering with them.
*/
if (((uintptr_t)&malloc_readonly & MALLOC_PAGEMASK((1UL << 12) - 1)) == 0)
mprotect(&malloc_readonly, sizeof(malloc_readonly), PROT_READ0x01);
_MALLOC_UNLOCK(1)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(1); } while
 (0);
1251}
1252DEF_STRONG(_malloc_init)__asm__(".global " "_malloc_init" " ; " "_malloc_init" " = " "_libc__malloc_init"
);

1254#define PROLOGUE(p, fn)d = (p); if (d == ((void*)0)) { _malloc_init(0); d = (p); } do
 { if (__isthreaded) _thread_cb.tc_malloc_lock(d->mutex); }
 while (0); d->func = fn; if (d->active++) { malloc_recurse
(d); return ((void*)0); }			\
d = (p); 			\
if (d == NULL((void*)0)) { 		\
_malloc_init(0);	\
d = (p);		\
}				\
_MALLOC_LOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_lock(d->mutex)
; } while (0);		\
d->func = fn;			\
if (d->active++) {		\
malloc_recurse(d);	\
return NULL((void*)0);		\
}				\

1267#define EPILOGUE()d->active--; do { if (__isthreaded) _thread_cb.tc_malloc_unlock
(d->mutex); } while (0); if (r == ((void*)0) && malloc_readonly
.mopts.malloc_xmalloc) wrterror(d, "out of memory"); if (r !=
 ((void*)0)) (*__errno()) = saved_errno;				\
d->active--;				\
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);		\
if (r == NULL((void*)0) && moptsmalloc_readonly.mopts.malloc_xmalloc)	\
wrterror(d, "out of memory");	\
if (r != NULL((void*)0))				\
errno(*__errno()) = saved_errno;		\

1275void *
1276malloc(size_t size)
1277{
void *r;
struct dir_info *d;
int saved_errno = errno(*__errno());

PROLOGUE(getpool(), "malloc")d = (getpool()); if (d == ((void*)0)) { _malloc_init(0); d = (
getpool()); } do { if (__isthreaded) _thread_cb.tc_malloc_lock
(d->mutex); } while (0); d->func = "malloc"; if (d->
active++) { malloc_recurse(d); return ((void*)0); }
r = omalloc(d, size, 0, CALLER((void*)0));
EPILOGUE()d->active--; do { if (__isthreaded) _thread_cb.tc_malloc_unlock
(d->mutex); } while (0); if (r == ((void*)0) && malloc_readonly
.mopts.malloc_xmalloc) wrterror(d, "out of memory"); if (r !=
 ((void*)0)) (*__errno()) = saved_errno;
return r;
1286}
1287/*DEF_STRONG(malloc);*/

1289void *
1290malloc_conceal(size_t size)
1291{
void *r;
struct dir_info *d;
int saved_errno = errno(*__errno());

PROLOGUE(mopts.malloc_pool[0], "malloc_conceal")d = (malloc_readonly.mopts.malloc_pool[0]); if (d == ((void*)
0)) { _malloc_init(0); d = (malloc_readonly.mopts.malloc_pool
[0]); } do { if (__isthreaded) _thread_cb.tc_malloc_lock(d->
mutex); } while (0); d->func = "malloc_conceal"; if (d->
active++) { malloc_recurse(d); return ((void*)0); }
r = omalloc(d, size, 0, CALLER((void*)0));
EPILOGUE()d->active--; do { if (__isthreaded) _thread_cb.tc_malloc_unlock
(d->mutex); } while (0); if (r == ((void*)0) && malloc_readonly
.mopts.malloc_xmalloc) wrterror(d, "out of memory"); if (r !=
 ((void*)0)) (*__errno()) = saved_errno;
return r;
1300}
1301DEF_WEAK(malloc_conceal)__asm__(".weak " "malloc_conceal" " ; " "malloc_conceal" " = "
 "_libc_malloc_conceal");

1303static struct region_info *
1304findpool(void *p, struct dir_info *argpool, struct dir_info **foundpool,
  char **saved_function)
1306{
struct dir_info *pool = argpool;
struct region_info *r = find(pool, p);

STATS_INC(pool->pool_searches);
if (r20.1
'r' is not equal to NULL
 == NULL((void*)0)) {
21
←
Taking false branch→
u_int i, nmutexes;

nmutexes = moptsmalloc_readonly.mopts.malloc_mt ? moptsmalloc_readonly.mopts.malloc_mutexes : 2;
STATS_INC(pool->other_pool);
for (i = 1; i < nmutexes; i++) {
	u_int j = (argpool->mutex + i) & (nmutexes - 1);

	pool->active--;
	_MALLOC_UNLOCK(pool->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(pool->mutex
); } while (0);
	pool = moptsmalloc_readonly.mopts.malloc_pool[j];
	_MALLOC_LOCK(pool->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_lock(pool->mutex
); } while (0);
	pool->active++;
	r = find(pool, p);
	if (r != NULL((void*)0)) {
		*saved_function = pool->func;
		pool->func = argpool->func;
		break;
	}
}
if (r == NULL((void*)0))
	wrterror(argpool, "bogus pointer (double free?) %p", p);
}
*foundpool = pool;
return r;
22
←
Returning without writing to '*saved_function'→
1336}

1338static void
1339ofree(struct dir_info **argpool, void *p, int clear, int check, size_t argsz)
1340{
struct region_info *r;
struct dir_info *pool;
char *saved_function;
size_t sz;

r = findpool(p, *argpool, &pool, &saved_function);

REALSIZE(sz, r)(sz) = (uintptr_t)(r)->p & ((1UL << 12) - 1), (sz
) = ((sz) == 0 ? (r)->size : ((sz) == 1 ? 0 : (1 << (
(sz)-1))));
if (pool->mmap_flag) {
clear = 1;
if (!check)
	argsz = sz;
}
if (check) {
if (sz <= MALLOC_MAXCHUNK(1 << (12 - 1))) {
	if (moptsmalloc_readonly.mopts.chunk_canaries && sz > 0) {
		struct chunk_info *info =
		    (struct chunk_info *)r->size;
		uint32_t chunknum =
		    find_chunknum(pool, info, p, 0);

		if (info->bits[info->offset + chunknum] < argsz)
			wrterror(pool, "recorded size %hu"
			    " < %zu",
			    info->bits[info->offset + chunknum],
			    argsz);
	} else {
		if (sz < argsz)
			wrterror(pool, "chunk size %zu < %zu",
			    sz, argsz);
	}
} else if (sz - moptsmalloc_readonly.mopts.malloc_guard < argsz) {
	wrterror(pool, "recorded size %zu < %zu",
	    sz - moptsmalloc_readonly.mopts.malloc_guard, argsz);
}
}
if (sz > MALLOC_MAXCHUNK(1 << (12 - 1))) {
if (!MALLOC_MOVE_COND(sz)((sz) - malloc_readonly.mopts.malloc_guard < (1UL <<
 12) - 0)) {
	if (r->p != p)
		wrterror(pool, "bogus pointer %p", p);
	if (moptsmalloc_readonly.mopts.chunk_canaries)
		validate_canary(pool, p,
		    sz - moptsmalloc_readonly.mopts.malloc_guard,
		    PAGEROUND(sz - mopts.malloc_guard)(((sz - malloc_readonly.mopts.malloc_guard) + (((1UL <<
 12) - 1))) & ~((1UL << 12) - 1)));
} else {
	/* shifted towards the end */
	if (p != MALLOC_MOVE(r->p, sz)(((char *)(r->p)) + (((1UL << 12) - 0 - ((sz) - malloc_readonly
.mopts.malloc_guard)) & ~((1UL << 4) - 1))))
		wrterror(pool, "bogus moved pointer %p", p);
	p = r->p;
}
if (moptsmalloc_readonly.mopts.malloc_guard) {
	if (sz < moptsmalloc_readonly.mopts.malloc_guard)
		wrterror(pool, "guard size");
	if (!moptsmalloc_readonly.mopts.malloc_freeunmap) {
		if (mprotect((char *)p + PAGEROUND(sz)(((sz) + (((1UL << 12) - 1))) & ~((1UL << 12)
 - 1)) -
		    moptsmalloc_readonly.mopts.malloc_guard, moptsmalloc_readonly.mopts.malloc_guard,
		    PROT_READ0x01 | PROT_WRITE0x02))
			wrterror(pool, "mprotect");
	}
	STATS_SUB(pool->malloc_guarded, mopts.malloc_guard);
}
unmap(pool, p, PAGEROUND(sz)(((sz) + (((1UL << 12) - 1))) & ~((1UL << 12)
 - 1)), clear ? argsz : 0);
delete(pool, r);
} else {
/* Validate and optionally canary check */
struct chunk_info *info = (struct chunk_info *)r->size;
if (info->size != sz)
	wrterror(pool, "internal struct corrupt");
find_chunknum(pool, info, p, moptsmalloc_readonly.mopts.chunk_canaries);
if (!clear) {
	void *tmp;
	int i;

	if (moptsmalloc_readonly.mopts.malloc_freecheck) {
		for (i = 0; i <= MALLOC_DELAYED_CHUNK_MASK15; i++)
			if (p == pool->delayed_chunks[i])
				wrterror(pool,
				    "double free %p", p);
	}
	junk_free(pool->malloc_junk, p, sz);
	i = getrbyte(pool) & MALLOC_DELAYED_CHUNK_MASK15;
	tmp = p;
	p = pool->delayed_chunks[i];
	if (tmp == p)
		wrterror(pool, "double free %p", tmp);
	pool->delayed_chunks[i] = tmp;
	if (p != NULL((void*)0)) {
		r = find(pool, p);
		REALSIZE(sz, r)(sz) = (uintptr_t)(r)->p & ((1UL << 12) - 1), (sz
) = ((sz) == 0 ? (r)->size : ((sz) == 1 ? 0 : (1 << (
(sz)-1))));
		if (r != NULL((void*)0))
			validate_junk(pool, p, sz);
	}
} else if (argsz > 0) {
	r = find(pool, p);
	explicit_bzero(p, argsz);
}
if (p != NULL((void*)0)) {
	if (r == NULL((void*)0))
		wrterror(pool,
		    "bogus pointer (double free?) %p", p);
	free_bytes(pool, r, p);
}
}

if (*argpool != pool) {
pool->func = saved_function;
*argpool = pool;
}
1449}

1451void
1452free(void *ptr)
1453{
struct dir_info *d;
int saved_errno = errno(*__errno());

/* This is legal. */
if (ptr == NULL((void*)0))
return;

d = getpool();
if (d == NULL((void*)0))
wrterror(d, "free() called before allocation");
_MALLOC_LOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_lock(d->mutex)
; } while (0);
d->func = "free";
if (d->active++) {
malloc_recurse(d);
return;
}
ofree(&d, ptr, 0, 0, 0);
d->active--;
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
errno(*__errno()) = saved_errno;
1474}
1475/*DEF_STRONG(free);*/

1477static void
1478freezero_p(void *ptr, size_t sz)
1479{
explicit_bzero(ptr, sz);
free(ptr);
1482}

1484void
1485freezero(void *ptr, size_t sz)
1486{
struct dir_info *d;
int saved_errno = errno(*__errno());

/* This is legal. */
if (ptr == NULL((void*)0))
return;

if (!moptsmalloc_readonly.mopts.internal_funcs) {
freezero_p(ptr, sz);
return;
}

d = getpool();
if (d == NULL((void*)0))
wrterror(d, "freezero() called before allocation");
_MALLOC_LOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_lock(d->mutex)
; } while (0);
d->func = "freezero";
if (d->active++) {
malloc_recurse(d);
return;
}
ofree(&d, ptr, 1, 1, sz);
d->active--;
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
errno(*__errno()) = saved_errno;
1512}
1513DEF_WEAK(freezero)__asm__(".weak " "freezero" " ; " "freezero" " = " "_libc_freezero"
);

1515static void *
1516orealloc(struct dir_info **argpool, void *p, size_t newsz, void *f)
1517{
struct region_info *r;
struct dir_info *pool;
char *saved_function;
struct chunk_info *info;
size_t oldsz, goldsz, gnewsz;
void *q, *ret;
uint32_t chunknum;
int forced;

if (p == NULL((void*)0))
return omalloc(*argpool, newsz, 0, f);

if (newsz >= SIZE_MAX0xffffffffffffffffUL - moptsmalloc_readonly.mopts.malloc_guard - MALLOC_PAGESIZE(1UL << 12)) {
errno(*__errno()) = ENOMEM12;
return  NULL((void*)0);
}

r = findpool(p, *argpool, &pool, &saved_function);

REALSIZE(oldsz, r)(oldsz) = (uintptr_t)(r)->p & ((1UL << 12) - 1),
 (oldsz) = ((oldsz) == 0 ? (r)->size : ((oldsz) == 1 ? 0 :
 (1 << ((oldsz)-1))));
if (moptsmalloc_readonly.mopts.chunk_canaries && oldsz <= MALLOC_MAXCHUNK(1 << (12 - 1))) {
info = (struct chunk_info *)r->size;
chunknum = find_chunknum(pool, info, p, 0);
}

goldsz = oldsz;
if (oldsz > MALLOC_MAXCHUNK(1 << (12 - 1))) {
if (oldsz < moptsmalloc_readonly.mopts.malloc_guard)
	wrterror(pool, "guard size");
oldsz -= moptsmalloc_readonly.mopts.malloc_guard;
}

gnewsz = newsz;
if (gnewsz > MALLOC_MAXCHUNK(1 << (12 - 1)))
gnewsz += moptsmalloc_readonly.mopts.malloc_guard;

forced = moptsmalloc_readonly.mopts.malloc_realloc || pool->mmap_flag;
if (newsz > MALLOC_MAXCHUNK(1 << (12 - 1)) && oldsz > MALLOC_MAXCHUNK(1 << (12 - 1)) && !forced) {
/* First case: from n pages sized allocation to m pages sized
   allocation, m > n */
size_t roldsz = PAGEROUND(goldsz)(((goldsz) + (((1UL << 12) - 1))) & ~((1UL <<
 12) - 1));
size_t rnewsz = PAGEROUND(gnewsz)(((gnewsz) + (((1UL << 12) - 1))) & ~((1UL <<
 12) - 1));

if (rnewsz < roldsz && rnewsz > roldsz / 2 &&
    roldsz - rnewsz < moptsmalloc_readonly.mopts.def_maxcache * MALLOC_PAGESIZE(1UL << 12) &&
    !moptsmalloc_readonly.mopts.malloc_guard) {

	ret = p;
	goto done;
}

if (rnewsz > roldsz) {
	/* try to extend existing region */
	if (!moptsmalloc_readonly.mopts.malloc_guard) {
		void *hint = (char *)r->p + roldsz;
		size_t needed = rnewsz - roldsz;

		STATS_INC(pool->cheap_realloc_tries);
		q = MQUERY(hint, needed, pool->mmap_flag)mquery((hint), (needed), 0x01 | 0x02, 0x1000 | 0x0002 | 0x0010
 | (pool->mmap_flag), -1, 0);
		if (q == hint)
			q = MMAPA(hint, needed, pool->mmap_flag)mmap((hint), (needed), 0x01 | 0x02, 0x1000 | 0x0002 | (pool->
mmap_flag), -1, 0);
		else
			q = MAP_FAILED((void *)-1);
		if (q == hint) {
			STATS_ADD(pool->malloc_used, needed);
			if (pool->malloc_junk == 2)
				memset(q, SOME_JUNK0xdb, needed);
			r->size = gnewsz;
			if (r->p != p) {
				/* old pointer is moved */
				memmove(r->p, p, oldsz);
				p = r->p;
			}
			if (moptsmalloc_readonly.mopts.chunk_canaries)
				fill_canary(p, newsz,
				    PAGEROUND(newsz)(((newsz) + (((1UL << 12) - 1))) & ~((1UL << 12
) - 1)));
			STATS_SETF(r, f);
			STATS_INC(pool->cheap_reallocs);
			ret = p;
			goto done;
		} else if (q != MAP_FAILED((void *)-1)) {
			if (munmap(q, needed))
				wrterror(pool, "munmap %p", q);
		}
	}
} else if (rnewsz < roldsz) {
	/* shrink number of pages */
	if (moptsmalloc_readonly.mopts.malloc_guard) {
		if (mprotect((char *)r->p + rnewsz -
		    moptsmalloc_readonly.mopts.malloc_guard, moptsmalloc_readonly.mopts.malloc_guard,
		    PROT_NONE0x00))
			wrterror(pool, "mprotect");
	}
	if (munmap((char *)r->p + rnewsz, roldsz - rnewsz))
		wrterror(pool, "munmap %p", (char *)r->p + rnewsz);
	STATS_SUB(pool->malloc_used, roldsz - rnewsz);
	r->size = gnewsz;
	if (MALLOC_MOVE_COND(gnewsz)((gnewsz) - malloc_readonly.mopts.malloc_guard < (1UL <<
 12) - 0)) {
		void *pp = MALLOC_MOVE(r->p, gnewsz)(((char *)(r->p)) + (((1UL << 12) - 0 - ((gnewsz) - malloc_readonly
.mopts.malloc_guard)) & ~((1UL << 4) - 1)));
		memmove(pp, p, newsz);
		p = pp;
	} else if (moptsmalloc_readonly.mopts.chunk_canaries)
		fill_canary(p, newsz, PAGEROUND(newsz)(((newsz) + (((1UL << 12) - 1))) & ~((1UL << 12
) - 1)));
	STATS_SETF(r, f);
	ret = p;
	goto done;
} else {
	/* number of pages remains the same */
	void *pp = r->p;

	r->size = gnewsz;
	if (MALLOC_MOVE_COND(gnewsz)((gnewsz) - malloc_readonly.mopts.malloc_guard < (1UL <<
 12) - 0))
		pp = MALLOC_MOVE(r->p, gnewsz)(((char *)(r->p)) + (((1UL << 12) - 0 - ((gnewsz) - malloc_readonly
.mopts.malloc_guard)) & ~((1UL << 4) - 1)));
	if (p != pp) {
		memmove(pp, p, oldsz < newsz ? oldsz : newsz);
		p = pp;
	}
	if (p == r->p) {
		if (newsz > oldsz && pool->malloc_junk == 2)
			memset((char *)p + newsz, SOME_JUNK0xdb,
			    rnewsz - moptsmalloc_readonly.mopts.malloc_guard -
			    newsz);
		if (moptsmalloc_readonly.mopts.chunk_canaries)
			fill_canary(p, newsz, PAGEROUND(newsz)(((newsz) + (((1UL << 12) - 1))) & ~((1UL << 12
) - 1)));
	}
	STATS_SETF(r, f);
	ret = p;
	goto done;
}
}
if (oldsz <= MALLOC_MAXCHUNK(1 << (12 - 1)) && oldsz > 0 &&
   newsz <= MALLOC_MAXCHUNK(1 << (12 - 1)) && newsz > 0 &&
   1 << find_chunksize(newsz) == oldsz && !forced) {
/* do not reallocate if new size fits good in existing chunk */
if (pool->malloc_junk == 2)
	memset((char *)p + newsz, SOME_JUNK0xdb, oldsz - newsz);
if (moptsmalloc_readonly.mopts.chunk_canaries) {
	info->bits[info->offset + chunknum] = newsz;
	fill_canary(p, newsz, info->size);
}
STATS_SETF(r, f);
ret = p;
} else if (newsz != oldsz || forced) {
/* create new allocation */
q = omalloc(pool, newsz, 0, f);
if (q == NULL((void*)0)) {
	ret = NULL((void*)0);
	goto done;
}
if (newsz != 0 && oldsz != 0)
	memcpy(q, p, oldsz < newsz ? oldsz : newsz);
ofree(&pool, p, 0, 0, 0);
ret = q;
} else {
/* oldsz == newsz */
if (newsz != 0)
	wrterror(pool, "realloc internal inconsistency");
STATS_SETF(r, f);
ret = p;
}
1678done:
if (*argpool != pool) {
pool->func = saved_function;
*argpool = pool;
}
return ret;
1684}

1686void *
1687realloc(void *ptr, size_t size)
1688{
struct dir_info *d;
void *r;
int saved_errno = errno(*__errno());

PROLOGUE(getpool(), "realloc")d = (getpool()); if (d == ((void*)0)) { _malloc_init(0); d = (
getpool()); } do { if (__isthreaded) _thread_cb.tc_malloc_lock
(d->mutex); } while (0); d->func = "realloc"; if (d->
active++) { malloc_recurse(d); return ((void*)0); }
r = orealloc(&d, ptr, size, CALLER((void*)0));
EPILOGUE()d->active--; do { if (__isthreaded) _thread_cb.tc_malloc_unlock
(d->mutex); } while (0); if (r == ((void*)0) && malloc_readonly
.mopts.malloc_xmalloc) wrterror(d, "out of memory"); if (r !=
 ((void*)0)) (*__errno()) = saved_errno;
return r;
1697}
1698/*DEF_STRONG(realloc);*/

1700/*
* This is sqrt(SIZE_MAX+1), as s1*s2 <= SIZE_MAX
* if both s1 < MUL_NO_OVERFLOW and s2 < MUL_NO_OVERFLOW
*/
1704#define MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4))	(1UL << (sizeof(size_t) * 4))

1706void *
1707calloc(size_t nmemb, size_t size)
1708{
struct dir_info *d;
void *r;
int saved_errno = errno(*__errno());

PROLOGUE(getpool(), "calloc")d = (getpool()); if (d == ((void*)0)) { _malloc_init(0); d = (
getpool()); } do { if (__isthreaded) _thread_cb.tc_malloc_lock
(d->mutex); } while (0); d->func = "calloc"; if (d->
active++) { malloc_recurse(d); return ((void*)0); }
if ((nmemb >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4)) || size >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4))) &&
   nmemb > 0 && SIZE_MAX0xffffffffffffffffUL / nmemb < size) {
d->active--;
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
if (moptsmalloc_readonly.mopts.malloc_xmalloc)
	wrterror(d, "out of memory");
errno(*__errno()) = ENOMEM12;
return NULL((void*)0);
}

size *= nmemb;
r = omalloc(d, size, 1, CALLER((void*)0));
EPILOGUE()d->active--; do { if (__isthreaded) _thread_cb.tc_malloc_unlock
(d->mutex); } while (0); if (r == ((void*)0) && malloc_readonly
.mopts.malloc_xmalloc) wrterror(d, "out of memory"); if (r !=
 ((void*)0)) (*__errno()) = saved_errno;
return r;
1728}
1729/*DEF_STRONG(calloc);*/

1731void *
1732calloc_conceal(size_t nmemb, size_t size)
1733{
struct dir_info *d;
void *r;
int saved_errno = errno(*__errno());

PROLOGUE(mopts.malloc_pool[0], "calloc_conceal")d = (malloc_readonly.mopts.malloc_pool[0]); if (d == ((void*)
0)) { _malloc_init(0); d = (malloc_readonly.mopts.malloc_pool
[0]); } do { if (__isthreaded) _thread_cb.tc_malloc_lock(d->
mutex); } while (0); d->func = "calloc_conceal"; if (d->
active++) { malloc_recurse(d); return ((void*)0); }
if ((nmemb >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4)) || size >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4))) &&
   nmemb > 0 && SIZE_MAX0xffffffffffffffffUL / nmemb < size) {
d->active--;
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
if (moptsmalloc_readonly.mopts.malloc_xmalloc)
	wrterror(d, "out of memory");
errno(*__errno()) = ENOMEM12;
return NULL((void*)0);
}

size *= nmemb;
r = omalloc(d, size, 1, CALLER((void*)0));
EPILOGUE()d->active--; do { if (__isthreaded) _thread_cb.tc_malloc_unlock
(d->mutex); } while (0); if (r == ((void*)0) && malloc_readonly
.mopts.malloc_xmalloc) wrterror(d, "out of memory"); if (r !=
 ((void*)0)) (*__errno()) = saved_errno;
return r;
1753}
1754DEF_WEAK(calloc_conceal)__asm__(".weak " "calloc_conceal" " ; " "calloc_conceal" " = "
 "_libc_calloc_conceal");

1756static void *
1757orecallocarray(struct dir_info **argpool, void *p, size_t oldsize,
  size_t newsize, void *f)
1759{
struct region_info *r;
struct dir_info *pool;
char *saved_function;
16
←
'saved_function' declared without an initial value→
void *newptr;
size_t sz;

if (p16.1
'p' is not equal to NULL
 == NULL((void*)0))
17
←
Taking false branch→
return omalloc(*argpool, newsize, 1, f);

if (oldsize == newsize)
18
←
Assuming 'oldsize' is not equal to 'newsize'→
19
←
Taking false branch→
return p;

r = findpool(p, *argpool, &pool, &saved_function);
20
←
Calling 'findpool'→
23
←
Returning from 'findpool'→

REALSIZE(sz, r)(sz) = (uintptr_t)(r)->p & ((1UL << 12) - 1), (sz
) = ((sz) == 0 ? (r)->size : ((sz) == 1 ? 0 : (1 << (
(sz)-1))));
24
←
Assuming 'sz' is equal to 0→
25
←
'?' condition is true→
if (sz <= MALLOC_MAXCHUNK(1 << (12 - 1))) {
26
←
Assuming the condition is false→
27
←
Taking false branch→
if (moptsmalloc_readonly.mopts.chunk_canaries && sz > 0) {
	struct chunk_info *info = (struct chunk_info *)r->size;
	uint32_t chunknum = find_chunknum(pool, info, p, 0);

	if (info->bits[info->offset + chunknum] != oldsize)
		wrterror(pool, "recorded old size %hu != %zu",
		    info->bits[info->offset + chunknum],
		    oldsize);
}
} else if (oldsize < (sz - moptsmalloc_readonly.mopts.malloc_guard) / 2)
28
←
Assuming the condition is false→
29
←
Taking false branch→
wrterror(pool, "recorded old size %zu != %zu",
    sz - moptsmalloc_readonly.mopts.malloc_guard, oldsize);

newptr = omalloc(pool, newsize, 0, f);
if (newptr == NULL((void*)0))
30
←
Assuming 'newptr' is not equal to NULL→
31
←
Taking false branch→
goto done;

if (newsize > oldsize) {
32
←
Assuming 'newsize' is <= 'oldsize'→
33
←
Taking false branch→
memcpy(newptr, p, oldsize);
memset((char *)newptr + oldsize, 0, newsize - oldsize);
} else
memcpy(newptr, p, newsize);

ofree(&pool, p, 1, 0, oldsize);

1801done:
if (*argpool != pool) {
34
←
Assuming the condition is true→
35
←
Taking true branch→
pool->func = saved_function;
36
←
Assigned value is garbage or undefined
*argpool = pool;
}

return newptr;
1808}

1810static void *
1811recallocarray_p(void *ptr, size_t oldnmemb, size_t newnmemb, size_t size)
1812{
size_t oldsize, newsize;
void *newptr;

if (ptr == NULL((void*)0))
return calloc(newnmemb, size);

if ((newnmemb >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4)) || size >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4))) &&
   newnmemb > 0 && SIZE_MAX0xffffffffffffffffUL / newnmemb < size) {
errno(*__errno()) = ENOMEM12;
return NULL((void*)0);
}
newsize = newnmemb * size;

if ((oldnmemb >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4)) || size >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4))) &&
   oldnmemb > 0 && SIZE_MAX0xffffffffffffffffUL / oldnmemb < size) {
errno(*__errno()) = EINVAL22;
return NULL((void*)0);
}
oldsize = oldnmemb * size;

/*
* Don't bother too much if we're shrinking just a bit,
* we do not shrink for series of small steps, oh well.
*/
if (newsize <= oldsize) {
size_t d = oldsize - newsize;

if (d < oldsize / 2 && d < MALLOC_PAGESIZE(1UL << 12)) {
	memset((char *)ptr + newsize, 0, d);
	return ptr;
}
}

newptr = malloc(newsize);
if (newptr == NULL((void*)0))
return NULL((void*)0);

if (newsize > oldsize) {
memcpy(newptr, ptr, oldsize);
memset((char *)newptr + oldsize, 0, newsize - oldsize);
} else
memcpy(newptr, ptr, newsize);

explicit_bzero(ptr, oldsize);
free(ptr);

return newptr;
1860}

1862void *
1863recallocarray(void *ptr, size_t oldnmemb, size_t newnmemb, size_t size)
1864{
struct dir_info *d;
size_t oldsize = 0, newsize;
void *r;
int saved_errno = errno(*__errno());

if (!moptsmalloc_readonly.mopts.internal_funcs)
1
Assuming field 'internal_funcs' is not equal to 0→
2
←
Taking false branch→
return recallocarray_p(ptr, oldnmemb, newnmemb, size);

PROLOGUE(getpool(), "recallocarray")d = (getpool()); if (d == ((void*)0)) { _malloc_init(0); d = (
getpool()); } do { if (__isthreaded) _thread_cb.tc_malloc_lock
(d->mutex); } while (0); d->func = "recallocarray"; if (
d->active++) { malloc_recurse(d); return ((void*)0); }
3
←
Assuming 'd' is not equal to null→
4
←
Taking false branch→
5
←
Assuming '__isthreaded' is 0→
6
←
Taking false branch→
7
←
Loop condition is false.  Exiting loop→
8
←
Assuming the condition is false→
9
←
Taking false branch→

if ((newnmemb >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4)) || size >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4))) &&
10
←
Assuming the condition is false→
11
←
Assuming the condition is false→
   newnmemb > 0 && SIZE_MAX0xffffffffffffffffUL / newnmemb < size) {
d->active--;
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
if (moptsmalloc_readonly.mopts.malloc_xmalloc)
	wrterror(d, "out of memory");
errno(*__errno()) = ENOMEM12;
return NULL((void*)0);
}
newsize = newnmemb * size;

if (ptr != NULL((void*)0)) {
12
←
Assuming 'ptr' is not equal to NULL→
13
←
Taking true branch→
if ((oldnmemb >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4)) || size >= MUL_NO_OVERFLOW(1UL << (sizeof(size_t) * 4))) &&
14
←
Assuming the condition is false→
    oldnmemb > 0 && SIZE_MAX0xffffffffffffffffUL / oldnmemb < size) {
	d->active--;
	_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
	errno(*__errno()) = EINVAL22;
	return NULL((void*)0);
}
oldsize = oldnmemb * size;
}

r = orecallocarray(&d, ptr, oldsize, newsize, CALLER((void*)0));
15
←
Calling 'orecallocarray'→
EPILOGUE()d->active--; do { if (__isthreaded) _thread_cb.tc_malloc_unlock
(d->mutex); } while (0); if (r == ((void*)0) && malloc_readonly
.mopts.malloc_xmalloc) wrterror(d, "out of memory"); if (r !=
 ((void*)0)) (*__errno()) = saved_errno;
return r;
1900}
1901DEF_WEAK(recallocarray)__asm__(".weak " "recallocarray" " ; " "recallocarray" " = " "_libc_recallocarray"
);

1903static void *
1904mapalign(struct dir_info *d, size_t alignment, size_t sz, int zero_fill)
1905{
char *p, *q;

if (alignment < MALLOC_PAGESIZE(1UL << 12) || ((alignment - 1) & alignment) != 0)
wrterror(d, "mapalign bad alignment");
if (sz != PAGEROUND(sz)(((sz) + (((1UL << 12) - 1))) & ~((1UL << 12)
 - 1)))
wrterror(d, "mapalign round");

/* Allocate sz + alignment bytes of memory, which must include a
* subrange of size bytes that is properly aligned.  Unmap the
* other bytes, and then return that subrange.
*/

/* We need sz + alignment to fit into a size_t. */
if (alignment > SIZE_MAX0xffffffffffffffffUL - sz)
return MAP_FAILED((void *)-1);

p = map(d, sz + alignment, zero_fill);
if (p == MAP_FAILED((void *)-1))
return MAP_FAILED((void *)-1);
q = (char *)(((uintptr_t)p + alignment - 1) & ~(alignment - 1));
if (q != p) {
if (munmap(p, q - p))
	wrterror(d, "munmap %p", p);
}
if (munmap(q + sz, alignment - (q - p)))
wrterror(d, "munmap %p", q + sz);
STATS_SUB(d->malloc_used, alignment);

return q;
1935}

1937static void *
1938omemalign(struct dir_info *pool, size_t alignment, size_t sz, int zero_fill,
  void *f)
1940{
size_t psz;
void *p;

/* If between half a page and a page, avoid MALLOC_MOVE. */
if (sz > MALLOC_MAXCHUNK(1 << (12 - 1)) && sz < MALLOC_PAGESIZE(1UL << 12))
sz = MALLOC_PAGESIZE(1UL << 12);
if (alignment <= MALLOC_PAGESIZE(1UL << 12)) {
/*
 * max(size, alignment) is enough to assure the requested
 * alignment, since the allocator always allocates
 * power-of-two blocks.
 */
if (sz < alignment)
	sz = alignment;
return omalloc(pool, sz, zero_fill, f);
}

if (sz >= SIZE_MAX0xffffffffffffffffUL - moptsmalloc_readonly.mopts.malloc_guard - MALLOC_PAGESIZE(1UL << 12)) {
errno(*__errno()) = ENOMEM12;
return NULL((void*)0);
}

if (sz < MALLOC_PAGESIZE(1UL << 12))
sz = MALLOC_PAGESIZE(1UL << 12);
sz += moptsmalloc_readonly.mopts.malloc_guard;
psz = PAGEROUND(sz)(((sz) + (((1UL << 12) - 1))) & ~((1UL << 12)
 - 1));

p = mapalign(pool, alignment, psz, zero_fill);
if (p == MAP_FAILED((void *)-1)) {
errno(*__errno()) = ENOMEM12;
return NULL((void*)0);
}

if (insert(pool, p, sz, f)) {
unmap(pool, p, psz, 0);
errno(*__errno()) = ENOMEM12;
return NULL((void*)0);
}

if (moptsmalloc_readonly.mopts.malloc_guard) {
if (mprotect((char *)p + psz - moptsmalloc_readonly.mopts.malloc_guard,
    moptsmalloc_readonly.mopts.malloc_guard, PROT_NONE0x00))
	wrterror(pool, "mprotect");
STATS_ADD(pool->malloc_guarded, mopts.malloc_guard);
}

if (pool->malloc_junk == 2) {
if (zero_fill)
	memset((char *)p + sz - moptsmalloc_readonly.mopts.malloc_guard,
	    SOME_JUNK0xdb, psz - sz);
else
	memset(p, SOME_JUNK0xdb, psz - moptsmalloc_readonly.mopts.malloc_guard);
} else if (moptsmalloc_readonly.mopts.chunk_canaries)
fill_canary(p, sz - moptsmalloc_readonly.mopts.malloc_guard,
    psz - moptsmalloc_readonly.mopts.malloc_guard);

return p;
1998}

2000int
2001posix_memalign(void **memptr, size_t alignment, size_t size)
2002{
struct dir_info *d;
int res, saved_errno = errno(*__errno());
void *r;

/* Make sure that alignment is a large enough power of 2. */
if (((alignment - 1) & alignment) != 0 || alignment < sizeof(void *))
return EINVAL22;

d = getpool();
if (d == NULL((void*)0)) {
_malloc_init(0);
d = getpool();
}
_MALLOC_LOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_lock(d->mutex)
; } while (0);
d->func = "posix_memalign";
if (d->active++) {
malloc_recurse(d);
goto err;
}
r = omemalign(d, alignment, size, 0, CALLER((void*)0));
d->active--;
_MALLOC_UNLOCK(d->mutex)do { if (__isthreaded) _thread_cb.tc_malloc_unlock(d->mutex
); } while (0);
if (r == NULL((void*)0)) {
if (moptsmalloc_readonly.mopts.malloc_xmalloc)
	wrterror(d, "out of memory");
goto err;
}
errno(*__errno()) = saved_errno;
*memptr = r;
return 0;

2034err:
res = errno(*__errno());
errno(*__errno()) = saved_errno;
return res;
2038}
2039/*DEF_STRONG(posix_memalign);*/

2041void *
2042aligned_alloc(size_t alignment, size_t size)
2043{
struct dir_info *d;
int saved_errno = errno(*__errno());
void *r;

/* Make sure that alignment is a positive power of 2. */
if (((alignment - 1) & alignment) != 0 || alignment == 0) {
errno(*__errno()) = EINVAL22;
return NULL((void*)0);
};
/* Per spec, size should be a multiple of alignment */
if ((size & (alignment - 1)) != 0) {
errno(*__errno()) = EINVAL22;
return NULL((void*)0);
}

PROLOGUE(getpool(), "aligned_alloc")d = (getpool()); if (d == ((void*)0)) { _malloc_init(0); d = (
getpool()); } do { if (__isthreaded) _thread_cb.tc_malloc_lock
(d->mutex); } while (0); d->func = "aligned_alloc"; if (
d->active++) { malloc_recurse(d); return ((void*)0); }
r = omemalign(d, alignment, size, 0, CALLER((void*)0));
EPILOGUE()d->active--; do { if (__isthreaded) _thread_cb.tc_malloc_unlock
(d->mutex); } while (0); if (r == ((void*)0) && malloc_readonly
.mopts.malloc_xmalloc) wrterror(d, "out of memory"); if (r !=
 ((void*)0)) (*__errno()) = saved_errno;
return r;
2063}
2064/*DEF_STRONG(aligned_alloc);*/

2066#ifdef MALLOC_STATS

2068struct malloc_leak {
void *f;
size_t total_size;
int count;
2072};

2074struct leaknode {
RBT_ENTRY(leaknode) entry;
struct malloc_leak d;
2077};

2079static inline int
2080leakcmp(const struct leaknode *e1, const struct leaknode *e2)
2081{
return e1->d.f < e2->d.f ? -1 : e1->d.f > e2->d.f;
2083}

2085static RBT_HEAD(leaktree, leaknode) leakhead;
2086RBT_PROTOTYPE(leaktree, leaknode, entry, leakcmp);
2087RBT_GENERATE(leaktree, leaknode, entry, leakcmp);

2089static void
2090putleakinfo(void *f, size_t sz, int cnt)
2091{
struct leaknode key, *p;
static struct leaknode *page;
static int used;

if (cnt == 0 || page == MAP_FAILED((void *)-1))
return;

key.d.f = f;
p = RBT_FIND(leaktree, &leakhead, &key);
if (p == NULL((void*)0)) {
if (page == NULL((void*)0) ||
    used >= MALLOC_PAGESIZE(1UL << 12) / sizeof(struct leaknode)) {
	page = MMAP(MALLOC_PAGESIZE, 0)mmap(((void*)0), ((1UL << 12)), 0x01 | 0x02, 0x1000 | 0x0002
 | (0), -1, 0);
	if (page == MAP_FAILED((void *)-1))
		return;
	used = 0;
}
p = &page[used++];
p->d.f = f;
p->d.total_size = sz * cnt;
p->d.count = cnt;
RBT_INSERT(leaktree, &leakhead, p);
} else {
p->d.total_size += sz * cnt;
p->d.count += cnt;
}
2118}

2120static struct malloc_leak *malloc_leaks;

2122static void
2123dump_leaks(int fd)
2124{
struct leaknode *p;
int i = 0;

dprintf(fd, "Leak report\n");
dprintf(fd, "                 f     sum      #    avg\n");
/* XXX only one page of summary */
if (malloc_leaks == NULL((void*)0))
malloc_leaks = MMAP(MALLOC_PAGESIZE, 0)mmap(((void*)0), ((1UL << 12)), 0x01 | 0x02, 0x1000 | 0x0002
 | (0), -1, 0);
if (malloc_leaks != MAP_FAILED((void *)-1))
memset(malloc_leaks, 0, MALLOC_PAGESIZE(1UL << 12));
RBT_FOREACH(p, leaktree, &leakhead) {
dprintf(fd, "%18p %7zu %6u %6zu\n", p->d.f,
    p->d.total_size, p->d.count, p->d.total_size / p->d.count);
if (malloc_leaks == MAP_FAILED((void *)-1) ||
    i >= MALLOC_PAGESIZE(1UL << 12) / sizeof(struct malloc_leak))
	continue;
malloc_leaks[i].f = p->d.f;
malloc_leaks[i].total_size = p->d.total_size;
malloc_leaks[i].count = p->d.count;
i++;
}
2146}

2148static void
2149dump_chunk(int fd, struct chunk_info *p, void *f, int fromfreelist)
2150{
while (p != NULL((void*)0)) {
dprintf(fd, "chunk %18p %18p %4d %d/%d\n",
    p->page, ((p->bits[0] & 1) ? NULL((void*)0) : f),
    p->size, p->free, p->total);
if (!fromfreelist) {
	if (p->bits[0] & 1)
		putleakinfo(NULL((void*)0), p->size, p->total - p->free);
	else {
		putleakinfo(f, p->size, 1);
		putleakinfo(NULL((void*)0), p->size,
		    p->total - p->free - 1);
	}
	break;
}
p = LIST_NEXT(p, entries)((p)->entries.le_next);
if (p != NULL((void*)0))
	dprintf(fd, "        ");
}
2169}

2171static void
2172dump_free_chunk_info(int fd, struct dir_info *d)
2173{
int i, j, count;
struct chunk_info *p;

dprintf(fd, "Free chunk structs:\n");
for (i = 0; i <= MALLOC_MAXSHIFT(12 - 1); i++) {
count = 0;
LIST_FOREACH(p, &d->chunk_info_list[i], entries)for((p) = ((&d->chunk_info_list[i])->lh_first); (p)
!= ((void*)0); (p) = ((p)->entries.le_next))
	count++;
for (j = 0; j < MALLOC_CHUNK_LISTS4; j++) {
	p = LIST_FIRST(&d->chunk_dir[i][j])((&d->chunk_dir[i][j])->lh_first);
	if (p == NULL((void*)0) && count == 0)
		continue;
	dprintf(fd, "%2d) %3d ", i, count);
	if (p != NULL((void*)0))
		dump_chunk(fd, p, NULL((void*)0), 1);
	else
		dprintf(fd, "\n");
}
}

2194}

2196static void
2197dump_free_page_info(int fd, struct dir_info *d)
2198{
struct cache *cache;
size_t i, total = 0;

dprintf(fd, "Cached:\n");
for (i = 0; i < MAX_CACHEABLE_SIZE32; i++) {
cache = &d->cache[i];
if (cache->length != 0)
	dprintf(fd, "%zu(%u): %u = %zu\n", i + 1, cache->max, cache->length, cache->length * (i + 1));
total += cache->length * (i + 1);
}
dprintf(fd, "Free pages cached: %zu\n", total);
2210}

2212static void
2213malloc_dump1(int fd, int poolno, struct dir_info *d)
2214{
size_t i, realsize;

dprintf(fd, "Malloc dir of %s pool %d at %p\n", __progname, poolno, d);
if (d == NULL((void*)0))
return;
dprintf(fd, "J=%d Fl=%x\n", d->malloc_junk, d->mmap_flag);
dprintf(fd, "Region slots free %zu/%zu\n",
d->regions_free, d->regions_total);
dprintf(fd, "Finds %zu/%zu\n", d->finds, d->find_collisions);
dprintf(fd, "Inserts %zu/%zu\n", d->inserts, d->insert_collisions);
dprintf(fd, "Deletes %zu/%zu\n", d->deletes, d->delete_moves);
dprintf(fd, "Cheap reallocs %zu/%zu\n",
   d->cheap_reallocs, d->cheap_realloc_tries);
dprintf(fd, "Other pool searches %zu/%zu\n",
   d->other_pool, d->pool_searches);
dprintf(fd, "In use %zu\n", d->malloc_used);
dprintf(fd, "Guarded %zu\n", d->malloc_guarded);
dump_free_chunk_info(fd, d);
dump_free_page_info(fd, d);
dprintf(fd,
   "slot)  hash d  type               page                  f size [free/n]\n");
for (i = 0; i < d->regions_total; i++) {
if (d->r[i].p != NULL((void*)0)) {
	size_t h = hash(d->r[i].p) &
	    (d->regions_total - 1);
	dprintf(fd, "%4zx) #%4zx %zd ",
	    i, h, h - i);
	REALSIZE(realsize, &d->r[i])(realsize) = (uintptr_t)(&d->r[i])->p & ((1UL <<
 12) - 1), (realsize) = ((realsize) == 0 ? (&d->r[i])->
size : ((realsize) == 1 ? 0 : (1 << ((realsize)-1))));
	if (realsize > MALLOC_MAXCHUNK(1 << (12 - 1))) {
		putleakinfo(d->r[i].f, realsize, 1);
		dprintf(fd,
		    "pages %18p %18p %zu\n", d->r[i].p,
		    d->r[i].f, realsize);
	} else
		dump_chunk(fd,
		    (struct chunk_info *)d->r[i].size,
		    d->r[i].f, 0);
}
}
dump_leaks(fd);
dprintf(fd, "\n");
2256}

2258void
2259malloc_dump(int fd, int poolno, struct dir_info *pool)
2260{
int i;
void *p;
struct region_info *r;
int saved_errno = errno(*__errno());

if (pool == NULL((void*)0))
return;
for (i = 0; i < MALLOC_DELAYED_CHUNK_MASK15 + 1; i++) {
p = pool->delayed_chunks[i];
if (p == NULL((void*)0))
	continue;
r = find(pool, p);
if (r == NULL((void*)0))
	wrterror(pool, "bogus pointer in malloc_dump %p", p);
free_bytes(pool, r, p);
pool->delayed_chunks[i] = NULL((void*)0);
}
/* XXX leak when run multiple times */
RBT_INIT(leaktree, &leakhead);
malloc_dump1(fd, poolno, pool);
errno(*__errno()) = saved_errno;
2282}
2283DEF_WEAK(malloc_dump)__asm__(".weak " "malloc_dump" " ; " "malloc_dump" " = " "_libc_malloc_dump"
);

2285void
2286malloc_gdump(int fd)
2287{
int i;
int saved_errno = errno(*__errno());

for (i = 0; i < moptsmalloc_readonly.mopts.malloc_mutexes; i++)
malloc_dump(fd, i, moptsmalloc_readonly.mopts.malloc_pool[i]);

errno(*__errno()) = saved_errno;
2295}
2296DEF_WEAK(malloc_gdump)__asm__(".weak " "malloc_gdump" " ; " "malloc_gdump" " = " "_libc_malloc_gdump"
);

2298static void
2299malloc_exit(void)
2300{
int save_errno = errno(*__errno()), fd, i;

fd = open("malloc.out", O_RDWR|O_APPEND);
if (fd != -1) {
dprintf(fd, "******** Start dump %s *******\n", __progname);
dprintf(fd,
    "MT=%d M=%u I=%d F=%d U=%d J=%d R=%d X=%d C=%d cache=%u G=%zu\n",
    moptsmalloc_readonly.mopts.malloc_mt, moptsmalloc_readonly.mopts.malloc_mutexes,
    moptsmalloc_readonly.mopts.internal_funcs, moptsmalloc_readonly.mopts.malloc_freecheck,
    moptsmalloc_readonly.mopts.malloc_freeunmap, moptsmalloc_readonly.mopts.def_malloc_junk,
    moptsmalloc_readonly.mopts.malloc_realloc, moptsmalloc_readonly.mopts.malloc_xmalloc,
    moptsmalloc_readonly.mopts.chunk_canaries, moptsmalloc_readonly.mopts.def_maxcache,
    moptsmalloc_readonly.mopts.malloc_guard);

for (i = 0; i < moptsmalloc_readonly.mopts.malloc_mutexes; i++)
	malloc_dump(fd, i, moptsmalloc_readonly.mopts.malloc_pool[i]);
dprintf(fd, "******** End dump %s *******\n", __progname);
close(fd);
} else
dprintf(STDERR_FILENO2,
    "malloc() warning: Couldn't dump stats\n");
errno(*__errno()) = save_errno;
2323}

2325#endif /* MALLOC_STATS */