| /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()
17 switch(left.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()
43 switch (left.type) { in qid_lt()
[all …]
|
| /fs/unicode/ |
| D | mkutf8data.c | 367 void *left; member
401 node = node->left; in lookup()
403 leaf = node->left; in lookup()
442 node->left, node->right, in tree_walk()
445 if (!(node->left && node->right)) in tree_walk()
453 assert(node->left); in tree_walk()
454 tree->leaf_print(node->left, in tree_walk()
457 } else if (node->left) { in tree_walk()
460 node = node->left; in tree_walk()
498 node->left = node->right = NULL; in alloc_node()
[all …]
|
| /fs/xfs/ |
| D | xfs_bio_io.c | 22 unsigned int left = count; in xfs_rw_bdev() local
29 bio = bio_alloc(GFP_KERNEL, bio_max_vecs(left)); in xfs_rw_bdev()
37 unsigned int len = min_t(unsigned, left, PAGE_SIZE - off); in xfs_rw_bdev()
42 bio = bio_alloc(GFP_KERNEL, bio_max_vecs(left)); in xfs_rw_bdev()
52 left -= len; in xfs_rw_bdev()
53 } while (left > 0); in xfs_rw_bdev()
|
| /fs/btrfs/ |
| D | ctree.c | 1851 struct extent_buffer *left = NULL; in balance_level() local
1926 left = btrfs_read_node_slot(parent, pslot - 1); in balance_level()
1927 if (IS_ERR(left)) in balance_level()
1928 left = NULL; in balance_level()
1930 if (left) { in balance_level()
1931 __btrfs_tree_lock(left, BTRFS_NESTING_LEFT); in balance_level()
1932 btrfs_set_lock_blocking_write(left); in balance_level()
1933 wret = btrfs_cow_block(trans, root, left, in balance_level()
1934 parent, pslot - 1, &left, in balance_level()
1959 if (left) { in balance_level()
[all …]
|
| /fs/orangefs/ |
| D | orangefs-bufmap.c | 83 long left = slot_timeout_secs * HZ; in wait_for_free() local
87 long n = left, t; in wait_for_free()
104 if (unlikely(!t) && n != left && m->c < 0) in wait_for_free()
105 left = t; in wait_for_free()
107 left = t + (left - n); in wait_for_free()
109 left = -EINTR; in wait_for_free()
110 } while (left > 0); in wait_for_free()
114 else if (left <= 0 && waitqueue_active(&m->q)) in wait_for_free()
118 if (likely(left > 0)) in wait_for_free()
121 return left < 0 ? -EINTR : -ETIMEDOUT; in wait_for_free()
|
| /fs/xfs/libxfs/ |
| D | xfs_refcount.c | 404 struct xfs_refcount_irec *left, in xfs_refcount_merge_center_extents() argument
414 cur->bc_ag.agno, left, center, right); in xfs_refcount_merge_center_extents()
452 error = xfs_refcount_lookup_le(cur, left->rc_startblock, in xfs_refcount_merge_center_extents()
461 left->rc_blockcount = extlen; in xfs_refcount_merge_center_extents()
462 error = xfs_refcount_update(cur, left); in xfs_refcount_merge_center_extents()
481 struct xfs_refcount_irec *left, in xfs_refcount_merge_left_extent() argument
490 cur->bc_ag.agno, left, cleft); in xfs_refcount_merge_left_extent()
513 error = xfs_refcount_lookup_le(cur, left->rc_startblock, in xfs_refcount_merge_left_extent()
522 left->rc_blockcount += cleft->rc_blockcount; in xfs_refcount_merge_left_extent()
523 error = xfs_refcount_update(cur, left); in xfs_refcount_merge_left_extent()
[all …]
|
| D | xfs_btree.c | 864 xfs_fsblock_t left = be64_to_cpu(block->bb_u.l.bb_leftsib); in xfs_btree_readahead_lblock() local
867 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLFSBLOCK) { in xfs_btree_readahead_lblock()
868 xfs_btree_reada_bufl(cur->bc_mp, left, 1, in xfs_btree_readahead_lblock()
889 xfs_agblock_t left = be32_to_cpu(block->bb_u.s.bb_leftsib); in xfs_btree_readahead_sblock() local
893 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLAGBLOCK) { in xfs_btree_readahead_sblock()
895 left, 1, cur->bc_ops->buf_ops); in xfs_btree_readahead_sblock()
2251 struct xfs_btree_block *left; /* left btree block */ in xfs_btree_lshift() local
2290 error = xfs_btree_read_buf_block(cur, &lptr, 0, &left, &lbp); in xfs_btree_lshift()
2295 lrecs = xfs_btree_get_numrecs(left); in xfs_btree_lshift()
2321 lkp = xfs_btree_key_addr(cur, lrecs, left); in xfs_btree_lshift()
[all …]
|
| D | xfs_bmap.c | 2579 xfs_bmbt_irec_t left; /* left neighbor extent entry */ in xfs_bmap_add_extent_hole_delay() local
2592 if (xfs_iext_peek_prev_extent(ifp, icur, &left)) { in xfs_bmap_add_extent_hole_delay()
2594 if (isnullstartblock(left.br_startblock)) in xfs_bmap_add_extent_hole_delay()
2613 left.br_startoff + left.br_blockcount == new->br_startoff && in xfs_bmap_add_extent_hole_delay()
2614 left.br_blockcount + new->br_blockcount <= MAXEXTLEN) in xfs_bmap_add_extent_hole_delay()
2621 (left.br_blockcount + new->br_blockcount + in xfs_bmap_add_extent_hole_delay()
2635 temp = left.br_blockcount + new->br_blockcount + in xfs_bmap_add_extent_hole_delay()
2638 oldlen = startblockval(left.br_startblock) + in xfs_bmap_add_extent_hole_delay()
2643 left.br_startblock = nullstartblock(newlen); in xfs_bmap_add_extent_hole_delay()
2644 left.br_blockcount = temp; in xfs_bmap_add_extent_hole_delay()
[all …]
|
| /fs/dlm/ |
| D | dir.c | 86 int left; in dlm_recover_directory() local
103 left = ls->ls_recover_buf->rc_header.h_length; in dlm_recover_directory()
104 left -= sizeof(struct dlm_rcom); in dlm_recover_directory()
110 if (left < sizeof(__be16)) in dlm_recover_directory()
116 left -= sizeof(__be16); in dlm_recover_directory()
127 if (namelen > left) in dlm_recover_directory()
178 left -= namelen; in dlm_recover_directory()
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 97 struct pnfs_block_extent *left = ext_tree_prev(be); in ext_try_to_merge_left() local
99 if (left && ext_can_merge(left, be)) { in ext_try_to_merge_left()
100 left->be_length += be->be_length; in ext_try_to_merge_left()
104 return left; in ext_try_to_merge_left()
433 struct pnfs_block_extent *left = ext_tree_prev(be); in ext_tree_mark_written() local
435 if (left && ext_can_merge(left, be)) { in ext_tree_mark_written()
438 left->be_length += diff; in ext_tree_mark_written()
|
| /fs/ntfs/ |
| D | runlist.c | 274 bool left = false; /* Left end of @src needs merging. */ in ntfs_rl_insert() local
290 left = ntfs_are_rl_mergeable(dst + loc - 1, src); in ntfs_rl_insert()
293 if (left) in ntfs_rl_insert()
302 dst = ntfs_rl_realloc(dst, dsize, dsize + ssize - left + disc); in ntfs_rl_insert()
309 if (left) in ntfs_rl_insert()
318 marker = loc + ssize - left + disc; in ntfs_rl_insert()
322 ntfs_rl_mc(dst, loc + disc, src, left, ssize - left); in ntfs_rl_insert()
371 bool left = false; /* Left end of @src needs merging. */ in ntfs_rl_replace() local
383 left = ntfs_are_rl_mergeable(dst + loc - 1, src); in ntfs_rl_replace()
388 delta = ssize - 1 - left - right; in ntfs_rl_replace()
[all …]
|
| /fs/ocfs2/ |
| D | localalloc.c | 829 int numfound = 0, bitoff, left, startoff; in ocfs2_local_alloc_find_clear_bits() local
867 left = le32_to_cpu(alloc->id1.bitmap1.i_total); in ocfs2_local_alloc_find_clear_bits()
868 while ((bitoff = ocfs2_find_next_zero_bit(bitmap, left, startoff)) != -1) { in ocfs2_local_alloc_find_clear_bits()
869 if (bitoff == left) { in ocfs2_local_alloc_find_clear_bits()
956 int bit_off, left, count, start; in ocfs2_sync_local_to_main() local
979 left = le32_to_cpu(alloc->id1.bitmap1.i_total); in ocfs2_sync_local_to_main()
981 while ((bit_off = ocfs2_find_next_zero_bit(bitmap, left, start)) in ocfs2_sync_local_to_main()
983 if ((bit_off < left) && (bit_off == start)) { in ocfs2_sync_local_to_main()
1007 if (bit_off >= left) in ocfs2_sync_local_to_main()
|
| /fs/nilfs2/ |
| D | btree.c | 183 static void nilfs_btree_node_move_left(struct nilfs_btree_node *left, in nilfs_btree_node_move_left() argument
191 ldkeys = nilfs_btree_node_dkeys(left); in nilfs_btree_node_move_left()
192 ldptrs = nilfs_btree_node_dptrs(left, lncmax); in nilfs_btree_node_move_left()
193 lnchildren = nilfs_btree_node_get_nchildren(left); in nilfs_btree_node_move_left()
206 nilfs_btree_node_set_nchildren(left, lnchildren); in nilfs_btree_node_move_left()
211 static void nilfs_btree_node_move_right(struct nilfs_btree_node *left, in nilfs_btree_node_move_right() argument
219 ldkeys = nilfs_btree_node_dkeys(left); in nilfs_btree_node_move_right()
220 ldptrs = nilfs_btree_node_dptrs(left, lncmax); in nilfs_btree_node_move_right()
221 lnchildren = nilfs_btree_node_get_nchildren(left); in nilfs_btree_node_move_right()
234 nilfs_btree_node_set_nchildren(left, lnchildren); in nilfs_btree_node_move_right()
[all …]
|
| /fs/minix/ |
| D | itree_common.c | 159 int left; in get_block() local
196 left = (chain + depth) - partial; in get_block()
197 err = alloc_branch(inode, left, offsets+(partial-chain), partial); in get_block()
201 if (splice_branch(inode, chain, partial, left) < 0) in get_block()
|
| /fs/befs/ |
| D | befs_fs_types.h | 241 fs64 left; member
249 befs_off_t left; member
|
| D | btree.c | 214 node->head.left = fs64_to_cpu(sb, node->od_node->left); in befs_bt_read_node()
|
| /fs/sysv/ |
| D | itree.c | 214 int left; in get_block() local
254 left = (chain + depth) - partial; in get_block()
255 err = alloc_branch(inode, left, offsets+(partial-chain), partial); in get_block()
259 if (splice_branch(inode, chain, partial, left) < 0) in get_block()
|
| /fs/ |
| D | splice.c | 641 size_t left; in iter_file_splice_write() local
664 left = sd.total_len; in iter_file_splice_write()
665 for (n = 0; !pipe_empty(head, tail) && left && n < nbufs; tail++, n++) { in iter_file_splice_write()
669 if (this_len > left) in iter_file_splice_write()
670 this_len = left; in iter_file_splice_write()
682 left -= this_len; in iter_file_splice_write()
685 iov_iter_bvec(&from, WRITE, array, n, sd.total_len - left); in iter_file_splice_write()
|
| D | locks.c | 1137 struct file_lock *left = NULL; in posix_lock_inode() local
1258 left = fl; in posix_lock_inode()
1301 if (right && left == right && !new_fl2) in posix_lock_inode()
1323 if (left == right) { in posix_lock_inode()
1327 left = new_fl2; in posix_lock_inode()
1329 locks_copy_lock(left, right); in posix_lock_inode()
1330 locks_insert_lock_ctx(left, &fl->fl_list); in posix_lock_inode()
1335 if (left) { in posix_lock_inode()
1336 left->fl_end = request->fl_start - 1; in posix_lock_inode()
1337 locks_wake_up_blocks(left); in posix_lock_inode()
|
| /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/ceph/ |
| D | file.c | 903 size_t left; in ceph_sync_read() local
955 left = ret > 0 ? ret : 0; in ceph_sync_read()
956 while (left > 0) { in ceph_sync_read()
959 len = min_t(size_t, left, PAGE_SIZE - page_off); in ceph_sync_read()
964 left -= copied; in ceph_sync_read()
1454 size_t left; in ceph_sync_write() local
1481 left = len; in ceph_sync_write()
1483 size_t plen = min_t(size_t, left, PAGE_SIZE); in ceph_sync_write()
1489 left -= ret; in ceph_sync_write()
|
| /fs/reiserfs/ |
| D | fix_node.c | 961 struct buffer_head *father, *left; in is_left_neighbor_in_cache() local
991 if ((left = sb_find_get_block(sb, left_neighbor_blocknr))) { in is_left_neighbor_in_cache()
993 RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left), in is_left_neighbor_in_cache()
995 left, left); in is_left_neighbor_in_cache()
996 put_bh(left); in is_left_neighbor_in_cache()
|
| /fs/kernfs/ |
| D | dir.c | 337 static int kernfs_sd_compare(const struct kernfs_node *left, in kernfs_sd_compare() argument
340 return kernfs_name_compare(left->hash, left->name, left->ns, right); in kernfs_sd_compare()
|
| /fs/cifs/ |
| D | sess.c | 76 int left = ses->chan_max - ses->chan_count; in cifs_try_adding_channels() local
83 if (left <= 0) { in cifs_try_adding_channels()
126 while (left > 0) { in cifs_try_adding_channels()
132 left); in cifs_try_adding_channels()
152 left--; in cifs_try_adding_channels()
|
| /fs/hfs/ |
| D | hfs.h | 99 __be16 left; member
|