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.11 (Berkeley) 1/9/95 34 */ 35 36 #define __bt_close __kdb2_bt_close 37 #define __bt_cmp __kdb2_bt_cmp 38 #define __bt_crsrdel __kdb2_bt_crsrdel 39 #define __bt_defcmp __kdb2_bt_defcmp 40 #define __bt_defpfx __kdb2_bt_defpfx 41 #define __bt_delete __kdb2_bt_delete 42 #define __bt_dleaf __kdb2_bt_deleaf 43 #define __bt_fd __kdb2_bt_fd 44 #define __bt_free __kdb2_bt_free 45 #define __bt_get __kdb2_bt_get 46 #define __bt_new __kdb2_bt_new 47 #define __bt_pgin __kdb2_bt_pgin 48 #define __bt_pgout __kdb2_bt_pgout 49 #define __bt_push __kdb2_bt_push 50 #define __bt_put __kdb2_bt_put 51 #define __bt_ret __kdb2_bt_ret 52 #define __bt_search __kdb2_bt_search 53 #define __bt_seq __kdb2_bt_seq 54 #define __bt_setcur __kdb2_bt_setcur 55 #define __bt_split __kdb2_bt_split 56 #define __bt_sync __kdb2_bt_sync 57 #define __ovfl_delete __kdb2_ovfl_delete 58 #define __ovfl_get __kdb2_ovfl_get 59 #define __ovfl_put __kdb2_ovfl_put 60 #define __bt_dnpage __kdb2_bt_dnpage 61 #define __bt_dmpage __kdb2_bt_dmpage 62 #define __bt_dpage __kdb2_bt_dpage 63 #define __bt_dump __kdb2_bt_dump 64 #define __bt_stat __kdb2_bt_stat 65 #define __bt_relink __kdb2_bt_relink 66 67 int __bt_close __P((DB *)); 68 int __bt_cmp __P((BTREE *, const DBT *, EPG *)); 69 int __bt_crsrdel __P((BTREE *, EPGNO *)); 70 int __bt_defcmp __P((const DBT *, const DBT *)); 71 size_t __bt_defpfx __P((const DBT *, const DBT *)); 72 int __bt_delete __P((const DB *, const DBT *, u_int)); 73 int __bt_dleaf __P((BTREE *, const DBT *, PAGE *, u_int)); 74 int __bt_fd __P((const DB *)); 75 int __bt_free __P((BTREE *, PAGE *)); 76 int __bt_get __P((const DB *, const DBT *, DBT *, u_int)); 77 PAGE *__bt_new __P((BTREE *, db_pgno_t *)); 78 void __bt_pgin __P((void *, db_pgno_t, void *)); 79 void __bt_pgout __P((void *, db_pgno_t, void *)); 80 int __bt_push __P((BTREE *, db_pgno_t, int)); 81 int __bt_put __P((const DB *dbp, DBT *, const DBT *, u_int)); 82 int __bt_ret __P((BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int)); 83 EPG *__bt_search __P((BTREE *, const DBT *, int *)); 84 int __bt_seq __P((const DB *, DBT *, DBT *, u_int)); 85 void __bt_setcur __P((BTREE *, db_pgno_t, u_int)); 86 int __bt_split __P((BTREE *, PAGE *, 87 const DBT *, const DBT *, int, size_t, u_int32_t)); 88 int __bt_sync __P((const DB *, u_int)); 89 90 int __ovfl_delete __P((BTREE *, void *)); 91 int __ovfl_get __P((BTREE *, void *, size_t *, void **, size_t *)); 92 int __ovfl_put __P((BTREE *, const DBT *, db_pgno_t *)); 93 94 int __bt_dnpage __P((DB *, db_pgno_t)); 95 int __bt_dpage __P((DB *, PAGE *)); 96 int __bt_dmpage __P((PAGE *)); 97 int __bt_dump __P((DB *)); 98 99 int __bt_stat __P((DB *)); 100 101 int __bt_relink __P((BTREE *, PAGE *)); 102