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
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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
35 #include <sys/types.h>
39 #endif /* HAVE_UNISTD_H */
42 #include "emul/search.h"
44 #if defined(LIBC_SCCS) && !defined(lint)
45 static const char sccsid[] = "@(#)lsearch.c 8.1 (Berkeley) 6/4/93";
46 #endif /* LIBC_SCCS and not lint */
48 __unused static const char rcsid[] = "$Sudo: lsearch.c,v 1.18.4.1 2007/06/12 00:56:42 millert Exp $";
51 typedef int (*cmp_fn_t) __P((const VOID *, const VOID *));
52 static VOID *linear_base __P((const VOID *, const VOID *, size_t *, size_t,
56 lsearch(key, base, nelp, width, compar)
57 const VOID *key, *base;
61 return(linear_base(key, base, nelp, width, compar, 1));
65 lfind(key, base, nelp, width, compar)
66 const VOID *key, *base;
70 return(linear_base(key, base, nelp, width, compar, 0));
74 linear_base(key, base, nelp, width, compar, add_flag)
75 const VOID *key, *base;
80 /* Strict ANSI does not allow pointer arithmetic on void *'s */
81 const char *element, *end;
83 end = (const char *) base + *nelp * width;
84 for (element = (const char *) base; element < end; element += width)
85 if (!compar(key, (VOID *) element)) /* key found */
86 return((VOID *) element);
87 if (!add_flag) /* key not found */
91 * The UNIX System User's Manual, 1986 edition claims that
92 * a NULL pointer is returned by lsearch with errno set
93 * appropriately, if there is not enough room in the table
94 * to add a new item. This can't be done as none of these
95 * routines have any method of determining the size of the
96 * table. This comment was isn't in the 1986-87 System V
100 (void) memcpy((VOID *)end, key, width);
101 return((VOID *) end);