File Manager

003 File Manager

Current Path: /usr/src/crypto/heimdal/lib/roken

usr / src / crypto / heimdal / lib / roken /

📁 ..
📄 ChangeLog(61.03 KB)
📄 Makefile.am(4.47 KB)
📄 Makefile.in(126.5 KB)
📄 base64-test.c(2.95 KB)
📄 base64.c(3.69 KB)
📄 base64.h(1.99 KB)
📄 bswap.c(2.01 KB)
📄 chown.c(1.75 KB)
📄 cloexec.c(2.05 KB)
📄 closefrom.c(1.92 KB)
📄 concat.c(2.91 KB)
📄 copyhostent.c(3.07 KB)
📄 ct.c(2.34 KB)
📄 daemon.c(2.36 KB)
📄 doxygen.c(1.89 KB)
📄 dumpdata.c(2.62 KB)
📄 ecalloc.3(2.71 KB)
📄 ecalloc.c(1.96 KB)
📄 emalloc.c(1.91 KB)
📄 environment.c(3.76 KB)
📄 eread.c(1.9 KB)
📄 erealloc.c(1.93 KB)
📄 err.c(1.8 KB)
📄 err.hin(3.02 KB)
📄 errx.c(1.8 KB)
📄 esetenv.c(1.88 KB)
📄 estrdup.c(1.89 KB)
📄 ewrite.c(1.91 KB)
📄 fchown.c(1.75 KB)
📄 flock.c(3.82 KB)
📄 fnmatch.c(5.05 KB)
📄 fnmatch.hin(2.3 KB)
📄 freeaddrinfo.c(1.94 KB)
📄 freehostent.c(2.03 KB)
📄 gai_strerror.c(2.62 KB)
📄 get_default_username.c(2.58 KB)
📄 get_window_size.c(3.38 KB)
📄 getaddrinfo-test.c(4.04 KB)
📄 getaddrinfo.c(10.05 KB)
📄 getaddrinfo_hostspec.c(3.17 KB)
📄 getarg.3(9.56 KB)
📄 getarg.c(15.34 KB)
📄 getarg.h(3.15 KB)
📄 getcap.c(25.29 KB)
📄 getcwd.c(1.94 KB)
📄 getdtablesize.c(2.89 KB)
📄 getegid.c(1.76 KB)
📄 geteuid.c(1.76 KB)
📄 getgid.c(1.75 KB)
📄 gethostname.c(2.34 KB)
📄 getifaddrs.c(32.46 KB)
📄 getipnodebyaddr.c(2.33 KB)
📄 getipnodebyname.c(2.52 KB)
📄 getnameinfo.c(3.51 KB)
📄 getnameinfo_verified.c(3.14 KB)
📄 getopt.c(3.82 KB)
📄 getprogname.c(1.84 KB)
📄 gettimeofday.c(2.43 KB)
📄 getuid.c(1.75 KB)
📄 getusershell.c(4.47 KB)
📄 glob.c(19.59 KB)
📄 glob.hin(3.83 KB)
📄 h_errno.c(1.69 KB)
📄 hex-test.c(3.02 KB)
📄 hex.c(2.85 KB)
📄 hex.h(2.08 KB)
📄 hostent_find_fqdn.c(2.05 KB)
📄 hstrerror.c(2.54 KB)
📄 ifaddrs.hin(2.52 KB)
📄 inet_aton.c(1.94 KB)
📄 inet_ntop.c(3.97 KB)
📄 inet_pton.c(2.94 KB)
📄 initgroups.c(1.75 KB)
📄 innetgr.c(1.79 KB)
📄 install-sh(5.47 KB)
📄 iruserok.c(7.48 KB)
📄 issuid.c(2.01 KB)
📄 k_getpwnam.c(2.08 KB)
📄 k_getpwuid.c(2.07 KB)
📄 localtime_r.c(2.03 KB)
📄 lstat.c(1.76 KB)
📄 memmove.c(2.02 KB)
📄 mini_inetd.c(5.67 KB)
📄 missing(6.14 KB)
📄 mkinstalldirs(671 B)
📄 mkstemp.c(2.4 KB)
📄 ndbm_wrap.c(5.18 KB)
📄 ndbm_wrap.h(3.13 KB)
📄 net_read.c(3.13 KB)
📄 net_write.c(2.9 KB)
📄 parse_bytes-test.c(2.81 KB)
📄 parse_bytes.c(2.55 KB)
📄 parse_bytes.h(2.13 KB)
📄 parse_reply-test.c(3.49 KB)
📄 parse_time-test.c(4.07 KB)
📄 parse_time.3(4.82 KB)
📄 parse_time.c(2.49 KB)
📄 parse_time.h(2.19 KB)
📄 parse_units.c(7.41 KB)
📄 parse_units.h(2.73 KB)
📄 putenv.c(2.51 KB)
📄 qsort.c(5.35 KB)
📄 rand.c(1.84 KB)
📄 rcmd.c(1.92 KB)
📄 readv.c(2.17 KB)
📄 realloc.c(1.83 KB)
📄 recvmsg.c(2.26 KB)
📄 resolve-test.c(4.91 KB)
📄 resolve.c(21.5 KB)
📄 resolve.h(7.26 KB)
📄 rkpty.c(7.89 KB)
📄 roken-common.h(11.68 KB)
📄 roken.awk(875 B)
📄 roken.h.in(27.79 KB)
📄 roken_gethostby.c(7.26 KB)
📄 rtbl.3(6.53 KB)
📄 rtbl.c(12.11 KB)
📄 rtbl.h(3.61 KB)
📄 search.hin(1007 B)
📄 sendmsg.c(5.37 KB)
📄 setegid.c(1.9 KB)
📄 setenv.c(2.37 KB)
📄 seteuid.c(1.9 KB)
📄 setprogname.c(2.44 KB)
📄 signal.c(2.34 KB)
📄 simple_exec.c(7.51 KB)
📄 snprintf-test.c(8.16 KB)
📄 snprintf.c(14.93 KB)
📄 socket.c(7.89 KB)
📄 socket_wrapper.c(40.97 KB)
📄 socket_wrapper.h(4.52 KB)
📄 strcasecmp.c(2 KB)
📄 strcollect.c(2.64 KB)
📄 strdup.c(1.84 KB)
📄 strerror.c(2 KB)
📄 strerror_r.c(2.73 KB)
📄 strftime.c(8.32 KB)
📄 strlcat.c(2.21 KB)
📄 strlcpy.c(2.23 KB)
📄 strlwr.c(1.86 KB)
📄 strncasecmp.c(2.04 KB)
📄 strndup.c(1.96 KB)
📄 strnlen.c(1.79 KB)
📄 strpftime-test.c(6.04 KB)
📄 strpftime-test.h(2.19 KB)
📄 strpool.c(2.74 KB)
📄 strptime.c(9.21 KB)
📄 strsep.c(1.95 KB)
📄 strsep_copy.c(2.22 KB)
📄 strtok_r.c(2.05 KB)
📄 strupr.c(1.86 KB)
📄 swab.c(1.87 KB)
📄 test-mem.c(4.96 KB)
📄 test-mem.h(1.85 KB)
📄 test-readenv.c(3 KB)
📄 timegm.c(2.72 KB)
📄 timeval.c(2.34 KB)
📄 tm2time.c(2.01 KB)
📄 tsearch.c(4.17 KB)
📄 unsetenv.c(2.14 KB)
📄 unvis.c(6.39 KB)
📄 verify.c(2.1 KB)
📄 verr.c(1.79 KB)
📄 verrx.c(1.79 KB)
📄 version-script.map(3.33 KB)
📄 vis.c(11.45 KB)
📄 vis.hin(4.38 KB)
📄 vsyslog.c(3.13 KB)
📄 vwarn.c(1.77 KB)
📄 vwarnx.c(1.77 KB)
📄 warn.c(1.75 KB)
📄 warnerr.c(2.12 KB)
📄 warnx.c(1.79 KB)
📄 write_pid.c(2.65 KB)
📄 writev.c(2.15 KB)
📄 xdbm.h(1.91 KB)
📄 xfree.c(1.7 KB)

Editing: tsearch.c

/*
 * 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.
 *
 * $NetBSD: tsearch.c,v 1.3 1999/09/16 11:45:37 lukem Exp $
 * $NetBSD: twalk.c,v 1.1 1999/02/22 10:33:16 christos Exp $
 * $NetBSD: tdelete.c,v 1.2 1999/09/16 11:45:37 lukem Exp $
 * $NetBSD: tfind.c,v 1.2 1999/09/16 11:45:37 lukem Exp $
 */

#include <config.h>
#include "roken.h"
#include "search.h"
#include <stdlib.h>

typedef struct node {
  char         *key;
  struct node  *llink, *rlink;
} node_t;

#ifndef __DECONST
#define __DECONST(type, var)    ((type)(uintptr_t)(const void *)(var))
#endif

/*
 * find or insert datum into search tree
 *
 * Parameters:
 *	vkey:	key to be located
 *	vrootp:	address of tree root
 */

ROKEN_LIB_FUNCTION void *
rk_tsearch(const void *vkey, void **vrootp,
	int (*compar)(const void *, const void *))
{
	node_t *q;
	node_t **rootp = (node_t **)vrootp;

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 */
		/* LINTED const castaway ok */
		q->key = __DECONST(void *, vkey); /* initialize new node */
		q->llink = q->rlink = NULL;
	}
	return q;
}

/*
 * Walk the nodes of a tree
 *
 * Parameters:
 *	root:	Root of the tree to be walked
 */
static void
trecurse(const node_t *root, void (*action)(const void *, VISIT, int),
	 int level)
{

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
 *
 * Parameters:
 *	vroot:	Root of the tree to be walked
 */
ROKEN_LIB_FUNCTION void
rk_twalk(const void *vroot,
      void (*action)(const void *, VISIT, int))
{
	if (vroot != NULL && action != NULL)
		trecurse(vroot, action, 0);
}

/*
 * delete node with given key
 *
 * vkey:   key to be deleted
 * vrootp: address of the root of the tree
 * compar: function to carry out node comparisons
 */
ROKEN_LIB_FUNCTION void *
rk_tdelete(const void * vkey, void ** vrootp,
	int (*compar)(const void *, const void *))
{
	node_t **rootp = (node_t **)vrootp;
	node_t *p, *q, *r;
	int cmp;

if (rootp == NULL || (p = *rootp) == NULL)
		return NULL;

while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
		p = *rootp;
		rootp = (cmp < 0) ?
		    &(*rootp)->llink :		/* follow llink branch */
		    &(*rootp)->rlink;		/* follow rlink branch */
		if (*rootp == NULL)
			return NULL;		/* key not found */
	}
	r = (*rootp)->rlink;			/* D1: */
	if ((q = (*rootp)->llink) == NULL)	/* Left NULL? */
		q = r;
	else if (r != NULL) {			/* Right link is NULL? */
		if (r->llink == NULL) {		/* D2: Find successor */
			r->llink = q;
			q = r;
		} else {			/* D3: Find NULL link */
			for (q = r->llink; q->llink != NULL; q = r->llink)
				r = q;
			r->llink = q->rlink;
			q->llink = (*rootp)->llink;
			q->rlink = (*rootp)->rlink;
		}
	}
	free(*rootp);				/* D4: Free node */
	*rootp = q;				/* link parent to new node */
	return p;
}

/*
 * find a node, or return 0
 *
 * Parameters:
 *	vkey:	key to be found
 *	vrootp:	address of the tree root
 */
ROKEN_LIB_FUNCTION void *
rk_tfind(const void *vkey, void * const *vrootp,
      int (*compar)(const void *, const void *))
{
	node_t **rootp = (node_t **)vrootp;

if (rootp == NULL)
		return NULL;

while (*rootp != NULL) {		/* T1: */
		int r;

if ((r = (*compar)(vkey, (*rootp)->key)) == 0)	/* T2: */
			return *rootp;		/* key found */
		rootp = (r < 0) ?
		    &(*rootp)->llink :		/* T3: follow left branch */
		    &(*rootp)->rlink;		/* T4: follow right branch */
	}
	return NULL;
}

003 File Manager

Editing: tsearch.c

Upload File

Create Folder