Searched refs:nrecs (Results 1 - 6 of 6) sorted by relevance
| /barrelfish-master/lib/libc/db/recno/ |
| H A D | rec_search.c | 84 if (++idx == top || total + r->nrecs > recno)
86 total += r->nrecs;
94 --GETRINTERNAL(h, (idx - 1))->nrecs;
98 ++GETRINTERNAL(h, (idx - 1))->nrecs;
114 --GETRINTERNAL(h, parent->index)->nrecs;
116 ++GETRINTERNAL(h, parent->index)->nrecs;
|
| /barrelfish-master/lib/libc/db/btree/ |
| H A D | btree.h | 149 recno_t nrecs; /* number of records */ member in struct:_rinternal
162 #define WR_RINTERNAL(p, nrecs, pgno) { \
163 *(recno_t *)p = nrecs; \
285 * The metadata of the tree. The nrecs field is used only by the RECNO code.
294 u_int32_t nrecs; /* R: number of records */ member in struct:_btmeta
|
| H A D | bt_close.c | 172 m.nrecs = t->bt_nrecs;
|
| H A D | bt_split.c | 254 ((RINTERNAL *)dest)->nrecs = rec_total(lchild);
260 ((RINTERNAL *)dest)->nrecs = rec_total(rchild);
272 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(lchild);
278 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(rchild);
800 recs += GETRINTERNAL(h, nxt)->nrecs;
|
| H A D | bt_debug.c | 108 (void)fprintf(stderr, "nrecs %u\n", m->nrecs);
197 ri->nrecs, ri->pgno);
|
| H A D | bt_open.c | 235 M_32_SWAP(m.nrecs);
248 t->bt_nrecs = m.nrecs;
|
Completed in 188 milliseconds