| /linux/fs/hfsplus/ |
| H A D | brec.c | 92 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 * in hfs_bnode_split()
[all...] |
| H A D | bfind.c | 113 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 D | bnode.c | 399 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
402 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
596 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
623 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
|
| H A D | btree.c | 330 node->num_recs = 1; in hfs_bmap_new_bmap()
336 desc.num_recs = cpu_to_be16(1); in hfs_bmap_new_bmap()
|
| H A D | hfsplus_raw.h | 156 __be16 num_recs; member
|
| H A D | hfsplus_fs.h | 112 u16 num_recs; member
|
| /linux/fs/hfs/ |
| H A D | brec.c | 94 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 * in hfs_bnode_split()
[all...] |
| H A D | bfind.c | 67 e = bnode->num_recs - 1; in __hfs_brec_find()
191 fd->record = bnode->num_recs - 1; in hfs_brec_goto()
207 while (cnt >= bnode->num_recs - fd->record) { in hfs_brec_goto()
208 cnt -= bnode->num_recs - fd->record; in hfs_brec_goto()
|
| H A D | btree.h | 61 u16 num_recs; member
138 __be16 num_recs; /* (V) The number of records in this node */ member
|
| H A D | bnode.c | 250 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
253 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
445 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
472 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
|
| H A D | btree.c | 245 node->num_recs = 1; in hfs_bmap_new_bmap()
251 desc.num_recs = cpu_to_be16(1); in hfs_bmap_new_bmap()
|
| /linux/fs/ocfs2/ |
| H A D | xattr.c | 6211 int *num_recs, in ocfs2_value_metas_in_xattr_header() argument
6241 *num_recs += le16_to_cpu(xv->xr_list.l_next_free_rec); in ocfs2_value_metas_in_xattr_header()
6243 *num_recs += ocfs2_clusters_for_bytes(sb, in ocfs2_value_metas_in_xattr_header()
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()
6297 * We need to add/modify num_recs in refcount tree, so just calculate 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 in ocfs2_reflink_lock_xattr_allocators()
6690 int num_recs; global() member
[all...] |
| H A D | alloc.c | 1696 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; in ocfs2_complete_truncate_log_recovery()
[all...] |
| /linux/fs/xfs/libxfs/ |
| H A D | xfs_bmap.c | 431 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/tools/lib/bpf/ |
| H A D | btf.c | 3191 __u32 i, num_recs; in btf_ext_bswap_info_sec() local
3194 num_recs = is_native ? sec->num_info : bswap_32(sec->num_info); in btf_ext_bswap_info_sec()
3198 for (i = 0; i < num_recs; i++, p += rec_size) in btf_ext_bswap_info_sec()
3201 info_left -= sec_hdrlen + (__u64)rec_size * num_recs; in btf_ext_bswap_info_sec()
|