21 						   struct btrfs_path *path,  in insert_with_overflow()  argument
32 	ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);  in insert_with_overflow()
35 		di = btrfs_match_dir_item_name(fs_info, path, name, name_len);  in insert_with_overflow()
38 		btrfs_extend_item(path, data_size);  in insert_with_overflow()
42 	leaf = path->nodes[0];  in insert_with_overflow()
43 	ptr = btrfs_item_ptr(leaf, path->slots[0], char);  in insert_with_overflow()
44 	ASSERT(data_size <= btrfs_item_size(leaf, path->slots[0]));  in insert_with_overflow()
45 	ptr += btrfs_item_size(leaf, path->slots[0]) - data_size;  in insert_with_overflow()
55 			    struct btrfs_path *path, u64 objectid,  in btrfs_insert_xattr_item()  argument
75 	dir_item = insert_with_overflow(trans, root, path, &key, data_size,  in btrfs_insert_xattr_item()
81 	leaf = path->nodes[0];  in btrfs_insert_xattr_item()
93 	btrfs_mark_buffer_dirty(path->nodes[0]);  in btrfs_insert_xattr_item()
113 	struct btrfs_path *path;  in btrfs_insert_dir_item()  local
125 	path = btrfs_alloc_path();  in btrfs_insert_dir_item()
126 	if (!path)  in btrfs_insert_dir_item()
132 	dir_item = insert_with_overflow(trans, root, path, &key, data_size,  in btrfs_insert_dir_item()
141 	leaf = path->nodes[0];  in btrfs_insert_dir_item()
158 	btrfs_release_path(path);  in btrfs_insert_dir_item()
163 	btrfs_free_path(path);  in btrfs_insert_dir_item()
173 			struct btrfs_root *root, struct btrfs_path *path,  in btrfs_lookup_match_dir()  argument
181 	ret = btrfs_search_slot(trans, root, key, path, ins_len, cow);  in btrfs_lookup_match_dir()
187 	return btrfs_match_dir_item_name(root->fs_info, path, name, name_len);  in btrfs_lookup_match_dir()
195  * @path:	Path to use for the search.
208 					     struct btrfs_path *path, u64 dir,  in btrfs_lookup_dir_item()  argument
219 	di = btrfs_lookup_match_dir(trans, root, path, &key, name, name_len, mod);  in btrfs_lookup_dir_item()
235 	struct btrfs_path *path;  in btrfs_check_dir_item_collision()  local
237 	path = btrfs_alloc_path();  in btrfs_check_dir_item_collision()
238 	if (!path)  in btrfs_check_dir_item_collision()
245 	di = btrfs_lookup_match_dir(NULL, root, path, &key, name, name_len, 0);  in btrfs_check_dir_item_collision()
270 	leaf = path->nodes[0];  in btrfs_check_dir_item_collision()
271 	slot = path->slots[0];  in btrfs_check_dir_item_collision()
280 	btrfs_free_path(path);  in btrfs_check_dir_item_collision()
289  * @path:	Path to use for the search.
305 			    struct btrfs_path *path, u64 dir,  in btrfs_lookup_dir_index_item()  argument
316 	di = btrfs_lookup_match_dir(trans, root, path, &key, name, name_len, mod);  in btrfs_lookup_dir_index_item()
325 			    struct btrfs_path *path, u64 dirid,  in btrfs_search_dir_index_item()  argument
336 	btrfs_for_each_slot(root, &key, &key, path, ret) {  in btrfs_search_dir_index_item()
340 		di = btrfs_match_dir_item_name(root->fs_info, path,  in btrfs_search_dir_index_item()
354 					  struct btrfs_path *path, u64 dir,  in btrfs_lookup_xattr()  argument
365 	di = btrfs_lookup_match_dir(trans, root, path, &key, name, name_len, mod);  in btrfs_lookup_xattr()
373  * helper function to look at the directory item pointed to by 'path'
378 						 struct btrfs_path *path,  in btrfs_match_dir_item_name()  argument
388 	leaf = path->nodes[0];  in btrfs_match_dir_item_name()
389 	dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);  in btrfs_match_dir_item_name()
391 	total_len = btrfs_item_size(leaf, path->slots[0]);  in btrfs_match_dir_item_name()
415 			      struct btrfs_path *path,  in btrfs_delete_one_dir_name()  argument
424 	leaf = path->nodes[0];  in btrfs_delete_one_dir_name()
427 	item_len = btrfs_item_size(leaf, path->slots[0]);  in btrfs_delete_one_dir_name()
429 		ret = btrfs_del_item(trans, root, path);  in btrfs_delete_one_dir_name()
435 		start = btrfs_item_ptr_offset(leaf, path->slots[0]);  in btrfs_delete_one_dir_name()
438 		btrfs_truncate_item(path, item_len - sub_item_len, 1);  in btrfs_delete_one_dir_name()