422 malloc(uint nbytes)  in malloc()  argument
443 	nbytes += ALIGNSIZ;  in malloc()
444 	if (nbytes < SMALLEST_BLK) {  in malloc()
445 		nbytes = SMALLEST_BLK;  in malloc()
447 		nbytes = roundup(nbytes, ALIGNSIZ);  in malloc()
455 	if (weight(_root) < nbytes) {  in malloc()
459 		if(!morecore(nbytes))  in malloc()
476 	while (left_weight >= nbytes || right_weight >= nbytes) {  in malloc()
478 			if (left_weight >= nbytes) {  in malloc()
486 			if (right_weight >= nbytes) {  in malloc()
504 	if (allocp->size - nbytes <= SMALLEST_BLK) {  in malloc()
521 		nblk = nextblk(retblk, nbytes);		/* ^next block */  in malloc()
522 		nblk->size =  allocp->size = retblk->size - nbytes;   in malloc()
537 		retblk->size = nbytes;  in malloc()
542 	if (nbytes < __mallinfo.mxfast)  in malloc()
566 	uint 	 nbytes;	/* Size of node to be released */  in free()  local
605 	nbytes = oldblk->size;  in free()
606 	if (badblksize(oldblk,nbytes)) {  in free()
608 			(int)nbytes, (int)oldblk );  in free()
613 	__mallinfo.uordbytes -= nbytes;		/* bytes allocated */  in free()
626 			Dblk nblk = nextblk(oldblk,nbytes);  in free()
631 				nbytes += neighbor_size;  in free()
657 				nbytes += neighbor_size;  in free()
693 	insert( oldblk, nbytes );  in free()
753 realloc(ptr_t ptr, uint nbytes)  in realloc()  argument
769 		return (malloc(nbytes));  in realloc()
814 	newsize = nbytes + ALIGNSIZ;		/* add size of a length word */  in realloc()
902 	ptr = malloc(nbytes);  in realloc()
1112 morecore(uint nbytes)  in morecore()  argument
1127 	nbytes = roundup(nbytes, nbpg);  in morecore()
1128 	p = (Dblk) sbrk((int)nbytes);  in morecore()
1135 	_ubound = (char *) p + nbytes;  in morecore()
1136 	p->size = nbytes;  in morecore()
1140 	__mallinfo.uordbytes += nbytes;  in morecore()
1427 	int nbytes;  in error()  local
1435 		nbytes = vsprintf(stderrbuf, fmt, ap);  in error()
1437 		stderrbuf[nbytes++] = '\n';  in error()
1438 		stderrbuf[nbytes] = '\0';  in error()
1439 		write(fileno(stderr), stderrbuf, nbytes);  in error()