2 * Tree search generalized from Knuth (6.2.2) Algorithm T just like
3 * the AT&T man page says.
5 * The node_t structure is for internal use only, lint doesn't grok it.
7 * Written by reading the System V Interface Definition, not the code.
9 * Totally public domain.
11 * $NetBSD: tfind.c,v 1.2 1999/09/16 11:45:37 lukem Exp $
12 * $FreeBSD: src/lib/libc/stdlib/tfind.c,v 1.1.2.1 2000/08/17 07:38:39 jhb Exp $
13 * $DragonFly: src/lib/libc/stdlib/tfind.c,v 1.3 2003/09/06 08:19:16 asmodai Exp $
16 #include <sys/cdefs.h>
19 #define _SEARCH_PRIVATE
23 /* find a node, or return 0 */
25 tfind(vkey, vrootp, compar)
26 const void *vkey; /* key to be found */
27 void **vrootp; /* address of the tree root */
28 int (*compar) (const void *, const void *);
30 node_t **rootp = (node_t **)vrootp;
35 while (*rootp != NULL) { /* T1: */
38 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
39 return *rootp; /* key found */
41 &(*rootp)->llink : /* T3: follow left branch */
42 &(*rootp)->rlink; /* T4: follow right branch */