887 static int find_parent_nodes(struct btrfs_trans_handle *trans,  argument
918 	if (!trans) {
931 	ret = btrfs_search_slot(trans, fs_info->extent_root, &key, path, 0, 0);
937 	if (trans && likely(trans->type != __TRANS_DUMMY)) {
939 	if (trans) {
945 		delayed_refs = &trans->transaction->delayed_refs;
947 		head = btrfs_find_delayed_ref_head(trans, bytenr);
1117 static int btrfs_find_all_leafs(struct btrfs_trans_handle *trans,  argument
1128 	ret = find_parent_nodes(trans, fs_info, bytenr,
1151 static int __btrfs_find_all_roots(struct btrfs_trans_handle *trans,  argument
1171 		ret = find_parent_nodes(trans, fs_info, bytenr,
1189 int btrfs_find_all_roots(struct btrfs_trans_handle *trans,  argument
1195 	if (!trans)
1197 	ret = __btrfs_find_all_roots(trans, fs_info, bytenr, time_seq, roots);
1198 	if (!trans)
1216 int btrfs_check_shared(struct btrfs_trans_handle *trans,  argument
1235 	if (trans)
1241 		ret = find_parent_nodes(trans, fs_info, bytenr, elem.seq, tmp,
1257 	if (trans)
1627 	struct btrfs_trans_handle *trans = NULL;  local
1640 		trans = btrfs_join_transaction(fs_info->extent_root);
1641 		if (IS_ERR(trans))
1642 			return PTR_ERR(trans);
1648 	ret = btrfs_find_all_leafs(trans, fs_info, extent_item_objectid,
1656 		ret = __btrfs_find_all_roots(trans, fs_info, ref_node->val,
1678 		btrfs_end_transaction(trans, fs_info->extent_root);