Lines Matching defs:path
79 * btrfs_paths remember the path taken from the root down to the leaf.
135 * For shareable roots, we need to use reloc tree and do path
392 * If NULL, btrfs_drop_extents() will allocate and free its own path.
393 * If 'replace_extent' is true, this must not be NULL. Also the path
396 * the path is kept locked.
398 struct btrfs_path *path;
411 * Note: when this is set to true the path must not be NULL.
438 * returned with the path locked, otherwise if it has set this to
439 * false it has returned with the path released.
517 struct btrfs_path *path, u64 min_objectid,
520 struct btrfs_path *path, u64 min_objectid);
522 struct btrfs_path *path,
525 int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path,
529 struct btrfs_path *path,
547 struct btrfs_path *path, int level, int slot);
549 struct btrfs_path *path, u32 data_size);
551 struct btrfs_path *path, u32 new_size, int from_end);
554 struct btrfs_path *path,
559 struct btrfs_path *path,
561 int btrfs_find_item(struct btrfs_root *fs_root, struct btrfs_path *path,
581 struct btrfs_path *path, int slot, int nr);
584 struct btrfs_path *path)
586 return btrfs_del_items(trans, root, path, path->slots[0], 1);
617 struct btrfs_path *path,
624 struct btrfs_path *path,
629 struct btrfs_path *path,
640 return btrfs_insert_empty_items(trans, root, path, &batch);
643 int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path,
647 struct btrfs_path *path);
650 struct btrfs_path *path);
658 * @path: Holds the current slot/leaf.
671 #define btrfs_for_each_slot(root, key, found_key, path, iter_ret) \
672 for (iter_ret = btrfs_search_slot(NULL, (root), (key), (path), 0, 0); \
674 (iter_ret = btrfs_get_next_valid_item((root), (found_key), (path))) == 0; \
675 (path)->slots[0]++ \
678 int btrfs_next_old_item(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq);
686 static inline int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path)
688 return btrfs_next_old_leaf(root, path, 0);