1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
8 #include "xfs_shared.h"
9 #include "xfs_format.h"
10 #include "xfs_log_format.h"
11 #include "xfs_trans_resv.h"
13 #include "xfs_mount.h"
14 #include "xfs_inode.h"
16 #include "xfs_bmap_btree.h"
17 #include "xfs_trans.h"
18 #include "xfs_trans_space.h"
19 #include "xfs_icache.h"
20 #include "xfs_rtalloc.h"
24 * Read and return the summary information for a given extent size,
25 * bitmap block combination.
26 * Keeps track of a current summary block, so we don't keep reading
27 * it from the buffer cache.
31 xfs_mount_t *mp, /* file system mount structure */
32 xfs_trans_t *tp, /* transaction pointer */
33 int log, /* log2 of extent size */
34 xfs_rtblock_t bbno, /* bitmap block number */
35 struct xfs_buf **rbpp, /* in/out: summary block buffer */
36 xfs_fsblock_t *rsb, /* in/out: summary block number */
37 xfs_suminfo_t *sum) /* out: summary info for this block */
39 return xfs_rtmodify_summary_int(mp, tp, log, bbno, 0, rbpp, rsb, sum);
43 * Return whether there are any free extents in the size range given
44 * by low and high, for the bitmap block bbno.
46 STATIC int /* error */
48 xfs_mount_t *mp, /* file system mount structure */
49 xfs_trans_t *tp, /* transaction pointer */
50 int low, /* low log2 extent size */
51 int high, /* high log2 extent size */
52 xfs_rtblock_t bbno, /* bitmap block number */
53 struct xfs_buf **rbpp, /* in/out: summary block buffer */
54 xfs_fsblock_t *rsb, /* in/out: summary block number */
55 int *stat) /* out: any good extents here? */
57 int error; /* error value */
58 int log; /* loop counter, log2 of ext. size */
59 xfs_suminfo_t sum; /* summary data */
61 /* There are no extents at levels < m_rsum_cache[bbno]. */
62 if (mp->m_rsum_cache && low < mp->m_rsum_cache[bbno])
63 low = mp->m_rsum_cache[bbno];
66 * Loop over logs of extent sizes.
68 for (log = low; log <= high; log++) {
70 * Get one summary datum.
72 error = xfs_rtget_summary(mp, tp, log, bbno, rbpp, rsb, &sum);
77 * If there are any, return success.
85 * Found nothing, return failure.
89 /* There were no extents at levels < log. */
90 if (mp->m_rsum_cache && log > mp->m_rsum_cache[bbno])
91 mp->m_rsum_cache[bbno] = log;
97 * Copy and transform the summary file, given the old and new
98 * parameters in the mount structures.
100 STATIC int /* error */
102 xfs_mount_t *omp, /* old file system mount point */
103 xfs_mount_t *nmp, /* new file system mount point */
104 xfs_trans_t *tp) /* transaction pointer */
106 xfs_rtblock_t bbno; /* bitmap block number */
107 struct xfs_buf *bp; /* summary buffer */
108 int error; /* error return value */
109 int log; /* summary level number (log length) */
110 xfs_suminfo_t sum; /* summary data */
111 xfs_fsblock_t sumbno; /* summary block number */
114 for (log = omp->m_rsumlevels - 1; log >= 0; log--) {
115 for (bbno = omp->m_sb.sb_rbmblocks - 1;
116 (xfs_srtblock_t)bbno >= 0;
118 error = xfs_rtget_summary(omp, tp, log, bbno, &bp,
124 error = xfs_rtmodify_summary(omp, tp, log, bbno, -sum,
128 error = xfs_rtmodify_summary(nmp, tp, log, bbno, sum,
138 * Mark an extent specified by start and len allocated.
139 * Updates all the summary information as well as the bitmap.
141 STATIC int /* error */
142 xfs_rtallocate_range(
143 xfs_mount_t *mp, /* file system mount point */
144 xfs_trans_t *tp, /* transaction pointer */
145 xfs_rtblock_t start, /* start block to allocate */
146 xfs_extlen_t len, /* length to allocate */
147 struct xfs_buf **rbpp, /* in/out: summary block buffer */
148 xfs_fsblock_t *rsb) /* in/out: summary block number */
150 xfs_rtblock_t end; /* end of the allocated extent */
151 int error; /* error value */
152 xfs_rtblock_t postblock = 0; /* first block allocated > end */
153 xfs_rtblock_t preblock = 0; /* first block allocated < start */
155 end = start + len - 1;
157 * Assume we're allocating out of the middle of a free extent.
158 * We need to find the beginning and end of the extent so we can
159 * properly update the summary.
161 error = xfs_rtfind_back(mp, tp, start, 0, &preblock);
166 * Find the next allocated block (end of free extent).
168 error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1,
174 * Decrement the summary information corresponding to the entire
177 error = xfs_rtmodify_summary(mp, tp,
178 XFS_RTBLOCKLOG(postblock + 1 - preblock),
179 XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb);
184 * If there are blocks not being allocated at the front of the
185 * old extent, add summary data for them to be free.
187 if (preblock < start) {
188 error = xfs_rtmodify_summary(mp, tp,
189 XFS_RTBLOCKLOG(start - preblock),
190 XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb);
196 * If there are blocks not being allocated at the end of the
197 * old extent, add summary data for them to be free.
199 if (postblock > end) {
200 error = xfs_rtmodify_summary(mp, tp,
201 XFS_RTBLOCKLOG(postblock - end),
202 XFS_BITTOBLOCK(mp, end + 1), 1, rbpp, rsb);
208 * Modify the bitmap to mark this extent allocated.
210 error = xfs_rtmodify_range(mp, tp, start, len, 0);
215 * Attempt to allocate an extent minlen<=len<=maxlen starting from
216 * bitmap block bbno. If we don't get maxlen then use prod to trim
217 * the length, if given. Returns error; returns starting block in *rtblock.
218 * The lengths are all in rtextents.
220 STATIC int /* error */
221 xfs_rtallocate_extent_block(
222 xfs_mount_t *mp, /* file system mount point */
223 xfs_trans_t *tp, /* transaction pointer */
224 xfs_rtblock_t bbno, /* bitmap block number */
225 xfs_extlen_t minlen, /* minimum length to allocate */
226 xfs_extlen_t maxlen, /* maximum length to allocate */
227 xfs_extlen_t *len, /* out: actual length allocated */
228 xfs_rtblock_t *nextp, /* out: next block to try */
229 struct xfs_buf **rbpp, /* in/out: summary block buffer */
230 xfs_fsblock_t *rsb, /* in/out: summary block number */
231 xfs_extlen_t prod, /* extent product factor */
232 xfs_rtblock_t *rtblock) /* out: start block allocated */
234 xfs_rtblock_t besti; /* best rtblock found so far */
235 xfs_rtblock_t bestlen; /* best length found so far */
236 xfs_rtblock_t end; /* last rtblock in chunk */
237 int error; /* error value */
238 xfs_rtblock_t i; /* current rtblock trying */
239 xfs_rtblock_t next; /* next rtblock to try */
240 int stat; /* status from internal calls */
243 * Loop over all the extents starting in this bitmap block,
244 * looking for one that's long enough.
246 for (i = XFS_BLOCKTOBIT(mp, bbno), besti = -1, bestlen = 0,
247 end = XFS_BLOCKTOBIT(mp, bbno + 1) - 1;
250 /* Make sure we don't scan off the end of the rt volume. */
251 maxlen = min(mp->m_sb.sb_rextents, i + maxlen) - i;
254 * See if there's a free extent of maxlen starting at i.
255 * If it's not so then next will contain the first non-free.
257 error = xfs_rtcheck_range(mp, tp, i, maxlen, 1, &next, &stat);
263 * i for maxlen is all free, allocate and return that.
265 error = xfs_rtallocate_range(mp, tp, i, maxlen, rbpp,
275 * In the case where we have a variable-sized allocation
276 * request, figure out how big this free piece is,
277 * and if it's big enough for the minimum, and the best
278 * so far, remember it.
280 if (minlen < maxlen) {
281 xfs_rtblock_t thislen; /* this extent size */
284 if (thislen >= minlen && thislen > bestlen) {
290 * If not done yet, find the start of the next free space.
293 error = xfs_rtfind_forw(mp, tp, next, end, &i);
301 * Searched the whole thing & didn't find a maxlen free extent.
303 if (minlen < maxlen && besti != -1) {
304 xfs_extlen_t p; /* amount to trim length by */
307 * If size should be a multiple of prod, make that so.
310 div_u64_rem(bestlen, prod, &p);
316 * Allocate besti for bestlen & return that.
318 error = xfs_rtallocate_range(mp, tp, besti, bestlen, rbpp, rsb);
327 * Allocation failed. Set *nextp to the next block to try.
330 *rtblock = NULLRTBLOCK;
335 * Allocate an extent of length minlen<=len<=maxlen, starting at block
336 * bno. If we don't get maxlen then use prod to trim the length, if given.
337 * Returns error; returns starting block in *rtblock.
338 * The lengths are all in rtextents.
340 STATIC int /* error */
341 xfs_rtallocate_extent_exact(
342 xfs_mount_t *mp, /* file system mount point */
343 xfs_trans_t *tp, /* transaction pointer */
344 xfs_rtblock_t bno, /* starting block number to allocate */
345 xfs_extlen_t minlen, /* minimum length to allocate */
346 xfs_extlen_t maxlen, /* maximum length to allocate */
347 xfs_extlen_t *len, /* out: actual length allocated */
348 struct xfs_buf **rbpp, /* in/out: summary block buffer */
349 xfs_fsblock_t *rsb, /* in/out: summary block number */
350 xfs_extlen_t prod, /* extent product factor */
351 xfs_rtblock_t *rtblock) /* out: start block allocated */
353 int error; /* error value */
354 xfs_extlen_t i; /* extent length trimmed due to prod */
355 int isfree; /* extent is free */
356 xfs_rtblock_t next; /* next block to try (dummy) */
358 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
360 * Check if the range in question (for maxlen) is free.
362 error = xfs_rtcheck_range(mp, tp, bno, maxlen, 1, &next, &isfree);
368 * If it is, allocate it and return success.
370 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
379 * If not, allocate what there is, if it's at least minlen.
382 if (maxlen < minlen) {
384 * Failed, return failure status.
386 *rtblock = NULLRTBLOCK;
390 * Trim off tail of extent, if prod is specified.
392 if (prod > 1 && (i = maxlen % prod)) {
394 if (maxlen < minlen) {
396 * Now we can't do it, return failure status.
398 *rtblock = NULLRTBLOCK;
403 * Allocate what we can and return it.
405 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
415 * Allocate an extent of length minlen<=len<=maxlen, starting as near
416 * to bno as possible. If we don't get maxlen then use prod to trim
417 * the length, if given. The lengths are all in rtextents.
419 STATIC int /* error */
420 xfs_rtallocate_extent_near(
421 xfs_mount_t *mp, /* file system mount point */
422 xfs_trans_t *tp, /* transaction pointer */
423 xfs_rtblock_t bno, /* starting block number to allocate */
424 xfs_extlen_t minlen, /* minimum length to allocate */
425 xfs_extlen_t maxlen, /* maximum length to allocate */
426 xfs_extlen_t *len, /* out: actual length allocated */
427 struct xfs_buf **rbpp, /* in/out: summary block buffer */
428 xfs_fsblock_t *rsb, /* in/out: summary block number */
429 xfs_extlen_t prod, /* extent product factor */
430 xfs_rtblock_t *rtblock) /* out: start block allocated */
432 int any; /* any useful extents from summary */
433 xfs_rtblock_t bbno; /* bitmap block number */
434 int error; /* error value */
435 int i; /* bitmap block offset (loop control) */
436 int j; /* secondary loop control */
437 int log2len; /* log2 of minlen */
438 xfs_rtblock_t n; /* next block to try */
439 xfs_rtblock_t r; /* result block */
441 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
443 * If the block number given is off the end, silently set it to
446 if (bno >= mp->m_sb.sb_rextents)
447 bno = mp->m_sb.sb_rextents - 1;
449 /* Make sure we don't run off the end of the rt volume. */
450 maxlen = min(mp->m_sb.sb_rextents, bno + maxlen) - bno;
451 if (maxlen < minlen) {
452 *rtblock = NULLRTBLOCK;
457 * Try the exact allocation first.
459 error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, len,
460 rbpp, rsb, prod, &r);
465 * If the exact allocation worked, return that.
467 if (r != NULLRTBLOCK) {
471 bbno = XFS_BITTOBLOCK(mp, bno);
474 log2len = xfs_highbit32(minlen);
476 * Loop over all bitmap blocks (bbno + i is current block).
480 * Get summary information of extents of all useful levels
481 * starting in this bitmap block.
483 error = xfs_rtany_summary(mp, tp, log2len, mp->m_rsumlevels - 1,
484 bbno + i, rbpp, rsb, &any);
489 * If there are any useful extents starting here, try
494 * On the positive side of the starting location.
498 * Try to allocate an extent starting in
501 error = xfs_rtallocate_extent_block(mp, tp,
502 bbno + i, minlen, maxlen, len, &n, rbpp,
508 * If it worked, return it.
510 if (r != NULLRTBLOCK) {
516 * On the negative side of the starting location.
520 * Loop backwards through the bitmap blocks from
521 * the starting point-1 up to where we are now.
522 * There should be an extent which ends in this
523 * bitmap block and is long enough.
525 for (j = -1; j > i; j--) {
527 * Grab the summary information for
530 error = xfs_rtany_summary(mp, tp,
531 log2len, mp->m_rsumlevels - 1,
532 bbno + j, rbpp, rsb, &any);
537 * If there's no extent given in the
538 * summary that means the extent we
539 * found must carry over from an
540 * earlier block. If there is an
541 * extent given, we've already tried
542 * that allocation, don't do it again.
546 error = xfs_rtallocate_extent_block(mp,
547 tp, bbno + j, minlen, maxlen,
548 len, &n, rbpp, rsb, prod, &r);
553 * If it works, return the extent.
555 if (r != NULLRTBLOCK) {
561 * There weren't intervening bitmap blocks
562 * with a long enough extent, or the
563 * allocation didn't work for some reason
564 * (i.e. it's a little * too short).
565 * Try to allocate from the summary block
568 error = xfs_rtallocate_extent_block(mp, tp,
569 bbno + i, minlen, maxlen, len, &n, rbpp,
575 * If it works, return the extent.
577 if (r != NULLRTBLOCK) {
584 * Loop control. If we were on the positive side, and there's
585 * still more blocks on the negative side, go there.
587 if (i > 0 && (int)bbno - i >= 0)
590 * If positive, and no more negative, but there are more
591 * positive, go there.
593 else if (i > 0 && (int)bbno + i < mp->m_sb.sb_rbmblocks - 1)
596 * If negative or 0 (just started), and there are positive
597 * blocks to go, go there. The 0 case moves to block 1.
599 else if (i <= 0 && (int)bbno - i < mp->m_sb.sb_rbmblocks - 1)
602 * If negative or 0 and there are more negative blocks,
605 else if (i <= 0 && (int)bbno + i > 0)
608 * Must be done. Return failure.
613 *rtblock = NULLRTBLOCK;
618 * Allocate an extent of length minlen<=len<=maxlen, with no position
619 * specified. If we don't get maxlen then use prod to trim
620 * the length, if given. The lengths are all in rtextents.
622 STATIC int /* error */
623 xfs_rtallocate_extent_size(
624 xfs_mount_t *mp, /* file system mount point */
625 xfs_trans_t *tp, /* transaction pointer */
626 xfs_extlen_t minlen, /* minimum length to allocate */
627 xfs_extlen_t maxlen, /* maximum length to allocate */
628 xfs_extlen_t *len, /* out: actual length allocated */
629 struct xfs_buf **rbpp, /* in/out: summary block buffer */
630 xfs_fsblock_t *rsb, /* in/out: summary block number */
631 xfs_extlen_t prod, /* extent product factor */
632 xfs_rtblock_t *rtblock) /* out: start block allocated */
634 int error; /* error value */
635 int i; /* bitmap block number */
636 int l; /* level number (loop control) */
637 xfs_rtblock_t n; /* next block to be tried */
638 xfs_rtblock_t r; /* result block number */
639 xfs_suminfo_t sum; /* summary information for extents */
641 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
645 * Loop over all the levels starting with maxlen.
646 * At each level, look at all the bitmap blocks, to see if there
647 * are extents starting there that are long enough (>= maxlen).
648 * Note, only on the initial level can the allocation fail if
649 * the summary says there's an extent.
651 for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) {
653 * Loop over all the bitmap blocks.
655 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
657 * Get the summary for this level/block.
659 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
665 * Nothing there, on to the next block.
670 * Try allocating the extent.
672 error = xfs_rtallocate_extent_block(mp, tp, i, maxlen,
673 maxlen, len, &n, rbpp, rsb, prod, &r);
678 * If it worked, return that.
680 if (r != NULLRTBLOCK) {
685 * If the "next block to try" returned from the
686 * allocator is beyond the next bitmap block,
687 * skip to that bitmap block.
689 if (XFS_BITTOBLOCK(mp, n) > i + 1)
690 i = XFS_BITTOBLOCK(mp, n) - 1;
694 * Didn't find any maxlen blocks. Try smaller ones, unless
695 * we're asking for a fixed size extent.
697 if (minlen > --maxlen) {
698 *rtblock = NULLRTBLOCK;
705 * Loop over sizes, from maxlen down to minlen.
706 * This time, when we do the allocations, allow smaller ones
709 for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) {
711 * Loop over all the bitmap blocks, try an allocation
712 * starting in that block.
714 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
716 * Get the summary information for this level/block.
718 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
724 * If nothing there, go on to next.
729 * Try the allocation. Make sure the specified
730 * minlen/maxlen are in the possible range for
731 * this summary level.
733 error = xfs_rtallocate_extent_block(mp, tp, i,
734 XFS_RTMAX(minlen, 1 << l),
735 XFS_RTMIN(maxlen, (1 << (l + 1)) - 1),
736 len, &n, rbpp, rsb, prod, &r);
741 * If it worked, return that extent.
743 if (r != NULLRTBLOCK) {
748 * If the "next block to try" returned from the
749 * allocator is beyond the next bitmap block,
750 * skip to that bitmap block.
752 if (XFS_BITTOBLOCK(mp, n) > i + 1)
753 i = XFS_BITTOBLOCK(mp, n) - 1;
757 * Got nothing, return failure.
759 *rtblock = NULLRTBLOCK;
764 * Allocate space to the bitmap or summary file, and zero it, for growfs.
768 struct xfs_mount *mp, /* file system mount point */
769 xfs_extlen_t oblocks, /* old count of blocks */
770 xfs_extlen_t nblocks, /* new count of blocks */
771 struct xfs_inode *ip) /* inode (bitmap/summary) */
773 xfs_fileoff_t bno; /* block number in file */
774 struct xfs_buf *bp; /* temporary buffer for zeroing */
775 xfs_daddr_t d; /* disk block address */
776 int error; /* error return value */
777 xfs_fsblock_t fsbno; /* filesystem block for bno */
778 struct xfs_bmbt_irec map; /* block map output */
779 int nmap; /* number of block maps */
780 int resblks; /* space reservation */
781 enum xfs_blft buf_type;
782 struct xfs_trans *tp;
784 if (ip == mp->m_rsumip)
785 buf_type = XFS_BLFT_RTSUMMARY_BUF;
787 buf_type = XFS_BLFT_RTBITMAP_BUF;
790 * Allocate space to the file, as necessary.
792 while (oblocks < nblocks) {
793 resblks = XFS_GROWFSRT_SPACE_RES(mp, nblocks - oblocks);
795 * Reserve space & log for one extent added to the file.
797 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtalloc, resblks,
804 xfs_ilock(ip, XFS_ILOCK_EXCL);
805 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
807 error = xfs_iext_count_may_overflow(ip, XFS_DATA_FORK,
808 XFS_IEXT_ADD_NOSPLIT_CNT);
810 goto out_trans_cancel;
813 * Allocate blocks to the bitmap file.
816 error = xfs_bmapi_write(tp, ip, oblocks, nblocks - oblocks,
817 XFS_BMAPI_METADATA, 0, &map, &nmap);
818 if (!error && nmap < 1)
821 goto out_trans_cancel;
823 * Free any blocks freed up in the transaction, then commit.
825 error = xfs_trans_commit(tp);
829 * Now we need to clear the allocated blocks.
830 * Do this one block per transaction, to keep it simple.
832 for (bno = map.br_startoff, fsbno = map.br_startblock;
833 bno < map.br_startoff + map.br_blockcount;
836 * Reserve log for one block zeroing.
838 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtzero,
843 * Lock the bitmap inode.
845 xfs_ilock(ip, XFS_ILOCK_EXCL);
846 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
848 * Get a buffer for the block.
850 d = XFS_FSB_TO_DADDR(mp, fsbno);
851 error = xfs_trans_get_buf(tp, mp->m_ddev_targp, d,
852 mp->m_bsize, 0, &bp);
854 goto out_trans_cancel;
856 xfs_trans_buf_set_type(tp, bp, buf_type);
857 bp->b_ops = &xfs_rtbuf_ops;
858 memset(bp->b_addr, 0, mp->m_sb.sb_blocksize);
859 xfs_trans_log_buf(tp, bp, 0, mp->m_sb.sb_blocksize - 1);
861 * Commit the transaction.
863 error = xfs_trans_commit(tp);
868 * Go on to the next extent, if any.
870 oblocks = map.br_startoff + map.br_blockcount;
876 xfs_trans_cancel(tp);
881 xfs_alloc_rsum_cache(
882 xfs_mount_t *mp, /* file system mount structure */
883 xfs_extlen_t rbmblocks) /* number of rt bitmap blocks */
886 * The rsum cache is initialized to all zeroes, which is trivially a
887 * lower bound on the minimum level with any free extents. We can
888 * continue without the cache if it couldn't be allocated.
890 mp->m_rsum_cache = kvzalloc(rbmblocks, GFP_KERNEL);
891 if (!mp->m_rsum_cache)
892 xfs_warn(mp, "could not allocate realtime summary cache");
896 * Visible (exported) functions.
900 * Grow the realtime area of the filesystem.
904 xfs_mount_t *mp, /* mount point for filesystem */
905 xfs_growfs_rt_t *in) /* growfs rt input struct */
907 xfs_rtblock_t bmbno; /* bitmap block number */
908 struct xfs_buf *bp; /* temporary buffer */
909 int error; /* error return value */
910 xfs_mount_t *nmp; /* new (fake) mount structure */
911 xfs_rfsblock_t nrblocks; /* new number of realtime blocks */
912 xfs_extlen_t nrbmblocks; /* new number of rt bitmap blocks */
913 xfs_rtblock_t nrextents; /* new number of realtime extents */
914 uint8_t nrextslog; /* new log2 of sb_rextents */
915 xfs_extlen_t nrsumblocks; /* new number of summary blocks */
916 uint nrsumlevels; /* new rt summary levels */
917 uint nrsumsize; /* new size of rt summary, bytes */
918 xfs_sb_t *nsbp; /* new superblock */
919 xfs_extlen_t rbmblocks; /* current number of rt bitmap blocks */
920 xfs_extlen_t rsumblocks; /* current number of rt summary blks */
921 xfs_sb_t *sbp; /* old superblock */
922 xfs_fsblock_t sumbno; /* summary block number */
923 uint8_t *rsum_cache; /* old summary cache */
927 * Initial error checking.
929 if (!capable(CAP_SYS_ADMIN))
931 if (mp->m_rtdev_targp == NULL || mp->m_rbmip == NULL ||
932 (nrblocks = in->newblocks) <= sbp->sb_rblocks ||
933 (sbp->sb_rblocks && (in->extsize != sbp->sb_rextsize)))
935 if ((error = xfs_sb_validate_fsb_count(sbp, nrblocks)))
938 * Read in the last block of the device, make sure it exists.
940 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
941 XFS_FSB_TO_BB(mp, nrblocks - 1),
942 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
948 * Calculate new parameters. These are the final values to be reached.
950 nrextents = nrblocks;
951 do_div(nrextents, in->extsize);
952 nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize);
953 nrextslog = xfs_highbit32(nrextents);
954 nrsumlevels = nrextslog + 1;
955 nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks;
956 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
957 nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
959 * New summary size can't be more than half the size of
960 * the log. This prevents us from getting a log overflow,
961 * since we'll log basically the whole summary file at once.
963 if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1))
966 * Get the old block counts for bitmap and summary inodes.
967 * These can't change since other growfs callers are locked out.
969 rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_disk_size);
970 rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_disk_size);
972 * Allocate space to the bitmap and summary files, as necessary.
974 error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks, mp->m_rbmip);
977 error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks, mp->m_rsumip);
981 rsum_cache = mp->m_rsum_cache;
982 if (nrbmblocks != sbp->sb_rbmblocks)
983 xfs_alloc_rsum_cache(mp, nrbmblocks);
986 * Allocate a new (fake) mount/sb.
988 nmp = kmem_alloc(sizeof(*nmp), 0);
990 * Loop over the bitmap blocks.
991 * We will do everything one bitmap block at a time.
992 * Skip the current block if it is exactly full.
993 * This also deals with the case where there were no rtextents before.
995 for (bmbno = sbp->sb_rbmblocks -
996 ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0);
1004 * Calculate new sb and mount fields for this round.
1006 nsbp->sb_rextsize = in->extsize;
1007 nsbp->sb_rbmblocks = bmbno + 1;
1010 nsbp->sb_rbmblocks * NBBY *
1011 nsbp->sb_blocksize * nsbp->sb_rextsize);
1012 nsbp->sb_rextents = nsbp->sb_rblocks;
1013 do_div(nsbp->sb_rextents, nsbp->sb_rextsize);
1014 ASSERT(nsbp->sb_rextents != 0);
1015 nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents);
1016 nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1;
1018 (uint)sizeof(xfs_suminfo_t) * nrsumlevels *
1020 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
1021 nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
1023 * Start a transaction, get the log reservation.
1025 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtfree, 0, 0, 0,
1030 * Lock out other callers by grabbing the bitmap inode lock.
1032 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL | XFS_ILOCK_RTBITMAP);
1033 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL);
1035 * Update the bitmap inode's size ondisk and incore. We need
1036 * to update the incore size so that inode inactivation won't
1037 * punch what it thinks are "posteof" blocks.
1039 mp->m_rbmip->i_disk_size =
1040 nsbp->sb_rbmblocks * nsbp->sb_blocksize;
1041 i_size_write(VFS_I(mp->m_rbmip), mp->m_rbmip->i_disk_size);
1042 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1044 * Get the summary inode into the transaction.
1046 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL | XFS_ILOCK_RTSUM);
1047 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL);
1049 * Update the summary inode's size. We need to update the
1050 * incore size so that inode inactivation won't punch what it
1051 * thinks are "posteof" blocks.
1053 mp->m_rsumip->i_disk_size = nmp->m_rsumsize;
1054 i_size_write(VFS_I(mp->m_rsumip), mp->m_rsumip->i_disk_size);
1055 xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE);
1057 * Copy summary data from old to new sizes.
1058 * Do this when the real size (not block-aligned) changes.
1060 if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks ||
1061 mp->m_rsumlevels != nmp->m_rsumlevels) {
1062 error = xfs_rtcopy_summary(mp, nmp, tp);
1067 * Update superblock fields.
1069 if (nsbp->sb_rextsize != sbp->sb_rextsize)
1070 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE,
1071 nsbp->sb_rextsize - sbp->sb_rextsize);
1072 if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks)
1073 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS,
1074 nsbp->sb_rbmblocks - sbp->sb_rbmblocks);
1075 if (nsbp->sb_rblocks != sbp->sb_rblocks)
1076 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS,
1077 nsbp->sb_rblocks - sbp->sb_rblocks);
1078 if (nsbp->sb_rextents != sbp->sb_rextents)
1079 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS,
1080 nsbp->sb_rextents - sbp->sb_rextents);
1081 if (nsbp->sb_rextslog != sbp->sb_rextslog)
1082 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG,
1083 nsbp->sb_rextslog - sbp->sb_rextslog);
1088 error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents,
1089 nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno);
1092 xfs_trans_cancel(tp);
1096 * Mark more blocks free in the superblock.
1098 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS,
1099 nsbp->sb_rextents - sbp->sb_rextents);
1101 * Update mp values into the real mp structure.
1103 mp->m_rsumlevels = nrsumlevels;
1104 mp->m_rsumsize = nrsumsize;
1106 error = xfs_trans_commit(tp);
1113 /* Update secondary superblocks now the physical grow has completed */
1114 error = xfs_update_secondary_sbs(mp);
1118 * Free the fake mp structure.
1123 * If we had to allocate a new rsum_cache, we either need to free the
1124 * old one (if we succeeded) or free the new one and restore the old one
1125 * (if there was an error).
1127 if (rsum_cache != mp->m_rsum_cache) {
1129 kmem_free(mp->m_rsum_cache);
1130 mp->m_rsum_cache = rsum_cache;
1132 kmem_free(rsum_cache);
1140 * Allocate an extent in the realtime subvolume, with the usual allocation
1141 * parameters. The length units are all in realtime extents, as is the
1142 * result block number.
1145 xfs_rtallocate_extent(
1146 xfs_trans_t *tp, /* transaction pointer */
1147 xfs_rtblock_t bno, /* starting block number to allocate */
1148 xfs_extlen_t minlen, /* minimum length to allocate */
1149 xfs_extlen_t maxlen, /* maximum length to allocate */
1150 xfs_extlen_t *len, /* out: actual length allocated */
1151 int wasdel, /* was a delayed allocation extent */
1152 xfs_extlen_t prod, /* extent product factor */
1153 xfs_rtblock_t *rtblock) /* out: start block allocated */
1155 xfs_mount_t *mp = tp->t_mountp;
1156 int error; /* error value */
1157 xfs_rtblock_t r; /* result allocated block */
1158 xfs_fsblock_t sb; /* summary file block number */
1159 struct xfs_buf *sumbp; /* summary file block buffer */
1161 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1162 ASSERT(minlen > 0 && minlen <= maxlen);
1165 * If prod is set then figure out what to do to minlen and maxlen.
1170 if ((i = maxlen % prod))
1172 if ((i = minlen % prod))
1174 if (maxlen < minlen) {
1175 *rtblock = NULLRTBLOCK;
1183 error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len,
1184 &sumbp, &sb, prod, &r);
1186 error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen,
1187 len, &sumbp, &sb, prod, &r);
1194 * If it worked, update the superblock.
1196 if (r != NULLRTBLOCK) {
1197 long slen = (long)*len;
1199 ASSERT(*len >= minlen && *len <= maxlen);
1201 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen);
1203 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen);
1204 } else if (prod > 1) {
1214 * Initialize realtime fields in the mount structure.
1218 struct xfs_mount *mp) /* file system mount structure */
1220 struct xfs_buf *bp; /* buffer for last block of subvolume */
1221 struct xfs_sb *sbp; /* filesystem superblock copy in mount */
1222 xfs_daddr_t d; /* address of last block of subvolume */
1226 if (sbp->sb_rblocks == 0)
1228 if (mp->m_rtdev_targp == NULL) {
1230 "Filesystem has a realtime volume, use rtdev=device option");
1233 mp->m_rsumlevels = sbp->sb_rextslog + 1;
1235 (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels *
1237 mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize);
1238 mp->m_rbmip = mp->m_rsumip = NULL;
1240 * Check that the realtime section is an ok size.
1242 d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks);
1243 if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) {
1244 xfs_warn(mp, "realtime mount -- %llu != %llu",
1245 (unsigned long long) XFS_BB_TO_FSB(mp, d),
1246 (unsigned long long) mp->m_sb.sb_rblocks);
1249 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
1250 d - XFS_FSB_TO_BB(mp, 1),
1251 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
1253 xfs_warn(mp, "realtime device size check failed");
1261 * Get the bitmap and summary inodes and the summary cache into the mount
1262 * structure at mount time.
1266 xfs_mount_t *mp) /* file system mount structure */
1268 int error; /* error return value */
1272 error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip);
1275 ASSERT(mp->m_rbmip != NULL);
1277 error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip);
1279 xfs_irele(mp->m_rbmip);
1282 ASSERT(mp->m_rsumip != NULL);
1283 xfs_alloc_rsum_cache(mp, sbp->sb_rbmblocks);
1288 xfs_rtunmount_inodes(
1289 struct xfs_mount *mp)
1291 kmem_free(mp->m_rsum_cache);
1293 xfs_irele(mp->m_rbmip);
1295 xfs_irele(mp->m_rsumip);
1299 * Pick an extent for allocation at the start of a new realtime file.
1300 * Use the sequence number stored in the atime field of the bitmap inode.
1301 * Translate this to a fraction of the rtextents, and return the product
1302 * of rtextents and the fraction.
1303 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
1307 xfs_mount_t *mp, /* file system mount point */
1308 xfs_trans_t *tp, /* transaction pointer */
1309 xfs_extlen_t len, /* allocation length (rtextents) */
1310 xfs_rtblock_t *pick) /* result rt extent */
1312 xfs_rtblock_t b; /* result block */
1313 int log2; /* log of sequence number */
1314 uint64_t resid; /* residual after log removed */
1315 uint64_t seq; /* sequence number of file creation */
1316 uint64_t *seqp; /* pointer to seqno in inode */
1318 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1320 seqp = (uint64_t *)&VFS_I(mp->m_rbmip)->i_atime;
1321 if (!(mp->m_rbmip->i_diflags & XFS_DIFLAG_NEWRTBM)) {
1322 mp->m_rbmip->i_diflags |= XFS_DIFLAG_NEWRTBM;
1326 if ((log2 = xfs_highbit64(seq)) == -1)
1329 resid = seq - (1ULL << log2);
1330 b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >>
1332 if (b >= mp->m_sb.sb_rextents)
1333 div64_u64_rem(b, mp->m_sb.sb_rextents, &b);
1334 if (b + len > mp->m_sb.sb_rextents)
1335 b = mp->m_sb.sb_rextents - len;
1338 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);