Lines Matching defs:path
112 struct btrfs_path *path;
117 path = btrfs_alloc_path();
118 if (!path)
137 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
141 if (path->slots[0] == 0)
143 path->slots[0]--;
149 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
161 ret = btrfs_del_items(trans, root, path, path->slots[0], 1);
167 btrfs_release_path(path);
173 btrfs_free_path(path);
220 struct btrfs_path *path;
229 path = btrfs_alloc_path();
230 if (!path)
251 ret = btrfs_insert_empty_item(trans, root, path, &key, copy_bytes);
257 leaf = path->nodes[0];
259 data = btrfs_item_ptr(leaf, path->slots[0], void);
266 btrfs_release_path(path);
270 btrfs_free_path(path);
299 struct btrfs_path *path;
313 path = btrfs_alloc_path();
314 if (!path)
318 path->reada = READA_FORWARD;
324 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
329 if (path->slots[0] == 0)
331 path->slots[0]--;
335 leaf = path->nodes[0];
336 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
341 item_end = btrfs_item_size(leaf, path->slots[0]) + key.offset;
377 data = btrfs_item_ptr(leaf, path->slots[0], void);
391 path->slots[0]++;
392 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
397 ret = btrfs_next_leaf(root, path);
407 btrfs_free_path(path);
434 * simply ignore them here, because we only invoke the verity path in