62 lines
2.2 KiB
C
62 lines
2.2 KiB
C
|
/*
|
||
|
|
* Copyright (c) 1993 Winning Strategies, Inc.
|
||
|
|
* 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. All advertising materials mentioning features or use of this software
|
||
|
|
* must display the following acknowledgement:
|
||
|
|
* This product includes software developed by Winning Strategies, Inc.
|
||
|
|
* 4. The name of the author may not be used to endorse or promote products
|
||
|
|
* derived from this software withough specific prior written permission
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
||
|
|
static char *rcsid = "$Id: lsearch.c,v 1.1 1993/10/22 17:51:56 jtc Exp $";
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#include <stddef.h>
|
||
|
|
#include <string.h>
|
||
|
|
#include <search.h>
|
||
|
|
|
||
|
|
void *
|
||
|
|
lsearch (key, base, nelp, width, compar)
|
||
|
|
const void *key;
|
||
|
|
const void *base;
|
||
|
|
size_t width;
|
||
|
|
size_t *nelp;
|
||
|
|
int (*compar)();
|
||
|
|
{
|
||
|
|
char *cbase = (char *) base;
|
||
|
|
size_t i;
|
||
|
|
|
||
|
|
for (i = 0; i < *nelp; i++) {
|
||
|
|
if (compar (cbase, key) == 0) {
|
||
|
|
return (void *) cbase;
|
||
|
|
}
|
||
|
|
cbase += width;
|
||
|
|
}
|
||
|
|
|
||
|
|
memmove (cbase, key, width);
|
||
|
|
(*nelp)++;
|
||
|
|
|
||
|
|
return (void *) cbase;
|
||
|
|
}
|