Asterisk - The Open Source Telephony Project GIT-master-f36a736
recno/extern.h
Go to the documentation of this file.
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
39int __rec_delete __P((const DB *, const DBT *, u_int));
41int __rec_fd __P((const DB *));
43int __rec_fout __P((BTREE *));
45int __rec_get __P((const DB *, const DBT *, DBT *, u_int));
46int __rec_iput __P((BTREE *, recno_t, const DBT *, u_int));
47int __rec_put __P((const DB *dbp, DBT *, const DBT *, u_int));
48int __rec_ret __P((BTREE *, EPG *, recno_t, DBT *, DBT *));
50int __rec_seq __P((const DB *, DBT *, DBT *, u_int));
51int __rec_sync __P((const DB *, u_int));
52int __rec_vmap __P((BTREE *, recno_t));
53int __rec_vout __P((BTREE *));
u_int32_t recno_t
Definition: db.h:82
static DB * dbp
Definition: hsearch.c:49
unsigned int u_int32_t
int __rec_close(DB *dbp)
Definition: rec_close.c:60
int __rec_sync(DB *dbp, u_int flags) const
Definition: rec_close.c:107
int __rec_delete(DB *dbp, const DBT *key, u_int flags) const
Definition: rec_delete.c:64
int __rec_dleaf(BTREE *t, PAGE *h, u_int32_t idx)
Definition: rec_delete.c:154
int __rec_vmap(BTREE *t, recno_t top)
Definition: rec_get.c:285
int __rec_fpipe(BTREE *t, recno_t top)
Definition: rec_get.c:122
int __rec_get(DB *dbp, const DBT *key, DBT *data, u_int flags) const
Definition: rec_get.c:63
int __rec_vpipe(BTREE *t, recno_t top)
Definition: rec_get.c:178
int __rec_fmap(BTREE *t, recno_t top)
Definition: rec_get.c:235
int __rec_fd(DB *dbp) const
Definition: rec_open.c:222
int __rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags)
Definition: rec_put.c:190
int __rec_put(DB *dbp, DBT *key, const DBT *data, u_int flags) const
Definition: rec_put.c:62
EPG * __rec_search(BTREE *t, recno_t recno, enum SRCHOP op)
Definition: rec_search.c:64
int __rec_seq(DB *dbp, DBT *key, DBT *data, u_int flags) const
Definition: rec_seq.c:61
int __rec_ret(BTREE *t, EPG *e, recno_t nrec, DBT *key, DBT *data)
Definition: rec_utils.c:62
int __rec_close __P((DB *))
SRCHOP
Definition: recno.h:36
Definition: db.h:85
Definition: db.h:129
Definition: btree.h:312
Definition: btree.h:254
Definition: btree.h:75