10Sstevel@tonic-gate /*
20Sstevel@tonic-gate * CDDL HEADER START
30Sstevel@tonic-gate *
40Sstevel@tonic-gate * The contents of this file are subject to the terms of the
5*6812Sraf * Common Development and Distribution License (the "License").
6*6812Sraf * You may not use this file except in compliance with the License.
70Sstevel@tonic-gate *
80Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
90Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing.
100Sstevel@tonic-gate * See the License for the specific language governing permissions
110Sstevel@tonic-gate * and limitations under the License.
120Sstevel@tonic-gate *
130Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each
140Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
150Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the
160Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying
170Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner]
180Sstevel@tonic-gate *
190Sstevel@tonic-gate * CDDL HEADER END
200Sstevel@tonic-gate */
21*6812Sraf
220Sstevel@tonic-gate /*
23*6812Sraf * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
240Sstevel@tonic-gate * Use is subject to license terms.
250Sstevel@tonic-gate */
260Sstevel@tonic-gate
270Sstevel@tonic-gate /* Copyright (c) 1988 AT&T */
280Sstevel@tonic-gate /* All Rights Reserved */
290Sstevel@tonic-gate
30*6812Sraf #pragma ident "%Z%%M% %I% %E% SMI"
310Sstevel@tonic-gate
320Sstevel@tonic-gate /*
330Sstevel@tonic-gate * Linear search algorithm, generalized from Knuth (6.1) Algorithm Q.
340Sstevel@tonic-gate *
350Sstevel@tonic-gate * This version no longer has anything to do with Knuth's Algorithm Q,
360Sstevel@tonic-gate * which first copies the new element into the table, then looks for it.
370Sstevel@tonic-gate * The assumption there was that the cost of checking for the end of the
380Sstevel@tonic-gate * table before each comparison outweighed the cost of the comparison, which
390Sstevel@tonic-gate * isn't true when an arbitrary comparison function must be called and when the
400Sstevel@tonic-gate * copy itself takes a significant number of cycles.
410Sstevel@tonic-gate * Actually, it has now reverted to Algorithm S, which is "simpler."
420Sstevel@tonic-gate */
430Sstevel@tonic-gate
44*6812Sraf #pragma weak _lfind = lfind
450Sstevel@tonic-gate
46*6812Sraf #include "lint.h"
470Sstevel@tonic-gate #include <stdlib.h>
480Sstevel@tonic-gate #include <mtlib.h>
490Sstevel@tonic-gate #include <sys/types.h>
500Sstevel@tonic-gate #include <stdio.h>
510Sstevel@tonic-gate #include <thread.h>
520Sstevel@tonic-gate #include <synch.h>
530Sstevel@tonic-gate #include <search.h>
540Sstevel@tonic-gate
550Sstevel@tonic-gate void *
lfind(const void * ky,const void * bs,size_t * nelp,size_t width,int (* compar)())560Sstevel@tonic-gate lfind(const void *ky, const void *bs, size_t *nelp,
570Sstevel@tonic-gate size_t width, int (*compar)())
580Sstevel@tonic-gate {
590Sstevel@tonic-gate char *key = (char *)ky;
600Sstevel@tonic-gate char *base = (char *)bs;
610Sstevel@tonic-gate char *next = base + *nelp * width; /* End of table */
620Sstevel@tonic-gate
630Sstevel@tonic-gate for (; base < next; base += width)
640Sstevel@tonic-gate if ((*compar)(key, base) == 0)
650Sstevel@tonic-gate return (base); /* Key found */
660Sstevel@tonic-gate return (NULL);
670Sstevel@tonic-gate }
68