indx_t
indx_t i, top;
indx_t i, top;
indx_t cur, top, lim;
lim = (pgsize - BTDATAOFF) / sizeof(indx_t);
indx_t idx = 0;
indx_t cnt, idx, *ip, offset;
pg->lower -= sizeof(indx_t);
indx_t cnt, *ip, offset;
h->lower -= sizeof(indx_t);
b.psize & (sizeof(indx_t) - 1)))
m.psize & (sizeof(indx_t) - 1))
(sizeof(indx_t) + NBLEAFDBT(0, 0));
if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t))
NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t);
< nbytes + sizeof(indx_t)) {
(nxtindex - idx) * sizeof(indx_t));
h->lower += sizeof(indx_t);
if ((u_int32_t)h->upper - (u_int32_t)h->lower < nbytes + sizeof(indx_t))
indx_t idx, nxtindex;
indx_t idx = 0;
indx_t idx = 0;
indx_t base, idx, lim;
indx_t idx = 0;
indx_t idx;
indx_t idx;
< nbytes + sizeof(indx_t)) {
(nxtindex - skip) * sizeof(indx_t));
h->lower += sizeof(indx_t);
bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
r->lower = BTDATAOFF + sizeof(indx_t);
bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
h->lower = BTDATAOFF + 2 * sizeof(indx_t);
__P((BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t));
__P((BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t));
h->lower = BTDATAOFF + 2 * sizeof(indx_t);
__P((BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t));
bt_psplit(BTREE *t, PAGE *h, PAGE *l, PAGE *r, indx_t *pskip, size_t ilen)
indx_t full, half, nxt, off, skip, top, used;
if ((skip <= off && used + nbytes + sizeof(indx_t) >= full)
used += nbytes + sizeof(indx_t);
l->lower += (off + 1) * sizeof(indx_t);
skip = (indx_t)-1;
skip = (indx_t)-1;
r->lower += off * sizeof(indx_t);
r->lower += sizeof(indx_t);
indx_t nxt, top;
indx_t nxtindex;
indx_t index; /* the index on the page */
indx_t index; /* the index on the page */
indx_t bt_ovflsize; /* cut-off for key/data overflow */
indx_t lower; /* lower bound of free space on page */
indx_t upper; /* upper bound of free space on page */
indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */
sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t))
#define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))
PAGE16 *__add_bigpage __P((HTAB *, PAGE16 *, indx_t, const u_int8_t));
int32_t __big_delete __P((HTAB *, PAGE16 *, indx_t));
int32_t __get_bigkey __P((HTAB *, PAGE16 *, indx_t, DBT *));
indx_t ndx;
indx_t pgndx;
indx_t key_off;
indx_t data_off;
indx_t ndx;
indx_t pgndx;
__big_delete(HTAB *hashp, PAGE16 *pagep, indx_t ndx)
__get_bigkey(HTAB *hashp, PAGE16 *pagep, indx_t ndx, DBT *key)
indx_t key_move_bytes, val_move_bytes;
static indx_t
static indx_t
prev_realkey(PAGE16 * pagep, indx_t n)
indx_t ndx;
add_bigptr(HTAB * hashp, ITEM_INFO * item_info, indx_t big_pgno)
__add_bigpage(HTAB * hashp, PAGE16 * pagep, indx_t ndx, const u_int8_t
DATA_OFF(pagep, ndx) = (indx_t)ovfl_num;
static int32_t add_bigptr __P((HTAB *, ITEM_INFO *, indx_t));
static indx_t prev_realkey __P((PAGE16 *, indx_t));
#define OFFSET(P) (REFERENCE((P), indx_t, I_HF_OFFSET))
REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD + sizeof(indx_t))
REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD)
#define PAGE_OVERHEAD (I_HF_OFFSET + sizeof(indx_t))
#define PAIR_OVERHEAD ((sizeof(indx_t) << 1))
#define NUM_ENT(P) (REFERENCE((P), indx_t, I_ENTRIES))
indx_t *ip, cnt, offset;
h->lower -= sizeof(indx_t);
indx_t len;
indx_t idx, nxtindex;
< nbytes + sizeof(indx_t)) {
(nxtindex - idx) * sizeof(indx_t));
h->lower += sizeof(indx_t);
indx_t idx;
indx_t top;
indx_t i, top;
indx_t i, top;
indx_t cur, top;
indx_t idx;
indx_t cnt, idx, *ip, offset;
pg->lower -= sizeof(indx_t);
indx_t cnt, *ip, offset;
h->lower -= sizeof(indx_t);
b.psize & (sizeof(indx_t) - 1) ))
m.psize & (sizeof(indx_t) - 1) )
(sizeof(indx_t) + NBLEAFDBT(0, 0));
if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t))
NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t);
if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {
(nxtindex - idx) * sizeof(indx_t));
h->lower += sizeof(indx_t);
if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t))
indx_t idx, nxtindex;
indx_t base, idx, lim;
indx_t idx;
if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {
(nxtindex - skip) * sizeof(indx_t));
h->lower += sizeof(indx_t);
bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
r->lower = BTDATAOFF + sizeof(indx_t);
bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
h->lower = BTDATAOFF + 2 * sizeof(indx_t);
static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
h->lower = BTDATAOFF + 2 * sizeof(indx_t);
bt_psplit(BTREE *t, PAGE *h, PAGE *l, PAGE *r, indx_t *pskip, size_t ilen)
indx_t full, half, nxt, off, skip, top, used;
if ((skip <= off && used + nbytes + sizeof(indx_t) >= full) ||
used += nbytes + sizeof(indx_t);
l->lower += (off + 1) * sizeof(indx_t);
r->lower += off * sizeof(indx_t);
r->lower += sizeof(indx_t);
indx_t nxt, top;
indx_t nxtindex;
indx_t index; /* the index on the page */
indx_t index; /* the index on the page */
indx_t bt_ovflsize; /* cut-off for key/data overflow */
indx_t lower; /* lower bound of free space on page */
indx_t upper; /* upper bound of free space on page */
indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */
sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t))
#define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))
indx_t *ip, cnt, offset;
h->lower -= sizeof(indx_t);
indx_t idx, nxtindex;
if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {
(nxtindex - idx) * sizeof(indx_t));
h->lower += sizeof(indx_t);
indx_t idx;
indx_t top;