Home
last modified time | relevance | path

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

/linux-4.19.296/fs/hfsplus/
Dbrec.c92 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
109 node->num_recs++; in hfs_brec_insert()
112 offsetof(struct hfs_bnode_desc, num_recs), in hfs_brec_insert()
113 node->num_recs); in hfs_brec_insert()
189 end_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_remove()
198 if (!--node->num_recs) { in hfs_brec_remove()
212 offsetof(struct hfs_bnode_desc, num_recs), in hfs_brec_remove()
213 node->num_recs); in hfs_brec_remove()
240 int num_recs, new_rec_off, new_off, old_rec_off; in hfs_bnode_split() local
268 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
[all …]
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()
Dbnode.c308 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
311 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
509 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
536 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
Dbtree.c329 node->num_recs = 1; in hfs_bmap_new_bmap()
335 desc.num_recs = cpu_to_be16(1); in hfs_bmap_new_bmap()
Dhfsplus_raw.h156 __be16 num_recs; member
Dhfsplus_fs.h111 u16 num_recs; member
Dxattr.c75 desc->num_recs = cpu_to_be16(HFSPLUS_BTREE_HDR_NODE_RECS_COUNT); in hfsplus_init_header_node()
/linux-4.19.296/fs/hfs/
Dbrec.c94 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
111 node->num_recs++; in hfs_brec_insert()
113 hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs); in hfs_brec_insert()
187 end_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_remove()
196 if (!--node->num_recs) { in hfs_brec_remove()
209 hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs); in hfs_brec_remove()
236 int num_recs, new_rec_off, new_off, old_rec_off; in hfs_bnode_split() local
264 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
266 num_recs = 1; in hfs_bnode_split()
272 if (++num_recs < node->num_recs) in hfs_bnode_split()
[all …]
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()
Dbtree.h61 u16 num_recs; member
138 __be16 num_recs; /* (V) The number of records in this node */ member
Dbnode.c159 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
162 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
357 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
384 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
Dbtree.c207 node->num_recs = 1; in hfs_bmap_new_bmap()
213 desc.num_recs = cpu_to_be16(1); in hfs_bmap_new_bmap()
/linux-4.19.296/fs/ocfs2/
Dxattr.c6226 int *num_recs, in ocfs2_value_metas_in_xattr_header() argument
6256 *num_recs += le16_to_cpu(xv->xr_list.l_next_free_rec); in ocfs2_value_metas_in_xattr_header()
6258 *num_recs += ocfs2_clusters_for_bytes(sb, in ocfs2_value_metas_in_xattr_header()
6296 int ret, meta_add = 0, num_recs = 0; in ocfs2_reflink_lock_xattr_allocators() local
6303 &meta_add, credits, &num_recs, in ocfs2_reflink_lock_xattr_allocators()
6318 num_recs = num_recs / ocfs2_refcount_recs_per_rb(osb->sb) * 2; in ocfs2_reflink_lock_xattr_allocators()
6319 meta_add += num_recs; in ocfs2_reflink_lock_xattr_allocators()
6320 *credits += num_recs + num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS; in ocfs2_reflink_lock_xattr_allocators()
6714 int num_recs; member
6745 &metas->credits, &metas->num_recs, in ocfs2_calc_value_tree_metas()
[all …]
Dalloc.c1706 int size, num_recs = le16_to_cpu(el->l_next_free_rec); in ocfs2_remove_empty_extent() local
1708 BUG_ON(num_recs == 0); in ocfs2_remove_empty_extent()
1711 num_recs--; in ocfs2_remove_empty_extent()
1712 size = num_recs * sizeof(struct ocfs2_extent_rec); in ocfs2_remove_empty_extent()
1714 memset(&el->l_recs[num_recs], 0, in ocfs2_remove_empty_extent()
1716 el->l_next_free_rec = cpu_to_le16(num_recs); in ocfs2_remove_empty_extent()
6253 unsigned int clusters, num_recs, start_cluster; in ocfs2_complete_truncate_log_recovery() local
6265 num_recs = le16_to_cpu(tl->tl_used); in ocfs2_complete_truncate_log_recovery()
6268 num_recs); in ocfs2_complete_truncate_log_recovery()
6271 for(i = 0; i < num_recs; i++) { in ocfs2_complete_truncate_log_recovery()
/linux-4.19.296/fs/xfs/libxfs/
Dxfs_bmap.c409 xfs_extnum_t num_recs; in xfs_bmap_check_leaf_extents() local
412 num_recs = xfs_btree_get_numrecs(block); in xfs_bmap_check_leaf_extents()
432 for (j = 1; j < num_recs; j++) { in xfs_bmap_check_leaf_extents()
441 i += num_recs; in xfs_bmap_check_leaf_extents()
1230 xfs_extnum_t num_recs; in xfs_iread_extents() local
1232 num_recs = xfs_btree_get_numrecs(block); in xfs_iread_extents()
1233 if (unlikely(i + num_recs > nextents)) { in xfs_iread_extents()
1254 for (j = 0; j < num_recs; j++, frp++, i++) { in xfs_iread_extents()