| /openbsd/src/usr.sbin/ldapd/ |
| D | btree.h | 76 struct btree *btree_open_fd(int fd, unsigned int flags);
77 struct btree *btree_open(const char *path, unsigned int flags,
79 void btree_close(struct btree *bt);
80 const struct btree_stat *btree_stat(struct btree *bt);
82 struct btree_txn *btree_txn_begin(struct btree *bt, int rdonly);
86 int btree_txn_get(struct btree *bt, struct btree_txn *txn,
88 int btree_txn_put(struct btree *bt, struct btree_txn *txn,
91 int btree_txn_del(struct btree *bt, struct btree_txn *txn,
101 void btree_set_cache_size(struct btree *bt,
103 unsigned int btree_get_flags(struct btree *bt);
[all …]
|
| D | btree.c | 142 static struct mpage *mpage_lookup(struct btree *bt, pgno_t pgno);
143 static void mpage_add(struct btree *bt, struct mpage *mp);
145 static void mpage_del(struct btree *bt, struct mpage *mp);
146 static void mpage_flush(struct btree *bt);
147 static struct mpage *mpage_copy(struct btree *bt, struct mpage *mp);
148 static void mpage_prune(struct btree *bt);
149 static void mpage_dirty(struct btree *bt, struct mpage *mp);
150 static struct mpage *mpage_touch(struct btree *bt, struct mpage *mp);
168 struct btree *bt;
194 struct btree *bt; /* btree is ref'd */
[all …]
|
| D | Makefile | 7 btree.c filter.c search.c parse.y \
|
| D | btest.c | 34 struct btree *bt; in main()
|
| D | ldapd.h | 123 struct btree *data_db;
124 struct btree *indx_db;
|
| D | namespace.c | 42 struct btree **bt, int fd, unsigned int flags);
184 namespace_set_fd(struct namespace *ns, struct btree **bt, int fd, in namespace_set_fd()
|
| /openbsd/src/gnu/usr.sbin/mkhybrid/src/libhfs_iso/ |
| D | btree.h | 23 int bt_readhdr(btree *);
24 int bt_writehdr(btree *);
26 int bt_space(btree *, unsigned int);
29 int bt_insert(btree *, unsigned char *, int);
32 int bt_delete(btree *, unsigned char *);
34 int bt_search(btree *, unsigned char *, node *);
|
| D | Makefile | 36 OBJS = data.o block.o low.o file.o btree.o node.o record.o volume.o \
65 btree.o: btree.c internal.h hfs.h data.h block.h file.h btree.h node.h
66 data.o: data.c internal.h hfs.h data.h btree.h
67 file.o: file.c internal.h hfs.h data.h block.h file.h btree.h record.h \
69 hfs.o: hfs.c internal.h hfs.h data.h block.h low.h file.h btree.h \
72 node.o: node.c internal.h hfs.h data.h btree.h node.h
74 volume.o: volume.c internal.h hfs.h data.h low.h btree.h record.h \
|
| D | node.h | 20 void n_init(node *, btree *, int, int);
28 void n_index(btree *, unsigned char *, unsigned long, unsigned char *, int *);
|
| D | btree.c | 37 btree *bt = np->bt; in bt_getnode()
90 btree *bt = np->bt; in bt_putnode()
140 int bt_readhdr(btree *bt) in bt_readhdr()
252 int bt_writehdr(btree *bt) in bt_writehdr()
337 int bt_space(btree *bt, unsigned int nrecs) in bt_space()
485 int bt_insert(btree *bt, unsigned char *record, int reclen) in bt_insert()
620 int bt_delete(btree *bt, unsigned char *key) in bt_delete()
674 int bt_search(btree *bt, unsigned char *key, node *np) in bt_search()
|
| D | node.c | 36 void n_init(node *np, btree *bt, int type, int height) in n_init()
60 btree *bt = np->bt; in n_new()
95 btree *bt = np->bt; in n_free()
149 btree *bt = np->bt; in n_search()
176 void n_index(btree *bt, unsigned char *key, unsigned long nnum, in n_index()
|
| D | internal.h | 317 } btree; typedef
336 btree ext; /* B*-tree control block for extents overflow file */
337 btree cat; /* B*-tree control block for catalog file */
|
| D | hfs.c | 459 btree *ext = &vol.ext; in hfs_format()
460 btree *cat = &vol.cat; in hfs_format()
|
| /openbsd/src/lib/libc/db/ |
| D | changelog | 12 btree: Rework cursor deletion code yet again; bugs with
17 btree: Fix bugs introduced by new cursor/deletion code.
21 btree: Fix bugs introduced by new cursor/deletion code.
25 btree Change deletion to coalesce empty pages. This is a major
56 btree: If enough duplicate records were inserted and then deleted
65 btree/recno:
72 btree/recno:
86 Allow recno to specify the name of the underlying btree;
88 btree/recno:
90 btree/hash/recno:
[all …]
|
| D | Makefile.inc | 3 .PATH: ${LIBCSRCDIR}/db/btree
20 MAN+= btree.3 dbopen.3 hash.3 ndbm.3 recno.3
|
| /openbsd/src/regress/lib/libc/db/ |
| D | run.test | 37 btree)
67 for type in btree hash; do
106 for type in hash btree; do
161 for type in btree; do
364 for type in btree recno; do
410 $PROG btree $TMP1
427 for type in btree; do
461 for type in btree recno; do
478 for type in btree recno; do
540 for type in btree; do
[all …]
|
| D | README | 61 structure. If the type is btree, then "-i cachesize=10240"
69 or "btree", and the script name or "-" to indicate stdin.
|
| /openbsd/src/gnu/usr.bin/perl/cpan/DB_File/ |
| D | DB_File.xs | 328 BTREEINFO btree ; member
353 #define db_BT_compare btree.compare
354 #define db_BT_prefix btree.prefix
355 #define db_BT_flags btree.flags
356 #define db_BT_psize btree.psize
357 #define db_BT_cachesize btree.cachesize
358 #define db_BT_lorder btree.lorder
359 #define db_BT_maxkeypage btree.maxkeypage
360 #define db_BT_minkeypage btree.minkeypage
918 PrintBtree(INFO *btree) in PrintBtree() argument
[all …]
|
| /openbsd/src/usr.sbin/ldapctl/ |
| D | Makefile | 7 SRCS= ldapctl.c parse.y btree.c log.c logmsg.c util.c \
|
| D | ldapctl.c | 82 struct btree *bt; in compact_db()
144 struct btree *data_db, *indx_db; in index_namespace()
|
| /openbsd/src/gnu/usr.sbin/mkhybrid/mkhybrid/ |
| D | Makefile | 13 SRCS= data.c block.c low.c lfile.c btree.c node.c record.c lvolume.c \
|
| /openbsd/src/gnu/usr.bin/perl/ |
| D | README.tru64 | 95 The DB_File tests (db-btree.t, db-hash.t, db-recno.t) may fail you
|
| D | README.cygwin | 253 lib/db-btree.t 20
682 ext/DB_File/t/db-btree.t
|
| /openbsd/src/gnu/usr.bin/perl/cpan/Pod-Simple/t/ |
| D | perlcygo.txt | 118 lib/db-btree.t 20
|
| D | perlcyg.pod | 330 lib/db-btree.t 20
|