Searched refs:db_indx_t (Results 1 - 25 of 48) sorted by relevance

12

/macosx-10.9.5/BerkeleyDB-21/db/dbinc/
H A Dhash.h76 db_indx_t dup_off; /* Offset within a duplicate set. */
77 db_indx_t dup_len; /* Length of current duplicate. */
78 db_indx_t dup_tlen; /* Total length of duplicate entry. */
81 db_indx_t seek_found_indx;/* Insert position for item. */
118 #define DUP_SIZE(len) ((len) + 2 * sizeof(db_indx_t))
H A Ddb_page.h26 * Note that key/data lengths are often stored in db_indx_t's -- this is
29 * db_indx_t, and storing it in one saves space.
231 db_indx_t entries; /* 20-21: Number of items on the page. */
232 db_indx_t hf_offset; /* 22-23: High free byte page offset. */
260 ((db_indx_t *)((u_int8_t *)(pg) + SIZEOF_PAGE + \
347 HOFFSET(pg) = (db_indx_t)(pg_size); \
357 (P_OVERHEAD(dbp) + NUM_ENT(pg) * sizeof(db_indx_t))
447 (db_indx_t)(LEN_HITEM(dbp, pg, psize, indx) - HKEYDATA_SIZE(0))
456 (HKEYDATA_SIZE(len) + sizeof(db_indx_t))
498 #define HOFFPAGE_PSIZE (HOFFPAGE_SIZE + sizeof(db_indx_t))
[all...]
H A Dbtree.h141 db_indx_t indx; /* The index on the page. */
142 db_indx_t entries; /* The number of entries on page */
207 db_indx_t ovflsize; /* Maximum key/data on-page size. */
H A Ddb_verify.h145 db_indx_t entries; /* Actual number of entries. */
H A Ddb_am.h254 for (base = 0, limit = NUM_ENT(page) / (db_indx_t)(adjust); \
/macosx-10.9.5/BerkeleyDB-21/db/db/
H A Ddb_dup.c30 db_indx_t cnt, *inp, offset;
78 sizeof(db_indx_t) * (NUM_ENT(pagep) - indx));
101 db_indx_t *inp;
150 sizeof(db_indx_t) * (NUM_ENT(pagep) - indx));
H A Ddb_reclaim.c118 db_indx_t indx, len, off, tlen, top;
193 off += len + 2 * sizeof(db_indx_t)) {
197 + off, sizeof(db_indx_t));
217 ldbt.size += p->entries * sizeof(db_indx_t);
H A Ddb_upg_opd.c51 db_indx_t indx;
205 db_indx_t *inp;
301 db_indx_t *inp;
H A Ddb_conv.c447 db_indx_t i, *inp, len, tmp;
491 p, sizeof(db_indx_t));
492 p += sizeof(db_indx_t);
495 p, sizeof(db_indx_t));
/macosx-10.9.5/BerkeleyDB-21/db/hash/
H A Dhash_dup.c211 hcp->dup_tlen += (db_indx_t)DUP_SIZE(nval->size);
217 hcp->dup_tlen += (db_indx_t)DUP_SIZE(nval->size);
256 db_indx_t i, len, off;
334 memcpy(&len, p, sizeof(db_indx_t));
336 p += sizeof(db_indx_t);
338 p += len + sizeof(db_indx_t);
356 off += len + 2 * sizeof(db_indx_t);
407 db_indx_t tsize, item_size;
411 item_size = (db_indx_t)notdup->size;
424 memcpy(p, &item_size, sizeof(db_indx_t));
[all...]
H A Dhash_verify.c190 db_indx_t *inp;
239 inpend += sizeof(db_indx_t);
272 db_indx_t offset, len, dlen, elen;
303 memcpy(&dlen, databuf + offset, sizeof(db_indx_t));
319 databuf + offset + dlen + sizeof(db_indx_t),
320 sizeof(db_indx_t));
738 db_indx_t i;
810 db_indx_t dlen, len, tlen;
923 HKEYDATA_SIZE(2 * sizeof(db_indx_t))) {
942 for (tlen = 0; tlen + sizeof(db_indx_t) < le
[all...]
H A Dhash_conv.c42 P_INIT(pp, (db_indx_t)pginfo->db_pagesize,
H A Dhash.c260 db_indx_t len;
289 memcpy(&len, p, sizeof(db_indx_t));
290 p += 2 * sizeof(db_indx_t) + len;
590 db_indx_t dup_len, dup_off, dup_tlen, indx, *inp;
709 sizeof(db_indx_t));
808 HKEYDATA_DATA(hk), sizeof(db_indx_t));
831 dup_off -= (db_indx_t)
843 dup_off + sizeof(db_indx_t));
846 sizeof(db_indx_t));
1311 db_indx_t nd
[all...]
H A Dhash_page.c62 __P((DBC *, PAGE *, const DBT *, int, int *, db_indx_t *));
64 __P((DBC *, PAGE *, const DBT *, int *, db_indx_t *));
121 hcp->dup_off, sizeof(db_indx_t));
123 if (hcp->indx >= (db_indx_t)NUM_ENT(hcp->page)) {
309 + hcp->dup_off - sizeof(db_indx_t),
310 sizeof(db_indx_t));
469 * PUBLIC: PAGE *p, db_indx_t *indxp, const DBT *, const DBT *, int, int));
475 db_indx_t *indxp;
481 db_indx_t *inp;
563 (n - indx) * sizeof(db_indx_t));
[all...]
H A Dhash_stat.c226 db_indx_t indx, len, off, tlen, top;
269 off += len + 2 * sizeof(db_indx_t)) {
273 + off, sizeof(db_indx_t));
H A Dhash_upgrade.c234 db_indx_t indx;
/macosx-10.9.5/BerkeleyDB-21/db/btree/
H A Dbt_put.c54 PAGE *, u_int32_t, u_int32_t, db_indx_t *));
81 db_indx_t cnt, indx;
201 need_bytes = sizeof(db_indx_t);
605 db_indx_t cnt, lo, ln, min, off, prefix, suffix;
608 db_indx_t *inp;
667 ln = (db_indx_t)BKEYDATA_SIZE(data->size);
706 db_indx_t *cntp;
710 db_indx_t cnt, first, *inp;
784 db_indx_t cpindx, dindx, first, *inp;
H A Dbt_upgrade.c134 db_indx_t indx;
H A Dbt_verify.c20 db_indx_t *, u_int32_t));
25 db_indx_t *, u_int32_t));
45 db_indx_t ovflsize;
198 db_indx_t i;
389 db_indx_t *nentriesp;
398 db_indx_t *inp;
477 if ((db_indx_t)himark != HOFFSET(h)) {
506 db_indx_t *nentriesp;
816 if ((db_indx_t)himark != HOFFSET(h)) {
865 db_indx_t
[all...]
H A Dbt_split.c51 static int __bam_psplit __P((DBC *, EPG *, PAGE *, PAGE *, db_indx_t *));
123 <= (db_indx_t)P_FREESPACE(dbc->dbp, cp->csp[0].page)) {
176 db_indx_t split;
271 db_indx_t split;
715 db_indx_t off;
966 db_indx_t *splitret;
970 db_indx_t half, *inp, nbytes, off, splitp, top;
1103 if (off < (db_indx_t)NUM_ENT(pp) &&
1111 if (splitp <= (db_indx_t)(cnt * adjust))
1138 if (splitp <= (db_indx_t)(cn
[all...]
H A Dbt_delete.c69 db_indx_t *inp;
174 db_indx_t copy, *inp;
193 sizeof(db_indx_t) * (NUM_ENT(h) - indx));
200 sizeof(db_indx_t) * (NUM_ENT(h) - indx));
226 db_indx_t nitems;
H A Dbt_rsearch.c69 db_indx_t adjust, deloffset, indx, top;
400 db_indx_t indx, top;
H A Dbt_search.c174 db_indx_t base, i, indx, *inp, lim;
533 while (indx < (db_indx_t)(NUM_ENT(h) - P_INDX) &&
559 indx < (db_indx_t)(NUM_ENT(h) - adjust) &&
H A Dbt_compact.c969 db_indx_t nent;
1025 db_indx_t adj, indx, nent, *ninp, pind;
1086 size += sizeof(db_indx_t);
1319 db_indx_t nent, *ninp, *pinp;
1455 db_indx_t indx, pind;
1601 if (P_FREESPACE(dbp, pg) < size + sizeof(db_indx_t))
1622 if (P_FREESPACE(dbp, pg) < size + sizeof(db_indx_t))
1759 db_indx_t i;
1921 hdr.size += NUM_ENT(*pgp) * sizeof(db_indx_t);
2169 db_indx_t ind
[all...]
/macosx-10.9.5/BerkeleyDB-21/db/dbinc_auto/
H A Dhash_ext.h81 int __ham_insertpair __P((DBC *, PAGE *p, db_indx_t *indxp, const DBT *, const DBT *, int, int));
82 int __ham_getindex __P((DBC *, PAGE *, const DBT *, int, int *, db_indx_t *));
90 int __ham_copypair __P((DBC *, PAGE *, u_int32_t, PAGE *, db_indx_t *));

Completed in 138 milliseconds

12