Searched refs:P_INVALID (Results 1 - 21 of 21) sorted by relevance
/macosx-10.10/Libc-1044.1.2/db/btree/FreeBSD/ |
H A D | bt_page.c | 61 h->prevpg = P_INVALID; 86 if (t->bt_free != P_INVALID &&
|
H A D | bt_overflow.c | 90 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 D | bt_search.c | 104 h->prevpg != P_INVALID && 108 h->nextpg != P_INVALID &&
|
H A D | bt_put.c | 223 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 D | bt_seq.c | 277 if (pg == P_INVALID) 300 if (pg == P_INVALID) 373 if (h->prevpg == P_INVALID) 407 if (pg == P_INVALID)
|
H A D | bt_delete.c | 171 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 D | bt_split.c | 181 (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 D | bt_open.c | 268 t->bt_free = P_INVALID; 372 root->prevpg = root->nextpg = P_INVALID;
|
H A D | bt_utils.c | 160 if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & P_BLEAF))
|
H A D | btree.h | 52 #define P_INVALID 0 /* Invalid tree page number. */ macro
|
/macosx-10.10/BerkeleyDB-21/db/db/ |
H A D | db_conv.c | 113 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 D | db_meta.c | 147 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 D | db_reclaim.c | 140 case P_INVALID:
|
H A D | db_rec.c | 538 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 D | db_vrfy.c | 657 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 D | db_pr.c | 491 * 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 D | db_verify.h | 33 (u_long)(pgno), str, (u_long)P_INVALID)); \
|
H A D | db_page.h | 36 #define P_INVALID 0 /* Invalid page type. */ macro
|
/macosx-10.10/BerkeleyDB-21/db/hash/ |
H A D | hash_stat.c | 235 case P_INVALID: 441 if (TYPE(hcp->page) == P_INVALID)
|
H A D | hash_verify.c | 463 if (pip->type == P_INVALID) {
|
/macosx-10.10/BerkeleyDB-21/db/btree/ |
H A D | bt_verify.c | 1302 leaf_type = P_INVALID; 1338 vdp->leaf_type = P_INVALID; 1376 if (vdp->leaf_type == P_INVALID) {
|
Completed in 401 milliseconds