# include <config.h>
#endif
-#include <sys/cdefs.h>
#include <assert.h>
#include <stdlib.h>
tdelete(vkey, vrootp, compar)
const void *vkey; /* key to be deleted */
void **vrootp; /* address of the root of tree */
- int (*compar) __P((const void *, const void *));
+ int (*compar) (const void *, const void *);
{
node_t **rootp = (node_t **)vrootp;
node_t *p, *q, *r;
# include <config.h>
#endif
-#include <sys/cdefs.h>
#include <assert.h>
#include <stdlib.h>
tfind(vkey, vrootp, compar)
const void *vkey; /* key to be found */
const void **vrootp; /* address of the tree root */
- int (*compar) __P((const void *, const void *));
+ int (*compar) (const void *, const void *);
{
node_t * const *rootp = (node_t * const*)vrootp;
# include <config.h>
#endif
-#include <sys/cdefs.h>
#include <assert.h>
#include <stdlib.h>
tsearch(vkey, vrootp, compar)
const void *vkey; /* key to be located */
void **vrootp; /* address of tree root */
- int (*compar) __P((const void *, const void *));
+ int (*compar) (const void *, const void *);
{
node_t *q;
node_t **rootp = (node_t **)vrootp;
# include <config.h>
#endif
-#include <sys/cdefs.h>
#include <assert.h>
#include <stdlib.h>
-static void trecurse __P((const node_t *,
- void (*action)(const void *, VISIT, int), int level));
+static void trecurse (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));
+ void (*action) (const void *, VISIT, int);
int level;
{
assert(root != NULL);
void
twalk(vroot, action)
const void *vroot; /* Root of the tree to be walked */
- void (*action) __P((const void *, VISIT, int));
+ void (*action) (const void *, VISIT, int);
{
if (vroot != NULL && action != NULL)
trecurse(vroot, action, 0);