Home
last modified time | relevance | path

Searched refs:BTREE (Results 1 – 25 of 26) sorted by relevance

12

/freebsd/lib/libc/db/btree/
H A Dextern.h33 int __bt_cmp(BTREE *, const DBT *, EPG *);
34 int __bt_crsrdel(BTREE *, EPGNO *);
38 int __bt_dleaf(BTREE *, const DBT *, PAGE *, u_int);
40 int __bt_free(BTREE *, PAGE *);
42 PAGE *__bt_new(BTREE *, pgno_t *);
45 int __bt_push(BTREE *, pgno_t, int);
47 int __bt_ret(BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int);
48 EPG *__bt_search(BTREE *, const DBT *, int *);
50 void __bt_setcur(BTREE *, pgno_t, u_int);
51 int __bt_split(BTREE *, PAGE *,
[all …]
H A Dbt_seq.c45 static int __bt_first(BTREE *, const DBT *, EPG *, int *);
46 static int __bt_seqadv(BTREE *, EPG *, int);
47 static int __bt_seqset(BTREE *, EPG *, DBT *, int);
73 BTREE *t; in __bt_seq()
143 __bt_seqset(BTREE *t, EPG *ep, DBT *key, int flags) in __bt_seqset()
227 __bt_seqadv(BTREE *t, EPG *ep, int flags) in __bt_seqadv()
326 __bt_first(BTREE *t, const DBT *key, EPG *erval, int *exactp) in __bt_first()
423 __bt_setcur(BTREE *t, pgno_t pgno, u_int idx) in __bt_setcur()
H A Dbt_search.c42 static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);
43 static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);
60 __bt_search(BTREE *t, const DBT *key, int *exactp) in __bt_search()
142 __bt_snext(BTREE *t, PAGE *h, const DBT *key, int *exactp) in __bt_snext()
177 __bt_sprev(BTREE *t, PAGE *h, const DBT *key, int *exactp) in __bt_sprev()
H A Dbt_delete.c44 static int __bt_bdelete(BTREE *, const DBT *);
45 static int __bt_curdel(BTREE *, const DBT *, PAGE *, u_int);
46 static int __bt_pdelete(BTREE *, PAGE *);
47 static int __bt_relink(BTREE *, PAGE *);
48 static int __bt_stkacq(BTREE *, PAGE **, CURSOR *);
59 BTREE *t; in __bt_delete()
135 __bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c) in __bt_stkacq()
279 __bt_bdelete(BTREE *t, const DBT *key) in __bt_bdelete()
364 __bt_pdelete(BTREE *t, PAGE *h) in __bt_pdelete()
458 __bt_dleaf(BTREE *t, const DBT *key, PAGE *h, u_int idx) in __bt_dleaf()
[all …]
H A Dbt_split.c45 static int bt_broot(BTREE *, PAGE *, PAGE *, PAGE *);
46 static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
47 static int bt_preserve(BTREE *, pgno_t);
48 static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
49 static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
50 static int bt_rroot(BTREE *, PAGE *, PAGE *, PAGE *);
73 __bt_split(BTREE *t, PAGE *sp, const DBT *key, const DBT *data, int flags, in __bt_split()
333 bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_page()
431 bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_root()
474 bt_rroot(BTREE *t, PAGE *h, PAGE *l, PAGE *r) in bt_rroot()
[all …]
H A Dbt_close.c48 static int bt_meta(BTREE *);
62 BTREE *t; in __bt_close()
116 BTREE *t; in __bt_sync()
156 bt_meta(BTREE *t) in bt_meta()
H A Dbt_open.c67 static int nroot(BTREE *);
91 BTREE *t; in __bt_open()
156 if ((t = (BTREE *)calloc(1, sizeof(BTREE))) == NULL) in __bt_open()
344 nroot(BTREE *t) in nroot()
428 BTREE *t; in __bt_fd()
H A Dbt_overflow.c74 __ovfl_get(BTREE *t, void *p, size_t *ssz, void **buf, size_t *bufsz) in __ovfl_get()
128 __ovfl_put(BTREE *t, const DBT *dbt, pgno_t *pg) in __ovfl_put()
179 __ovfl_delete(BTREE *t, void *p) in __ovfl_delete()
H A Dbt_page.c54 __bt_free(BTREE *t, PAGE *h) in __bt_free()
78 __bt_new(BTREE *t, pgno_t *npg) in __bt_new()
H A Dbt_debug.c54 BTREE *t; in __bt_dump()
129 BTREE *t; in __bt_dnpage()
244 BTREE *t; in __bt_stat()
H A Dbt_put.c45 static EPG *bt_fast(BTREE *, const DBT *, const DBT *, int *);
63 BTREE *t; in __bt_put()
260 bt_fast(BTREE *t, const DBT *key, const DBT *data, int *exactp) in bt_fast()
H A Dbt_conv.c62 if (!F_ISSET(((BTREE *)t), B_NEEDSWAP)) in __bt_pgin()
127 if (!F_ISSET(((BTREE *)t), B_NEEDSWAP)) in __bt_pgout()
H A Dbt_utils.c61 __bt_ret(BTREE *t, EPG *e, DBT *key, DBT *rkey, DBT *data, DBT *rdata, int copy) in __bt_ret()
140 __bt_cmp(BTREE *t, const DBT *k1, EPG *e) in __bt_cmp()
H A Dbt_get.c59 BTREE *t; in __bt_get()
/freebsd/lib/libc/db/recno/
H A Dextern.h36 int __rec_dleaf(BTREE *, PAGE *, u_int32_t);
38 int __rec_fmap(BTREE *, recno_t);
39 int __rec_fout(BTREE *);
40 int __rec_fpipe(BTREE *, recno_t);
42 int __rec_iput(BTREE *, recno_t, const DBT *, u_int);
44 int __rec_ret(BTREE *, EPG *, recno_t, DBT *, DBT *);
45 EPG *__rec_search(BTREE *, recno_t, enum SRCHOP);
48 int __rec_vmap(BTREE *, recno_t);
49 int __rec_vout(BTREE *);
50 int __rec_vpipe(BTREE *, recno_t);
H A Drec_delete.c44 static int rec_rdelete(BTREE *, recno_t);
60 BTREE *t; in __rec_delete()
111 rec_rdelete(BTREE *t, recno_t nrec) in rec_rdelete()
143 __rec_dleaf(BTREE *t, PAGE *h, u_int32_t idx) in __rec_dleaf()
H A Drec_get.c59 BTREE *t; in __rec_get()
112 __rec_fpipe(BTREE *t, recno_t top) in __rec_fpipe()
164 __rec_vpipe(BTREE *t, recno_t top) in __rec_vpipe()
217 __rec_fmap(BTREE *t, recno_t top) in __rec_fmap()
263 __rec_vmap(BTREE *t, recno_t top) in __rec_vmap()
H A Drec_close.c58 BTREE *t; in __rec_close()
106 BTREE *t; in __rec_sync()
H A Drec_open.c55 BTREE *t; in __rec_open()
218 BTREE *t; in __rec_fd()
H A Drec_put.c58 BTREE *t; in __rec_put()
184 __rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags) in __rec_iput()
H A Drec_search.c58 __rec_search(BTREE *t, recno_t recno, enum SRCHOP op) in __rec_search()
H A Drec_seq.c57 BTREE *t; in __rec_seq()
H A Drec_utils.c56 __rec_ret(BTREE *t, EPG *e, recno_t nrec, DBT *key, DBT *data) in __rec_ret()
/freebsd/lib/libc/db/test/btree.tests/
H A Dmain.c706 BTREE *t;
738 mpool_stat(((BTREE *)db->internal)->bt_mp);
/freebsd/contrib/netbsd-tests/lib/libc/db/
H A Dh_db.c90 extern int __bt_relink(BTREE *, PAGE *);
541 BTREE *t = dbp->internal; in unlinkpg()

12