Searched refs:BINTERNAL (Results 1 - 17 of 17) sorted by relevance
| /macosx-10.10/BerkeleyDB-21/db/db/ |
| H A D | db_upg_opd.c | 191 * Build a BINTERNAL entry for a parent page.
201 BINTERNAL bi, *child_bi;
223 memcpy(p, &bi, SSZA(BINTERNAL, data));
224 p += SSZA(BINTERNAL, data);
250 memcpy(p, &bi, SSZA(BINTERNAL, data));
251 p += SSZA(BINTERNAL, data);
268 memcpy(p, &bi, SSZA(BINTERNAL, data));
269 p += SSZA(BINTERNAL, data);
|
| H A D | db_conv.c | 443 BINTERNAL *bi;
|
| H A D | db_pr.c | 471 BINTERNAL *bi;
698 __db_msg(env, "ILLEGAL BINTERNAL TYPE: %lu",
|
| /macosx-10.10/BerkeleyDB-21/db/btree/ |
| H A D | bt_split.c | 521 BINTERNAL bi, bi0, *child_bi;
545 DB_SET_DBT(hdr, &bi, SSZA(BINTERNAL, data));
562 DB_SET_DBT(hdr, &bi, SSZA(BINTERNAL, data));
579 DB_SET_DBT(hdr, &bi, SSZA(BINTERNAL, data));
606 DB_SET_DBT(hdr, &bi, SSZA(BINTERNAL, data));
640 DB_SET_DBT(hdr0, &bi0, SSZA(BINTERNAL, data));
705 BINTERNAL bi, *child_bi;
749 * Prefix trees: space hack used when inserting into BINTERNAL pages.
776 DB_SET_DBT(hdr, &bi, SSZA(BINTERNAL, data));
793 DB_SET_DBT(hdr, &bi, SSZA(BINTERNAL, dat
[all...] |
| H A D | bt_compare.c | 69 BINTERNAL *bi;
|
| H A D | bt_verify.c | 22 BINTERNAL *, BINTERNAL *, int (*)(DB *, const DBT *, const DBT *),
624 /* It's a BINTERNAL. */
639 * as the _data_ of a BINTERNAL; overflow entries
685 * This is a normal, non-overflow BKEYDATA or BINTERNAL.
707 (BOVERFLOW *)(((BINTERNAL *)bk)->data) :
858 BINTERNAL *bi;
1275 BINTERNAL *li, *ri;
1357 * must verify that for each pair of BINTERNAL entries
1727 * is equal to the value in the BINTERNAL structur
[all...] |
| H A D | bt_delete.c | 64 BINTERNAL *bi;
218 BINTERNAL *bi;
431 BINTERNAL_SIZE(((BINTERNAL *)b.data)->len);
|
| H A D | bt_rsearch.c | 62 BINTERNAL *bi;
|
| H A D | bt_compact.c | 1016 BINTERNAL *bi;
1447 BINTERNAL bi, *bip, *fip;
1616 hdr.size = SSZA(BINTERNAL, data);
2080 BINTERNAL *bi;
2167 BINTERNAL *bi;
2240 BINTERNAL *bi;
|
| H A D | bt_stat.c | 563 BINTERNAL *bi;
|
| H A D | bt_rec.c | 1454 BINTERNAL *bi;
|
| /macosx-10.10/Libc-1044.1.2/db/btree/FreeBSD/ |
| H A D | btree.h | 57 * There are five page layouts in the btree: btree internal pages (BINTERNAL),
124 } BINTERNAL; typedef in typeref:struct:_binternal
126 /* Get the page's BINTERNAL structure at index indx. */
128 ((BINTERNAL *)((char *)(pg) + (pg)->linp[indx]))
134 /* Copy a BINTERNAL entry to the page. */
|
| H A D | bt_split.c | 80 BINTERNAL *bi;
161 * Prefix trees: space hack when inserting into BINTERNAL
230 ((BINTERNAL *)dest)->pgno = rchild->pgno;
515 BINTERNAL *bi;
556 ((BINTERNAL *)dest)->pgno = r->pgno;
590 BINTERNAL *bi;
|
| H A D | bt_utils.c | 146 BINTERNAL *bi;
|
| H A D | bt_delete.c | 141 BINTERNAL *bi;
370 BINTERNAL *bi;
|
| H A D | bt_debug.c | 153 BINTERNAL *bi;
168 X(P_BINTERNAL, "BINTERNAL") /* types */
|
| /macosx-10.10/BerkeleyDB-21/db/dbinc/ |
| H A D | db_page.h | 325 * the BINTERNAL fields on each access.) Overload the PREV_PGNO field.
620 } BINTERNAL; typedef in typeref:struct:_binternal
622 /* Get a BINTERNAL item for a specific index. */
624 ((BINTERNAL *)P_ENTRY(dbp, pg, indx))
627 * Page space required to add a new BINTERNAL item to the page, with and
631 (u_int16_t)DB_ALIGN((len) + SSZA(BINTERNAL, data), sizeof(u_int32_t))
|
Completed in 152 milliseconds