File Manager

003 File Manager

Current Path: /usr/src/sys/libkern

📁 ..
📄 arc4random.c(6.91 KB)
📄 arc4random_uniform.c(1.78 KB)
📁 arm
📁 arm64
📄 ashldi3.c(2.43 KB)
📄 ashrdi3.c(2.56 KB)
📄 asprintf.c(2.17 KB)
📄 bcd.c(1.67 KB)
📄 bcmp.c(4.2 KB)
📄 bcopy.c(4.13 KB)
📄 bsearch.c(3.07 KB)
📄 cmpdi2.c(2.18 KB)
📄 divdi3.c(2.2 KB)
📄 explicit_bzero.c(512 B)
📄 ffs.c(1.84 KB)
📄 ffsl.c(1.85 KB)
📄 ffsll.c(1.82 KB)
📄 fls.c(1.84 KB)
📄 flsl.c(1.84 KB)
📄 flsll.c(1.85 KB)
📄 fnmatch.c(5.89 KB)
📄 gsb_crc32.c(42.96 KB)
📄 iconv.c(13.11 KB)
📄 iconv_converter_if.m(2.11 KB)
📄 iconv_ucs.c(12.47 KB)
📄 iconv_xlat.c(3.39 KB)
📄 iconv_xlat16.c(8.47 KB)
📄 inet_aton.c(3.41 KB)
📄 inet_ntoa.c(1.8 KB)
📄 inet_ntop.c(4.94 KB)
📄 inet_pton.c(5.21 KB)
📄 jenkins_hash.c(16.09 KB)
📄 lshrdi3.c(2.24 KB)
📄 mcount.c(8.52 KB)
📄 memcchr.c(3.27 KB)
📄 memchr.c(1.99 KB)
📄 memcmp.c(2 KB)
📄 memmem.c(2.39 KB)
📄 memset.c(1.61 KB)
📄 moddi3.c(2.22 KB)
📄 murmur3_32.c(3.4 KB)
📄 qdivrem.c(7.47 KB)
📄 qsort.c(5.95 KB)
📄 qsort_r.c(156 B)
📄 quad.h(4.16 KB)
📄 random.c(1.92 KB)
📄 scanc.c(1.93 KB)
📄 strcasecmp.c(2.52 KB)
📄 strcasestr.c(2.4 KB)
📄 strcat.c(1.83 KB)
📄 strchr.c(1.88 KB)
📄 strchrnul.c(1.57 KB)
📄 strcmp.c(1.96 KB)
📄 strcpy.c(1.82 KB)
📄 strcspn.c(2.36 KB)
📄 strdup.c(2.15 KB)
📄 strlcat.c(2.56 KB)
📄 strlcpy.c(1.64 KB)
📄 strlen.c(3.77 KB)
📄 strncat.c(2.23 KB)
📄 strncmp.c(1.92 KB)
📄 strncpy.c(2.15 KB)
📄 strndup.c(1.98 KB)
📄 strnlen.c(1.61 KB)
📄 strrchr.c(1.89 KB)
📄 strsep.c(2.63 KB)
📄 strspn.c(2.32 KB)
📄 strstr.c(2.11 KB)
📄 strtol.c(4.06 KB)
📄 strtoq.c(4.09 KB)
📄 strtoul.c(3.13 KB)
📄 strtouq.c(3.08 KB)
📄 strvalid.c(2.04 KB)
📄 timingsafe_bcmp.c(1.08 KB)
📄 ucmpdi2.c(2.32 KB)
📄 udivdi3.c(1.97 KB)
📄 umoddi3.c(2 KB)
📁 x86

Editing: bsearch.c

/*-
 * SPDX-License-Identifier: BSD-3-Clause
 *
 * Copyright (c) 1990, 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 defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)bsearch.c	8.1 (Berkeley) 6/4/93";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");

#include <sys/param.h>
#include <sys/libkern.h>

/*
 * Perform a binary search.
 *
 * The code below is a bit sneaky.  After a comparison fails, we
 * divide the work in half by moving either left or right. If lim
 * is odd, moving left simply involves halving lim: e.g., when lim
 * is 5 we look at item 2, so we change lim to 2 so that we will
 * look at items 0 & 1.  If lim is even, the same applies.  If lim
 * is odd, moving right again involes halving lim, this time moving
 * the base up one item past p: e.g., when lim is 5 we change base
 * to item 3 and make lim 2 so that we will look at items 3 and 4.
 * If lim is even, however, we have to shrink it by one before
 * halving: e.g., when lim is 4, we still looked at item 2, so we
 * have to make lim 3, then halve, obtaining 1, so that we will only
 * look at item 3.
 */
void *
bsearch(const void *key, const void *base0, size_t nmemb, size_t size,
    int (*compar)(const void *, const void *))
{
	const char *base = base0;
	size_t lim;
	int cmp;
	const void *p;

for (lim = nmemb; lim != 0; lim >>= 1) {
		p = base + (lim >> 1) * size;
		cmp = (*compar)(key, p);
		if (cmp == 0)
			return ((void *)(uintptr_t)p);
		if (cmp > 0) {	/* key > p: move right */
			base = (const char *)p + size;
			lim--;
		}		/* else move left */
	}
	return (NULL);
}

003 File Manager

Editing: bsearch.c

Upload File

Create Folder