2 * Copyright (C) 2010 Red Hat, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 #include "xfs_format.h"
20 #include "xfs_log_format.h"
21 #include "xfs_trans_resv.h"
24 #include "xfs_mount.h"
25 #include "xfs_quota.h"
26 #include "xfs_alloc_btree.h"
27 #include "xfs_bmap_btree.h"
28 #include "xfs_ialloc_btree.h"
29 #include "xfs_btree.h"
30 #include "xfs_inode.h"
31 #include "xfs_alloc.h"
32 #include "xfs_error.h"
33 #include "xfs_extent_busy.h"
34 #include "xfs_discard.h"
35 #include "xfs_trace.h"
45 __uint64_t *blocks_trimmed)
47 struct block_device *bdev = mp->m_ddev_targp->bt_bdev;
48 struct xfs_btree_cur *cur;
50 struct xfs_perag *pag;
54 pag = xfs_perag_get(mp, agno);
56 error = xfs_alloc_read_agf(mp, NULL, agno, 0, &agbp);
60 cur = xfs_allocbt_init_cursor(mp, NULL, agbp, agno, XFS_BTNUM_CNT);
63 * Force out the log. This means any transactions that might have freed
64 * space before we took the AGF buffer lock are now on disk, and the
65 * volatile disk cache is flushed.
67 xfs_log_force(mp, XFS_LOG_SYNC);
70 * Look up the longest btree in the AGF and start with it.
72 error = xfs_alloc_lookup_ge(cur, 0,
73 be32_to_cpu(XFS_BUF_TO_AGF(agbp)->agf_longest), &i);
78 * Loop until we are done with all extents that are large
79 * enough to be worth discarding.
87 error = xfs_alloc_get_rec(cur, &fbno, &flen, &i);
90 XFS_WANT_CORRUPTED_GOTO(i == 1, out_del_cursor);
91 ASSERT(flen <= be32_to_cpu(XFS_BUF_TO_AGF(agbp)->agf_longest));
94 * use daddr format for all range/len calculations as that is
95 * the format the range/len variables are supplied in by
98 dbno = XFS_AGB_TO_DADDR(mp, agno, fbno);
99 dlen = XFS_FSB_TO_BB(mp, flen);
102 * Too small? Give up.
105 trace_xfs_discard_toosmall(mp, agno, fbno, flen);
110 * If the extent is entirely outside of the range we are
111 * supposed to discard skip it. Do not bother to trim
112 * down partially overlapping ranges for now.
114 if (dbno + dlen < start || dbno > end) {
115 trace_xfs_discard_exclude(mp, agno, fbno, flen);
120 * If any blocks in the range are still busy, skip the
121 * discard and try again the next time.
123 if (xfs_extent_busy_search(mp, agno, fbno, flen)) {
124 trace_xfs_discard_busy(mp, agno, fbno, flen);
128 trace_xfs_discard_extent(mp, agno, fbno, flen);
129 error = -blkdev_issue_discard(bdev, dbno, dlen, GFP_NOFS, 0);
132 *blocks_trimmed += flen;
135 error = xfs_btree_decrement(cur, 0, &i);
141 xfs_btree_del_cursor(cur, error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
149 * trim a range of the filesystem.
151 * Note: the parameters passed from userspace are byte ranges into the
152 * filesystem which does not match to the format we use for filesystem block
153 * addressing. FSB addressing is sparse (AGNO|AGBNO), while the incoming format
154 * is a linear address range. Hence we need to use DADDR based conversions and
155 * comparisons for determining the correct offset and regions to trim.
159 struct xfs_mount *mp,
160 struct fstrim_range __user *urange)
162 struct request_queue *q = mp->m_ddev_targp->bt_bdev->bd_disk->queue;
163 unsigned int granularity = q->limits.discard_granularity;
164 struct fstrim_range range;
165 xfs_daddr_t start, end, minlen;
166 xfs_agnumber_t start_agno, end_agno, agno;
167 __uint64_t blocks_trimmed = 0;
168 int error, last_error = 0;
170 if (!capable(CAP_SYS_ADMIN))
171 return -XFS_ERROR(EPERM);
172 if (!blk_queue_discard(q))
173 return -XFS_ERROR(EOPNOTSUPP);
174 if (copy_from_user(&range, urange, sizeof(range)))
175 return -XFS_ERROR(EFAULT);
178 * Truncating down the len isn't actually quite correct, but using
179 * BBTOB would mean we trivially get overflows for values
180 * of ULLONG_MAX or slightly lower. And ULLONG_MAX is the default
181 * used by the fstrim application. In the end it really doesn't
182 * matter as trimming blocks is an advisory interface.
184 if (range.start >= XFS_FSB_TO_B(mp, mp->m_sb.sb_dblocks) ||
185 range.minlen > XFS_FSB_TO_B(mp, XFS_ALLOC_AG_MAX_USABLE(mp)))
186 return -XFS_ERROR(EINVAL);
188 start = BTOBB(range.start);
189 end = start + BTOBBT(range.len) - 1;
190 minlen = BTOBB(max_t(u64, granularity, range.minlen));
192 if (end > XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks) - 1)
193 end = XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks)- 1;
195 start_agno = xfs_daddr_to_agno(mp, start);
196 end_agno = xfs_daddr_to_agno(mp, end);
198 for (agno = start_agno; agno <= end_agno; agno++) {
199 error = -xfs_trim_extents(mp, agno, start, end, minlen,
208 range.len = XFS_FSB_TO_B(mp, blocks_trimmed);
209 if (copy_to_user(urange, &range, sizeof(range)))
210 return -XFS_ERROR(EFAULT);
216 struct xfs_mount *mp,
217 struct list_head *list)
219 struct xfs_extent_busy *busyp;
222 list_for_each_entry(busyp, list, list) {
223 trace_xfs_discard_extent(mp, busyp->agno, busyp->bno,
226 error = -blkdev_issue_discard(mp->m_ddev_targp->bt_bdev,
227 XFS_AGB_TO_DADDR(mp, busyp->agno, busyp->bno),
228 XFS_FSB_TO_BB(mp, busyp->length),
230 if (error && error != EOPNOTSUPP) {
232 "discard failed for extent [0x%llu,%u], error %d",
233 (unsigned long long)busyp->bno,