2 * This module derived from code donated to the FreeBSD Project by
3 * Matthew Dillon <dillon@backplane.com>
5 * Copyright (c) 1998 The FreeBSD Project
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * $FreeBSD: src/lib/libstand/zalloc_malloc.c,v 1.5 1999/08/28 00:05:35 peter Exp $
30 * $DragonFly: src/lib/libstand/zalloc_malloc.c,v 1.2 2003/06/17 04:26:51 dillon Exp $
34 * MALLOC.C - malloc equivalent, runs on top of zalloc and uses sbrk
37 #include "zalloc_defs.h"
39 static MemPool MallocPool;
43 static int MallocCount;
45 void mallocstats(void);
55 free_region(void *start, void *end)
57 zextendPool(&MallocPool, start, (caddr_t)end - (caddr_t)start);
58 zfree(&MallocPool, start, (caddr_t)end - (caddr_t)start);
68 bytes += MALLOCALIGN + 1;
73 while ((res = znalloc(&MallocPool, bytes)) == NULL) {
74 int incr = (bytes + BLKEXTENDMASK) & ~BLKEXTENDMASK;
77 if ((base = sbrk(incr)) == (char *)-1)
79 zextendPool(&MallocPool, base, incr);
80 zfree(&MallocPool, base, incr);
83 if (++MallocCount > MallocMax)
84 MallocMax = MallocCount;
87 res->ga_Magic = GAMAGIC;
89 res->ga_Bytes = bytes;
91 *((char *)res + bytes - 1) = -2;
93 return((char *)res + MALLOCALIGN);
102 Guard *res = (void *)((char *)ptr - MALLOCALIGN);
105 if (res->ga_Magic != GAMAGIC)
106 panic("free: guard1 fail @ %p", ptr);
110 if (*((char *)res + res->ga_Bytes - 1) != -2)
111 panic("free: guard2 fail @ %p + %d", ptr, res->ga_Bytes - MALLOCALIGN);
112 *((char *)res + res->ga_Bytes - 1) = -1;
115 bytes = res->ga_Bytes;
116 zfree(&MallocPool, res, bytes);
125 calloc(size_t n1, size_t n2)
127 iaddr_t bytes = (iaddr_t)n1 * (iaddr_t)n2;
130 if ((res = malloc(bytes)) != NULL) {
133 if (++MallocCount > MallocMax)
134 MallocMax = MallocCount;
141 * realloc() - I could be fancier here and free the old buffer before
142 * allocating the new one (saving potential fragmentation
143 * and potential buffer copies). But I don't bother.
147 realloc(void *ptr, size_t size)
152 if ((res = malloc(size)) != NULL) {
154 old = *(size_t *)((char *)ptr - MALLOCALIGN) - MALLOCALIGN;
156 bcopy(ptr, res, old);
158 bcopy(ptr, res, size);
162 if (++MallocCount > MallocMax)
163 MallocMax = MallocCount;
165 if (DidAtExit == 0) {
177 reallocf(void *ptr, size_t size)
181 if ((res = realloc(ptr, size)) == NULL)
191 printf("Active Allocations: %d/%d\n", MallocCount, MallocMax);
193 zallocstats(&MallocPool);