Lines Matching defs:path
113 struct btrfs_path *path;
118 path = btrfs_alloc_path();
119 if (!path)
138 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
142 if (path->slots[0] == 0)
144 path->slots[0]--;
150 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
162 ret = btrfs_del_items(trans, root, path, path->slots[0], 1);
168 btrfs_release_path(path);
174 btrfs_free_path(path);
221 struct btrfs_path *path;
230 path = btrfs_alloc_path();
231 if (!path)
252 ret = btrfs_insert_empty_item(trans, root, path, &key, copy_bytes);
258 leaf = path->nodes[0];
260 data = btrfs_item_ptr(leaf, path->slots[0], void);
267 btrfs_release_path(path);
271 btrfs_free_path(path);
300 struct btrfs_path *path;
314 path = btrfs_alloc_path();
315 if (!path)
319 path->reada = READA_FORWARD;
325 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
330 if (path->slots[0] == 0)
332 path->slots[0]--;
336 leaf = path->nodes[0];
337 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
342 item_end = btrfs_item_size(leaf, path->slots[0]) + key.offset;
378 data = btrfs_item_ptr(leaf, path->slots[0], void);
392 path->slots[0]++;
393 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
398 ret = btrfs_next_leaf(root, path);
408 btrfs_free_path(path);
435 * simply ignore them here, because we only invoke the verity path in