Symbol: NEXTINDEX
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_conv.c
147
top = NEXTINDEX(h);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_conv.c
86
top = NEXTINDEX(h);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_debug.c
235
top = NEXTINDEX(h);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_debug.c
332
nkeys += NEXTINDEX(h);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
107
if (NEXTINDEX(h) == 1)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
113
if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
190
if (parent->index != NEXTINDEX(h) - 1) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
266
idx = NEXTINDEX(h) - 1;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
322
if (NEXTINDEX(h) == 0) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
330
} while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
333
if (e->index == NEXTINDEX(h))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
349
if (NEXTINDEX(h) == 0) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
421
if (NEXTINDEX(pg) == 1)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
443
for (cnt = NEXTINDEX(pg) - idx; --cnt; ++ip)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
512
for (cnt = NEXTINDEX(h) - idx; --cnt; ++ip)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
583
if (idx < NEXTINDEX(h) - 1) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
596
e.index = NEXTINDEX(pg) - 1;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_delete.c
604
if (idx == NEXTINDEX(h) - 1 && h->nextpg != P_INVALID) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_put.c
218
if (idx < (nxtindex = NEXTINDEX(h)))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_put.c
235
if (idx == NEXTINDEX(h) - 1) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_put.c
301
if (t->bt_cur.index != NEXTINDEX(h) - 1)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_search.c
112
if (base == NEXTINDEX(h) &&
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_search.c
190
if (parent->index != NEXTINDEX(h) - 1) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_search.c
250
e.index = NEXTINDEX(e.page) - 1;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_search.c
292
idx = NEXTINDEX(h) - 1;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_search.c
83
for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
216
if (NEXTINDEX(h) == 0) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
237
if (NEXTINDEX(h) == 0) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
244
pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
249
ep->index = NEXTINDEX(h) - 1;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
346
if (++idx == NEXTINDEX(h)) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
376
idx = NEXTINDEX(h) - 1;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
460
ep->index = NEXTINDEX(h);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
478
if (ep->index == NEXTINDEX(ep->page)) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
751
if (NEXTINDEX(h) == 0) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
776
if (NEXTINDEX(h) == 0) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
783
pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
784
status = bt_rcpush(rc, h->pgno, NEXTINDEX(h) - 1);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
790
ep->index = NEXTINDEX(h) - 1;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
848
while (++idx == NEXTINDEX(h)) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_seq.c
894
idx = NEXTINDEX(h) - 1;
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
192
tbl = GETBLEAF(lchild, NEXTINDEX(lchild) - 1);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
227
if (skip < (nxtindex = NEXTINDEX(h)))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
260
dest = (char *)l + l->linp[NEXTINDEX(l) - 1];
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
278
dest = (char *)l + l->linp[NEXTINDEX(l) - 1];
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
279
((RINTERNAL *)dest)->nrecs = NEXTINDEX(lchild);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
285
((RINTERNAL *)dest)->nrecs = NEXTINDEX(rchild);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
376
if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
506
l->flags & P_RLEAF ? NEXTINDEX(l) : rec_total(l), l->pgno);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
511
r->flags & P_RLEAF ? NEXTINDEX(r) : rec_total(r), r->pgno);
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
640
for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) {
usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/bt_split.c
834
for (recs = 0, nxt = 0, top = NEXTINDEX(h); nxt < top; ++nxt)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/recno/rec_delete.c
192
for (cnt = &h->linp[NEXTINDEX(h)] - ip; --cnt; ++ip)
usr/src/lib/krb5/plugins/kdb/db2/libdb2/recno/rec_put.c
266
if (idx < (nxtindex = NEXTINDEX(h)))
usr/src/lib/krb5/plugins/kdb/db2/libdb2/recno/rec_search.c
87
for (idx = 0, top = NEXTINDEX(h);;) {