summaryrefslogtreecommitdiff
path: root/lib/libc/stdlib/bsearch.c
blob: 7d3f2afea87bf23893757ee328bf338bc328a17a (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/*-
 * 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.
 */

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

#ifdef I_AM_BSEARCH_S
#include <errno.h>
#include <stdint.h>
#include "libc_private.h"
#endif

#ifdef	I_AM_BSEARCH_B
#include "block_abi.h"
#define	COMPAR(x,y)	CALL_BLOCK(compar, x, y)
typedef DECLARE_BLOCK(int, compar_block, const void *, const void *);
#elif defined(I_AM_BSEARCH_S)
#define	COMPAR(x,y)	compar((x), (y), context)
#else
#define	COMPAR(x,y)	compar(x, y)
#endif

/*
 * 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 involves 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.
 */
#ifdef I_AM_BSEARCH_B
void *
(bsearch_b)(const void *key, const void *base0, size_t nmemb, size_t size,
    compar_block compar)
#elif defined(I_AM_BSEARCH_S)
void *
(bsearch_s)(const void *key, const void *base0, rsize_t nmemb, rsize_t size,
    int (*compar)(const void *, const void *, void *), void *context)
#else
void *
(bsearch)(const void *key, const void *base0, size_t nmemb, size_t size,
    int (*compar)(const void *, const void *))
#endif
{
	const char *base = base0;
	size_t lim;
	int cmp;
	const void *p;

#ifdef I_AM_BSEARCH_S
	if (nmemb > RSIZE_MAX) {
		__throw_constraint_handler_s("bsearch_s : nmemb > RSIZE_MAX",
		    EINVAL);
		return (NULL);
	} else if (size > RSIZE_MAX) {
		__throw_constraint_handler_s("bsearch_s : size > RSIZE_MAX",
		    EINVAL);
		return (NULL);
	} else if (nmemb != 0) {
		if (key == NULL) {
			__throw_constraint_handler_s("bsearch_s : key == NULL",
			    EINVAL);
			return (NULL);
		} else if (base0 == NULL) {
			__throw_constraint_handler_s("bsearch_s : base == NULL",
			    EINVAL);
			return (NULL);
		} else if (compar == NULL) {
			__throw_constraint_handler_s("bsearch_s : compar == NULL",
			    EINVAL);
			return (NULL);
		}
	}
#endif

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