Searched refs:P_INDX (Results 1 - 16 of 16) sorted by relevance
| /macosx-10.10/BerkeleyDB-21/db/btree/ |
| H A D | bt_cursor.c | 628 for (indx = cp->indx;; indx -= P_INDX)
630 !IS_DUPLICATE(dbc, indx, indx - P_INDX))
633 top = NUM_ENT(cp->page) - P_INDX;; indx += P_INDX) {
637 !IS_DUPLICATE(dbc, indx, indx + P_INDX))
1185 indx -= P_INDX;
1245 dbuf, is_key ? offp + P_INDX : NULL,
1377 cp->indx = indx - P_INDX;
1665 if (cp->indx + P_INDX >= NUM_ENT(cp->page) ||
1666 !IS_DUPLICATE(dbc, cp->indx, cp->indx + P_INDX))
[all...] |
| H A D | bt_search.c | 218 adjust = TYPE(h) == P_LBTREE ? P_INDX : O_INDX;
531 if (TYPE(h) == P_LBTREE && NUM_ENT(h) > P_INDX) {
533 while (indx < (db_indx_t)(NUM_ENT(h) - P_INDX) &&
534 inp[indx] == inp[indx + P_INDX])
535 indx += P_INDX;
538 inp[indx] == inp[indx - P_INDX])
539 indx -= P_INDX;
581 for (i = 0; i < indx; i += P_INDX)
|
| H A D | bt_put.c | 283 __bam_adjindx(dbc, h, indx + P_INDX, indx, 1)) != 0)
286 __bam_ca_di(dbc, PGNO(h), indx + P_INDX, 1)) != 0)
719 while (indx > 0 && inp[indx] == inp[indx - P_INDX])
720 indx -= P_INDX;
740 ++cnt, indx += P_INDX) {
792 while (indx > 0 && inp[indx] == inp[indx - P_INDX])
793 indx -= P_INDX;
857 indx += P_INDX;
867 PGNO(h), first + P_INDX, (int)(first + P_INDX
[all...] |
| H A D | bt_stat.c | 345 for (indx = 0; indx < top; indx += P_INDX) {
352 if (indx + P_INDX >= top ||
353 inp[indx] != inp[indx + P_INDX])
609 for (indx = 0; indx < NUM_ENT(h); indx += P_INDX) {
612 (indx + P_INDX >= NUM_ENT(h) ||
613 inp[indx] != inp[indx + P_INDX])) {
|
| H A D | bt_upgrade.c | 138 for (indx = O_INDX; indx < NUM_ENT(h); indx += P_INDX) {
|
| H A D | bt_delete.c | 112 * data item, otherwise the "indx + P_INDX" calculation
115 if (indx + P_INDX < (u_int32_t)NUM_ENT(h) &&
116 inp[indx] == inp[indx + P_INDX])
124 if (indx > 0 && inp[indx] == inp[indx - P_INDX])
126 h, indx, indx - P_INDX, 0));
|
| H A D | bt_rsearch.c | 162 adjust = P_INDX;
408 for (indx = 0; indx < top; indx += P_INDX)
|
| H A D | bt_verify.c | 593 * that is, if (i % P_INDX) == 0.
595 if ((i % P_INDX == 0) && (TYPE(h) == P_LBTREE)) {
928 adj = (TYPE(h) == P_LBTREE) ? P_INDX : O_INDX;
1938 last = NUM_ENT(h) - P_INDX;
2102 if (pgtype == P_LBTREE && i % P_INDX == 1 &&
2140 if (pgtype == P_LBTREE && i % P_INDX == 1 &&
2188 if (!IS_VALID_PGNO(bo->pgno) || (i % P_INDX == 0)) {
2236 adj = pgtype == P_IBTREE ? O_INDX : P_INDX;
2279 if (i % P_INDX == 0) {
|
| H A D | bt_split.c | 844 (TYPE(lchild) == P_LDUP ? O_INDX : P_INDX));
976 adjust = TYPE(pp) == P_LBTREE ? P_INDX : O_INDX;
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
1194 if (off != 0 && (nxt % P_INDX) == 0 &&
1195 pinp[nxt] == pinp[nxt - P_INDX]) {
1196 cinp[off] = cinp[off - P_INDX];
|
| H A D | bt_compact.c | 1063 adj = TYPE(npg) == P_LBTREE ? P_INDX : O_INDX;
1243 pg, pind, pind - P_INDX, 1)) != 0)
1291 adjust /= P_INDX;
1379 i /= P_INDX;
|
| H A D | bt_rec.c | 1174 P_INP(file_dbp, pagep)[indx - P_INDX]) {
1354 P_INP(file_dbp, pagep)[indx - P_INDX]) {
|
| /macosx-10.10/BerkeleyDB-21/db/db/ |
| H A D | db_reclaim.c | 132 for (indx = 0; indx < top; indx += P_INDX) {
181 for (indx = 0; indx < top; indx += P_INDX) {
|
| H A D | db_vrfy.c | 2453 for (i = 0; i < NUM_ENT(master); i += P_INDX) {
|
| /macosx-10.10/BerkeleyDB-21/db/dbinc/ |
| H A D | btree.h | 248 ((u_int16_t)(((pgsize) - P_OVERHEAD(dbp)) / ((minkey) * P_INDX) -\
|
| H A D | db_page.h | 604 #define P_INDX 2 macro
|
| /macosx-10.10/BerkeleyDB-21/db/hash/ |
| H A D | hash_stat.c | 257 for (indx = 0; indx < top; indx += P_INDX) {
|
Completed in 150 milliseconds