xfs_discard.c 6.4 KB

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