Lines Matching defs:path
648 struct btrfs_path *path,
750 ret = btrfs_insert_empty_items(trans, root, path, &batch);
757 data_ptr = btrfs_item_ptr(path->nodes[0], path->slots[0], char);
758 write_extent_buffer(path->nodes[0], &curr->data,
760 path->slots[0]++;
764 * Now release our path before releasing the delayed items and their
768 btrfs_release_path(path);
813 struct btrfs_path *path,
828 ret = btrfs_insert_delayed_item(trans, root, path, curr);
837 struct btrfs_path *path,
843 struct extent_buffer *leaf = path->nodes[0];
851 slot = path->slots[0];
854 * Our caller always gives us a path pointing to an existing item, so
889 ret = btrfs_del_items(trans, root, path, path->slots[0], nitems);
914 struct btrfs_path *path,
935 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
951 btrfs_release_path(path);
955 ret = btrfs_batch_delete_items(trans, root, path, item);
956 btrfs_release_path(path);
1003 struct btrfs_path *path,
1022 ret = btrfs_lookup_inode(trans, root, path, &key, mod);
1028 leaf = path->nodes[0];
1029 inode_item = btrfs_item_ptr(leaf, path->slots[0],
1038 path->slots[0]++;
1039 if (path->slots[0] >= btrfs_header_nritems(leaf))
1042 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1055 ret = btrfs_del_item(trans, root, path);
1058 btrfs_release_path(path);
1074 btrfs_release_path(path);
1079 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1085 leaf = path->nodes[0];
1086 path->slots[0]--;
1092 struct btrfs_path *path,
1103 ret = __btrfs_update_delayed_inode(trans, root, path, node);
1110 struct btrfs_path *path,
1115 ret = btrfs_insert_delayed_items(trans, path, node->root, node);
1119 ret = btrfs_delete_delayed_items(trans, path, node->root, node);
1123 ret = btrfs_update_delayed_inode(trans, node->root, path, node);
1138 struct btrfs_path *path;
1146 path = btrfs_alloc_path();
1147 if (!path)
1157 ret = __btrfs_commit_inode_delayed_items(trans, path,
1167 * See the comment below about releasing path before releasing
1168 * node. If the commit of delayed items was successful the path
1172 ASSERT(path->nodes[0] == NULL);
1177 * Release the path to avoid a potential deadlock and lockdep splat when
1181 * the same btree path (leaf).
1183 btrfs_free_path(path);
1206 struct btrfs_path *path;
1221 path = btrfs_alloc_path();
1222 if (!path) {
1230 ret = __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1233 btrfs_free_path(path);
1244 struct btrfs_path *path;
1265 path = btrfs_alloc_path();
1266 if (!path) {
1277 path, delayed_node);
1282 btrfs_free_path(path);
1316 struct btrfs_path *path;
1325 path = btrfs_alloc_path();
1326 if (!path)
1342 btrfs_release_path(path);
1351 __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1357 btrfs_release_path(path);
1364 btrfs_free_path(path);
1499 * handling path simpler in case we fail (-EEXIST). There's no risk of