33  *	The following #-parameters may be redefined:
38  *		Default is ((char *)(-1)).
43  *	free elts maintained in a self-adjusting binary tree. Each list
45  *	For results on self-adjusting trees, see the paper:
46  *		Self-Adjusting Binary Trees,
74 static	void	protect(TREE *);
97 	while (sz--)  in copy_pattern()
104 static	TREE	*List[MINSIZE/WORDSIZE-1];
105 static	TREE	*Last[MINSIZE/WORDSIZE-1];
122 	i = size / WORDSIZE - 1;  in smalloc()
138 			if (n == NPS - 1) {  in smalloc()
146 			protect(tp);  in smalloc()
157 	protect(tp);  in smalloc()
205 					protect(tp);  in malloc_unlocked()
208 					protect(tp);  in malloc_unlocked()
213 					protect(tp);  in malloc_unlocked()
216 					protect(tp);  in malloc_unlocked()
226 			/* make the searched-to element the root */  in malloc_unlocked()
229 			protect(tp);  in malloc_unlocked()
242 				protect(Bottom);  in malloc_unlocked()
258 	protect(tmp);  in malloc_unlocked()
262 	if ((n = (SIZE(sp) - size)) >= MINSIZE + WORDSIZE) {  in malloc_unlocked()
263 		n -= WORDSIZE;  in malloc_unlocked()
275 	protect(sp);  in malloc_unlocked()
282  *	This is not best-fit but it avoids some data recopying.
318 		protect(tp);  in realloc()
327 		protect(tp);  in realloc()
349 			protect(np);  in realloc()
363 			protect(tmp);  in realloc()
369 			protect(Bottom);  in realloc()
382 		if ((n = (SIZE(tp) - size)) >= MINSIZE + WORDSIZE) {  in realloc()
383 			n -= WORDSIZE;  in realloc()
394 		protect(tp);  in realloc()
432 			protect(tp);  in realloc()
458 		protect(np);  in realloc()
461 	protect(tp);  in realloc()
470  *	Then, the new free block is leaf-inserted into the free tree
491 		protect(tp);	/* force a watchpoint trap */  in realfree()
501 		ts = SIZE(tp) / WORDSIZE - 1;  in realfree()
503 		protect(tp);  in realfree()
511 			protect(sp);  in realfree()
522 		protect(np);  in realfree()
555 						protect(np);  in realfree()
560 						protect(np);  in realfree()
565 						protect(np);  in realfree()
570 						protect(np);  in realfree()
581 						protect(sp);  in realfree()
589 						protect(sp);  in realfree()
596 						protect(sp);  in realfree()
604 					protect(np);  in realfree()
625 	protect(tmp);  in realfree()
626 	protect(tp);  in realfree()
650 		offset = ALIGN - (size_t)addr % ALIGN;  in morecore()
659 		n -= WORDSIZE;  in morecore()
661 			n -= SIZE(tp);  in morecore()
665 	n = ((n - 1) / CORESIZE + 1) * CORESIZE;  in morecore()
669 	if (requestsize > MAX_MALLOC - (size_t)addr) {  in morecore()
671 			protect(tp);  in morecore()
682 		 * If not, GETCORE(-MAX_GETCORE) will not return brk point  in morecore()
690 					protect(tp);  in morecore()
692 					(void) GETCORE(-MAX_GETCORE);  in morecore()
695 			requestsize -= MAX_GETCORE;  in morecore()
700 			protect(tp);  in morecore()
711 			addr = Baddr - WORDSIZE;  in morecore()
724 	SIZE(tp) = n - 2 * WORDSIZE;  in morecore()
731 	/* non-contiguous memory, free old bottom block */  in morecore()
742  * Return true if tp is in the NULL-terminated array of tree nodes.
756  * Tree rotation functions (BU: bottom-up, TD: top-down).
759  * that have been unprotected during the operation re-protected.
786 			protect(tp);  in LEFT1()
814 			protect(tp);  in RIGHT1()
848 			protect(tp);  in BULEFT2()
882 			protect(tp);  in BURIGHT2()
910 			protect(tp);  in TDLEFT2()
939 			protect(tp);
951 	/* if this is a non-tree node */  in t_delete()
958 			protect(sp);  in t_delete()
961 		protect(tp);  in t_delete()
976 			protect(sp);  in t_delete()
983 			protect(sp);  in t_delete()
988 		protect(tp);  in t_delete()
992 	/* if op has a non-null left subtree */  in t_delete()
997 			/* make the right-end of the left subtree its root */  in t_delete()
1003 					protect(sp);  in t_delete()
1004 					protect(tp);  in t_delete()
1008 					protect(tp);  in t_delete()
1017 			protect(sp);  in t_delete()
1019 		protect(tp);  in t_delete()
1023 		protect(tp);  in t_delete()
1051 				protect(gp);  in t_splay()
1054 					protect(gp);  in t_splay()
1061 				protect(gp);  in t_splay()
1064 					protect(gp);  in t_splay()
1068 		protect(pp);  in t_splay()
1112 		/* 4-byte "word" alignment is considered ok in LP64 */
1185 		x += align - (x % align);  in memalign()
1194 	frag_size = (size_t)aligned_blk - (size_t)blk;  in memalign()
1210 		blksize -= frag_size;  in memalign()
1212 		frag_size -= WORDSIZE;  in memalign()
1216 		 * free_unlocked(DATA(blk)) has the side-effect of calling  in memalign()
1217 		 * protect() on the block following blk, that is, aligned_blk.  in memalign()
1227 	frag_size = blksize - nbytes;  in memalign()
1237 		frag_size -= WORDSIZE;  in memalign()
1242 	protect(aligned_blk);  in memalign()
1289 static int ctlfd = -1;
1329 		ctlfd = -1;  in init_watch()
1333 	/* close-on-exec */  in init_watch()
1346 		 * that has set other stop-on-fault flags.  in init_watch()
1381 			ctlfd = -1;  in nowatch()
1385 		/* close-on-exec */  in nowatch()
1396 		ctlfd = -1;  in nowatch()
1402 protect(TREE *tp)  in protect()  function
1416 	if (ISBIT0(sz))		/* block is busy, protect only the head */  in protect()