FREESPACE
key_move_bytes = MIN(FREESPACE(pagep), key_size);
MIN(FREESPACE(pagep) - key_move_bytes, val_size);
FREESPACE(cursorp->pagep) > item_info->seek_size)
#define PAIRFITS(P,K,D) ((PAIRSIZE((K),(D))) <= FREESPACE((P)))
#define BIGPAIRFITS(P) ((FREESPACE((P)) >= PAIR_OVERHEAD))
space = FREESPACE(p) - BIGOVERHEAD) {
FREESPACE(p) = off - PAGE_META(n);
space = FREESPACE(p);
FREESPACE(p) = FREESPACE(p) - move_bytes;
for (space = FREESPACE(p) - BIGOVERHEAD; val_size;
space = FREESPACE(p) - BIGOVERHEAD) {
FREESPACE(p) = off - PAGE_META(n);
if (bp[2] == FULL_KEY_DATA && FREESPACE(bp))
FREESPACE(bp) = hashp->BSIZE - PAGE_META(n);
((n == 2) || (bp[n] == OVFLPAGE) || (FREESPACE(bp))))
if (!FREESPACE(bp)) {
assert(FREESPACE(tp) >= OVFLSIZE);
free_space = FREESPACE(tp);
FREESPACE(tp) = free_space - OVFLSIZE;
free_space = FREESPACE(tp);
FREESPACE(tp) = free_space + OVFLSIZE;
for (space = FREESPACE(p) - BIGOVERHEAD; key_size;
FREESPACE(ino) = copyto - sizeof(u_int16_t) * (ino[0] + 3);
FREESPACE(ino) =
FREESPACE(bp) >= PAIRSIZE(key, val)) {
sp[ndx + 3] = FREESPACE(sp) - OVFLSIZE;
free_space = FREESPACE(sp);
FREESPACE(sp) = free_space - PAIRSIZE(key, val);
(PAIRSIZE((K),(D)) + OVFLSIZE) <= FREESPACE((P)))