| /fs/quota/ |
| D | kqid.c | 12 bool qid_eq(struct kqid left, struct kqid right) in qid_eq() argument
14 if (left.type != right.type) in qid_eq()
18 return uid_eq(left.uid, right.uid); in qid_eq()
20 return gid_eq(left.gid, right.gid); in qid_eq()
22 return projid_eq(left.projid, right.projid); in qid_eq()
36 bool qid_lt(struct kqid left, struct kqid right) in qid_lt() argument
38 if (left.type < right.type) in qid_lt()
40 if (left.type > right.type) in qid_lt()
44 return uid_lt(left.uid, right.uid); in qid_lt()
46 return gid_lt(left.gid, right.gid); in qid_lt()
[all …]
|
| /fs/btrfs/ |
| D | ctree.c | 1872 struct extent_buffer *right = NULL; in balance_level() local
1963 right = read_node_slot(root, parent, pslot + 1); in balance_level()
1964 if (IS_ERR(right)) in balance_level()
1965 right = NULL; in balance_level()
1967 if (right) { in balance_level()
1968 btrfs_tree_lock(right); in balance_level()
1969 btrfs_set_lock_blocking(right); in balance_level()
1970 wret = btrfs_cow_block(trans, root, right, in balance_level()
1971 parent, pslot + 1, &right); in balance_level()
1989 if (right) { in balance_level()
[all …]
|
| D | free-space-tree.c | 896 goto right; in add_free_space_extent()
910 goto right; in add_free_space_extent()
933 right: in add_free_space_extent()
|
| /fs/xfs/libxfs/ |
| D | xfs_refcount.c | 351 struct xfs_refcount_irec *right, in xfs_refcount_merge_center_extents() argument
360 cur->bc_private.a.agno, left, center, right); in xfs_refcount_merge_center_extents()
471 struct xfs_refcount_irec *right, in xfs_refcount_merge_right_extent() argument
480 cur->bc_private.a.agno, cright, right); in xfs_refcount_merge_right_extent()
502 error = xfs_refcount_lookup_le(cur, right->rc_startblock, in xfs_refcount_merge_right_extent()
508 right->rc_startblock -= cright->rc_blockcount; in xfs_refcount_merge_right_extent()
509 right->rc_blockcount += cright->rc_blockcount; in xfs_refcount_merge_right_extent()
510 error = xfs_refcount_update(cur, right); in xfs_refcount_merge_right_extent()
616 struct xfs_refcount_irec *right, in xfs_refcount_find_right_extents() argument
626 right->rc_startblock = cright->rc_startblock = NULLAGBLOCK; in xfs_refcount_find_right_extents()
[all …]
|
| D | xfs_btree.c | 876 xfs_fsblock_t right = be64_to_cpu(block->bb_u.l.bb_rightsib); in xfs_btree_readahead_lblock() local
884 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLFSBLOCK) { in xfs_btree_readahead_lblock()
885 xfs_btree_reada_bufl(cur->bc_mp, right, 1, in xfs_btree_readahead_lblock()
901 xfs_agblock_t right = be32_to_cpu(block->bb_u.s.bb_rightsib); in xfs_btree_readahead_sblock() local
910 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLAGBLOCK) { in xfs_btree_readahead_sblock()
912 right, 1, cur->bc_ops->buf_ops); in xfs_btree_readahead_sblock()
2288 struct xfs_btree_block *right; /* right btree block */ in xfs_btree_lshift() local
2306 right = xfs_btree_get_block(cur, level, &rbp); in xfs_btree_lshift()
2309 error = xfs_btree_check_block(cur, right, level, rbp); in xfs_btree_lshift()
2315 xfs_btree_get_sibling(cur, right, &lptr, XFS_BB_LEFTSIB); in xfs_btree_lshift()
[all …]
|
| D | xfs_bmap.c | 2844 xfs_bmbt_irec_t right; /* right neighbor extent entry */ in xfs_bmap_add_extent_hole_delay() local
2871 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx), &right); in xfs_bmap_add_extent_hole_delay()
2873 if (isnullstartblock(right.br_startblock)) in xfs_bmap_add_extent_hole_delay()
2887 new->br_startoff + new->br_blockcount == right.br_startoff && in xfs_bmap_add_extent_hole_delay()
2888 new->br_blockcount + right.br_blockcount <= MAXEXTLEN && in xfs_bmap_add_extent_hole_delay()
2891 right.br_blockcount <= MAXEXTLEN))) in xfs_bmap_add_extent_hole_delay()
2906 right.br_blockcount; in xfs_bmap_add_extent_hole_delay()
2912 startblockval(right.br_startblock); in xfs_bmap_add_extent_hole_delay()
2949 temp = new->br_blockcount + right.br_blockcount; in xfs_bmap_add_extent_hole_delay()
2951 startblockval(right.br_startblock); in xfs_bmap_add_extent_hole_delay()
[all …]
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 112 struct pnfs_block_extent *right = ext_tree_next(be); in ext_try_to_merge_right() local
114 if (right && ext_can_merge(be, right)) { in ext_try_to_merge_right()
115 be->be_length += right->be_length; in ext_try_to_merge_right()
116 rb_erase(&right->be_node, root); in ext_try_to_merge_right()
117 nfs4_put_deviceid_node(right->be_device); in ext_try_to_merge_right()
118 kfree(right); in ext_try_to_merge_right()
450 struct pnfs_block_extent *right = ext_tree_next(be); in ext_tree_mark_written() local
452 if (right && ext_can_merge(be, right)) { in ext_tree_mark_written()
457 right->be_f_offset -= diff; in ext_tree_mark_written()
458 right->be_v_offset -= diff; in ext_tree_mark_written()
[all …]
|
| /fs/nilfs2/ |
| D | btree.c | 192 struct nilfs_btree_node *right, in nilfs_btree_node_move_left() argument
203 rdkeys = nilfs_btree_node_dkeys(right); in nilfs_btree_node_move_left()
204 rdptrs = nilfs_btree_node_dptrs(right, rncmax); in nilfs_btree_node_move_left()
205 rnchildren = nilfs_btree_node_get_nchildren(right); in nilfs_btree_node_move_left()
215 nilfs_btree_node_set_nchildren(right, rnchildren); in nilfs_btree_node_move_left()
220 struct nilfs_btree_node *right, in nilfs_btree_node_move_right() argument
231 rdkeys = nilfs_btree_node_dkeys(right); in nilfs_btree_node_move_right()
232 rdptrs = nilfs_btree_node_dptrs(right, rncmax); in nilfs_btree_node_move_right()
233 rnchildren = nilfs_btree_node_get_nchildren(right); in nilfs_btree_node_move_right()
243 nilfs_btree_node_set_nchildren(right, rnchildren); in nilfs_btree_node_move_right()
[all …]
|
| /fs/reiserfs/ |
| D | procfs.c | 279 __u32 right; in show_oidmap() local
281 right = (i == mapsize - 1) ? MAX_KEY_OBJECTID : MAP(i + 1); in show_oidmap()
283 (i & 1) ? "free" : "used", MAP(i), right); in show_oidmap()
285 total_used += right - MAP(i); in show_oidmap()
|
| D | README | 25 right to decline to allow him to license your code contribution other
131 Chris Mason dived right into our code, and in just a few months produced
|
| D | do_balan.c | 1721 int right = (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) - in check_after_balance_leaf() local
1736 right); in check_after_balance_leaf()
|
| /fs/ncpfs/ |
| D | file.c | 32 int ncp_make_open(struct inode *inode, int right) in ncp_make_open() argument
61 switch (right) { in ncp_make_open()
89 if (access == right || access == O_RDWR) { in ncp_make_open()
|
| /fs/ntfs/ |
| D | runlist.c | 221 bool right = false; /* Right end of @src needs merging. */ in ntfs_rl_append() local
229 right = ntfs_are_rl_mergeable(src + ssize - 1, dst + loc + 1); in ntfs_rl_append()
232 dst = ntfs_rl_realloc(dst, dsize, dsize + ssize - right); in ntfs_rl_append()
241 if (right) in ntfs_rl_append()
248 ntfs_rl_mm(dst, marker, loc + 1 + right, dsize - (loc + 1 + right)); in ntfs_rl_append()
386 bool right = false; /* Right end of @src needs merging. */ in ntfs_rl_replace() local
395 right = ntfs_are_rl_mergeable(src + ssize - 1, dst + loc + 1); in ntfs_rl_replace()
402 delta = ssize - 1 - left - right; in ntfs_rl_replace()
414 if (right) in ntfs_rl_replace()
426 tail = loc + right + 1; in ntfs_rl_replace()
|
| /fs/befs/ |
| D | befs_fs_types.h | 241 fs64 right; member
249 befs_off_t right; member
|
| D | btree.c | 218 node->head.right = fs64_to_cpu(sb, node->od_node->right); in befs_bt_read_node()
465 if (this_node->head.right == BEFS_BT_INVAL) { in befs_btree_read()
478 node_off = this_node->head.right; in befs_btree_read()
|
| D | debug.c | 251 befs_debug(sb, " right %016LX", fs64_to_cpu(sb, node->right)); in befs_dump_index_node()
|
| D | ChangeLog | 27 * Did the string comparison really right this time (btree.c) [WD]
216 * Thats right. New versioning scheme.
|
| /fs/ |
| D | locks.c | 993 struct file_lock *right = NULL; in posix_lock_inode() local
1112 right = fl; in posix_lock_inode()
1149 if (right && left == right && !new_fl2) in posix_lock_inode()
1169 if (right) { in posix_lock_inode()
1170 if (left == right) { in posix_lock_inode()
1176 locks_copy_lock(left, right); in posix_lock_inode()
1179 right->fl_start = request->fl_end + 1; in posix_lock_inode()
1180 locks_wake_up_blocks(right); in posix_lock_inode()
|
| /fs/hfs/ |
| D | hfs.h | 101 __be16 right; member
|
| /fs/hfsplus/ |
| D | hfsplus_raw.h | 230 __be16 right; member
|
| /fs/ocfs2/ |
| D | alloc.h | 325 struct ocfs2_path *right);
|
| D | alloc.c | 814 struct ocfs2_extent_rec *right) in ocfs2_extents_adjacent() argument
821 return (left_range == le32_to_cpu(right->e_cpos)); in ocfs2_extents_adjacent()
1734 struct ocfs2_path *right) in ocfs2_find_subtree_root() argument
1741 BUG_ON(path_root_bh(left) != path_root_bh(right)); in ocfs2_find_subtree_root()
1753 left->p_tree_depth, right->p_tree_depth, in ocfs2_find_subtree_root()
1755 (unsigned long long)path_leaf_bh(right)->b_blocknr); in ocfs2_find_subtree_root()
1757 right->p_node[i].bh->b_blocknr); in ocfs2_find_subtree_root()
|
| /fs/kernfs/ |
| D | dir.c | 318 const struct kernfs_node *right) in kernfs_sd_compare() argument
320 return kernfs_name_compare(left->hash, left->name, left->ns, right); in kernfs_sd_compare()
|
| /fs/jffs2/ |
| D | README.Locking | 17 the garbage collector will obtain this right at the beginning of
|