lib/libc/db/btree/bt_conv.c

136

top = NEXTINDEX(h);

lib/libc/db/btree/bt_conv.c

78

top = NEXTINDEX(h);

lib/libc/db/btree/bt_debug.c

175

top = NEXTINDEX(h);

lib/libc/db/btree/bt_debug.c

267

nkeys += NEXTINDEX(h);

lib/libc/db/btree/bt_delete.c

105

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

lib/libc/db/btree/bt_delete.c

179

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

lib/libc/db/btree/bt_delete.c

255

idx = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_delete.c

309

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_delete.c

317

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

lib/libc/db/btree/bt_delete.c

320

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

lib/libc/db/btree/bt_delete.c

336

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_delete.c

406

if (NEXTINDEX(pg) == 1) {

lib/libc/db/btree/bt_delete.c

428

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

lib/libc/db/btree/bt_delete.c

493

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

lib/libc/db/btree/bt_delete.c

560

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

lib/libc/db/btree/bt_delete.c

573

e.index = NEXTINDEX(pg) - 1;

lib/libc/db/btree/bt_delete.c

581

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

lib/libc/db/btree/bt_delete.c

99

if (NEXTINDEX(h) == 1)

lib/libc/db/btree/bt_put.c

204

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

lib/libc/db/btree/bt_put.c

221

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

lib/libc/db/btree/bt_put.c

284

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

lib/libc/db/btree/bt_search.c

104

if (base == NEXTINDEX(h) &&

lib/libc/db/btree/bt_search.c

188

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

lib/libc/db/btree/bt_search.c

75

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

lib/libc/db/btree/bt_seq.c

174

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_seq.c

195

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_seq.c

202

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

lib/libc/db/btree/bt_seq.c

207

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

lib/libc/db/btree/bt_seq.c

271

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

lib/libc/db/btree/bt_seq.c

301

idx = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_seq.c

381

ep->index = NEXTINDEX(h);

lib/libc/db/btree/bt_seq.c

399

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

lib/libc/db/btree/bt_split.c

180

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

lib/libc/db/btree/bt_split.c

215

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

lib/libc/db/btree/bt_split.c

248

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

lib/libc/db/btree/bt_split.c

266

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

lib/libc/db/btree/bt_split.c

267

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

lib/libc/db/btree/bt_split.c

273

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

lib/libc/db/btree/bt_split.c

360

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

lib/libc/db/btree/bt_split.c

481

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

lib/libc/db/btree/bt_split.c

486

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

lib/libc/db/btree/bt_split.c

609

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

lib/libc/db/btree/bt_split.c

791

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

lib/libc/db/recno/rec_delete.c

179

for (cnt = &h->linp[NEXTINDEX(h)] - ip; --cnt; ++ip)

lib/libc/db/recno/rec_put.c

258

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

lib/libc/db/recno/rec_search.c

79

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