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 xfs_buf_t **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 xfs_buf_t **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 xfs_buf_t *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 xfs_buf_t **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 xfs_buf_t **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;
251 * See if there's a free extent of maxlen starting at i.
252 * If it's not so then next will contain the first non-free.
254 error = xfs_rtcheck_range(mp, tp, i, maxlen, 1, &next, &stat);
260 * i for maxlen is all free, allocate and return that.
262 error = xfs_rtallocate_range(mp, tp, i, maxlen, rbpp,
272 * In the case where we have a variable-sized allocation
273 * request, figure out how big this free piece is,
274 * and if it's big enough for the minimum, and the best
275 * so far, remember it.
277 if (minlen < maxlen) {
278 xfs_rtblock_t thislen; /* this extent size */
281 if (thislen >= minlen && thislen > bestlen) {
287 * If not done yet, find the start of the next free space.
290 error = xfs_rtfind_forw(mp, tp, next, end, &i);
298 * Searched the whole thing & didn't find a maxlen free extent.
300 if (minlen < maxlen && besti != -1) {
301 xfs_extlen_t p; /* amount to trim length by */
304 * If size should be a multiple of prod, make that so.
307 div_u64_rem(bestlen, prod, &p);
313 * Allocate besti for bestlen & return that.
315 error = xfs_rtallocate_range(mp, tp, besti, bestlen, rbpp, rsb);
324 * Allocation failed. Set *nextp to the next block to try.
327 *rtblock = NULLRTBLOCK;
332 * Allocate an extent of length minlen<=len<=maxlen, starting at block
333 * bno. If we don't get maxlen then use prod to trim the length, if given.
334 * Returns error; returns starting block in *rtblock.
335 * The lengths are all in rtextents.
337 STATIC int /* error */
338 xfs_rtallocate_extent_exact(
339 xfs_mount_t *mp, /* file system mount point */
340 xfs_trans_t *tp, /* transaction pointer */
341 xfs_rtblock_t bno, /* starting block number to allocate */
342 xfs_extlen_t minlen, /* minimum length to allocate */
343 xfs_extlen_t maxlen, /* maximum length to allocate */
344 xfs_extlen_t *len, /* out: actual length allocated */
345 xfs_buf_t **rbpp, /* in/out: summary block buffer */
346 xfs_fsblock_t *rsb, /* in/out: summary block number */
347 xfs_extlen_t prod, /* extent product factor */
348 xfs_rtblock_t *rtblock) /* out: start block allocated */
350 int error; /* error value */
351 xfs_extlen_t i; /* extent length trimmed due to prod */
352 int isfree; /* extent is free */
353 xfs_rtblock_t next; /* next block to try (dummy) */
355 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
357 * Check if the range in question (for maxlen) is free.
359 error = xfs_rtcheck_range(mp, tp, bno, maxlen, 1, &next, &isfree);
365 * If it is, allocate it and return success.
367 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
376 * If not, allocate what there is, if it's at least minlen.
379 if (maxlen < minlen) {
381 * Failed, return failure status.
383 *rtblock = NULLRTBLOCK;
387 * Trim off tail of extent, if prod is specified.
389 if (prod > 1 && (i = maxlen % prod)) {
391 if (maxlen < minlen) {
393 * Now we can't do it, return failure status.
395 *rtblock = NULLRTBLOCK;
400 * Allocate what we can and return it.
402 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
412 * Allocate an extent of length minlen<=len<=maxlen, starting as near
413 * to bno as possible. If we don't get maxlen then use prod to trim
414 * the length, if given. The lengths are all in rtextents.
416 STATIC int /* error */
417 xfs_rtallocate_extent_near(
418 xfs_mount_t *mp, /* file system mount point */
419 xfs_trans_t *tp, /* transaction pointer */
420 xfs_rtblock_t bno, /* starting block number to allocate */
421 xfs_extlen_t minlen, /* minimum length to allocate */
422 xfs_extlen_t maxlen, /* maximum length to allocate */
423 xfs_extlen_t *len, /* out: actual length allocated */
424 xfs_buf_t **rbpp, /* in/out: summary block buffer */
425 xfs_fsblock_t *rsb, /* in/out: summary block number */
426 xfs_extlen_t prod, /* extent product factor */
427 xfs_rtblock_t *rtblock) /* out: start block allocated */
429 int any; /* any useful extents from summary */
430 xfs_rtblock_t bbno; /* bitmap block number */
431 int error; /* error value */
432 int i; /* bitmap block offset (loop control) */
433 int j; /* secondary loop control */
434 int log2len; /* log2 of minlen */
435 xfs_rtblock_t n; /* next block to try */
436 xfs_rtblock_t r; /* result block */
438 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
440 * If the block number given is off the end, silently set it to
443 if (bno >= mp->m_sb.sb_rextents)
444 bno = mp->m_sb.sb_rextents - 1;
446 * Try the exact allocation first.
448 error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, len,
449 rbpp, rsb, prod, &r);
454 * If the exact allocation worked, return that.
456 if (r != NULLRTBLOCK) {
460 bbno = XFS_BITTOBLOCK(mp, bno);
463 log2len = xfs_highbit32(minlen);
465 * Loop over all bitmap blocks (bbno + i is current block).
469 * Get summary information of extents of all useful levels
470 * starting in this bitmap block.
472 error = xfs_rtany_summary(mp, tp, log2len, mp->m_rsumlevels - 1,
473 bbno + i, rbpp, rsb, &any);
478 * If there are any useful extents starting here, try
483 * On the positive side of the starting location.
487 * Try to allocate an extent starting in
490 error = xfs_rtallocate_extent_block(mp, tp,
491 bbno + i, minlen, maxlen, len, &n, rbpp,
497 * If it worked, return it.
499 if (r != NULLRTBLOCK) {
505 * On the negative side of the starting location.
509 * Loop backwards through the bitmap blocks from
510 * the starting point-1 up to where we are now.
511 * There should be an extent which ends in this
512 * bitmap block and is long enough.
514 for (j = -1; j > i; j--) {
516 * Grab the summary information for
519 error = xfs_rtany_summary(mp, tp,
520 log2len, mp->m_rsumlevels - 1,
521 bbno + j, rbpp, rsb, &any);
526 * If there's no extent given in the
527 * summary that means the extent we
528 * found must carry over from an
529 * earlier block. If there is an
530 * extent given, we've already tried
531 * that allocation, don't do it again.
535 error = xfs_rtallocate_extent_block(mp,
536 tp, bbno + j, minlen, maxlen,
537 len, &n, rbpp, rsb, prod, &r);
542 * If it works, return the extent.
544 if (r != NULLRTBLOCK) {
550 * There weren't intervening bitmap blocks
551 * with a long enough extent, or the
552 * allocation didn't work for some reason
553 * (i.e. it's a little * too short).
554 * Try to allocate from the summary block
557 error = xfs_rtallocate_extent_block(mp, tp,
558 bbno + i, minlen, maxlen, len, &n, rbpp,
564 * If it works, return the extent.
566 if (r != NULLRTBLOCK) {
573 * Loop control. If we were on the positive side, and there's
574 * still more blocks on the negative side, go there.
576 if (i > 0 && (int)bbno - i >= 0)
579 * If positive, and no more negative, but there are more
580 * positive, go there.
582 else if (i > 0 && (int)bbno + i < mp->m_sb.sb_rbmblocks - 1)
585 * If negative or 0 (just started), and there are positive
586 * blocks to go, go there. The 0 case moves to block 1.
588 else if (i <= 0 && (int)bbno - i < mp->m_sb.sb_rbmblocks - 1)
591 * If negative or 0 and there are more negative blocks,
594 else if (i <= 0 && (int)bbno + i > 0)
597 * Must be done. Return failure.
602 *rtblock = NULLRTBLOCK;
607 * Allocate an extent of length minlen<=len<=maxlen, with no position
608 * specified. If we don't get maxlen then use prod to trim
609 * the length, if given. The lengths are all in rtextents.
611 STATIC int /* error */
612 xfs_rtallocate_extent_size(
613 xfs_mount_t *mp, /* file system mount point */
614 xfs_trans_t *tp, /* transaction pointer */
615 xfs_extlen_t minlen, /* minimum length to allocate */
616 xfs_extlen_t maxlen, /* maximum length to allocate */
617 xfs_extlen_t *len, /* out: actual length allocated */
618 xfs_buf_t **rbpp, /* in/out: summary block buffer */
619 xfs_fsblock_t *rsb, /* in/out: summary block number */
620 xfs_extlen_t prod, /* extent product factor */
621 xfs_rtblock_t *rtblock) /* out: start block allocated */
623 int error; /* error value */
624 int i; /* bitmap block number */
625 int l; /* level number (loop control) */
626 xfs_rtblock_t n; /* next block to be tried */
627 xfs_rtblock_t r; /* result block number */
628 xfs_suminfo_t sum; /* summary information for extents */
630 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
634 * Loop over all the levels starting with maxlen.
635 * At each level, look at all the bitmap blocks, to see if there
636 * are extents starting there that are long enough (>= maxlen).
637 * Note, only on the initial level can the allocation fail if
638 * the summary says there's an extent.
640 for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) {
642 * Loop over all the bitmap blocks.
644 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
646 * Get the summary for this level/block.
648 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
654 * Nothing there, on to the next block.
659 * Try allocating the extent.
661 error = xfs_rtallocate_extent_block(mp, tp, i, maxlen,
662 maxlen, len, &n, rbpp, rsb, prod, &r);
667 * If it worked, return that.
669 if (r != NULLRTBLOCK) {
674 * If the "next block to try" returned from the
675 * allocator is beyond the next bitmap block,
676 * skip to that bitmap block.
678 if (XFS_BITTOBLOCK(mp, n) > i + 1)
679 i = XFS_BITTOBLOCK(mp, n) - 1;
683 * Didn't find any maxlen blocks. Try smaller ones, unless
684 * we're asking for a fixed size extent.
686 if (minlen > --maxlen) {
687 *rtblock = NULLRTBLOCK;
694 * Loop over sizes, from maxlen down to minlen.
695 * This time, when we do the allocations, allow smaller ones
698 for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) {
700 * Loop over all the bitmap blocks, try an allocation
701 * starting in that block.
703 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
705 * Get the summary information for this level/block.
707 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
713 * If nothing there, go on to next.
718 * Try the allocation. Make sure the specified
719 * minlen/maxlen are in the possible range for
720 * this summary level.
722 error = xfs_rtallocate_extent_block(mp, tp, i,
723 XFS_RTMAX(minlen, 1 << l),
724 XFS_RTMIN(maxlen, (1 << (l + 1)) - 1),
725 len, &n, rbpp, rsb, prod, &r);
730 * If it worked, return that extent.
732 if (r != NULLRTBLOCK) {
737 * If the "next block to try" returned from the
738 * allocator is beyond the next bitmap block,
739 * skip to that bitmap block.
741 if (XFS_BITTOBLOCK(mp, n) > i + 1)
742 i = XFS_BITTOBLOCK(mp, n) - 1;
746 * Got nothing, return failure.
748 *rtblock = NULLRTBLOCK;
753 * Allocate space to the bitmap or summary file, and zero it, for growfs.
757 struct xfs_mount *mp, /* file system mount point */
758 xfs_extlen_t oblocks, /* old count of blocks */
759 xfs_extlen_t nblocks, /* new count of blocks */
760 struct xfs_inode *ip) /* inode (bitmap/summary) */
762 xfs_fileoff_t bno; /* block number in file */
763 struct xfs_buf *bp; /* temporary buffer for zeroing */
764 xfs_daddr_t d; /* disk block address */
765 int error; /* error return value */
766 xfs_fsblock_t fsbno; /* filesystem block for bno */
767 struct xfs_bmbt_irec map; /* block map output */
768 int nmap; /* number of block maps */
769 int resblks; /* space reservation */
770 struct xfs_trans *tp;
773 * Allocate space to the file, as necessary.
775 while (oblocks < nblocks) {
776 resblks = XFS_GROWFSRT_SPACE_RES(mp, nblocks - oblocks);
778 * Reserve space & log for one extent added to the file.
780 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtalloc, resblks,
787 xfs_ilock(ip, XFS_ILOCK_EXCL);
788 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
791 * Allocate blocks to the bitmap file.
794 error = xfs_bmapi_write(tp, ip, oblocks, nblocks - oblocks,
795 XFS_BMAPI_METADATA, 0, &map, &nmap);
796 if (!error && nmap < 1)
799 goto out_trans_cancel;
801 * Free any blocks freed up in the transaction, then commit.
803 error = xfs_trans_commit(tp);
807 * Now we need to clear the allocated blocks.
808 * Do this one block per transaction, to keep it simple.
810 for (bno = map.br_startoff, fsbno = map.br_startblock;
811 bno < map.br_startoff + map.br_blockcount;
814 * Reserve log for one block zeroing.
816 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtzero,
821 * Lock the bitmap inode.
823 xfs_ilock(ip, XFS_ILOCK_EXCL);
824 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
826 * Get a buffer for the block.
828 d = XFS_FSB_TO_DADDR(mp, fsbno);
829 bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, d,
833 goto out_trans_cancel;
835 memset(bp->b_addr, 0, mp->m_sb.sb_blocksize);
836 xfs_trans_log_buf(tp, bp, 0, mp->m_sb.sb_blocksize - 1);
838 * Commit the transaction.
840 error = xfs_trans_commit(tp);
845 * Go on to the next extent, if any.
847 oblocks = map.br_startoff + map.br_blockcount;
853 xfs_trans_cancel(tp);
858 xfs_alloc_rsum_cache(
859 xfs_mount_t *mp, /* file system mount structure */
860 xfs_extlen_t rbmblocks) /* number of rt bitmap blocks */
863 * The rsum cache is initialized to all zeroes, which is trivially a
864 * lower bound on the minimum level with any free extents. We can
865 * continue without the cache if it couldn't be allocated.
867 mp->m_rsum_cache = kmem_zalloc_large(rbmblocks, 0);
868 if (!mp->m_rsum_cache)
869 xfs_warn(mp, "could not allocate realtime summary cache");
873 * Visible (exported) functions.
877 * Grow the realtime area of the filesystem.
881 xfs_mount_t *mp, /* mount point for filesystem */
882 xfs_growfs_rt_t *in) /* growfs rt input struct */
884 xfs_rtblock_t bmbno; /* bitmap block number */
885 xfs_buf_t *bp; /* temporary buffer */
886 int error; /* error return value */
887 xfs_mount_t *nmp; /* new (fake) mount structure */
888 xfs_rfsblock_t nrblocks; /* new number of realtime blocks */
889 xfs_extlen_t nrbmblocks; /* new number of rt bitmap blocks */
890 xfs_rtblock_t nrextents; /* new number of realtime extents */
891 uint8_t nrextslog; /* new log2 of sb_rextents */
892 xfs_extlen_t nrsumblocks; /* new number of summary blocks */
893 uint nrsumlevels; /* new rt summary levels */
894 uint nrsumsize; /* new size of rt summary, bytes */
895 xfs_sb_t *nsbp; /* new superblock */
896 xfs_extlen_t rbmblocks; /* current number of rt bitmap blocks */
897 xfs_extlen_t rsumblocks; /* current number of rt summary blks */
898 xfs_sb_t *sbp; /* old superblock */
899 xfs_fsblock_t sumbno; /* summary block number */
900 uint8_t *rsum_cache; /* old summary cache */
904 * Initial error checking.
906 if (!capable(CAP_SYS_ADMIN))
908 if (mp->m_rtdev_targp == NULL || mp->m_rbmip == NULL ||
909 (nrblocks = in->newblocks) <= sbp->sb_rblocks ||
910 (sbp->sb_rblocks && (in->extsize != sbp->sb_rextsize)))
912 if ((error = xfs_sb_validate_fsb_count(sbp, nrblocks)))
915 * Read in the last block of the device, make sure it exists.
917 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
918 XFS_FSB_TO_BB(mp, nrblocks - 1),
919 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
925 * Calculate new parameters. These are the final values to be reached.
927 nrextents = nrblocks;
928 do_div(nrextents, in->extsize);
929 nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize);
930 nrextslog = xfs_highbit32(nrextents);
931 nrsumlevels = nrextslog + 1;
932 nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks;
933 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
934 nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
936 * New summary size can't be more than half the size of
937 * the log. This prevents us from getting a log overflow,
938 * since we'll log basically the whole summary file at once.
940 if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1))
943 * Get the old block counts for bitmap and summary inodes.
944 * These can't change since other growfs callers are locked out.
946 rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_d.di_size);
947 rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_d.di_size);
949 * Allocate space to the bitmap and summary files, as necessary.
951 error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks, mp->m_rbmip);
954 error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks, mp->m_rsumip);
958 rsum_cache = mp->m_rsum_cache;
959 if (nrbmblocks != sbp->sb_rbmblocks)
960 xfs_alloc_rsum_cache(mp, nrbmblocks);
963 * Allocate a new (fake) mount/sb.
965 nmp = kmem_alloc(sizeof(*nmp), 0);
967 * Loop over the bitmap blocks.
968 * We will do everything one bitmap block at a time.
969 * Skip the current block if it is exactly full.
970 * This also deals with the case where there were no rtextents before.
972 for (bmbno = sbp->sb_rbmblocks -
973 ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0);
981 * Calculate new sb and mount fields for this round.
983 nsbp->sb_rextsize = in->extsize;
984 nsbp->sb_rbmblocks = bmbno + 1;
987 nsbp->sb_rbmblocks * NBBY *
988 nsbp->sb_blocksize * nsbp->sb_rextsize);
989 nsbp->sb_rextents = nsbp->sb_rblocks;
990 do_div(nsbp->sb_rextents, nsbp->sb_rextsize);
991 ASSERT(nsbp->sb_rextents != 0);
992 nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents);
993 nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1;
995 (uint)sizeof(xfs_suminfo_t) * nrsumlevels *
997 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
998 nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
1000 * Start a transaction, get the log reservation.
1002 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtfree, 0, 0, 0,
1007 * Lock out other callers by grabbing the bitmap inode lock.
1009 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL);
1010 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL);
1012 * Update the bitmap inode's size.
1014 mp->m_rbmip->i_d.di_size =
1015 nsbp->sb_rbmblocks * nsbp->sb_blocksize;
1016 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1018 * Get the summary inode into the transaction.
1020 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL);
1021 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL);
1023 * Update the summary inode's size.
1025 mp->m_rsumip->i_d.di_size = nmp->m_rsumsize;
1026 xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE);
1028 * Copy summary data from old to new sizes.
1029 * Do this when the real size (not block-aligned) changes.
1031 if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks ||
1032 mp->m_rsumlevels != nmp->m_rsumlevels) {
1033 error = xfs_rtcopy_summary(mp, nmp, tp);
1038 * Update superblock fields.
1040 if (nsbp->sb_rextsize != sbp->sb_rextsize)
1041 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE,
1042 nsbp->sb_rextsize - sbp->sb_rextsize);
1043 if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks)
1044 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS,
1045 nsbp->sb_rbmblocks - sbp->sb_rbmblocks);
1046 if (nsbp->sb_rblocks != sbp->sb_rblocks)
1047 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS,
1048 nsbp->sb_rblocks - sbp->sb_rblocks);
1049 if (nsbp->sb_rextents != sbp->sb_rextents)
1050 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS,
1051 nsbp->sb_rextents - sbp->sb_rextents);
1052 if (nsbp->sb_rextslog != sbp->sb_rextslog)
1053 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG,
1054 nsbp->sb_rextslog - sbp->sb_rextslog);
1059 error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents,
1060 nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno);
1063 xfs_trans_cancel(tp);
1067 * Mark more blocks free in the superblock.
1069 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS,
1070 nsbp->sb_rextents - sbp->sb_rextents);
1072 * Update mp values into the real mp structure.
1074 mp->m_rsumlevels = nrsumlevels;
1075 mp->m_rsumsize = nrsumsize;
1077 error = xfs_trans_commit(tp);
1083 * Free the fake mp structure.
1088 * If we had to allocate a new rsum_cache, we either need to free the
1089 * old one (if we succeeded) or free the new one and restore the old one
1090 * (if there was an error).
1092 if (rsum_cache != mp->m_rsum_cache) {
1094 kmem_free(mp->m_rsum_cache);
1095 mp->m_rsum_cache = rsum_cache;
1097 kmem_free(rsum_cache);
1105 * Allocate an extent in the realtime subvolume, with the usual allocation
1106 * parameters. The length units are all in realtime extents, as is the
1107 * result block number.
1110 xfs_rtallocate_extent(
1111 xfs_trans_t *tp, /* transaction pointer */
1112 xfs_rtblock_t bno, /* starting block number to allocate */
1113 xfs_extlen_t minlen, /* minimum length to allocate */
1114 xfs_extlen_t maxlen, /* maximum length to allocate */
1115 xfs_extlen_t *len, /* out: actual length allocated */
1116 int wasdel, /* was a delayed allocation extent */
1117 xfs_extlen_t prod, /* extent product factor */
1118 xfs_rtblock_t *rtblock) /* out: start block allocated */
1120 xfs_mount_t *mp = tp->t_mountp;
1121 int error; /* error value */
1122 xfs_rtblock_t r; /* result allocated block */
1123 xfs_fsblock_t sb; /* summary file block number */
1124 xfs_buf_t *sumbp; /* summary file block buffer */
1126 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1127 ASSERT(minlen > 0 && minlen <= maxlen);
1130 * If prod is set then figure out what to do to minlen and maxlen.
1135 if ((i = maxlen % prod))
1137 if ((i = minlen % prod))
1139 if (maxlen < minlen) {
1140 *rtblock = NULLRTBLOCK;
1148 error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len,
1149 &sumbp, &sb, prod, &r);
1151 error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen,
1152 len, &sumbp, &sb, prod, &r);
1159 * If it worked, update the superblock.
1161 if (r != NULLRTBLOCK) {
1162 long slen = (long)*len;
1164 ASSERT(*len >= minlen && *len <= maxlen);
1166 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen);
1168 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen);
1169 } else if (prod > 1) {
1179 * Initialize realtime fields in the mount structure.
1183 struct xfs_mount *mp) /* file system mount structure */
1185 struct xfs_buf *bp; /* buffer for last block of subvolume */
1186 struct xfs_sb *sbp; /* filesystem superblock copy in mount */
1187 xfs_daddr_t d; /* address of last block of subvolume */
1191 if (sbp->sb_rblocks == 0)
1193 if (mp->m_rtdev_targp == NULL) {
1195 "Filesystem has a realtime volume, use rtdev=device option");
1198 mp->m_rsumlevels = sbp->sb_rextslog + 1;
1200 (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels *
1202 mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize);
1203 mp->m_rbmip = mp->m_rsumip = NULL;
1205 * Check that the realtime section is an ok size.
1207 d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks);
1208 if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) {
1209 xfs_warn(mp, "realtime mount -- %llu != %llu",
1210 (unsigned long long) XFS_BB_TO_FSB(mp, d),
1211 (unsigned long long) mp->m_sb.sb_rblocks);
1214 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
1215 d - XFS_FSB_TO_BB(mp, 1),
1216 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
1218 xfs_warn(mp, "realtime device size check failed");
1226 * Get the bitmap and summary inodes and the summary cache into the mount
1227 * structure at mount time.
1231 xfs_mount_t *mp) /* file system mount structure */
1233 int error; /* error return value */
1237 error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip);
1240 ASSERT(mp->m_rbmip != NULL);
1242 error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip);
1244 xfs_irele(mp->m_rbmip);
1247 ASSERT(mp->m_rsumip != NULL);
1248 xfs_alloc_rsum_cache(mp, sbp->sb_rbmblocks);
1253 xfs_rtunmount_inodes(
1254 struct xfs_mount *mp)
1256 kmem_free(mp->m_rsum_cache);
1258 xfs_irele(mp->m_rbmip);
1260 xfs_irele(mp->m_rsumip);
1264 * Pick an extent for allocation at the start of a new realtime file.
1265 * Use the sequence number stored in the atime field of the bitmap inode.
1266 * Translate this to a fraction of the rtextents, and return the product
1267 * of rtextents and the fraction.
1268 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
1272 xfs_mount_t *mp, /* file system mount point */
1273 xfs_trans_t *tp, /* transaction pointer */
1274 xfs_extlen_t len, /* allocation length (rtextents) */
1275 xfs_rtblock_t *pick) /* result rt extent */
1277 xfs_rtblock_t b; /* result block */
1278 int log2; /* log of sequence number */
1279 uint64_t resid; /* residual after log removed */
1280 uint64_t seq; /* sequence number of file creation */
1281 uint64_t *seqp; /* pointer to seqno in inode */
1283 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1285 seqp = (uint64_t *)&VFS_I(mp->m_rbmip)->i_atime;
1286 if (!(mp->m_rbmip->i_d.di_flags & XFS_DIFLAG_NEWRTBM)) {
1287 mp->m_rbmip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM;
1291 if ((log2 = xfs_highbit64(seq)) == -1)
1294 resid = seq - (1ULL << log2);
1295 b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >>
1297 if (b >= mp->m_sb.sb_rextents)
1298 div64_u64_rem(b, mp->m_sb.sb_rextents, &b);
1299 if (b + len > mp->m_sb.sb_rextents)
1300 b = mp->m_sb.sb_rextents - len;
1303 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);