From 6f82d0e8f9756938f04071892206a5af85e676f0 Mon Sep 17 00:00:00 2001 From: cvs2svn Date: Fri, 13 Jul 2012 17:49:56 +0000 Subject: This commit was manufactured by cvs2git to create tag 'eric_g2k12'. --- src/lib/libc/stdlib/tfind.c | 41 ----------------------------------------- 1 file changed, 41 deletions(-) delete mode 100644 src/lib/libc/stdlib/tfind.c (limited to 'src/lib/libc/stdlib/tfind.c') diff --git a/src/lib/libc/stdlib/tfind.c b/src/lib/libc/stdlib/tfind.c deleted file mode 100644 index ff6bcd742d..0000000000 --- a/src/lib/libc/stdlib/tfind.c +++ /dev/null @@ -1,41 +0,0 @@ -/* $OpenBSD: tfind.c,v 1.5 2005/03/30 18:51:49 pat Exp $ */ - -/* - * Tree search generalized from Knuth (6.2.2) Algorithm T just like - * the AT&T man page says. - * - * The node_t structure is for internal use only, lint doesn't grok it. - * - * Written by reading the System V Interface Definition, not the code. - * - * Totally public domain. - */ -/*LINTLIBRARY*/ -#include - -typedef struct node_t -{ - char *key; - struct node_t *llink, *rlink; -} node; - -/* find a node, or return 0 */ -void * -tfind(const void *vkey, void * const *vrootp, - int (*compar)(const void *, const void *)) -{ - char *key = (char *)vkey; - node **rootp = (node **)vrootp; - - if (rootp == (struct node_t **)0) - return ((struct node_t *)0); - while (*rootp != (struct node_t *)0) { /* T1: */ - int r; - if ((r = (*compar)(key, (*rootp)->key)) == 0) /* T2: */ - return (*rootp); /* key found */ - rootp = (r < 0) ? - &(*rootp)->llink : /* T3: follow left branch */ - &(*rootp)->rlink; /* T4: follow right branch */ - } - return (node *)0; -} -- cgit v1.2.3-55-g6feb