Lines Matching refs:path
21 struct btrfs_path *path;
33 path = btrfs_alloc_path();
34 if (!path) {
39 path->leave_spinning = 1;
40 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size);
43 btrfs_free_path(path);
47 leaf = path->nodes[0];
48 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
63 btrfs_free_path(path);
72 struct btrfs_path *path;
83 path = btrfs_alloc_path();
84 if (!path) {
89 path->leave_spinning = 1;
90 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1);
93 btrfs_free_path(path);
97 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
99 refs = btrfs_extent_refs(path->nodes[0], item);
100 btrfs_set_extent_refs(path->nodes[0], item, refs + 1);
101 btrfs_release_path(path);
112 ret = btrfs_insert_empty_item(&trans, root, path, &key, 0);
115 btrfs_free_path(path);
124 struct btrfs_path *path;
133 path = btrfs_alloc_path();
134 if (!path) {
138 path->leave_spinning = 1;
140 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
143 btrfs_free_path(path);
146 btrfs_del_item(&trans, root, path);
147 btrfs_free_path(path);
156 struct btrfs_path *path;
167 path = btrfs_alloc_path();
168 if (!path) {
173 path->leave_spinning = 1;
174 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1);
177 btrfs_free_path(path);
181 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
183 refs = btrfs_extent_refs(path->nodes[0], item);
184 btrfs_set_extent_refs(path->nodes[0], item, refs - 1);
185 btrfs_release_path(path);
196 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
199 btrfs_free_path(path);
202 btrfs_del_item(&trans, root, path);
203 btrfs_free_path(path);