| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | inode-item.c | 78 u64 inode_objectid, u64 ref_objectid, int ins_len, in btrfs_lookup_inode_extref()
88 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); in btrfs_lookup_inode_extref()
258 int ins_len = name_len + sizeof(*extref); in btrfs_insert_inode_extref() local
275 ins_len); in btrfs_insert_inode_extref()
283 btrfs_extend_item(path, ins_len); in btrfs_insert_inode_extref()
292 ptr += btrfs_item_size(leaf, item) - ins_len; in btrfs_insert_inode_extref()
320 int ins_len = name_len + sizeof(*ref); in btrfs_insert_inode_ref() local
333 ins_len); in btrfs_insert_inode_ref()
342 btrfs_extend_item(path, ins_len); in btrfs_insert_inode_ref()
407 int ins_len in btrfs_lookup_inode() local
74 btrfs_lookup_inode_extref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, const char *name, int name_len, u64 inode_objectid, u64 ref_objectid, int ins_len, int cow) btrfs_lookup_inode_extref() argument
[all...] |
| H A D | dir-item.c | 187 int ins_len = mod < 0 ? -1 : 0; in btrfs_lookup_dir_item() local
195 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); in btrfs_lookup_dir_item()
280 int ins_len = mod < 0 ? -1 : 0; in btrfs_lookup_dir_index_item() local
287 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); in btrfs_lookup_dir_index_item()
351 int ins_len = mod < 0 ? -1 : 0; in btrfs_lookup_xattr() local
357 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); in btrfs_lookup_xattr()
|
| H A D | ctree.c | 2483 * the ins_len.
2492 struct extent_buffer *b, int level, int ins_len, in setup_nodes_for_search()
2498 if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= in setup_nodes_for_search()
2518 } else if (ins_len < 0 && btrfs_header_nritems(b) < in setup_nodes_for_search()
2690 * @ins_len: Indicates purpose of search, for inserts it is 1, for
2695 * If @ins_len > 0, nodes and leaves will be split as we walk down the tree.
2696 * If @ins_len < 0, nodes will be merged as we walk down the tree (if possible)
2709 int ins_len, int cow) in btrfs_search_slot()
2724 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2726 BUG_ON(!cow && ins_len); in btrfs_search_slot()
2490 setup_nodes_for_search(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *p, struct extent_buffer *b, int level, int ins_len, int *write_lock_level) setup_nodes_for_search() argument
2707 btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *p, int ins_len, int cow) btrfs_search_slot() argument
4437 setup_leaf_for_split(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int ins_len) setup_leaf_for_split() argument
[all...] |
| H A D | file-item.c | 232 int ins_len = mod < 0 ? -1 : 0; in btrfs_lookup_file_extent() local
238 ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow); in btrfs_lookup_file_extent()
|
| H A D | free-space-tree.c | 117 int ins_len, int cow) in btrfs_search_prev_slot()
121 ret = btrfs_search_slot(trans, root, key, p, ins_len, cow); in btrfs_search_prev_slot()
114 btrfs_search_prev_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_key *key, struct btrfs_path *p, int ins_len, int cow) btrfs_search_prev_slot() argument
|
| H A D | ctree.h | 2737 int ins_len, int cow);
2935 u64 inode_objectid, u64 ref_objectid, int ins_len,
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | inode-item.c | 87 u64 inode_objectid, u64 ref_objectid, int ins_len, in btrfs_lookup_inode_extref()
97 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); in btrfs_lookup_inode_extref()
262 int ins_len = name->len + sizeof(*extref); in btrfs_insert_inode_extref() local
277 ins_len); in btrfs_insert_inode_extref()
285 btrfs_extend_item(trans, path, ins_len); in btrfs_insert_inode_extref()
293 ptr += btrfs_item_size(leaf, path->slots[0]) - ins_len; in btrfs_insert_inode_extref()
320 int ins_len = name->len + sizeof(*ref); in btrfs_insert_inode_ref() local
332 ins_len); in btrfs_insert_inode_ref()
341 btrfs_extend_item(trans, path, ins_len); in btrfs_insert_inode_ref()
405 int ins_len in btrfs_lookup_inode() local
83 btrfs_lookup_inode_extref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, const struct fscrypt_str *name, u64 inode_objectid, u64 ref_objectid, int ins_len, int cow) btrfs_lookup_inode_extref() argument
[all...] |
| H A D | inode-item.h | 100 u64 inode_objectid, u64 ref_objectid, int ins_len,
|
| H A D | ctree.c | 1738 * the ins_len.
1747 struct extent_buffer *b, int level, int ins_len, in setup_nodes_for_search()
1753 if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= in setup_nodes_for_search()
1766 } else if (ins_len < 0 && btrfs_header_nritems(b) < in setup_nodes_for_search()
1969 int ins_len, in search_leaf()
1985 if (ins_len > 0) { in search_leaf()
1996 if (path->locks[1] && leaf_free_space >= ins_len) { in search_leaf()
2060 if (ins_len > 0) { in search_leaf()
2066 * added. If search_for_extension is not set, ins_len already in search_leaf()
2071 ASSERT(ins_len > in search_leaf()
1745 setup_nodes_for_search(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *p, struct extent_buffer *b, int level, int ins_len, int *write_lock_level) setup_nodes_for_search() argument
1965 search_leaf(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *path, int ins_len, int prev_cmp) search_leaf() argument
2124 btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *p, int ins_len, int cow) btrfs_search_slot() argument
3963 setup_leaf_for_split(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int ins_len) setup_leaf_for_split() argument
[all...] |
| H A D | dir-item.c | 183 const int ins_len = (mod < 0 ? -1 : 0); in btrfs_lookup_match_dir() local
187 ret = btrfs_search_slot(trans, root, key, path, ins_len, cow); in btrfs_lookup_match_dir()
|
| H A D | ctree.h | 107 * existing item and ins_len contains only the data size and not item
565 int ins_len, int cow);
|
| H A D | file-item.c | 263 int ins_len = mod < 0 ? -1 : 0; in btrfs_lookup_file_extent() local
270 return btrfs_search_slot(trans, root, &file_key, path, ins_len, cow); in btrfs_lookup_file_extent()
|
| H A D | free-space-tree.c | 136 int ins_len, int cow) in btrfs_search_prev_slot()
140 ret = btrfs_search_slot(trans, root, key, p, ins_len, cow); in btrfs_search_prev_slot()
133 btrfs_search_prev_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_key *key, struct btrfs_path *p, int ins_len, int cow) btrfs_search_prev_slot() argument
|
| /kernel/linux/linux-5.10/fs/ntfs/ |
| H A D | unistr.c | 226 * @ins_len: length of input string in bytes
246 const int ins_len, ntfschar **outs) in ntfs_nlstoucs()
257 for (i = o = 0; i < ins_len; i += wc_len) { in ntfs_nlstoucs()
258 wc_len = nls->char2uni(ins + i, ins_len - i, in ntfs_nlstoucs()
301 * @ins_len: length of input string in Unicode characters
306 * @ins_len into the string format dictated by the loaded NLS.
323 const int ins_len, unsigned char **outs, int outs_len) in ntfs_ucstonls()
338 ns_len = ins_len * NLS_MAX_CHARSET_SIZE; in ntfs_ucstonls()
343 for (i = o = 0; i < ins_len; i++) { in ntfs_ucstonls()
245 ntfs_nlstoucs(const ntfs_volume *vol, const char *ins, const int ins_len, ntfschar **outs) ntfs_nlstoucs() argument
322 ntfs_ucstonls(const ntfs_volume *vol, const ntfschar *ins, const int ins_len, unsigned char **outs, int outs_len) ntfs_ucstonls() argument
|
| H A D | ntfs.h | 114 const int ins_len, ntfschar **outs);
116 const int ins_len, unsigned char **outs, int outs_len);
|
| /kernel/linux/linux-6.6/fs/ntfs/ |
| H A D | unistr.c | 226 * @ins_len: length of input string in bytes
246 const int ins_len, ntfschar **outs) in ntfs_nlstoucs()
257 for (i = o = 0; i < ins_len; i += wc_len) { in ntfs_nlstoucs()
258 wc_len = nls->char2uni(ins + i, ins_len - i, in ntfs_nlstoucs()
301 * @ins_len: length of input string in Unicode characters
306 * @ins_len into the string format dictated by the loaded NLS.
323 const int ins_len, unsigned char **outs, int outs_len) in ntfs_ucstonls()
338 ns_len = ins_len * NLS_MAX_CHARSET_SIZE; in ntfs_ucstonls()
343 for (i = o = 0; i < ins_len; i++) { in ntfs_ucstonls()
245 ntfs_nlstoucs(const ntfs_volume *vol, const char *ins, const int ins_len, ntfschar **outs) ntfs_nlstoucs() argument
322 ntfs_ucstonls(const ntfs_volume *vol, const ntfschar *ins, const int ins_len, unsigned char **outs, int outs_len) ntfs_ucstonls() argument
|
| H A D | ntfs.h | 114 const int ins_len, ntfschar **outs);
116 const int ins_len, unsigned char **outs, int outs_len);
|