| /linux-4.1.27/fs/btrfs/ |
| H A D | inode-item.c | 100 u64 inode_objectid, u64 ref_objectid, int ins_len, btrfs_lookup_inode_extref()
111 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); btrfs_lookup_inode_extref()
277 int ins_len = name_len + sizeof(*extref); btrfs_insert_inode_extref() local
294 ins_len); btrfs_insert_inode_extref()
300 btrfs_extend_item(root, path, ins_len); btrfs_insert_inode_extref()
309 ptr += btrfs_item_size(leaf, item) - ins_len; btrfs_insert_inode_extref()
336 int ins_len = name_len + sizeof(*ref); btrfs_insert_inode_ref() local
349 ins_len); btrfs_insert_inode_ref()
357 btrfs_extend_item(root, path, ins_len); btrfs_insert_inode_ref()
420 int ins_len = mod < 0 ? -1 : 0; btrfs_lookup_inode() local
427 ret = btrfs_search_slot(trans, root, location, path, ins_len, cow); btrfs_lookup_inode()
96 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
|
| H A D | dir-item.c | 199 int ins_len = mod < 0 ? -1 : 0; btrfs_lookup_dir_item() local
207 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); btrfs_lookup_dir_item()
292 int ins_len = mod < 0 ? -1 : 0; btrfs_lookup_dir_index_item() local
299 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); btrfs_lookup_dir_index_item()
362 int ins_len = mod < 0 ? -1 : 0; btrfs_lookup_xattr() local
368 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); btrfs_lookup_xattr()
|
| H A D | ctree.c | 2514 * the ins_len.
2523 struct extent_buffer *b, int level, int ins_len, setup_nodes_for_search()
2527 if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= setup_nodes_for_search()
2548 } else if (ins_len < 0 && btrfs_header_nritems(b) < setup_nodes_for_search()
2660 * if ins_len > 0, nodes and leaves will be split as we walk down the
2661 * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if
2666 ins_len, int cow) btrfs_search_slot()
2682 WARN_ON(lowest_level && ins_len > 0); btrfs_search_slot()
2684 BUG_ON(!cow && ins_len); btrfs_search_slot()
2686 if (ins_len < 0) { btrfs_search_slot()
2694 } else if (ins_len > 0) { btrfs_search_slot()
2805 * If we're inserting or deleting (ins_len != 0), then we might btrfs_search_slot()
2810 if (!ins_len && !p->keep_locks) { btrfs_search_slot()
2829 ins_len, &write_lock_level); btrfs_search_slot()
2845 if (slot == 0 && ins_len && btrfs_search_slot()
2895 if (ins_len > 0 && btrfs_search_slot()
2896 btrfs_leaf_free_space(root, b) < ins_len) { btrfs_search_slot()
2905 p, ins_len, ret == 0); btrfs_search_slot()
2942 * btrfs_search_slot at that point in time with ins_len and cow both set to 0.
4328 struct btrfs_path *path, int ins_len) setup_leaf_for_split()
4343 if (btrfs_leaf_free_space(root, leaf) >= ins_len) setup_leaf_for_split()
4370 if (btrfs_leaf_free_space(root, path->nodes[0]) >= ins_len) setup_leaf_for_split()
4381 ret = split_leaf(trans, root, &key, path, ins_len, 1); setup_leaf_for_split()
2521 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
2664 btrfs_search_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_slot() argument
4326 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
|
| H A D | file-item.c | 146 int ins_len = mod < 0 ? -1 : 0; btrfs_lookup_file_extent() local
152 ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow); btrfs_lookup_file_extent()
|
| H A D | ctree.h | 3581 ins_len, int cow);
3809 u64 inode_objectid, u64 ref_objectid, int ins_len,
|
| /linux-4.1.27/fs/ntfs/ |
| H A D | unistr.c | 240 * @ins_len: length of input string in bytes
260 const int ins_len, ntfschar **outs) ntfs_nlstoucs()
271 for (i = o = 0; i < ins_len; i += wc_len) { ntfs_nlstoucs()
272 wc_len = nls->char2uni(ins + i, ins_len - i, ntfs_nlstoucs()
315 * @ins_len: length of input string in Unicode characters
320 * @ins_len into the string format dictated by the loaded NLS.
337 const int ins_len, unsigned char **outs, int outs_len) ntfs_ucstonls()
352 ns_len = ins_len * NLS_MAX_CHARSET_SIZE; ntfs_ucstonls()
357 for (i = o = 0; i < ins_len; i++) { ntfs_ucstonls()
259 ntfs_nlstoucs(const ntfs_volume *vol, const char *ins, const int ins_len, ntfschar **outs) ntfs_nlstoucs() argument
336 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 | 128 const int ins_len, ntfschar **outs);
130 const int ins_len, unsigned char **outs, int outs_len);
|