Searched refs:O_INDX (Results 1 - 16 of 16) sorted by relevance

/macosx-10.10/BerkeleyDB-21/db/btree/
H A Dbt_rsearch.c163 deloffset = O_INDX;
165 adjust = O_INDX;
410 GET_BKEYDATA(dbp, h, indx + O_INDX)->type))
415 for (indx = 0; indx < top; indx += O_INDX)
420 for (indx = 0; indx < top; indx += O_INDX)
427 for (indx = 0; indx < top; indx += O_INDX)
H A Dbt_stat.c346 type = GET_BKEYDATA(dbp, h, indx + O_INDX)->type;
381 for (indx = 0; indx < top; indx += O_INDX) {
403 for (indx = 0; indx < top; indx += O_INDX)
587 for (indx = 0; indx < NUM_ENT(h); indx += O_INDX) {
600 for (indx = 0; indx < NUM_ENT(h); indx += O_INDX) {
619 bk = GET_BKEYDATA(dbp, h, indx + O_INDX);
622 GET_BOVERFLOW(dbp, h, indx + O_INDX)->pgno,
627 GET_BOVERFLOW(dbp, h, indx + O_INDX)->pgno,
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_put.c148 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0),
193 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0));
396 cp->indx = TYPE(h) == P_LBTREE ? indx - O_INDX : indx;
415 (ret = __bam_dup_convert(dbc, h, indx - O_INDX, cnt)) != 0)
450 bk = GET_BKEYDATA(dbp, h, indx + (TYPE(h) == P_LBTREE ? O_INDX : 0));
519 O_INDX : 0));
741 bk = GET_BKEYDATA(dbp, h, indx + O_INDX);
H A Dbt_search.c218 adjust = TYPE(h) == P_LBTREE ? P_INDX : O_INDX;
264 * key and may be zero or a last + O_INDX index.
350 indx = base > 0 ? base - O_INDX : base;
550 deloffset = TYPE(h) == P_LBTREE ? O_INDX : 0;
583 GET_BKEYDATA(dbp, h, i + O_INDX)->type))
H A Dbt_cursor.c120 (indx) + (TYPE(page) == P_LBTREE ? O_INDX : 0))->type)
384 root_pgno = GET_BOVERFLOW(dbp, h, cp->indx + O_INDX)->pgno;
660 top = NUM_ENT(cp->page) - O_INDX;; indx += O_INDX) {
739 B_DSET(GET_BKEYDATA(dbp, cp->page, cp->indx + O_INDX)->type);
1709 cp->indx + O_INDX, __bam_defcmp, &cmp)) != 0)
1734 cp->page, cp->indx + O_INDX, dbp->dup_compare, &cmp)) != 0)
1743 cp->page, cp->indx + O_INDX, dbp->dup_compare, &cmp)) != 0)
1767 * or a last + O_INDX index, and may be deleted. Find an undeleted
1930 cp->indx + O_INDX, db
[all...]
H A Dbt_delete.c118 h, indx, indx + O_INDX, 0));
192 memmove(&inp[indx + O_INDX], &inp[indx],
199 memmove(&inp[indx], &inp[indx + O_INDX],
H A Dbt_verify.c928 adj = (TYPE(h) == P_LBTREE) ? P_INDX : O_INDX;
1699 for (i = 0; i < pip->entries; i += O_INDX) {
1701 ri = (i + O_INDX < pip->entries) ?
1702 GET_BINTERNAL(dbp, h, i + O_INDX) : r;
1935 last = NUM_ENT(h) - O_INDX;
2087 for (i = 0, last = UINT16_MAX;; i += O_INDX) {
2236 adj = pgtype == P_IBTREE ? O_INDX : P_INDX;
H A Dbt_split.c744 off = parent->indx + O_INDX;
844 (TYPE(lchild) == P_LDUP ? O_INDX : P_INDX));
976 adjust = TYPE(pp) == P_LBTREE ? P_INDX : O_INDX;
1001 * NUM_ENT(page) - O_INDX Btree or Recno internal insert past EOT
1005 * two of which, (NUM_ENT(page) - O_INDX or P_INDX) might be an insert
H A Dbt_compact.c1063 adj = TYPE(npg) == P_LBTREE ? P_INDX : O_INDX;
1275 npg, 0, O_INDX, 0)) != 0)
H A Dbt_rec.c632 indx = argp->indx + (TYPE(pagep) == P_LBTREE ? O_INDX : 0);
639 indx = argp->indx + (TYPE(pagep) == P_LBTREE ? O_INDX : 0);
/macosx-10.10/BerkeleyDB-21/db/db/
H A Ddb_reclaim.c133 type = GET_BKEYDATA(dbp, p, indx + O_INDX)->type;
161 for (indx = 0; indx < top; indx += O_INDX) {
174 for (indx = 0; indx < top; indx += O_INDX)
H A Ddb_pr.c611 B_DISSET(GET_BKEYDATA(dbp, h, i + O_INDX)->type);
H A Ddb_cam.c867 type == P_HASH || type == P_HASH_UNSORTED) ? O_INDX : 0);
H A Ddb_vrfy.c2455 bkdata = GET_BKEYDATA(dbp, master, i + O_INDX);
/macosx-10.10/BerkeleyDB-21/db/dbinc/
H A Ddb_page.h603 #define O_INDX 1 macro

Completed in 269 milliseconds