text: /*-
   * Copyright (c) 1991, 1993, 1994
   *	The Regents of the University of California.  All rights reserved.
   *
   * Redistribution and use in source and binary forms, with or without
   * modification, are permitted provided that the following conditions
   * are met:
   * 1. Redistributions of source code must retain the above copyright
   *    notice, this list of conditions and the following disclaimer.
   * 2. Redistributions in binary form must reproduce the above copyright
   *    notice, this list of conditions and the following disclaimer in the
   *    documentation and/or other materials provided with the distribution.
   * 3. Neither the name of the University nor the names of its contributors
   *    may be used to endorse or promote products derived from this software
   *    without specific prior written permission.
   *
   * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   * SUCH DAMAGE.
   *
   *	@(#)extern.h	8.10 (Berkeley) 7/20/94
   * $DragonFly: src/lib/libc/db/btree/extern.h,v 1.5 2005/09/19 09:20:37 asmodai Exp $
   */
  
  #ifndef LIBC_DB_BTREE_EXTERN_H
  #define LIBC_DB_BTREE_EXTERN_H
  int	 __bt_close (DB *);
  int	 __bt_cmp (BTREE *, const DBT *, EPG *);
  int	 __bt_crsrdel (BTREE *, EPGNO *);
  int	 __bt_defcmp (const DBT *, const DBT *);
  size_t	 __bt_defpfx (const DBT *, const DBT *);
  int	 __bt_delete (const DB *, const DBT *, u_int);
  int	 __bt_dleaf (BTREE *, const DBT *, PAGE *, u_int);
  int	 __bt_fd (const DB *);
  int	 __bt_free (BTREE *, PAGE *);
  int	 __bt_get (const DB *, const DBT *, DBT *, u_int);
  PAGE	*__bt_new (BTREE *, pgno_t *);
  void	 __bt_pgin (void *, pgno_t, void *);
  void	 __bt_pgout (void *, pgno_t, void *);
  int	 __bt_push (BTREE *, pgno_t, int);
  int	 __bt_put (const DB *dbp, DBT *, const DBT *, u_int);
  int	 __bt_ret (BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int);
  EPG	*__bt_search (BTREE *, const DBT *, int *);
  int	 __bt_seq (const DB *, DBT *, DBT *, u_int);
  void	 __bt_setcur (BTREE *, pgno_t, u_int);
  int	 __bt_split (BTREE *, PAGE *,
  	    const DBT *, const DBT *, int, size_t, u_int32_t);
  int	 __bt_sync (const DB *, u_int);
  
  int	 __ovfl_delete (BTREE *, void *);
  int	 __ovfl_get (BTREE *, void *, size_t *, void **, size_t *);
  int	 __ovfl_put (BTREE *, const DBT *, pgno_t *);
  
  #ifdef DEBUG
  void	 __bt_dnpage (DB *, pgno_t);
  void	 __bt_dpage (PAGE *);
  void	 __bt_dump (DB *);
  #endif
  #ifdef STATISTICS
  void	 __bt_stat (DB *);
  #endif
  
  #endif
  