Searched refs:NUM_ENT (Results 1 - 25 of 28) sorted by relevance

12

/macosx-10.10/BerkeleyDB-21/db/db/
H A Ddb_dup.c36 DB_ASSERT(dbp->env, indx < NUM_ENT(pagep));
52 if (NUM_ENT(pagep) == 1) {
53 NUM_ENT(pagep) = 0;
70 for (cnt = 0; cnt < NUM_ENT(pagep); ++cnt)
75 --NUM_ENT(pagep);
76 if (indx != NUM_ENT(pagep))
78 sizeof(db_indx_t) * (NUM_ENT(pagep) - indx));
148 if (indx != NUM_ENT(pagep))
150 sizeof(db_indx_t) * (NUM_ENT(pagep) - indx));
153 ++NUM_ENT(page
[all...]
H A Ddb_conv.c474 for (i = 0; i < NUM_ENT(h); i++) {
524 for (i = 0; i < NUM_ENT(h); i++)
530 for (i = 0; i < NUM_ENT(h); i++) {
572 for (i = 0; i < NUM_ENT(h); i++) {
602 for (i = 0; i < NUM_ENT(h); i++) {
H A Ddb_upg_opd.c82 nrecs += NUM_ENT(page);
155 ++NUM_ENT(ipage);
H A Ddb_reclaim.c123 top = NUM_ENT(p);
H A Ddb_vrfy.c1212 if (smallest_entry * NUM_ENT(h) / 2 > dbp->pgsize) {
1215 (u_long)pgno, (u_long)NUM_ENT(h)));
1219 pip->entries = NUM_ENT(h);
1695 vdp->thread_info, currpg, p, NUM_ENT(currpg), 1,
1748 NUM_ENT(currpg), hmeta, bucket, pgno,
2453 for (i = 0; i < NUM_ENT(master); i += P_INDX) {
H A Ddb_pr.c581 __db_msgadd(env, &mb, "%sentries: %4lu", s, (u_long)NUM_ENT(h));
590 for (i = 0; i < NUM_ENT(h); i++) {
/macosx-10.10/BerkeleyDB-21/db/btree/
H A Dbt_delete.c115 if (indx + P_INDX < (u_int32_t)NUM_ENT(h) &&
191 if (indx != NUM_ENT(h))
193 sizeof(db_indx_t) * (NUM_ENT(h) - indx));
195 ++NUM_ENT(h);
197 --NUM_ENT(h);
198 if (indx != NUM_ENT(h))
200 sizeof(db_indx_t) * (NUM_ENT(h) - indx));
252 if (NUM_ENT(stack_epg->page) > 1)
294 nitems = NUM_ENT(epg->page);
326 if (NUM_ENT(ep
[all...]
H A Dbt_compact.c485 dbc->dbtype != DB_RECNO && NUM_ENT(pg) != 0) {
490 next_recno += NUM_ENT(pg);
507 cp->recno += NUM_ENT(pg);
542 if ((nentry = NUM_ENT(pg)) != 0) {
608 if (NUM_ENT(pg) != 0)
659 if (NUM_ENT(pg) == 0 ||
702 cp->csp[-1].indx != NUM_ENT(cp->csp[-1].page) - 1)
740 cp->recno += NUM_ENT(pg);
758 if ((nentry = NUM_ENT(pg)) == 0)
803 ncp->recno += NUM_ENT(p
[all...]
H A Dbt_search.c220 if (LF_ISSET(SR_MIN) || NUM_ENT(h) == 0)
223 indx = NUM_ENT(h) - 2;
225 indx = NUM_ENT(h) - 1;
313 if (indx == NUM_ENT(cp->sp->page)) {
400 if (LF_ISSET(SR_DEL) && NUM_ENT(h) > 1) {
453 if ((LF_ISSET(SR_DEL) && NUM_ENT(h) == 1)) {
481 indx == NUM_ENT(h) - 1)
531 if (TYPE(h) == P_LBTREE && NUM_ENT(h) > P_INDX) {
533 while (indx < (db_indx_t)(NUM_ENT(h) - P_INDX) &&
559 indx < (db_indx_t)(NUM_ENT(
[all...]
H A Dbt_rsearch.c169 if (indx >= NUM_ENT(h)) {
198 for (indx = 0, top = NUM_ENT(h);;) {
217 for (indx = 0, top = NUM_ENT(h);;) {
403 top = NUM_ENT(h);
424 nrecs = NUM_ENT(h);
H A Dbt_cursor.c518 if (NUM_ENT(h) == 0) {
633 top = NUM_ENT(cp->page) - P_INDX;; indx += P_INDX) {
660 top = NUM_ENT(cp->page) - O_INDX;; indx += O_INDX) {
875 if ((cp->indx == NUM_ENT(cp->page) ||
986 if (cp->indx == NUM_ENT(cp->page) || IS_CUR_DELETED(dbc))
1336 while (indx + adj < NUM_ENT(pg) &&
1344 } while ((indx += adj) < NUM_ENT(pg) &&
1348 if (ret == 0 && next_key && indx >= NUM_ENT(pg)) {
1552 } while (indx < NUM_ENT(pg));
1665 if (cp->indx + P_INDX >= NUM_ENT(c
[all...]
H A Dbt_stat.c331 top = NUM_ENT(h);
587 for (indx = 0; indx < NUM_ENT(h); indx += O_INDX) {
600 for (indx = 0; indx < NUM_ENT(h); indx += O_INDX) {
609 for (indx = 0; indx < NUM_ENT(h); indx += P_INDX) {
612 (indx + P_INDX >= NUM_ENT(h) ||
634 for (indx = 0; indx < NUM_ENT(h); indx += O_INDX) {
H A Dbt_upgrade.c138 for (indx = O_INDX; indx < NUM_ENT(h); indx += P_INDX) {
H A Dbt_rec.c138 NUM_ENT(sp))) != 0)
1133 DB_ASSERT(env, argp->hdr.size == 0 || NUM_ENT(pagep) == 0);
1153 pinp = P_INP(file_dbp, pagep) + NUM_ENT(pagep);
1160 NUM_ENT(pagep) += i;
1172 indx = NUM_ENT(pagep) - 1;
1175 NUM_ENT(pagep)--;
1226 NUM_ENT(pagep) = 0;
1242 pinp = P_INP(file_dbp, pagep) + NUM_ENT(pagep);
1248 NUM_ENT(pagep) = i;
1310 DB_ASSERT(env, !argp->pg_copy || NUM_ENT(page
[all...]
H A Dbt_split.c221 &LSN(rp), (u_int32_t)NUM_ENT(lp), 0, &log_lsn,
405 &LSN(alloc_rp), (u_int32_t)NUM_ENT(lp),
843 tmp_bk = GET_BKEYDATA(dbp, lchild, NUM_ENT(lchild) -
1000 * NUM_ENT(page) Btree/Recno leaf insert past end-of-tree
1001 * NUM_ENT(page) - O_INDX Btree or Recno internal insert past EOT
1002 * NUM_ENT(page) - P_INDX Btree leaf insert past EOT after a set
1005 * two of which, (NUM_ENT(page) - O_INDX or P_INDX) might be an insert
1012 if (NEXT_PGNO(pp) == PGNO_INVALID && cp->indx >= NUM_ENT(pp) - adjust)
1013 off = NUM_ENT(pp) - adjust;
1040 top = NUM_ENT(p
[all...]
H A Dbt_verify.c246 for (i = 0; i < NUM_ENT(h); i++) {
278 pip->rec_cnt = NUM_ENT(h);
420 for (i = 0; i < NUM_ENT(h); i++) {
554 * NUM_ENT(h)), ends before the beginning of the page, doesn't
562 for (i = 0; i < NUM_ENT(h); i++) {
835 * Assumes that NUM_ENT(h) and inp[0]..inp[NUM_ENT(h) - 1] are
874 * NUM_ENT isn't safe.
1794 if (NUM_ENT(h) == 0 && ISINTERNAL(h)) {
1929 if (NUM_ENT(
[all...]
H A Dbt_put.c517 if (indx < NUM_ENT(h)) {
677 for (cnt = 0; cnt < NUM_ENT(h); ++cnt)
739 indx < NUM_ENT(h) && inp[first] == inp[indx];
/macosx-10.10/BerkeleyDB-21/db/dbinc/
H A Ddb_page.h281 #define NUM_ENT(p) (((PAGE *)p)->entries) macro
329 (db_pgno_t)(TYPE(p) == P_LBTREE ? NUM_ENT(p) / 2 : NUM_ENT(p)))
346 NUM_ENT(pg) = (0); \
357 (P_OVERHEAD(dbp) + NUM_ENT(pg) * sizeof(db_indx_t))
467 #define H_NUMPAIRS(pg) (NUM_ENT(pg) / 2)
H A Dbtree.h166 (c)->csp->entries = NUM_ENT(pagep); \
182 (c)->csp->entries = NUM_ENT(pagep); \
H A Ddb_am.h254 for (base = 0, limit = NUM_ENT(page) / (db_indx_t)(adjust); \
/macosx-10.10/BerkeleyDB-21/db/hash/
H A Dhash_page.c103 if (hcp->indx < NUM_ENT(hcp->page) &&
123 if (hcp->indx >= (db_indx_t)NUM_ENT(hcp->page)) {
344 hcp->indx = NUM_ENT(hcp->page);
354 hcp->indx = NUM_ENT(hcp->page);
360 hcp->indx = NUM_ENT(hcp->page);
487 n = NUM_ENT(p);
587 NUM_ENT(p) += 2;
618 DB_ASSERT(dbc->env, NUM_ENT(p)%2 == 0 );
662 n = NUM_ENT(p);
876 n = NUM_ENT(
[all...]
H A Dhash_stat.c255 top = NUM_ENT(pagep);
451 for (i = 0; i < NUM_ENT(hcp->page); i++) {
H A Dhash_upgrade.c240 for (indx = 0; indx < NUM_ENT(h); indx += 2) {
H A Dhash_verify.c213 * Verify inp[]. Each offset from 0 to NUM_ENT(h) must be lower
223 ent < NUM_ENT(h); ent++)
828 /* If we're not aggressive, break when we hit NUM_ENT(h). */
829 if (!LF_ISSET(DB_AGGRESSIVE) && i >= NUM_ENT(h))
H A Dhash.c273 if (hcp->indx >= NUM_ENT(hcp->page)) {
917 } while (next_key && (indx += 2) < NUM_ENT(pg));
925 if (ret == 0 && next_key && indx >= NUM_ENT(pg)) {

Completed in 286 milliseconds

12