44 	node_t **rootp = (node_t **)vrootp;  in rk_tsearch()  local
46 	if (rootp == NULL)  in rk_tsearch()
49 	while (*rootp != NULL) {	/* Knuth's T1: */  in rk_tsearch()
52 		if ((r = (*compar)(vkey, (*rootp)->key)) == 0)	/* T2: */  in rk_tsearch()
53 			return *rootp;		/* we found it! */  in rk_tsearch()
55 		rootp = (r < 0) ?  in rk_tsearch()
56 		    &(*rootp)->llink :		/* T3: follow left branch */  in rk_tsearch()
57 		    &(*rootp)->rlink;		/* T4: follow right branch */  in rk_tsearch()
62 		*rootp = q;			/* link new node to old */  in rk_tsearch()
119 	node_t **rootp = (node_t **)vrootp;  in rk_tdelete()  local
123 	if (rootp == NULL || (p = *rootp) == NULL)  in rk_tdelete()
126 	while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {  in rk_tdelete()
127 		p = *rootp;  in rk_tdelete()
128 		rootp = (cmp < 0) ?  in rk_tdelete()
129 		    &(*rootp)->llink :		/* follow llink branch */  in rk_tdelete()
130 		    &(*rootp)->rlink;		/* follow rlink branch */  in rk_tdelete()
131 		if (*rootp == NULL)  in rk_tdelete()
134 	r = (*rootp)->rlink;			/* D1: */  in rk_tdelete()
135 	if ((q = (*rootp)->llink) == NULL)	/* Left NULL? */  in rk_tdelete()
145 			q->llink = (*rootp)->llink;  in rk_tdelete()
146 			q->rlink = (*rootp)->rlink;  in rk_tdelete()
149 	free(*rootp);				/* D4: Free node */  in rk_tdelete()
150 	*rootp = q;				/* link parent to new node */  in rk_tdelete()
165 	node_t **rootp = (node_t **)vrootp;  in rk_tfind()  local
167 	if (rootp == NULL)  in rk_tfind()
170 	while (*rootp != NULL) {		/* T1: */  in rk_tfind()
173 		if ((r = (*compar)(vkey, (*rootp)->key)) == 0)	/* T2: */  in rk_tfind()
174 			return *rootp;		/* key found */  in rk_tfind()
175 		rootp = (r < 0) ?  in rk_tfind()
176 		    &(*rootp)->llink :		/* T3: follow left branch */  in rk_tfind()
177 		    &(*rootp)->rlink;		/* T4: follow right branch */  in rk_tfind()