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.10 (Berkeley) 7/20/94 |
34 | */ |
35 | |
36 | int __bt_close __P((DB *)); |
37 | int __bt_cmp __P((BTREE *, const DBT *, EPG *)); |
38 | int __bt_crsrdel __P((BTREE *, EPGNO *)); |
39 | int __bt_defcmp __P((const DBT *, const DBT *)); |
40 | size_t __bt_defpfx __P((const DBT *, const DBT *)); |
41 | int __bt_delete __P((const DB *, const DBT *, u_int)); |
42 | int __bt_dleaf __P((BTREE *, const DBT *, PAGE *, u_int)); |
43 | int __bt_fd __P((const DB *)); |
44 | int __bt_free __P((BTREE *, PAGE *)); |
45 | int __bt_get __P((const DB *, const DBT *, DBT *, u_int)); |
46 | PAGE *__bt_new __P((BTREE *, pgno_t *)); |
47 | void __bt_pgin __P((void *, pgno_t, void *)); |
48 | void __bt_pgout __P((void *, pgno_t, void *)); |
49 | int __bt_push __P((BTREE *, pgno_t, int)); |
50 | int __bt_put __P((const DB *dbp, DBT *, const DBT *, u_int)); |
51 | int __bt_ret __P((BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int)); |
52 | EPG *__bt_search __P((BTREE *, const DBT *, int *)); |
53 | int __bt_seq __P((const DB *, DBT *, DBT *, u_int)); |
54 | void __bt_setcur __P((BTREE *, pgno_t, u_int)); |
55 | int __bt_split __P((BTREE *, PAGE *, |
56 | const DBT *, const DBT *, int, size_t, u_int32_t)); |
57 | int __bt_sync __P((const DB *, u_int)); |
58 | |
59 | int __ovfl_delete __P((BTREE *, void *)); |
60 | int __ovfl_get __P((BTREE *, void *, size_t *, void **, size_t *)); |
61 | int __ovfl_put __P((BTREE *, const DBT *, pgno_t *)); |
62 | |
63 | #ifdef DEBUG |
64 | void __bt_dnpage __P((DB *, pgno_t)); |
65 | void __bt_dpage __P((PAGE *)); |
66 | void __bt_dump __P((DB *)); |
67 | #endif |
68 | #ifdef STATISTICS |
69 | void __bt_stat __P((DB *)); |
70 | #endif |
71 | |