| /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()
16 switch(left.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()
42 switch (left.type) { in qid_lt()
[all …]
|
| /fs/btrfs/ |
| D | ctree.c | 1881 struct extent_buffer *left = NULL; in balance_level() local
1955 left = read_node_slot(root, parent, pslot - 1); in balance_level()
1956 if (left) { in balance_level()
1957 btrfs_tree_lock(left); in balance_level()
1958 btrfs_set_lock_blocking(left); in balance_level()
1959 wret = btrfs_cow_block(trans, root, left, in balance_level()
1960 parent, pslot - 1, &left); in balance_level()
1979 if (left) { in balance_level()
1980 orig_slot += btrfs_header_nritems(left); in balance_level()
1981 wret = push_node_left(trans, root, left, mid, 1); in balance_level()
[all …]
|
| /fs/dlm/ |
| D | dir.c | 88 int left; in dlm_recover_directory() local
105 left = ls->ls_recover_buf->rc_header.h_length; in dlm_recover_directory()
106 left -= sizeof(struct dlm_rcom); in dlm_recover_directory()
112 if (left < sizeof(__be16)) in dlm_recover_directory()
118 left -= sizeof(__be16); in dlm_recover_directory()
129 if (namelen > left) in dlm_recover_directory()
180 left -= namelen; in dlm_recover_directory()
|
| /fs/xfs/libxfs/ |
| D | xfs_btree.c | 774 xfs_fsblock_t left = be64_to_cpu(block->bb_u.l.bb_leftsib); in xfs_btree_readahead_lblock() local
777 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLFSBLOCK) { in xfs_btree_readahead_lblock()
778 xfs_btree_reada_bufl(cur->bc_mp, left, 1, in xfs_btree_readahead_lblock()
799 xfs_agblock_t left = be32_to_cpu(block->bb_u.s.bb_leftsib); in xfs_btree_readahead_sblock() local
803 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLAGBLOCK) { in xfs_btree_readahead_sblock()
805 left, 1, cur->bc_ops->buf_ops); in xfs_btree_readahead_sblock()
1975 struct xfs_btree_block *left; /* left btree block */ in xfs_btree_lshift() local
2015 error = xfs_btree_read_buf_block(cur, &lptr, 0, &left, &lbp); in xfs_btree_lshift()
2020 lrecs = xfs_btree_get_numrecs(left); in xfs_btree_lshift()
2046 lkp = xfs_btree_key_addr(cur, lrecs, left); in xfs_btree_lshift()
[all …]
|
| D | xfs_bmap.c | 2827 xfs_bmbt_irec_t left; /* left neighbor extent entry */ in xfs_bmap_add_extent_hole_delay() local
2843 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &left); in xfs_bmap_add_extent_hole_delay()
2845 if (isnullstartblock(left.br_startblock)) in xfs_bmap_add_extent_hole_delay()
2866 left.br_startoff + left.br_blockcount == new->br_startoff && in xfs_bmap_add_extent_hole_delay()
2867 left.br_blockcount + new->br_blockcount <= MAXEXTLEN) in xfs_bmap_add_extent_hole_delay()
2874 (left.br_blockcount + new->br_blockcount + in xfs_bmap_add_extent_hole_delay()
2889 temp = left.br_blockcount + new->br_blockcount + in xfs_bmap_add_extent_hole_delay()
2894 oldlen = startblockval(left.br_startblock) + in xfs_bmap_add_extent_hole_delay()
2912 temp = left.br_blockcount + new->br_blockcount; in xfs_bmap_add_extent_hole_delay()
2916 oldlen = startblockval(left.br_startblock) + in xfs_bmap_add_extent_hole_delay()
[all …]
|
| /fs/ceph/ |
| D | file.c | 351 u64 pos, this_len, left; in striped_read() local
363 left = len; in striped_read()
374 this_len = left; in striped_read()
382 hit_stripe = this_len < left; in striped_read()
384 dout("striped_read %llu~%llu (read %u) got %d%s%s\n", pos, left, read, in striped_read()
402 left -= ret; in striped_read()
407 if (left && hit_stripe && pos < inode->i_size) in striped_read()
414 if (pos + left > inode->i_size) in striped_read()
488 size_t left = ret; in ceph_sync_read() local
490 while (left) { in ceph_sync_read()
[all …]
|
| D | dir.c | 1158 int left; in ceph_read_dir() local
1192 left = copy_to_user(buf, cf->dir_info + *ppos, size); in ceph_read_dir()
1193 if (left == size) in ceph_read_dir()
1195 *ppos += (size - left); in ceph_read_dir()
1196 return size - left; in ceph_read_dir()
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 96 struct pnfs_block_extent *left = ext_tree_prev(be); in ext_try_to_merge_left() local
98 if (left && ext_can_merge(left, be)) { in ext_try_to_merge_left()
99 left->be_length += be->be_length; in ext_try_to_merge_left()
103 return left; in ext_try_to_merge_left()
419 struct pnfs_block_extent *left = ext_tree_prev(be); in ext_tree_mark_written() local
421 if (left && ext_can_merge(left, be)) { in ext_tree_mark_written()
424 left->be_length += diff; in ext_tree_mark_written()
|
| /fs/ntfs/ |
| D | runlist.c | 288 bool left = false; /* Left end of @src needs merging. */ in ntfs_rl_insert() local
304 left = ntfs_are_rl_mergeable(dst + loc - 1, src); in ntfs_rl_insert()
307 if (left) in ntfs_rl_insert()
316 dst = ntfs_rl_realloc(dst, dsize, dsize + ssize - left + disc); in ntfs_rl_insert()
323 if (left) in ntfs_rl_insert()
332 marker = loc + ssize - left + disc; in ntfs_rl_insert()
336 ntfs_rl_mc(dst, loc + disc, src, left, ssize - left); in ntfs_rl_insert()
385 bool left = false; /* Left end of @src needs merging. */ in ntfs_rl_replace() local
397 left = ntfs_are_rl_mergeable(dst + loc - 1, src); in ntfs_rl_replace()
402 delta = ssize - 1 - left - right; in ntfs_rl_replace()
[all …]
|
| D | file.c | 1283 int left; in ntfs_copy_from_user() local
1290 left = __copy_from_user_inatomic(addr + ofs, buf, len); in ntfs_copy_from_user()
1292 if (unlikely(left)) { in ntfs_copy_from_user()
1295 left = __copy_from_user(addr + ofs, buf, len); in ntfs_copy_from_user()
1297 if (unlikely(left)) in ntfs_copy_from_user()
1310 total += len - left; in ntfs_copy_from_user()
1332 size_t left; in __ntfs_copy_from_user_iovec_inatomic() local
1337 left = __copy_from_user_inatomic(vaddr, buf, len); in __ntfs_copy_from_user_iovec_inatomic()
1341 if (unlikely(left)) { in __ntfs_copy_from_user_iovec_inatomic()
1342 total -= left; in __ntfs_copy_from_user_iovec_inatomic()
|
| /fs/nilfs2/ |
| D | btree.c | 195 static void nilfs_btree_node_move_left(struct nilfs_btree_node *left, in nilfs_btree_node_move_left() argument
203 ldkeys = nilfs_btree_node_dkeys(left); in nilfs_btree_node_move_left()
204 ldptrs = nilfs_btree_node_dptrs(left, lncmax); in nilfs_btree_node_move_left()
205 lnchildren = nilfs_btree_node_get_nchildren(left); in nilfs_btree_node_move_left()
218 nilfs_btree_node_set_nchildren(left, lnchildren); in nilfs_btree_node_move_left()
223 static void nilfs_btree_node_move_right(struct nilfs_btree_node *left, in nilfs_btree_node_move_right() argument
231 ldkeys = nilfs_btree_node_dkeys(left); in nilfs_btree_node_move_right()
232 ldptrs = nilfs_btree_node_dptrs(left, lncmax); in nilfs_btree_node_move_right()
233 lnchildren = nilfs_btree_node_get_nchildren(left); in nilfs_btree_node_move_right()
246 nilfs_btree_node_set_nchildren(left, lnchildren); in nilfs_btree_node_move_right()
[all …]
|
| /fs/ocfs2/ |
| D | localalloc.c | 842 int numfound, bitoff, left, startoff, lastzero; in ocfs2_local_alloc_find_clear_bits() local
881 left = le32_to_cpu(alloc->id1.bitmap1.i_total); in ocfs2_local_alloc_find_clear_bits()
882 while ((bitoff = ocfs2_find_next_zero_bit(bitmap, left, startoff)) != -1) { in ocfs2_local_alloc_find_clear_bits()
883 if (bitoff == left) { in ocfs2_local_alloc_find_clear_bits()
970 int bit_off, left, count, start; in ocfs2_sync_local_to_main() local
993 left = le32_to_cpu(alloc->id1.bitmap1.i_total); in ocfs2_sync_local_to_main()
995 while ((bit_off = ocfs2_find_next_zero_bit(bitmap, left, start)) in ocfs2_sync_local_to_main()
997 if ((bit_off < left) && (bit_off == start)) { in ocfs2_sync_local_to_main()
1021 if (bit_off >= left) in ocfs2_sync_local_to_main()
|
| /fs/ |
| D | splice.c | 527 loff_t isize, left; in generic_file_splice_read() local
534 left = isize - *ppos; in generic_file_splice_read()
535 if (unlikely(left < len)) in generic_file_splice_read()
536 len = left; in generic_file_splice_read()
968 size_t left; in iter_file_splice_write() local
987 left = sd.total_len; in iter_file_splice_write()
988 for (n = 0, idx = pipe->curbuf; left && n < pipe->nrbufs; n++, idx++) { in iter_file_splice_write()
992 if (this_len > left) in iter_file_splice_write()
993 this_len = left; in iter_file_splice_write()
1008 left -= this_len; in iter_file_splice_write()
[all …]
|
| D | locks.c | 931 struct file_lock *left = NULL; in __posix_lock_file() local
1049 left = fl; in __posix_lock_file()
1095 if (right && left == right && !new_fl2) in __posix_lock_file()
1115 if (left == right) { in __posix_lock_file()
1119 left = new_fl2; in __posix_lock_file()
1121 locks_copy_lock(left, right); in __posix_lock_file()
1122 locks_insert_lock(before, left); in __posix_lock_file()
1127 if (left) { in __posix_lock_file()
1128 left->fl_end = request->fl_start - 1; in __posix_lock_file()
1129 locks_wake_up_blocks(left); in __posix_lock_file()
|
| D | file.c | 332 int left = (new_fdt->max_fds - open_files) / 8; in dup_fd() local
335 memset(&new_fdt->open_fds[start], 0, left); in dup_fd()
336 memset(&new_fdt->close_on_exec[start], 0, left); in dup_fd()
|
| /fs/minix/ |
| D | itree_common.c | 152 int left; in get_block() local
189 left = (chain + depth) - partial; in get_block()
190 err = alloc_branch(inode, left, offsets+(partial-chain), partial); in get_block()
194 if (splice_branch(inode, chain, partial, left) < 0) in get_block()
|
| /fs/befs/ |
| D | befs_fs_types.h | 240 fs64 left; member
248 befs_off_t left; member
|
| D | btree.c | 219 node->head.left = fs64_to_cpu(sb, node->od_node->left); in befs_bt_read_node()
|
| /fs/sysv/ |
| D | itree.c | 209 int left; in get_block() local
249 left = (chain + depth) - partial; in get_block()
250 err = alloc_branch(inode, left, offsets+(partial-chain), partial); in get_block()
254 if (splice_branch(inode, chain, partial, left) < 0) in get_block()
|
| /fs/xfs/ |
| D | xfs_itable.c | 567 int left = *count; in xfs_inumbers() local
576 bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer))); in xfs_inumbers()
619 if (!--left) in xfs_inumbers()
|
| /fs/jbd/ |
| D | journal.c | 436 int left = journal->j_free; in __log_space_left() local
447 left -= MIN_LOG_RESERVED_BLOCKS; in __log_space_left()
449 if (left <= 0) in __log_space_left()
451 left -= (left >> 3); in __log_space_left()
452 return left; in __log_space_left()
|
| /fs/omfs/ |
| D | file.c | 192 sector_t block, int count, int *left) in find_block() argument
206 *left = numblocks - (block - searched); in find_block()
|
| /fs/kernfs/ |
| D | dir.c | 211 static int kernfs_sd_compare(const struct kernfs_node *left, in kernfs_sd_compare() argument
214 return kernfs_name_compare(left->hash, left->name, left->ns, right); in kernfs_sd_compare()
|
| /fs/hugetlbfs/ |
| D | inode.c | 194 unsigned long left, copied = 0; in hugetlbfs_read_actor() local
211 left = __copy_to_user(buf, kaddr + offset, chunksize); in hugetlbfs_read_actor()
213 if (left) { in hugetlbfs_read_actor()
214 copied += (chunksize - left); in hugetlbfs_read_actor()
|
| /fs/reiserfs/ |
| D | fix_node.c | 963 struct buffer_head *father, *left; in is_left_neighbor_in_cache() local
993 if ((left = sb_find_get_block(sb, left_neighbor_blocknr))) { in is_left_neighbor_in_cache()
995 RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left), in is_left_neighbor_in_cache()
997 left, left); in is_left_neighbor_in_cache()
998 put_bh(left); in is_left_neighbor_in_cache()
|