Home
last modified time | relevance | path

Searched refs:leaf_count (Results 1 – 9 of 9) sorted by relevance

/linux/fs/hfs/
A Dbtree.c85 tree->leaf_count = be32_to_cpu(head->leaf_count); in hfs_btree_open()
175 head->leaf_count = cpu_to_be32(tree->leaf_count); in hfs_btree_write()
A Dbtree.h31 u32 leaf_count; member
150 __be32 leaf_count; /* (V) The number of leaf records */ member
A Dbrec.c108 tree->leaf_count++; in hfs_brec_insert()
190 tree->leaf_count--; in hfs_brec_remove()
/linux/fs/hfsplus/
A Dbtree.c169 tree->leaf_count = be32_to_cpu(head->leaf_count); in hfs_btree_open()
298 head->leaf_count = cpu_to_be32(tree->leaf_count); in hfs_btree_write()
A Dbrec.c106 tree->leaf_count++; in hfs_brec_insert()
192 tree->leaf_count--; in hfs_brec_remove()
A Dhfsplus_raw.h170 __be32 leaf_count; member
A Dhfsplus_fs.h80 u32 leaf_count; member
/linux/fs/f2fs/
A Dsuper.c3058 loff_t leaf_count; in max_file_blocks() local
3068 leaf_count = ADDRS_PER_BLOCK(inode); in max_file_blocks()
3070 leaf_count = DEF_ADDRS_PER_BLOCK; in max_file_blocks()
3073 result += (leaf_count * 2); in max_file_blocks()
3076 leaf_count *= NIDS_PER_BLOCK; in max_file_blocks()
3077 result += (leaf_count * 2); in max_file_blocks()
3080 leaf_count *= NIDS_PER_BLOCK; in max_file_blocks()
3081 result += leaf_count; in max_file_blocks()
A Ddata.c1909 loff_t leaf_count = ADDRS_PER_BLOCK(inode); in max_inode_blocks() local
1912 result += (leaf_count * 2); in max_inode_blocks()
1915 leaf_count *= NIDS_PER_BLOCK; in max_inode_blocks()
1916 result += (leaf_count * 2); in max_inode_blocks()
1919 leaf_count *= NIDS_PER_BLOCK; in max_inode_blocks()
1920 result += leaf_count; in max_inode_blocks()

Completed in 27 milliseconds