]>
git.saurik.com Git - apple/libc.git/blob - db/btree/FreeBSD/extern.h
2 * Copyright (c) 1991, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
33 * @(#)extern.h 8.10 (Berkeley) 7/20/94
34 * $FreeBSD: src/lib/libc/db/btree/extern.h,v 1.3 2002/03/22 09:18:22 obrien Exp $
38 int __bt_cmp(BTREE
*, const DBT
*, EPG
*);
39 int __bt_crsrdel(BTREE
*, EPGNO
*);
40 int __bt_defcmp(const DBT
*, const DBT
*);
41 size_t __bt_defpfx(const DBT
*, const DBT
*);
42 int __bt_delete(const DB
*, const DBT
*, u_int
);
43 int __bt_dleaf(BTREE
*, const DBT
*, PAGE
*, u_int
);
44 int __bt_fd(const DB
*);
45 int __bt_free(BTREE
*, PAGE
*);
46 int __bt_get(const DB
*, const DBT
*, DBT
*, u_int
);
47 PAGE
*__bt_new(BTREE
*, pgno_t
*);
48 void __bt_pgin(void *, pgno_t
, void *);
49 void __bt_pgout(void *, pgno_t
, void *);
50 int __bt_push(BTREE
*, pgno_t
, int);
51 int __bt_put(const DB
*dbp
, DBT
*, const DBT
*, u_int
);
52 int __bt_ret(BTREE
*, EPG
*, DBT
*, DBT
*, DBT
*, DBT
*, int);
53 EPG
*__bt_search(BTREE
*, const DBT
*, int *);
54 int __bt_seq(const DB
*, DBT
*, DBT
*, u_int
);
55 void __bt_setcur(BTREE
*, pgno_t
, u_int
);
56 int __bt_split(BTREE
*, PAGE
*,
57 const DBT
*, const DBT
*, int, size_t, u_int32_t
);
58 int __bt_sync(const DB
*, u_int
);
60 int __ovfl_delete(BTREE
*, void *);
61 int __ovfl_get(BTREE
*, void *, size_t *, void **, size_t *);
62 int __ovfl_put(BTREE
*, const DBT
*, pgno_t
*);
65 void __bt_dnpage(DB
*, pgno_t
);
66 void __bt_dpage(PAGE
*);