Home
last modified time | relevance | path

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

/linux-6.3-rc2/fs/hfs/
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 …]
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()
A Dbtree.h61 u16 num_recs; member
138 __be16 num_recs; /* (V) The number of records in this node */ member
A Dbnode.c152 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
155 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
347 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
374 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
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.3-rc2/fs/hfsplus/
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 …]
A Dbfind.c124 e = bnode->num_recs - 1; in __hfs_brec_find()
245 fd->record = bnode->num_recs - 1; in hfs_brec_goto()
261 while (cnt >= bnode->num_recs - fd->record) { in hfs_brec_goto()
262 cnt -= bnode->num_recs - fd->record; in hfs_brec_goto()
A Dbnode.c301 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
304 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
498 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
525 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
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()
A Dhfsplus_raw.h156 __be16 num_recs; member
A Dhfsplus_fs.h111 u16 num_recs; member
A Dxattr.c75 desc->num_recs = cpu_to_be16(HFSPLUS_BTREE_HDR_NODE_RECS_COUNT); in hfsplus_init_header_node()
/linux-6.3-rc2/fs/ocfs2/
A Dxattr.c6216 int *num_recs, in ocfs2_value_metas_in_xattr_header() argument
6286 int ret, meta_add = 0, num_recs = 0; in ocfs2_reflink_lock_xattr_allocators() local
6293 &meta_add, credits, &num_recs, in ocfs2_reflink_lock_xattr_allocators()
6308 num_recs = num_recs / ocfs2_refcount_recs_per_rb(osb->sb) * 2; in ocfs2_reflink_lock_xattr_allocators()
6309 meta_add += num_recs; in ocfs2_reflink_lock_xattr_allocators()
6310 *credits += num_recs + num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS; in ocfs2_reflink_lock_xattr_allocators()
6704 int num_recs; member
6735 &metas->credits, &metas->num_recs, in ocfs2_calc_value_tree_metas()
6780 metas.num_recs = in ocfs2_lock_reflink_xattr_rec_allocators()
6783 metas.num_metas += metas.num_recs; in ocfs2_lock_reflink_xattr_rec_allocators()
[all …]
A Dalloc.c1689 int size, num_recs = le16_to_cpu(el->l_next_free_rec); in ocfs2_remove_empty_extent() local
1691 BUG_ON(num_recs == 0); in ocfs2_remove_empty_extent()
1694 num_recs--; in ocfs2_remove_empty_extent()
1695 size = num_recs * sizeof(struct ocfs2_extent_rec); in ocfs2_remove_empty_extent()
1697 memset(&el->l_recs[num_recs], 0, in ocfs2_remove_empty_extent()
1699 el->l_next_free_rec = cpu_to_le16(num_recs); in ocfs2_remove_empty_extent()
6249 unsigned int clusters, num_recs, start_cluster; in ocfs2_complete_truncate_log_recovery() local
6261 num_recs = le16_to_cpu(tl->tl_used); in ocfs2_complete_truncate_log_recovery()
6264 num_recs); in ocfs2_complete_truncate_log_recovery()
6267 for(i = 0; i < num_recs; i++) { in ocfs2_complete_truncate_log_recovery()
/linux-6.3-rc2/fs/xfs/libxfs/
A Dxfs_bmap.c405 xfs_extnum_t num_recs; in xfs_bmap_check_leaf_extents() local
408 num_recs = xfs_btree_get_numrecs(block); in xfs_bmap_check_leaf_extents()
428 for (j = 1; j < num_recs; j++) { in xfs_bmap_check_leaf_extents()
437 i += num_recs; in xfs_bmap_check_leaf_extents()
1099 xfs_extnum_t num_recs; in xfs_iread_bmbt_block() local
1107 num_recs = xfs_btree_get_numrecs(block); in xfs_iread_bmbt_block()
1108 if (unlikely(ir->loaded + num_recs > ifp->if_nextents)) { in xfs_iread_bmbt_block()
1118 for (j = 0; j < num_recs; j++, frp++, ir->loaded++) { in xfs_iread_bmbt_block()

Completed in 81 milliseconds