| /fs/hpfs/ |
| D | anode.c | 15 struct bplus_header *btree, unsigned sec, in hpfs_bplus_lookup() argument
24 if (bp_internal(btree)) { in hpfs_bplus_lookup()
25 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
26 if (le32_to_cpu(btree->u.internal[i].file_secno) > sec) { in hpfs_bplus_lookup()
27 a = le32_to_cpu(btree->u.internal[i].down); in hpfs_bplus_lookup()
30 btree = &anode->btree; in hpfs_bplus_lookup()
37 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
38 if (le32_to_cpu(btree->u.external[i].file_secno) <= sec && in hpfs_bplus_lookup()
39 … le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > sec) { in hpfs_bplus_lookup()
40 …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 | 180 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
181 (bp_internal(&fnode->btree) ? 12 : 8)) { in hpfs_map_fnode()
187 if (le16_to_cpu(fnode->btree.first_free) != in hpfs_map_fnode()
188 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) { in hpfs_map_fnode()
235 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
236 (bp_internal(&anode->btree) ? 60 : 40)) { in hpfs_map_anode()
240 if (le16_to_cpu(anode->btree.first_free) != in hpfs_map_anode()
241 8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) { in hpfs_map_anode()
|
| D | alloc.c | 466 f->btree.n_free_nodes = 8; in hpfs_alloc_fnode()
467 f->btree.first_free = cpu_to_le16(8); in hpfs_alloc_fnode()
483 a->btree.n_free_nodes = 40; in hpfs_alloc_anode()
484 a->btree.n_used_nodes = 0; in hpfs_alloc_anode()
485 a->btree.first_free = cpu_to_le16(8); in hpfs_alloc_anode()
|
| D | hpfs.h | 456 struct bplus_header btree; /* b+ tree, 8 extents or 12 subtrees */ member
498 struct bplus_header btree; /* b+tree, 40 extents or 60 subtrees */ member
|
| D | namei.c | 87 fnode->btree.n_free_nodes = 7; in hpfs_mkdir()
88 fnode->btree.n_used_nodes = 1; in hpfs_mkdir()
89 fnode->btree.first_free = cpu_to_le16(0x14); in hpfs_mkdir()
|
| D | file.c | 54 disk_secno = hpfs_bplus_lookup(inode->i_sb, inode, &fnode->btree, file_secno, bh); in hpfs_bmap()
|
| D | ea.c | 44 hpfs_remove_btree(s, &anode->btree); in hpfs_ea_ext_remove()
|
| /fs/nilfs2/ |
| D | btree.c | 58 static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree, in nilfs_btree_get_new_block() argument
61 struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode; in nilfs_btree_get_new_block()
112 static int nilfs_btree_node_size(const struct nilfs_bmap *btree) in nilfs_btree_node_size() argument
114 return i_blocksize(btree->b_inode); in nilfs_btree_node_size()
117 static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree) in nilfs_btree_nchildren_per_block() argument
119 return btree->b_nchildren_per_block; in nilfs_btree_nchildren_per_block()
410 nilfs_btree_get_root(const struct nilfs_bmap *btree) in nilfs_btree_get_root() argument
412 return (struct nilfs_btree_node *)btree->b_u.u_data; in nilfs_btree_get_root()
427 static int nilfs_btree_height(const struct nilfs_bmap *btree) in nilfs_btree_height() argument
429 return nilfs_btree_node_get_level(nilfs_btree_get_root(btree)) + 1; in nilfs_btree_height()
[all …]
|
| D | Makefile | 4 btnode.o bmap.o btree.o direct.o dat.o recovery.o \
|
| /fs/xfs/libxfs/ |
| D | xfs_da_btree.c | 140 to->btree = from3->__btree; in xfs_da3_node_hdr_from_disk()
148 to->btree = from->__btree; in xfs_da3_node_hdr_from_disk()
640 struct xfs_da_node_entry *btree; in xfs_da3_root_split() local
675 btree = icnodehdr.btree; in xfs_da3_root_split()
676 size = (int)((char *)&btree[icnodehdr.count] - (char *)oldroot); in xfs_da3_root_split()
734 btree = nodehdr.btree; in xfs_da3_root_split()
735 btree[0].hashval = cpu_to_be32(blk1->hashval); in xfs_da3_root_split()
736 btree[0].before = cpu_to_be32(blk1->blkno); in xfs_da3_root_split()
737 btree[1].hashval = cpu_to_be32(blk2->hashval); in xfs_da3_root_split()
738 btree[1].before = cpu_to_be32(blk2->blkno); in xfs_da3_root_split()
[all …]
|
| D | xfs_da_btree.h | 151 struct xfs_da_node_entry *btree; member
|
| D | xfs_ag.c | 117 uint64_t btree = 0; in xfs_initialize_perag_data() local
139 btree += pag->pagf_btreeblks; in xfs_initialize_perag_data()
142 fdblocks = bfree + bfreelst + btree; in xfs_initialize_perag_data()
|
| D | xfs_attr_leaf.c | 1227 icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval; in xfs_attr3_leaf_to_node()
1228 icnodehdr.btree[0].before = cpu_to_be32(blkno); in xfs_attr3_leaf_to_node()
|
| /fs/xfs/ |
| D | xfs_attr_list.c | 208 struct xfs_da_node_entry *btree; in xfs_attr_node_list_lookup() local
251 btree = nodehdr.btree; in xfs_attr_node_list_lookup()
252 for (i = 0; i < nodehdr.count; btree++, i++) { in xfs_attr_node_list_lookup()
253 if (cursor->hashval <= be32_to_cpu(btree->hashval)) { in xfs_attr_node_list_lookup()
254 cursor->blkno = be32_to_cpu(btree->before); in xfs_attr_node_list_lookup()
256 btree); in xfs_attr_node_list_lookup()
|
| D | xfs_attr_inactive.c | 159 child_fsb = be32_to_cpu(ichdr.btree[0].before); in xfs_attr3_node_inactive()
231 child_fsb = be32_to_cpu(phdr.btree[i + 1].before); in xfs_attr3_node_inactive()
|
| D | Makefile | 142 btree.o \
|
| D | xfs_trace.h | 301 struct xfs_da_node_entry *btree),
302 TP_ARGS(ctx, btree),
329 __entry->bt_hashval = be32_to_cpu(btree->hashval);
330 __entry->bt_before = be32_to_cpu(btree->before);
|
| /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 | 8 befs-objs := datastream.o btree.o super.o inode.o debug.o io.o linuxvfs.o
|
| /fs/xfs/scrub/ |
| D | dabtree.c | 91 return hdr.btree + blk->index; in xchk_da_btree_node_entry()
318 struct xfs_da_node_entry *btree; in xchk_da_btree_block() local
421 btree = nodehdr.btree; in xchk_da_btree_block()
423 blk->hashval = be32_to_cpu(btree[*pmaxrecs - 1].hashval); in xchk_da_btree_block()
|
| /fs/hfs/ |
| D | Makefile | 8 hfs-objs := bitmap.o bfind.o bnode.o brec.o btree.o \
|
| /fs/hfsplus/ |
| D | Makefile | 8 hfsplus-objs := super.o options.o inode.o ioctl.o extents.o catalog.o dir.o btree.o \
|