Home
last modified time | relevance | path

Searched refs:node_size (Results 1 - 25 of 45) sorted by relevance

12

/kernel/linux/linux-5.10/fs/hfsplus/
H 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()
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 in hfs_bnode_split()
[all...]
H 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()
330 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
339 hfs_bnode_write_u16(node, tree->node_size in hfs_bmap_new_bmap()
[all...]
H A Dxattr.c55 char *buf, u16 node_size) in hfsplus_init_header_node()
67 hfs_dbg(ATTR_MOD, "init_hdr_attr_file: clump %u, node_size %u\n", in hfsplus_init_header_node()
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 in hfsplus_create_attributes_file() local
53 hfsplus_init_header_node(struct inode *attr_file, u32 clump_size, char *buf, u16 node_size) hfsplus_init_header_node() argument
[all...]
H A Dbnode.c310 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()
H A Dhfsplus_fs.h87 unsigned int node_size; member
396 u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size, u64 sectors,
/kernel/linux/linux-6.6/fs/hfsplus/
H 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()
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 in hfs_bnode_split()
[all...]
H 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 in hfs_bmap_new_bmap()
[all...]
H A Dxattr.c55 char *buf, u16 node_size) in hfsplus_init_header_node()
67 hfs_dbg(ATTR_MOD, "init_hdr_attr_file: clump %u, node_size %u\n", in hfsplus_init_header_node()
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 in hfsplus_create_attributes_file() local
53 hfsplus_init_header_node(struct inode *attr_file, u32 clump_size, char *buf, u16 node_size) hfsplus_init_header_node() argument
[all...]
H A Dbnode.c303 off = node->tree->node_size - 2; in hfs_bnode_dump()
521 rec_off = tree->node_size - 2; in hfs_bnode_find()
529 next_off > tree->node_size || in hfs_bnode_find()
586 min_t(int, PAGE_SIZE, tree->node_size)); in hfs_bnode_create()
631 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bnode_put()
/kernel/linux/linux-5.10/fs/hfs/
H A Dbrec.c24 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 in hfs_brec_update_parent()
[all...]
H A Dbtree.c91 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()
H A Dbtree.h38 unsigned int node_size; member
153 __be16 node_size; /* (F) The number of bytes in a node (=512) */ member
H A Dbnode.c161 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()
/kernel/linux/linux-6.6/fs/hfs/
H A Dbrec.c24 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 in hfs_brec_update_parent()
[all...]
H A Dbtree.c92 tree->node_size = be16_to_cpu(head->node_size); in hfs_btree_open()
96 size = tree->node_size; in hfs_btree_open()
121 tree->pages_per_bnode = (tree->node_size + PAGE_SIZE - 1) >> PAGE_SHIFT; in hfs_btree_open()
211 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
220 hfs_bnode_write_u16(node, tree->node_size - 2, 14); in hfs_bmap_new_bmap()
221 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); in hfs_bmap_new_bmap()
H A Dbnode.c154 off = node->tree->node_size - 2; in hfs_bnode_dump()
286 off = (loff_t)cnid * tree->node_size; in __hfs_bnode_create()
370 rec_off = tree->node_size - 2; in hfs_bnode_find()
378 next_off > tree->node_size || in hfs_bnode_find()
435 min((int)PAGE_SIZE, (int)tree->node_size)); in hfs_bnode_create()
H A Dbtree.h38 unsigned int node_size; member
153 __be16 node_size; /* (F) The number of bytes in a node (=512) */ member
/kernel/linux/linux-6.6/drivers/gpu/drm/i915/
H A Di915_vma_resource.h79 * @node_size: Size of the allocated range manager node with padding
127 u64 node_size; member
192 * @node_size: Size of the allocated range manager node minus padding.
212 u64 node_size, in i915_vma_resource_init()
230 vma_res->node_size = node_size; in i915_vma_resource_init()
201 i915_vma_resource_init(struct i915_vma_resource *vma_res, struct i915_address_space *vm, struct sg_table *pages, const struct i915_page_sizes *page_sizes, struct i915_refct_sgt *pages_rsgt, bool readonly, bool lmem, struct intel_memory_region *mr, const struct i915_vma_ops *ops, void *private, u64 start, u64 node_size, u64 size, u32 guard) i915_vma_resource_init() argument
/kernel/linux/linux-5.10/fs/befs/
H A Dbefs_fs_types.h219 fs32 node_size; member
229 u32 node_size; member
/kernel/linux/linux-6.6/fs/befs/
H A Dbefs_fs_types.h219 fs32 node_size; member
229 u32 node_size; member
/kernel/linux/linux-6.6/lib/
H A Dbootconfig.c83 * @node_size: A pointer to store the number of nodes.
86 * Get the number of used nodes in @node_size if it is not NULL,
90 int __init xbc_get_info(int *node_size, size_t *data_size) in xbc_get_info() argument
95 if (node_size) in xbc_get_info()
96 *node_size = xbc_node_num; in xbc_get_info()
/kernel/linux/linux-6.6/tools/testing/selftests/mm/
H A Dksm_tests.c468 long node_size; in get_next_mem_node() local
474 node_size = numa_node_size(mem_node, NULL); in get_next_mem_node()
475 if (node_size > 0) in get_next_mem_node()
/kernel/linux/linux-5.10/drivers/media/platform/sti/bdisp/
H A Dbdisp-hw.c452 unsigned int i, node_size = sizeof(struct bdisp_node); in bdisp_hw_alloc_nodes() local
457 base = dma_alloc_attrs(dev, node_size * MAX_NB_NODE, &paddr, in bdisp_hw_alloc_nodes()
464 memset(base, 0, node_size * MAX_NB_NODE); in bdisp_hw_alloc_nodes()
471 base += node_size; in bdisp_hw_alloc_nodes()
472 paddr += node_size; in bdisp_hw_alloc_nodes()
/kernel/linux/linux-6.6/drivers/media/platform/st/sti/bdisp/
H A Dbdisp-hw.c452 unsigned int i, node_size = sizeof(struct bdisp_node); in bdisp_hw_alloc_nodes() local
457 base = dma_alloc_attrs(dev, node_size * MAX_NB_NODE, &paddr, in bdisp_hw_alloc_nodes()
464 memset(base, 0, node_size * MAX_NB_NODE); in bdisp_hw_alloc_nodes()
471 base += node_size; in bdisp_hw_alloc_nodes()
472 paddr += node_size; in bdisp_hw_alloc_nodes()
/kernel/linux/linux-6.6/include/linux/
H A Dbootconfig.h287 int __init xbc_get_info(int *node_size, size_t *data_size);

Completed in 18 milliseconds

12