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: hsearch_r.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$");

#include <errno.h>
#include <limits.h>
#include <search.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>

#include "hsearch.h"

/*
 * Look up an unused entry in the hash table for a given hash. For this
 * implementation we use quadratic probing. Quadratic probing has the
 * advantage of preventing primary clustering.
 */
static ENTRY *
hsearch_lookup_free(struct __hsearch *hsearch, size_t hash)
{
	size_t index, i;

for (index = hash, i = 0;; index += ++i) {
		ENTRY *entry = &hsearch->entries[index & hsearch->index_mask];
		if (entry->key == NULL)
			return (entry);
	}
}

/*
 * Computes an FNV-1a hash of the key. Depending on the pointer size, this
 * either uses the 32- or 64-bit FNV prime.
 */
static size_t
hsearch_hash(size_t offset_basis, const char *str)
{
	size_t hash;

hash = offset_basis;
	while (*str != '\0') {
		hash ^= (uint8_t)*str++;
		if (sizeof(size_t) * CHAR_BIT <= 32)
			hash *= UINT32_C(16777619);
		else
			hash *= UINT64_C(1099511628211);
	}
	return (hash);
}

int
hsearch_r(ENTRY item, ACTION action, ENTRY **retval, struct hsearch_data *htab)
{
	struct __hsearch *hsearch;
	ENTRY *entry, *old_entries, *new_entries;
	size_t hash, index, i, old_hash, old_count, new_count;

hsearch = htab->__hsearch;
	hash = hsearch_hash(hsearch->offset_basis, item.key);

/*
	 * Search the hash table for an existing entry for this key.
	 * Stop searching if we run into an unused hash table entry.
	 */
	for (index = hash, i = 0;; index += ++i) {
		entry = &hsearch->entries[index & hsearch->index_mask];
		if (entry->key == NULL)
			break;
		if (strcmp(entry->key, item.key) == 0) {
			*retval = entry;
			return (1);
		}
	}

/* Only perform the insertion if action is set to ENTER. */
	if (action == FIND) {
		errno = ESRCH;
		return (0);
	}

if (hsearch->entries_used * 2 >= hsearch->index_mask) {
		/* Preserve the old hash table entries. */
		old_count = hsearch->index_mask + 1;
		old_entries = hsearch->entries;

/*
		 * Allocate and install a new table if insertion would
		 * yield a hash table that is more than 50% used. By
		 * using 50% as a threshold, a lookup will only take up
		 * to two steps on average.
		 */
		new_count = (hsearch->index_mask + 1) * 2;
		new_entries = calloc(new_count, sizeof(ENTRY));
		if (new_entries == NULL)
			return (0);
		hsearch->entries = new_entries;
		hsearch->index_mask = new_count - 1;

/* Copy over the entries from the old table to the new table. */
		for (i = 0; i < old_count; ++i) {
			entry = &old_entries[i];
			if (entry->key != NULL) {
				old_hash = hsearch_hash(hsearch->offset_basis,
				    entry->key);
				*hsearch_lookup_free(hsearch, old_hash) =
				    *entry;
			}
		}

/* Destroy the old hash table entries. */
		free(old_entries);

/*
		 * Perform a new lookup for a free table entry, so that
		 * we insert the entry into the new hash table.
		 */
		hsearch = htab->__hsearch;
		entry = hsearch_lookup_free(hsearch, hash);
	}

/* Insert the new entry into the hash table. */
	*entry = item;
	++hsearch->entries_used;
	*retval = entry;
	return (1);
}

003 File Manager

Editing: hsearch_r.c

Upload File

Create Folder