root/libdb/extern.h

/* [previous][next][first][last][top][bottom][index][help] */

INCLUDED FROM


   1 /*-
   2  * Copyright (c) 1991, 1993, 1994
   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. Neither the name of the University nor the names of its contributors
  14  *    may be used to endorse or promote products derived from this software
  15  *    without specific prior written permission.
  16  *
  17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  *
  29  *      @(#)extern.h    8.10 (Berkeley) 7/20/94
  30  */
  31 
  32 int      __bt_close(DB *, int);
  33 int      __bt_cmp(BTREE *, const DBT *, EPG *);
  34 int      __bt_crsrdel(BTREE *, EPGNO *);
  35 int      __bt_defcmp(const DBT *, const DBT *);
  36 size_t   __bt_defpfx(const DBT *, const DBT *);
  37 int      __bt_delete(const DB *, const DBT *, u_int);
  38 int      __bt_dleaf(BTREE *, const DBT *, PAGE *, u_int);
  39 int      __bt_fd(const DB *);
  40 int      __bt_free(BTREE *, PAGE *);
  41 int      __bt_get(const DB *, const DBT *, DBT *, u_int);
  42 PAGE    *__bt_new(BTREE *, pgno_t *);
  43 void     __bt_pgin(void *, pgno_t, void *);
  44 void     __bt_pgout(void *, pgno_t, void *);
  45 int      __bt_push(BTREE *, pgno_t, int);
  46 int      __bt_put(const DB *dbp, DBT *, const DBT *, u_int);
  47 int      __bt_ret(BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int);
  48 EPG     *__bt_search(BTREE *, const DBT *, int *);
  49 int      __bt_seq(const DB *, DBT *, DBT *, u_int);
  50 void     __bt_setcur(BTREE *, pgno_t, u_int);
  51 int      __bt_split(BTREE *, PAGE *,
  52             const DBT *, const DBT *, int, size_t, u_int32_t);
  53 int      __bt_sync(const DB *, u_int);
  54 
  55 int      __ovfl_delete(BTREE *, void *);
  56 int      __ovfl_get(BTREE *, void *, size_t *, void **, size_t *);
  57 int      __ovfl_put(BTREE *, const DBT *, pgno_t *);
  58 
  59 void     __bt_dnpage(DB *, pgno_t);
  60 void     __bt_dpage(PAGE *);
  61 void     __bt_dump(DB *);
  62 void     __bt_stat(DB *);

/* [previous][next][first][last][top][bottom][index][help] */