1 /*- 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)extern.h 8.2 (Berkeley) 2/21/94 34 */ 35 36 BUFHEAD *__add_ovflpage __P((HTAB *, BUFHEAD *)); 37 int __addel __P((HTAB *, BUFHEAD *, const DBT *, const DBT *)); 38 int __big_delete __P((HTAB *, BUFHEAD *)); 39 int __big_insert __P((HTAB *, BUFHEAD *, const DBT *, const DBT *)); 40 int __big_keydata __P((HTAB *, BUFHEAD *, DBT *, DBT *, int)); 41 int __big_return __P((HTAB *, BUFHEAD *, int, DBT *, int)); 42 int __big_split __P((HTAB *, BUFHEAD *, BUFHEAD *, BUFHEAD *, 43 int, u_int, SPLIT_RETURN *)); 44 int __buf_free __P((HTAB *, int, int)); 45 void __buf_init __P((HTAB *, int)); 46 u_int __call_hash __P((HTAB *, char *, int)); 47 int __delpair __P((HTAB *, BUFHEAD *, int)); 48 int __expand_table __P((HTAB *)); 49 int __find_bigpair __P((HTAB *, BUFHEAD *, int, char *, int)); 50 u_short __find_last_page __P((HTAB *, BUFHEAD **)); 51 void __free_ovflpage __P((HTAB *, BUFHEAD *)); 52 BUFHEAD *__get_buf __P((HTAB *, u_int, BUFHEAD *, int)); 53 int __get_page __P((HTAB *, char *, u_int, int, int, int)); 54 int __init_bitmap __P((HTAB *, int, int, int)); 55 u_int __log2 __P((u_int)); 56 int __put_page __P((HTAB *, char *, u_int, int, int)); 57 void __reclaim_buf __P((HTAB *, BUFHEAD *)); 58 int __split_page __P((HTAB *, u_int, u_int)); 59 60 /* Default hash routine. */ 61 extern u_int32_t (*__default_hash) __P((const void *, size_t)); 62 63 #ifdef HASH_STATISTICS 64 extern long hash_accesses, hash_collisions, hash_expansions, hash_overflows; 65 #endif 66