Searched refs:nrecs (Results 1 - 25 of 32) sorted by relevance

12

/macosx-10.9.5/Libc-997.90.3/db/recno/FreeBSD/
H A Drec_search.c84 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;
/macosx-10.9.5/BerkeleyDB-21/db/btree/
H A Dbt_rsearch.c200 if (++indx == top || total + bi->nrecs >= recno)
202 total += bi->nrecs;
219 if (++indx == top || total + ri->nrecs >= recno)
221 total += ri->nrecs;
338 GET_BINTERNAL(dbp, h, epg->indx)->nrecs +=
341 GET_RINTERNAL(dbp, h, epg->indx)->nrecs +=
399 db_recno_t nrecs; local
402 nrecs = 0;
411 ++nrecs;
417 ++nrecs;
[all...]
H A Dbt_split.c635 bi0.nrecs = __bam_total(dbp, lp);
636 RE_NREC_SET(rootp, bi0.nrecs);
637 bi.nrecs = __bam_total(dbp, rp);
638 RE_NREC_ADJ(rootp, bi.nrecs);
678 ri.nrecs = __bam_total(dbp, lp);
681 RE_NREC_SET(rootp, ri.nrecs);
683 ri.nrecs = __bam_total(dbp, rp);
686 RE_NREC_ADJ(rootp, ri.nrecs);
716 db_recno_t nrecs; local
728 nrecs
[all...]
H A Dbt_verify.c456 child.nrecs = ri->nrecs;
1161 u_int32_t nrecs, level, relen, stflags; local
1217 root, NULL, NULL, stflags, &level, &nrecs, &relen)) != 0)
1285 db_recno_t child_nrecs, nrecs; local
1300 nrecs = 0;
1349 * level and nrecs.
1352 * overflows. Then return nrecs and level.
1355 * and their nrecs sum to ours.
1577 * recurse, keeping a running count of nrecs an
[all...]
H A Dbt_recno.c929 db_recno_t nrecs; local
946 if ((ret = __bam_nrecs(dbc, &nrecs)) != 0)
948 if (!t->re_eof && recno > nrecs) {
951 if ((ret = __bam_nrecs(dbc, &nrecs)) != 0)
959 if (!can_create || recno <= nrecs + 1)
966 while (recno > ++nrecs)
968 &nrecs, rdata, 0, BI_DELETED)) != 0)
/macosx-10.9.5/BerkeleyDB-21/db/test/
H A Dlog007.tcl33 set nrecs [expr $recsperfile + 1]
45 puts "\tLog$tnum.a.$i: Writing $nrecs 13-byte log records."
47 for { set j 0 } { $j < $nrecs } { incr j } {
52 set nentries [expr [expr $i * $nrecs] + $j]
H A Dlog001.tcl38 proc log001_body { max nrecs fixedlength inmem {encargs ""} } {
72 puts "\tLog001.a: Writing $nrecs log records"
73 for { set i 0 } { $i < $nrecs } { incr i } {
120 for { set i 0 } { $i < $nrecs } { incr i } {
H A Dtest021.tcl129 for { set nrecs 0 } { $nrecs < 20 } { incr nrecs } {
H A Darchive.tcl77 set nrecs $maxfile
116 for { set i 1 } { $i <= $nrecs } { incr i } {
H A Drecd012.tcl149 set nrecs [berkdb random_int 0 3]
150 for { set j 0 } { $j < $nrecs } { incr j } {
/macosx-10.9.5/tcpdump-56/tcpdump/
H A Dprint-cnfp.c87 int nrecs, ver; local
97 nrecs = EXTRACT_32BITS(&nh->ver_cnt) & 0xffff;
122 printf("%2u recs", nrecs);
124 for (; nrecs-- && (const u_char *)(nr + 1) <= snapend; nr++) {
/macosx-10.9.5/BerkeleyDB-21/db/db/
H A Ddb_upg_opd.c54 db_recno_t nrecs; local
71 for (nrecs = 0, cur_cnt = pgno_max = 0,
82 nrecs += NUM_ENT(page);
165 RE_NREC_SET(ipage, nrecs);
222 bi.nrecs = __bam_total(dbp, page);
249 bi.nrecs = __bam_total(dbp, page);
267 bi.nrecs = __bam_total(dbp, page);
311 ri.nrecs = __bam_total(dbp, page);
H A Ddb_conv.c582 M_32_SWAP(bi->nrecs);
611 M_32_SWAP(ri->nrecs);
/macosx-10.9.5/Libc-997.90.3/db/btree/FreeBSD/
H A Dbtree.h149 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 Dbt_close.c172 m.nrecs = t->bt_nrecs;
H A Dbt_split.c251 ((RINTERNAL *)dest)->nrecs = rec_total(lchild);
257 ((RINTERNAL *)dest)->nrecs = rec_total(rchild);
269 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(lchild);
275 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(rchild);
794 recs += GETRINTERNAL(h, nxt)->nrecs;
H A Dbt_debug.c109 (void)fprintf(stderr, "nrecs %u\n", m->nrecs);
200 ri->nrecs, ri->pgno);
H A Dbt_open.c237 M_32_SWAP(m.nrecs);
250 t->bt_nrecs = m.nrecs;
/macosx-10.9.5/dtrace-118.1/libdtrace/
H A Ddt_printf.c1202 uint_t nrecs, const void *buf, size_t len, int *ip)
1206 if (nrecs == 0)
1277 const dtrace_recdesc_t *recs, uint_t nrecs, const void *buf,
1295 * decrement nrecs to prevent this record from being used with any
1302 if (nrecs == 0)
1308 nrecs--;
1352 return (nrecs != 0);
1367 if (dt_printf_getint(dtp, recp++, nrecs--, buf,
1376 dtp, recp++, nrecs--, buf, len, &prec) == -1)
1409 if (nrecs
1201 dt_printf_getint(dtrace_hdl_t *dtp, const dtrace_recdesc_t *recp, uint_t nrecs, const void *buf, size_t len, int *ip) argument
1276 dt_printf_format(dtrace_hdl_t *dtp, FILE *fp, const dt_pfargv_t *pfv, const dtrace_recdesc_t *recs, uint_t nrecs, const void *buf, size_t len, const dtrace_aggdata_t **aggsdata, int naggvars) argument
1532 dtrace_sprintf(dtrace_hdl_t *dtp, FILE *fp, void *fmtdata, const dtrace_recdesc_t *recp, uint_t nrecs, const void *buf, size_t len) argument
1562 dtrace_system(dtrace_hdl_t *dtp, FILE *fp, void *fmtdata, const dtrace_probedata_t *data, const dtrace_recdesc_t *recp, uint_t nrecs, const void *buf, size_t len) argument
1585 dtrace_freopen(dtrace_hdl_t *dtp, FILE *fp, void *fmtdata, const dtrace_probedata_t *data, const dtrace_recdesc_t *recp, uint_t nrecs, const void *buf, size_t len) argument
1686 dtrace_fprintf(dtrace_hdl_t *dtp, FILE *fp, void *fmtdata, const dtrace_probedata_t *data, const dtrace_recdesc_t *recp, uint_t nrecs, const void *buf, size_t len) argument
1840 uint_t nrecs = agg->dtagd_nrecs; local
1868 uint_t nrecs = agg->dtagd_nrecs - 1; local
1891 dtrace_fprinta(dtrace_hdl_t *dtp, FILE *fp, void *fmtdata, const dtrace_probedata_t *data, const dtrace_recdesc_t *recs, uint_t nrecs, const void *buf, size_t len) argument
[all...]
H A Ddt_aggregate.c1153 int rval, i, j, keypos, nrecs; local
1158 nrecs = lagg->dtagd_nrecs - 1;
1159 assert(nrecs == ragg->dtagd_nrecs - 1);
1161 keypos = dt_keypos + 1 >= nrecs ? 0 : dt_keypos;
1163 for (i = 1; i < nrecs; i++) {
1167 if (ndx >= nrecs)
1168 ndx = ndx - nrecs + 1;
/macosx-10.9.5/BerkeleyDB-21/db/dbinc/
H A Ddb_verify.h188 db_recno_t nrecs; /* record count on a btree subtree */ member in struct:__vrfy_childinfo
H A Ddb_page.h618 db_recno_t nrecs; /* 08-11: Subtree record count. */ member in struct:_binternal
644 db_recno_t nrecs; /* 04-07: Subtree record count. */ member in struct:_rinternal
/macosx-10.9.5/BerkeleyDB-21/db/examples_cxx/
H A DTpcbExample.cpp382 int nrecs, const char *msg)
390 for (int i = 0; i < nrecs; i++) {
405 TpcbExample::populateHistory(Db *dbp, int nrecs, u_int32_t accounts, argument
416 for (int i = 1; i <= nrecs; i++) {
380 populateTable(Db *dbp, u_int32_t start_id, u_int32_t balance, int nrecs, const char *msg) argument
/macosx-10.9.5/BerkeleyDB-21/db/examples_cxx/wce_tpcb/
H A DTpcbExample.cpp209 int nrecs, const char *msg)
222 for (int i = 0; i < nrecs; i++) {
238 TpcbExample::populateHistory(DB *dbp, int nrecs, u_int32_t accounts, argument
254 for (int i = 1; i <= nrecs; i++) {
207 populateTable(DB *dbp, u_int32_t start_id, u_int32_t balance, int nrecs, const char *msg) argument
/macosx-10.9.5/BerkeleyDB-21/db/examples_c/
H A Dex_tpcb.c410 populate(dbp, start_id, balance, nrecs, msg)
413 int nrecs;
428 for (i = 0; i < nrecs; i++) {

Completed in 413 milliseconds

12