Home | History | Annotate | Line # | Download | only in csh
alloc.c revision 1.5 
      1 /*-
      2  * Copyright (c) 1983, 1991, 1993
      3  *	The Regents of the University of California.  All rights reserved.
      4  *
      5  * Redistribution and use in source and binary forms, with or without
      6  * modification, are permitted provided that the following conditions
      7  * are met:
      8  * 1. Redistributions of source code must retain the above copyright
      9  *    notice, this list of conditions and the following disclaimer.
     10  * 2. Redistributions in binary form must reproduce the above copyright
     11  *    notice, this list of conditions and the following disclaimer in the
     12  *    documentation and/or other materials provided with the distribution.
     13  * 3. All advertising materials mentioning features or use of this software
     14  *    must display the following acknowledgement:
     15  *	This product includes software developed by the University of
     16  *	California, Berkeley and its contributors.
     17  * 4. Neither the name of the University nor the names of its contributors
     18  *    may be used to endorse or promote products derived from this software
     19  *    without specific prior written permission.
     20  *
     21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  * SUCH DAMAGE.
     32  */
     33 
     34 #ifndef lint
     35 /*static char sccsid[] = "from: @(#)alloc.c	8.1 (Berkeley) 5/31/93";*/
     36 static char *rcsid = "$Id: alloc.c,v 1.5 1994/09/21 00:10:24 mycroft Exp $";
     37 #endif /* not lint */
     38 
     39 #include <sys/types.h>
     40 #include <unistd.h>
     41 #include <stdlib.h>
     42 #if __STDC__
     43 # include <stdarg.h>
     44 #else
     45 # include <varargs.h>
     46 #endif
     47 
     48 #include "csh.h"
     49 #include "extern.h"
     50 
     51 char   *memtop = NULL;		/* PWP: top of current memory */
     52 char   *membot = NULL;		/* PWP: bottom of allocatable memory */
     53 
     54 ptr_t
     55 Malloc(n)
     56     size_t  n;
     57 {
     58     ptr_t   ptr;
     59 
     60     if (membot == NULL)
     61 	memtop = membot = sbrk(0);
     62     if ((ptr = malloc(n)) == (ptr_t) 0) {
     63 	child++;
     64 	stderror(ERR_NOMEM);
     65     }
     66     return (ptr);
     67 }
     68 
     69 ptr_t
     70 Realloc(p, n)
     71     ptr_t   p;
     72     size_t  n;
     73 {
     74     ptr_t   ptr;
     75 
     76     if (membot == NULL)
     77 	memtop = membot = sbrk(0);
     78     if ((ptr = realloc(p, n)) == (ptr_t) 0) {
     79 	child++;
     80 	stderror(ERR_NOMEM);
     81     }
     82     return (ptr);
     83 }
     84 
     85 ptr_t
     86 Calloc(s, n)
     87     size_t  s, n;
     88 {
     89     ptr_t   ptr;
     90 
     91     if (membot == NULL)
     92 	memtop = membot = sbrk(0);
     93     if ((ptr = calloc(s, n)) == (ptr_t) 0) {
     94 	child++;
     95 	stderror(ERR_NOMEM);
     96     }
     97 
     98     return (ptr);
     99 }
    100 
    101 void
    102 Free(p)
    103     ptr_t   p;
    104 {
    105     if (p)
    106 	free(p);
    107 }
    108 
    109 /*
    110  * mstats - print out statistics about malloc
    111  *
    112  * Prints two lines of numbers, one showing the length of the free list
    113  * for each size category, the second showing the number of mallocs -
    114  * frees for each size category.
    115  */
    116 void
    117 /*ARGSUSED*/
    118 showall(v, t)
    119     Char **v;
    120     struct command *t;
    121 {
    122     memtop = (char *) sbrk(0);
    123     (void) fprintf(cshout, "Allocated memory from 0x%lx to 0x%lx (%ld).\n",
    124 	    (unsigned long) membot, (unsigned long) memtop, memtop - membot);
    125 }
    126