Searched refs:btree (Results 101 - 108 of 108) sorted by relevance
12345
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/logfs/ |
H A D | logfs.h | 16 #include <linux/btree.h> 330 mempool_t *s_btree_pool; /* for btree nodes */
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/xfs/linux-2.6/ |
H A D | xfs_trace.h | 134 struct xfs_da_node_entry *btree), 135 TP_ARGS(ctx, btree), 162 __entry->bt_hashval = be32_to_cpu(btree->hashval); 163 __entry->bt_before = be32_to_cpu(btree->before); 1577 { 3, "btree" }
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/test/ |
H A D | testutils.tcl | 2321 -btree - 2332 btree - 2336 rbtree { return "-btree" } 2428 # If recno-with-renumbering or btree-with-renumbering is specified, then 2484 set names { -btree BTREE DB_BTREE bt btree } 3652 # arbitrarily pick btree. 3655 set test_methods [$test btree]
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/build_vxworks/db_load/ |
H A D | db_load.c | 187 if (strcmp(optarg, "btree") == 0) { 398 Set application-specific btree comparison or hash functions here. 910 if (strcmp(value, "btree") == 0) { 1296 "[-h home] [-P password] [-t btree | hash | recno | queue] db_file");
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/db_load/ |
H A D | db_load.c | 172 if (strcmp(optarg, "btree") == 0) { 383 Set application-specific btree comparison or hash functions here. 895 if (strcmp(value, "btree") == 0) { 1281 "[-h home] [-P password] [-t btree | hash | recno | queue] db_file");
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/xfs/ |
H A D | xfs_attr_leaf.c | 152 * in the extents form migrating to btree. If so, the 154 * the btree root. 163 * If have data btree then keep forkoff if we have one, 165 * minforkoff to where the btree root can finish so we have 179 * A data fork btree root must have space for at least 185 /* attr fork btree root can have at least this many key/ptr pairs */ 877 node->btree[0].hashval = 879 node->btree[0].before = cpu_to_be32(blkno); 2749 child_fsb = be32_to_cpu(node->btree[0].before); 2809 child_fsb = be32_to_cpu(node->btree[ [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/ |
H A D | btree.c | 2 * lib/btree.c - Simple In-memory B+Tree 11 * see http://programming.kicks-ass.net/kernel-patches/vma_lookup/btree.patch 42 #include <linux/btree.h> 384 * locate the correct leaf node in the btree 790 /* If core code starts using btree, initialization should happen even earlier */
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/perl/DB_File/ |
H A D | DB_File.pm | 652 The btree format allows arbitrary key/value pairs to be stored in a 946 # the btree will have kept them in order automatically. 1091 # iterate through the btree using seq 2291 L<perl>, L<dbopen(3)>, L<hash(3)>, L<recno(3)>, L<btree(3)>,
|
Completed in 118 milliseconds
12345