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. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)lsearch.c 8.1 (Berkeley) 6/4/93
39 #include <sys/types.h>
43 static char *linear_base();
46 lsearch(key, base, nelp, width, compar)
51 return(linear_base(key, base, nelp, width, compar, 1));
55 lfind(key, base, nelp, width, compar)
60 return(linear_base(key, base, nelp, width, compar, 0));
64 linear_base(key, base, nelp, width, compar, add_flag)
67 int (*compar)(), add_flag;
69 register char *element, *end;
71 end = base + *nelp * width;
72 for (element = base; element < end; element += width)
73 if (!compar(element, key)) /* key found */
76 if (!add_flag) /* key not found */
80 * The UNIX System User's Manual, 1986 edition claims that
81 * a NULL pointer is returned by lsearch with errno set
82 * appropriately, if there is not enough room in the table
83 * to add a new item. This can't be done as none of these
84 * routines have any method of determining the size of the
85 * table. This comment was isn't in the 1986-87 System V
89 bcopy(key, end, (int)width);