41 	if ((*leaf)->balance == 0 ||					\
42 	    ((*leaf)->balance < 0 && (*leaf)->rlink->balance == 0)) {	\
51 		rootp = leaf;						\
55 	leaf = &(*leaf)->llink;						\
60 	if ((*leaf)->balance == 0 ||					\
61 	    ((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) {	\
62 		rootp = leaf;						\
66 	leaf = &(*leaf)->rlink;						\
74 	posix_tnode **leaf, *old, **n, *x, *y, *z, *result;  in tdelete()  local
89 	leaf = rootp;  in tdelete()
91 		if (*leaf == NULL)  in tdelete()
93 		cmp = compar(key, (*leaf)->key);  in tdelete()
95 			result = *leaf;  in tdelete()
98 			result = *leaf;  in tdelete()
106 	if ((*leaf)->llink == NULL) {  in tdelete()
108 		old = *leaf;  in tdelete()
109 		*leaf = old->rlink;  in tdelete()
116 		void **keyp = &(*leaf)->key;  in tdelete()
118 		while ((*leaf)->rlink != NULL)  in tdelete()
120 		old = *leaf;  in tdelete()
122 		*leaf = old->llink;  in tdelete()
134 	for (n = rootp; n != leaf;) {  in tdelete()