Searched refs:P_INVALID (Results 1 - 21 of 21) sorted by relevance

/macosx-10.10/Libc-1044.1.2/db/btree/FreeBSD/
H A Dbt_page.c61 h->prevpg = P_INVALID;
86 if (t->bt_free != P_INVALID &&
H A Dbt_overflow.c90 if (pg == P_INVALID || sz == 0)
91 LIBC_ABORT("%s", pg == P_INVALID ? "pg == P_INVALID" : "sz == 0");
151 h->nextpg = h->prevpg = P_INVALID;
194 if (pg == P_INVALID || sz == 0)
195 LIBC_ABORT("%s", pg == P_INVALID ? "pg == P_INVALID" : "sz == 0");
H A Dbt_search.c104 h->prevpg != P_INVALID &&
108 h->nextpg != P_INVALID &&
H A Dbt_put.c223 if (h->nextpg == P_INVALID) {
229 } else if (h->prevpg == P_INVALID) {
285 if (t->bt_cur.page->nextpg != P_INVALID)
293 if (t->bt_cur.page->prevpg != P_INVALID)
H A Dbt_seq.c277 if (pg == P_INVALID)
300 if (pg == P_INVALID)
373 if (h->prevpg == P_INVALID)
407 if (pg == P_INVALID)
H A Dbt_delete.c171 if ((nextpg = h->nextpg) == P_INVALID)
226 if ((prevpg = h->prevpg) == P_INVALID)
572 if (idx == 0 && h->prevpg != P_INVALID) {
584 if (idx == NEXTINDEX(h) - 1 && h->nextpg != P_INVALID) {
622 if (h->nextpg != P_INVALID) {
628 if (h->prevpg != P_INVALID) {
H A Dbt_split.c181 (h->prevpg != P_INVALID || skip > 1)) {
362 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {
387 if (h->nextpg != P_INVALID) {
449 l->prevpg = r->nextpg = P_INVALID;
H A Dbt_open.c268 t->bt_free = P_INVALID;
372 root->prevpg = root->nextpg = P_INVALID;
H A Dbt_utils.c160 if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & P_BLEAF))
H A Dbtree.h52 #define P_INVALID 0 /* Invalid tree page number. */ macro
/macosx-10.10/BerkeleyDB-21/db/db/
H A Ddb_conv.c113 case P_INVALID:
116 * a zero LSN, zero page number and P_INVALID. Otherwise
162 case P_INVALID:
219 case P_INVALID:
299 case P_INVALID:
618 case P_INVALID:
676 case P_INVALID:
H A Ddb_meta.c147 DB_ASSERT(env, TYPE(h) == P_INVALID);
149 if (TYPE(h) != P_INVALID) {
466 h->pgno, PGNO_INVALID, next_pgno, 0, P_INVALID);
489 h->pgno, PGNO_INVALID, next_pgno, 0, P_INVALID);
H A Ddb_reclaim.c140 case P_INVALID:
H A Ddb_rec.c538 argp->pgno, PGNO_INVALID, argp->next, 0, P_INVALID);
714 PGNO_INVALID, PGNO_INVALID, 0, P_INVALID);
719 argp->pgno, PGNO_INVALID, argp->next, 0, P_INVALID);
1062 lp->pgno, PGNO_INVALID, pgno, 0, P_INVALID);
1265 argp->pgno, PGNO_INVALID, argp->next, 0, P_INVALID);
1404 argp->pgno, PGNO_INVALID, argp->next, 0, P_INVALID);
H A Ddb_vrfy.c657 pip->type = P_INVALID;
704 case P_INVALID:
953 !(dbp->type == DB_HASH && pip->type == P_INVALID)) {
1068 case P_INVALID: /* Order matches ordinal value. */
1097 * Verify P_INVALID page.
1468 if (pip->type != P_INVALID) {
1871 case P_INVALID:
2673 if (type == P_INVALID || type >= P_PAGETYPE_MAX)
H A Ddb_pr.c491 * If we're doing recovery testing and this page is P_INVALID,
494 if (LF_ISSET(DB_PR_RECOVERYTEST) && TYPE(h) == P_INVALID)
585 if (TYPE(h) == P_INVALID || !LF_ISSET(DB_PR_PAGE))
932 case P_INVALID:
/macosx-10.10/BerkeleyDB-21/db/dbinc/
H A Ddb_verify.h33 (u_long)(pgno), str, (u_long)P_INVALID)); \
H A Ddb_page.h36 #define P_INVALID 0 /* Invalid page type. */ macro
/macosx-10.10/BerkeleyDB-21/db/hash/
H A Dhash_stat.c235 case P_INVALID:
441 if (TYPE(hcp->page) == P_INVALID)
H A Dhash_verify.c463 if (pip->type == P_INVALID) {
/macosx-10.10/BerkeleyDB-21/db/btree/
H A Dbt_verify.c1302 leaf_type = P_INVALID;
1338 vdp->leaf_type = P_INVALID;
1376 if (vdp->leaf_type == P_INVALID) {

Completed in 401 milliseconds