xfs: make xfs_*read_agf return EAGAIN to ALLOC_FLAG_TRYLOCK callers
[linux-block.git] / fs / xfs / xfs_discard.c
CommitLineData
0b61f8a4 1// SPDX-License-Identifier: GPL-2.0
a46db608
CH
2/*
3 * Copyright (C) 2010 Red Hat, Inc.
4 * All Rights Reserved.
a46db608
CH
5 */
6#include "xfs.h"
5467b34b 7#include "xfs_shared.h"
6ca1c906 8#include "xfs_format.h"
239880ef
DC
9#include "xfs_log_format.h"
10#include "xfs_trans_resv.h"
7fd36c44 11#include "xfs_sb.h"
a46db608 12#include "xfs_mount.h"
a4fbe6ab
DC
13#include "xfs_btree.h"
14#include "xfs_alloc_btree.h"
a46db608 15#include "xfs_alloc.h"
5f213ddb 16#include "xfs_discard.h"
a46db608 17#include "xfs_error.h"
efc27b52 18#include "xfs_extent_busy.h"
a46db608 19#include "xfs_trace.h"
239880ef 20#include "xfs_log.h"
a46db608
CH
21
22STATIC int
23xfs_trim_extents(
24 struct xfs_mount *mp,
25 xfs_agnumber_t agno,
a66d6363
DC
26 xfs_daddr_t start,
27 xfs_daddr_t end,
28 xfs_daddr_t minlen,
c8ce540d 29 uint64_t *blocks_trimmed)
a46db608
CH
30{
31 struct block_device *bdev = mp->m_ddev_targp->bt_bdev;
32 struct xfs_btree_cur *cur;
33 struct xfs_buf *agbp;
34 struct xfs_perag *pag;
35 int error;
36 int i;
37
38 pag = xfs_perag_get(mp, agno);
39
a46db608
CH
40 /*
41 * Force out the log. This means any transactions that might have freed
8c81dd46 42 * space before we take the AGF buffer lock are now on disk, and the
a46db608
CH
43 * volatile disk cache is flushed.
44 */
45 xfs_log_force(mp, XFS_LOG_SYNC);
46
8c81dd46
CM
47 error = xfs_alloc_read_agf(mp, NULL, agno, 0, &agbp);
48 if (error || !agbp)
49 goto out_put_perag;
50
51 cur = xfs_allocbt_init_cursor(mp, NULL, agbp, agno, XFS_BTNUM_CNT);
52
a46db608
CH
53 /*
54 * Look up the longest btree in the AGF and start with it.
55 */
a66d6363 56 error = xfs_alloc_lookup_ge(cur, 0,
b1c770c2 57 be32_to_cpu(XFS_BUF_TO_AGF(agbp)->agf_longest), &i);
a46db608
CH
58 if (error)
59 goto out_del_cursor;
60
61 /*
62 * Loop until we are done with all extents that are large
63 * enough to be worth discarding.
64 */
65 while (i) {
a66d6363
DC
66 xfs_agblock_t fbno;
67 xfs_extlen_t flen;
68 xfs_daddr_t dbno;
69 xfs_extlen_t dlen;
a46db608
CH
70
71 error = xfs_alloc_get_rec(cur, &fbno, &flen, &i);
72 if (error)
73 goto out_del_cursor;
f9e03706
DW
74 if (XFS_IS_CORRUPT(mp, i != 1)) {
75 error = -EFSCORRUPTED;
76 goto out_del_cursor;
77 }
b1c770c2 78 ASSERT(flen <= be32_to_cpu(XFS_BUF_TO_AGF(agbp)->agf_longest));
a46db608 79
a66d6363
DC
80 /*
81 * use daddr format for all range/len calculations as that is
82 * the format the range/len variables are supplied in by
83 * userspace.
84 */
85 dbno = XFS_AGB_TO_DADDR(mp, agno, fbno);
86 dlen = XFS_FSB_TO_BB(mp, flen);
87
a46db608
CH
88 /*
89 * Too small? Give up.
90 */
a66d6363 91 if (dlen < minlen) {
a46db608
CH
92 trace_xfs_discard_toosmall(mp, agno, fbno, flen);
93 goto out_del_cursor;
94 }
95
96 /*
97 * If the extent is entirely outside of the range we are
98 * supposed to discard skip it. Do not bother to trim
99 * down partially overlapping ranges for now.
100 */
a66d6363 101 if (dbno + dlen < start || dbno > end) {
a46db608
CH
102 trace_xfs_discard_exclude(mp, agno, fbno, flen);
103 goto next_extent;
104 }
105
106 /*
107 * If any blocks in the range are still busy, skip the
108 * discard and try again the next time.
109 */
4ecbfe63 110 if (xfs_extent_busy_search(mp, agno, fbno, flen)) {
a46db608
CH
111 trace_xfs_discard_busy(mp, agno, fbno, flen);
112 goto next_extent;
113 }
114
115 trace_xfs_discard_extent(mp, agno, fbno, flen);
2451337d 116 error = blkdev_issue_discard(bdev, dbno, dlen, GFP_NOFS, 0);
a46db608
CH
117 if (error)
118 goto out_del_cursor;
119 *blocks_trimmed += flen;
120
121next_extent:
122 error = xfs_btree_decrement(cur, 0, &i);
123 if (error)
124 goto out_del_cursor;
3c378195
LC
125
126 if (fatal_signal_pending(current)) {
127 error = -ERESTARTSYS;
128 goto out_del_cursor;
129 }
a46db608
CH
130 }
131
132out_del_cursor:
0b04b6b8 133 xfs_btree_del_cursor(cur, error);
a46db608
CH
134 xfs_buf_relse(agbp);
135out_put_perag:
136 xfs_perag_put(pag);
137 return error;
138}
139
a66d6363
DC
140/*
141 * trim a range of the filesystem.
142 *
143 * Note: the parameters passed from userspace are byte ranges into the
144 * filesystem which does not match to the format we use for filesystem block
145 * addressing. FSB addressing is sparse (AGNO|AGBNO), while the incoming format
146 * is a linear address range. Hence we need to use DADDR based conversions and
147 * comparisons for determining the correct offset and regions to trim.
148 */
a46db608
CH
149int
150xfs_ioc_trim(
151 struct xfs_mount *mp,
152 struct fstrim_range __user *urange)
153{
2f42d612 154 struct request_queue *q = bdev_get_queue(mp->m_ddev_targp->bt_bdev);
a46db608
CH
155 unsigned int granularity = q->limits.discard_granularity;
156 struct fstrim_range range;
a66d6363 157 xfs_daddr_t start, end, minlen;
a46db608 158 xfs_agnumber_t start_agno, end_agno, agno;
c8ce540d 159 uint64_t blocks_trimmed = 0;
a46db608
CH
160 int error, last_error = 0;
161
162 if (!capable(CAP_SYS_ADMIN))
b474c7ae 163 return -EPERM;
be715140 164 if (!blk_queue_discard(q))
b474c7ae 165 return -EOPNOTSUPP;
ed79dac9
DW
166
167 /*
168 * We haven't recovered the log, so we cannot use our bnobt-guided
169 * storage zapping commands.
170 */
171 if (mp->m_flags & XFS_MOUNT_NORECOVERY)
172 return -EROFS;
173
a46db608 174 if (copy_from_user(&range, urange, sizeof(range)))
b474c7ae 175 return -EFAULT;
a46db608 176
2bf9d264
WS
177 range.minlen = max_t(u64, granularity, range.minlen);
178 minlen = BTOBB(range.minlen);
a46db608
CH
179 /*
180 * Truncating down the len isn't actually quite correct, but using
a66d6363 181 * BBTOB would mean we trivially get overflows for values
a46db608
CH
182 * of ULLONG_MAX or slightly lower. And ULLONG_MAX is the default
183 * used by the fstrim application. In the end it really doesn't
184 * matter as trimming blocks is an advisory interface.
185 */
a672e1be 186 if (range.start >= XFS_FSB_TO_B(mp, mp->m_sb.sb_dblocks) ||
52548852 187 range.minlen > XFS_FSB_TO_B(mp, mp->m_ag_max_usable) ||
2f42d612 188 range.len < mp->m_sb.sb_blocksize)
b474c7ae 189 return -EINVAL;
a672e1be 190
a66d6363
DC
191 start = BTOBB(range.start);
192 end = start + BTOBBT(range.len) - 1;
a46db608 193
a66d6363
DC
194 if (end > XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks) - 1)
195 end = XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks)- 1;
a46db608 196
a66d6363
DC
197 start_agno = xfs_daddr_to_agno(mp, start);
198 end_agno = xfs_daddr_to_agno(mp, end);
a46db608
CH
199
200 for (agno = start_agno; agno <= end_agno; agno++) {
2451337d 201 error = xfs_trim_extents(mp, agno, start, end, minlen,
a46db608 202 &blocks_trimmed);
3c378195 203 if (error) {
a46db608 204 last_error = error;
3c378195
LC
205 if (error == -ERESTARTSYS)
206 break;
207 }
a46db608
CH
208 }
209
210 if (last_error)
211 return last_error;
212
213 range.len = XFS_FSB_TO_B(mp, blocks_trimmed);
214 if (copy_to_user(urange, &range, sizeof(range)))
b474c7ae 215 return -EFAULT;
a46db608
CH
216 return 0;
217}