/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2008 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1988 AT&T */
/* All Rights Reserved */
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* Linear search algorithm, generalized from Knuth (6.1) Algorithm Q.
*
* This version no longer has anything to do with Knuth's Algorithm Q,
* which first copies the new element into the table, then looks for it.
* The assumption there was that the cost of checking for the end of the
* table before each comparison outweighed the cost of the comparison, which
* isn't true when an arbitrary comparison function must be called and when the
* copy itself takes a significant number of cycles.
* Actually, it has now reverted to Algorithm S, which is "simpler."
*/
#include "lint.h"
#include <stdlib.h>
#include <mtlib.h>
#include <stdio.h>
#include <thread.h>
#include <synch.h>
#include <search.h>
void *
{
return (base); /* Key found */
return (NULL);
}