HomeSort by: relevance | last modified time | path
    Searched refs:NEXTINDEX (Results 1 - 12 of 12) sorted by relevancy

  /src/lib/libc/db/btree/
bt_seq.c 188 if (NEXTINDEX(h) == 0) {
212 if (NEXTINDEX(h) == 0) {
219 pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno;
220 BT_PUSH(t, h->pgno, NEXTINDEX(h) - 1);
225 ep->index = NEXTINDEX(h) - 1;
320 if (++idx == NEXTINDEX(h)) {
361 idx = NEXTINDEX(h) - 1;
394 } while (++idx == NEXTINDEX(h));
442 idx = NEXTINDEX(h) - 1;
518 ep->index = NEXTINDEX(h)
    [all...]
bt_delete.c 106 if (NEXTINDEX(h) == 1)
112 if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) {
187 if (parent->index != NEXTINDEX(h) - 1) {
263 idx = NEXTINDEX(h) - 1;
317 if (NEXTINDEX(h) == 0) {
325 } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0);
328 if (e->index == NEXTINDEX(h))
344 if (NEXTINDEX(h) == 0) {
414 if (NEXTINDEX(pg) == 1) {
437 for (cnt = NEXTINDEX(pg) - idx; --cnt; ++ip
    [all...]
bt_search.c 83 for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) {
112 if (base == NEXTINDEX(h) &&
186 if (parent->index != NEXTINDEX(h) - 1) {
243 e.index = NEXTINDEX(e.page) - 1;
285 idx = NEXTINDEX(h) - 1;
bt_conv.c 85 top = NEXTINDEX(h);
145 top = NEXTINDEX(h);
bt_put.c 212 if (idx < (nxtindex = NEXTINDEX(h)))
229 if (idx == NEXTINDEX(h) - 1) {
292 if (t->bt_cur.index != NEXTINDEX(h) - 1)
bt_split.c 190 tbl = GETBLEAF(lchild, NEXTINDEX(lchild) - 1);
227 if (skip < (nxtindex = NEXTINDEX(h)))
263 dest = (char *)(void *)l + l->linp[NEXTINDEX(l) - 1];
281 dest = (char *)(void *)l + l->linp[NEXTINDEX(l) - 1];
282 ((RINTERNAL *)(void *)dest)->nrecs = NEXTINDEX(lchild);
288 ((RINTERNAL *)(void *)dest)->nrecs = NEXTINDEX(rchild);
367 * a key to it (skip is NEXTINDEX()), it's likely that the data is
375 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)
    [all...]
bt_debug.c 232 top = NEXTINDEX(h);
326 nkeys += NEXTINDEX(h);
btree.h 96 NEXTINDEX(const PAGE *p) {
102 #define NEXTINDEX(p) (indx_t)_NEXTINDEX(p)
  /src/lib/libc/db/recno/
rec_search.c 87 for (idx = 0, top = NEXTINDEX(h);;) {
rec_delete.c 190 temp = &h->linp[NEXTINDEX(h)] - ip;
rec_put.c 268 if (idx < (nxtindex = NEXTINDEX(h)))
  /src/tests/lib/libc/db/
h_db.c 538 if (NEXTINDEX(h) == 0)

Completed in 42 milliseconds