lib/libc/db/btree/bt_delete.c

167

if ((nextpg = h->nextpg) == P_INVALID)

lib/libc/db/btree/bt_delete.c

222

if ((prevpg = h->prevpg) == P_INVALID)

lib/libc/db/btree/bt_delete.c

568

if (idx == 0 && h->prevpg != P_INVALID) {

lib/libc/db/btree/bt_delete.c

580

if (idx == NEXTINDEX(h) - 1 && h->nextpg != P_INVALID) {

lib/libc/db/btree/bt_delete.c

618

if (h->nextpg != P_INVALID) {

lib/libc/db/btree/bt_delete.c

624

if (h->prevpg != P_INVALID) {

lib/libc/db/btree/bt_open.c

271

t->bt_free = P_INVALID;

lib/libc/db/btree/bt_open.c

381

root->prevpg = root->nextpg = P_INVALID;

lib/libc/db/btree/bt_overflow.c

149

h->nextpg = h->prevpg = P_INVALID;

lib/libc/db/btree/bt_overflow.c

192

if (pg == P_INVALID || sz == 0)

lib/libc/db/btree/bt_overflow.c

87

if (pg == P_INVALID || sz == 0)

lib/libc/db/btree/bt_page.c

57

h->prevpg = P_INVALID;

lib/libc/db/btree/bt_page.c

82

if (t->bt_free != P_INVALID &&

lib/libc/db/btree/bt_put.c

219

if (h->nextpg == P_INVALID) {

lib/libc/db/btree/bt_put.c

225

} else if (h->prevpg == P_INVALID) {

lib/libc/db/btree/bt_put.c

281

if (t->bt_cur.page->nextpg != P_INVALID)

lib/libc/db/btree/bt_put.c

289

if (t->bt_cur.page->prevpg != P_INVALID)

lib/libc/db/btree/bt_search.c

100

h->prevpg != P_INVALID &&

lib/libc/db/btree/bt_search.c

104

h->nextpg != P_INVALID &&

lib/libc/db/btree/bt_seq.c

273

if (pg == P_INVALID)

lib/libc/db/btree/bt_seq.c

296

if (pg == P_INVALID)

lib/libc/db/btree/bt_seq.c

368

if (h->prevpg == P_INVALID)

lib/libc/db/btree/bt_seq.c

402

if (pg == P_INVALID)

lib/libc/db/btree/bt_split.c

177

(h->prevpg != P_INVALID || skip > 1)) {

lib/libc/db/btree/bt_split.c

358

if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {

lib/libc/db/btree/bt_split.c

384

if (h->nextpg != P_INVALID) {

lib/libc/db/btree/bt_split.c

446

l->prevpg = r->nextpg = P_INVALID;

lib/libc/db/btree/bt_utils.c

156

if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & P_BLEAF))

usr.sbin/ldapd/btree.c

1078

*p_next = P_INVALID;

usr.sbin/ldapd/btree.c

1098

bt->meta.root = P_INVALID;

usr.sbin/ldapd/btree.c

1471

if (root == P_INVALID) { /* Tree is empty. */

usr.sbin/ldapd/btree.c

2493

bt->txn->root = P_INVALID;

usr.sbin/ldapd/btree.c

2970

rc = btree_split(bt, &mp, &ki, &xkey, data, P_INVALID);

usr.sbin/ldapd/btree.c

3006

return P_INVALID;

usr.sbin/ldapd/btree.c

3008

return P_INVALID;

usr.sbin/ldapd/btree.c

3018

if (node->n_pgno == P_INVALID) {

usr.sbin/ldapd/btree.c

3020

return P_INVALID;

usr.sbin/ldapd/btree.c

3029

if (next == P_INVALID) {

usr.sbin/ldapd/btree.c

3031

return P_INVALID;

usr.sbin/ldapd/btree.c

3040

if (*pnext == P_INVALID) {

usr.sbin/ldapd/btree.c

3042

return P_INVALID;

usr.sbin/ldapd/btree.c

3052

return P_INVALID;

usr.sbin/ldapd/btree.c

3097

if (bt->meta.root != P_INVALID) {

usr.sbin/ldapd/btree.c

3099

if (root == P_INVALID)

usr.sbin/ldapd/btree.c

3114

if (btree_write_meta(bt, P_INVALID, BT_TOMBSTONE) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

984

if (m->root >= p->pgno && m->root != P_INVALID) {