Lines Matching defs:path

83 					       struct btrfs_path *path,
99 	ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
103 		btrfs_release_path(path);
107 	leaf = path->nodes[0];
108 	header = btrfs_item_ptr(leaf, path->slots[0],
112 	btrfs_release_path(path);
119 	inode = btrfs_iget_path(location.objectid, root, path);
120 	btrfs_release_path(path);
133 		struct btrfs_path *path)
146 	inode = __lookup_free_space_inode(fs_info->tree_root, path,
168 				     struct btrfs_path *path,
181 	ret = btrfs_insert_empty_inode(trans, root, path, ino);
185 	leaf = path->nodes[0];
186 	inode_item = btrfs_item_ptr(leaf, path->slots[0],
188 	btrfs_item_key(leaf, &disk_key, path->slots[0]);
201 	btrfs_release_path(path);
206 	ret = btrfs_insert_empty_item(trans, root, path, &key,
209 		btrfs_release_path(path);
213 	leaf = path->nodes[0];
214 	header = btrfs_item_ptr(leaf, path->slots[0],
218 	btrfs_release_path(path);
225 			    struct btrfs_path *path)
234 	return __create_free_space_inode(trans->fs_info->tree_root, trans, path,
247 	BTRFS_PATH_AUTO_FREE(path);
251 	path = btrfs_alloc_path();
252 	if (!path)
256 		inode = lookup_free_space_inode(block_group, path);
283 	ret = btrfs_search_slot(trans, trans->fs_info->tree_root, &key, path,
290 	return btrfs_del_item(trans, trans->fs_info->tree_root, path);
311 		BTRFS_PATH_AUTO_FREE(path);
313 		path = btrfs_alloc_path();
314 		if (!path) {
323 			btrfs_wait_cache_io(trans, block_group, path);
735 				   struct btrfs_path *path, u64 offset)
758 	ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
762 		btrfs_release_path(path);
768 	leaf = path->nodes[0];
769 	header = btrfs_item_ptr(leaf, path->slots[0],
774 	btrfs_release_path(path);
945 	struct btrfs_path *path;
968 	path = btrfs_alloc_path();
969 	if (!path)
971 	path->search_commit_root = true;
972 	path->skip_locking = true;
975 	 * We must pass a path with search_commit_root set to btrfs_iget in
993 	inode = lookup_free_space_inode(block_group, path);
995 		btrfs_free_path(path);
1003 		btrfs_free_path(path);
1017 				      path, block_group->start);
1018 	btrfs_free_path(path);
1148 		  struct btrfs_path *path, u64 offset,
1160 	ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
1166 	leaf = path->nodes[0];
1169 		ASSERT(path->slots[0]);
1170 		path->slots[0]--;
1171 		btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1177 			btrfs_release_path(path);
1183 	header = btrfs_item_ptr(leaf, path->slots[0],
1188 	btrfs_release_path(path);
1298 				 struct btrfs_path *path, u64 offset)
1312 	ret = update_cache_item(trans, root, inode, path, offset,
1354 			struct btrfs_path *path)
1358 				     path, block_group->start);
1521 			  struct btrfs_path *path)
1535 	inode = lookup_free_space_inode(block_group, path);
2444  * find_free_extent().  Rule 2 enables coalescing based on the common path
2449  * the reuse path.