| /linux-4.19.296/fs/hfsplus/ |
| D | btree.c | 75 u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size, in hfsplus_calc_btree_clump_size() argument
78 u32 mod = max(node_size, block_size); in hfsplus_calc_btree_clump_size()
102 if (clump_size < (8 * node_size)) in hfsplus_calc_btree_clump_size()
103 clump_size = 8 * node_size; in hfsplus_calc_btree_clump_size()
175 tree->node_size = be16_to_cpu(head->node_size); in hfs_btree_open()
231 size = tree->node_size; in hfs_btree_open()
240 (tree->node_size + PAGE_SIZE - 1) >> in hfs_btree_open()
330 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
339 hfs_bnode_write_u16(node, tree->node_size - 2, 14); in hfs_bmap_new_bmap()
340 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); in hfs_bmap_new_bmap()
|
| D | brec.c | 25 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
45 node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
48 if (recoff > node->tree->node_size - 2) { in hfs_brec_keylen()
92 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
117 idx_rec_off = tree->node_size - (rec + 1) * 2; in hfs_brec_insert()
188 rec_off = tree->node_size - (fd->record + 2) * 2; in hfs_brec_remove()
189 end_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_remove()
268 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
269 old_rec_off = tree->node_size - 4; in hfs_bnode_split()
304 new_rec_off = tree->node_size - 2; in hfs_bnode_split()
[all …]
|
| D | xattr.c | 55 char *buf, u16 node_size) in hfsplus_init_header_node() argument
68 clump_size, node_size); in hfsplus_init_header_node()
71 rec_offsets = (__be16 *)(buf + node_size); in hfsplus_init_header_node()
80 head->node_size = cpu_to_be16(node_size); in hfsplus_init_header_node()
82 do_div(tmp, node_size); in hfsplus_init_header_node()
93 hdr_node_map_rec_bits = 8 * (node_size - offset - (4 * sizeof(u16))); in hfsplus_init_header_node()
99 map_node_bits = 8 * (node_size - sizeof(struct hfs_bnode_desc) - in hfsplus_init_header_node()
128 u16 node_size = HFSPLUS_ATTR_TREE_NODE_SIZE; in hfsplus_create_attributes_file() local
180 node_size, in hfsplus_create_attributes_file()
205 buf = kzalloc(node_size, GFP_NOFS); in hfsplus_create_attributes_file()
[all …]
|
| D | bnode.c | 310 off = node->tree->node_size - 2; in hfs_bnode_dump()
532 rec_off = tree->node_size - 2; in hfs_bnode_find()
540 next_off > tree->node_size || in hfs_bnode_find()
597 min_t(int, PAGE_SIZE, tree->node_size)); in hfs_bnode_create()
644 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bnode_put()
|
| D | hfsplus_fs.h | 87 unsigned int node_size; member
396 u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size, u64 sectors,
|
| D | hfsplus_raw.h | 173 __be16 node_size; member
|
| D | inode.c | 91 if (tree->node_size >= PAGE_SIZE) { in hfsplus_releasepage()
|
| /linux-4.19.296/fs/hfs/ |
| D | brec.c | 24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
45 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
94 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
117 idx_rec_off = tree->node_size - (rec + 1) * 2; in hfs_brec_insert()
186 rec_off = tree->node_size - (fd->record + 2) * 2; in hfs_brec_remove()
187 end_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_remove()
264 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
265 old_rec_off = tree->node_size - 4; in hfs_bnode_split()
300 new_rec_off = tree->node_size - 2; in hfs_bnode_split()
384 rec_off = tree->node_size - (rec + 2) * 2; in hfs_brec_update_parent()
[all …]
|
| D | btree.c | 91 tree->node_size = be16_to_cpu(head->node_size); in hfs_btree_open()
95 size = tree->node_size; in hfs_btree_open()
120 tree->pages_per_bnode = (tree->node_size + PAGE_SIZE - 1) >> PAGE_SHIFT; in hfs_btree_open()
208 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
217 hfs_bnode_write_u16(node, tree->node_size - 2, 14); in hfs_bmap_new_bmap()
218 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); in hfs_bmap_new_bmap()
|
| D | btree.h | 38 unsigned int node_size; member
153 __be16 node_size; /* (F) The number of bytes in a node (=512) */ member
|
| D | bnode.c | 161 off = node->tree->node_size - 2; in hfs_bnode_dump()
293 off = (loff_t)cnid * tree->node_size; in __hfs_bnode_create()
380 rec_off = tree->node_size - 2; in hfs_bnode_find()
388 next_off > tree->node_size || in hfs_bnode_find()
445 min((int)PAGE_SIZE, (int)tree->node_size)); in hfs_bnode_create()
|
| D | inode.c | 96 if (tree->node_size >= PAGE_SIZE) { in hfs_releasepage()
|
| /linux-4.19.296/fs/befs/ |
| D | befs_fs_types.h | 219 fs32 node_size; member
229 u32 node_size; member
|
| D | btree.c | 152 sup->node_size = fs32_to_cpu(sb, od_sup->node_size); in befs_bt_read_super()
|
| D | debug.c | 233 befs_debug(sb, " node_size %u", fs32_to_cpu(sb, super->node_size)); in befs_dump_index_entry()
|