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

  /src/lib/libc/db/btree/
bt_page.c 66 h->prevpg = P_INVALID;
91 if (t->bt_free != P_INVALID &&
bt_overflow.c 95 if (pg == P_INVALID || sz == 0)
165 h->nextpg = h->prevpg = P_INVALID;
208 if (pg == P_INVALID || sz == 0)
bt_put.c 228 if (h->nextpg == P_INVALID) {
234 } else if (h->prevpg == P_INVALID) {
290 if (t->bt_cur.page->nextpg != P_INVALID)
298 if (t->bt_cur.page->prevpg != P_INVALID)
bt_delete.c 176 if ((nextpg = h->nextpg) == P_INVALID)
231 if ((prevpg = h->prevpg) == P_INVALID)
578 if (idx == 0 && h->prevpg != P_INVALID) {
590 if (idx == (unsigned)(NEXTINDEX(h) - 1) && h->nextpg != P_INVALID) {
628 if (h->nextpg != P_INVALID) {
634 if (h->prevpg != P_INVALID) {
bt_seq.c 328 if (pg == P_INVALID)
357 if (pg == P_INVALID)
506 if (h->prevpg == P_INVALID)
540 if (pg == P_INVALID)
bt_search.c 109 h->prevpg != P_INVALID &&
113 h->nextpg != P_INVALID &&
bt_open.c 268 t->bt_free = P_INVALID;
381 root->prevpg = root->nextpg = P_INVALID;
bt_split.c 188 (h->prevpg != P_INVALID || skip > 1)) {
375 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {
403 if (h->nextpg != P_INVALID) {
465 l->prevpg = r->nextpg = P_INVALID;
bt_utils.c 164 if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & P_BLEAF))
btree.h 57 #define P_INVALID 0 /* Invalid tree page number. */
  /src/tests/lib/libc/db/
h_db.c 536 if (h->prevpg == P_INVALID || h->nextpg == P_INVALID)
551 h->prevpg = P_INVALID;
552 h->nextpg = P_INVALID;

Completed in 44 milliseconds