| /fs/xfs/libxfs/ |
| D | xfs_iext_tree.c | 119 void *ptrs[KEYS_PER_NODE]; member
168 node = node->ptrs[0]; in xfs_iext_find_first_leaf()
187 if (!node->ptrs[i]) in xfs_iext_find_last_leaf()
189 node = node->ptrs[i - 1]; in xfs_iext_find_last_leaf()
320 node = node->ptrs[i - 1]; in xfs_iext_find_level()
408 node->ptrs[0] = prev; in xfs_iext_grow()
415 node->ptrs[0] = prev; in xfs_iext_grow()
443 node = node->ptrs[i - 1]; in xfs_iext_update_node()
473 new->ptrs[i] = node->ptrs[nr_keep + i]; in xfs_iext_split_node()
476 node->ptrs[nr_keep + i] = NULL; in xfs_iext_split_node()
[all …]
|
| /fs/nilfs2/ |
| D | bmap.c | 109 __u64 ptrs[NILFS_BMAP_SMALL_HIGH + 1]; in nilfs_bmap_do_insert() local
116 bmap, keys, ptrs, NILFS_BMAP_SMALL_HIGH + 1); in nilfs_bmap_do_insert()
120 bmap, key, ptr, keys, ptrs, n); in nilfs_bmap_do_insert()
164 __u64 ptrs[NILFS_BMAP_LARGE_LOW + 1]; in nilfs_bmap_do_delete() local
171 bmap, keys, ptrs, NILFS_BMAP_LARGE_LOW + 1); in nilfs_bmap_do_delete()
175 bmap, key, keys, ptrs, n); in nilfs_bmap_do_delete()
|
| D | direct.c | 203 __u64 *keys, __u64 *ptrs, int nitems) in nilfs_direct_gather_data() argument
216 ptrs[n] = ptr; in nilfs_direct_gather_data()
224 __u64 key, __u64 *keys, __u64 *ptrs, int n) in nilfs_direct_delete_and_convert() argument
245 cpu_to_le64(ptrs[j]) : in nilfs_direct_delete_and_convert()
|
| D | btree.c | 164 const __u64 *keys, const __u64 *ptrs) in nilfs_btree_node_init() argument
178 dptrs[i] = cpu_to_le64(ptrs[i]); in nilfs_btree_node_init()
1687 __u64 *keys, __u64 *ptrs, int nitems) in nilfs_btree_gather_data() argument
1726 ptrs[i] = le64_to_cpu(dptrs[i]); in nilfs_btree_gather_data()
1795 const __u64 *keys, const __u64 *ptrs, in nilfs_btree_commit_convert_and_insert() argument
1823 nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs); in nilfs_btree_commit_convert_and_insert()
1845 keys, ptrs); in nilfs_btree_commit_convert_and_insert()
1867 const __u64 *keys, const __u64 *ptrs, int n) in nilfs_btree_convert_and_insert() argument
1891 nilfs_btree_commit_convert_and_insert(btree, key, ptr, keys, ptrs, n, in nilfs_btree_convert_and_insert()
|
| /fs/ext4/ |
| D | indirect.c | 78 int ptrs = EXT4_ADDR_PER_BLOCK(inode->i_sb); in ext4_block_to_path() local
81 indirect_blocks = ptrs, in ext4_block_to_path()
92 final = ptrs; in ext4_block_to_path()
96 offsets[n++] = i_block & (ptrs - 1); in ext4_block_to_path()
97 final = ptrs; in ext4_block_to_path()
98 } else if (((i_block -= double_blocks) >> (ptrs_bits * 2)) < ptrs) { in ext4_block_to_path()
101 offsets[n++] = (i_block >> ptrs_bits) & (ptrs - 1); in ext4_block_to_path()
102 offsets[n++] = i_block & (ptrs - 1); in ext4_block_to_path()
103 final = ptrs; in ext4_block_to_path()
110 *boundary = final - 1 - (i_block & (ptrs - 1)); in ext4_block_to_path()
|
| /fs/ext2/ |
| D | inode.c | 166 int ptrs = EXT2_ADDR_PER_BLOCK(inode->i_sb); in ext2_block_to_path() local
169 indirect_blocks = ptrs, in ext2_block_to_path()
183 final = ptrs; in ext2_block_to_path()
187 offsets[n++] = i_block & (ptrs - 1); in ext2_block_to_path()
188 final = ptrs; in ext2_block_to_path()
189 } else if (((i_block -= double_blocks) >> (ptrs_bits * 2)) < ptrs) { in ext2_block_to_path()
192 offsets[n++] = (i_block >> ptrs_bits) & (ptrs - 1); in ext2_block_to_path()
193 offsets[n++] = i_block & (ptrs - 1); in ext2_block_to_path()
194 final = ptrs; in ext2_block_to_path()
200 *boundary = final - 1 - (i_block & (ptrs - 1)); in ext2_block_to_path()
|
| /fs/ufs/ |
| D | inode.c | 49 int ptrs = uspi->s_apb; in ufs_block_to_path() local
52 indirect_blocks = ptrs, in ufs_block_to_path()
57 UFSD("ptrs=uspi->s_apb = %d,double_blocks=%ld \n",ptrs,double_blocks); in ufs_block_to_path()
66 offsets[n++] = i_block & (ptrs - 1); in ufs_block_to_path()
67 } else if (((i_block -= double_blocks) >> (ptrs_bits * 2)) < ptrs) { in ufs_block_to_path()
70 offsets[n++] = (i_block >> ptrs_bits) & (ptrs - 1); in ufs_block_to_path()
71 offsets[n++] = i_block & (ptrs - 1); in ufs_block_to_path()
|
| /fs/gfs2/ |
| D | bmap.c | 454 unsigned int ptrs);
490 unsigned int ptrs; in gfs2_walk_metadata() local
494 ptrs = (hgt >= 1 ? sdp->sd_inptrs : sdp->sd_diptrs) - start; in gfs2_walk_metadata()
495 len = ptrs * factor; in gfs2_walk_metadata()
497 ptrs = DIV_ROUND_UP_ULL(max_len, factor); in gfs2_walk_metadata()
498 status = walker(mp, ptrs); in gfs2_walk_metadata()
504 ptrs = mp->mp_list[hgt] - start; in gfs2_walk_metadata()
505 len = ptrs * factor; in gfs2_walk_metadata()
550 unsigned int ptrs) in gfs2_hole_walker() argument
557 end = start + ptrs; in gfs2_hole_walker()
|
| /fs/btrfs/ |
| D | ctree.h | 359 struct btrfs_key_ptr ptrs[]; member
1934 ptr = offsetof(struct btrfs_node, ptrs) + in btrfs_node_blockptr()
1943 ptr = offsetof(struct btrfs_node, ptrs) + in btrfs_set_node_blockptr()
1951 ptr = offsetof(struct btrfs_node, ptrs) + in btrfs_node_ptr_generation()
1960 ptr = offsetof(struct btrfs_node, ptrs) + in btrfs_set_node_ptr_generation()
1967 return offsetof(struct btrfs_node, ptrs) + in btrfs_node_key_ptr_offset()
|
| D | check-integrity.c | 1057 key_ptr_offset = (uintptr_t)(nodehdr->ptrs + sf->i) - in btrfsic_process_metablock()
|
| D | ctree.c | 836 offsetof(struct btrfs_node, ptrs), in btrfs_bin_search()
|