fs/btrfs/delayed-inode.c

631 				     struct btrfs_path *path,
733 	ret = btrfs_insert_empty_items(trans, root, path, &batch);
740 		data_ptr = btrfs_item_ptr(path->nodes[0], path->slots[0], char);
741 		write_extent_buffer(path->nodes[0], &curr->data,
743 		path->slots[0]++;
747 	 * Now release our path before releasing the delayed items and their
751 	btrfs_release_path(path);
796 				      struct btrfs_path *path,
811 		ret = btrfs_insert_delayed_item(trans, root, path, curr);
820 				    struct btrfs_path *path,
826 	struct extent_buffer *leaf = path->nodes[0];
834 	slot = path->slots[0];
837 	 * Our caller always gives us a path pointing to an existing item, so
872 	ret = btrfs_del_items(trans, root, path, path->slots[0], nitems);
897 				      struct btrfs_path *path,
918 		ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
934 			btrfs_release_path(path);
938 			ret = btrfs_batch_delete_items(trans, root, path, item);
939 			btrfs_release_path(path);
986 					struct btrfs_path *path,
1005 	ret = btrfs_lookup_inode(trans, root, path, &key, mod);
1019 	leaf = path->nodes[0];
1020 	inode_item = btrfs_item_ptr(leaf, path->slots[0],
1035 	if (path->slots[0] + 1 >= btrfs_header_nritems(leaf)) {
1040 		btrfs_release_path(path);
1041 		ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1047 		ASSERT(path->slots[0] > 0);
1049 		path->slots[0]--;
1050 		leaf = path->nodes[0];
1052 		path->slots[0]++;
1054 	btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1066 	ret = btrfs_del_item(trans, root, path);
1071 	btrfs_release_path(path);
1080 					     struct btrfs_path *path,
1091 	ret = __btrfs_update_delayed_inode(trans, root, path, node);
1098 				   struct btrfs_path *path,
1103 	ret = btrfs_insert_delayed_items(trans, path, node->root, node);
1107 	ret = btrfs_delete_delayed_items(trans, path, node->root, node);
1114 	ret = btrfs_update_delayed_inode(trans, node->root, path, node);
1129 	struct btrfs_path *path;
1137 	path = btrfs_alloc_path();
1138 	if (!path)
1148 		ret = __btrfs_commit_inode_delayed_items(trans, path,
1158 		 * See the comment below about releasing path before releasing
1159 		 * node. If the commit of delayed items was successful the path
1163 		ASSERT(path->nodes[0] == NULL);
1168 	 * Release the path to avoid a potential deadlock and lockdep splat when
1172 	 * the same btree path (leaf).
1174 	btrfs_free_path(path);
1197 	BTRFS_PATH_AUTO_FREE(path);
1212 	path = btrfs_alloc_path();
1213 	if (!path) {
1221 	ret = __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1234 	struct btrfs_path *path;
1255 	path = btrfs_alloc_path();
1256 	if (!path) {
1267 						   path, delayed_node);
1272 	btrfs_free_path(path);
1306 	struct btrfs_path *path;
1315 	path = btrfs_alloc_path();
1316 	if (!path)
1332 			btrfs_release_path(path);
1341 		__btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1347 		btrfs_release_path(path);
1354 	btrfs_free_path(path);
1491 	 * handling path simpler in case we fail (-EEXIST). There's no risk of