Lines Matching defs:path
695 struct btrfs_path *path,
711 BUG_ON(!path->nodes[0]);
713 leaf = path->nodes[0];
746 * to sleep, so we set all locked nodes in the path to blocking locks
749 btrfs_set_path_blocking(path);
772 setup_items_for_insert(root, path, keys, data_size, nitems);
775 slot = path->slots[0];
802 struct btrfs_path *path,
811 ret = btrfs_insert_empty_item(trans, root, path, &delayed_item->key,
817 leaf = path->nodes[0];
819 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
834 struct btrfs_path *path,
847 ret = btrfs_insert_delayed_item(trans, root, path, curr);
849 btrfs_release_path(path);
857 path->slots[0]++;
858 btrfs_batch_insert_items(root, path, curr);
861 btrfs_mark_buffer_dirty(path->nodes[0]);
863 btrfs_release_path(path);
874 struct btrfs_path *path,
884 BUG_ON(!path->nodes[0]);
886 leaf = path->nodes[0];
888 i = path->slots[0];
921 ret = btrfs_del_items(trans, root, path, path->slots[0], nitems);
936 struct btrfs_path *path,
951 ret = btrfs_search_slot(trans, root, &curr->key, path, -1, 1);
964 btrfs_release_path(path);
972 btrfs_batch_delete_items(trans, root, path, curr);
973 btrfs_release_path(path);
978 btrfs_release_path(path);
1012 struct btrfs_path *path,
1033 ret = btrfs_lookup_inode(trans, root, path, &key, mod);
1040 leaf = path->nodes[0];
1041 inode_item = btrfs_item_ptr(leaf, path->slots[0],
1050 path->slots[0]++;
1051 if (path->slots[0] >= btrfs_header_nritems(leaf))
1054 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1067 btrfs_del_item(trans, root, path);
1071 btrfs_release_path(path);
1087 btrfs_release_path(path);
1093 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1100 leaf = path->nodes[0];
1101 path->slots[0]--;
1107 struct btrfs_path *path,
1118 ret = __btrfs_update_delayed_inode(trans, root, path, node);
1125 struct btrfs_path *path,
1130 ret = btrfs_insert_delayed_items(trans, path, node->root, node);
1134 ret = btrfs_delete_delayed_items(trans, path, node->root, node);
1138 ret = btrfs_update_delayed_inode(trans, node->root, path, node);
1153 struct btrfs_path *path;
1161 path = btrfs_alloc_path();
1162 if (!path)
1164 path->leave_spinning = 1;
1173 ret = __btrfs_commit_inode_delayed_items(trans, path,
1183 * See the comment below about releasing path before releasing
1184 * node. If the commit of delayed items was successful the path
1188 ASSERT(path->nodes[0] == NULL);
1193 * Release the path to avoid a potential deadlock and lockdep splat when
1197 * the same btree path (leaf).
1199 btrfs_free_path(path);
1222 struct btrfs_path *path;
1237 path = btrfs_alloc_path();
1238 if (!path) {
1242 path->leave_spinning = 1;
1247 ret = __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1250 btrfs_free_path(path);
1261 struct btrfs_path *path;
1282 path = btrfs_alloc_path();
1283 if (!path) {
1287 path->leave_spinning = 1;
1295 path, delayed_node);
1300 btrfs_free_path(path);
1334 struct btrfs_path *path;
1343 path = btrfs_alloc_path();
1344 if (!path)
1356 path->leave_spinning = 1;
1361 btrfs_release_path(path);
1370 __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1376 btrfs_release_path(path);
1383 btrfs_free_path(path);