| /fs/quota/ |
| A 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/ |
| A D | mkutf8data.c | 368 void *right; member
690 right = node->right; in prune()
715 assert(right->left || right->right); in prune()
719 rightleaf = right->right; in prune()
721 right = right->left; in prune()
722 else if (right->right) in prune()
723 right = right->right; in prune()
735 right = node->right; in prune()
755 right = node->right; in prune()
778 right = node->right; in prune()
[all …]
|
| /fs/xfs/scrub/ |
| A D | bitmap.c | 126 struct xbitmap64_node *right; in xbitmap64_set() local
146 ASSERT(!right || right->bn_start == last + 1); in xbitmap64_set()
148 if (left && right) { in xbitmap64_set()
154 kfree(right); in xbitmap64_set()
160 } else if (right) { in xbitmap64_set()
163 right->bn_start = start; in xbitmap64_set()
421 ASSERT(!right || right->bn_start == last + 1); in xbitmap32_set()
423 if (left && right) { in xbitmap32_set()
429 kfree(right); in xbitmap32_set()
435 } else if (right) { in xbitmap32_set()
[all …]
|
| /fs/btrfs/ |
| A D | ctree.c | 968 if (IS_ERR(right)) { in balance_level()
969 ret = PTR_ERR(right); in balance_level()
970 right = NULL; in balance_level()
995 if (right) { in balance_level()
1005 right = NULL; in balance_level()
1010 right, 0, 1); in balance_level()
1012 right = NULL; in balance_level()
1114 if (right) { in balance_level()
1223 if (IS_ERR(right)) in push_nodes_for_insert()
3263 if (IS_ERR(right)) in push_leaf_right()
[all …]
|
| A D | free-space-tree.c | 913 goto right; in add_free_space_extent()
927 goto right; in add_free_space_extent()
950 right: in add_free_space_extent()
|
| /fs/xfs/libxfs/ |
| A D | xfs_refcount.c | 490 struct xfs_refcount_irec *right, in xfs_refcount_merge_center_extents() argument
635 struct xfs_refcount_irec *right, in xfs_refcount_merge_right_extent() argument
673 right->rc_startblock, &found_rec); in xfs_refcount_merge_right_extent()
684 error = xfs_refcount_update(cur, right); in xfs_refcount_merge_right_extent()
796 struct xfs_refcount_irec *right, in xfs_refcount_find_right_extents() argument
827 *right = tmp; in xfs_refcount_find_right_extents()
907 const struct xfs_refcount_irec *right, in xfs_refc_want_merge_center() argument
932 if (right->rc_refcount != new_refcount) in xfs_refc_want_merge_center()
985 const struct xfs_refcount_irec *right, in xfs_refc_want_merge_right() argument
1001 if (right->rc_refcount != new_refcount) in xfs_refc_want_merge_right()
[all …]
|
| A D | xfs_btree.c | 2469 rrecs = xfs_btree_get_numrecs(right); in xfs_btree_lshift()
2526 xfs_btree_set_numrecs(right, rrecs); in xfs_btree_lshift()
2542 xfs_btree_key_addr(cur, 2, right), in xfs_btree_lshift()
2545 xfs_btree_ptr_addr(cur, 2, right), in xfs_btree_lshift()
2553 xfs_btree_rec_addr(cur, 2, right), in xfs_btree_lshift()
2661 rrecs = xfs_btree_get_numrecs(right); in xfs_btree_rshift()
2876 xfs_btree_set_numrecs(right, xfs_btree_get_numrecs(right) + rrecs); in __xfs_btree_split()
3378 right = block; in xfs_btree_new_root()
3401 xfs_btree_get_node_keys(cur, right, in xfs_btree_new_root()
3411 xfs_btree_get_leaf_keys(cur, right, in xfs_btree_new_root()
[all …]
|
| A D | xfs_exchmaps.c | 779 const struct xfs_bmbt_irec *right) in xmi_delta_nextents_step() argument
786 rhole = right->br_startblock == HOLESTARTBLOCK; in xmi_delta_nextents_step()
794 if (!rhole && !chole && xmi_can_merge(curr, right)) in xmi_delta_nextents_step()
797 !xmi_can_merge_all(left, curr, right)) in xmi_delta_nextents_step()
804 if (!rhole && !nhole && xmi_can_merge(new, right)) in xmi_delta_nextents_step()
807 !xmi_can_merge_all(left, new, right)) in xmi_delta_nextents_step()
855 trace_xfs_exchmaps_delta_nextents_step(mp, left, curr, new, right, ret, in xmi_delta_nextents_step()
|
| A D | xfs_bmap.c | 1430 struct xfs_bmbt_irec *right) in xfs_bmap_same_rtgroup() argument
1436 xfs_rtb_to_rgno(mp, right->br_startblock)) in xfs_bmap_same_rtgroup()
2615 if (xfs_iext_get_extent(ifp, icur, &right)) { in xfs_bmap_add_extent_hole_real()
2617 if (isnullstartblock(right.br_startblock)) in xfs_bmap_add_extent_hole_real()
2636 new->br_state == right.br_state && in xfs_bmap_add_extent_hole_real()
2666 error = xfs_bmbt_lookup_eq(cur, &right, &i); in xfs_bmap_add_extent_hole_real()
2732 old = right; in xfs_bmap_add_extent_hole_real()
2734 right.br_startoff = new->br_startoff; in xfs_bmap_add_extent_hole_real()
2735 right.br_startblock = new->br_startblock; in xfs_bmap_add_extent_hole_real()
2736 right.br_blockcount += new->br_blockcount; in xfs_bmap_add_extent_hole_real()
[all …]
|
| /fs/nfs/blocklayout/ |
| A D | extent_tree.c | 114 struct pnfs_block_extent *right = ext_tree_next(be); in ext_try_to_merge_right() local
116 if (right && ext_can_merge(be, right)) { in ext_try_to_merge_right()
117 be->be_length += right->be_length; in ext_try_to_merge_right()
118 rb_erase(&right->be_node, root); in ext_try_to_merge_right()
119 nfs4_put_deviceid_node(right->be_device); in ext_try_to_merge_right()
120 kfree(right); in ext_try_to_merge_right()
452 struct pnfs_block_extent *right = ext_tree_next(be); in ext_tree_mark_written() local
454 if (right && ext_can_merge(be, right)) { in ext_tree_mark_written()
459 right->be_f_offset -= diff; in ext_tree_mark_written()
460 right->be_v_offset -= diff; in ext_tree_mark_written()
[all …]
|
| /fs/nilfs2/ |
| A 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()
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()
890 struct nilfs_btree_node *node, *right; in nilfs_btree_carry_right() local
916 nilfs_btree_node_get_key(right, 0)); in nilfs_btree_carry_right()
937 struct nilfs_btree_node *node, *right; in nilfs_btree_split() local
1324 struct nilfs_btree_node *node, *right; in nilfs_btree_borrow_right() local
1346 nilfs_btree_node_get_key(right, 0)); in nilfs_btree_borrow_right()
1383 struct nilfs_btree_node *node, *right; in nilfs_btree_concat_right() local
[all …]
|
| /fs/xfs/ |
| A D | xfs_iomap.c | 1272 if (xfs_iext_get_extent(ifp, icur, &right)) { in xfs_bmap_add_extent_hole_delay()
1274 if (isnullstartblock(right.br_startblock)) in xfs_bmap_add_extent_hole_delay()
1292 right.br_blockcount <= XFS_MAX_BMBT_EXTLEN))) in xfs_bmap_add_extent_hole_delay()
1306 right.br_blockcount; in xfs_bmap_add_extent_hole_delay()
1310 startblockval(right.br_startblock); in xfs_bmap_add_extent_hole_delay()
1346 temp = new->br_blockcount + right.br_blockcount; in xfs_bmap_add_extent_hole_delay()
1348 startblockval(right.br_startblock); in xfs_bmap_add_extent_hole_delay()
1351 right.br_startoff = new->br_startoff; in xfs_bmap_add_extent_hole_delay()
1352 right.br_startblock = nullstartblock(newlen); in xfs_bmap_add_extent_hole_delay()
1353 right.br_blockcount = temp; in xfs_bmap_add_extent_hole_delay()
[all …]
|
| A D | xfs_trace.h | 5543 const struct xfs_bmbt_irec *right,
5545 TP_ARGS(mp, left, curr, new, right, delta, state),
5574 __entry->roff = right->br_startoff;
5575 __entry->rstart = right->br_startblock;
5576 __entry->rcount = right->br_blockcount;
|
| /fs/befs/ |
| A 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()
|
| A D | befs_fs_types.h | 242 fs64 right; member
250 befs_off_t right; member
|
| A D | debug.c | 254 befs_debug(sb, " right %016LX", fs64_to_cpu(sb, node->right)); in befs_dump_index_node()
|
| A D | ChangeLog | 27 * Did the string comparison really right this time (btree.c) [WD]
216 * Thats right. New versioning scheme.
|
| /fs/ |
| A D | locks.c | 1153 struct file_lock *right = NULL; in posix_lock_inode() local
1292 right = fl; in posix_lock_inode()
1331 if (right && left == right && !new_fl2) in posix_lock_inode()
1352 if (right) { in posix_lock_inode()
1353 if (left == right) { in posix_lock_inode()
1359 locks_copy_lock(left, right); in posix_lock_inode()
1362 right->fl_start = request->fl_end + 1; in posix_lock_inode()
1363 locks_wake_up_blocks(&right->c); in posix_lock_inode()
|
| /fs/hfs/ |
| A D | hfs.h | 101 __be16 right; member
|
| /fs/hfsplus/ |
| A D | hfsplus_raw.h | 231 __be16 right; member
|
| /fs/ocfs2/ |
| A D | alloc.h | 307 struct ocfs2_path *right);
|
| A D | alloc.c | 807 struct ocfs2_extent_rec *right) in ocfs2_extents_adjacent() argument
814 return (left_range == le32_to_cpu(right->e_cpos)); in ocfs2_extents_adjacent()
1756 struct ocfs2_path *right) in ocfs2_find_subtree_root() argument
1763 BUG_ON(path_root_bh(left) != path_root_bh(right)); in ocfs2_find_subtree_root()
1775 left->p_tree_depth, right->p_tree_depth, in ocfs2_find_subtree_root()
1777 (unsigned long long)path_leaf_bh(right)->b_blocknr); in ocfs2_find_subtree_root()
1779 right->p_node[i].bh->b_blocknr); in ocfs2_find_subtree_root()
|
| /fs/kernfs/ |
| A D | dir.c | 347 const struct kernfs_node *right) in kernfs_sd_compare() argument
349 return kernfs_name_compare(left->hash, kernfs_rcu_name(left), left->ns, right); in kernfs_sd_compare()
|
| /fs/jffs2/ |
| A D | README.Locking | 17 the garbage collector will obtain this right at the beginning of
|
| /fs/cramfs/ |
| A D | README | 60 its end, shifted right by 2 bits. The block must therefore be
|