| /fs/hfs/ |
| 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()
111 hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs); in hfs_brec_insert()
185 end_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_remove()
194 if (!--node->num_recs) { in hfs_brec_remove()
207 hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs); in hfs_brec_remove()
234 int num_recs, new_rec_off, new_off, old_rec_off; in hfs_bnode_split() local
262 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
264 num_recs = 1; in hfs_bnode_split()
270 if (++num_recs < node->num_recs) in hfs_bnode_split()
[all …]
|
| D | bfind.c | 51 e = bnode->num_recs - 1; in __hfs_brec_find()
175 fd->record = bnode->num_recs - 1; in hfs_brec_goto()
191 while (cnt >= bnode->num_recs - fd->record) { in hfs_brec_goto()
192 cnt -= bnode->num_recs - fd->record; in hfs_brec_goto()
|
| D | bnode.c | 145 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
148 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
345 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
372 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
|
| D | btree.h | 53 u16 num_recs; member
129 __be16 num_recs; /* (V) The number of records in this node */ member
|
| D | btree.c | 206 node->num_recs = 1; in hfs_bmap_new_bmap()
212 desc.num_recs = cpu_to_be16(1); in hfs_bmap_new_bmap()
|
| /fs/hfsplus/ |
| D | brec.c | 90 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
107 node->num_recs++; in hfs_brec_insert()
110 offsetof(struct hfs_bnode_desc, num_recs), in hfs_brec_insert()
111 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()
210 offsetof(struct hfs_bnode_desc, num_recs), in hfs_brec_remove()
211 node->num_recs); in hfs_brec_remove()
238 int num_recs, new_rec_off, new_off, old_rec_off; in hfs_bnode_split() local
266 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
[all …]
|
| D | bfind.c | 125 e = bnode->num_recs - 1; in __hfs_brec_find()
246 fd->record = bnode->num_recs - 1; in hfs_brec_goto()
262 while (cnt >= bnode->num_recs - fd->record) { in hfs_brec_goto()
263 cnt -= bnode->num_recs - fd->record; in hfs_brec_goto()
|
| D | bnode.c | 309 desc.type, desc.height, be16_to_cpu(desc.num_recs)); in hfs_bnode_dump()
312 for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { in hfs_bnode_dump()
515 node->num_recs = be16_to_cpu(desc->num_recs); in hfs_bnode_find()
542 for (i = 1; i <= node->num_recs; off = next_off, i++) { in hfs_bnode_find()
|
| D | btree.c | 216 node->num_recs = 1; in hfs_bmap_new_bmap()
222 desc.num_recs = cpu_to_be16(1); in hfs_bmap_new_bmap()
|
| D | hfsplus_raw.h | 154 __be16 num_recs; member
|
| D | hfsplus_fs.h | 110 u16 num_recs; member
|
| /fs/ocfs2/ |
| D | xattr.c | 6199 int *num_recs, in ocfs2_value_metas_in_xattr_header() argument
6230 *num_recs += le16_to_cpu(xv->xr_list.l_next_free_rec); in ocfs2_value_metas_in_xattr_header()
6232 *num_recs += ocfs2_clusters_for_bytes(sb, in ocfs2_value_metas_in_xattr_header()
6270 int ret, meta_add = 0, num_recs = 0; in ocfs2_reflink_lock_xattr_allocators() local
6277 &meta_add, credits, &num_recs, in ocfs2_reflink_lock_xattr_allocators()
6292 num_recs = num_recs / ocfs2_refcount_recs_per_rb(osb->sb) * 2; in ocfs2_reflink_lock_xattr_allocators()
6293 meta_add += num_recs; in ocfs2_reflink_lock_xattr_allocators()
6294 *credits += num_recs + num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS; in ocfs2_reflink_lock_xattr_allocators()
6678 int num_recs; member
6709 &metas->credits, &metas->num_recs, in ocfs2_calc_value_tree_metas()
[all …]
|
| D | alloc.c | 1679 int size, num_recs = le16_to_cpu(el->l_next_free_rec); in ocfs2_remove_empty_extent() local
1681 BUG_ON(num_recs == 0); in ocfs2_remove_empty_extent()
1684 num_recs--; in ocfs2_remove_empty_extent()
1685 size = num_recs * sizeof(struct ocfs2_extent_rec); in ocfs2_remove_empty_extent()
1687 memset(&el->l_recs[num_recs], 0, in ocfs2_remove_empty_extent()
1689 el->l_next_free_rec = cpu_to_le16(num_recs); in ocfs2_remove_empty_extent()
6151 unsigned int clusters, num_recs, start_cluster; in ocfs2_complete_truncate_log_recovery() local
6163 num_recs = le16_to_cpu(tl->tl_used); in ocfs2_complete_truncate_log_recovery()
6166 num_recs); in ocfs2_complete_truncate_log_recovery()
6169 for(i = 0; i < num_recs; i++) { in ocfs2_complete_truncate_log_recovery()
|
| /fs/xfs/ |
| D | xfs_bmap.c | 629 xfs_extnum_t num_recs; in xfs_bmap_check_leaf_extents() local
632 num_recs = xfs_btree_get_numrecs(block); in xfs_bmap_check_leaf_extents()
652 for (j = 1; j < num_recs; j++) { in xfs_bmap_check_leaf_extents()
661 i += num_recs; in xfs_bmap_check_leaf_extents()
1600 xfs_extnum_t num_recs; in xfs_bmap_read_extents() local
1603 num_recs = xfs_btree_get_numrecs(block); in xfs_bmap_read_extents()
1604 if (unlikely(i + num_recs > room)) { in xfs_bmap_read_extents()
1605 ASSERT(i + num_recs <= room); in xfs_bmap_read_extents()
1628 for (j = 0; j < num_recs; j++, i++, frp++) { in xfs_bmap_read_extents()
1640 start, num_recs))) { in xfs_bmap_read_extents()
|