NUMKEYS
char key_write[NUMKEYS][10];
if (strlen(keys = optarg) != NUMKEYS)
for (i = 0; i < NUMKEYS; i++) {
for (j = i+1; j < NUMKEYS; j++) {
NUMKEYS(mp),
assert(NUMKEYS(mp) > 0);
high = NUMKEYS(mp) - 1;
if (i >= NUMKEYS(mp))
if (up->parent_index + 1 < (indx_t)NUMKEYS(up->parent)) {
DPRINTF("branch page %u has %lu keys", mp->pgno, NUMKEYS(mp));
assert(NUMKEYS(mp) > 1);
i = NUMKEYS(mp) - 1;
assert(i >= 0 && i < NUMKEYS(mp));
if (move_right ? (parent->ki + 1 >= NUMKEYS(parent->mpage))
if (top->ki + 1 >= NUMKEYS(mp)) {
mp->pgno, NUMKEYS(mp), top->ki);
mp->pgno, NUMKEYS(mp));
for (i = NUMKEYS(mp); i > indx; i--)
assert(indx < NUMKEYS(mp));
numkeys = NUMKEYS(mp);
numkeys = NUMKEYS(mp);
for (i = 0; i < NUMKEYS(src); i++) {
for (i = 0; i < NUMKEYS(src); i++) {
rc = btree_add_node(bt, dst, NUMKEYS(dst), &key,
dst->pgno, NUMKEYS(dst), (float)PAGEFILL(bt, dst) / 10);
mp->pgno, NUMKEYS(mp), (float)PAGEFILL(bt, mp) / 10);
if (NUMKEYS(mp) == 0) {
} else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
assert(NUMKEYS(parent) > 1);
di = NUMKEYS(mp);
si = NUMKEYS(neighbor) - 1;
neighbor->pgno, NUMKEYS(neighbor), (float)PAGEFILL(bt, neighbor) / 10);
if (PAGEFILL(bt, neighbor) >= FILL_THRESHOLD && NUMKEYS(neighbor) >= 2)
mp->parent_index >= NUMKEYS(mp->parent)) {
ki = NUMKEYS(mp);
NUMKEYS(mp), ki);