Symbol: BTREE
lib/libc/db/btree/bt_close.c
122
BTREE *t;
lib/libc/db/btree/bt_close.c
162
bt_meta(BTREE *t)
lib/libc/db/btree/bt_close.c
54
static int bt_meta(BTREE *);
lib/libc/db/btree/bt_close.c
68
BTREE *t;
lib/libc/db/btree/bt_conv.c
137
if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))
lib/libc/db/btree/bt_conv.c
70
if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))
lib/libc/db/btree/bt_debug.c
180
BTREE *t;
lib/libc/db/btree/bt_debug.c
303
BTREE *t;
lib/libc/db/btree/bt_debug.c
83
BTREE *t;
lib/libc/db/btree/bt_delete.c
144
__bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c)
lib/libc/db/btree/bt_delete.c
288
__bt_bdelete(BTREE *t, const DBT *key)
lib/libc/db/btree/bt_delete.c
373
__bt_pdelete(BTREE *t, PAGE *h)
lib/libc/db/btree/bt_delete.c
468
__bt_dleaf(BTREE *t, const DBT *key, PAGE *h, u_int idx)
lib/libc/db/btree/bt_delete.c
529
__bt_curdel(BTREE *t, const DBT *key, PAGE *h, u_int idx)
lib/libc/db/btree/bt_delete.c
53
static int __bt_bdelete(BTREE *, const DBT *);
lib/libc/db/btree/bt_delete.c
54
static int __bt_curdel(BTREE *, const DBT *, PAGE *, u_int);
lib/libc/db/btree/bt_delete.c
55
static int __bt_pdelete(BTREE *, PAGE *);
lib/libc/db/btree/bt_delete.c
56
static int __bt_stkacq(BTREE *, PAGE **, CURSOR *);
lib/libc/db/btree/bt_delete.c
624
__bt_relink(BTREE *t, PAGE *h)
lib/libc/db/btree/bt_delete.c
67
BTREE *t;
lib/libc/db/btree/bt_get.c
68
BTREE *t;
lib/libc/db/btree/bt_open.c
166
memset(t, 0, sizeof(BTREE));
lib/libc/db/btree/bt_open.c
353
nroot(BTREE *t)
lib/libc/db/btree/bt_open.c
413
BTREE *t;
lib/libc/db/btree/bt_open.c
74
static int nroot(BTREE *);
lib/libc/db/btree/bt_open.c
98
BTREE *t;
lib/libc/db/btree/bt_overflow.c
140
__ovfl_put(BTREE *t, const DBT *dbt, pgno_t *pg)
lib/libc/db/btree/bt_overflow.c
197
__ovfl_delete(BTREE *t, void *p)
lib/libc/db/btree/bt_overflow.c
83
__ovfl_get(BTREE *t, void *p, size_t *ssz, void **buf, size_t *bufsz)
lib/libc/db/btree/bt_page.c
63
__bt_free(BTREE *t, PAGE *h)
lib/libc/db/btree/bt_page.c
87
__bt_new(BTREE *t, pgno_t *npg)
lib/libc/db/btree/bt_put.c
268
bt_fast(BTREE *t, const DBT *key, const DBT *data, int *exactp)
lib/libc/db/btree/bt_put.c
54
static EPG *bt_fast(BTREE *, const DBT *, const DBT *, int *);
lib/libc/db/btree/bt_put.c
72
BTREE *t;
lib/libc/db/btree/bt_search.c
151
__bt_snext(BTREE *t, PAGE *h, const DBT *key, int *exactp)
lib/libc/db/btree/bt_search.c
228
__bt_sprev(BTREE *t, PAGE *h, const DBT *key, int *exactp)
lib/libc/db/btree/bt_search.c
51
static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);
lib/libc/db/btree/bt_search.c
52
static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);
lib/libc/db/btree/bt_search.c
69
__bt_search(BTREE *t, const DBT *key, int *exactp)
lib/libc/db/btree/bt_seq.c
156
__bt_seqset(BTREE *t, EPG *ep, DBT *key, int flags)
lib/libc/db/btree/bt_seq.c
246
__bt_seqadv(BTREE *t, EPG *ep, int flags)
lib/libc/db/btree/bt_seq.c
375
__bt_rseq_next(BTREE *t, EPG *ep)
lib/libc/db/btree/bt_seq.c
414
__bt_rseq_prev(BTREE *t, EPG *ep)
lib/libc/db/btree/bt_seq.c
464
__bt_first(BTREE *t, const DBT *key, EPG *erval, int *exactp)
lib/libc/db/btree/bt_seq.c
54
static int __bt_first(BTREE *, const DBT *, EPG *, int *);
lib/libc/db/btree/bt_seq.c
55
static int __bt_seqadv(BTREE *, EPG *, int);
lib/libc/db/btree/bt_seq.c
56
static int __bt_seqset(BTREE *, EPG *, DBT *, int);
lib/libc/db/btree/bt_seq.c
561
__bt_setcur(BTREE *t, pgno_t pgno, u_int idx)
lib/libc/db/btree/bt_seq.c
57
static int __bt_rseq_next(BTREE *, EPG *);
lib/libc/db/btree/bt_seq.c
58
static int __bt_rseq_prev(BTREE *, EPG *);
lib/libc/db/btree/bt_seq.c
84
BTREE *t;
lib/libc/db/btree/bt_split.c
347
bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
lib/libc/db/btree/bt_split.c
448
bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
lib/libc/db/btree/bt_split.c
491
bt_rroot(BTREE *t, PAGE *h, PAGE *l, PAGE *r)
lib/libc/db/btree/bt_split.c
536
bt_broot(BTREE *t, PAGE *h, PAGE *l, PAGE *r)
lib/libc/db/btree/bt_split.c
54
static int bt_broot(BTREE *, PAGE *, PAGE *, PAGE *);
lib/libc/db/btree/bt_split.c
55
static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
lib/libc/db/btree/bt_split.c
56
static int bt_preserve(BTREE *, pgno_t);
lib/libc/db/btree/bt_split.c
57
static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
lib/libc/db/btree/bt_split.c
58
static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
lib/libc/db/btree/bt_split.c
59
static int bt_rroot(BTREE *, PAGE *, PAGE *, PAGE *);
lib/libc/db/btree/bt_split.c
614
bt_psplit(BTREE *t, PAGE *h, PAGE *l, PAGE *r, indx_t *pskip, size_t ilen)
lib/libc/db/btree/bt_split.c
798
bt_preserve(BTREE *t, pgno_t pg)
lib/libc/db/btree/bt_split.c
82
__bt_split(BTREE *t, PAGE *sp, const DBT *key, const DBT *data, int flags,
lib/libc/db/btree/bt_utils.c
148
__bt_cmp(BTREE *t, const DBT *k1, EPG *e)
lib/libc/db/btree/bt_utils.c
69
__bt_ret(BTREE *t, EPG *e, DBT *key, DBT *rkey, DBT *data, DBT *rdata, int copy)
lib/libc/db/btree/extern.h
37
int __bt_cmp(BTREE *, const DBT *, EPG *);
lib/libc/db/btree/extern.h
38
int __bt_crsrdel(BTREE *, EPGNO *);
lib/libc/db/btree/extern.h
42
int __bt_dleaf(BTREE *, const DBT *, PAGE *, unsigned int);
lib/libc/db/btree/extern.h
44
int __bt_free(BTREE *, PAGE *);
lib/libc/db/btree/extern.h
46
PAGE *__bt_new(BTREE *, pgno_t *);
lib/libc/db/btree/extern.h
49
int __bt_push(BTREE *, pgno_t, int);
lib/libc/db/btree/extern.h
51
int __bt_relink(BTREE *, PAGE *);
lib/libc/db/btree/extern.h
52
int __bt_ret(BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int);
lib/libc/db/btree/extern.h
53
EPG *__bt_search(BTREE *, const DBT *, int *);
lib/libc/db/btree/extern.h
55
void __bt_setcur(BTREE *, pgno_t, unsigned int);
lib/libc/db/btree/extern.h
56
int __bt_split(BTREE *, PAGE *,
lib/libc/db/btree/extern.h
60
int __ovfl_delete(BTREE *, void *);
lib/libc/db/btree/extern.h
61
int __ovfl_get(BTREE *, void *, size_t *, void **, size_t *);
lib/libc/db/btree/extern.h
62
int __ovfl_put(BTREE *, const DBT *, pgno_t *);
lib/libc/db/recno/extern.h
38
int __rec_dleaf(BTREE *, PAGE *, uint32_t);
lib/libc/db/recno/extern.h
40
int __rec_fmap(BTREE *, recno_t);
lib/libc/db/recno/extern.h
41
int __rec_fout(BTREE *);
lib/libc/db/recno/extern.h
42
int __rec_fpipe(BTREE *, recno_t);
lib/libc/db/recno/extern.h
44
int __rec_iput(BTREE *, recno_t, const DBT *, u_int);
lib/libc/db/recno/extern.h
46
int __rec_ret(BTREE *, EPG *, recno_t, DBT *, DBT *);
lib/libc/db/recno/extern.h
47
EPG *__rec_search(BTREE *, recno_t, enum SRCHOP);
lib/libc/db/recno/extern.h
50
int __rec_vmap(BTREE *, recno_t);
lib/libc/db/recno/extern.h
51
int __rec_vout(BTREE *);
lib/libc/db/recno/extern.h
52
int __rec_vpipe(BTREE *, recno_t);
lib/libc/db/recno/rec_close.c
113
BTREE *t;
lib/libc/db/recno/rec_close.c
65
BTREE *t;
lib/libc/db/recno/rec_delete.c
120
rec_rdelete(BTREE *t, recno_t nrec)
lib/libc/db/recno/rec_delete.c
152
__rec_dleaf(BTREE *t, PAGE *h, uint32_t idx)
lib/libc/db/recno/rec_delete.c
53
static int rec_rdelete(BTREE *, recno_t);
lib/libc/db/recno/rec_delete.c
69
BTREE *t;
lib/libc/db/recno/rec_get.c
121
__rec_fpipe(BTREE *t, recno_t top)
lib/libc/db/recno/rec_get.c
174
__rec_vpipe(BTREE *t, recno_t top)
lib/libc/db/recno/rec_get.c
228
__rec_fmap(BTREE *t, recno_t top)
lib/libc/db/recno/rec_get.c
275
__rec_vmap(BTREE *t, recno_t top)
lib/libc/db/recno/rec_get.c
68
BTREE *t;
lib/libc/db/recno/rec_open.c
228
BTREE *t;
lib/libc/db/recno/rec_open.c
62
BTREE *t;
lib/libc/db/recno/rec_put.c
193
__rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags)
lib/libc/db/recno/rec_put.c
67
BTREE *t;
lib/libc/db/recno/rec_search.c
67
__rec_search(BTREE *t, recno_t recno, enum SRCHOP op)
lib/libc/db/recno/rec_seq.c
66
BTREE *t;
lib/libc/db/recno/rec_utils.c
64
__rec_ret(BTREE *t, EPG *e, recno_t nrec, DBT *key, DBT *data)
sys/net/zlib.c
4028
if (s->mode == BTREE || s->mode == DTREE)
sys/net/zlib.c
4184
s->mode = BTREE;
sys/net/zlib.c
4185
case BTREE:
tests/lib/libc/db/h_db.c
526
BTREE *t = dbp->internal;
tests/lib/libc/db/h_db.c
87
extern int __bt_relink(BTREE *, PAGE *);