Asterisk - The Open Source Telephony Project  18.5.0
hash/extern.h
Go to the documentation of this file.
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. 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.4 (Berkeley) 6/16/94
34  */
35 
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_int32_t, SPLIT_RETURN *));
44 int __buf_free __P((HTAB *, int, int));
45 void __buf_init __P((HTAB *, int));
46 u_int32_t __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));
51 void __free_ovflpage __P((HTAB *, BUFHEAD *));
52 BUFHEAD *__get_buf __P((HTAB *, u_int32_t, BUFHEAD *, int));
53 int __get_page __P((HTAB *, char *, u_int32_t, int, int, int));
54 int __ibitmap __P((HTAB *, int, int, int));
56 int __put_page __P((HTAB *, char *, u_int32_t, int, int));
57 void __reclaim_buf __P((HTAB *, BUFHEAD *));
59 
60 /* Default hash routine. */
61 extern u_int32_t (*__default_hash) __P((const void *, size_t));
62 
63 #ifdef HASH_STATISTICS
64 extern int hash_accesses, hash_collisions, hash_expansions, hash_overflows;
65 #endif
int __buf_free(HTAB *hashp, int do_free, int to_disk)
Definition: hash_buf.c:315
int __big_keydata(HTAB *hashp, BUFHEAD *bufp, DBT *key, DBT *val, int set)
Definition: hash_bigkey.c:507
BUFHEAD * __add_ovflpage(HTAB *hashp, BUFHEAD *bufp)
Definition: hash_page.c:465
int __expand_table(HTAB *hashp)
Definition: hash.c:815
int __addel(HTAB *hashp, BUFHEAD *bufp, const DBT *key, const DBT *val)
Definition: hash_page.c:398
Definition: db.h:85
Definition: hash.h:92
int __big_insert(HTAB *hashp, BUFHEAD *bufp, const DBT *key, const DBT *val)
Definition: hash_bigkey.c:88
u_int16_t __find_last_page(HTAB *hashp, BUFHEAD **bpp)
Definition: hash_bigkey.c:319
u_int32_t __call_hash(HTAB *hashp, char *k, int len)
Definition: hash.c:886
u_int32_t __hash_log2(u_int32_t num)
Definition: hash_log2.c:48
int __delpair(HTAB *hashp, BUFHEAD *bufp, int ndx)
Definition: hash_page.c:128
int __put_page(HTAB *hashp, char *p, u_int32_t bucket, int is_bucket, int is_bitmap)
Definition: hash_page.c:578
BUFHEAD *__add_ovflpage __P((HTAB *, BUFHEAD *))
Definition: hash.h:47
int __big_split(HTAB *hashp, BUFHEAD *op, BUFHEAD *np, BUFHEAD *big_keyp, int addr, u_int32_t obucket, SPLIT_RETURN *ret)
Definition: hash_bigkey.c:570
void __reclaim_buf(HTAB *hashp, BUFHEAD *bp)
Definition: hash_buf.c:346
unsigned short u_int16_t
unsigned int u_int32_t
int __get_page(HTAB *hashp, char *p, u_int32_t bucket, int is_bucket, int is_disk, int is_bitmap)
Definition: hash_page.c:518
BUFHEAD * __get_buf(HTAB *hashp, u_int32_t addr, BUFHEAD *prev_bp, int newpage)
Definition: hash_buf.c:105
int __find_bigpair(HTAB *hashp, BUFHEAD *bufp, int ndx, char *key, int size)
Definition: hash_bigkey.c:267
int __ibitmap(HTAB *hashp, int pnum, int nbits, int ndx)
Definition: hash_page.c:627
void __buf_init(HTAB *hashp, int nbytes)
Definition: hash_buf.c:290
int __split_page(HTAB *hashp, u_int32_t obucket, u_int32_t nbucket)
Definition: hash_page.c:181
int __big_return(HTAB *hashp, BUFHEAD *bufp, int ndx, DBT *val, int set_current)
Definition: hash_bigkey.c:360
void __free_ovflpage(HTAB *hashp, BUFHEAD *obufp)
Definition: hash_page.c:815
int __big_delete(HTAB *hashp, BUFHEAD *bufp)
Definition: hash_bigkey.c:188