Home | History | Annotate | Download | only in btree

Lines Matching refs:BTREE

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)
414 * Split right. The key/data pairs aren't sorted in the btree page so
434 * BT_ROOT -- Split the root page of a btree.
448 bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
491 bt_rroot(BTREE *t, PAGE *h, PAGE *l, PAGE *r)
524 * BT_BROOT -- Fix up the btree root page after it has been split.
536 bt_broot(BTREE *t, PAGE *h, PAGE *l, PAGE *r)
548 * The btree comparison code guarantees that the left-most key on any
591 /* Unpin the root page, set to btree internal page. */
614 bt_psplit(BTREE *t, PAGE *h, PAGE *l, PAGE *r, indx_t *pskip, size_t ilen)
798 bt_preserve(BTREE *t, pgno_t pg)