Home
last modified time | relevance | path

Searched refs:NEXTINDEX (Results 1 – 11 of 11) sorted by relevance

/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/
H A Dbt_seq.c216 if (NEXTINDEX(h) == 0) {
237 if (NEXTINDEX(h) == 0) {
249 ep->index = NEXTINDEX(h) - 1;
346 if (++idx == NEXTINDEX(h)) {
376 idx = NEXTINDEX(h) - 1;
460 ep->index = NEXTINDEX(h);
751 if (NEXTINDEX(h) == 0) {
776 if (NEXTINDEX(h) == 0) {
790 ep->index = NEXTINDEX(h) - 1;
848 while (++idx == NEXTINDEX(h)) {
[all …]
H A Dbt_delete.c107 if (NEXTINDEX(h) == 1)
190 if (parent->index != NEXTINDEX(h) - 1) {
266 idx = NEXTINDEX(h) - 1;
322 if (NEXTINDEX(h) == 0) {
333 if (e->index == NEXTINDEX(h))
349 if (NEXTINDEX(h) == 0) {
421 if (NEXTINDEX(pg) == 1)
443 for (cnt = NEXTINDEX(pg) - idx; --cnt; ++ip)
512 for (cnt = NEXTINDEX(h) - idx; --cnt; ++ip)
583 if (idx < NEXTINDEX(h) - 1) {
[all …]
H A Dbt_search.c83 for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) {
112 if (base == NEXTINDEX(h) &&
190 if (parent->index != NEXTINDEX(h) - 1) {
250 e.index = NEXTINDEX(e.page) - 1;
292 idx = NEXTINDEX(h) - 1;
H A Dbt_split.c192 tbl = GETBLEAF(lchild, NEXTINDEX(lchild) - 1);
227 if (skip < (nxtindex = NEXTINDEX(h)))
260 dest = (char *)l + l->linp[NEXTINDEX(l) - 1];
278 dest = (char *)l + l->linp[NEXTINDEX(l) - 1];
279 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(lchild);
285 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(rchild);
376 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {
506 l->flags & P_RLEAF ? NEXTINDEX(l) : rec_total(l), l->pgno);
511 r->flags & P_RLEAF ? NEXTINDEX(r) : rec_total(r), r->pgno);
640 for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) {
[all …]
H A Dbt_put.c218 if (idx < (nxtindex = NEXTINDEX(h)))
235 if (idx == NEXTINDEX(h) - 1) {
301 if (t->bt_cur.index != NEXTINDEX(h) - 1)
H A Dbt_conv.c86 top = NEXTINDEX(h);
147 top = NEXTINDEX(h);
H A Dbt_debug.c235 top = NEXTINDEX(h);
332 nkeys += NEXTINDEX(h);
H A Dbtree.h103 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t)) macro
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/recno/
H A Drec_search.c87 for (idx = 0, top = NEXTINDEX(h);;) {
H A Drec_delete.c192 for (cnt = &h->linp[NEXTINDEX(h)] - ip; --cnt; ++ip)
H A Drec_put.c266 if (idx < (nxtindex = NEXTINDEX(h)))