| extern.h (1573) | extern.h (14272) |
|---|---|
| 1/*- 2 * Copyright (c) 1991, 1993 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 --- 16 unchanged lines hidden (view full) --- 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 * | 1/*- 2 * Copyright (c) 1991, 1993 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 --- 16 unchanged lines hidden (view full) --- 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.2 (Berkeley) 2/21/94 | 33 * @(#)extern.h 8.3 (Berkeley) 6/4/94 |
| 34 */ 35 36#include "../btree/extern.h" 37 38int __rec_close __P((DB *)); 39int __rec_delete __P((const DB *, const DBT *, u_int)); | 34 */ 35 36#include "../btree/extern.h" 37 38int __rec_close __P((DB *)); 39int __rec_delete __P((const DB *, const DBT *, u_int)); |
| 40int __rec_dleaf __P((BTREE *, PAGE *, indx_t)); | 40int __rec_dleaf __P((BTREE *, PAGE *, u_int32_t)); |
| 41int __rec_fd __P((const DB *)); 42int __rec_fmap __P((BTREE *, recno_t)); 43int __rec_fout __P((BTREE *)); 44int __rec_fpipe __P((BTREE *, recno_t)); 45int __rec_get __P((const DB *, const DBT *, DBT *, u_int)); 46int __rec_iput __P((BTREE *, recno_t, const DBT *, u_int)); 47int __rec_put __P((const DB *dbp, DBT *, const DBT *, u_int)); 48int __rec_ret __P((BTREE *, EPG *, recno_t, DBT *, DBT *)); 49EPG *__rec_search __P((BTREE *, recno_t, enum SRCHOP)); 50int __rec_seq __P((const DB *, DBT *, DBT *, u_int)); 51int __rec_sync __P((const DB *, u_int)); 52int __rec_vmap __P((BTREE *, recno_t)); 53int __rec_vout __P((BTREE *)); 54int __rec_vpipe __P((BTREE *, recno_t)); | 41int __rec_fd __P((const DB *)); 42int __rec_fmap __P((BTREE *, recno_t)); 43int __rec_fout __P((BTREE *)); 44int __rec_fpipe __P((BTREE *, recno_t)); 45int __rec_get __P((const DB *, const DBT *, DBT *, u_int)); 46int __rec_iput __P((BTREE *, recno_t, const DBT *, u_int)); 47int __rec_put __P((const DB *dbp, DBT *, const DBT *, u_int)); 48int __rec_ret __P((BTREE *, EPG *, recno_t, DBT *, DBT *)); 49EPG *__rec_search __P((BTREE *, recno_t, enum SRCHOP)); 50int __rec_seq __P((const DB *, DBT *, DBT *, u_int)); 51int __rec_sync __P((const DB *, u_int)); 52int __rec_vmap __P((BTREE *, recno_t)); 53int __rec_vout __P((BTREE *)); 54int __rec_vpipe __P((BTREE *, recno_t)); |