| /fs/quota/ |
| D | kqid.c | 13 bool qid_eq(struct kqid left, struct kqid right) in qid_eq() argument
15 if (left.type != right.type) in qid_eq()
19 return uid_eq(left.uid, right.uid); in qid_eq()
21 return gid_eq(left.gid, right.gid); in qid_eq()
23 return projid_eq(left.projid, right.projid); in qid_eq()
37 bool qid_lt(struct kqid left, struct kqid right) in qid_lt() argument
39 if (left.type < right.type) in qid_lt()
41 if (left.type > right.type) in qid_lt()
45 return uid_lt(left.uid, right.uid); in qid_lt()
47 return gid_lt(left.gid, right.gid); in qid_lt()
[all …]
|
| /fs/unicode/ |
| D | mkutf8data.c | 368 void *right; member
392 node = node->right; in lookup()
394 leaf = node->right; in lookup()
442 node->left, node->right, in tree_walk()
445 if (!(node->left && node->right)) in tree_walk()
467 assert(node->right); in tree_walk()
468 tree->leaf_print(node->right, in tree_walk()
471 } else if (node->right) { in tree_walk()
474 node = node->right; in tree_walk()
498 node->left = node->right = NULL; in alloc_node()
[all …]
|
| /fs/btrfs/ |
| D | ctree.c | 1849 struct extent_buffer *right = NULL; in balance_level() local
1942 right = btrfs_read_node_slot(parent, pslot + 1); in balance_level()
1943 if (IS_ERR(right)) in balance_level()
1944 right = NULL; in balance_level()
1946 if (right) { in balance_level()
1947 __btrfs_tree_lock(right, BTRFS_NESTING_RIGHT); in balance_level()
1948 btrfs_set_lock_blocking_write(right); in balance_level()
1949 wret = btrfs_cow_block(trans, root, right, in balance_level()
1950 parent, pslot + 1, &right, in balance_level()
1969 if (right) { in balance_level()
[all …]
|
| D | free-space-tree.c | 887 goto right; in add_free_space_extent()
901 goto right; in add_free_space_extent()
924 right: in add_free_space_extent()
|
| /fs/xfs/libxfs/ |
| D | xfs_refcount.c | 406 struct xfs_refcount_irec *right, in xfs_refcount_merge_center_extents() argument
414 cur->bc_ag.agno, left, center, right); in xfs_refcount_merge_center_extents()
543 struct xfs_refcount_irec *right, in xfs_refcount_merge_right_extent() argument
551 cur->bc_ag.agno, cright, right); in xfs_refcount_merge_right_extent()
577 error = xfs_refcount_lookup_le(cur, right->rc_startblock, in xfs_refcount_merge_right_extent()
586 right->rc_startblock -= cright->rc_blockcount; in xfs_refcount_merge_right_extent()
587 right->rc_blockcount += cright->rc_blockcount; in xfs_refcount_merge_right_extent()
588 error = xfs_refcount_update(cur, right); in xfs_refcount_merge_right_extent()
699 struct xfs_refcount_irec *right, in xfs_refcount_find_right_extents() argument
709 right->rc_startblock = cright->rc_startblock = NULLAGBLOCK; in xfs_refcount_find_right_extents()
[all …]
|
| D | xfs_btree.c | 865 xfs_fsblock_t right = be64_to_cpu(block->bb_u.l.bb_rightsib); in xfs_btree_readahead_lblock() local
873 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLFSBLOCK) { in xfs_btree_readahead_lblock()
874 xfs_btree_reada_bufl(cur->bc_mp, right, 1, in xfs_btree_readahead_lblock()
890 xfs_agblock_t right = be32_to_cpu(block->bb_u.s.bb_rightsib); in xfs_btree_readahead_sblock() local
899 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLAGBLOCK) { in xfs_btree_readahead_sblock()
901 right, 1, cur->bc_ops->buf_ops); in xfs_btree_readahead_sblock()
2254 struct xfs_btree_block *right; /* right btree block */ in xfs_btree_lshift() local
2269 right = xfs_btree_get_block(cur, level, &rbp); in xfs_btree_lshift()
2272 error = xfs_btree_check_block(cur, right, level, rbp); in xfs_btree_lshift()
2278 xfs_btree_get_sibling(cur, right, &lptr, XFS_BB_LEFTSIB); in xfs_btree_lshift()
[all …]
|
| D | xfs_bmap.c | 2582 xfs_bmbt_irec_t right; /* right neighbor extent entry */ in xfs_bmap_add_extent_hole_delay() local
2602 if (xfs_iext_get_extent(ifp, icur, &right)) { in xfs_bmap_add_extent_hole_delay()
2604 if (isnullstartblock(right.br_startblock)) in xfs_bmap_add_extent_hole_delay()
2618 new->br_startoff + new->br_blockcount == right.br_startoff && in xfs_bmap_add_extent_hole_delay()
2619 new->br_blockcount + right.br_blockcount <= MAXEXTLEN && in xfs_bmap_add_extent_hole_delay()
2622 right.br_blockcount <= MAXEXTLEN))) in xfs_bmap_add_extent_hole_delay()
2636 right.br_blockcount; in xfs_bmap_add_extent_hole_delay()
2640 startblockval(right.br_startblock); in xfs_bmap_add_extent_hole_delay()
2676 temp = new->br_blockcount + right.br_blockcount; in xfs_bmap_add_extent_hole_delay()
2678 startblockval(right.br_startblock); in xfs_bmap_add_extent_hole_delay()
[all …]
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 113 struct pnfs_block_extent *right = ext_tree_next(be); in ext_try_to_merge_right() local
115 if (right && ext_can_merge(be, right)) { in ext_try_to_merge_right()
116 be->be_length += right->be_length; in ext_try_to_merge_right()
117 rb_erase(&right->be_node, root); in ext_try_to_merge_right()
118 nfs4_put_deviceid_node(right->be_device); in ext_try_to_merge_right()
119 kfree(right); in ext_try_to_merge_right()
451 struct pnfs_block_extent *right = ext_tree_next(be); in ext_tree_mark_written() local
453 if (right && ext_can_merge(be, right)) { in ext_tree_mark_written()
458 right->be_f_offset -= diff; in ext_tree_mark_written()
459 right->be_v_offset -= diff; in ext_tree_mark_written()
[all …]
|
| /fs/nilfs2/ |
| D | btree.c | 184 struct nilfs_btree_node *right, in nilfs_btree_node_move_left() argument
195 rdkeys = nilfs_btree_node_dkeys(right); in nilfs_btree_node_move_left()
196 rdptrs = nilfs_btree_node_dptrs(right, rncmax); in nilfs_btree_node_move_left()
197 rnchildren = nilfs_btree_node_get_nchildren(right); in nilfs_btree_node_move_left()
207 nilfs_btree_node_set_nchildren(right, rnchildren); in nilfs_btree_node_move_left()
212 struct nilfs_btree_node *right, in nilfs_btree_node_move_right() argument
223 rdkeys = nilfs_btree_node_dkeys(right); in nilfs_btree_node_move_right()
224 rdptrs = nilfs_btree_node_dptrs(right, rncmax); in nilfs_btree_node_move_right()
225 rnchildren = nilfs_btree_node_get_nchildren(right); in nilfs_btree_node_move_right()
235 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 | 1710 int right = (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) - in check_after_balance_leaf() local
1725 right); in check_after_balance_leaf()
|
| /fs/ntfs/ |
| D | runlist.c | 207 bool right = false; /* Right end of @src needs merging. */ in ntfs_rl_append() local
215 right = ntfs_are_rl_mergeable(src + ssize - 1, dst + loc + 1); in ntfs_rl_append()
218 dst = ntfs_rl_realloc(dst, dsize, dsize + ssize - right); in ntfs_rl_append()
227 if (right) in ntfs_rl_append()
234 ntfs_rl_mm(dst, marker, loc + 1 + right, dsize - (loc + 1 + right)); in ntfs_rl_append()
372 bool right = false; /* Right end of @src needs merging. */ in ntfs_rl_replace() local
381 right = ntfs_are_rl_mergeable(src + ssize - 1, dst + loc + 1); in ntfs_rl_replace()
388 delta = ssize - 1 - left - right; in ntfs_rl_replace()
400 if (right) in ntfs_rl_replace()
412 tail = loc + right + 1; in ntfs_rl_replace()
|
| /fs/befs/ |
| D | btree.c | 215 node->head.right = fs64_to_cpu(sb, node->od_node->right); in befs_bt_read_node()
462 if (this_node->head.right == BEFS_BT_INVAL) { in befs_btree_read()
475 node_off = this_node->head.right; in befs_btree_read()
|
| D | befs_fs_types.h | 242 fs64 right; member
250 befs_off_t right; member
|
| D | debug.c | 254 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 | 1138 struct file_lock *right = NULL; in posix_lock_inode() local
1263 right = fl; in posix_lock_inode()
1301 if (right && left == right && !new_fl2) in posix_lock_inode()
1322 if (right) { in posix_lock_inode()
1323 if (left == right) { in posix_lock_inode()
1329 locks_copy_lock(left, right); in posix_lock_inode()
1332 right->fl_start = request->fl_end + 1; in posix_lock_inode()
1333 locks_wake_up_blocks(right); in posix_lock_inode()
|
| /fs/hfs/ |
| D | hfs.h | 101 __be16 right; member
|
| /fs/hfsplus/ |
| D | hfsplus_raw.h | 231 __be16 right; member
|
| /fs/ocfs2/ |
| D | alloc.h | 311 struct ocfs2_path *right);
|
| D | alloc.c | 809 struct ocfs2_extent_rec *right) in ocfs2_extents_adjacent() argument
816 return (left_range == le32_to_cpu(right->e_cpos)); in ocfs2_extents_adjacent()
1751 struct ocfs2_path *right) in ocfs2_find_subtree_root() argument
1758 BUG_ON(path_root_bh(left) != path_root_bh(right)); in ocfs2_find_subtree_root()
1770 left->p_tree_depth, right->p_tree_depth, in ocfs2_find_subtree_root()
1772 (unsigned long long)path_leaf_bh(right)->b_blocknr); in ocfs2_find_subtree_root()
1774 right->p_node[i].bh->b_blocknr); in ocfs2_find_subtree_root()
|
| /fs/kernfs/ |
| D | dir.c | 337 const struct kernfs_node *right) in kernfs_sd_compare() argument
339 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
|
| /fs/cramfs/ |
| D | README | 60 its end, shifted right by 2 bits. The block must therefore be
|