Home
last modified time | relevance | path

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

/linux-4.4.14/fs/hfsplus/
Dbtree.c74 u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size, in hfsplus_calc_btree_clump_size() argument
77 u32 mod = max(node_size, block_size); in hfsplus_calc_btree_clump_size()
101 if (clump_size < (8 * node_size)) in hfsplus_calc_btree_clump_size()
102 clump_size = 8 * node_size; in hfsplus_calc_btree_clump_size()
174 tree->node_size = be16_to_cpu(head->node_size); in hfs_btree_open()
230 size = tree->node_size; in hfs_btree_open()
239 (tree->node_size + PAGE_CACHE_SIZE - 1) >> in hfs_btree_open()
329 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
338 hfs_bnode_write_u16(node, tree->node_size - 2, 14); in hfs_bmap_new_bmap()
339 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); in hfs_bmap_new_bmap()
Dbrec.c24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
44 node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
47 if (recoff > node->tree->node_size - 2) { in hfs_brec_keylen()
90 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
115 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()
266 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
267 old_rec_off = tree->node_size - 4; in hfs_bnode_split()
302 new_rec_off = tree->node_size - 2; in hfs_bnode_split()
[all …]
Dxattr.c60 char *buf, u16 node_size) in hfsplus_init_header_node() argument
73 clump_size, node_size); in hfsplus_init_header_node()
76 rec_offsets = (__be16 *)(buf + node_size); in hfsplus_init_header_node()
85 head->node_size = cpu_to_be16(node_size); in hfsplus_init_header_node()
87 do_div(tmp, node_size); in hfsplus_init_header_node()
98 hdr_node_map_rec_bits = 8 * (node_size - offset - (4 * sizeof(u16))); in hfsplus_init_header_node()
104 map_node_bits = 8 * (node_size - sizeof(struct hfs_bnode_desc) - in hfsplus_init_header_node()
133 u16 node_size = HFSPLUS_ATTR_TREE_NODE_SIZE; in hfsplus_create_attributes_file() local
185 node_size, in hfsplus_create_attributes_file()
210 buf = kzalloc(node_size, GFP_NOFS); in hfsplus_create_attributes_file()
[all …]
Dbnode.c311 off = node->tree->node_size - 2; in hfs_bnode_dump()
535 rec_off = tree->node_size - 2; in hfs_bnode_find()
543 next_off > tree->node_size || in hfs_bnode_find()
600 min_t(int, PAGE_CACHE_SIZE, tree->node_size)); in hfs_bnode_create()
647 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bnode_put()
Dhfsplus_fs.h87 unsigned int node_size; member
392 u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size, u64 sectors,
Dhfsplus_raw.h172 __be16 node_size; member
Dinode.c90 if (tree->node_size >= PAGE_CACHE_SIZE) { in hfsplus_releasepage()
/linux-4.4.14/fs/hfs/
Dbrec.c23 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
44 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
92 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
115 idx_rec_off = tree->node_size - (rec + 1) * 2; in hfs_brec_insert()
184 rec_off = tree->node_size - (fd->record + 2) * 2; in hfs_brec_remove()
185 end_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_remove()
262 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
263 old_rec_off = tree->node_size - 4; in hfs_bnode_split()
298 new_rec_off = tree->node_size - 2; in hfs_bnode_split()
382 rec_off = tree->node_size - (rec + 2) * 2; in hfs_brec_update_parent()
[all …]
Dbtree.c90 tree->node_size = be16_to_cpu(head->node_size); in hfs_btree_open()
94 size = tree->node_size; in hfs_btree_open()
119 tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT; in hfs_btree_open()
207 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
216 hfs_bnode_write_u16(node, tree->node_size - 2, 14); in hfs_bmap_new_bmap()
217 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); in hfs_bmap_new_bmap()
Dbtree.h30 unsigned int node_size; member
144 __be16 node_size; /* (F) The number of bytes in a node (=512) */ member
Dbnode.c147 off = node->tree->node_size - 2; in hfs_bnode_dump()
280 off = (loff_t)cnid * tree->node_size; in __hfs_bnode_create()
367 rec_off = tree->node_size - 2; in hfs_bnode_find()
375 next_off > tree->node_size || in hfs_bnode_find()
432 min((int)PAGE_CACHE_SIZE, (int)tree->node_size)); in hfs_bnode_create()
Dinode.c94 if (tree->node_size >= PAGE_CACHE_SIZE) { in hfs_releasepage()
/linux-4.4.14/fs/befs/
Dbefs_fs_types.h218 fs32 node_size; member
228 u32 node_size; member
Dbtree.c155 sup->node_size = fs32_to_cpu(sb, od_sup->node_size); in befs_bt_read_super()
Ddebug.c229 befs_debug(sb, " node_size %u", fs32_to_cpu(sb, super->node_size)); in befs_dump_index_entry()
/linux-4.4.14/drivers/media/platform/sti/bdisp/
Dbdisp-hw.c150 unsigned int i, node_size = sizeof(struct bdisp_node); in bdisp_hw_alloc_nodes() local
157 base = dma_alloc_attrs(dev, node_size * MAX_NB_NODE, &paddr, in bdisp_hw_alloc_nodes()
164 memset(base, 0, node_size * MAX_NB_NODE); in bdisp_hw_alloc_nodes()
171 base += node_size; in bdisp_hw_alloc_nodes()
172 paddr += node_size; in bdisp_hw_alloc_nodes()