Home
last modified time | relevance | path

Searched refs:bt_nrecs (Results 1 – 8 of 8) sorted by relevance

/freebsd/lib/libc/db/recno/
H A Drec_put.c121 if (nrec <= t->bt_nrecs) in __rec_put()
133 if (nrec > t->bt_nrecs) { in __rec_put()
137 if (nrec > t->bt_nrecs + 1) { in __rec_put()
147 while (nrec > t->bt_nrecs + 1) in __rec_put()
149 t->bt_nrecs, &tdata, 0) != RET_SUCCESS) in __rec_put()
215 nrec > t->bt_nrecs || flags == R_IAFTER || flags == R_IBEFORE ? in __rec_iput()
235 if (nrec < t->bt_nrecs && in __rec_iput()
252 ++t->bt_nrecs; in __rec_iput()
265 ++t->bt_nrecs; in __rec_iput()
H A Drec_seq.c95 nrec = t->bt_nrecs; in __rec_seq()
102 if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) { in __rec_seq()
106 if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) in __rec_seq()
H A Drec_get.c82 if (nrec > t->bt_nrecs) { in __rec_get()
129 for (nrec = t->bt_nrecs; nrec < top;) { in __rec_fpipe()
174 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_vpipe()
235 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_fmap()
274 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_vmap()
H A Drec_delete.c76 if (nrec > t->bt_nrecs) in __rec_delete()
84 if (t->bt_nrecs == 0) in __rec_delete()
181 --t->bt_nrecs; in __rec_dleaf()
/freebsd/lib/libc/db/btree/
H A Dbt_debug.c63 (void)fprintf(stderr, " keys %u", t->bt_nrecs); in __bt_dump()
288 (void)fprintf(stderr, " (%u header count)", t->bt_nrecs); in __bt_stat()
H A Dbt_open.c244 t->bt_nrecs = m.nrecs; in __bt_open()
263 t->bt_nrecs = 0; in __bt_open()
H A Dbt_close.c169 m.nrecs = t->bt_nrecs; in bt_meta()
H A Dbtree.h348 recno_t bt_nrecs; /* R: number of records */ member