2fe8fb192f
There is important information about booting non-ack images in docs/UPDATING. ack/aout-format images can't be built any more, and booting clang/ELF-format ones is a little different. Updating to the new boot monitor is recommended. Changes in this commit: . drop boot monitor -> allowing dropping ack support . facility to copy ELF boot files to /boot so that old boot monitor can still boot fairly easily, see UPDATING . no more ack-format libraries -> single-case libraries . some cleanup of OBJECT_FMT, COMPILER_TYPE, etc cases . drop several ack toolchain commands, but not all support commands (e.g. aal is gone but acksize is not yet). . a few libc files moved to netbsd libc dir . new /bin/date as minix date used code in libc/ . test compile fix . harmonize includes . /usr/lib is no longer special: without ack, /usr/lib plays no kind of special bootstrapping role any more and bootstrapping is done exclusively through packages, so releases depend even less on the state of the machine making them now. . rename nbsd_lib* to lib* . reduce mtree
59 lines
1.5 KiB
C
59 lines
1.5 KiB
C
/* $NetBSD: tsearch.c,v 1.5 2005/11/29 03:12:00 christos 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.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
__RCSID("$NetBSD: tsearch.c,v 1.5 2005/11/29 03:12:00 christos Exp $");
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
#include <assert.h>
|
|
#define _SEARCH_PRIVATE
|
|
#include <search.h>
|
|
#include <stdlib.h>
|
|
|
|
/* find or insert datum into search tree */
|
|
void *
|
|
tsearch(vkey, vrootp, compar)
|
|
const void *vkey; /* key to be located */
|
|
void **vrootp; /* address of tree root */
|
|
int (*compar) __P((const void *, const void *));
|
|
{
|
|
node_t *q;
|
|
node_t **rootp = (node_t **)vrootp;
|
|
|
|
_DIAGASSERT(vkey != NULL);
|
|
_DIAGASSERT(compar != NULL);
|
|
|
|
if (rootp == NULL)
|
|
return NULL;
|
|
|
|
while (*rootp != NULL) { /* Knuth's T1: */
|
|
int r;
|
|
|
|
if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
|
|
return *rootp; /* we found it! */
|
|
|
|
rootp = (r < 0) ?
|
|
&(*rootp)->llink : /* T3: follow left branch */
|
|
&(*rootp)->rlink; /* T4: follow right branch */
|
|
}
|
|
|
|
q = malloc(sizeof(node_t)); /* T5: key not found */
|
|
if (q != 0) { /* make new node */
|
|
*rootp = q; /* link new node to old */
|
|
q->key = __UNCONST(vkey); /* initialize new node */
|
|
q->llink = q->rlink = NULL;
|
|
}
|
|
return q;
|
|
}
|