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 *)(void *)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);
rec_rdelete(BTREE *t, recno_t nrec)
static int rec_rdelete __P((BTREE *, recno_t));
recno_t nrec;
if ((nrec = *(recno_t *)key->data) == 0)
__rec_fpipe(BTREE *t, recno_t top)
recno_t nrec;
__rec_vpipe(BTREE *t, recno_t top)
recno_t nrec;
__rec_fmap(BTREE *t, recno_t top)
recno_t nrec;
__rec_vmap(BTREE *t, 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)
__rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags)
recno_t nrec;
__rec_search(BTREE *t, recno_t recno, enum SRCHOP op)
recno_t total;
recno_t nrec;
if ((nrec = *(recno_t *)key->data) == 0)
__rec_ret(BTREE *t, EPG *e, recno_t nrec, DBT *key, DBT *data)
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);
static recno_t nlong;
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
recno_t cnt;
key.size = sizeof(recno_t);
static recno_t recno;
recno_t nextpg, prevpg;
static recno_t rec_total(PAGE *);
static recno_t
recno_t recs;
recno_t nrecs; /* number of records */
LALIGN(sizeof(recno_t) + sizeof(pgno_t))
*(recno_t *)p = nrecs; \
p += sizeof(recno_t); \
recno_t rcursor; /* R: recno cursor (1-based) */
int (*bt_irec)(struct _btree *, recno_t);
recno_t bt_nrecs; /* R: number of records */
int __rec_fmap(BTREE *, recno_t);
int __rec_fpipe(BTREE *, recno_t);
int __rec_iput(BTREE *, recno_t, const DBT *, u_int);
int __rec_ret(BTREE *, EPG *, recno_t, DBT *, DBT *);
EPG *__rec_search(BTREE *, recno_t, enum SRCHOP);
int __rec_vmap(BTREE *, recno_t);
int __rec_vpipe(BTREE *, recno_t);
recno_t scursor, trec;
key.size = sizeof(recno_t);
rec_rdelete(BTREE *t, recno_t nrec)
static int rec_rdelete(BTREE *, recno_t);
recno_t nrec;
if ((nrec = *(recno_t *)key->data) == 0)
__rec_fpipe(BTREE *t, recno_t top)
recno_t nrec;
__rec_vpipe(BTREE *t, recno_t top)
recno_t nrec;
__rec_fmap(BTREE *t, recno_t top)
recno_t nrec;
__rec_vmap(BTREE *t, 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)
__rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags)
recno_t nrec;
__rec_search(BTREE *t, recno_t recno, enum SRCHOP op)
recno_t total;
recno_t nrec;
if ((nrec = *(recno_t *)key->data) == 0)
__rec_ret(BTREE *t, EPG *e, recno_t nrec, DBT *key, DBT *data)
if (sizeof(recno_t) > t->bt_rkey.size) {
p = 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);
static recno_t nlong;
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
key.size = sizeof(recno_t);
recno_t cnt;
key.size = sizeof(recno_t);
static recno_t recno;
recno_t reccnt;
int nonblank(SCR *, recno_t, size_t *);
int db_eget(SCR *, recno_t, CHAR_T **, size_t *, int *);
int db_get(SCR *, recno_t, u_int32_t, CHAR_T **, size_t *);
int db_delete(SCR *, recno_t);
int db_append(SCR *, int, recno_t, CHAR_T *, size_t);
int db_insert(SCR *, recno_t, CHAR_T *, size_t);
int db_set(SCR *, recno_t, CHAR_T *, size_t);
int db_exist(SCR *, recno_t);
int db_last(SCR *, recno_t *);
int db_rget(SCR *, recno_t, char **, size_t *);
int db_rset(SCR *, recno_t, char *, size_t);
void db_err(SCR *, recno_t);
int log_line(SCR *, recno_t, u_int);
int cut_line(SCR *, recno_t, size_t, size_t, CB *);
int mark_insdel(SCR *, lnop_t, recno_t);
void msgq_status(SCR *, recno_t, u_int);
void ex_cinit(SCR *, EXCMD *, int, int, recno_t, recno_t, int);
int ex_g_insdel(SCR *, lnop_t, recno_t);
int ex_readfp(SCR *, char *, FILE *, MARK *, recno_t *, int);
int sscr_exec(SCR *, recno_t);
size_t vs_screens(SCR *, recno_t, size_t *);
size_t vs_columns(SCR *, CHAR_T *, recno_t, size_t *, size_t *);
size_t vs_rcm(SCR *, recno_t, int);
size_t vs_colpos(SCR *, recno_t, size_t);
int vs_change(SCR *, recno_t, lnop_t);
int vs_sm_fill(SCR *, recno_t, pos_t);
int vs_sm_scroll(SCR *, MARK *, recno_t, scroll_t);
recno_t vs_sm_nlines(SCR *, SMAP *, recno_t, size_t);
const CHAR_T *, size_t, ARG_CHAR_T, recno_t, u_long, u_int32_t);
int v_txt_auto(SCR *, recno_t, TEXT *, size_t, TEXT *);