1*4960Swillf /* 2*4960Swillf * Copyright 2007 Sun Microsystems, Inc. All rights reserved. 3*4960Swillf * Use is subject to license terms. 4*4960Swillf */ 5*4960Swillf 6*4960Swillf 7*4960Swillf #ifndef _KRB5_BTREE_EXTERN_H 8*4960Swillf #define _KRB5_BTREE_EXTERN_H 9*4960Swillf 10*4960Swillf #pragma ident "%Z%%M% %I% %E% SMI" 11*4960Swillf 12*4960Swillf #ifdef __cplusplus 13*4960Swillf extern "C" { 14*4960Swillf #endif 15*4960Swillf 16*4960Swillf /*- 17*4960Swillf * Copyright (c) 1991, 1993, 1994 18*4960Swillf * The Regents of the University of California. All rights reserved. 19*4960Swillf * 20*4960Swillf * Redistribution and use in source and binary forms, with or without 21*4960Swillf * modification, are permitted provided that the following conditions 22*4960Swillf * are met: 23*4960Swillf * 1. Redistributions of source code must retain the above copyright 24*4960Swillf * notice, this list of conditions and the following disclaimer. 25*4960Swillf * 2. Redistributions in binary form must reproduce the above copyright 26*4960Swillf * notice, this list of conditions and the following disclaimer in the 27*4960Swillf * documentation and/or other materials provided with the distribution. 28*4960Swillf * 3. All advertising materials mentioning features or use of this software 29*4960Swillf * must display the following acknowledgement: 30*4960Swillf * This product includes software developed by the University of 31*4960Swillf * California, Berkeley and its contributors. 32*4960Swillf * 4. Neither the name of the University nor the names of its contributors 33*4960Swillf * may be used to endorse or promote products derived from this software 34*4960Swillf * without specific prior written permission. 35*4960Swillf * 36*4960Swillf * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 37*4960Swillf * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 38*4960Swillf * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 39*4960Swillf * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 40*4960Swillf * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 41*4960Swillf * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 42*4960Swillf * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 43*4960Swillf * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 44*4960Swillf * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 45*4960Swillf * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 46*4960Swillf * SUCH DAMAGE. 47*4960Swillf * 48*4960Swillf * @(#)extern.h 8.11 (Berkeley) 1/9/95 49*4960Swillf */ 50*4960Swillf 51*4960Swillf #define __bt_close __kdb2_bt_close 52*4960Swillf #define __bt_cmp __kdb2_bt_cmp 53*4960Swillf #define __bt_crsrdel __kdb2_bt_crsrdel 54*4960Swillf #define __bt_defcmp __kdb2_bt_defcmp 55*4960Swillf #define __bt_defpfx __kdb2_bt_defpfx 56*4960Swillf #define __bt_delete __kdb2_bt_delete 57*4960Swillf #define __bt_dleaf __kdb2_bt_deleaf 58*4960Swillf #define __bt_fd __kdb2_bt_fd 59*4960Swillf #define __bt_free __kdb2_bt_free 60*4960Swillf #define __bt_get __kdb2_bt_get 61*4960Swillf #define __bt_new __kdb2_bt_new 62*4960Swillf #define __bt_pgin __kdb2_bt_pgin 63*4960Swillf #define __bt_pgout __kdb2_bt_pgout 64*4960Swillf #define __bt_push __kdb2_bt_push 65*4960Swillf #define __bt_put __kdb2_bt_put 66*4960Swillf #define __bt_ret __kdb2_bt_ret 67*4960Swillf #define __bt_search __kdb2_bt_search 68*4960Swillf #define __bt_seq __kdb2_bt_seq 69*4960Swillf #define __bt_setcur __kdb2_bt_setcur 70*4960Swillf #define __bt_split __kdb2_bt_split 71*4960Swillf #define __bt_sync __kdb2_bt_sync 72*4960Swillf #define __ovfl_delete __kdb2_ovfl_delete 73*4960Swillf #define __ovfl_get __kdb2_ovfl_get 74*4960Swillf #define __ovfl_put __kdb2_ovfl_put 75*4960Swillf #define __bt_dnpage __kdb2_bt_dnpage 76*4960Swillf #define __bt_dmpage __kdb2_bt_dmpage 77*4960Swillf #define __bt_dpage __kdb2_bt_dpage 78*4960Swillf #define __bt_dump __kdb2_bt_dump 79*4960Swillf #define __bt_stat __kdb2_bt_stat 80*4960Swillf 81*4960Swillf #define bt_rcinit kdb2_bt_rcinit 82*4960Swillf #define bt_rcdestroy kdb2_bt_rcdestroy 83*4960Swillf #define bt_rcpush kdb2_bt_rcpush 84*4960Swillf #define bt_rcpop kdb2_bt_rcpop 85*4960Swillf #define bt_rcclr kdb2_bt_rcclr 86*4960Swillf #define bt_rcgrowstk kdb2_bt_rcgrowstk 87*4960Swillf #define bt_rseqset kdb2_bt_rseqset 88*4960Swillf #define bt_rseqadv kdb2_bt_rseqadv 89*4960Swillf 90*4960Swillf int __bt_close __P((DB *)); 91*4960Swillf int __bt_cmp __P((BTREE *, const DBT *, EPG *)); 92*4960Swillf int __bt_crsrdel __P((BTREE *, EPGNO *)); 93*4960Swillf int __bt_defcmp __P((const DBT *, const DBT *)); 94*4960Swillf size_t __bt_defpfx __P((const DBT *, const DBT *)); 95*4960Swillf int __bt_delete __P((const DB *, const DBT *, u_int)); 96*4960Swillf int __bt_dleaf __P((BTREE *, const DBT *, PAGE *, u_int)); 97*4960Swillf int __bt_fd __P((const DB *)); 98*4960Swillf int __bt_free __P((BTREE *, PAGE *)); 99*4960Swillf int __bt_get __P((const DB *, const DBT *, DBT *, u_int)); 100*4960Swillf PAGE *__bt_new __P((BTREE *, db_pgno_t *)); 101*4960Swillf void __bt_pgin __P((void *, db_pgno_t, void *)); 102*4960Swillf void __bt_pgout __P((void *, db_pgno_t, void *)); 103*4960Swillf int __bt_push __P((BTREE *, db_pgno_t, int)); 104*4960Swillf int __bt_put __P((const DB *dbp, DBT *, const DBT *, u_int)); 105*4960Swillf int __bt_ret __P((BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int)); 106*4960Swillf EPG *__bt_search __P((BTREE *, const DBT *, int *)); 107*4960Swillf int __bt_seq __P((const DB *, DBT *, DBT *, u_int)); 108*4960Swillf void __bt_setcur __P((BTREE *, db_pgno_t, u_int)); 109*4960Swillf int __bt_split __P((BTREE *, PAGE *, 110*4960Swillf const DBT *, const DBT *, int, size_t, u_int32_t)); 111*4960Swillf int __bt_sync __P((const DB *, u_int)); 112*4960Swillf 113*4960Swillf int __ovfl_delete __P((BTREE *, void *)); 114*4960Swillf int __ovfl_get __P((BTREE *, void *, size_t *, void **, size_t *)); 115*4960Swillf int __ovfl_put __P((BTREE *, const DBT *, db_pgno_t *)); 116*4960Swillf 117*4960Swillf #ifdef DEBUG 118*4960Swillf int __bt_dnpage __P((DB *, db_pgno_t)); 119*4960Swillf void __bt_dpage __P((DB *, PAGE *)); 120*4960Swillf int __bt_dmpage __P((PAGE *)); 121*4960Swillf int __bt_dump __P((DB *)); 122*4960Swillf #endif 123*4960Swillf #ifdef STATISTICS 124*4960Swillf int __bt_stat __P((DB *)); 125*4960Swillf #endif 126*4960Swillf 127*4960Swillf #ifdef __cplusplus 128*4960Swillf } 129*4960Swillf #endif 130*4960Swillf 131*4960Swillf #endif /* !_KRB5_BTREE_EXTERN_H */ 132