extern.h (3018B)
1 /*- 2 * Copyright (c) 1991, 1993, 1994 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. ***REMOVED*** - see 14 * ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change 15 * 4. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 * 31 * @(#)extern.h 8.4 (Berkeley) 6/16/94 32 */ 33 34 BUFHEAD *dbm_add_ovflpage(HTAB *, BUFHEAD *); 35 int dbm_addel(HTAB *, BUFHEAD *, const DBT *, const DBT *); 36 int dbm_big_delete(HTAB *, BUFHEAD *); 37 int dbm_big_insert(HTAB *, BUFHEAD *, const DBT *, const DBT *); 38 int dbm_big_keydata(HTAB *, BUFHEAD *, DBT *, DBT *, int); 39 int dbm_big_return(HTAB *, BUFHEAD *, int, DBT *, int); 40 int dbm_big_split(HTAB *, BUFHEAD *, BUFHEAD *, BUFHEAD *, 41 uint32, uint32, SPLIT_RETURN *); 42 int dbm_buf_free(HTAB *, int, int); 43 void dbm_buf_init(HTAB *, int); 44 uint32 dbm_call_hash(HTAB *, char *, size_t); 45 int dbm_delpair(HTAB *, BUFHEAD *, int); 46 int dbm_expand_table(HTAB *); 47 int dbm_find_bigpair(HTAB *, BUFHEAD *, int, char *, int); 48 uint16 dbm_find_last_page(HTAB *, BUFHEAD **); 49 void dbm_free_ovflpage(HTAB *, BUFHEAD *); 50 BUFHEAD *dbm_get_buf(HTAB *, uint32, BUFHEAD *, int); 51 int dbm_get_page(HTAB *, char *, uint32, int, int, int); 52 int dbm_ibitmap(HTAB *, int, int, int); 53 uint32 dbm_log2(uint32); 54 int dbm_put_page(HTAB *, char *, uint32, int, int); 55 void dbm_reclaim_buf(HTAB *, BUFHEAD *); 56 int dbm_split_page(HTAB *, uint32, uint32); 57 58 /* Default hash routine. */ 59 extern uint32 (*dbm_default_hash)(const void *, size_t); 60 61 #ifdef HASH_STATISTICS 62 extern int hash_accesses, hash_collisions, hash_expansions, hash_overflows; 63 #endif