Home
last modified time | relevance | path

Searched refs:btree (Results 1 – 25 of 30) sorted by relevance

12

/freebsd-13-stable/lib/libc/db/
HDchangelog10 btree: Rework cursor deletion code yet again; bugs with
15 btree: Fix bugs introduced by new cursor/deletion code.
19 btree: Fix bugs introduced by new cursor/deletion code.
23 btree Change deletion to coalesce empty pages. This is a major
54 btree: If enough duplicate records were inserted and then deleted
63 btree/recno:
70 btree/recno:
84 Allow recno to specify the name of the underlying btree;
86 btree/recno:
88 btree/hash/recno:
[all …]
HDREADME24 btree The B+tree routines.
/freebsd-13-stable/lib/libc/db/test/
HDrun.test35 btree)
65 for type in btree hash; do
104 for type in hash btree; do
159 for type in btree; do
362 for type in btree recno; do
408 $PROG btree $TMP1
425 for type in btree; do
459 for type in btree recno; do
476 for type in btree recno; do
538 for type in btree; do
[all …]
HDREADME66 structure. If the type is btree, then "-i cachesize=10240"
74 or "btree", and the script name or "-" to indicate stdin.
/freebsd-13-stable/contrib/netbsd-tests/lib/libc/db/
HDt_db.sh77 atf_check -o file:exp "$(prog_db)" btree in
164 atf_check -o file:exp "$(prog_db)" btree in
249 atf_check "$(prog_db)" -o out btree in
543 h_delete btree
589 h_repeated btree
686 h_cursor_flags btree
763 atf_check -o file:exp "$(prog_db)" -i psize=512 btree in
805 h_byte_orders btree
1013 "$(prog_db)" -i psize=$psize btree in
1124 "$(prog_db)" -i psize=4096 btree in
[all …]
HDREADME58 structure. If the type is btree, then "-i cachesize=10240"
66 or "btree", and the script name or "-" to indicate stdin.
/freebsd-13-stable/sys/contrib/openzfs/tests/zfs-tests/tests/functional/btree/
HDMakefile.am16 pkgdatadir = $(datadir)/@PACKAGE@/zfs-tests/tests/functional/btree
/freebsd-13-stable/lib/libc/tests/db/
HDMakefile15 CFLAGS+= -I${SRCTOP}/lib/libc/db/btree
/freebsd-13-stable/lib/libc/db/btree/
HDMakefile.inc3 .PATH: ${LIBC_SRCTOP}/db/btree
/freebsd-13-stable/lib/libc/db/man/
HDMakefile.inc5 MAN+= btree.3 dbm.3 dbopen.3 hash.3 mpool.3 recno.3
/freebsd-13-stable/sys/contrib/openzfs/tests/zfs-tests/tests/functional/
HDMakefile.am7 btree \ subdir
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/notes/
HDstructure414 The database contains a table called "nodes", which is a btree indexed
511 The `transactions' table is a btree, with no particular sort order.
522 The `changes' table is a btree with Berkeley's "duplicate keys"
605 The `copies' table is a btree, with no particular sort order.
614 The `locks' table is a btree whose key is a UUID string known as
643 created in a `lock-tokens' table. The `lock-tokens' table is a btree
873 "nodes" : btree(ID -> NODE-REVISION, "next-key" -> NODE-ID)
875 "transactions" : btree(TXN -> TRANSACTION, "next-key" -> TXN)
876 "changes" : btree(TXN -> CHANGE)
877 "copies" : btree(CPY -> COPY, "next-key" -> CPY)
[all …]
/freebsd-13-stable/sys/contrib/openzfs/include/sys/
HDbtree.h108 typedef struct btree { struct
HDMakefile.am16 btree.h \
/freebsd-13-stable/etc/mail/
HDMakefile150 ${MAKEMAP} btree ${.TARGET} < ${.OODATE}
/freebsd-13-stable/sys/contrib/openzfs/lib/libzpool/
HDMakefile.am61 btree.c \
/freebsd-13-stable/cddl/lib/libzpool/
HDMakefile61 btree.c \
/freebsd-13-stable/sys/contrib/openzfs/module/zfs/
HDMakefile.in23 $(MODULE)-objs += btree.o
HDbtree.c1184 zfs_btree_last_helper(zfs_btree_t *btree, zfs_btree_hdr_t *hdr, in zfs_btree_last_helper() argument
1200 btree->bt_elem_size); in zfs_btree_last_helper()
/freebsd-13-stable/share/doc/smm/01.setup/
HDspell.ok223 btree
/freebsd-13-stable/sys/contrib/openzfs/module/
HDMakefile.bsd189 btree.c \
/freebsd-13-stable/sys/modules/zfs/
HDMakefile80 btree.c \
/freebsd-13-stable/sys/contrib/openzfs/tests/runfiles/
HDcommon.run58 [tests/functional/btree]
60 tags = ['functional', 'btree']
/freebsd-13-stable/sys/contrib/openzfs/
HDconfigure.ac249 tests/zfs-tests/tests/functional/btree/Makefile
/freebsd-13-stable/contrib/sqlite3/
HDsqlite3.c156936 } btree;
157499 Index *pIndex = pLoop->u.btree.pIndex;
157500 u16 nEq = pLoop->u.btree.nEq;
157514 explainAppendTerm(pStr, pIndex, pLoop->u.btree.nBtm, j, i, ">");
157518 explainAppendTerm(pStr, pIndex, pLoop->u.btree.nTop, j, i, "<");
157558 || ((flags&WHERE_VIRTUALTABLE)==0 && (pLoop->u.btree.nEq>0))
157568 assert( pLoop->u.btree.pIndex!=0 );
157569 pIdx = pLoop->u.btree.pIndex;
157674 for(i=pLoop->nSkip; i<pLoop->u.btree.nEq; i++){
157675 const char *z = explainIndexColumnName(pLoop->u.btree.pIndex, i);
[all …]

12