HomeSort by: relevance | last modified time | path
    Searched refs:btree (Results 1 - 25 of 26) sorted by relevancy

1 2

  /src/external/gpl2/mkhybrid/dist/libhfs_iso/
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 *);
node.h 20 void n_init(node *, btree *, int, int);
28 void n_index(btree *, unsigned char *, unsigned long, unsigned char *, int *);
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 \
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,
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 *bt
    [all...]
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 */
hfs.c 36 # include "btree.h"
459 btree *ext = &vol.ext;
460 btree *cat = &vol.cat;
  /src/external/gpl2/lvm2/dist/include/
btree.h 1 /* $NetBSD: btree.h,v 1.1.1.1 2008/12/22 00:18:47 haad Exp $ */
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);
  /src/external/gpl2/lvm2/dist/lib/datastruct/
btree.h 1 /* $NetBSD: btree.h,v 1.1.1.1 2008/12/22 00:17:54 haad Exp $ */
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);
btree.c 1 /* $NetBSD: btree.c,v 1.1.1.1 2008/12/22 00:17:54 haad Exp $ */
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)
  /src/share/examples/refuse/id3fs/
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",
  /src/tests/lib/libc/db/
Makefile 16 CPPFLAGS.h_db.c += -I${NETBSDSRCDIR}/lib/libc/db/btree
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...]
  /src/lib/libc/db/
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
  /src/distrib/sets/
syspkgdeps 92 ${DB} -q -w -f - btree "${PATH_TO_PKGNAME}" < "${PATH_MEMBERSHIP}"
109 ${DB} -q -f - btree "${PATH_TO_PKGNAME}" < "${PARENT_PATHNAMES}" | \
  /src/external/gpl2/mkhybrid/bin/
Makefile 22 SRCS+= block.c btree.c data.c file.c hfs.c low.c lvolume.c node.c record.c
  /src/external/gpl3/gcc/dist/libgcc/
unwind-dw2-btree.h 1 /* Lock-free btree for manually registered unwind frames. */
209 // A btree node.
329 // A btree. Suitable for static initialization, all members are zero at the
331 struct btree struct
333 // The root of the btree.
341 // Initialize a btree. Not actually used, just for exposition.
343 btree_init (struct btree *t)
351 btree_release_tree_recursively (struct btree *t, struct btree_node *n);
355 btree_destroy (struct btree *t)
374 btree_allocate_node (struct btree *t, bool inner
    [all...]
unwind-dw2-fde.c 48 #include "unwind-dw2-btree.h"
50 static struct btree registered_frames;
51 static struct btree registered_objects;
  /src/external/gpl2/lvm2/dist/lib/
Makefile 41 datastruct/btree.c \
Makefile.in 41 datastruct/btree.c \
  /src/external/gpl2/lvm2/lib/liblvm/
Makefile 29 SRCS+= activate.c lvmcache.c toolcontext.c config.c btree.c \
  /src/external/gpl2/dtc/dist/tests/
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
  /src/external/gpl2/lvm2/dist/lib/device/
dev-cache.c 21 #include "btree.h"
47 struct btree *devices;
  /src/external/ibm-public/postfix/dist/conf/
postfix-tls-script 765 btree) _prio=1;;
  /src/external/public-domain/sqlite/dist/
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 *******************************************/
16012 typedef struct Btree Btree;
16022 Btree **ppBtree, /* Return open Btree* here */
16038 SQLITE_PRIVATE int sqlite3BtreeClose(Btree*);
16039 SQLITE_PRIVATE int sqlite3BtreeSetCacheSize(Btree*,int)
155680 } btree; member in union:WhereLoop::__anon24539
    [all...]

Completed in 83 milliseconds

1 2