andre@3: /*-
andre@3:  * Copyright (c) 1991, 1993, 1994
andre@3:  *	The Regents of the University of California.  All rights reserved.
andre@3:  *
andre@3:  * Redistribution and use in source and binary forms, with or without
andre@3:  * modification, are permitted provided that the following conditions
andre@3:  * are met:
andre@3:  * 1. Redistributions of source code must retain the above copyright
andre@3:  *    notice, this list of conditions and the following disclaimer.
andre@3:  * 2. Redistributions in binary form must reproduce the above copyright
andre@3:  *    notice, this list of conditions and the following disclaimer in the
andre@3:  *    documentation and/or other materials provided with the distribution.
andre@3:  * 3. ***REMOVED*** - see 
andre@3:  *    ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
andre@3:  * 4. Neither the name of the University nor the names of its contributors
andre@3:  *    may be used to endorse or promote products derived from this software
andre@3:  *    without specific prior written permission.
andre@3:  *
andre@3:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
andre@3:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
andre@3:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
andre@3:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
andre@3:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
andre@3:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
andre@3:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
andre@3:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
andre@3:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
andre@3:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
andre@3:  * SUCH DAMAGE.
andre@3:  *
andre@3:  *	@(#)extern.h	8.4 (Berkeley) 6/16/94
andre@3:  */
andre@3: 
andre@3: BUFHEAD	*__add_ovflpage (HTAB *, BUFHEAD *);
andre@3: int	 __addel (HTAB *, BUFHEAD *, const DBT *, const DBT *);
andre@3: int	 __big_delete (HTAB *, BUFHEAD *);
andre@3: int	 __big_insert (HTAB *, BUFHEAD *, const DBT *, const DBT *);
andre@3: int	 __big_keydata (HTAB *, BUFHEAD *, DBT *, DBT *, int);
andre@3: int	 __big_return (HTAB *, BUFHEAD *, int, DBT *, int);
andre@3: int	 __big_split (HTAB *, BUFHEAD *, BUFHEAD *, BUFHEAD *,
andre@3: 		uint32, uint32, SPLIT_RETURN *);
andre@3: int	 __buf_free (HTAB *, int, int);
andre@3: void	 __buf_init (HTAB *, int);
andre@3: uint32	 __call_hash (HTAB *, char *, size_t);
andre@3: int	 __delpair (HTAB *, BUFHEAD *, int);
andre@3: int	 __expand_table (HTAB *);
andre@3: int	 __find_bigpair (HTAB *, BUFHEAD *, int, char *, int);
andre@3: uint16	 __find_last_page (HTAB *, BUFHEAD **);
andre@3: void	 __free_ovflpage (HTAB *, BUFHEAD *);
andre@3: BUFHEAD	*__get_buf (HTAB *, uint32, BUFHEAD *, int);
andre@3: int	 __get_page (HTAB *, char *, uint32, int, int, int);
andre@3: int	 __ibitmap (HTAB *, int, int, int);
andre@3: uint32	 __log2 (uint32);
andre@3: int	 __put_page (HTAB *, char *, uint32, int, int);
andre@3: void	 __reclaim_buf (HTAB *, BUFHEAD *);
andre@3: int	 __split_page (HTAB *, uint32, uint32);
andre@3: 
andre@3: /* Default hash routine. */
andre@3: extern uint32 (*__default_hash) (const void *, size_t);
andre@3: 
andre@3: #ifdef HASH_STATISTICS
andre@3: extern int hash_accesses, hash_collisions, hash_expansions, hash_overflows;
andre@3: #endif