libsa/bsearch.c

   1 /*
   2  * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_OSREFERENCE_HEADER_START@
   5  *
   6  * This file contains Original Code and/or Modifications of Original Code
   7  * as defined in and that are subject to the Apple Public Source License
   8  * Version 2.0 (the 'License'). You may not use this file except in
   9  * compliance with the License.  The rights granted to you under the
  10  * License may not be used to create, or enable the creation or
  11  * redistribution of, unlawful or unlicensed copies of an Apple operating
  12  * system, or to circumvent, violate, or enable the circumvention or
  13  * violation of, any terms of an Apple operating system software license
  14  * agreement.
  15  *
  16  * Please obtain a copy of the License at
  17  * http://www.opensource.apple.com/apsl/ and read it before using this
  18  * file.
  19  *
  20  * The Original Code and all software distributed under the License are
  21  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  22  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  23  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  24  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  25  * Please see the License for the specific language governing rights and
  26  * limitations under the License.
  27  *
  28  * @APPLE_LICENSE_OSREFERENCE_HEADER_END@
  29  */
  30 /*
  31  * Copyright (c) 1990, 1993
  32  *      The Regents of the University of California.  All rights reserved.
  33  *
  34  * Redistribution and use in source and binary forms, with or without
  35  * modification, are permitted provided that the following conditions
  36  * are met:
  37  * 1. Redistributions of source code must retain the above copyright
  38  *    notice, this list of conditions and the following disclaimer.
  39  * 2. Redistributions in binary form must reproduce the above copyright
  40  *    notice, this list of conditions and the following disclaimer in the
  41  *    documentation and/or other materials provided with the distribution.
  42  * 3. All advertising materials mentioning features or use of this software
  43  *    must display the following acknowledgement:
  44  *      This product includes software developed by the University of
  45  *      California, Berkeley and its contributors.
  46  * 4. Neither the name of the University nor the names of its contributors
  47  *    may be used to endorse or promote products derived from this software
  48  *    without specific prior written permission.
  49  *
  50  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  51  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  52  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  53  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  54  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  55  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  56  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  57  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  58  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  59  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  60  * SUCH DAMAGE.
  61  */
  62
  63 #if defined(LIBC_SCCS) && !defined(lint)
  64 static char sccsid[] = "@(#)bsearch.c   8.1 (Berkeley) 6/4/93";
  65 #endif /* LIBC_SCCS and not lint */
  66
  67 #include <libsa/stdlib.h>
  68
  69 /*
  70  * Perform a binary search.
  71  *
  72  * The code below is a bit sneaky.  After a comparison fails, we
  73  * divide the work in half by moving either left or right. If lim
  74  * is odd, moving left simply involves halving lim: e.g., when lim
  75  * is 5 we look at item 2, so we change lim to 2 so that we will
  76  * look at items 0 & 1.  If lim is even, the same applies.  If lim
  77  * is odd, moving right again involes halving lim, this time moving
  78  * the base up one item past p: e.g., when lim is 5 we change base
  79  * to item 3 and make lim 2 so that we will look at items 3 and 4.
  80  * If lim is even, however, we have to shrink it by one before
  81  * halving: e.g., when lim is 4, we still looked at item 2, so we
  82  * have to make lim 3, then halve, obtaining 1, so that we will only
  83  * look at item 3.
  84  */
  85 __private_extern__
  86 void * bsearch(
  87         register const void *key,
  88         const void *base0,
  89         size_t nmemb,
  90         register size_t size,
  91         register int (*compar)(const void *, const void *)) {
  92
  93         register const char *base = base0;
  94         register size_t lim;
  95         register int cmp;
  96         register const void *p;
  97
  98         for (lim = nmemb; lim != 0; lim >>= 1) {
  99                 p = base + (lim >> 1) * size;
 100                 cmp = (*compar)(key, p);
 101                 if (cmp == 0)
 102                         return ((void *)p);
 103                 if (cmp > 0) {  /* key > p: move right */
 104                         base = (char *)p + size;
 105                         lim--;
 106                 }               /* else move left */
 107         }
 108         return (NULL);
 109 }