65 static	TREE	*Root;		/* root of the free tree */
66 static	TREE	*Bottom;	/* the last free chunk in the arena */
69 static	void	t_delete(TREE *);
70 static	void	t_splay(TREE *);
74 static	TREE	*morecore(size_t);
76 static	void	protect(TREE *);
77 static	void	unprotect(TREE *);
92 copy_pattern(int pat, TREE *tp)  in copy_pattern()
106 static	TREE	*List[MINSIZE/WORDSIZE-1];
107 static	TREE	*Last[MINSIZE/WORDSIZE-1];
115 	TREE	*tp;  in smalloc()
127 		TREE	*np;  in smalloc()
177 	TREE	*tp, *sp, *tmp;  in malloc_unlocked()
289 	TREE	*tp, *np;  in realloc()
353 			TREE *tmp;  in realloc()
482 	TREE	*tp, *sp, *np, *tmp;  in realfree()
634 static TREE *
637 	TREE	*tp;  in morecore()
725 	tp = ((TREE *)addr);  in morecore()
747 in_list(TREE *tp, TREE **npp)  in in_list()
749 	TREE *sp;  in in_list()
764 LEFT1(TREE *x, TREE *y)  in LEFT1()
766 	TREE *node[3];  in LEFT1()
767 	TREE **npp = node;  in LEFT1()
768 	TREE *tp;  in LEFT1()
792 RIGHT1(TREE *x, TREE *y)  in RIGHT1()
794 	TREE *node[3];  in RIGHT1()
795 	TREE **npp = node;  in RIGHT1()
796 	TREE *tp;  in RIGHT1()
820 BULEFT2(TREE *x, TREE *y, TREE *z)  in BULEFT2()
822 	TREE *node[4];  in BULEFT2()
823 	TREE **npp = node;  in BULEFT2()
824 	TREE *tp;  in BULEFT2()
854 BURIGHT2(TREE *x, TREE *y, TREE *z)  in BURIGHT2()
856 	TREE *node[4];  in BURIGHT2()
857 	TREE **npp = node;  in BURIGHT2()
858 	TREE *tp;  in BURIGHT2()
888 TDLEFT2(TREE *x, TREE *y, TREE *z)  in TDLEFT2()
890 	TREE *node[3];  in TDLEFT2()
891 	TREE **npp = node;  in TDLEFT2()
892 	TREE *tp;  in TDLEFT2()
917 TDRIGHT2(TREE *x, TREE *y, TREE *z)
919 	TREE *node[3];
920 	TREE **npp = node;
921 	TREE *tp;
949 t_delete(TREE *op)  in t_delete()
951 	TREE *tp, *sp, *gp;  in t_delete()
1037 t_splay(TREE *tp)  in t_splay()
1039 	TREE *pp, *gp;  in t_splay()
1115 #define	nextblk(p, size)	((TREE *)((char *)(p) + (size)))
1121 	TREE	*p;		/* Ptr returned from malloc() */  in memalign()
1122 	TREE	*blk;		/* For addressing fragment blocks */  in memalign()
1124 	TREE	*alignedp;	/* Ptr to properly aligned boundary */  in memalign()
1125 	TREE	*aligned_blk;	/* The block to be returned */  in memalign()
1166 	p = (TREE *) malloc(reqsize);  in memalign()
1167 	if (p == (TREE *) NULL) {  in memalign()
1188 	alignedp = (TREE *)x;  in memalign()
1404 protect(TREE *tp)  in protect()
1428 unprotect(TREE *tp)  in unprotect()