Update.
[glibc.git] / db / recno / extern.h
blobfeed43445332dff16e72c18e132127587e2c26b9
1 /*-
2 * Copyright (c) 1991, 1993
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
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.
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.
33 * @(#)extern.h 8.3 (Berkeley) 6/4/94
36 #include "../btree/extern.h"
38 int __rec_close __P((DB *));
39 int __rec_delete __P((const DB *, const DBT *, u_int));
40 int __rec_dleaf __P((BTREE *, PAGE *, u_int32_t));
41 int __rec_fd __P((const DB *));
42 int __rec_fmap __P((BTREE *, recno_t));
43 int __rec_fout __P((BTREE *));
44 int __rec_fpipe __P((BTREE *, recno_t));
45 int __rec_get __P((const DB *, const DBT *, DBT *, u_int));
46 int __rec_iput __P((BTREE *, recno_t, const DBT *, u_int));
47 int __rec_put __P((const DB *dbp, DBT *, const DBT *, u_int));
48 int __rec_ret __P((BTREE *, EPG *, recno_t, DBT *, DBT *));
49 EPG *__rec_search __P((BTREE *, recno_t, enum SRCHOP));
50 int __rec_seq __P((const DB *, DBT *, DBT *, u_int));
51 int __rec_sync __P((const DB *, u_int));
52 int __rec_vmap __P((BTREE *, recno_t));
53 int __rec_vout __P((BTREE *));
54 int __rec_vpipe __P((BTREE *, recno_t));