1 /* $OpenBSD: alloc.c,v 1.10 2009/10/27 23:59:21 deraadt Exp $ */ 2 /* $NetBSD: alloc.c,v 1.6 1995/03/21 09:02:23 cgd Exp $ */ 3 4 /*- 5 * Copyright (c) 1983, 1991, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 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. 16 * 3. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33 #include <sys/types.h> 34 #include <unistd.h> 35 #include <stdlib.h> 36 #include <stdarg.h> 37 38 #include "csh.h" 39 #include "extern.h" 40 41 char *memtop = NULL; /* PWP: top of current memory */ 42 char *membot = NULL; /* PWP: bottom of allocatable memory */ 43 44 ptr_t 45 Malloc(size_t n) 46 { 47 ptr_t ptr; 48 49 if (membot == NULL) 50 memtop = membot = sbrk(0); 51 if ((ptr = malloc(n)) == (ptr_t) 0) { 52 child++; 53 stderror(ERR_NOMEM); 54 } 55 return (ptr); 56 } 57 58 ptr_t 59 Realloc(ptr_t p, size_t n) 60 { 61 ptr_t ptr; 62 63 if (membot == NULL) 64 memtop = membot = sbrk(0); 65 if ((ptr = realloc(p, n)) == (ptr_t) 0) { 66 child++; 67 stderror(ERR_NOMEM); 68 } 69 return (ptr); 70 } 71 72 ptr_t 73 Calloc(size_t s, size_t n) 74 { 75 ptr_t ptr; 76 77 if (membot == NULL) 78 memtop = membot = sbrk(0); 79 if ((ptr = calloc(s, n)) == (ptr_t) 0) { 80 child++; 81 stderror(ERR_NOMEM); 82 } 83 84 return (ptr); 85 } 86 87 void 88 Free(ptr_t p) 89 { 90 if (p) 91 free(p); 92 } 93 94 /* 95 * mstats - print out statistics about malloc 96 * 97 * Prints two lines of numbers, one showing the length of the free list 98 * for each size category, the second showing the number of mallocs - 99 * frees for each size category. 100 */ 101 void 102 /*ARGSUSED*/ 103 showall(Char **v, struct command *t) 104 { 105 memtop = (char *) sbrk(0); 106 (void) fprintf(cshout, "Allocated memory from 0x%lx to 0x%lx (%d).\n", 107 (unsigned long) membot, (unsigned long) memtop, (int)(memtop - membot)); 108 } 109