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

  /src/lib/libc/db/recno/
rec_search.c 89 if (++idx == top || total + r->nrecs > recno)
91 total += r->nrecs;
99 --GETRINTERNAL(h, (idx - 1))->nrecs;
103 ++GETRINTERNAL(h, (idx - 1))->nrecs;
119 --GETRINTERNAL(h, parent->index)->nrecs;
121 ++GETRINTERNAL(h, parent->index)->nrecs;
  /src/lib/libc/db/btree/
btree.h 176 recno_t nrecs; /* number of records */ member in struct:_rinternal
189 #define WR_RINTERNAL(p, nrecs, pgno) do { \
190 *(recno_t *)(void *)p = nrecs; \
338 * The metadata of the tree. The nrecs field is used only by the RECNO code.
347 uint32_t nrecs; /* R: number of records */ member in struct:_btmeta
bt_close.c 175 m.nrecs = t->bt_nrecs;
bt_debug.c 137 (void)fprintf(tracefp, "nrecs %lu\n", (unsigned long) m->nrecs);
251 ri->nrecs, ri->pgno);
bt_open.c 238 M_32_SWAP(m.nrecs);
251 t->bt_nrecs = m.nrecs;
bt_split.c 264 ((RINTERNAL *)(void *)dest)->nrecs = rec_total(lchild);
270 ((RINTERNAL *)(void *)dest)->nrecs = rec_total(rchild);
282 ((RINTERNAL *)(void *)dest)->nrecs = NEXTINDEX(lchild);
288 ((RINTERNAL *)(void *)dest)->nrecs = NEXTINDEX(rchild);
830 recs += GETRINTERNAL(h, nxt)->nrecs;
  /src/sys/kern/
uipc_socket2.c 1689 int nrecs, nmbufs; local
1747 nrecs = 0;
1750 nrecs++;
1759 pr(" Total %d records, %d mbufs.\n", nrecs, nmbufs);
1764 nrecs = 0;
1767 nrecs++;
1776 pr(" Total %d records, %d mbufs.\n", nrecs, nmbufs);

Completed in 23 milliseconds