Lines Matching defs:path
28 struct btrfs_path *path;
33 path = btrfs_alloc_path();
34 if (!path)
38 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(BTRFS_I(inode)),
48 leaf = path->nodes[0];
75 btrfs_free_path(path);
85 struct btrfs_path *path;
94 path = btrfs_alloc_path();
95 if (!path)
97 path->skip_release_on_error = 1;
100 di = btrfs_lookup_xattr(trans, root, path,
107 ret = btrfs_delete_one_dir_name(trans, root, path, di);
115 * path - we can't race with a concurrent xattr delete, because the VFS
120 di = btrfs_lookup_xattr(NULL, root, path,
128 btrfs_release_path(path);
132 ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(BTRFS_I(inode)),
141 btrfs_assert_tree_locked(path->nodes[0]);
142 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
149 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
168 const int slot = path->slots[0];
169 struct extent_buffer *leaf = path->nodes[0];
188 btrfs_extend_item(path, size - old_data_len);
190 btrfs_truncate_item(path, data_size, 1);
193 ret = btrfs_delete_one_dir_name(trans, root, path, di);
196 btrfs_extend_item(path, data_size);
209 * Insert, and we had space for the xattr, so path->slots[0] is
215 btrfs_free_path(path);
279 struct btrfs_path *path;
292 path = btrfs_alloc_path();
293 if (!path)
295 path->reada = READA_FORWARD;
298 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
310 leaf = path->nodes[0];
311 slot = path->slots[0];
313 /* this is where we start walking through the path */
319 ret = btrfs_next_leaf(root, path);
369 path->slots[0]++;
374 btrfs_free_path(path);