lib/libc/db/btree/bt_conv.c

133

top = NEXTINDEX(h);

lib/libc/db/btree/bt_conv.c

75

top = NEXTINDEX(h);

lib/libc/db/btree/bt_debug.c

172

top = NEXTINDEX(h);

lib/libc/db/btree/bt_debug.c

262

nkeys += NEXTINDEX(h);

lib/libc/db/btree/bt_delete.c

104

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

lib/libc/db/btree/bt_delete.c

178

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

lib/libc/db/btree/bt_delete.c

254

idx = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_delete.c

308

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_delete.c

316

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

lib/libc/db/btree/bt_delete.c

319

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

lib/libc/db/btree/bt_delete.c

335

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_delete.c

405

if (NEXTINDEX(pg) == 1) {

lib/libc/db/btree/bt_delete.c

427

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

lib/libc/db/btree/bt_delete.c

492

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

lib/libc/db/btree/bt_delete.c

559

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

lib/libc/db/btree/bt_delete.c

572

e.index = NEXTINDEX(pg) - 1;

lib/libc/db/btree/bt_delete.c

580

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

lib/libc/db/btree/bt_delete.c

98

if (NEXTINDEX(h) == 1)

lib/libc/db/btree/bt_put.c

203

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

lib/libc/db/btree/bt_put.c

220

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

lib/libc/db/btree/bt_put.c

283

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

lib/libc/db/btree/bt_search.c

103

if (base == NEXTINDEX(h) &&

lib/libc/db/btree/bt_search.c

187

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

lib/libc/db/btree/bt_search.c

74

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

lib/libc/db/btree/bt_seq.c

173

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_seq.c

194

if (NEXTINDEX(h) == 0) {

lib/libc/db/btree/bt_seq.c

201

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

lib/libc/db/btree/bt_seq.c

206

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

lib/libc/db/btree/bt_seq.c

270

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

lib/libc/db/btree/bt_seq.c

300

idx = NEXTINDEX(h) - 1;

lib/libc/db/btree/bt_seq.c

380

ep->index = NEXTINDEX(h);

lib/libc/db/btree/bt_seq.c

398

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

lib/libc/db/btree/bt_split.c

178

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

lib/libc/db/btree/bt_split.c

213

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

lib/libc/db/btree/bt_split.c

246

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

lib/libc/db/btree/bt_split.c

264

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

lib/libc/db/btree/bt_split.c

265

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

lib/libc/db/btree/bt_split.c

271

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

lib/libc/db/btree/bt_split.c

358

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

lib/libc/db/btree/bt_split.c

480

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

lib/libc/db/btree/bt_split.c

485

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

lib/libc/db/btree/bt_split.c

608

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

lib/libc/db/btree/bt_split.c

790

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

lib/libc/db/recno/rec_delete.c

178

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

lib/libc/db/recno/rec_put.c

252

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

lib/libc/db/recno/rec_search.c

78

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