Home
last modified time | relevance | path

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

/freebsd-10-stable/lib/libc/db/recno/
Drec_put.c125 if (nrec <= t->bt_nrecs) in __rec_put()
137 if (nrec > t->bt_nrecs) { in __rec_put()
141 if (nrec > t->bt_nrecs + 1) { in __rec_put()
152 while (nrec > t->bt_nrecs + 1) in __rec_put()
154 t->bt_nrecs, &tdata, 0) != RET_SUCCESS) in __rec_put()
220 nrec > t->bt_nrecs || flags == R_IAFTER || flags == R_IBEFORE ? in __rec_iput()
240 if (nrec < t->bt_nrecs && in __rec_iput()
257 ++t->bt_nrecs; in __rec_iput()
270 ++t->bt_nrecs; in __rec_iput()
Drec_seq.c100 nrec = t->bt_nrecs; in __rec_seq()
107 if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) { in __rec_seq()
111 if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) in __rec_seq()
Drec_get.c86 if (nrec > t->bt_nrecs) { in __rec_get()
133 for (nrec = t->bt_nrecs; nrec < top;) { in __rec_fpipe()
178 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_vpipe()
239 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_fmap()
278 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_vmap()
Drec_delete.c80 if (nrec > t->bt_nrecs) in __rec_delete()
88 if (t->bt_nrecs == 0) in __rec_delete()
185 --t->bt_nrecs; in __rec_dleaf()
/freebsd-10-stable/lib/libc/db/btree/
Dbt_debug.c67 (void)fprintf(stderr, " keys %u", t->bt_nrecs); in __bt_dump()
292 (void)fprintf(stderr, " (%u header count)", t->bt_nrecs); in __bt_stat()
Dbt_open.c248 t->bt_nrecs = m.nrecs; in __bt_open()
267 t->bt_nrecs = 0; in __bt_open()
Dbt_close.c173 m.nrecs = t->bt_nrecs; in bt_meta()
Dbtree.h349 recno_t bt_nrecs; /* R: number of records */ member