Searched refs:P_LBTREE (Results 1 - 23 of 23) sorted by relevance
| /macosx-10.10/BerkeleyDB-21/db/btree/ |
| H A D | bt_put.c | 148 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0),
193 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0));
224 TYPE(h) == P_LBTREE && op != DB_KEYFIRST &&
280 if (TYPE(h) == P_LBTREE) {
298 if (TYPE(h) == P_LBTREE) {
319 if (TYPE(h) == P_LBTREE)
330 if (TYPE(h) == P_LBTREE || TYPE(h) == P_LDUP)
396 cp->indx = TYPE(h) == P_LBTREE ? indx - O_INDX : indx;
450 bk = GET_BKEYDATA(dbp, h, indx + (TYPE(h) == P_LBTREE ? O_INDX : 0));
518 bk = GET_BKEYDATA(dbp, h, indx + (TYPE(h) == P_LBTREE
[all...] |
| H A D | bt_rsearch.c | 154 case P_LBTREE:
161 if (TYPE(h) == P_LBTREE) {
406 case P_LBTREE:
|
| H A D | bt_compare.c | 88 case P_LBTREE:
|
| H A D | bt_search.c | 218 adjust = TYPE(h) == P_LBTREE ? P_INDX : O_INDX;
222 else if (TYPE(h) == P_LBTREE)
531 if (TYPE(h) == P_LBTREE && NUM_ENT(h) > P_INDX) {
550 deloffset = TYPE(h) == P_LBTREE ? O_INDX : 0;
579 DB_ASSERT(env, TYPE(h) == P_LBTREE);
|
| H A D | bt_verify.c | 313 case P_LBTREE:
531 case P_LBTREE:
595 if ((i % P_INDX == 0) && (TYPE(h) == P_LBTREE)) {
928 adj = (TYPE(h) == P_LBTREE) ? P_INDX : O_INDX;
973 case P_LBTREE:
1075 if (TYPE(h) == P_LBTREE) {
1199 case P_LBTREE:
1362 * Furthermore, in any sorted page type (P_LDUP, P_LBTREE, P_IBTREE),
1369 case P_LBTREE:
1937 case P_LBTREE
[all...] |
| H A D | bt_split.c | 571 case P_LBTREE:
805 case P_LBTREE:
976 adjust = TYPE(pp) == P_LBTREE ? P_INDX : O_INDX;
1052 case P_LBTREE:
1091 case P_LBTREE:
1129 if (TYPE(pp) == P_LBTREE &&
1189 case P_LBTREE:
|
| H A D | bt_open.c | 465 LEAFLEVEL, dbp->type == DB_RECNO ? P_LRECNO : P_LBTREE);
506 LEAFLEVEL, dbp->type == DB_RECNO ? P_LRECNO : P_LBTREE);
581 dbp->type == DB_RECNO ? P_LRECNO : P_LBTREE, &root)) != 0)
|
| H A D | bt_compact.c | 1063 adj = TYPE(npg) == P_LBTREE ? P_INDX : O_INDX;
1074 if (TYPE(pg) == P_LBTREE)
1081 if (TYPE(pg) == P_LBTREE &&
1116 if (TYPE(pg) != P_LBTREE && TYPE(pg) != P_LDUP) {
1290 if (TYPE(pg) == P_LBTREE)
1378 if (TYPE(pg) == P_LBTREE)
1951 case P_LBTREE:
2216 DB_ASSERT(dbc->dbp->env, TYPE(pg) == P_LBTREE);
|
| H A D | bt_stat.c | 340 case P_LBTREE:
607 case P_LBTREE:
|
| H A D | bt_cursor.c | 120 (indx) + (TYPE(page) == P_LBTREE ? O_INDX : 0))->type)
738 if (TYPE(cp->page) == P_LBTREE)
2030 if (ret == 0 && TYPE(cp->page) == P_LBTREE &&
2402 if (TYPE(h) != P_LBTREE || NUM_ENT(h) == 0)
2548 NUM_ENT(cp->page) == (TYPE(cp->page) == P_LBTREE ? 2 : 1);
2602 if (TYPE(cp->page) == P_LBTREE) {
2707 if (TYPE(dbc->internal->page) != P_LBTREE)
|
| H A D | bt_rec.c | 20 TYPE(pagep) == P_LBTREE || TYPE(pagep) == P_LDUP)
632 indx = argp->indx + (TYPE(pagep) == P_LBTREE ? O_INDX : 0);
639 indx = argp->indx + (TYPE(pagep) == P_LBTREE ? O_INDX : 0);
1179 case P_LBTREE:
1359 case P_LBTREE:
|
| H A D | bt_delete.c | 98 case P_LBTREE:
|
| /macosx-10.10/BerkeleyDB-21/db/db/ |
| H A D | db_reclaim.c | 130 case P_LBTREE:
143 type = dbp->type == DB_RECNO ? P_LRECNO : P_LBTREE;
|
| H A D | db_conv.c | 174 case P_LBTREE:
240 case P_LBTREE:
527 case P_LBTREE:
538 if (h->type == P_LBTREE && i > 1) {
|
| H A D | db_ret.c | 52 case P_LBTREE:
|
| H A D | db_vrfy.c | 719 case P_LBTREE:
1072 case P_LBTREE:
1132 * Verify elements common to data pages (P_HASH, P_LBTREE,
1203 case P_LBTREE:
1236 case P_LBTREE:
1836 case P_LBTREE:
1838 pgno, P_LBTREE, h, handle, callback, NULL, flags));
1864 * we're an upgraded database, a P_LBTREE page may very well
|
| H A D | db_pr.c | 608 case P_LBTREE:
710 case P_LBTREE:
938 case P_LBTREE:
|
| H A D | db_rec.c | 516 case P_LBTREE:
955 type = file_dbp->type == DB_RECNO ? P_LRECNO : P_LBTREE;
1242 case P_LBTREE:
|
| H A D | db_meta.c | 418 case P_LBTREE:
|
| H A D | db_cam.c | 866 indx_off = ((type == P_LBTREE ||
|
| /macosx-10.10/BerkeleyDB-21/db/dbinc/ |
| H A D | db_page.h | 41 #define P_LBTREE 5 /* Btree leaf. */ macro
329 (db_pgno_t)(TYPE(p) == P_LBTREE ? NUM_ENT(p) / 2 : NUM_ENT(p)))
|
| H A D | btree.h | 64 #define ISLEAF(p) (TYPE(p) == P_LBTREE || \
|
| /macosx-10.10/BerkeleyDB-21/db/hash/ |
| H A D | hash_stat.c | 284 case P_LBTREE:
|
Completed in 219 milliseconds