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 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.3 (Berkeley) 6/4/94 34 */ 35 36 #include "../btree/extern.h" 37 38 #define __rec_close __kdb2_rec_close 39 #define __rec_delete __kdb2_rec_delete 40 #define __rec_dleaf __kdb2_rec_dleaf 41 #define __rec_fd __kdb2_rec_fd 42 #define __rec_fmap __kdb2_rec_fmap 43 #define __rec_fout __kdb2_rec_fout 44 #define __rec_fpipe __kdb2_rec_fpipe 45 #define __rec_get __kdb2_rec_get 46 #define __rec_iput __kdb2_rec_iput 47 #define __rec_put __kdb2_rec_put 48 #define __rec_ret __kdb2_rec_ret 49 #define __rec_search __kdb2_rec_search 50 #define __rec_seq __kdb2_rec_seq 51 #define __rec_sync __kdb2_rec_sync 52 #define __rec_vmap __kdb2_rec_vmap 53 #define __rec_vout __kdb2_rec_vout 54 #define __rec_vpipe __kdb2_rec_vpipe 55 56 int __rec_close __P((DB *)); 57 int __rec_delete __P((const DB *, const DBT *, u_int)); 58 int __rec_dleaf __P((BTREE *, PAGE *, u_int32_t)); 59 int __rec_fd __P((const DB *)); 60 int __rec_fmap __P((BTREE *, recno_t)); 61 int __rec_fout __P((BTREE *)); 62 int __rec_fpipe __P((BTREE *, recno_t)); 63 int __rec_get __P((const DB *, const DBT *, DBT *, u_int)); 64 int __rec_iput __P((BTREE *, recno_t, const DBT *, u_int)); 65 int __rec_put __P((const DB *dbp, DBT *, const DBT *, u_int)); 66 int __rec_ret __P((BTREE *, EPG *, recno_t, DBT *, DBT *)); 67 EPG *__rec_search __P((BTREE *, recno_t, enum SRCHOP)); 68 int __rec_seq __P((const DB *, DBT *, DBT *, u_int)); 69 int __rec_sync __P((const DB *, u_int)); 70 int __rec_vmap __P((BTREE *, recno_t)); 71 int __rec_vout __P((BTREE *)); 72 int __rec_vpipe __P((BTREE *, recno_t)); 73