| /fs/xfs/scrub/ |
| A D | bitmap.c | 132 if (left && left->bn_start <= start && left->bn_last >= last) in xbitmap64_set()
142 ASSERT(!left || left->bn_last + 1 == start); in xbitmap64_set()
148 if (left && right) { in xbitmap64_set()
155 } else if (left) { in xbitmap64_set()
158 left->bn_last = last; in xbitmap64_set()
168 if (!left) in xbitmap64_set()
407 if (left && left->bn_start <= start && left->bn_last >= last) in xbitmap32_set()
417 ASSERT(!left || left->bn_last + 1 == start); in xbitmap32_set()
423 if (left && right) { in xbitmap32_set()
430 } else if (left) { in xbitmap32_set()
[all …]
|
| /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()
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()
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()
45 return uid_lt(left.uid, right.uid); in qid_lt()
[all …]
|
| /fs/unicode/ |
| A D | mkutf8data.c | 367 void *left; member
689 left = node->left; in prune()
701 assert(left->left || left->right); in prune()
703 leftleaf = left->left; in prune()
706 else if (left->left) in prune()
707 left = left->left; in prune()
709 left = left->right; in prune()
734 left = node->left; in prune()
737 parent->left = left; in prune()
750 left = node->left; in prune()
[all …]
|
| /fs/bcachefs/ |
| A D | siphash.c | 106 size_t left, used; in SipHash_Update() local
115 left = sizeof(ctx->buf) - used; in SipHash_Update()
117 if (len >= left) { in SipHash_Update()
118 memcpy(&ctx->buf[used], ptr, left); in SipHash_Update()
120 len -= left; in SipHash_Update()
121 ptr += left; in SipHash_Update()
150 size_t left, used; in SipHash_End() local
153 left = sizeof(ctx->buf) - used; in SipHash_End()
154 memset(&ctx->buf[used], 0, left - 1); in SipHash_End()
|
| /fs/ntfs3/lib/ |
| A D | decompress_common.c | 117 int left; in make_huffman_decode_table() local
141 left = 1; in make_huffman_decode_table()
143 left <<= 1; in make_huffman_decode_table()
144 left -= len_counts[len]; in make_huffman_decode_table()
145 if (left < 0) { in make_huffman_decode_table()
153 if (left) { in make_huffman_decode_table()
157 if (left == (1 << max_codeword_len)) { in make_huffman_decode_table()
|
| /fs/btrfs/ |
| A D | ctree.c | 950 if (IS_ERR(left)) { in balance_level()
951 ret = PTR_ERR(left); in balance_level()
952 left = NULL; in balance_level()
985 if (left) { in balance_level()
1040 if (unlikely(!left)) { in balance_level()
1093 if (left) { in balance_level()
1118 if (left) { in balance_level()
1163 if (IS_ERR(left)) in push_nodes_for_insert()
3371 copy_leaf_items(left, right, btrfs_header_nritems(left), 0, push_items); in __push_leaf_left()
3376 copy_leaf_data(left, right, leaf_data_end(left) - push_space, in __push_leaf_left()
[all …]
|
| A D | direct-io.c | 920 const size_t left = iov_iter_count(from); in btrfs_direct_write() local
935 if (left == prev_left) { in btrfs_direct_write()
938 fault_in_iov_iter_readable(from, left); in btrfs_direct_write()
939 prev_left = left; in btrfs_direct_write()
1056 const size_t left = iov_iter_count(to); in btrfs_direct_read() local
1058 if (left == prev_left) { in btrfs_direct_read()
1072 fault_in_iov_iter_writeable(to, left); in btrfs_direct_read()
1073 prev_left = left; in btrfs_direct_read()
|
| /fs/orangefs/ |
| A 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/ |
| A D | xfs_refcount.c | 488 struct xfs_refcount_irec *left, in xfs_refcount_merge_center_extents() argument
542 left->rc_startblock, &found_rec); in xfs_refcount_merge_center_extents()
551 left->rc_blockcount = extlen; in xfs_refcount_merge_center_extents()
570 struct xfs_refcount_irec *left, in xfs_refcount_merge_left_extent() argument
606 left->rc_startblock, &found_rec); in xfs_refcount_merge_left_extent()
703 struct xfs_refcount_irec *left, in xfs_refcount_find_left_extents() argument
734 *left = tmp; in xfs_refcount_find_left_extents()
904 const struct xfs_refcount_irec *left, in xfs_refc_want_merge_center() argument
930 if (left->rc_refcount != new_refcount) in xfs_refc_want_merge_center()
950 const struct xfs_refcount_irec *left, in xfs_refc_want_merge_left() argument
[all …]
|
| A D | xfs_btree.c | 2465 lrecs = xfs_btree_get_numrecs(left); in xfs_btree_lshift()
2523 xfs_btree_set_numrecs(left, lrecs); in xfs_btree_lshift()
2651 lrecs = xfs_btree_get_numrecs(left); in xfs_btree_rshift()
2865 lrecs = xfs_btree_get_numrecs(left); in __xfs_btree_split()
2875 xfs_btree_set_numrecs(left, lrecs); in __xfs_btree_split()
3368 left = block; in xfs_btree_new_root()
3394 if (xfs_btree_get_level(left) > 0) { in xfs_btree_new_root()
3399 xfs_btree_get_node_keys(cur, left, in xfs_btree_new_root()
3409 xfs_btree_get_leaf_keys(cur, left, in xfs_btree_new_root()
4413 left = block; in xfs_btree_delrec()
[all …]
|
| A D | xfs_exchmaps.c | 776 const struct xfs_bmbt_irec *left, in xmi_delta_nextents_step() argument
785 lhole = left->br_startblock == HOLESTARTBLOCK; in xmi_delta_nextents_step()
792 if (!lhole && !chole && xmi_can_merge(left, curr)) in xmi_delta_nextents_step()
797 !xmi_can_merge_all(left, curr, right)) in xmi_delta_nextents_step()
802 if (!lhole && !nhole && xmi_can_merge(left, new)) 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 | 1429 struct xfs_bmbt_irec *left, in xfs_bmap_same_rtgroup() argument
2626 left.br_startoff + left.br_blockcount == new->br_startoff && in xfs_bmap_add_extent_hole_real()
2627 left.br_startblock + left.br_blockcount == new->br_startblock && in xfs_bmap_add_extent_hole_real()
2628 left.br_state == new->br_state && in xfs_bmap_add_extent_hole_real()
2690 error = xfs_bmbt_update(cur, &left); in xfs_bmap_add_extent_hole_real()
2702 old = left; in xfs_bmap_add_extent_hole_real()
2720 error = xfs_bmbt_update(cur, &left); in xfs_bmap_add_extent_hole_real()
5514 if ((left->br_startoff + left->br_blockcount != startoff) || in xfs_bmse_can_merge()
5515 (left->br_startblock + left->br_blockcount != got->br_startblock) || in xfs_bmse_can_merge()
5556 new = *left; in xfs_bmse_merge()
[all …]
|
| /fs/dlm/ |
| A D | dir.c | 84 int left; in dlm_recover_directory() local
102 left = le16_to_cpu(ls->ls_recover_buf->rc_header.h_length); in dlm_recover_directory()
103 left -= sizeof(struct dlm_rcom); in dlm_recover_directory()
109 if (left < sizeof(__be16)) in dlm_recover_directory()
115 left -= sizeof(__be16); in dlm_recover_directory()
126 if (namelen > left) in dlm_recover_directory()
177 left -= namelen; in dlm_recover_directory()
|
| /fs/nfs/blocklayout/ |
| A D | extent_tree.c | 98 struct pnfs_block_extent *left = ext_tree_prev(be); in ext_try_to_merge_left() local
100 if (left && ext_can_merge(left, be)) { in ext_try_to_merge_left()
101 left->be_length += be->be_length; in ext_try_to_merge_left()
105 return left; in ext_try_to_merge_left()
434 struct pnfs_block_extent *left = ext_tree_prev(be); in ext_tree_mark_written() local
436 if (left && ext_can_merge(left, be)) { in ext_tree_mark_written()
439 left->be_length += diff; in ext_tree_mark_written()
|
| /fs/ |
| A D | splice.c | 690 size_t left; in iter_file_splice_write() local
712 left = sd.total_len; in iter_file_splice_write()
720 this_len = min(this_len, left); in iter_file_splice_write()
731 left -= this_len; in iter_file_splice_write()
742 WARN_ONCE(ret > sd.total_len - left, in iter_file_splice_write()
744 ret, sd.total_len, left); in iter_file_splice_write()
1458 ssize_t left; in iter_to_pipe() local
1463 if (left <= 0) { in iter_to_pipe()
1464 ret = left; in iter_to_pipe()
1477 iov_iter_revert(from, left); in iter_to_pipe()
[all …]
|
| A D | locks.c | 1152 struct file_lock *left = NULL; in posix_lock_inode() local
1287 left = fl; in posix_lock_inode()
1331 if (right && left == right && !new_fl2) in posix_lock_inode()
1353 if (left == right) { in posix_lock_inode()
1357 left = new_fl2; in posix_lock_inode()
1359 locks_copy_lock(left, right); in posix_lock_inode()
1360 locks_insert_lock_ctx(&left->c, &fl->c.flc_list); in posix_lock_inode()
1365 if (left) { in posix_lock_inode()
1366 left->fl_end = request->fl_start - 1; in posix_lock_inode()
1367 locks_wake_up_blocks(&left->c); in posix_lock_inode()
|
| /fs/xfs/ |
| A D | xfs_iomap.c | 1264 if (isnullstartblock(left.br_startblock)) in xfs_bmap_add_extent_hole_delay()
1283 left.br_startoff + left.br_blockcount == new->br_startoff && in xfs_bmap_add_extent_hole_delay()
1291 (left.br_blockcount + new->br_blockcount + in xfs_bmap_add_extent_hole_delay()
1308 oldlen = startblockval(left.br_startblock) + in xfs_bmap_add_extent_hole_delay()
1313 left.br_startblock = nullstartblock(newlen); in xfs_bmap_add_extent_hole_delay()
1314 left.br_blockcount = temp; in xfs_bmap_add_extent_hole_delay()
1318 xfs_iext_update_extent(ip, state, icur, &left); in xfs_bmap_add_extent_hole_delay()
1327 temp = left.br_blockcount + new->br_blockcount; in xfs_bmap_add_extent_hole_delay()
1329 oldlen = startblockval(left.br_startblock) + in xfs_bmap_add_extent_hole_delay()
1333 left.br_blockcount = temp; in xfs_bmap_add_extent_hole_delay()
[all …]
|
| /fs/ocfs2/ |
| A D | localalloc.c | 828 int numfound = 0, bitoff, left, startoff; in ocfs2_local_alloc_find_clear_bits() local
866 left = le32_to_cpu(alloc->id1.bitmap1.i_total); in ocfs2_local_alloc_find_clear_bits()
867 while ((bitoff = ocfs2_find_next_zero_bit(bitmap, left, startoff)) < in ocfs2_local_alloc_find_clear_bits()
868 left) { in ocfs2_local_alloc_find_clear_bits()
949 int bit_off, left, count, start; in ocfs2_sync_local_to_main() local
972 left = le32_to_cpu(alloc->id1.bitmap1.i_total); in ocfs2_sync_local_to_main()
975 bit_off = ocfs2_find_next_zero_bit(bitmap, left, start); in ocfs2_sync_local_to_main()
976 if ((bit_off < left) && (bit_off == start)) { in ocfs2_sync_local_to_main()
1001 if (bit_off >= left) in ocfs2_sync_local_to_main()
|
| /fs/nilfs2/ |
| A D | btree.c | 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()
206 nilfs_btree_node_set_nchildren(left, lnchildren); in nilfs_btree_node_move_left()
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()
844 struct nilfs_btree_node *node, *left; in nilfs_btree_carry_left() local
848 left = nilfs_btree_get_sib_node(path, level); in nilfs_btree_carry_left()
1292 struct nilfs_btree_node *node, *left; in nilfs_btree_borrow_left() local
1298 left = nilfs_btree_get_sib_node(path, level); in nilfs_btree_borrow_left()
1357 struct nilfs_btree_node *node, *left; in nilfs_btree_concat_left() local
[all …]
|
| /fs/minix/ |
| A 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/ |
| A D | befs_fs_types.h | 241 fs64 left; member
249 befs_off_t left; member
|
| /fs/proc/ |
| A D | kcore.c | 526 size_t read = 0, left = tsz; in read_kcore_iter() local
534 read += vread_iter(iter, src, left); in read_kcore_iter()
539 left -= read; in read_kcore_iter()
541 if (fault_in_iov_iter_writeable(iter, left)) { in read_kcore_iter()
|
| /fs/ntfs3/ |
| A D | record.c | 14 static inline int compare_attr(const struct ATTRIB *left, enum ATTR_TYPE type, in compare_attr() argument
19 int diff = le32_to_cpu(left->type) - le32_to_cpu(type); in compare_attr()
25 return ntfs_cmp_names(attr_name(left), left->name_len, name, name_len, in compare_attr()
|
| /fs/omfs/ |
| A D | file.c | 192 sector_t block, int count, int *left) in find_block() argument
206 *left = numblocks - (block - searched); in find_block()
|
| /fs/resctrl/ |
| A D | Kconfig | 19 controls and monitors are left in a quiescent, permissive state.
|