Searched refs:BTREE (Results 1 - 25 of 27) sorted by relevance

12

/freebsd-11-stable/lib/libc/db/recno/
H A Dextern.h37 int __rec_dleaf(BTREE *, PAGE *, u_int32_t);
39 int __rec_fmap(BTREE *, recno_t);
40 int __rec_fout(BTREE *);
41 int __rec_fpipe(BTREE *, recno_t);
43 int __rec_iput(BTREE *, recno_t, const DBT *, u_int);
45 int __rec_ret(BTREE *, EPG *, recno_t, DBT *, DBT *);
46 EPG *__rec_search(BTREE *, recno_t, enum SRCHOP);
49 int __rec_vmap(BTREE *, recno_t);
50 int __rec_vout(BTREE *);
51 int __rec_vpipe(BTREE *, recno_
[all...]
H A Drec_delete.c48 static int rec_rdelete(BTREE *, recno_t);
64 BTREE *t;
115 rec_rdelete(BTREE *t, recno_t nrec)
147 __rec_dleaf(BTREE *t, PAGE *h, u_int32_t idx)
H A Drec_get.c63 BTREE *t;
116 __rec_fpipe(BTREE *t, recno_t top)
168 __rec_vpipe(BTREE *t, recno_t top)
221 __rec_fmap(BTREE *t, recno_t top)
267 __rec_vmap(BTREE *t, recno_t top)
H A Drec_close.c62 BTREE *t;
110 BTREE *t;
H A Drec_search.c62 __rec_search(BTREE *t, recno_t recno, enum SRCHOP op)
H A Drec_seq.c62 BTREE *t;
H A Drec_utils.c60 __rec_ret(BTREE *t, EPG *e, recno_t nrec, DBT *key, DBT *data)
H A Drec_open.c59 BTREE *t;
222 BTREE *t;
H A Drec_put.c62 BTREE *t;
188 __rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags)
/freebsd-11-stable/lib/libc/db/btree/
H A Dextern.h34 int __bt_cmp(BTREE *, const DBT *, EPG *);
35 int __bt_crsrdel(BTREE *, EPGNO *);
39 int __bt_dleaf(BTREE *, const DBT *, PAGE *, u_int);
41 int __bt_free(BTREE *, PAGE *);
43 PAGE *__bt_new(BTREE *, pgno_t *);
46 int __bt_push(BTREE *, pgno_t, int);
48 int __bt_ret(BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int);
49 EPG *__bt_search(BTREE *, const DBT *, int *);
51 void __bt_setcur(BTREE *, pgno_t, u_int);
52 int __bt_split(BTREE *, PAG
[all...]
H A Dbt_page.c58 __bt_free(BTREE *t, PAGE *h)
82 __bt_new(BTREE *t, pgno_t *npg)
H A Dbt_search.c46 static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);
47 static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);
64 __bt_search(BTREE *t, const DBT *key, int *exactp)
146 __bt_snext(BTREE *t, PAGE *h, const DBT *key, int *exactp)
181 __bt_sprev(BTREE *t, PAGE *h, const DBT *key, int *exactp)
H A Dbt_close.c52 static int bt_meta(BTREE *);
66 BTREE *t;
120 BTREE *t;
160 bt_meta(BTREE *t)
H A Dbt_seq.c49 static int __bt_first(BTREE *, const DBT *, EPG *, int *);
50 static int __bt_seqadv(BTREE *, EPG *, int);
51 static int __bt_seqset(BTREE *, EPG *, DBT *, int);
77 BTREE *t;
147 __bt_seqset(BTREE *t, EPG *ep, DBT *key, int flags)
231 __bt_seqadv(BTREE *t, EPG *ep, int flags)
330 __bt_first(BTREE *t, const DBT *key, EPG *erval, int *exactp)
427 __bt_setcur(BTREE *t, pgno_t pgno, u_int idx)
H A Dbt_split.c49 static int bt_broot(BTREE *, PAGE *, PAGE *, PAGE *);
50 static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
51 static int bt_preserve(BTREE *, pgno_t);
52 static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
53 static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
54 static int bt_rroot(BTREE *, PAGE *, PAGE *, PAGE *);
77 __bt_split(BTREE *t, PAGE *sp, const DBT *key, const DBT *data, int flags,
337 bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
435 bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
478 bt_rroot(BTREE *
[all...]
H A Dbt_delete.c48 static int __bt_bdelete(BTREE *, const DBT *);
49 static int __bt_curdel(BTREE *, const DBT *, PAGE *, u_int);
50 static int __bt_pdelete(BTREE *, PAGE *);
51 static int __bt_relink(BTREE *, PAGE *);
52 static int __bt_stkacq(BTREE *, PAGE **, CURSOR *);
63 BTREE *t;
139 __bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c)
283 __bt_bdelete(BTREE *t, const DBT *key)
368 __bt_pdelete(BTREE *t, PAGE *h)
462 __bt_dleaf(BTREE *
[all...]
H A Dbt_overflow.c78 __ovfl_get(BTREE *t, void *p, size_t *ssz, void **buf, size_t *bufsz)
132 __ovfl_put(BTREE *t, const DBT *dbt, pgno_t *pg)
183 __ovfl_delete(BTREE *t, void *p)
H A Dbt_open.c71 static int nroot(BTREE *);
95 BTREE *t;
159 /* Allocate and initialize DB and BTREE structures. */
160 if ((t = (BTREE *)calloc(1, sizeof(BTREE))) == NULL)
348 nroot(BTREE *t)
433 BTREE *t;
H A Dbt_get.c63 BTREE *t;
H A Dbt_conv.c66 if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))
131 if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))
H A Dbt_put.c49 static EPG *bt_fast(BTREE *, const DBT *, const DBT *, int *);
67 BTREE *t;
264 bt_fast(BTREE *t, const DBT *key, const DBT *data, int *exactp)
H A Dbt_debug.c58 BTREE *t;
133 BTREE *t;
248 BTREE *t;
H A Dbt_utils.c65 __bt_ret(BTREE *t, EPG *e, DBT *key, DBT *rkey, DBT *data, DBT *rdata, int copy)
144 __bt_cmp(BTREE *t, const DBT *k1, EPG *e)
H A Dbtree.h378 } BTREE; typedef in typeref:struct:_btree
/freebsd-11-stable/lib/libc/db/test/btree.tests/
H A Dmain.c710 BTREE *t;
732 (void)printf("BTREE\n");
742 mpool_stat(((BTREE *)db->internal)->bt_mp);

Completed in 80 milliseconds

12