| /src/lib/libc/db/recno/ |
| extern.h | 34 #include "../btree/extern.h"
38 int __rec_dleaf(BTREE *, PAGE *, uint32_t);
40 int __rec_fmap(BTREE *, recno_t);
41 int __rec_fout(BTREE *);
42 int __rec_fpipe(BTREE *, recno_t);
44 int __rec_iput(BTREE *, recno_t, const DBT *, u_int);
46 int __rec_ret(BTREE *, EPG *, recno_t, DBT *, DBT *);
47 EPG *__rec_search(BTREE *, recno_t, enum SRCHOP);
50 int __rec_vmap(BTREE *, recno_t);
51 int __rec_vout(BTREE *);
[all...] |
| rec_delete.c | 53 static int rec_rdelete(BTREE *, recno_t);
69 BTREE *t;
120 rec_rdelete(BTREE *t, recno_t nrec)
152 __rec_dleaf(BTREE *t, PAGE *h, uint32_t idx)
|
| rec_get.c | 54 * __REC_GET -- Get a record from the btree.
68 BTREE *t;
121 __rec_fpipe(BTREE *t, recno_t top)
174 __rec_vpipe(BTREE *t, recno_t top)
228 __rec_fmap(BTREE *t, recno_t top)
275 __rec_vmap(BTREE *t, recno_t top)
|
| rec_close.c | 65 BTREE *t;
113 BTREE *t;
|
| rec_search.c | 50 * __REC_SEARCH -- Search a btree for a key.
67 __rec_search(BTREE *t, recno_t recno, enum SRCHOP op)
|
| rec_seq.c | 66 BTREE *t;
|
| rec_utils.c | 64 __rec_ret(BTREE *t, EPG *e, recno_t nrec, DBT *key, DBT *data)
|
| rec_open.c | 62 BTREE *t;
77 /* Create a btree in memory (backed by disk). */
98 * in and make the btree structure look like a recno structure. We
228 BTREE *t;
|
| rec_put.c | 67 BTREE *t;
193 __rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags)
|
| /src/lib/libc/db/btree/ |
| extern.h | 37 int __bt_cmp(BTREE *, const DBT *, EPG *);
38 int __bt_crsrdel(BTREE *, EPGNO *);
42 int __bt_dleaf(BTREE *, const DBT *, PAGE *, unsigned int);
44 int __bt_free(BTREE *, PAGE *);
46 PAGE *__bt_new(BTREE *, pgno_t *);
49 int __bt_push(BTREE *, pgno_t, int);
51 int __bt_relink(BTREE *, PAGE *);
52 int __bt_ret(BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int);
53 EPG *__bt_search(BTREE *, const DBT *, int *);
55 void __bt_setcur(BTREE *, pgno_t, unsigned int)
[all...] |
| bt_page.c | 46 #include "btree.h"
63 __bt_free(BTREE *t, PAGE *h)
87 __bt_new(BTREE *t, pgno_t *npg)
|
| bt_close.c | 52 #include "btree.h"
54 static int bt_meta(BTREE *);
57 * BT_CLOSE -- Close a btree.
68 BTREE *t;
111 * BT_SYNC -- sync the btree to disk.
122 BTREE *t;
162 bt_meta(BTREE *t)
|
| bt_seq.c | 52 #include "btree.h"
54 static int __bt_first(BTREE *, const DBT *, EPG *, int *);
55 static int __bt_seqadv(BTREE *, EPG *, int);
56 static int __bt_seqset(BTREE *, EPG *, DBT *, int);
57 static int __bt_rseq_next(BTREE *, EPG *);
58 static int __bt_rseq_prev(BTREE *, EPG *);
70 * Btree sequential scan interface.
84 BTREE *t;
156 __bt_seqset(BTREE *t, EPG *ep, DBT *key, int flags)
246 __bt_seqadv(BTREE *t, EPG *ep, int flags
[all...] |
| bt_search.c | 49 #include "btree.h"
51 static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);
52 static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);
56 * Search a btree for a key.
69 __bt_search(BTREE *t, const DBT *key, int *exactp)
151 __bt_snext(BTREE *t, PAGE *h, const DBT *key, int *exactp)
228 __bt_sprev(BTREE *t, PAGE *h, const DBT *key, int *exactp)
|
| bt_overflow.c | 51 #include "btree.h"
83 __ovfl_get(BTREE *t, void *p, size_t *ssz, void **buf, size_t *bufsz)
140 __ovfl_put(BTREE *t, const DBT *dbt, pgno_t *pg)
197 __ovfl_delete(BTREE *t, void *p)
|
| bt_delete.c | 51 #include "btree.h"
53 static int __bt_bdelete(BTREE *, const DBT *);
54 static int __bt_curdel(BTREE *, const DBT *, PAGE *, u_int);
55 static int __bt_pdelete(BTREE *, PAGE *);
56 static int __bt_stkacq(BTREE *, PAGE **, CURSOR *);
67 BTREE *t;
144 __bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c)
288 __bt_bdelete(BTREE *t, const DBT *key)
373 __bt_pdelete(BTREE *t, PAGE *h)
468 __bt_dleaf(BTREE *t, const DBT *key, PAGE *h, u_int idx
[all...] |
| bt_get.c | 51 #include "btree.h"
54 * __BT_GET -- Get a record from the btree.
68 BTREE *t;
|
| bt_open.c | 43 * Implementation of btree access method for 4.4BSD.
45 * The design here was originally based on that of the btree access method
65 #include "btree.h"
73 static int nroot(BTREE *);
76 * __BT_OPEN -- Open a btree.
79 * opens the btree.
97 BTREE *t;
162 /* Allocate and initialize DB and BTREE structures. */
165 memset(t, 0, sizeof(BTREE));
190 * If no file name was supplied, this is an in-memory btree and w
[all...] |
| bt_split.c | 52 #include "btree.h"
54 static int bt_broot(BTREE *, PAGE *, PAGE *, PAGE *);
55 static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
56 static int bt_preserve(BTREE *, pgno_t);
57 static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
58 static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
59 static int bt_rroot(BTREE *, PAGE *, PAGE *, PAGE *);
82 __bt_split(BTREE *t, PAGE *sp, const DBT *key, const DBT *data, int flags,
333 * BT_PAGE -- Split a non-root page of a btree.
347 bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen
[all...] |
| bt_conv.c | 47 #include "btree.h"
70 if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))
137 if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))
|
| bt_put.c | 52 #include "btree.h"
54 static EPG *bt_fast(BTREE *, const DBT *, const DBT *, int *);
57 * __BT_PUT -- Add a btree item to the tree.
72 BTREE *t;
268 bt_fast(BTREE *t, const DBT *key, const DBT *data, int *exactp)
|
| bt_debug.c | 48 #include "btree.h"
83 BTREE *t;
180 BTREE *t;
303 BTREE *t;
|
| bt_utils.c | 50 #include "btree.h"
69 __bt_ret(BTREE *t, EPG *e, DBT *key, DBT *rkey, DBT *data, DBT *rdata, int copy)
148 __bt_cmp(BTREE *t, const DBT *k1, EPG *e)
|
| btree.h | 1 /* $NetBSD: btree.h,v 1.18 2022/04/19 20:32:15 rillig Exp $ */
34 * @(#)btree.h 8.11 (Berkeley) 8/17/94
53 * Page 0 of a btree file contains a copy of the meta-data. This page is also
55 * to page 0. Page 1 is the root of the btree.
62 * There are five page layouts in the btree: btree internal pages (BINTERNAL),
63 * btree leaf pages (BLEAF), recno internal pages (RINTERNAL), recno leaf pages
74 #define P_BINTERNAL 0x01 /* btree internal page */
125 * For the btree internal pages, the item is a key. BINTERNALs are {key, pgno}
195 /* For the btree leaf pages, the item is a key and data pair. *
[all...] |
| /src/tests/lib/libc/db/ |
| h_db.c | 60 #include "btree.h"
87 extern int __bt_relink(BTREE *, PAGE *);
526 BTREE *t = dbp->internal;
602 if (!strcmp(s, "btree"))
608 errx(1, "%s: unknown type (use btree, hash or recno)", s);
|
