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

  /src/lib/libc/db/btree/
bt_page.c 67 h->nextpg = t->bt_free;
94 t->bt_free = h->nextpg;
bt_overflow.c 59 * nextpg field of the PAGE header.
114 for (p = *buf;; p = (char *)p + nb, pg = h->nextpg) {
165 h->nextpg = h->prevpg = P_INVALID;
173 last->nextpg = h->pgno;
225 pg = h->nextpg;
bt_delete.c 152 recno_t nextpg, prevpg; local
176 if ((nextpg = h->nextpg) == P_INVALID)
211 if ((h = mpool_get(t->bt_mp, nextpg, 0)) == NULL)
590 if (idx == (unsigned)(NEXTINDEX(h) - 1) && h->nextpg != P_INVALID) {
591 if ((pg = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL)
628 if (h->nextpg != P_INVALID) {
629 if ((pg = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL)
637 pg->nextpg = h->nextpg;
    [all...]
bt_conv.c 80 M_32_SWAP(h->nextpg);
189 M_32_SWAP(h->nextpg);
bt_split.c 361 r->nextpg = h->nextpg;
375 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {
379 h->nextpg = r->pgno;
396 l->nextpg = r->pgno;
403 if (h->nextpg != P_INVALID) {
404 if ((tp = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL) {
463 l->nextpg = r->pgno;
465 l->prevpg = r->nextpg = P_INVALID;
bt_put.c 228 if (h->nextpg == P_INVALID) {
290 if (t->bt_cur.page->nextpg != P_INVALID)
bt_search.c 113 h->nextpg != P_INVALID &&
164 if ((e.page = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL)
bt_seq.c 326 pg = h->nextpg;
538 pg = h->nextpg;
bt_debug.c 228 (void)fprintf(tracefp, "\tprev %2d next %2d", h->prevpg, h->nextpg);
bt_open.c 382 root->prevpg = root->nextpg = P_INVALID;
btree.h 72 pgno_t nextpg; /* right sibling */ member in struct:_page
  /src/tests/lib/libc/db/
h_db.c 536 if (h->prevpg == P_INVALID || h->nextpg == P_INVALID)
552 h->nextpg = P_INVALID;

Completed in 20 milliseconds