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

/*-
 * Copyright (c) 2015 Nuxi, https://nuxi.nl/
 *
 * 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.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
 */

#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");

#define	_SEARCH_PRIVATE
#include <search.h>
#include <stdbool.h>
#include <stdlib.h>

#include "tsearch_path.h"

/*
 * Makes a step to the left along the binary search tree. This step is
 * also saved, so it can be replayed while rebalancing.
*/
#define	GO_LEFT() do {							\
	if ((*leaf)->balance == 0 ||					\
	    ((*leaf)->balance < 0 && (*leaf)->rlink->balance == 0)) {	\
		/*							\
		 * If we reach a node that is balanced, or has a child	\
		 * in the opposite direction that is balanced, we know	\
		 * that we won't need to perform any rotations above	\
		 * this point. In this case rotations are always	\
		 * capable of keeping the subtree in balance. Make	\
		 * this the root node and reset the path.		\
		 */							\
		rootp = leaf;						\
		path_init(&path);					\
	}								\
	path_taking_left(&path);					\
	leaf = &(*leaf)->llink;						\
} while (0)

/* Makes a step to the right along the binary search tree. */
#define	GO_RIGHT() do {							\
	if ((*leaf)->balance == 0 ||					\
	    ((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) {	\
		rootp = leaf;						\
		path_init(&path);					\
	}								\
	path_taking_right(&path);					\
	leaf = &(*leaf)->rlink;						\
} while (0)

void *
tdelete(const void *restrict key, posix_tnode **restrict rootp,
    int (*compar)(const void *, const void *))
{
	struct path path;
	posix_tnode **leaf, *old, **n, *x, *y, *z, *result;
	int cmp;

/* POSIX requires that tdelete() returns NULL if rootp is NULL. */
	if (rootp == NULL)
		return (NULL);

/*
	 * Find the leaf that needs to be removed. Return if we cannot
	 * find an existing entry. Keep track of the path that is taken
	 * to get to the node, as we will need it to adjust the
	 * balances.
	 */
	result = (posix_tnode *)1;
	path_init(&path);
	leaf = rootp;
	for (;;) {
		if (*leaf == NULL)
			return (NULL);
		cmp = compar(key, (*leaf)->key);
		if (cmp < 0) {
			result = *leaf;
			GO_LEFT();
		} else if (cmp > 0) {
			result = *leaf;
			GO_RIGHT();
		} else {
			break;
		}
	}

/* Found a matching key in the tree. Remove the node. */
	if ((*leaf)->llink == NULL) {
		/* Node has no left children. Replace by its right subtree. */
		old = *leaf;
		*leaf = old->rlink;
		free(old);
	} else {
		/*
		 * Node has left children. Replace this node's key by
		 * its predecessor's and remove that node instead.
		 */
		void **keyp = &(*leaf)->key;
		GO_LEFT();
		while ((*leaf)->rlink != NULL)
			GO_RIGHT();
		old = *leaf;
		*keyp = old->key;
		*leaf = old->llink;
		free(old);
	}

/*
	 * Walk along the same path a second time and adjust the
	 * balances. Though this code looks similar to the rebalancing
	 * performed in tsearch(), it is not identical. We now also need
	 * to consider the case of outward imbalance in the right-right
	 * and left-left case that only exists when deleting. Hence the
	 * duplication of code.
	 */
	for (n = rootp; n != leaf;) {
		if (path_took_left(&path)) {
			x = *n;
			if (x->balance < 0) {
				y = x->rlink;
				if (y->balance > 0) {
					/* Right-left case. */
					z = y->llink;
					x->rlink = z->llink;
					z->llink = x;
					y->llink = z->rlink;
					z->rlink = y;
					*n = z;

x->balance = z->balance < 0 ? 1 : 0;
					y->balance = z->balance > 0 ? -1 : 0;
					z->balance = 0;
				} else {
					/* Right-right case. */
					x->rlink = y->llink;
					y->llink = x;
					*n = y;

if (y->balance < 0) {
						x->balance = 0;
						y->balance = 0;
					} else {
						x->balance = -1;
						y->balance = 1;
					}
				}
			} else {
				--x->balance;
			}
			n = &x->llink;
		} else {
			x = *n;
			if (x->balance > 0) {
				y = x->llink;
				if (y->balance < 0) {
					/* Left-right case. */
					z = y->rlink;
					y->rlink = z->llink;
					z->llink = y;
					x->llink = z->rlink;
					z->rlink = x;
					*n = z;

x->balance = z->balance > 0 ? -1 : 0;
					y->balance = z->balance < 0 ? 1 : 0;
					z->balance = 0;
				} else {
					/* Left-left case. */
					x->llink = y->rlink;
					y->rlink = x;
					*n = y;

if (y->balance > 0) {
						x->balance = 0;
						y->balance = 0;
					} else {
						x->balance = 1;
						y->balance = -1;
					}
				}
			} else {
				++x->balance;
			}
			n = &x->rlink;
		}
	}

/* Return the parent of the old entry. */
	return (result);
}

003 File Manager

Editing: tdelete.c

Upload File

Create Folder