1 /* 2 * Tree search generalized from Knuth (6.2.2) Algorithm T just like 3 * the AT&T man page says. 4 * 5 * The node_t structure is for internal use only, lint doesn't grok it. 6 * 7 * Written by reading the System V Interface Definition, not the code. 8 * 9 * Totally public domain. 10 * 11 * $NetBSD: tsearch.c,v 1.3 1999/09/16 11:45:37 lukem Exp $ 12 * $FreeBSD: src/lib/libc/stdlib/tsearch.c,v 1.1.2.1 2000/08/17 07:38:39 jhb Exp $ 13 * $DragonFly: src/lib/libc/stdlib/tsearch.c,v 1.5 2005/11/20 12:37:49 swildner Exp $ 14 */ 15 16 #include <sys/cdefs.h> 17 18 #include <assert.h> 19 #define _SEARCH_PRIVATE 20 #include <search.h> 21 #include <stdlib.h> 22 23 /* find or insert datum into search tree */ 24 void * 25 tsearch(const void *vkey, /* key to be located */ 26 void **vrootp, /* address of tree root */ 27 int (*compar)(const void *, const void *)) 28 { 29 node_t *q; 30 node_t **rootp = (node_t **)vrootp; 31 32 if (rootp == NULL) 33 return NULL; 34 35 while (*rootp != NULL) { /* Knuth's T1: */ 36 int r; 37 38 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ 39 return *rootp; /* we found it! */ 40 41 rootp = (r < 0) ? 42 &(*rootp)->llink : /* T3: follow left branch */ 43 &(*rootp)->rlink; /* T4: follow right branch */ 44 } 45 46 q = malloc(sizeof(node_t)); /* T5: key not found */ 47 if (q != 0) { /* make new node */ 48 *rootp = q; /* link new node to old */ 49 /* LINTED const castaway ok */ 50 q->key = __DECONST(void *, vkey); /* initialize new node */ 51 q->llink = q->rlink = NULL; 52 } 53 return q; 54 } 55