linux-imx

// SPDX-License-Identifier: GPL-2.0

/*

 * Copyright (C) 2010 Red Hat, Inc.

 * All Rights Reserved.

 */

#include "xfs.h"

#include "xfs_format.h"

#include "xfs_log_format.h"

#include "xfs_trans_resv.h"

#include "xfs_sb.h"

#include "xfs_mount.h"

#include "xfs_quota.h"

#include "xfs_inode.h"

#include "xfs_btree.h"

#include "xfs_alloc_btree.h"

#include "xfs_alloc.h"

#include "xfs_error.h"

#include "xfs_extent_busy.h"

#include "xfs_discard.h"

#include "xfs_trace.h"

#include "xfs_log.h"

​

STATIC int

xfs_trim_extents(

    struct xfs_mount    *mp,

    xfs_agnumber_t      agno,

    xfs_daddr_t     start,

    xfs_daddr_t     end,

    xfs_daddr_t     minlen,

    uint64_t        *blocks_trimmed)

{

    struct block_device *bdev = mp->m_ddev_targp->bt_bdev;

    struct xfs_btree_cur    *cur;

    struct xfs_buf      *agbp;

    struct xfs_perag    *pag;

    int         error;

    int         i;

​

    pag = xfs_perag_get(mp, agno);

​

    /*

     * Force out the log.  This means any transactions that might have freed

     * space before we take the AGF buffer lock are now on disk, and the

     * volatile disk cache is flushed.

     */

    xfs_log_force(mp, XFS_LOG_SYNC);

​

    error = xfs_alloc_read_agf(mp, NULL, agno, 0, &agbp);

    if (error || !agbp)

        goto out_put_perag;

​

    cur = xfs_allocbt_init_cursor(mp, NULL, agbp, agno, XFS_BTNUM_CNT);

​

    /*

     * Look up the longest btree in the AGF and start with it.

     */

    error = xfs_alloc_lookup_ge(cur, 0,

                be32_to_cpu(XFS_BUF_TO_AGF(agbp)->agf_longest), &i);

    if (error)

        goto out_del_cursor;

​

    /*

     * Loop until we are done with all extents that are large