kernel: separate state for trace-deferred syscalls
[minix.git] / lib / libc / stdlib / lsearch.c
blob81d4e398b3c0c83ebc76d6ef7f1bba68ead7d061
1 /*
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Roger L. Snyder.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
33 #include <sys/cdefs.h>
34 #if defined(LIBC_SCCS) && !defined(lint)
35 #if 0
36 static char sccsid[] = "@(#)lsearch.c 8.1 (Berkeley) 6/4/93";
37 #else
38 __RCSID("$NetBSD: lsearch.c,v 1.4 2005/07/16 17:32:09 christos Exp $");
39 #endif
40 #endif /* LIBC_SCCS and not lint */
42 #include <sys/types.h>
44 #include <assert.h>
45 #include <errno.h>
46 #include <string.h>
47 #include <search.h>
49 typedef int (*cmp_fn_t) __P((const void *, const void *));
50 static void *linear_base __P((const void *, void *, size_t *, size_t,
51 cmp_fn_t, int));
53 void *
54 lsearch(key, base, nelp, width, compar)
55 const void *key;
56 void *base;
57 size_t *nelp, width;
58 cmp_fn_t compar;
61 _DIAGASSERT(key != NULL);
62 _DIAGASSERT(base != NULL);
63 _DIAGASSERT(compar != NULL);
65 return(linear_base(key, base, nelp, width, compar, 1));
68 void *
69 lfind(key, base, nelp, width, compar)
70 const void *key, *base;
71 size_t *nelp, width;
72 cmp_fn_t compar;
75 _DIAGASSERT(key != NULL);
76 _DIAGASSERT(base != NULL);
77 _DIAGASSERT(compar != NULL);
79 return(linear_base(key, __UNCONST(base), nelp, width, compar, 0));
82 static void *
83 linear_base(key, base, nelp, width, compar, add_flag)
84 const void *key;
85 void *base;
86 size_t *nelp, width;
87 cmp_fn_t compar;
88 int add_flag;
90 char *element, *end;
92 _DIAGASSERT(key != NULL);
93 _DIAGASSERT(base != NULL);
94 _DIAGASSERT(compar != NULL);
96 end = (char *)base + *nelp * width;
97 for (element = (char *)base; element < end; element += width)
98 if (!compar(element, key)) /* key found */
99 return element;
101 if (!add_flag) /* key not found */
102 return(NULL);
105 * The UNIX System User's Manual, 1986 edition claims that
106 * a NULL pointer is returned by lsearch with errno set
107 * appropriately, if there is not enough room in the table
108 * to add a new item. This can't be done as none of these
109 * routines have any method of determining the size of the
110 * table. This comment isn't in the 1986-87 System V
111 * manual.
113 ++*nelp;
114 memcpy(end, key, width);
115 return end;