• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /macosx-10.10.1/BerkeleyDB-21/db/btree/

Lines Matching refs:indx

118 #define	IS_DELETED(dbp, page, indx)					\
120 (indx) + (TYPE(page) == P_LBTREE ? O_INDX : 0))->type)
123 IS_DELETED((dbc)->dbp, (dbc)->internal->page, (dbc)->internal->indx)
141 IS_DUPLICATE(dbc, (dbc)->internal->indx, orig_indx)))
349 dbp, cp->pgno, cp->indx, 1, &count)) != 0)
384 root_pgno = GET_BOVERFLOW(dbp, h, cp->indx + O_INDX)->pgno;
393 dbp, cp_opd->pgno, cp_opd->indx, 1, &count)) != 0)
603 db_indx_t indx, top;
628 for (indx = cp->indx;; indx -= P_INDX)
629 if (indx == 0 ||
630 !IS_DUPLICATE(dbc, indx, indx - P_INDX))
633 top = NUM_ENT(cp->page) - P_INDX;; indx += P_INDX) {
634 if (!IS_DELETED(dbp, cp->page, indx))
636 if (indx == top ||
637 !IS_DUPLICATE(dbc, indx, indx + P_INDX))
659 for (recno = 0, indx = 0,
660 top = NUM_ENT(cp->page) - O_INDX;; indx += O_INDX) {
661 if (!IS_DELETED(dbp, cp->page, indx))
663 if (indx == top)
732 PGNO(cp->page), &LSN(cp->page), cp->indx)) != 0)
739 B_DSET(GET_BKEYDATA(dbp, cp->page, cp->indx + O_INDX)->type);
741 B_DSET(GET_BKEYDATA(dbp, cp->page, cp->indx)->type);
765 ret = __bam_ca_delete(dbp, cp->pgno, cp->indx, 1, &count);
815 orig_indx = cp->indx;
875 if ((cp->indx == NUM_ENT(cp->page) ||
986 if (cp->indx == NUM_ENT(cp->page) || IS_CUR_DELETED(dbc))
1008 (cp->pgno != orig_pgno || cp->indx != orig_indx))
1051 db_indx_t *inp, indx, pg_keyoff;
1104 indx = cp->indx;
1118 pg_keyoff = inp[indx];
1121 if (IS_DELETED(dbc->dbp, pg, indx)) {
1151 if (is_key && pg_keyoff != inp[indx]) {
1152 bk = GET_BKEYDATA(dbc->dbp, pg, indx);
1184 if (indx != 0)
1185 indx -= P_INDX;
1191 indx = cp->indx;
1207 key_off = (int32_t)((inp[indx] - HOFFSET(pg))
1209 pg_keyoff = inp[indx];
1231 bk = GET_BKEYDATA(dbc->dbp, pg, indx + adj - 1);
1287 if (indx >= adj)
1288 indx -= adj;
1294 indx = cp->indx;
1329 *offp-- = (int32_t)((inp[indx + adj - 1] - HOFFSET(pg))
1336 while (indx + adj < NUM_ENT(pg) &&
1337 pg_keyoff == inp[indx + adj])
1338 indx += adj;
1344 } while ((indx += adj) < NUM_ENT(pg) &&
1345 (next_key || pg_keyoff == inp[indx]));
1348 if (ret == 0 && next_key && indx >= NUM_ENT(pg)) {
1349 cp->indx = indx;
1364 if (ret == 0 && indx < pg->entries &&
1365 F_ISSET(dbc, DBC_TRANSIENT) && pg_keyoff == inp[indx]) {
1374 if (ret == DB_BUFFER_SMALL || next_key || pg_keyoff == inp[indx])
1375 cp->indx = indx;
1377 cp->indx = indx - P_INDX;
1436 db_indx_t indx, *inp;
1469 indx = cp->indx;
1476 indx = cp->indx;
1482 if (IS_DELETED(dbp, pg, indx))
1484 bk = GET_BKEYDATA(dbp, pg, indx);
1541 *offp-- = (int32_t)((inp[indx] - HOFFSET(pg))
1549 indx++;
1552 } while (indx < NUM_ENT(pg));
1555 cp->indx = indx;
1572 } else if (indx != 0)
1573 cp->indx--;
1582 cp->indx--;
1585 } else if (indx == 0 || ret == DB_NOTFOUND) {
1638 dbc->txn, data, cp->page, cp->indx,
1665 if (cp->indx + P_INDX >= NUM_ENT(cp->page) ||
1666 !IS_DUPLICATE(dbc, cp->indx, cp->indx + P_INDX))
1668 cp->indx += P_INDX;
1705 for (;; cp->indx += P_INDX) {
1709 cp->indx + O_INDX, __bam_defcmp, &cmp)) != 0)
1714 if (cp->indx + P_INDX >= NUM_ENT(cp->page) ||
1715 !IS_DUPLICATE(dbc, cp->indx, cp->indx + P_INDX))
1729 for (base = top = cp->indx; top < NUM_ENT(cp->page); top += P_INDX)
1730 if (!IS_DUPLICATE(dbc, cp->indx, top))
1734 cp->page, cp->indx + O_INDX, dbp->dup_compare, &cmp)) != 0)
1741 cp->indx = base + ((lim >> 1) * P_INDX);
1743 cp->page, cp->indx + O_INDX, dbp->dup_compare, &cmp)) != 0)
1756 base = cp->indx + P_INDX;
1770 cp->indx = base;
1771 while (cp->indx < top && IS_CUR_DELETED(dbc))
1772 cp->indx += P_INDX;
1773 return (cp->indx < top ? 0 : DB_NOTFOUND);
1843 if (IS_DELETED(dbp, cp->page, cp->indx)) {
1912 for (;; cp->indx += P_INDX)
1913 if (cp->indx + P_INDX >=
1915 !IS_DUPLICATE(dbc, cp->indx,
1916 cp->indx + P_INDX)) {
1927 for (;; cp->indx += P_INDX) {
1930 cp->indx + O_INDX, dbp->dup_compare, &cmp)) != 0)
1939 if (IS_DELETED(dbp, cp->page, cp->indx)) {
1947 if (cp->indx + P_INDX >= NUM_ENT(cp->page) ||
1948 P_INP(dbp, ((PAGE *)cp->page))[cp->indx] !=
1949 P_INP(dbp, ((PAGE *)cp->page))[cp->indx + P_INDX]) {
2003 cp->indx = 0;
2036 cp->indx >= NUM_ENT(cp->page) - P_INDX) ||
2037 (PREV_PGNO(cp->page) == PGNO_INVALID && cp->indx == 0))) {
2103 cp->indx, &dbt, &dbc->my_rkey.data, &dbc->my_rkey.ulen)) != 0)
2191 cp->indx += adjust;
2199 * NUM_ENT, we may have incremented indx before the test.
2201 if (cp->indx >= NUM_ENT(cp->page)) {
2208 cp->indx = 0;
2212 cp->indx += adjust;
2260 if (cp->indx == 0) {
2269 if ((cp->indx = NUM_ENT(cp->page)) == 0)
2274 cp->indx -= adjust;
2299 db_indx_t indx, *inp;
2418 indx = NUM_ENT(h) - P_INDX;
2420 key, h, indx, t->bt_compare, &cmp)) != 0)
2426 indx += P_INDX;
2440 indx > 0 && inp[indx - P_INDX] == inp[indx];
2441 indx -= P_INDX)
2446 indx = 0;
2448 key, h, indx, t->bt_compare, &cmp)) != 0)
2466 indx < (db_indx_t)(NUM_ENT(h) - P_INDX) &&
2467 inp[indx] == inp[indx + P_INDX];
2468 indx += P_INDX)
2483 cp, h, indx, cp->lock, cp->lock_mode, ret);
2511 cp->indx = cp->csp->indx;
2603 if ((ret = __bam_ditem(dbc, cp->page, cp->indx)) != 0)
2607 PGNO(cp->page), cp->indx, -1)) != 0)
2610 if ((ret = __bam_ditem(dbc, cp->page, cp->indx)) != 0)
2617 if ((ret = __bam_ca_di(dbc, PGNO(cp->page), cp->indx, -1)) != 0)
2711 dbc->internal->page, dbc->internal->indx + O_INDX);