Home
last modified time | relevance | path

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

/titanic_41/usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/
H A Dbt_seq.c218 if (NEXTINDEX(h) == 0) {
239 if (NEXTINDEX(h) == 0) {
246 pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno;
251 ep->index = NEXTINDEX(h) - 1;
348 if (++idx == NEXTINDEX(h)) {
378 idx = NEXTINDEX(h) - 1;
462 ep->index = NEXTINDEX(h);
480 if (ep->index == NEXTINDEX(ep->page)) {
753 if (NEXTINDEX(h) == 0) {
778 if (NEXTINDEX(h) == 0) {
[all …]
H A Dbt_delete.c109 if (NEXTINDEX(h) == 1)
115 if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) {
192 if (parent->index != NEXTINDEX(h) - 1) {
268 idx = NEXTINDEX(h) - 1;
324 if (NEXTINDEX(h) == 0) {
332 } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0);
335 if (e->index == NEXTINDEX(h))
351 if (NEXTINDEX(h) == 0) {
423 if (NEXTINDEX(pg) == 1)
445 for (cnt = NEXTINDEX(pg) - idx; --cnt; ++ip)
[all …]
H A Dbt_search.c85 for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) {
114 if (base == NEXTINDEX(h) &&
192 if (parent->index != NEXTINDEX(h) - 1) {
252 e.index = NEXTINDEX(e.page) - 1;
294 idx = NEXTINDEX(h) - 1;
H A Dbt_split.c194 tbl = GETBLEAF(lchild, NEXTINDEX(lchild) - 1);
229 if (skip < (nxtindex = NEXTINDEX(h)))
262 dest = (char *)l + l->linp[NEXTINDEX(l) - 1];
280 dest = (char *)l + l->linp[NEXTINDEX(l) - 1];
281 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(lchild);
287 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(rchild);
378 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {
508 l->flags & P_RLEAF ? NEXTINDEX(l) : rec_total(l), l->pgno);
513 r->flags & P_RLEAF ? NEXTINDEX(r) : rec_total(r), r->pgno);
642 for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) {
[all …]
H A Dbt_put.c220 if (idx < (nxtindex = NEXTINDEX(h)))
237 if (idx == NEXTINDEX(h) - 1) {
303 if (t->bt_cur.index != NEXTINDEX(h) - 1)
H A Dbt_conv.c88 top = NEXTINDEX(h);
149 top = NEXTINDEX(h);
H A Dbt_debug.c238 top = NEXTINDEX(h);
335 nkeys += NEXTINDEX(h);
H A Dbtree.h105 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t)) macro
/titanic_41/usr/src/lib/krb5/plugins/kdb/db2/libdb2/recno/
H A Drec_search.c89 for (idx = 0, top = NEXTINDEX(h);;) {
H A Drec_delete.c194 for (cnt = &h->linp[NEXTINDEX(h)] - ip; --cnt; ++ip)
H A Drec_put.c268 if (idx < (nxtindex = NEXTINDEX(h)))