ins_len          2513 fs/btrfs/ctree.c 		       struct extent_buffer *b, int level, int ins_len,
ins_len          2519 fs/btrfs/ctree.c 	if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >=
ins_len          2539 fs/btrfs/ctree.c 	} else if (ins_len < 0 && btrfs_header_nritems(b) <
ins_len          2732 fs/btrfs/ctree.c 		      int ins_len, int cow)
ins_len          2747 fs/btrfs/ctree.c 	WARN_ON(lowest_level && ins_len > 0);
ins_len          2749 fs/btrfs/ctree.c 	BUG_ON(!cow && ins_len);
ins_len          2751 fs/btrfs/ctree.c 	if (ins_len < 0) {
ins_len          2759 fs/btrfs/ctree.c 	} else if (ins_len > 0) {
ins_len          2847 fs/btrfs/ctree.c 		if (!ins_len && !p->keep_locks) {
ins_len          2868 fs/btrfs/ctree.c 					     ins_len, &write_lock_level);
ins_len          2884 fs/btrfs/ctree.c 			if (slot == 0 && ins_len &&
ins_len          2928 fs/btrfs/ctree.c 			if (ins_len > 0 &&
ins_len          2929 fs/btrfs/ctree.c 			    btrfs_leaf_free_space(b) < ins_len) {
ins_len          2938 fs/btrfs/ctree.c 						 p, ins_len, ret == 0);
ins_len          4373 fs/btrfs/ctree.c 					 struct btrfs_path *path, int ins_len)
ins_len          4388 fs/btrfs/ctree.c 	if (btrfs_leaf_free_space(leaf) >= ins_len)
ins_len          4415 fs/btrfs/ctree.c 	if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len)
ins_len          4426 fs/btrfs/ctree.c 	ret = split_leaf(trans, root, &key, path, ins_len, 1);
ins_len          2554 fs/btrfs/ctree.h 		      int ins_len, int cow);
ins_len          2774 fs/btrfs/ctree.h 			  u64 inode_objectid, u64 ref_objectid, int ins_len,
ins_len           187 fs/btrfs/dir-item.c 	int ins_len = mod < 0 ? -1 : 0;
ins_len           195 fs/btrfs/dir-item.c 	ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
ins_len           280 fs/btrfs/dir-item.c 	int ins_len = mod < 0 ? -1 : 0;
ins_len           287 fs/btrfs/dir-item.c 	ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
ins_len           351 fs/btrfs/dir-item.c 	int ins_len = mod < 0 ? -1 : 0;
ins_len           357 fs/btrfs/dir-item.c 	ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
ins_len           141 fs/btrfs/file-item.c 	int ins_len = mod < 0 ? -1 : 0;
ins_len           147 fs/btrfs/file-item.c 	ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
ins_len           114 fs/btrfs/free-space-tree.c 				  int ins_len, int cow)
ins_len           118 fs/btrfs/free-space-tree.c 	ret = btrfs_search_slot(trans, root, key, p, ins_len, cow);
ins_len            78 fs/btrfs/inode-item.c 			  u64 inode_objectid, u64 ref_objectid, int ins_len,
ins_len            88 fs/btrfs/inode-item.c 	ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
ins_len           258 fs/btrfs/inode-item.c 	int ins_len = name_len + sizeof(*extref);
ins_len           275 fs/btrfs/inode-item.c 				      ins_len);
ins_len           283 fs/btrfs/inode-item.c 		btrfs_extend_item(path, ins_len);
ins_len           292 fs/btrfs/inode-item.c 	ptr += btrfs_item_size(leaf, item) - ins_len;
ins_len           320 fs/btrfs/inode-item.c 	int ins_len = name_len + sizeof(*ref);
ins_len           333 fs/btrfs/inode-item.c 				      ins_len);
ins_len           342 fs/btrfs/inode-item.c 		btrfs_extend_item(path, ins_len);
ins_len           407 fs/btrfs/inode-item.c 	int ins_len = mod < 0 ? -1 : 0;
ins_len           414 fs/btrfs/inode-item.c 	ret = btrfs_search_slot(trans, root, location, path, ins_len, cow);
ins_len           114 fs/ntfs/ntfs.h 		const int ins_len, ntfschar **outs);
ins_len           116 fs/ntfs/ntfs.h 		const int ins_len, unsigned char **outs, int outs_len);
ins_len           246 fs/ntfs/unistr.c 		const int ins_len, ntfschar **outs)
ins_len           257 fs/ntfs/unistr.c 			for (i = o = 0; i < ins_len; i += wc_len) {
ins_len           258 fs/ntfs/unistr.c 				wc_len = nls->char2uni(ins + i, ins_len - i,
ins_len           323 fs/ntfs/unistr.c 		const int ins_len, unsigned char **outs, int outs_len)
ins_len           338 fs/ntfs/unistr.c 			ns_len = ins_len * NLS_MAX_CHARSET_SIZE;
ins_len           343 fs/ntfs/unistr.c 		for (i = o = 0; i < ins_len; i++) {