24 						   struct btrfs_path *path,  in insert_with_overflow()  argument
34 	ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);  in insert_with_overflow()
37 		di = btrfs_match_dir_item_name(path, name, name_len);  in insert_with_overflow()
40 		btrfs_extend_item(trans, path, data_size);  in insert_with_overflow()
44 	leaf = path->nodes[0];  in insert_with_overflow()
45 	ptr = btrfs_item_ptr(leaf, path->slots[0], char);  in insert_with_overflow()
46 	ASSERT(data_size <= btrfs_item_size(leaf, path->slots[0]));  in insert_with_overflow()
47 	ptr += btrfs_item_size(leaf, path->slots[0]) - data_size;  in insert_with_overflow()
57 			    struct btrfs_path *path, u64 objectid,  in btrfs_insert_xattr_item()  argument
77 	dir_item = insert_with_overflow(trans, root, path, &key, data_size,  in btrfs_insert_xattr_item()
83 	leaf = path->nodes[0];  in btrfs_insert_xattr_item()
114 	struct btrfs_path *path;  in btrfs_insert_dir_item()  local
126 	path = btrfs_alloc_path();  in btrfs_insert_dir_item()
127 	if (!path)  in btrfs_insert_dir_item()
133 	dir_item = insert_with_overflow(trans, root, path, &key, data_size,  in btrfs_insert_dir_item()
145 	leaf = path->nodes[0];  in btrfs_insert_dir_item()
161 	btrfs_release_path(path);  in btrfs_insert_dir_item()
166 	btrfs_free_path(path);  in btrfs_insert_dir_item()
176 			struct btrfs_root *root, struct btrfs_path *path,  in btrfs_lookup_match_dir()  argument
184 	ret = btrfs_search_slot(trans, root, key, path, ins_len, cow);  in btrfs_lookup_match_dir()
190 	return btrfs_match_dir_item_name(path, name, name_len);  in btrfs_lookup_match_dir()
198  * @path:	Path to use for the search.
211 					     struct btrfs_path *path, u64 dir,  in btrfs_lookup_dir_item()  argument
222 	di = btrfs_lookup_match_dir(trans, root, path, &key, name->name,  in btrfs_lookup_dir_item()
239 	BTRFS_PATH_AUTO_FREE(path);  in btrfs_check_dir_item_collision()
241 	path = btrfs_alloc_path();  in btrfs_check_dir_item_collision()
242 	if (!path)  in btrfs_check_dir_item_collision()
249 	di = btrfs_lookup_match_dir(NULL, root, path, &key, name->name,  in btrfs_check_dir_item_collision()
269 	leaf = path->nodes[0];  in btrfs_check_dir_item_collision()
270 	slot = path->slots[0];  in btrfs_check_dir_item_collision()
285  * @path:	Path to use for the search.
301 			    struct btrfs_path *path, u64 dir,  in btrfs_lookup_dir_index_item()  argument
311 	di = btrfs_lookup_match_dir(trans, root, path, &key, name->name,  in btrfs_lookup_dir_index_item()
320 btrfs_search_dir_index_item(struct btrfs_root *root, struct btrfs_path *path,  in btrfs_search_dir_index_item()  argument
331 	btrfs_for_each_slot(root, &key, &key, path, ret) {  in btrfs_search_dir_index_item()
335 		di = btrfs_match_dir_item_name(path, name->name, name->len);  in btrfs_search_dir_index_item()
348 					  struct btrfs_path *path, u64 dir,  in btrfs_lookup_xattr()  argument
359 	di = btrfs_lookup_match_dir(trans, root, path, &key, name, name_len, mod);  in btrfs_lookup_xattr()
367  * helper function to look at the directory item pointed to by 'path'
371 struct btrfs_dir_item *btrfs_match_dir_item_name(const struct btrfs_path *path,  in btrfs_match_dir_item_name()  argument
381 	leaf = path->nodes[0];  in btrfs_match_dir_item_name()
382 	dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);  in btrfs_match_dir_item_name()
384 	total_len = btrfs_item_size(leaf, path->slots[0]);  in btrfs_match_dir_item_name()
408 			      struct btrfs_path *path,  in btrfs_delete_one_dir_name()  argument
417 	leaf = path->nodes[0];  in btrfs_delete_one_dir_name()
420 	item_len = btrfs_item_size(leaf, path->slots[0]);  in btrfs_delete_one_dir_name()
422 		ret = btrfs_del_item(trans, root, path);  in btrfs_delete_one_dir_name()
428 		start = btrfs_item_ptr_offset(leaf, path->slots[0]);  in btrfs_delete_one_dir_name()
431 		btrfs_truncate_item(trans, path, item_len - sub_item_len, 1);  in btrfs_delete_one_dir_name()