[p5sagit/p5-mst-13.2.git] / malloc.c

/* $RCSfile: malloc.c,v $$Revision: 4.1 $$Date: 92/08/07 18:24:25 $
 *
 * $Log:	malloc.c,v $
 * Revision 4.1  92/08/07  18:24:25  lwall
 * 
 * Revision 4.0.1.4  92/06/08  14:28:38  lwall
 * patch20: removed implicit int declarations on functions
 * patch20: hash tables now split only if the memory is available to do so
 * patch20: realloc(0, size) now does malloc in case library routines call it
 * 
 * Revision 4.0.1.3  91/11/05  17:57:40  lwall
 * patch11: safe malloc code now integrated into Perl's malloc when possible
 * 
 * Revision 4.0.1.2  91/06/07  11:20:45  lwall
 * patch4: many, many itty-bitty portability fixes
 * 
 * Revision 4.0.1.1  91/04/11  17:48:31  lwall
 * patch1: Configure now figures out malloc ptr type
 * 
 * Revision 4.0  91/03/20  01:28:52  lwall
 * 4.0 baseline.
 * 
 */

#ifndef lint
/*SUPPRESS 592*/
static char sccsid[] = "@(#)malloc.c	4.3 (Berkeley) 9/16/83";

#ifdef DEBUGGING
#define RCHECK
#endif
/*
 * malloc.c (Caltech) 2/21/82
 * Chris Kingsley, kingsley@cit-20.
 *
 * This is a very fast storage allocator.  It allocates blocks of a small 
 * number of different sizes, and keeps free lists of each size.  Blocks that
 * don't exactly fit are passed up to the next larger size.  In this 
 * implementation, the available sizes are 2^n-4 (or 2^n-12) bytes long.
 * This is designed for use in a program that uses vast quantities of memory,
 * but bombs when it runs out. 
 */

#include "EXTERN.h"
#include "perl.h"

static int findbucket();
static int morecore();

/* I don't much care whether these are defined in sys/types.h--LAW */

#define u_char unsigned char
#define u_int unsigned int
#define u_short unsigned short

/*
 * The overhead on a block is at least 4 bytes.  When free, this space
 * contains a pointer to the next free block, and the bottom two bits must
 * be zero.  When in use, the first byte is set to MAGIC, and the second
 * byte is the size index.  The remaining bytes are for alignment.
 * If range checking is enabled and the size of the block fits
 * in two bytes, then the top two bytes hold the size of the requested block
 * plus the range checking words, and the header word MINUS ONE.
 */
union	overhead {
	union	overhead *ov_next;	/* when free */
#if ALIGNBYTES > 4
	double	strut;			/* alignment problems */
#endif
	struct {
		u_char	ovu_magic;	/* magic number */
		u_char	ovu_index;	/* bucket # */
#ifdef RCHECK
		u_short	ovu_size;	/* actual block size */
		u_int	ovu_rmagic;	/* range magic number */
#endif
	} ovu;
#define	ov_magic	ovu.ovu_magic
#define	ov_index	ovu.ovu_index
#define	ov_size		ovu.ovu_size
#define	ov_rmagic	ovu.ovu_rmagic
};

#define	MAGIC		0xff		/* magic # on accounting info */
#define RMAGIC		0x55555555	/* magic # on range info */
#ifdef RCHECK
#define	RSLOP		sizeof (u_int)
#else
#define	RSLOP		0
#endif

/*
 * nextf[i] is the pointer to the next free block of size 2^(i+3).  The
 * smallest allocatable block is 8 bytes.  The overhead information
 * precedes the data area returned to the user.
 */
#define	NBUCKETS 30
static	union overhead *nextf[NBUCKETS];
extern	char *sbrk();

#ifdef MSTATS
/*
 * nmalloc[i] is the difference between the number of mallocs and frees
 * for a given block size.
 */
static	u_int nmalloc[NBUCKETS];
#include <stdio.h>
#endif

#ifdef debug
#define	ASSERT(p)   if (!(p)) botch("p"); else
static void
botch(s)
	char *s;
{

	printf("assertion botched: %s\n", s);
	abort();
}
#else
#define	ASSERT(p)
#endif

Malloc_t
malloc(nbytes)
	register MEM_SIZE nbytes;
{
  	register union overhead *p;
  	register int bucket = 0;
  	register MEM_SIZE shiftr;

#ifdef safemalloc
#ifdef DEBUGGING
	MEM_SIZE size = nbytes;
#endif

#ifdef MSDOS
	if (nbytes > 0xffff) {
		fprintf(stderr, "Allocation too large: %lx\n", (long)nbytes);
		my_exit(1);
	}
#endif /* MSDOS */
#ifdef DEBUGGING
	if ((long)nbytes < 0)
	    croak("panic: malloc");
#endif
#endif /* safemalloc */

	/*
	 * Convert amount of memory requested into
	 * closest block size stored in hash buckets
	 * which satisfies request.  Account for
	 * space used per block for accounting.
	 */
  	nbytes += sizeof (union overhead) + RSLOP;
  	nbytes = (nbytes + 3) &~ 3; 
  	shiftr = (nbytes - 1) >> 2;
	/* apart from this loop, this is O(1) */
  	while (shiftr >>= 1)
  		bucket++;
	/*
	 * If nothing in hash bucket right now,
	 * request more memory from the system.
	 */
  	if (nextf[bucket] == NULL)    
  		morecore(bucket);
  	if ((p = (union overhead *)nextf[bucket]) == NULL) {
#ifdef safemalloc
		if (!nomemok) {
		    fputs("Out of memory!\n", stderr);
		    my_exit(1);
		}
#else
  		return (NULL);
#endif
	}

#ifdef safemalloc
#if !(defined(I286) || defined(atarist))
    DEBUG_m(fprintf(stderr,"0x%x: (%05d) malloc %ld bytes\n",p+1,an++,(long)size));
#else
    DEBUG_m(fprintf(stderr,"0x%lx: (%05d) malloc %ld bytes\n",p+1,an++,(long)size));
#endif
#endif /* safemalloc */

	/* remove from linked list */
#ifdef RCHECK
	if (*((int*)p) & (sizeof(union overhead) - 1))
#if !(defined(I286) || defined(atarist))
	    fprintf(stderr,"Corrupt malloc ptr 0x%x at 0x%x\n",*((int*)p),p);
#else
	    fprintf(stderr,"Corrupt malloc ptr 0x%lx at 0x%lx\n",*((int*)p),p);
#endif
#endif
  	nextf[bucket] = p->ov_next;
	p->ov_magic = MAGIC;
	p->ov_index= bucket;
#ifdef MSTATS
  	nmalloc[bucket]++;
#endif
#ifdef RCHECK
	/*
	 * Record allocated size of block and
	 * bound space with magic numbers.
	 */
  	if (nbytes <= 0x10000)
		p->ov_size = nbytes - 1;
	p->ov_rmagic = RMAGIC;
  	*((u_int *)((caddr_t)p + nbytes - RSLOP)) = RMAGIC;
#endif
  	return ((Malloc_t)(p + 1));
}

/*
 * Allocate more memory to the indicated bucket.
 */
static
morecore(bucket)
	register int bucket;
{
  	register union overhead *op;
  	register int rnu;       /* 2^rnu bytes will be requested */
  	register int nblks;     /* become nblks blocks of the desired size */
	register MEM_SIZE siz;

  	if (nextf[bucket])
  		return;
	/*
	 * Insure memory is allocated
	 * on a page boundary.  Should
	 * make getpageize call?
	 */
#ifndef atarist /* on the atari we dont have to worry about this */
  	op = (union overhead *)sbrk(0);
#ifndef I286
  	if ((int)op & 0x3ff)
  		(void)sbrk(1024 - ((int)op & 0x3ff));
#else
	/* The sbrk(0) call on the I286 always returns the next segment */
#endif
#endif /* atarist */

#if !(defined(I286) || defined(atarist))
	/* take 2k unless the block is bigger than that */
  	rnu = (bucket <= 8) ? 11 : bucket + 3;
#else
	/* take 16k unless the block is bigger than that 
	   (80286s like large segments!), probably good on the atari too */
  	rnu = (bucket <= 11) ? 14 : bucket + 3;
#endif
  	nblks = 1 << (rnu - (bucket + 3));  /* how many blocks to get */
  	if (rnu < bucket)
		rnu = bucket;
	op = (union overhead *)sbrk(1L << rnu);
	/* no more room! */
  	if ((int)op == -1)
  		return;
	/*
	 * Round up to minimum allocation size boundary
	 * and deduct from block count to reflect.
	 */
#ifndef I286
  	if ((int)op & 7) {
  		op = (union overhead *)(((MEM_SIZE)op + 8) &~ 7);
  		nblks--;
  	}
#else
	/* Again, this should always be ok on an 80286 */
#endif
	/*
	 * Add new memory allocated to that on
	 * free list for this hash bucket.
	 */
  	nextf[bucket] = op;
  	siz = 1 << (bucket + 3);
  	while (--nblks > 0) {
		op->ov_next = (union overhead *)((caddr_t)op + siz);
		op = (union overhead *)((caddr_t)op + siz);
  	}
}

void
free(mp)
	Malloc_t mp;
{   
  	register MEM_SIZE size;
	register union overhead *op;
	char *cp = (char*)mp;

#ifdef safemalloc
#if !(defined(I286) || defined(atarist))
	DEBUG_m(fprintf(stderr,"0x%x: (%05d) free\n",cp,an++));
#else
	DEBUG_m(fprintf(stderr,"0x%lx: (%05d) free\n",cp,an++));
#endif
#endif /* safemalloc */

  	if (cp == NULL)
  		return;
	op = (union overhead *)((caddr_t)cp - sizeof (union overhead));
#ifdef debug
  	ASSERT(op->ov_magic == MAGIC);		/* make sure it was in use */
#else
	if (op->ov_magic != MAGIC) {
#ifdef RCHECK
		warn("%s free() ignored",
		    op->ov_rmagic == RMAGIC - 1 ? "Duplicate" : "Bad");
#else
		warn("Bad free() ignored");
#endif
		return;				/* sanity */
	}
#endif
#ifdef RCHECK
  	ASSERT(op->ov_rmagic == RMAGIC);
	if (op->ov_index <= 13)
		ASSERT(*(u_int *)((caddr_t)op + op->ov_size + 1 - RSLOP) == RMAGIC);
	op->ov_rmagic = RMAGIC - 1;
#endif
  	ASSERT(op->ov_index < NBUCKETS);
  	size = op->ov_index;
	op->ov_next = nextf[size];
  	nextf[size] = op;
#ifdef MSTATS
  	nmalloc[size]--;
#endif
}

/*
 * When a program attempts "storage compaction" as mentioned in the
 * old malloc man page, it realloc's an already freed block.  Usually
 * this is the last block it freed; occasionally it might be farther
 * back.  We have to search all the free lists for the block in order
 * to determine its bucket: 1st we make one pass thru the lists
 * checking only the first block in each; if that fails we search
 * ``reall_srchlen'' blocks in each list for a match (the variable
 * is extern so the caller can modify it).  If that fails we just copy
 * however many bytes was given to realloc() and hope it's not huge.
 */
int reall_srchlen = 4;	/* 4 should be plenty, -1 =>'s whole list */

Malloc_t
realloc(mp, nbytes)
	Malloc_t mp; 
	MEM_SIZE nbytes;
{   
  	register MEM_SIZE onb;
	union overhead *op;
  	char *res;
	register int i;
	int was_alloced = 0;
	char *cp = (char*)mp;

#ifdef safemalloc
#ifdef DEBUGGING
	MEM_SIZE size = nbytes;
#endif

#ifdef MSDOS
	if (nbytes > 0xffff) {
		fprintf(stderr, "Reallocation too large: %lx\n", size);
		my_exit(1);
	}
#endif /* MSDOS */
	if (!cp)
		return malloc(nbytes);
#ifdef DEBUGGING
	if ((long)nbytes < 0)
		croak("panic: realloc");
#endif
#endif /* safemalloc */

	op = (union overhead *)((caddr_t)cp - sizeof (union overhead));
	if (op->ov_magic == MAGIC) {
		was_alloced++;
		i = op->ov_index;
	} else {
		/*
		 * Already free, doing "compaction".
		 *
		 * Search for the old block of memory on the
		 * free list.  First, check the most common
		 * case (last element free'd), then (this failing)
		 * the last ``reall_srchlen'' items free'd.
		 * If all lookups fail, then assume the size of
		 * the memory block being realloc'd is the
		 * smallest possible.
		 */
		if ((i = findbucket(op, 1)) < 0 &&
		    (i = findbucket(op, reall_srchlen)) < 0)
			i = 0;
	}
	onb = (1L << (i + 3)) - sizeof (*op) - RSLOP;
	/* avoid the copy if same size block */
	if (was_alloced &&
	    nbytes <= onb && nbytes > (onb >> 1) - sizeof(*op) - RSLOP) {
#ifdef RCHECK
		/*
		 * Record new allocated size of block and
		 * bound space with magic numbers.
		 */
		if (op->ov_index <= 13) {
			/*
			 * Convert amount of memory requested into
			 * closest block size stored in hash buckets
			 * which satisfies request.  Account for
			 * space used per block for accounting.
			 */
			nbytes += sizeof (union overhead) + RSLOP;
			nbytes = (nbytes + 3) &~ 3; 
			op->ov_size = nbytes - 1;
			*((u_int *)((caddr_t)op + nbytes - RSLOP)) = RMAGIC;
		}
#endif
		res = cp;
	}
	else {
		if ((res = (char*)malloc(nbytes)) == NULL)
			return (NULL);
		if (cp != res)			/* common optimization */
			Copy(cp, res, (MEM_SIZE)(nbytes<onb?nbytes:onb), char);
		if (was_alloced)
			free(cp);
	}

#ifdef safemalloc
#ifdef DEBUGGING
#  if !(defined(I286) || defined(atarist))
	if (debug & 128) {
	    fprintf(stderr,"0x%x: (%05d) rfree\n",res,an++);
	    fprintf(stderr,"0x%x: (%05d) realloc %ld bytes\n",res,an++,(long)size);
	}
#  else
	if (debug & 128) {
	    fprintf(stderr,"0x%lx: (%05d) rfree\n",res,an++);
	    fprintf(stderr,"0x%lx: (%05d) realloc %ld bytes\n",res,an++,(long)size);
	}
#  endif
#endif
#endif /* safemalloc */
  	return ((Malloc_t)res);
}

/*
 * Search ``srchlen'' elements of each free list for a block whose
 * header starts at ``freep''.  If srchlen is -1 search the whole list.
 * Return bucket number, or -1 if not found.
 */
static int
findbucket(freep, srchlen)
	union overhead *freep;
	int srchlen;
{
	register union overhead *p;
	register int i, j;

	for (i = 0; i < NBUCKETS; i++) {
		j = 0;
		for (p = nextf[i]; p && j != srchlen; p = p->ov_next) {
			if (p == freep)
				return (i);
			j++;
		}
	}
	return (-1);
}

#ifdef MSTATS
/*
 * mstats - print out statistics about malloc
 * 
 * Prints two lines of numbers, one showing the length of the free list
 * for each size category, the second showing the number of mallocs -
 * frees for each size category.
 */
void
mstats(s)
	char *s;
{
  	register int i, j;
  	register union overhead *p;
  	int totfree = 0,
  	totused = 0;

  	fprintf(stderr, "Memory allocation statistics %s\nfree:\t", s);
  	for (i = 0; i < NBUCKETS; i++) {
  		for (j = 0, p = nextf[i]; p; p = p->ov_next, j++)
  			;
  		fprintf(stderr, " %d", j);
  		totfree += j * (1 << (i + 3));
  	}
  	fprintf(stderr, "\nused:\t");
  	for (i = 0; i < NBUCKETS; i++) {
  		fprintf(stderr, " %d", nmalloc[i]);
  		totused += nmalloc[i] * (1 << (i + 3));
  	}
  	fprintf(stderr, "\n\tTotal in use: %d, total free: %d\n",
	    totused, totfree);
}
#endif
#endif /* lint */
Commit	Line	Data
79072805	1	/* $RCSfile: malloc.c,v $$Revision: 4.1 $$Date: 92/08/07 18:24:25 $
8d063cd8	2	*
8d063cd8	3	* $Log: malloc.c,v $
79072805	4	* Revision 4.1 92/08/07 18:24:25 lwall
79072805	5	*
ee0007ab	6	* Revision 4.0.1.4 92/06/08 14:28:38 lwall
	7	* patch20: removed implicit int declarations on functions
	8	* patch20: hash tables now split only if the memory is available to do so
	9	* patch20: realloc(0, size) now does malloc in case library routines call it
	10	*
45d8adaa	11	* Revision 4.0.1.3 91/11/05 17:57:40 lwall
	12	* patch11: safe malloc code now integrated into Perl's malloc when possible
	13	*
352d5a3a	14	* Revision 4.0.1.2 91/06/07 11:20:45 lwall
	15	* patch4: many, many itty-bitty portability fixes
	16	*
35c8bce7	17	* Revision 4.0.1.1 91/04/11 17:48:31 lwall
	18	* patch1: Configure now figures out malloc ptr type
	19	*
fe14fcc3	20	* Revision 4.0 91/03/20 01:28:52 lwall
fe14fcc3	21	* 4.0 baseline.
8d063cd8	22	*
	23	*/
	24
	25	#ifndef lint
45d8adaa	26	/SUPPRESS 592/
8d063cd8	27	static char sccsid[] = "@(#)malloc.c 4.3 (Berkeley) 9/16/83";
8d063cd8	28
a687059c	29	#ifdef DEBUGGING
8d063cd8	30	#define RCHECK
a687059c	31	#endif
8d063cd8	32	/*
	33	* malloc.c (Caltech) 2/21/82
	34	* Chris Kingsley, kingsley@cit-20.
	35	*
	36	* This is a very fast storage allocator. It allocates blocks of a small
	37	* number of different sizes, and keeps free lists of each size. Blocks that
	38	* don't exactly fit are passed up to the next larger size. In this
	39	* implementation, the available sizes are 2^n-4 (or 2^n-12) bytes long.
	40	* This is designed for use in a program that uses vast quantities of memory,
	41	* but bombs when it runs out.
	42	*/
	43
135863df	44	#include "EXTERN.h"
135863df	45	#include "perl.h"
135863df	46
79072805	47	static int findbucket();
79072805	48	static int morecore();
03a14243	49
135863df	50	/* I don't much care whether these are defined in sys/types.h--LAW */
	51
	52	#define u_char unsigned char
	53	#define u_int unsigned int
	54	#define u_short unsigned short
8d063cd8	55
8d063cd8	56	/*
	57	* The overhead on a block is at least 4 bytes. When free, this space
	58	* contains a pointer to the next free block, and the bottom two bits must
	59	* be zero. When in use, the first byte is set to MAGIC, and the second
	60	* byte is the size index. The remaining bytes are for alignment.
	61	* If range checking is enabled and the size of the block fits
	62	* in two bytes, then the top two bytes hold the size of the requested block
	63	* plus the range checking words, and the header word MINUS ONE.
	64	*/
	65	union overhead {
	66	union overhead ov_next; / when free */
c623bd54	67	#if ALIGNBYTES > 4
c623bd54	68	double strut; /* alignment problems */
a687059c	69	#endif
8d063cd8	70	struct {
	71	u_char ovu_magic; /* magic number */
	72	u_char ovu_index; /* bucket # */
	73	#ifdef RCHECK
	74	u_short ovu_size; /* actual block size */
	75	u_int ovu_rmagic; /* range magic number */
	76	#endif
	77	} ovu;
	78	#define ov_magic ovu.ovu_magic
	79	#define ov_index ovu.ovu_index
	80	#define ov_size ovu.ovu_size
	81	#define ov_rmagic ovu.ovu_rmagic
	82	};
	83
	84	#define MAGIC 0xff /* magic # on accounting info */
	85	#define RMAGIC 0x55555555 /* magic # on range info */
	86	#ifdef RCHECK
	87	#define RSLOP sizeof (u_int)
	88	#else
	89	#define RSLOP 0
	90	#endif
	91
	92	/*
	93	* nextf[i] is the pointer to the next free block of size 2^(i+3). The
	94	* smallest allocatable block is 8 bytes. The overhead information
	95	* precedes the data area returned to the user.
	96	*/
	97	#define NBUCKETS 30
	98	static union overhead *nextf[NBUCKETS];
	99	extern char *sbrk();
	100
	101	#ifdef MSTATS
	102	/*
	103	* nmalloc[i] is the difference between the number of mallocs and frees
	104	* for a given block size.
	105	*/
	106	static u_int nmalloc[NBUCKETS];
	107	#include <stdio.h>
	108	#endif
	109
	110	#ifdef debug
	111	#define ASSERT(p) if (!(p)) botch("p"); else
ee0007ab	112	static void
8d063cd8	113	botch(s)
	114	char *s;
	115	{
	116
	117	printf("assertion botched: %s\n", s);
	118	abort();
	119	}
	120	#else
	121	#define ASSERT(p)
	122	#endif
	123
2304df62	124	Malloc_t
8d063cd8	125	malloc(nbytes)
ee0007ab	126	register MEM_SIZE nbytes;
8d063cd8	127	{
	128	register union overhead *p;
	129	register int bucket = 0;
ee0007ab	130	register MEM_SIZE shiftr;
8d063cd8	131
45d8adaa	132	#ifdef safemalloc
45d8adaa	133	#ifdef DEBUGGING
ee0007ab	134	MEM_SIZE size = nbytes;
45d8adaa	135	#endif
	136
	137	#ifdef MSDOS
	138	if (nbytes > 0xffff) {
ee0007ab	139	fprintf(stderr, "Allocation too large: %lx\n", (long)nbytes);
79072805	140	my_exit(1);
45d8adaa	141	}
	142	#endif /* MSDOS */
	143	#ifdef DEBUGGING
	144	if ((long)nbytes < 0)
463ee0b2	145	croak("panic: malloc");
45d8adaa	146	#endif
	147	#endif /* safemalloc */
	148
8d063cd8	149	/*
	150	* Convert amount of memory requested into
	151	* closest block size stored in hash buckets
	152	* which satisfies request. Account for
	153	* space used per block for accounting.
	154	*/
	155	nbytes += sizeof (union overhead) + RSLOP;
	156	nbytes = (nbytes + 3) &~ 3;
	157	shiftr = (nbytes - 1) >> 2;
	158	/* apart from this loop, this is O(1) */
	159	while (shiftr >>= 1)
	160	bucket++;
	161	/*
	162	* If nothing in hash bucket right now,
	163	* request more memory from the system.
	164	*/
	165	if (nextf[bucket] == NULL)
	166	morecore(bucket);
45d8adaa	167	if ((p = (union overhead *)nextf[bucket]) == NULL) {
45d8adaa	168	#ifdef safemalloc
ee0007ab	169	if (!nomemok) {
ee0007ab	170	fputs("Out of memory!\n", stderr);
79072805	171	my_exit(1);
ee0007ab	172	}
45d8adaa	173	#else
8d063cd8	174	return (NULL);
45d8adaa	175	#endif
	176	}
	177
	178	#ifdef safemalloc
79072805	179	#if !(defined(I286) \|\| defined(atarist))
	180	DEBUG_m(fprintf(stderr,"0x%x: (%05d) malloc %ld bytes\n",p+1,an++,(long)size));
	181	#else
	182	DEBUG_m(fprintf(stderr,"0x%lx: (%05d) malloc %ld bytes\n",p+1,an++,(long)size));
45d8adaa	183	#endif
	184	#endif /* safemalloc */
	185
8d063cd8	186	/* remove from linked list */
bf38876a	187	#ifdef RCHECK
bf38876a	188	if (((int)p) & (sizeof(union overhead) - 1))
ee0007ab	189	#if !(defined(I286) \|\| defined(atarist))
8d063cd8	190	fprintf(stderr,"Corrupt malloc ptr 0x%x at 0x%x\n",((int)p),p);
a687059c	191	#else
	192	fprintf(stderr,"Corrupt malloc ptr 0x%lx at 0x%lx\n",((int)p),p);
	193	#endif
bf38876a	194	#endif
bf38876a	195	nextf[bucket] = p->ov_next;
8d063cd8	196	p->ov_magic = MAGIC;
	197	p->ov_index= bucket;
	198	#ifdef MSTATS
	199	nmalloc[bucket]++;
	200	#endif
	201	#ifdef RCHECK
	202	/*
	203	* Record allocated size of block and
	204	* bound space with magic numbers.
	205	*/
	206	if (nbytes <= 0x10000)
	207	p->ov_size = nbytes - 1;
	208	p->ov_rmagic = RMAGIC;
	209	((u_int )((caddr_t)p + nbytes - RSLOP)) = RMAGIC;
	210	#endif
2304df62	211	return ((Malloc_t)(p + 1));
8d063cd8	212	}
	213
	214	/*
	215	* Allocate more memory to the indicated bucket.
	216	*/
	217	static
	218	morecore(bucket)
a687059c	219	register int bucket;
8d063cd8	220	{
	221	register union overhead *op;
	222	register int rnu; /* 2^rnu bytes will be requested */
	223	register int nblks; /* become nblks blocks of the desired size */
ee0007ab	224	register MEM_SIZE siz;
8d063cd8	225
	226	if (nextf[bucket])
	227	return;
	228	/*
	229	* Insure memory is allocated
	230	* on a page boundary. Should
	231	* make getpageize call?
	232	*/
ee0007ab	233	#ifndef atarist /* on the atari we dont have to worry about this */
8d063cd8	234	op = (union overhead *)sbrk(0);
a687059c	235	#ifndef I286
8d063cd8	236	if ((int)op & 0x3ff)
a687059c	237	(void)sbrk(1024 - ((int)op & 0x3ff));
	238	#else
	239	/* The sbrk(0) call on the I286 always returns the next segment */
	240	#endif
ee0007ab	241	#endif /* atarist */
a687059c	242
ee0007ab	243	#if !(defined(I286) \|\| defined(atarist))
8d063cd8	244	/* take 2k unless the block is bigger than that */
8d063cd8	245	rnu = (bucket <= 8) ? 11 : bucket + 3;
a687059c	246	#else
a687059c	247	/* take 16k unless the block is bigger than that
ee0007ab	248	(80286s like large segments!), probably good on the atari too */
a687059c	249	rnu = (bucket <= 11) ? 14 : bucket + 3;
a687059c	250	#endif
8d063cd8	251	nblks = 1 << (rnu - (bucket + 3)); /* how many blocks to get */
	252	if (rnu < bucket)
	253	rnu = bucket;
ee0007ab	254	op = (union overhead *)sbrk(1L << rnu);
8d063cd8	255	/* no more room! */
	256	if ((int)op == -1)
	257	return;
	258	/*
	259	* Round up to minimum allocation size boundary
	260	* and deduct from block count to reflect.
	261	*/
a687059c	262	#ifndef I286
8d063cd8	263	if ((int)op & 7) {
ee0007ab	264	op = (union overhead *)(((MEM_SIZE)op + 8) &~ 7);
8d063cd8	265	nblks--;
8d063cd8	266	}
a687059c	267	#else
	268	/* Again, this should always be ok on an 80286 */
	269	#endif
8d063cd8	270	/*
	271	* Add new memory allocated to that on
	272	* free list for this hash bucket.
	273	*/
	274	nextf[bucket] = op;
	275	siz = 1 << (bucket + 3);
	276	while (--nblks > 0) {
	277	op->ov_next = (union overhead *)((caddr_t)op + siz);
	278	op = (union overhead *)((caddr_t)op + siz);
	279	}
	280	}
	281
fe14fcc3	282	void
352d5a3a	283	free(mp)
2304df62	284	Malloc_t mp;
8d063cd8	285	{
ee0007ab	286	register MEM_SIZE size;
8d063cd8	287	register union overhead *op;
352d5a3a	288	char cp = (char)mp;
8d063cd8	289
45d8adaa	290	#ifdef safemalloc
79072805	291	#if !(defined(I286) \|\| defined(atarist))
	292	DEBUG_m(fprintf(stderr,"0x%x: (%05d) free\n",cp,an++));
	293	#else
	294	DEBUG_m(fprintf(stderr,"0x%lx: (%05d) free\n",cp,an++));
45d8adaa	295	#endif
	296	#endif /* safemalloc */
	297
8d063cd8	298	if (cp == NULL)
	299	return;
	300	op = (union overhead *)((caddr_t)cp - sizeof (union overhead));
	301	#ifdef debug
	302	ASSERT(op->ov_magic == MAGIC); /* make sure it was in use */
	303	#else
378cc40b	304	if (op->ov_magic != MAGIC) {
8990e307	305	#ifdef RCHECK
a687059c	306	warn("%s free() ignored",
8990e307	307	op->ov_rmagic == RMAGIC - 1 ? "Duplicate" : "Bad");
	308	#else
	309	warn("Bad free() ignored");
	310	#endif
8d063cd8	311	return; /* sanity */
378cc40b	312	}
8d063cd8	313	#endif
	314	#ifdef RCHECK
	315	ASSERT(op->ov_rmagic == RMAGIC);
	316	if (op->ov_index <= 13)
	317	ASSERT((u_int )((caddr_t)op + op->ov_size + 1 - RSLOP) == RMAGIC);
8990e307	318	op->ov_rmagic = RMAGIC - 1;
8d063cd8	319	#endif
	320	ASSERT(op->ov_index < NBUCKETS);
	321	size = op->ov_index;
	322	op->ov_next = nextf[size];
	323	nextf[size] = op;
	324	#ifdef MSTATS
	325	nmalloc[size]--;
	326	#endif
	327	}
	328
	329	/*
	330	* When a program attempts "storage compaction" as mentioned in the
	331	* old malloc man page, it realloc's an already freed block. Usually
	332	* this is the last block it freed; occasionally it might be farther
	333	* back. We have to search all the free lists for the block in order
	334	* to determine its bucket: 1st we make one pass thru the lists
	335	* checking only the first block in each; if that fails we search
378cc40b	336	* ``reall_srchlen'' blocks in each list for a match (the variable
8d063cd8	337	* is extern so the caller can modify it). If that fails we just copy
	338	* however many bytes was given to realloc() and hope it's not huge.
	339	*/
378cc40b	340	int reall_srchlen = 4; /* 4 should be plenty, -1 =>'s whole list */
8d063cd8	341
2304df62	342	Malloc_t
352d5a3a	343	realloc(mp, nbytes)
2304df62	344	Malloc_t mp;
ee0007ab	345	MEM_SIZE nbytes;
8d063cd8	346	{
ee0007ab	347	register MEM_SIZE onb;
8d063cd8	348	union overhead *op;
	349	char *res;
	350	register int i;
	351	int was_alloced = 0;
352d5a3a	352	char cp = (char)mp;
8d063cd8	353
45d8adaa	354	#ifdef safemalloc
45d8adaa	355	#ifdef DEBUGGING
ee0007ab	356	MEM_SIZE size = nbytes;
45d8adaa	357	#endif
	358
	359	#ifdef MSDOS
	360	if (nbytes > 0xffff) {
	361	fprintf(stderr, "Reallocation too large: %lx\n", size);
79072805	362	my_exit(1);
45d8adaa	363	}
	364	#endif /* MSDOS */
	365	if (!cp)
ee0007ab	366	return malloc(nbytes);
45d8adaa	367	#ifdef DEBUGGING
45d8adaa	368	if ((long)nbytes < 0)
463ee0b2	369	croak("panic: realloc");
45d8adaa	370	#endif
	371	#endif /* safemalloc */
	372
8d063cd8	373	op = (union overhead *)((caddr_t)cp - sizeof (union overhead));
	374	if (op->ov_magic == MAGIC) {
	375	was_alloced++;
	376	i = op->ov_index;
	377	} else {
	378	/*
	379	* Already free, doing "compaction".
	380	*
	381	* Search for the old block of memory on the
	382	* free list. First, check the most common
	383	* case (last element free'd), then (this failing)
378cc40b	384	* the last ``reall_srchlen'' items free'd.
8d063cd8	385	* If all lookups fail, then assume the size of
	386	* the memory block being realloc'd is the
	387	* smallest possible.
	388	*/
	389	if ((i = findbucket(op, 1)) < 0 &&
378cc40b	390	(i = findbucket(op, reall_srchlen)) < 0)
8d063cd8	391	i = 0;
8d063cd8	392	}
ee0007ab	393	onb = (1L << (i + 3)) - sizeof (*op) - RSLOP;
8d063cd8	394	/* avoid the copy if same size block */
8d063cd8	395	if (was_alloced &&
a687059c	396	nbytes <= onb && nbytes > (onb >> 1) - sizeof(*op) - RSLOP) {
	397	#ifdef RCHECK
	398	/*
	399	* Record new allocated size of block and
	400	* bound space with magic numbers.
	401	*/
	402	if (op->ov_index <= 13) {
	403	/*
	404	* Convert amount of memory requested into
	405	* closest block size stored in hash buckets
	406	* which satisfies request. Account for
	407	* space used per block for accounting.
	408	*/
	409	nbytes += sizeof (union overhead) + RSLOP;
	410	nbytes = (nbytes + 3) &~ 3;
	411	op->ov_size = nbytes - 1;
	412	((u_int )((caddr_t)op + nbytes - RSLOP)) = RMAGIC;
	413	}
	414	#endif
45d8adaa	415	res = cp;
a687059c	416	}
45d8adaa	417	else {
	418	if ((res = (char*)malloc(nbytes)) == NULL)
	419	return (NULL);
	420	if (cp != res) /* common optimization */
ee0007ab	421	Copy(cp, res, (MEM_SIZE)(nbytes<onb?nbytes:onb), char);
45d8adaa	422	if (was_alloced)
	423	free(cp);
	424	}
	425
	426	#ifdef safemalloc
	427	#ifdef DEBUGGING
ee0007ab	428	# if !(defined(I286) \|\| defined(atarist))
45d8adaa	429	if (debug & 128) {
45d8adaa	430	fprintf(stderr,"0x%x: (%05d) rfree\n",res,an++);
ee0007ab	431	fprintf(stderr,"0x%x: (%05d) realloc %ld bytes\n",res,an++,(long)size);
45d8adaa	432	}
	433	# else
	434	if (debug & 128) {
	435	fprintf(stderr,"0x%lx: (%05d) rfree\n",res,an++);
ee0007ab	436	fprintf(stderr,"0x%lx: (%05d) realloc %ld bytes\n",res,an++,(long)size);
45d8adaa	437	}
	438	# endif
	439	#endif
	440	#endif /* safemalloc */
2304df62	441	return ((Malloc_t)res);
8d063cd8	442	}
	443
	444	/*
	445	* Search ``srchlen'' elements of each free list for a block whose
	446	* header starts at ``freep''. If srchlen is -1 search the whole list.
	447	* Return bucket number, or -1 if not found.
	448	*/
ee0007ab	449	static int
8d063cd8	450	findbucket(freep, srchlen)
	451	union overhead *freep;
	452	int srchlen;
	453	{
	454	register union overhead *p;
	455	register int i, j;
	456
	457	for (i = 0; i < NBUCKETS; i++) {
	458	j = 0;
	459	for (p = nextf[i]; p && j != srchlen; p = p->ov_next) {
	460	if (p == freep)
	461	return (i);
	462	j++;
	463	}
	464	}
	465	return (-1);
	466	}
	467
	468	#ifdef MSTATS
	469	/*
	470	* mstats - print out statistics about malloc
	471	*
	472	* Prints two lines of numbers, one showing the length of the free list
	473	* for each size category, the second showing the number of mallocs -
	474	* frees for each size category.
	475	*/
ee0007ab	476	void
8d063cd8	477	mstats(s)
	478	char *s;
	479	{
	480	register int i, j;
	481	register union overhead *p;
	482	int totfree = 0,
	483	totused = 0;
	484
	485	fprintf(stderr, "Memory allocation statistics %s\nfree:\t", s);
	486	for (i = 0; i < NBUCKETS; i++) {
	487	for (j = 0, p = nextf[i]; p; p = p->ov_next, j++)
	488	;
	489	fprintf(stderr, " %d", j);
	490	totfree += j * (1 << (i + 3));
	491	}
	492	fprintf(stderr, "\nused:\t");
	493	for (i = 0; i < NBUCKETS; i++) {
	494	fprintf(stderr, " %d", nmalloc[i]);
	495	totused += nmalloc[i] * (1 << (i + 3));
	496	}
	497	fprintf(stderr, "\n\tTotal in use: %d, total free: %d\n",
	498	totused, totfree);
	499	}
	500	#endif
a687059c	501	#endif /* lint */