/netbsd-current/external/gpl2/mkhybrid/dist/libhfs_iso/ |
H A 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 *);
|
H A D | node.h | 20 void n_init(node *, btree *, int, int); 28 void n_index(btree *, unsigned char *, unsigned long, unsigned char *, int *);
|
H A 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 \
|
H A D | node.c | 26 # include "btree.h" 36 void n_init(node *np, btree *bt, int type, int height) 60 btree *bt = np->bt; 95 btree *bt = np->bt; 149 btree *bt = np->bt; 176 void n_index(btree *bt, unsigned char *key, unsigned long nnum,
|
H A D | btree.c | 28 # include "btree.h" 32 * NAME: btree->getnode() 37 btree *bt = np->bt; 85 * NAME: btree->putnode() 90 btree *bt = np->bt; 137 * NAME: btree->readhdr() 140 int bt_readhdr(btree *bt) 187 /* read map record; construct btree bitmap */ 249 * NAME: btree->writehdr() 252 int bt_writehdr(btree *b [all...] |
H A D | internal.h | 268 struct _btree_ *bt; /* btree to which this node belongs */ 317 } btree; typedef in typeref:struct:_btree_ 336 btree ext; /* B*-tree control block for extents overflow file */ 337 btree cat; /* B*-tree control block for catalog file */
|
H A D | hfs.c | 36 # include "btree.h" 459 btree *ext = &vol.ext; 460 btree *cat = &vol.cat;
|
/netbsd-current/external/gpl2/lvm2/dist/include/ |
H A D | btree.h | 21 struct btree; 23 struct btree *btree_create(struct dm_pool *mem); 25 void *btree_lookup(const struct btree *t, uint32_t k); 26 int btree_insert(struct btree *t, uint32_t k, void *data); 31 struct btree_iter *btree_first(const struct btree *t);
|
/netbsd-current/external/gpl2/lvm2/dist/lib/datastruct/ |
H A D | btree.h | 21 struct btree; 23 struct btree *btree_create(struct dm_pool *mem); 25 void *btree_lookup(const struct btree *t, uint32_t k); 26 int btree_insert(struct btree *t, uint32_t k, void *data); 31 struct btree_iter *btree_first(const struct btree *t);
|
H A D | btree.c | 19 #include "btree.h" 28 struct btree { struct 33 struct btree *btree_create(struct dm_pool *mem) 35 struct btree *t = dm_pool_alloc(mem, sizeof(*t)); 79 void *btree_lookup(const struct btree *t, uint32_t k) 86 int btree_insert(struct btree *t, uint32_t k, void *data) 118 struct btree_iter *btree_first(const struct btree *t)
|
/netbsd-current/share/examples/refuse/id3fs/ |
H A D | id3db.sh | 35 db -w -C -E B btree $id3db 54 s = sprintf("db -w -E B btree %s %ca%s/%s%c %c%s%c %cy%s/%s%c %c%s%c %cg%s/%s%c %c%s%c",
|
/netbsd-current/lib/libc/db/btree/ |
H A D | Makefile.inc | 4 .PATH: ${.CURDIR}/db/btree
|
/netbsd-current/tests/lib/libc/db/ |
H A D | Makefile | 16 CPPFLAGS.h_db.c += -I${NETBSDSRCDIR}/lib/libc/db/btree
|
H A D | t_db.sh | 55 "Checks btree database using small keys and small data" \ 74 atf_check -o file:exp "$(prog_db)" btree in 131 "Checks btree database using small keys and medium" \ 152 atf_check -o file:exp "$(prog_db)" btree in 212 "Checks btree database using small keys and big data" \ 234 atf_check "$(prog_db)" -o out btree in 485 # For btree, the records are ordered by the string representation 489 if [ "$type" = "btree" ] ; then 524 atf_set "descr" "Checks removing records in btree database" 528 h_delete btree [all...] |
/netbsd-current/lib/libc/db/ |
H A D | db2netbsd | 13 CLEANFILES="PORT docs hash/search.h test/btree.tests test/hash.tests" 27 mv Makefile.inc README btree changelog db hash man mpool recno lib/libc/db
|
/netbsd-current/lib/libc/db/man/ |
H A D | Makefile.inc | 6 MAN+= btree.3 dbm_clearerr.3 dbopen.3 hash.3 recno.3 mpool.3
|
/netbsd-current/distrib/sets/ |
H A D | syspkgdeps | 92 ${DB} -q -w -f - btree "${PATH_TO_PKGNAME}" < "${PATH_MEMBERSHIP}" 109 ${DB} -q -f - btree "${PATH_TO_PKGNAME}" < "${PARENT_PATHNAMES}" | \
|
/netbsd-current/external/gpl2/mkhybrid/bin/ |
H A D | Makefile | 22 SRCS+= block.c btree.c data.c file.c hfs.c low.c lvolume.c node.c record.c
|
/netbsd-current/external/gpl2/lvm2/dist/lib/ |
H A D | Makefile | 41 datastruct/btree.c \
|
H A D | Makefile.in | 41 datastruct/btree.c \
|
/netbsd-current/external/gpl2/lvm2/lib/liblvm/ |
H A D | Makefile | 29 SRCS+= activate.c lvmcache.c toolcontext.c config.c btree.c \
|
/netbsd-current/external/gpl2/dtc/dist/tests/ |
H A D | run_tests.sh | 612 btree="ov${bver}_$atree" 613 run_dtc_test -I dtb -O dtb -V$bver -o $btree $atree 614 run_test dtbs_equal_ordered $btree $tree
|
/netbsd-current/external/gpl2/lvm2/dist/lib/device/ |
H A D | dev-cache.c | 21 #include "btree.h" 47 struct btree *devices;
|
/netbsd-current/external/ibm-public/postfix/dist/conf/ |
H A D | postfix-tls-script | 765 btree) _prio=1;;
|
/netbsd-current/external/public-domain/sqlite/dist/ |
H A D | sqlite3.c | 15391 ** Defer sourcing vdbe.h and btree.h until after the "u8" and 15780 ** NOTE: These values must match the corresponding BTREE_ values in btree.h. 15972 /************** Include btree.h in the middle of sqliteInt.h *****************/ 15973 /************** Begin file btree.h *******************************************/ 16245 ** entry in either an index or table btree. 16305 Btree *p, /* The btree to be checked */ 16395 /************** End of btree.h ***********************************************/ 17771 #define SQLITE_CellSizeCk 0x00200000 /* Check btree cell sizes on load */ 18590 ** or greater than a key in the btree, respectively. These are normally 155680 } btree; member in union:WhereLoop::__anon58 [all...] |