    NEXTINDEX          83 libdb/bt_conv.c 	top = NEXTINDEX(h);
    NEXTINDEX         144 libdb/bt_conv.c 	top = NEXTINDEX(h);
    NEXTINDEX         190 libdb/bt_debug.c 	top = NEXTINDEX(h);
    NEXTINDEX         278 libdb/bt_debug.c 			nkeys += NEXTINDEX(h);
    NEXTINDEX         110 libdb/bt_delete.c 			if (NEXTINDEX(h) == 1)
    NEXTINDEX         116 libdb/bt_delete.c 			if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) {
    NEXTINDEX         193 libdb/bt_delete.c 			if (parent->index != NEXTINDEX(h) - 1) {
    NEXTINDEX         269 libdb/bt_delete.c 			index = NEXTINDEX(h) - 1;
    NEXTINDEX         325 libdb/bt_delete.c 			if (NEXTINDEX(h) == 0) {
    NEXTINDEX         333 libdb/bt_delete.c 	} while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0);
    NEXTINDEX         336 libdb/bt_delete.c 	if (e->index == NEXTINDEX(h))
    NEXTINDEX         352 libdb/bt_delete.c 	if (NEXTINDEX(h) == 0) {
    NEXTINDEX         424 libdb/bt_delete.c 		if (NEXTINDEX(pg) == 1)
    NEXTINDEX         446 libdb/bt_delete.c 			for (cnt = NEXTINDEX(pg) - index; --cnt; ++ip)
    NEXTINDEX         515 libdb/bt_delete.c 	for (cnt = NEXTINDEX(h) - index; --cnt; ++ip)
    NEXTINDEX         586 libdb/bt_delete.c 		if (index < NEXTINDEX(h) - 1) {
    NEXTINDEX         599 libdb/bt_delete.c 			e.index = NEXTINDEX(pg) - 1;
    NEXTINDEX         607 libdb/bt_delete.c 		if (index == NEXTINDEX(h) - 1 && h->nextpg != P_INVALID) {
    NEXTINDEX         216 libdb/bt_put.c 	if (index < (nxtindex = NEXTINDEX(h)))
    NEXTINDEX         233 libdb/bt_put.c 			if (index == NEXTINDEX(h) - 1) {
    NEXTINDEX         296 libdb/bt_put.c 		if (t->bt_cur.index != NEXTINDEX(h) - 1)
    NEXTINDEX          82 libdb/bt_search.c 		for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) {
    NEXTINDEX         111 libdb/bt_search.c 				if (base == NEXTINDEX(h) &&
    NEXTINDEX         203 libdb/bt_search.c 	e.index = NEXTINDEX(e.page) - 1;
    NEXTINDEX         187 libdb/bt_seq.c 			if (NEXTINDEX(h) == 0) {
    NEXTINDEX         208 libdb/bt_seq.c 			if (NEXTINDEX(h) == 0) {
    NEXTINDEX         215 libdb/bt_seq.c 			pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno;
    NEXTINDEX         220 libdb/bt_seq.c 		ep->index = NEXTINDEX(h) - 1;
    NEXTINDEX         287 libdb/bt_seq.c 		if (++index == NEXTINDEX(h)) {
    NEXTINDEX         317 libdb/bt_seq.c 			index = NEXTINDEX(h) - 1;
    NEXTINDEX         401 libdb/bt_seq.c 				ep->index = NEXTINDEX(h);
    NEXTINDEX         419 libdb/bt_seq.c 	if (ep->index == NEXTINDEX(ep->page)) {
    NEXTINDEX         193 libdb/bt_split.c 				tbl = GETBLEAF(lchild, NEXTINDEX(lchild) - 1);
    NEXTINDEX         228 libdb/bt_split.c 			if (skip < (nxtindex = NEXTINDEX(h)))
    NEXTINDEX         261 libdb/bt_split.c 				dest = (char *)l + l->linp[NEXTINDEX(l) - 1];
    NEXTINDEX         279 libdb/bt_split.c 				dest = (char *)l + l->linp[NEXTINDEX(l) - 1];
    NEXTINDEX         280 libdb/bt_split.c 			((RINTERNAL *)dest)->nrecs = NEXTINDEX(lchild);
    NEXTINDEX         286 libdb/bt_split.c 			((RINTERNAL *)dest)->nrecs = NEXTINDEX(rchild);
    NEXTINDEX         377 libdb/bt_split.c 	if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {
    NEXTINDEX         507 libdb/bt_split.c 	    l->flags & P_RLEAF ? NEXTINDEX(l) : rec_total(l), l->pgno);
    NEXTINDEX         512 libdb/bt_split.c 	    r->flags & P_RLEAF ? NEXTINDEX(r) : rec_total(r), r->pgno);
    NEXTINDEX         641 libdb/bt_split.c 	for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) {
    NEXTINDEX         826 libdb/bt_split.c 	for (recs = 0, nxt = 0, top = NEXTINDEX(h); nxt < top; ++nxt)