xfs_discard.c 6.5 KB

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