recno_t
recno_t nextpg, prevpg;
static recno_t rec_total __P((PAGE *));
static recno_t
recno_t recs;
recno_t nrecs; /* number of records */
LALIGN(sizeof(recno_t) + sizeof(db_pgno_t))
*(recno_t *)p = nrecs; \
p += sizeof(recno_t); \
recno_t rcursor; /* R: recno cursor (1-based) */
int (*bt_irec) __P((struct _btree *, recno_t));
recno_t bt_nrecs; /* R: number of records */
int __rec_fmap __P((BTREE *, recno_t));
int __rec_fpipe __P((BTREE *, recno_t));
int __rec_iput __P((BTREE *, recno_t, const DBT *, u_int));
int __rec_ret __P((BTREE *, EPG *, recno_t, DBT *, DBT *));
EPG *__rec_search __P((BTREE *, recno_t, enum SRCHOP));
int __rec_vmap __P((BTREE *, recno_t));
int __rec_vpipe __P((BTREE *, recno_t));
recno_t scursor, trec;
key.size = sizeof(recno_t);
recno_t nrec;
static int rec_rdelete __P((BTREE *, recno_t));
recno_t nrec;
if ((nrec = *(recno_t *)key->data) == 0)
recno_t top;
recno_t nrec;
recno_t top;
recno_t nrec;
recno_t top;
recno_t nrec;
recno_t top;
recno_t nrec;
recno_t nrec;
if (flags || (nrec = *(recno_t *)key->data) == 0) {
if ((nrec = *(recno_t *)key->data) == 0)
if ((nrec = *(recno_t *)key->data) == 0) {
if ((nrec = *(recno_t *)key->data) == 0)
if ((nrec = *(recno_t *)key->data) == 0)
recno_t nrec;
recno_t nrec;
recno_t recno;
recno_t total;
recno_t nrec;
if ((nrec = *(recno_t *)key->data) == 0)
recno_t nrec;
if (sizeof(recno_t) > t->bt_rkey.size) {
malloc(sizeof(recno_t)) :
realloc(t->bt_rkey.data, sizeof(recno_t)));
t->bt_rkey.size = sizeof(recno_t);
memmove(t->bt_rkey.data, &nrec, sizeof(recno_t));
key->size = sizeof(recno_t);