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

/*-
 * SPDX-License-Identifier: BSD-3-Clause
 *
 * Copyright (c) 1991, 1993
 *	The Regents of the University of California.  All rights reserved.
 * Copyright (c) 2014 David T. Chisnall
 * All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Ronnie Kon at Mindcraft Inc., Kevin Lew and Elmer Yglesias.
 *
 * 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[] = "@(#)heapsort.c	8.1 (Berkeley) 6/4/93";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");

#include <errno.h>
#include <stddef.h>
#include <stdlib.h>

#ifdef I_AM_HEAPSORT_B
#include "block_abi.h"
#define COMPAR(x, y) CALL_BLOCK(compar, x, y)
typedef DECLARE_BLOCK(int, heapsort_block, const void *, const void *);
#else
#define COMPAR(x, y) compar(x, y)
#endif

/*
 * Swap two areas of size number of bytes.  Although qsort(3) permits random
 * blocks of memory to be sorted, sorting pointers is almost certainly the
 * common case (and, were it not, could easily be made so).  Regardless, it
 * isn't worth optimizing; the SWAP's get sped up by the cache, and pointer
 * arithmetic gets lost in the time required for comparison function calls.
 */
#define	SWAP(a, b, count, size, tmp) { \
	count = size; \
	do { \
		tmp = *a; \
		*a++ = *b; \
		*b++ = tmp; \
	} while (--count); \
}

/* Copy one block of size size to another. */
#define COPY(a, b, count, size, tmp1, tmp2) { \
	count = size; \
	tmp1 = a; \
	tmp2 = b; \
	do { \
		*tmp1++ = *tmp2++; \
	} while (--count); \
}

/*
 * Build the list into a heap, where a heap is defined such that for
 * the records K1 ... KN, Kj/2 >= Kj for 1 <= j/2 <= j <= N.
 *
 * There two cases.  If j == nmemb, select largest of Ki and Kj.  If
 * j < nmemb, select largest of Ki, Kj and Kj+1.
 */
#define CREATE(initval, nmemb, par_i, child_i, par, child, size, count, tmp) { \
	for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
	    par_i = child_i) { \
		child = base + child_i * size; \
		if (child_i < nmemb && COMPAR(child, child + size) < 0) { \
			child += size; \
			++child_i; \
		} \
		par = base + par_i * size; \
		if (COMPAR(child, par) <= 0) \
			break; \
		SWAP(par, child, count, size, tmp); \
	} \
}

/*
 * Select the top of the heap and 'heapify'.  Since by far the most expensive
 * action is the call to the compar function, a considerable optimization
 * in the average case can be achieved due to the fact that k, the displaced
 * elememt, is usually quite small, so it would be preferable to first
 * heapify, always maintaining the invariant that the larger child is copied
 * over its parent's record.
 *
 * Then, starting from the *bottom* of the heap, finding k's correct place,
 * again maintianing the invariant.  As a result of the invariant no element
 * is 'lost' when k is assigned its correct place in the heap.
 *
 * The time savings from this optimization are on the order of 15-20% for the
 * average case. See Knuth, Vol. 3, page 158, problem 18.
 *
 * XXX Don't break the #define SELECT line, below.  Reiser cpp gets upset.
 */
#define SELECT(par_i, child_i, nmemb, par, child, size, k, count, tmp1, tmp2) { \
	for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
		child = base + child_i * size; \
		if (child_i < nmemb && COMPAR(child, child + size) < 0) { \
			child += size; \
			++child_i; \
		} \
		par = base + par_i * size; \
		COPY(par, child, count, size, tmp1, tmp2); \
	} \
	for (;;) { \
		child_i = par_i; \
		par_i = child_i / 2; \
		child = base + child_i * size; \
		par = base + par_i * size; \
		if (child_i == 1 || COMPAR(k, par) < 0) { \
			COPY(child, k, count, size, tmp1, tmp2); \
			break; \
		} \
		COPY(child, par, count, size, tmp1, tmp2); \
	} \
}

#ifdef I_AM_HEAPSORT_B
int heapsort_b(void *, size_t, size_t, heapsort_block);
#else
int heapsort(void *, size_t, size_t,
    int (*)(const void *, const void *));
#endif
/*
 * Heapsort -- Knuth, Vol. 3, page 145.  Runs in O (N lg N), both average
 * and worst.  While heapsort is faster than the worst case of quicksort,
 * the BSD quicksort does median selection so that the chance of finding
 * a data set that will trigger the worst case is nonexistent.  Heapsort's
 * only advantage over quicksort is that it requires little additional memory.
 */
#ifdef I_AM_HEAPSORT_B
int
heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar)
#else
int
heapsort(void *vbase, size_t nmemb, size_t size,
    int (*compar)(const void *, const void *))
#endif
{
	size_t cnt, i, j, l;
	char tmp, *tmp1, *tmp2;
	char *base, *k, *p, *t;

if (nmemb <= 1)
		return (0);

if (!size) {
		errno = EINVAL;
		return (-1);
	}

if ((k = malloc(size)) == NULL)
		return (-1);

/*
	 * Items are numbered from 1 to nmemb, so offset from size bytes
	 * below the starting address.
	 */
	base = (char *)vbase - size;

for (l = nmemb / 2 + 1; --l;)
		CREATE(l, nmemb, i, j, t, p, size, cnt, tmp);

/*
	 * For each element of the heap, save the largest element into its
	 * final slot, save the displaced element (k), then recreate the
	 * heap.
	 */
	while (nmemb > 1) {
		COPY(k, base + nmemb * size, cnt, size, tmp1, tmp2);
		COPY(base + nmemb * size, base + size, cnt, size, tmp1, tmp2);
		--nmemb;
		SELECT(i, j, nmemb, t, p, size, k, cnt, tmp1, tmp2);
	}
	free(k);
	return (0);
}

003 File Manager

Editing: heapsort.c

Upload File

Create Folder