Lines Matching defs:path
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);
89 struct btrfs_path *path;
98 path = btrfs_alloc_path();
99 if (!path)
101 path->skip_release_on_error = 1;
104 di = btrfs_lookup_xattr(trans, root, path,
111 ret = btrfs_delete_one_dir_name(trans, root, path, di);
119 * path - we can't race with a concurrent xattr delete, because the VFS
124 di = btrfs_lookup_xattr(NULL, root, path,
132 btrfs_release_path(path);
136 ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(BTRFS_I(inode)),
145 btrfs_assert_tree_write_locked(path->nodes[0]);
146 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
153 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
172 const int slot = path->slots[0];
173 struct extent_buffer *leaf = path->nodes[0];
191 btrfs_extend_item(trans, path, size - old_data_len);
193 btrfs_truncate_item(trans, path, data_size, 1);
196 ret = btrfs_delete_one_dir_name(trans, root, path, di);
199 btrfs_extend_item(trans, path, data_size);
211 * Insert, and we had space for the xattr, so path->slots[0] is
217 btrfs_free_path(path);
283 struct btrfs_path *path;
297 path = btrfs_alloc_path();
298 if (!path)
300 path->reada = READA_FORWARD;
303 btrfs_for_each_slot(root, &key, &found_key, path, iter_ret) {
310 leaf = path->nodes[0];
311 slot = path->slots[0];
359 btrfs_free_path(path);