Home
last modified time | relevance | path

Searched refs:node_size (Results 1 – 15 of 15) sorted by relevance

/fs/hfs/
A Dbnode.c21 bool is_valid = off < node->tree->node_size; in is_bnode_offset_valid()
28 node->tree->node_size, off); in is_bnode_offset_valid()
37 unsigned int node_size; in check_and_correct_requested_length() local
42 node_size = node->tree->node_size; in check_and_correct_requested_length()
44 if ((off + len) > node_size) { in check_and_correct_requested_length()
45 int new_len = (int)node_size - off; in check_and_correct_requested_length()
75 node->tree->node_size, off, len); in hfs_bnode_read()
252 off = node->tree->node_size - 2; in hfs_bnode_dump()
384 off = (loff_t)cnid * tree->node_size; in __hfs_bnode_create()
468 rec_off = tree->node_size - 2; in hfs_bnode_find()
[all …]
A Dbrec.c24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
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()
400 rec_off = tree->node_size - (rec + 2) * 2; in hfs_brec_update_parent()
[all …]
A Dbtree.c124 tree->node_size = be16_to_cpu(head->node_size); in hfs_btree_open()
128 size = tree->node_size; in hfs_btree_open()
153 tree->pages_per_bnode = (tree->node_size + PAGE_SIZE - 1) >> PAGE_SHIFT; in hfs_btree_open()
246 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
255 hfs_bnode_write_u16(node, tree->node_size - 2, 14); in hfs_bmap_new_bmap()
256 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); in hfs_bmap_new_bmap()
A Dbtree.h38 unsigned int node_size; member
153 __be16 node_size; /* (F) The number of bytes in a node (=512) */ member
A Dinode.c91 if (tree->node_size >= PAGE_SIZE) { in hfs_release_folio()
/fs/hfsplus/
A Dbrec.c25 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()
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()
269 old_rec_off = tree->node_size - 4; in hfs_bnode_split()
304 new_rec_off = tree->node_size - 2; in hfs_bnode_split()
389 rec_off = tree->node_size - (rec + 2) * 2; in hfs_brec_update_parent()
405 rec_off = tree->node_size - (rec + 2) * 2; in hfs_brec_update_parent()
406 end_rec_off = tree->node_size - in hfs_brec_update_parent()
[all …]
A Dbtree.c75 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()
331 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
340 hfs_bnode_write_u16(node, tree->node_size - 2, 14); in hfs_bmap_new_bmap()
341 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); in hfs_bmap_new_bmap()
A Dbnode.c24 bool is_valid = off < node->tree->node_size; in is_bnode_offset_valid()
31 node->tree->node_size, off); in is_bnode_offset_valid()
40 unsigned int node_size; in check_and_correct_requested_length() local
45 node_size = node->tree->node_size; in check_and_correct_requested_length()
47 if ((off + len) > node_size) { in check_and_correct_requested_length()
48 int new_len = (int)node_size - off; in check_and_correct_requested_length()
77 node->tree->node_size, off, len); in hfs_bnode_read()
148 node->tree->node_size, off, len); in hfs_bnode_write()
401 off = node->tree->node_size - 2; in hfs_bnode_dump()
619 rec_off = tree->node_size - 2; in hfs_bnode_find()
[all …]
A Dxattr.c55 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()
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
184 node_size, in hfsplus_create_attributes_file()
209 buf = kzalloc(node_size, GFP_NOFS); in hfsplus_create_attributes_file()
221 for (; written < node_size; index++, written += PAGE_SIZE) { in hfsplus_create_attributes_file()
[all …]
A Dhfsplus_fs.h88 unsigned int node_size; member
388 u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size, u64 sectors,
A Dhfsplus_raw.h173 __be16 node_size; member
A Dinode.c88 if (tree->node_size >= PAGE_SIZE) { in hfsplus_release_folio()
/fs/befs/
A Dbefs_fs_types.h219 fs32 node_size; member
229 u32 node_size; member
A Dbtree.c152 sup->node_size = fs32_to_cpu(sb, od_sup->node_size); in befs_bt_read_super()
A Ddebug.c233 befs_debug(sb, " node_size %u", fs32_to_cpu(sb, super->node_size)); in befs_dump_index_entry()

Completed in 33 milliseconds