Home
last modified time | relevance | path

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

/linux-2.4.37.9/fs/hpfs/
Danode.c14 struct bplus_header *btree, unsigned sec, in hpfs_bplus_lookup() argument
23 if (btree->internal) { in hpfs_bplus_lookup()
24 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
25 if (btree->u.internal[i].file_secno > sec) { in hpfs_bplus_lookup()
26 a = btree->u.internal[i].down; in hpfs_bplus_lookup()
29 btree = &anode->btree; in hpfs_bplus_lookup()
36 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
37 if (btree->u.external[i].file_secno <= sec && in hpfs_bplus_lookup()
38 btree->u.external[i].file_secno + btree->u.external[i].length > sec) { in hpfs_bplus_lookup()
39 a = btree->u.external[i].disk_secno + sec - btree->u.external[i].file_secno; in hpfs_bplus_lookup()
[all …]
Dmap.c133 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
134 (fnode->btree.internal ? 12 : 8)) { in hpfs_map_fnode()
138 if (fnode->btree.first_free != in hpfs_map_fnode()
139 8 + fnode->btree.n_used_nodes * (fnode->btree.internal ? 8 : 12)) { in hpfs_map_fnode()
177 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
178 (anode->btree.internal ? 60 : 40)) { in hpfs_map_anode()
182 if (anode->btree.first_free != in hpfs_map_anode()
183 8 + anode->btree.n_used_nodes * (anode->btree.internal ? 8 : 12)) { in hpfs_map_anode()
Dalloc.c431 f->btree.n_free_nodes = 8; in hpfs_alloc_fnode()
432 f->btree.first_free = 8; in hpfs_alloc_fnode()
448 a->btree.n_free_nodes = 40; in hpfs_alloc_anode()
449 a->btree.n_used_nodes = 0; in hpfs_alloc_anode()
450 a->btree.first_free = 8; in hpfs_alloc_anode()
Dhpfs.h404 struct bplus_header btree; /* b+ tree, 8 extents or 12 subtrees */ member
437 struct bplus_header btree; /* b+tree, 40 extents or 60 subtrees */ member
Dfile.c55 disk_secno = hpfs_bplus_lookup(inode->i_sb, inode, &fnode->btree, file_secno, bh); in hpfs_bmap()
Dnamei.c52 fnode->btree.n_free_nodes = 7; in hpfs_mkdir()
53 fnode->btree.n_used_nodes = 1; in hpfs_mkdir()
54 fnode->btree.first_free = 0x14; in hpfs_mkdir()
Dea.c44 hpfs_remove_btree(s, &anode->btree); in hpfs_ea_ext_remove()
/linux-2.4.37.9/fs/xfs/
Dxfs_da_btree.c380 size = (int)((char *)&oldroot->btree[INT_GET(oldroot->hdr.count, ARCH_CONVERT)] - in xfs_da_root_split()
405 INT_SET(node->btree[0].hashval, ARCH_CONVERT, blk1->hashval); in xfs_da_root_split()
406 INT_SET(node->btree[0].before, ARCH_CONVERT, blk1->blkno); in xfs_da_root_split()
407 INT_SET(node->btree[1].hashval, ARCH_CONVERT, blk2->hashval); in xfs_da_root_split()
408 INT_SET(node->btree[1].before, ARCH_CONVERT, blk2->blkno); in xfs_da_root_split()
422 XFS_DA_LOGRANGE(node, node->btree, in xfs_da_root_split()
536 …((INT_GET(node2->btree[ 0 ].hashval, ARCH_CONVERT) < INT_GET(node1->btree[ 0 ].hashval, ARCH_CONVE… in xfs_da_node_rebalance()
537 (INT_GET(node2->btree[ INT_GET(node2->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT) < in xfs_da_node_rebalance()
538 INT_GET(node1->btree[ INT_GET(node1->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT)))) { in xfs_da_node_rebalance()
558 btree_s = &node2->btree[0]; in xfs_da_node_rebalance()
[all …]
Dxfs_dir.c886 xfs_da_node_entry_t *btree; in xfs_dir_node_getdents() local
958 btree = &node->btree[0]; in xfs_dir_node_getdents()
960 for (i = 0; i < INT_GET(node->hdr.count, ARCH_CONVERT); btree++, i++) { in xfs_dir_node_getdents()
961 if (INT_GET(btree->hashval, ARCH_CONVERT) >= cookhash) { in xfs_dir_node_getdents()
962 bno = INT_GET(btree->before, ARCH_CONVERT); in xfs_dir_node_getdents()
1137 INT_GET(node->btree[0].hashval, ARCH_CONVERT), in xfs_dir_trace_g_dun()
1139 INT_GET(node->btree[last].hashval, ARCH_CONVERT), in xfs_dir_trace_g_dun()
Dxfs_attr.c1763 xfs_da_node_entry_t *btree; in xfs_attr_node_list() local
1849 btree = node->btree; in xfs_attr_node_list()
1852 btree++, i++) { in xfs_attr_node_list()
1854 <= INT_GET(btree->hashval, in xfs_attr_node_list()
1856 cursor->blkno = INT_GET(btree->before, ARCH_CONVERT); in xfs_attr_node_list()
1858 context, btree); in xfs_attr_node_list()
2253 (__psunsigned_t)INT_GET(node->btree[0].hashval, ARCH_CONVERT), in xfs_attr_trace_l_cn()
2254 …(__psunsigned_t)INT_GET(node->btree[INT_GET(node->hdr.count, ARCH_CONVERT)-1].hashval, ARCH_CONVER… in xfs_attr_trace_l_cn()
2262 struct xfs_da_node_entry *btree) in xfs_attr_trace_l_cb() argument
2281 (__psunsigned_t)INT_GET(btree->hashval, ARCH_CONVERT), in xfs_attr_trace_l_cb()
[all …]
Dxfs_attr_sf.h131 struct xfs_da_node_entry *btree);
Dxfs_da_btree.h88 } btree[1]; /* variable sized array of keys */ member
Dxfs_dir_leaf.c764 …INT_SET(node->btree[0].hashval, ARCH_CONVERT, INT_GET(leaf->entries[ INT_GET(leaf->hdr.count, ARCH… in xfs_dir_leaf_to_node()
766 INT_SET(node->btree[0].before, ARCH_CONVERT, blkno); in xfs_dir_leaf_to_node()
769 XFS_DA_LOGRANGE(node, &node->btree[0], sizeof(node->btree[0]))); in xfs_dir_leaf_to_node()
Dxfs_attr_leaf.c754 node->btree[0].hashval = in xfs_attr_leaf_to_node()
756 INT_SET(node->btree[0].before, ARCH_CONVERT, blkno); in xfs_attr_leaf_to_node()
2771 child_fsb = INT_GET(node->btree[0].before, ARCH_CONVERT); in xfs_attr_node_inactive()
2833 child_fsb = INT_GET(node->btree[i+1].before, ARCH_CONVERT); in xfs_attr_node_inactive()
/linux-2.4.37.9/fs/befs/
DChangeLog27 * Did the string comparision really right this time (btree.c) [WD]
30 a pointer value. (btree.c) [WD]
38 keys within btree nodes, rather than the linear search we were using
39 before. (btree.c) [Sergey S. Kostyliov <rathamahata@php4.ru>]
56 (btree.c) [WD]
105 * Removed notion of btree handle from btree.c. It was unessisary, as the
128 (btree.c) [WD]
133 seekleaf() in btree.c [WD]
148 (datastream.c, btree.c super.c inode.c) [WD]
253 * Fix bug with reading an empty directory. (btree.c and dir.c)
[all …]
DMakefile12 obj-y := datastream.o btree.o super.o inode.o debug.o io.o linuxvfs.o
/linux-2.4.37.9/fs/hfs/
DChangeLog77 the btree corruption problems. bleah (whilst deleting a bunch of
78 files, more of the btree can get pruned away than desired).
363 Make btree operations less likely to do
404 * btree.c, balloc.c:
434 btree.c, bnode.c, brec.c, bitmap.c, bitops.c, bins_del.c, binsert.c,
502 catalog.c, btree.c, bnode.c, brec.c, bitmap.c, binsert.c,
509 dir.c, brec.c, btree.c, bitmap.c, bnode.c, bdelete.c, bins_del.c,
847 * hfs.h, hfs_sysdep.h, mdb.c, extent.c, file.c, btree.c, catalog.c,
854 * btree.c:
866 * mdb.c, sysdep.c, hfs.h, hfs_btree.h, hfs_sysdep.h, btree.c, extent.c,
[all …]
DMakefile13 bnode.o brec.o btree.o catalog.o dir.o dir_cap.o dir_dbl.o \
/linux-2.4.37.9/fs/hfsplus/
DMakefile12 obj-y := super.o options.o inode.o extents.o catalog.o dir.o btree.o \