DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Untracked file

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

BUFHEAD	*__add_ovflpage (HTAB *, BUFHEAD *);
int	 __addel (HTAB *, BUFHEAD *, const DBT *, const DBT *);
int	 __big_delete (HTAB *, BUFHEAD *);
int	 __big_insert (HTAB *, BUFHEAD *, const DBT *, const DBT *);
int	 __big_keydata (HTAB *, BUFHEAD *, DBT *, DBT *, int);
int	 __big_return (HTAB *, BUFHEAD *, int, DBT *, int);
int	 __big_split (HTAB *, BUFHEAD *, BUFHEAD *, BUFHEAD *,
		uint32, uint32, SPLIT_RETURN *);
int	 __buf_free (HTAB *, int, int);
void	 __buf_init (HTAB *, int);
uint32	 __call_hash (HTAB *, char *, size_t);
int	 __delpair (HTAB *, BUFHEAD *, int);
int	 __expand_table (HTAB *);
int	 __find_bigpair (HTAB *, BUFHEAD *, int, char *, int);
uint16	 __find_last_page (HTAB *, BUFHEAD **);
void	 __free_ovflpage (HTAB *, BUFHEAD *);
BUFHEAD	*__get_buf (HTAB *, uint32, BUFHEAD *, int);
int	 __get_page (HTAB *, char *, uint32, int, int, int);
int	 __ibitmap (HTAB *, int, int, int);
uint32	 __log2 (uint32);
int	 __put_page (HTAB *, char *, uint32, int, int);
void	 __reclaim_buf (HTAB *, BUFHEAD *);
int	 __split_page (HTAB *, uint32, uint32);

/* Default hash routine. */
extern uint32 (*__default_hash) (const void *, size_t);

#ifdef HASH_STATISTICS
extern int hash_accesses, hash_collisions, hash_expansions, hash_overflows;
#endif