HomeSort by: relevance | last modified time | path
    Searched refs:bt_nrecs (Results 1 - 8 of 8) sorted by relevancy

  /src/lib/libc/db/recno/
rec_seq.c 104 nrec = t->bt_nrecs;
111 if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) {
115 if (t->bt_nrecs == 0 || nrec > t->bt_nrecs)
rec_put.c 130 if (nrec <= t->bt_nrecs)
142 if (nrec > t->bt_nrecs) {
146 if (nrec > t->bt_nrecs + 1) {
156 while (nrec > t->bt_nrecs + 1)
158 t->bt_nrecs, &tdata, 0) != RET_SUCCESS)
226 nrec > t->bt_nrecs || flags == R_IAFTER || flags == R_IBEFORE ?
246 if (nrec < t->bt_nrecs &&
264 ++t->bt_nrecs;
277 ++t->bt_nrecs;
rec_get.c 91 if (nrec > t->bt_nrecs) {
139 for (nrec = t->bt_nrecs; nrec < top;) {
183 for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
247 for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
286 for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
rec_delete.c 85 if (nrec > t->bt_nrecs)
93 if (t->bt_nrecs == 0)
195 --t->bt_nrecs;
  /src/lib/libc/db/btree/
bt_close.c 175 m.nrecs = t->bt_nrecs;
bt_debug.c 94 (void)fprintf(tracefp, " keys %lu", (unsigned long) t->bt_nrecs);
353 (void)fprintf(tracefp, " (%ld header count)", (long)t->bt_nrecs);
bt_open.c 250 t->bt_nrecs = m.nrecs;
269 t->bt_nrecs = 0;
btree.h 402 recno_t bt_nrecs; /* R: number of records */ member in struct:_btree

Completed in 14 milliseconds