Home
last modified time | relevance | path

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

/linux-6.15/fs/hfs/
H A Dbrec.c111 node->num_recs++; in hfs_brec_insert()
266 num_recs = 1; in hfs_bnode_split()
272 if (++num_recs < node->num_recs) in hfs_bnode_split()
287 num_recs--; in hfs_bnode_split()
297 new_node->num_recs = node->num_recs - num_recs; in hfs_bnode_split()
298 node->num_recs = num_recs; in hfs_bnode_split()
303 num_recs = new_node->num_recs; in hfs_bnode_split()
311 num_recs--; in hfs_bnode_split()
321 node_desc.num_recs = cpu_to_be16(new_node->num_recs); in hfs_bnode_split()
329 node_desc.num_recs = cpu_to_be16(node->num_recs); in hfs_bnode_split()
[all …]
H A Dbfind.c64 e = bnode->num_recs - 1; in __hfs_brec_find()
188 fd->record = bnode->num_recs - 1; in hfs_brec_goto()
204 while (cnt >= bnode->num_recs - fd->record) { in hfs_brec_goto()
205 cnt -= bnode->num_recs - fd->record; in hfs_brec_goto()
H A Dbtree.h61 u16 num_recs; member
138 __be16 num_recs; /* (V) The number of records in this node */ member
H A Dbnode.c158 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
161 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
353 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
380 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
H A Dbtree.c210 node->num_recs = 1; in hfs_bmap_new_bmap()
216 desc.num_recs = cpu_to_be16(1); in hfs_bmap_new_bmap()
/linux-6.15/fs/hfsplus/
H A Dbrec.c109 node->num_recs++; in hfs_brec_insert()
270 num_recs = 1; in hfs_bnode_split()
276 if (++num_recs < node->num_recs) in hfs_bnode_split()
291 num_recs--; in hfs_bnode_split()
301 new_node->num_recs = node->num_recs - num_recs; in hfs_bnode_split()
302 node->num_recs = num_recs; in hfs_bnode_split()
307 num_recs = new_node->num_recs; in hfs_bnode_split()
315 num_recs--; in hfs_bnode_split()
325 node_desc.num_recs = cpu_to_be16(new_node->num_recs); in hfs_bnode_split()
333 node_desc.num_recs = cpu_to_be16(node->num_recs); in hfs_bnode_split()
[all …]
H A Dbfind.c113 e = bnode->num_recs - 1; in __hfs_brec_find()
234 fd->record = bnode->num_recs - 1; in hfs_brec_goto()
250 while (cnt >= bnode->num_recs - fd->record) { in hfs_brec_goto()
251 cnt -= bnode->num_recs - fd->record; in hfs_brec_goto()
H A Dbnode.c307 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
310 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
504 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
531 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
H A Dbtree.c330 node->num_recs = 1; in hfs_bmap_new_bmap()
336 desc.num_recs = cpu_to_be16(1); in hfs_bmap_new_bmap()
H A Dhfsplus_raw.h156 __be16 num_recs; member
H A Dhfsplus_fs.h112 u16 num_recs; member
H A Dxattr.c75 desc->num_recs = cpu_to_be16(HFSPLUS_BTREE_HDR_NODE_RECS_COUNT); in hfsplus_init_header_node()
/linux-6.15/fs/ocfs2/
H A Dxattr.c6211 int *num_recs, in ocfs2_value_metas_in_xattr_header() argument
6281 int ret, meta_add = 0, num_recs = 0; in ocfs2_reflink_lock_xattr_allocators() local
6288 &meta_add, credits, &num_recs, in ocfs2_reflink_lock_xattr_allocators()
6303 num_recs = num_recs / ocfs2_refcount_recs_per_rb(osb->sb) * 2; in ocfs2_reflink_lock_xattr_allocators()
6304 meta_add += num_recs; in ocfs2_reflink_lock_xattr_allocators()
6305 *credits += num_recs + num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS; in ocfs2_reflink_lock_xattr_allocators()
6690 int num_recs; member
6721 &metas->credits, &metas->num_recs, in ocfs2_calc_value_tree_metas()
6766 metas.num_recs = in ocfs2_lock_reflink_xattr_rec_allocators()
6769 metas.num_metas += metas.num_recs; in ocfs2_lock_reflink_xattr_rec_allocators()
[all …]
H A Dalloc.c1696 int size, num_recs = le16_to_cpu(el->l_next_free_rec); in ocfs2_remove_empty_extent() local
1698 BUG_ON(num_recs == 0); in ocfs2_remove_empty_extent()
1701 num_recs--; in ocfs2_remove_empty_extent()
1702 size = num_recs * sizeof(struct ocfs2_extent_rec); in ocfs2_remove_empty_extent()
1704 memset(&el->l_recs[num_recs], 0, in ocfs2_remove_empty_extent()
1706 el->l_next_free_rec = cpu_to_le16(num_recs); in ocfs2_remove_empty_extent()
6279 unsigned int clusters, num_recs, start_cluster; in ocfs2_complete_truncate_log_recovery() local
6291 num_recs = le16_to_cpu(tl->tl_used); in ocfs2_complete_truncate_log_recovery()
6294 num_recs); in ocfs2_complete_truncate_log_recovery()
6297 for(i = 0; i < num_recs; i++) { in ocfs2_complete_truncate_log_recovery()
/linux-6.15/fs/xfs/libxfs/
H A Dxfs_bmap.c431 xfs_extnum_t num_recs; in xfs_bmap_check_leaf_extents() local
434 num_recs = xfs_btree_get_numrecs(block); in xfs_bmap_check_leaf_extents()
454 for (j = 1; j < num_recs; j++) { in xfs_bmap_check_leaf_extents()
463 i += num_recs; in xfs_bmap_check_leaf_extents()
1143 xfs_extnum_t num_recs; in xfs_iread_bmbt_block() local
1151 num_recs = xfs_btree_get_numrecs(block); in xfs_iread_bmbt_block()
1152 if (unlikely(ir->loaded + num_recs > ifp->if_nextents)) { in xfs_iread_bmbt_block()
1163 for (j = 0; j < num_recs; j++, frp++, ir->loaded++) { in xfs_iread_bmbt_block()
/linux-6.15/tools/lib/bpf/
H A Dbtf.c3135 __u32 i, num_recs; in btf_ext_bswap_info_sec() local
3138 num_recs = is_native ? sec->num_info : bswap_32(sec->num_info); in btf_ext_bswap_info_sec()
3142 for (i = 0; i < num_recs; i++, p += rec_size) in btf_ext_bswap_info_sec()
3145 info_left -= sec_hdrlen + (__u64)rec_size * num_recs; in btf_ext_bswap_info_sec()