lib/libc/db/btree/bt_conv.c

145

top = NEXTINDEX(h);

lib/libc/db/btree/bt_conv.c

85

top = NEXTINDEX(h);

lib/libc/db/btree/bt_debug.c

232

top = NEXTINDEX(h);

lib/libc/db/btree/bt_debug.c

326

nkeys += NEXTINDEX(h);

lib/libc/db/btree/bt_delete.c

106

if (NEXTINDEX(h) == 1)

lib/libc/db/btree/bt_delete.c

112

if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) {

lib/libc/db/btree/bt_delete.c

187

if (parent->index != NEXTINDEX(h) - 1) {

lib/libc/db/btree/bt_delete.c

263

idx = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_delete.c

317

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_delete.c

325

} while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0);

lib/libc/db/btree/bt_delete.c

328

if (e->index == NEXTINDEX(h))

lib/libc/db/btree/bt_delete.c

344

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_delete.c

414

if (NEXTINDEX(pg) == 1) {

lib/libc/db/btree/bt_delete.c

437

for (cnt = NEXTINDEX(pg) - idx; --cnt; ++ip)

lib/libc/db/btree/bt_delete.c

502

for (cnt = NEXTINDEX(h) - idx; --cnt; ++ip)

lib/libc/db/btree/bt_delete.c

569

if (idx < (unsigned)(NEXTINDEX(h) - 1)) {

lib/libc/db/btree/bt_delete.c

582

e.index = NEXTINDEX(pg) - 1;

lib/libc/db/btree/bt_delete.c

590

if (idx == (unsigned)(NEXTINDEX(h) - 1) && h->nextpg != P_INVALID) {

lib/libc/db/btree/bt_put.c

212

if (idx < (nxtindex = NEXTINDEX(h)))

lib/libc/db/btree/bt_put.c

229

if (idx == NEXTINDEX(h) - 1) {

lib/libc/db/btree/bt_put.c

292

if (t->bt_cur.index != NEXTINDEX(h) - 1)

lib/libc/db/btree/bt_search.c

112

if (base == NEXTINDEX(h) &&

lib/libc/db/btree/bt_search.c

186

if (parent->index != NEXTINDEX(h) - 1) {

lib/libc/db/btree/bt_search.c

243

e.index = NEXTINDEX(e.page) - 1;

lib/libc/db/btree/bt_search.c

285

idx = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_search.c

83

for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) {

lib/libc/db/btree/bt_seq.c

188

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_seq.c

212

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_seq.c

219

pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno;

lib/libc/db/btree/bt_seq.c

220

BT_PUSH(t, h->pgno, NEXTINDEX(h) - 1);

lib/libc/db/btree/bt_seq.c

225

ep->index = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_seq.c

320

if (++idx == NEXTINDEX(h)) {

lib/libc/db/btree/bt_seq.c

361

idx = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_seq.c

394

} while (++idx == NEXTINDEX(h));

lib/libc/db/btree/bt_seq.c

442

idx = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_seq.c

518

ep->index = NEXTINDEX(h);

lib/libc/db/btree/bt_seq.c

536

if (ep->index == NEXTINDEX(ep->page)) {

lib/libc/db/btree/bt_split.c

190

tbl = GETBLEAF(lchild, NEXTINDEX(lchild) - 1);

lib/libc/db/btree/bt_split.c

227

if (skip < (nxtindex = NEXTINDEX(h)))

lib/libc/db/btree/bt_split.c

263

dest = (char *)(void *)l + l->linp[NEXTINDEX(l) - 1];

lib/libc/db/btree/bt_split.c

281

dest = (char *)(void *)l + l->linp[NEXTINDEX(l) - 1];

lib/libc/db/btree/bt_split.c

282

((RINTERNAL *)(void *)dest)->nrecs = NEXTINDEX(lchild);

lib/libc/db/btree/bt_split.c

288

((RINTERNAL *)(void *)dest)->nrecs = NEXTINDEX(rchild);

lib/libc/db/btree/bt_split.c

375

if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {

lib/libc/db/btree/bt_split.c

506

l->flags & P_RLEAF ? NEXTINDEX(l) : rec_total(l), l->pgno);

lib/libc/db/btree/bt_split.c

511

r->flags & P_RLEAF ? NEXTINDEX(r) : rec_total(r), r->pgno);

lib/libc/db/btree/bt_split.c

640

for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) {

lib/libc/db/btree/bt_split.c

829

for (recs = 0, nxt = 0, top = NEXTINDEX(h); nxt < top; ++nxt)

lib/libc/db/recno/rec_delete.c

190

temp = &h->linp[NEXTINDEX(h)] - ip;

lib/libc/db/recno/rec_put.c

268

if (idx < (nxtindex = NEXTINDEX(h)))

lib/libc/db/recno/rec_search.c

87

for (idx = 0, top = NEXTINDEX(h);;) {

tests/lib/libc/db/h_db.c

538

if (NEXTINDEX(h) == 0)