| /fs/hpfs/ |
| D | anode.c | 14 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 (le32_to_cpu(btree->u.internal[i].file_secno) > sec) { in hpfs_bplus_lookup()
26 a = le32_to_cpu(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 (le32_to_cpu(btree->u.external[i].file_secno) <= sec && in hpfs_bplus_lookup()
38 … le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > sec) { in hpfs_bplus_lookup()
39 …a = le32_to_cpu(btree->u.external[i].disk_secno) + sec - le32_to_cpu(btree->u.external[i].file_sec… in hpfs_bplus_lookup()
[all …]
|
| D | map.c | 135 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
136 (fnode->btree.internal ? 12 : 8)) { in hpfs_map_fnode()
142 if (le16_to_cpu(fnode->btree.first_free) != in hpfs_map_fnode()
143 8 + fnode->btree.n_used_nodes * (fnode->btree.internal ? 8 : 12)) { in hpfs_map_fnode()
190 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
191 (anode->btree.internal ? 60 : 40)) { in hpfs_map_anode()
195 if (le16_to_cpu(anode->btree.first_free) != in hpfs_map_anode()
196 8 + anode->btree.n_used_nodes * (anode->btree.internal ? 8 : 12)) { in hpfs_map_anode()
|
| D | alloc.c | 403 f->btree.n_free_nodes = 8; in hpfs_alloc_fnode()
404 f->btree.first_free = cpu_to_le16(8); in hpfs_alloc_fnode()
420 a->btree.n_free_nodes = 40; in hpfs_alloc_anode()
421 a->btree.n_used_nodes = 0; in hpfs_alloc_anode()
422 a->btree.first_free = cpu_to_le16(8); in hpfs_alloc_anode()
|
| D | hpfs.h | 474 struct bplus_header btree; /* b+ tree, 8 extents or 12 subtrees */ member
506 struct bplus_header btree; /* b+tree, 40 extents or 60 subtrees */ member
|
| D | namei.c | 74 fnode->btree.n_free_nodes = 7; in hpfs_mkdir()
75 fnode->btree.n_used_nodes = 1; in hpfs_mkdir()
76 fnode->btree.first_free = cpu_to_le16(0x14); in hpfs_mkdir()
|
| D | file.c | 47 disk_secno = hpfs_bplus_lookup(inode->i_sb, inode, &fnode->btree, file_secno, bh); in hpfs_bmap()
|
| D | ea.c | 43 hpfs_remove_btree(s, &anode->btree); in hpfs_ea_ext_remove()
|
| /fs/nilfs2/ |
| D | btree.c | 69 static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree, in nilfs_btree_get_new_block() argument
72 struct address_space *btnc = &NILFS_BMAP_I(btree)->i_btnode_cache; in nilfs_btree_get_new_block()
122 static int nilfs_btree_node_size(const struct nilfs_bmap *btree) in nilfs_btree_node_size() argument
124 return 1 << btree->b_inode->i_blkbits; in nilfs_btree_node_size()
127 static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree) in nilfs_btree_nchildren_per_block() argument
129 return btree->b_nchildren_per_block; in nilfs_btree_nchildren_per_block()
386 nilfs_btree_get_root(const struct nilfs_bmap *btree) in nilfs_btree_get_root() argument
388 return (struct nilfs_btree_node *)btree->b_u.u_data; in nilfs_btree_get_root()
403 static int nilfs_btree_height(const struct nilfs_bmap *btree) in nilfs_btree_height() argument
405 return nilfs_btree_node_get_level(nilfs_btree_get_root(btree)) + 1; in nilfs_btree_height()
[all …]
|
| D | Makefile | 3 btnode.o bmap.o btree.o direct.o dat.o recovery.o \
|
| /fs/xfs/ |
| D | xfs_da_btree.c | 330 size = (int)((char *)&oldroot->btree[be16_to_cpu(oldroot->hdr.count)] - in xfs_da_root_split()
353 node->btree[0].hashval = cpu_to_be32(blk1->hashval); in xfs_da_root_split()
354 node->btree[0].before = cpu_to_be32(blk1->blkno); in xfs_da_root_split()
355 node->btree[1].hashval = cpu_to_be32(blk2->hashval); in xfs_da_root_split()
356 node->btree[1].before = cpu_to_be32(blk2->blkno); in xfs_da_root_split()
370 XFS_DA_LOGRANGE(node, node->btree, in xfs_da_root_split()
488 ((be32_to_cpu(node2->btree[0].hashval) < be32_to_cpu(node1->btree[0].hashval)) || in xfs_da_node_rebalance()
489 (be32_to_cpu(node2->btree[be16_to_cpu(node2->hdr.count)-1].hashval) < in xfs_da_node_rebalance()
490 be32_to_cpu(node1->btree[be16_to_cpu(node1->hdr.count)-1].hashval)))) { in xfs_da_node_rebalance()
510 btree_s = &node2->btree[0]; in xfs_da_node_rebalance()
[all …]
|
| D | xfs_attr.c | 1811 xfs_da_node_entry_t *btree; in xfs_attr_node_list() local
1891 btree = node->btree; in xfs_attr_node_list()
1893 btree++, i++) { in xfs_attr_node_list()
1895 <= be32_to_cpu(btree->hashval)) { in xfs_attr_node_list()
1896 cursor->blkno = be32_to_cpu(btree->before); in xfs_attr_node_list()
1898 btree); in xfs_attr_node_list()
|
| D | xfs_da_btree.h | 70 } btree[1]; /* variable sized array of keys */ member
|
| D | xfs_trace.h | 135 struct xfs_da_node_entry *btree),
136 TP_ARGS(ctx, btree),
163 __entry->bt_hashval = be32_to_cpu(btree->hashval);
164 __entry->bt_before = be32_to_cpu(btree->before);
|
| D | xfs_mount.c | 801 uint64_t btree = 0; in xfs_initialize_perag_data() local
822 btree += pag->pagf_btreeblks; in xfs_initialize_perag_data()
831 sbp->sb_fdblocks = bfree + bfreelst + btree; in xfs_initialize_perag_data()
|
| D | xfs_attr_leaf.c | 896 node->btree[0].hashval = in xfs_attr_leaf_to_node()
898 node->btree[0].before = cpu_to_be32(blkno); in xfs_attr_leaf_to_node()
2786 child_fsb = be32_to_cpu(node->btree[0].before); in xfs_attr_node_inactive()
2846 child_fsb = be32_to_cpu(node->btree[i+1].before); in xfs_attr_node_inactive()
|
| /fs/befs/ |
| D | ChangeLog | 27 * Did the string comparison 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 unnecessary, 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 …]
|
| D | Makefile | 7 befs-objs := datastream.o btree.o super.o inode.o debug.o io.o linuxvfs.o
|
| /fs/hfsplus/ |
| D | Makefile | 7 hfsplus-objs := super.o options.o inode.o ioctl.o extents.o catalog.o dir.o btree.o \
|
| /fs/hfs/ |
| D | Makefile | 7 hfs-objs := bitmap.o bfind.o bnode.o brec.o btree.o \
|