File Manager

003 File Manager

Current Path: /usr/src/lib/libc/stdlib

📁 ..
📄 Makefile.inc(2.73 KB)
📄 Symbol.map(1.38 KB)
📄 _Exit.c(529 B)
📄 a64l.3(4.79 KB)
📄 a64l.c(846 B)
📄 abort.3(2.55 KB)
📄 abort.c(2.76 KB)
📄 abs.3(2.36 KB)
📄 abs.c(1.84 KB)
📄 alloca.3(2.8 KB)
📄 at_quick_exit.3(2.12 KB)
📄 atexit.3(3.25 KB)
📄 atexit.c(6.73 KB)
📄 atexit.h(1.76 KB)
📄 atof.3(2.77 KB)
📄 atof.c(2.17 KB)
📄 atoi.3(2.59 KB)
📄 atoi.c(2.16 KB)
📄 atol.3(3.16 KB)
📄 atol.c(2.17 KB)
📄 atoll.c(2.05 KB)
📄 bsearch.3(4.53 KB)
📄 bsearch.c(3.35 KB)
📄 bsearch_b.c(1.38 KB)
📄 cxa_thread_atexit.c(1.67 KB)
📄 cxa_thread_atexit_impl.c(4.63 KB)
📄 div.3(2.22 KB)
📄 div.c(3 KB)
📄 exit.3(3.66 KB)
📄 exit.c(2.72 KB)
📄 getenv.3(5.32 KB)
📄 getenv.c(17.03 KB)
📄 getopt.3(7.57 KB)
📄 getopt.c(4.22 KB)
📄 getopt_long.3(11.45 KB)
📄 getopt_long.c(16.41 KB)
📄 getsubopt.3(3.98 KB)
📄 getsubopt.c(3.13 KB)
📄 hcreate.3(7.04 KB)
📄 hcreate.c(2.23 KB)
📄 hcreate_r.c(2.27 KB)
📄 hdestroy_r.c(1.6 KB)
📄 heapsort.c(6.63 KB)
📄 heapsort_b.c(1.38 KB)
📄 hsearch.h(1.63 KB)
📄 hsearch_r.c(4.36 KB)
📄 imaxabs.3(1.92 KB)
📄 imaxabs.c(1.52 KB)
📄 imaxdiv.3(2.09 KB)
📄 imaxdiv.c(1.81 KB)
📄 insque.3(1.13 KB)
📄 insque.c(925 B)
📁 jemalloc
📄 l64a.c(726 B)
📄 labs.3(2.28 KB)
📄 labs.c(1.85 KB)
📄 ldiv.3(2.34 KB)
📄 ldiv.c(2.17 KB)
📄 llabs.3(1.91 KB)
📄 llabs.c(1.52 KB)
📄 lldiv.3(2.08 KB)
📄 lldiv.c(1.8 KB)
📄 lsearch.3(2.9 KB)
📄 lsearch.c(1.47 KB)
📄 memory.3(2.48 KB)
📄 merge.c(9.27 KB)
📄 mergesort_b.c(1.38 KB)
📄 ptsname.3(4.64 KB)
📄 ptsname.c(3.29 KB)
📄 qsort.3(9.67 KB)
📄 qsort.c(6.32 KB)
📄 qsort_r.c(430 B)
📄 qsort_s.c(147 B)
📄 quick_exit.3(2.13 KB)
📄 quick_exit.c(2.53 KB)
📄 radixsort.3(4.35 KB)
📄 radixsort.c(7.89 KB)
📄 rand.3(4.31 KB)
📄 rand.c(4.58 KB)
📄 random.3(5.11 KB)
📄 random.c(17.58 KB)
📄 random.h(2.91 KB)
📄 reallocarray.3(3.75 KB)
📄 reallocarray.c(1.38 KB)
📄 reallocf.3(2.72 KB)
📄 reallocf.c(1.83 KB)
📄 realpath.3(3.73 KB)
📄 realpath.c(6.32 KB)
📄 remque.c(581 B)
📄 set_constraint_handler_s.3(3.96 KB)
📄 set_constraint_handler_s.c(2.91 KB)
📄 strfmon.3(4.83 KB)
📄 strfmon.c(16.2 KB)
📄 strtod.3(5.87 KB)
📄 strtoimax.c(4.77 KB)
📄 strtol.3(5.26 KB)
📄 strtol.c(4.7 KB)
📄 strtold.c(1.71 KB)
📄 strtoll.c(4.77 KB)
📄 strtonum.3(3.45 KB)
📄 strtonum.c(1.79 KB)
📄 strtoq.c(1.97 KB)
📄 strtoul.3(5.17 KB)
📄 strtoul.c(3.72 KB)
📄 strtoull.c(3.75 KB)
📄 strtoumax.c(3.72 KB)
📄 strtouq.c(1.98 KB)
📄 system.3(3.09 KB)
📄 system.c(3.8 KB)
📄 tdelete.c(5.53 KB)
📄 tfind.c(1.06 KB)
📄 tsearch.3(5.43 KB)
📄 tsearch.c(5.01 KB)
📄 tsearch_path.h(2.8 KB)
📄 twalk.c(1.18 KB)

Editing: radixsort.c

/*-
 * SPDX-License-Identifier: BSD-3-Clause
 *
 * Copyright (c) 1990, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Peter McIlroy and by Dan Bernstein at New York University,
 *
 * 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 defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)radixsort.c	8.2 (Berkeley) 4/28/95";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");

/*
 * Radixsort routines.
 *
 * Program r_sort_a() is unstable but uses O(logN) extra memory for a stack.
 * Use radixsort(a, n, trace, endchar) for this case.
 *
 * For stable sorting (using N extra pointers) use sradixsort(), which calls
 * r_sort_b().
 *
 * For a description of this code, see D. McIlroy, P. McIlroy, K. Bostic,
 * "Engineering Radix Sort".
 */

#include <sys/types.h>
#include <stdlib.h>
#include <stddef.h>
#include <errno.h>

typedef struct {
	const u_char **sa;
	int sn, si;
} stack;

static inline void simplesort
(const u_char **, int, int, const u_char *, u_int);
static void r_sort_a(const u_char **, int, int, const u_char *, u_int);
static void r_sort_b(const u_char **, const u_char **, int, int,
    const u_char *, u_int);

#define	THRESHOLD	20		/* Divert to simplesort(). */
#define	SIZE		512		/* Default stack size. */

#define SETUP {								\
	if (tab == NULL) {						\
		tr = tr0;						\
		for (c = 0; c < endch; c++)				\
			tr0[c] = c + 1;					\
		tr0[c] = 0;						\
		for (c++; c < 256; c++)					\
			tr0[c] = c;					\
		endch = 0;						\
	} else {							\
		endch = tab[endch];					\
		tr = tab;						\
		if (endch != 0 && endch != 255) {			\
			errno = EINVAL;					\
			return (-1);					\
		}							\
	}								\
}

int
radixsort(const u_char **a, int n, const u_char *tab, u_int endch)
{
	const u_char *tr;
	int c;
	u_char tr0[256];

SETUP;
	r_sort_a(a, n, 0, tr, endch);
	return (0);
}

int
sradixsort(const u_char **a, int n, const u_char *tab, u_int endch)
{
	const u_char *tr, **ta;
	int c;
	u_char tr0[256];

SETUP;
	if (n < THRESHOLD)
		simplesort(a, n, 0, tr, endch);
	else {
		if ((ta = malloc(n * sizeof(a))) == NULL)
			return (-1);
		r_sort_b(a, ta, n, 0, tr, endch);
		free(ta);
	}
	return (0);
}

#define empty(s)	(s >= sp)
#define pop(a, n, i)	a = (--sp)->sa, n = sp->sn, i = sp->si
#define push(a, n, i)	sp->sa = a, sp->sn = n, (sp++)->si = i
#define swap(a, b, t)	t = a, a = b, b = t

/* Unstable, in-place sort. */
static void
r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch)
{
	static int count[256], nc, bmin;
	int c;
	const u_char **ak, *r;
	stack s[SIZE], *sp, *sp0, *sp1, temp;
	int *cp, bigc;
	const u_char **an, *t, **aj, **top[256];

/* Set up stack. */
	sp = s;
	push(a, n, i);
	while (!empty(s)) {
		pop(a, n, i);
		if (n < THRESHOLD) {
			simplesort(a, n, i, tr, endch);
			continue;
		}
		an = a + n;

/* Make character histogram. */
		if (nc == 0) {
			bmin = 255;	/* First occupied bin, excluding eos. */
			for (ak = a; ak < an;) {
				c = tr[(*ak++)[i]];
				if (++count[c] == 1 && c != endch) {
					if (c < bmin)
						bmin = c;
					nc++;
				}
			}
			if (sp + nc > s + SIZE) {	/* Get more stack. */
				r_sort_a(a, n, i, tr, endch);
				continue;
			}
		}

/*
		 * Special case: if all strings have the same
		 * character at position i, move on to the next
		 * character.
		 */
		if (nc == 1 && count[bmin] == n) {
			push(a, n, i+1);
			nc = count[bmin] = 0;
			continue;
		}

/*
		 * Set top[]; push incompletely sorted bins onto stack.
		 * top[] = pointers to last out-of-place element in bins.
		 * count[] = counts of elements in bins.
		 * Before permuting: top[c-1] + count[c] = top[c];
		 * during deal: top[c] counts down to top[c-1].
		 */
		sp0 = sp1 = sp;		/* Stack position of biggest bin. */
		bigc = 2;		/* Size of biggest bin. */
		if (endch == 0)		/* Special case: set top[eos]. */
			top[0] = ak = a + count[0];
		else {
			ak = a;
			top[255] = an;
		}
		for (cp = count + bmin; nc > 0; cp++) {
			while (*cp == 0)	/* Find next non-empty pile. */
				cp++;
			if (*cp > 1) {
				if (*cp > bigc) {
					bigc = *cp;
					sp1 = sp;
				}
				push(ak, *cp, i+1);
			}
			top[cp-count] = ak += *cp;
			nc--;
		}
		swap(*sp0, *sp1, temp);	/* Play it safe -- biggest bin last. */

/*
		 * Permute misplacements home.  Already home: everything
		 * before aj, and in bin[c], items from top[c] on.
		 * Inner loop:
		 *	r = next element to put in place;
		 *	ak = top[r[i]] = location to put the next element.
		 *	aj = bottom of 1st disordered bin.
		 * Outer loop:
		 *	Once the 1st disordered bin is done, ie. aj >= ak,
		 *	aj<-aj + count[c] connects the bins in a linked list;
		 *	reset count[c].
		 */
		for (aj = a; aj < an;  *aj = r, aj += count[c], count[c] = 0)
			for (r = *aj;  aj < (ak = --top[c = tr[r[i]]]);)
				swap(*ak, r, t);
	}
}

/* Stable sort, requiring additional memory. */
static void
r_sort_b(const u_char **a, const u_char **ta, int n, int i, const u_char *tr,
    u_int endch)
{
	static int count[256], nc, bmin;
	int c;
	const u_char **ak, **ai;
	stack s[512], *sp, *sp0, *sp1, temp;
	const u_char **top[256];
	int *cp, bigc;

sp = s;
	push(a, n, i);
	while (!empty(s)) {
		pop(a, n, i);
		if (n < THRESHOLD) {
			simplesort(a, n, i, tr, endch);
			continue;
		}

if (nc == 0) {
			bmin = 255;
			for (ak = a + n; --ak >= a;) {
				c = tr[(*ak)[i]];
				if (++count[c] == 1 && c != endch) {
					if (c < bmin)
						bmin = c;
					nc++;
				}
			}
			if (sp + nc > s + SIZE) {
				r_sort_b(a, ta, n, i, tr, endch);
				continue;
			}
		}

sp0 = sp1 = sp;
		bigc = 2;
		if (endch == 0) {
			top[0] = ak = a + count[0];
			count[0] = 0;
		} else {
			ak = a;
			top[255] = a + n;
			count[255] = 0;
		}
		for (cp = count + bmin; nc > 0; cp++) {
			while (*cp == 0)
				cp++;
			if ((c = *cp) > 1) {
				if (c > bigc) {
					bigc = c;
					sp1 = sp;
				}
				push(ak, c, i+1);
			}
			top[cp-count] = ak += c;
			*cp = 0;			/* Reset count[]. */
			nc--;
		}
		swap(*sp0, *sp1, temp);

for (ak = ta + n, ai = a+n; ak > ta;)	/* Copy to temp. */
			*--ak = *--ai;
		for (ak = ta+n; --ak >= ta;)		/* Deal to piles. */
			*--top[tr[(*ak)[i]]] = *ak;
	}
}

/* insertion sort */
static inline void
simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch)
{
	u_char ch;
	const u_char  **ak, **ai, *s, *t;

for (ak = a+1; --n >= 1; ak++)
		for (ai = ak; ai > a; ai--) {
			for (s = ai[0] + b, t = ai[-1] + b;
			    (ch = tr[*s]) != endch; s++, t++)
				if (ch != tr[*t])
					break;
			if (ch >= tr[*t])
				break;
			swap(ai[0], ai[-1], s);
		}
}

003 File Manager

Editing: radixsort.c

Upload File

Create Folder