1 /* $NetBSD: extern.h,v 1.8 2002/01/12 11:24:48 aymeric Exp $ */ 2 3 /*- 4 * Copyright (c) 1991, 1993, 1994 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * @(#)extern.h 8.10 (Berkeley) 7/20/94 36 */ 37 38 #ifndef _BTREE_EXTERN_H_ 39 #define _BTREE_EXTERN_H_ 40 int __bt_close __P((DB *)); 41 int __bt_cmp __P((BTREE *, const DBT *, EPG *)); 42 int __bt_crsrdel __P((BTREE *, EPGNO *)); 43 int __bt_defcmp __P((const DBT *, const DBT *)); 44 size_t __bt_defpfx __P((const DBT *, const DBT *)); 45 int __bt_delete __P((const DB *, const DBT *, u_int)); 46 int __bt_dleaf __P((BTREE *, const DBT *, PAGE *, u_int)); 47 int __bt_fd __P((const DB *)); 48 int __bt_free __P((BTREE *, PAGE *)); 49 int __bt_get __P((const DB *, const DBT *, DBT *, u_int)); 50 PAGE *__bt_new __P((BTREE *, pgno_t *)); 51 void __bt_pgin __P((void *, pgno_t, void *)); 52 void __bt_pgout __P((void *, pgno_t, void *)); 53 int __bt_push __P((BTREE *, pgno_t, int)); 54 int __bt_put __P((const DB *dbp, DBT *, const DBT *, u_int)); 55 int __bt_ret __P((BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int)); 56 EPG *__bt_search __P((BTREE *, const DBT *, int *)); 57 int __bt_seq __P((const DB *, DBT *, DBT *, u_int)); 58 void __bt_setcur __P((BTREE *, pgno_t, u_int)); 59 int __bt_split __P((BTREE *, PAGE *, 60 const DBT *, const DBT *, int, size_t, u_int32_t)); 61 int __bt_sync __P((const DB *, u_int)); 62 63 int __ovfl_delete __P((BTREE *, void *)); 64 int __ovfl_get __P((BTREE *, void *, size_t *, void **, size_t *)); 65 int __ovfl_put __P((BTREE *, const DBT *, pgno_t *)); 66 67 #ifdef DEBUG 68 void __bt_dmpage __P((PAGE *)); 69 void __bt_dnpage __P((DB *, pgno_t)); 70 void __bt_dpage __P((PAGE *)); 71 void __bt_dump __P((DB *)); 72 #endif 73 #ifdef STATISTICS 74 void __bt_stat __P((DB *)); 75 #endif 76 #endif /* _BTREE_EXTERN_H_ */ 77