P_INDX
cp->indx = NUM_ENT(cp->page) == 0 ? 0 : NUM_ENT(cp->page) - P_INDX;
adjust = dbp->type == DB_BTREE ? P_INDX : O_INDX;
adjust = P_INDX;
indx = cp->indx + P_INDX;
adjust = dbp->type == DB_BTREE ? P_INDX : O_INDX;
adjust = P_INDX;
indx = NUM_ENT(h) - P_INDX;
indx += P_INDX;
indx > 0 && h->inp[indx - P_INDX] == h->inp[indx];
indx -= P_INDX)
indx < (db_indx_t)(NUM_ENT(h) - P_INDX) &&
h->inp[indx] == h->inp[indx + P_INDX];
indx += P_INDX)
if ((cp->indx += P_INDX) >= NUM_ENT(cp->page)) {
if (indx + P_INDX < (u_int32_t)NUM_ENT(h) &&
h->inp[indx] == h->inp[indx + P_INDX])
if (indx > 0 && h->inp[indx] == h->inp[indx - P_INDX])
h, indx, indx - P_INDX, 0));
t->bt_ovflsize = (dbp->pgsize - P_OVERHEAD) / (t->bt_minkey * P_INDX)
h, indx + P_INDX, indx, 1)) != 0)
while (indx > 0 && h->inp[indx] == h->inp[indx - P_INDX])
indx -= P_INDX;
for (cnt = 0, sz = 0, first = indx;; ++cnt, indx += P_INDX) {
if (recno <= (db_recno_t)NUM_ENT(h) / P_INDX)
i * P_INDX + O_INDX)->type))
if (recno > (db_recno_t)NUM_ENT(h) / P_INDX) {
(db_recno_t)(NUM_ENT(h) / P_INDX + 1)) {
BT_STK_ENTER(cp, h, recno * P_INDX, lock, ret);
for (indx = 0; indx < top; indx += P_INDX)
jump = TYPE(h) == P_LBTREE ? P_INDX : O_INDX;
*recnop = recno + (indx / P_INDX) + 1;
while (indx < (db_indx_t)(NUM_ENT(h) - P_INDX) &&
h->inp[indx] == h->inp[indx + P_INDX])
indx += P_INDX;
h->inp[indx] == h->inp[indx - P_INDX])
indx -= P_INDX;
h->inp[indx] == h->inp[indx - P_INDX])
indx -= P_INDX;
indx < (db_indx_t)(NUM_ENT(h) - P_INDX) &&
h->inp[indx] == h->inp[indx + P_INDX])
indx += P_INDX;
tmp_bk = GET_BKEYDATA(lchild, NUM_ENT(lchild) - P_INDX);
adjust = TYPE(pp) == P_LBTREE ? P_INDX : O_INDX;
if (off != 0 && (nxt % P_INDX) == 0 &&
pp->inp[nxt] == pp->inp[nxt - P_INDX]) {
cp->inp[off] = cp->inp[off - P_INDX];
sp->bt_nrecs += NUM_ENT(h) / P_INDX;