|
| #define | B_DB_LOCK 0x04000 /* DB_LOCK specified. */ |
| |
| #define | B_DB_SHMEM 0x08000 /* DB_SHMEM specified. */ |
| |
| #define | B_DB_TXN 0x10000 /* DB_TXN specified. */ |
| |
| #define | B_INMEM 0x00001 /* in-memory tree */ |
| |
| #define | B_METADIRTY 0x00002 /* need to write metadata */ |
| |
| #define | B_MODIFIED 0x00004 /* tree modified */ |
| |
| #define | B_NEEDSWAP 0x00008 /* if byte order requires swapping */ |
| |
| #define | B_NODUPS 0x00020 /* no duplicate keys permitted */ |
| |
| #define | B_RDONLY 0x00010 /* read-only tree */ |
| |
| #define | BT_CLR(t) (t->bt_sp = t->bt_stack) |
| |
| #define | BT_POP(t) (t->bt_sp == t->bt_stack ? NULL : --t->bt_sp) |
| |
| #define | BT_PUSH(t, p, i) |
| |
| #define | BTDATAOFF |
| |
| #define | CURS_ACQUIRE 0x01 /* B: Cursor needs to be reacquired. */ |
| |
| #define | CURS_AFTER 0x02 /* B: Unreturned cursor after key. */ |
| |
| #define | CURS_BEFORE 0x04 /* B: Unreturned cursor before key. */ |
| |
| #define | CURS_INIT 0x08 /* RB: Cursor initialized. */ |
| |
| #define | DEFMINKEYPAGE (2) /* Minimum keys per page */ |
| |
| #define | F_CLR(p, f) (p)->flags &= ~(f) |
| |
| #define | F_ISSET(p, f) ((p)->flags & (f)) |
| |
| #define | F_SET(p, f) (p)->flags |= (f) |
| |
| #define | GETBINTERNAL(pg, indx) ((BINTERNAL *)((char *)(pg) + (pg)->linp[indx])) |
| |
| #define | GETBLEAF(pg, indx) ((BLEAF *)((char *)(pg) + (pg)->linp[indx])) |
| |
| #define | GETRINTERNAL(pg, indx) ((RINTERNAL *)((char *)(pg) + (pg)->linp[indx])) |
| |
| #define | GETRLEAF(pg, indx) ((RLEAF *)((char *)(pg) + (pg)->linp[indx])) |
| |
| #define | LALIGN(n) (((n) + sizeof(pgno_t) - 1) & ~(sizeof(pgno_t) - 1)) |
| |
| #define | MINCACHE (5) /* Minimum cached pages */ |
| |
| #define | MINPSIZE (512) /* Minimum page size */ |
| |
| #define | mpool_close __mpool_close |
| |
| #define | mpool_filter __mpool_filter |
| |
| #define | mpool_get __mpool_get |
| |
| #define | mpool_new __mpool_new |
| |
| #define | mpool_open __mpool_open |
| |
| #define | mpool_put __mpool_put |
| |
| #define | mpool_sync __mpool_sync |
| |
| #define | NBINTERNAL(len) LALIGN(sizeof(u_int32_t) + sizeof(pgno_t) + sizeof(u_char) + (len)) |
| |
| #define | NBLEAF(p) NBLEAFDBT((p)->ksize, (p)->dsize) |
| |
| #define | NBLEAFDBT(ksize, dsize) |
| |
| #define | NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t)) |
| |
| #define | NOVFLSIZE (sizeof(pgno_t) + sizeof(u_int32_t)) |
| |
| #define | NRINTERNAL LALIGN(sizeof(recno_t) + sizeof(pgno_t)) |
| |
| #define | NRLEAF(p) NRLEAFDBT((p)->dsize) |
| |
| #define | NRLEAFDBT(dsize) LALIGN(sizeof(u_int32_t) + sizeof(u_char) + (dsize)) |
| |
| #define | P_BIGDATA 0x01 /* overflow data */ |
| |
| #define | P_BIGKEY 0x02 /* overflow key */ |
| |
| #define | P_BINTERNAL 0x01 /* btree internal page */ |
| |
| #define | P_BLEAF 0x02 /* leaf page */ |
| |
| #define | P_INVALID 0 /* Invalid tree page number. */ |
| |
| #define | P_META 0 /* Tree metadata page number. */ |
| |
| #define | P_OVERFLOW 0x04 /* overflow page */ |
| |
| #define | P_PRESERVE 0x20 /* never delete this chain of pages */ |
| |
| #define | P_RINTERNAL 0x08 /* recno internal page */ |
| |
| #define | P_RLEAF 0x10 /* leaf page */ |
| |
| #define | P_ROOT 1 /* Tree root page number. */ |
| |
| #define | P_TYPE 0x1f /* type mask */ |
| |
| #define | R_CLOSEFP 0x00040 /* opened a file pointer */ |
| |
| #define | R_EOF 0x00100 /* end of input file reached. */ |
| |
| #define | R_FIXLEN 0x00200 /* fixed length records */ |
| |
| #define | R_INMEM 0x00800 /* in-memory file */ |
| |
| #define | R_MEMMAPPED 0x00400 /* memory mapped file. */ |
| |
| #define | R_MODIFIED 0x01000 /* modified file */ |
| |
| #define | R_RDONLY 0x02000 /* read-only file */ |
| |
| #define | R_RECNO 0x00080 /* record oriented tree */ |
| |
| #define | SAVEMETA (B_NODUPS | R_RECNO) |
| |
| #define | WR_BINTERNAL(p, size, pgno, flags) |
| |
| #define | WR_BLEAF(p, key, data, flags) |
| |
| #define | WR_RINTERNAL(p, nrecs, pgno) |
| |
| #define | WR_RLEAF(p, data, flags) |
| |
