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: qsort.c

/*-
 * Copyright (c) 1992, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#if 0
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)qsort.c	8.1 (Berkeley) 6/4/93";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#endif

#include <config.h>

#ifdef NEED_QSORT

#include "roken.h"

#include <stdlib.h>

#ifdef I_AM_QSORT_R
typedef int		 cmp_t(void *, const void *, const void *);
#else
typedef int		 cmp_t(const void *, const void *);
#endif
static inline char	*med3(char *, char *, char *, cmp_t *, void *);
static inline void	 swapfunc(char *, char *, int, int);

/*
 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
 */
#define swapcode(TYPE, parmi, parmj, n) { 		\
	long i = (n) / sizeof (TYPE); 			\
	TYPE *pi = (TYPE *) (parmi); 		\
	TYPE *pj = (TYPE *) (parmj); 		\
	do { 						\
		TYPE	t = *pi;		\
		*pi++ = *pj;				\
		*pj++ = t;				\
        } while (--i > 0);				\
}

#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
	es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;

static inline void
swapfunc(a, b, n, swaptype)
	char *a, *b;
	int n, swaptype;
{
	if(swaptype <= 1)
		swapcode(long, a, b, n)
	else
		swapcode(char, a, b, n)
}

#define swap(a, b)					\
	if (swaptype == 0) {				\
		long t = *(long *)(a);			\
		*(long *)(a) = *(long *)(b);		\
		*(long *)(b) = t;			\
	} else						\
		swapfunc(a, b, es, swaptype)

#define vecswap(a, b, n) 	if ((n) > 0) swapfunc(a, b, n, swaptype)

#ifdef I_AM_QSORT_R
#define	CMP(t, x, y) (cmp((t), (x), (y)))
#else
#define	CMP(t, x, y) (cmp((x), (y)))
#endif

static inline char *
med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk
#ifndef I_AM_QSORT_R
/* __unused */
#endif
)
{
	return CMP(thunk, a, b) < 0 ?
	       (CMP(thunk, b, c) < 0 ? b : (CMP(thunk, a, c) < 0 ? c : a ))
              :(CMP(thunk, b, c) > 0 ? b : (CMP(thunk, a, c) < 0 ? a : c ));
}

#ifdef I_AM_QSORT_R
void
rk_qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
#else
#define thunk NULL
void
rk_qsort(void *a, size_t n, size_t es, cmp_t *cmp)
#endif
{
	char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
	size_t d, r;
	int cmp_result;
	int swaptype, swap_cnt;

loop:	SWAPINIT(a, es);
	swap_cnt = 0;
	if (n < 7) {
		for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
			for (pl = pm;
			     pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
			     pl -= es)
				swap(pl, pl - es);
		return;
	}
	pm = (char *)a + (n / 2) * es;
	if (n > 7) {
		pl = a;
		pn = (char *)a + (n - 1) * es;
		if (n > 40) {
			d = (n / 8) * es;
			pl = med3(pl, pl + d, pl + 2 * d, cmp, thunk);
			pm = med3(pm - d, pm, pm + d, cmp, thunk);
			pn = med3(pn - 2 * d, pn - d, pn, cmp, thunk);
		}
		pm = med3(pl, pm, pn, cmp, thunk);
	}
	swap(a, pm);
	pa = pb = (char *)a + es;

pc = pd = (char *)a + (n - 1) * es;
	for (;;) {
		while (pb <= pc && (cmp_result = CMP(thunk, pb, a)) <= 0) {
			if (cmp_result == 0) {
				swap_cnt = 1;
				swap(pa, pb);
				pa += es;
			}
			pb += es;
		}
		while (pb <= pc && (cmp_result = CMP(thunk, pc, a)) >= 0) {
			if (cmp_result == 0) {
				swap_cnt = 1;
				swap(pc, pd);
				pd -= es;
			}
			pc -= es;
		}
		if (pb > pc)
			break;
		swap(pb, pc);
		swap_cnt = 1;
		pb += es;
		pc -= es;
	}
	if (swap_cnt == 0) {  /* Switch to insertion sort */
		for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
			for (pl = pm;
			     pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
			     pl -= es)
				swap(pl, pl - es);
		return;
	}

pn = (char *)a + n * es;
	r = min(pa - (char *)a, pb - pa);
	vecswap(a, pb - r, r);
	r = min(pd - pc, pn - pd - es);
	vecswap(pb, pn - r, r);
	if ((r = pb - pa) > es)
#ifdef I_AM_QSORT_R
		rk_qsort_r(a, r / es, es, thunk, cmp);
#else
		rk_qsort(a, r / es, es, cmp);
#endif
	if ((r = pd - pc) > es) {
		/* Iterate rather than recurse to save stack space */
		a = pn - r;
		n = r / es;
		goto loop;
	}
/*		rk_qsort(pn - r, r / es, es, cmp);*/
}

#endif /* NEED_QSORT */

003 File Manager

Editing: qsort.c

Upload File

Create Folder