lib/libc/db/btree/bt_delete.c

168

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

lib/libc/db/btree/bt_delete.c

223

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

lib/libc/db/btree/bt_delete.c

569

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

lib/libc/db/btree/bt_delete.c

581

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

lib/libc/db/btree/bt_delete.c

619

if (h->nextpg != P_INVALID) {

lib/libc/db/btree/bt_delete.c

625

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

382

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

lib/libc/db/btree/bt_overflow.c

148

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

lib/libc/db/btree/bt_overflow.c

191

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

58

h->prevpg = P_INVALID;

lib/libc/db/btree/bt_page.c

83

if (t->bt_free != P_INVALID &&

lib/libc/db/btree/bt_put.c

220

if (h->nextpg == P_INVALID) {

lib/libc/db/btree/bt_put.c

226

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

lib/libc/db/btree/bt_put.c

282

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

lib/libc/db/btree/bt_put.c

290

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

lib/libc/db/btree/bt_search.c

101

h->prevpg != P_INVALID &&

lib/libc/db/btree/bt_search.c

105

h->nextpg != P_INVALID &&

lib/libc/db/btree/bt_seq.c

274

if (pg == P_INVALID)

lib/libc/db/btree/bt_seq.c

297

if (pg == P_INVALID)

lib/libc/db/btree/bt_seq.c

369

if (h->prevpg == P_INVALID)

lib/libc/db/btree/bt_seq.c

403

if (pg == P_INVALID)

lib/libc/db/btree/bt_split.c

179

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

lib/libc/db/btree/bt_split.c

360

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

lib/libc/db/btree/bt_split.c

385

if (h->nextpg != P_INVALID) {

lib/libc/db/btree/bt_split.c

447

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

lib/libc/db/btree/bt_utils.c

157

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