fs/btrfs/xattr.c

32 	struct btrfs_path *path;
37 	path = btrfs_alloc_path();
38 	if (!path)
42 	di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(BTRFS_I(inode)),
52 	leaf = path->nodes[0];
79 	btrfs_free_path(path);
88 	struct btrfs_path *path;
97 	path = btrfs_alloc_path();
98 	if (!path)
100 	path->skip_release_on_error = 1;
103 		di = btrfs_lookup_xattr(trans, root, path,
110 			ret = btrfs_delete_one_dir_name(trans, root, path, di);
118 	 * path - we can't race with a concurrent xattr delete, because the VFS
123 		di = btrfs_lookup_xattr(NULL, root, path,
131 		btrfs_release_path(path);
135 	ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(BTRFS_I(inode)),
144 		btrfs_assert_tree_write_locked(path->nodes[0]);
145 		di = btrfs_match_dir_item_name(path, name, name_len);
152 		di = btrfs_match_dir_item_name(path, name, name_len);
171 		const int slot = path->slots[0];
172 		struct extent_buffer *leaf = path->nodes[0];
190 				btrfs_extend_item(trans, path, size - old_data_len);
192 				btrfs_truncate_item(trans, path, data_size, 1);
195 			ret = btrfs_delete_one_dir_name(trans, root, path, di);
198 			btrfs_extend_item(trans, path, data_size);
209 		 * Insert, and we had space for the xattr, so path->slots[0] is
215 	btrfs_free_path(path);
281 	struct btrfs_path *path;
295 	path = btrfs_alloc_path();
296 	if (!path)
298 	path->reada = READA_FORWARD;
301 	btrfs_for_each_slot(root, &key, &found_key, path, iter_ret) {
308 		leaf = path->nodes[0];
309 		slot = path->slots[0];
357 	btrfs_free_path(path);