Home
last modified time | relevance | path

Searched refs:P_INVALID (Results 1 – 11 of 11) sorted by relevance

/freebsd-10-stable/lib/libc/db/btree/
Dbt_page.c61 h->prevpg = P_INVALID; in __bt_free()
86 if (t->bt_free != P_INVALID && in __bt_new()
Dbt_overflow.c90 if (pg == P_INVALID || sz == 0) in __ovfl_get()
151 h->nextpg = h->prevpg = P_INVALID; in __ovfl_put()
194 if (pg == P_INVALID || sz == 0) in __ovfl_delete()
Dbt_put.c223 if (h->nextpg == P_INVALID) { in __bt_put()
229 } else if (h->prevpg == P_INVALID) { in __bt_put()
285 if (t->bt_cur.page->nextpg != P_INVALID) in bt_fast()
293 if (t->bt_cur.page->prevpg != P_INVALID) in bt_fast()
Dbt_seq.c277 if (pg == P_INVALID) in __bt_seqadv()
300 if (pg == P_INVALID) in __bt_seqadv()
372 if (h->prevpg == P_INVALID) in __bt_first()
406 if (pg == P_INVALID) in __bt_first()
Dbt_delete.c171 if ((nextpg = h->nextpg) == P_INVALID) in __bt_stkacq()
226 if ((prevpg = h->prevpg) == P_INVALID) in __bt_stkacq()
572 if (idx == 0 && h->prevpg != P_INVALID) { in __bt_curdel()
584 if (idx == NEXTINDEX(h) - 1 && h->nextpg != P_INVALID) { in __bt_curdel()
622 if (h->nextpg != P_INVALID) { in __bt_relink()
628 if (h->prevpg != P_INVALID) { in __bt_relink()
Dbt_search.c104 h->prevpg != P_INVALID && in __bt_search()
108 h->nextpg != P_INVALID && in __bt_search()
Dbt_split.c182 (h->prevpg != P_INVALID || skip > 1)) { in __bt_split()
363 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) { in bt_page()
388 if (h->nextpg != P_INVALID) { in bt_page()
450 l->prevpg = r->nextpg = P_INVALID; in bt_root()
Dbt_open.c266 t->bt_free = P_INVALID; in __bt_open()
377 root->prevpg = root->nextpg = P_INVALID; in nroot()
Dbt_utils.c160 if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & P_BLEAF)) in __bt_cmp()
Dbtree.h52 #define P_INVALID 0 /* Invalid tree page number. */ macro
/freebsd-10-stable/contrib/netbsd-tests/lib/libc/db/
Dh_db.c551 if (h->prevpg == P_INVALID || h->nextpg == P_INVALID) in unlinkpg()
566 h->prevpg = P_INVALID; in unlinkpg()
567 h->nextpg = P_INVALID; in unlinkpg()