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: twalk.c,v 1.2 1999/09/16 11:45:37 lukem 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: twalk.c,v 1.2 1999/09/16 11:45:37 lukem Exp $");
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
#include <assert.h>
|
|
#define _SEARCH_PRIVATE
|
|
#include <search.h>
|
|
#include <stdlib.h>
|
|
|
|
static void trecurse __P((const node_t *,
|
|
void (*action)(const void *, VISIT, int), int level));
|
|
|
|
/* Walk the nodes of a tree */
|
|
static void
|
|
trecurse(root, action, level)
|
|
const node_t *root; /* Root of the tree to be walked */
|
|
void (*action) __P((const void *, VISIT, int));
|
|
int level;
|
|
{
|
|
_DIAGASSERT(root != NULL);
|
|
_DIAGASSERT(action != NULL);
|
|
|
|
if (root->llink == NULL && root->rlink == NULL)
|
|
(*action)(root, leaf, level);
|
|
else {
|
|
(*action)(root, preorder, level);
|
|
if (root->llink != NULL)
|
|
trecurse(root->llink, action, level + 1);
|
|
(*action)(root, postorder, level);
|
|
if (root->rlink != NULL)
|
|
trecurse(root->rlink, action, level + 1);
|
|
(*action)(root, endorder, level);
|
|
}
|
|
}
|
|
|
|
/* Walk the nodes of a tree */
|
|
void
|
|
twalk(vroot, action)
|
|
const void *vroot; /* Root of the tree to be walked */
|
|
void (*action) __P((const void *, VISIT, int));
|
|
{
|
|
if (vroot != NULL && action != NULL)
|
|
trecurse(vroot, action, 0);
|
|
}
|