Lines Matching defs:path
22 struct btrfs_path *path = NULL;
41 path = btrfs_alloc_path();
42 if (!path)
68 path->keep_locks = 1;
70 ret = btrfs_search_forward(root, &key, path, BTRFS_OLDEST_GENERATION);
77 btrfs_release_path(path);
80 * leafs from path->nodes[1], so set lowest_level to 1 to avoid later
83 path->lowest_level = 1;
84 wret = btrfs_search_slot(trans, root, &key, path, 0, 1);
90 if (!path->nodes[1]) {
95 * The node at level 1 must always be locked when our path has
97 * path->slots[1].
99 BUG_ON(path->locks[1] == 0);
101 path->nodes[1], 0,
110 * btrfs_find_next_key() can release our path and do another search
111 * without COWing, this is because even with path->keep_locks = 1,
113 * node when path->slots[node_level - 1] does not point to the last
117 path->slots[1] = btrfs_header_nritems(path->nodes[1]);
118 next_key_ret = btrfs_find_next_key(root, path, &key, 1,
125 btrfs_free_path(path);