Home | History | Annotate | Line # | Download | only in btree
extern.h revision 1.9 
      1 /*	$NetBSD: extern.h,v 1.9 2003/08/07 16:42:41 agc Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1991, 1993, 1994
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  *
     31  *	@(#)extern.h	8.10 (Berkeley) 7/20/94
     32  */
     33 
     34 #ifndef _BTREE_EXTERN_H_
     35 #define _BTREE_EXTERN_H_
     36 int	 __bt_close __P((DB *));
     37 int	 __bt_cmp __P((BTREE *, const DBT *, EPG *));
     38 int	 __bt_crsrdel __P((BTREE *, EPGNO *));
     39 int	 __bt_defcmp __P((const DBT *, const DBT *));
     40 size_t	 __bt_defpfx __P((const DBT *, const DBT *));
     41 int	 __bt_delete __P((const DB *, const DBT *, u_int));
     42 int	 __bt_dleaf __P((BTREE *, const DBT *, PAGE *, u_int));
     43 int	 __bt_fd __P((const DB *));
     44 int	 __bt_free __P((BTREE *, PAGE *));
     45 int	 __bt_get __P((const DB *, const DBT *, DBT *, u_int));
     46 PAGE	*__bt_new __P((BTREE *, pgno_t *));
     47 void	 __bt_pgin __P((void *, pgno_t, void *));
     48 void	 __bt_pgout __P((void *, pgno_t, void *));
     49 int	 __bt_push __P((BTREE *, pgno_t, int));
     50 int	 __bt_put __P((const DB *dbp, DBT *, const DBT *, u_int));
     51 int	 __bt_ret __P((BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int));
     52 EPG	*__bt_search __P((BTREE *, const DBT *, int *));
     53 int	 __bt_seq __P((const DB *, DBT *, DBT *, u_int));
     54 void	 __bt_setcur __P((BTREE *, pgno_t, u_int));
     55 int	 __bt_split __P((BTREE *, PAGE *,
     56 	    const DBT *, const DBT *, int, size_t, u_int32_t));
     57 int	 __bt_sync __P((const DB *, u_int));
     58 
     59 int	 __ovfl_delete __P((BTREE *, void *));
     60 int	 __ovfl_get __P((BTREE *, void *, size_t *, void **, size_t *));
     61 int	 __ovfl_put __P((BTREE *, const DBT *, pgno_t *));
     62 
     63 #ifdef DEBUG
     64 void	 __bt_dmpage __P((PAGE *));
     65 void	 __bt_dnpage __P((DB *, pgno_t));
     66 void	 __bt_dpage __P((PAGE *));
     67 void	 __bt_dump __P((DB *));
     68 #endif
     69 #ifdef STATISTICS
     70 void	 __bt_stat __P((DB *));
     71 #endif
     72 #endif /* _BTREE_EXTERN_H_ */
     73