928 static int find_parent_nodes(struct btrfs_trans_handle *trans,  argument
959 	if (!trans) {
975 	ret = btrfs_search_slot(trans, fs_info->extent_root, &key, path, 0, 0);
981 	if (trans && likely(trans->type != __TRANS_DUMMY) &&
984 	if (trans && time_seq != (u64)-1) {
990 		delayed_refs = &trans->transaction->delayed_refs;
992 		head = btrfs_find_delayed_ref_head(trans, bytenr);
1165 static int btrfs_find_all_leafs(struct btrfs_trans_handle *trans,  argument
1176 	ret = find_parent_nodes(trans, fs_info, bytenr,
1199 static int __btrfs_find_all_roots(struct btrfs_trans_handle *trans,  argument
1219 		ret = find_parent_nodes(trans, fs_info, bytenr,
1237 int btrfs_find_all_roots(struct btrfs_trans_handle *trans,  argument
1243 	if (!trans)
1245 	ret = __btrfs_find_all_roots(trans, fs_info, bytenr, time_seq, roots);
1246 	if (!trans)
1264 int btrfs_check_shared(struct btrfs_trans_handle *trans,  argument
1283 	if (trans)
1289 		ret = find_parent_nodes(trans, fs_info, bytenr, elem.seq, tmp,
1305 	if (trans)
1675 	struct btrfs_trans_handle *trans = NULL;  local
1688 		trans = btrfs_join_transaction(fs_info->extent_root);
1689 		if (IS_ERR(trans))
1690 			return PTR_ERR(trans);
1696 	ret = btrfs_find_all_leafs(trans, fs_info, extent_item_objectid,
1704 		ret = __btrfs_find_all_roots(trans, fs_info, ref_node->val,
1726 		btrfs_end_transaction(trans, fs_info->extent_root);