2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
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.
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.
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
20 #include "xfs_types.h"
24 #include "xfs_trans.h"
28 #include "xfs_dmapi.h"
29 #include "xfs_mount.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_alloc_btree.h"
32 #include "xfs_ialloc_btree.h"
33 #include "xfs_dir2_sf.h"
34 #include "xfs_attr_sf.h"
35 #include "xfs_dinode.h"
36 #include "xfs_inode.h"
37 #include "xfs_btree.h"
38 #include "xfs_ialloc.h"
39 #include "xfs_alloc.h"
41 #include "xfs_rtalloc.h"
42 #include "xfs_fsops.h"
43 #include "xfs_error.h"
45 #include "xfs_inode_item.h"
46 #include "xfs_trans_space.h"
47 #include "xfs_utils.h"
51 * Prototypes for internal functions.
55 STATIC int xfs_rtallocate_range(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t,
56 xfs_extlen_t, xfs_buf_t **, xfs_fsblock_t *);
57 STATIC int xfs_rtany_summary(xfs_mount_t *, xfs_trans_t *, int, int,
58 xfs_rtblock_t, xfs_buf_t **, xfs_fsblock_t *, int *);
59 STATIC int xfs_rtcheck_range(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t,
60 xfs_extlen_t, int, xfs_rtblock_t *, int *);
61 STATIC int xfs_rtfind_back(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t,
62 xfs_rtblock_t, xfs_rtblock_t *);
63 STATIC int xfs_rtfind_forw(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t,
64 xfs_rtblock_t, xfs_rtblock_t *);
65 STATIC int xfs_rtget_summary( xfs_mount_t *, xfs_trans_t *, int,
66 xfs_rtblock_t, xfs_buf_t **, xfs_fsblock_t *, xfs_suminfo_t *);
67 STATIC int xfs_rtmodify_range(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t,
69 STATIC int xfs_rtmodify_summary(xfs_mount_t *, xfs_trans_t *, int,
70 xfs_rtblock_t, int, xfs_buf_t **, xfs_fsblock_t *);
77 * xfs_lowbit32: get low bit set out of 32-bit argument, -1 if none set.
89 * Allocate space to the bitmap or summary file, and zero it, for growfs.
91 STATIC int /* error */
93 xfs_mount_t *mp, /* file system mount point */
94 xfs_extlen_t oblocks, /* old count of blocks */
95 xfs_extlen_t nblocks, /* new count of blocks */
96 xfs_ino_t ino) /* inode number (bitmap/summary) */
98 xfs_fileoff_t bno; /* block number in file */
99 xfs_buf_t *bp; /* temporary buffer for zeroing */
100 int cancelflags; /* flags for xfs_trans_cancel */
101 int committed; /* transaction committed flag */
102 xfs_daddr_t d; /* disk block address */
103 int error; /* error return value */
104 xfs_fsblock_t firstblock; /* first block allocated in xaction */
105 xfs_bmap_free_t flist; /* list of freed blocks */
106 xfs_fsblock_t fsbno; /* filesystem block for bno */
107 xfs_inode_t *ip; /* pointer to incore inode */
108 xfs_bmbt_irec_t map; /* block map output */
109 int nmap; /* number of block maps */
110 int resblks; /* space reservation */
111 xfs_trans_t *tp; /* transaction pointer */
114 * Allocate space to the file, as necessary.
116 while (oblocks < nblocks) {
117 tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_ALLOC);
118 resblks = XFS_GROWFSRT_SPACE_RES(mp, nblocks - oblocks);
121 * Reserve space & log for one extent added to the file.
123 if ((error = xfs_trans_reserve(tp, resblks,
124 XFS_GROWRTALLOC_LOG_RES(mp), 0,
125 XFS_TRANS_PERM_LOG_RES,
126 XFS_DEFAULT_PERM_LOG_COUNT)))
128 cancelflags = XFS_TRANS_RELEASE_LOG_RES;
132 if ((error = xfs_trans_iget(mp, tp, ino, 0,
133 XFS_ILOCK_EXCL, &ip)))
135 XFS_BMAP_INIT(&flist, &firstblock);
137 * Allocate blocks to the bitmap file.
140 cancelflags |= XFS_TRANS_ABORT;
141 error = xfs_bmapi(tp, ip, oblocks, nblocks - oblocks,
142 XFS_BMAPI_WRITE | XFS_BMAPI_METADATA, &firstblock,
143 resblks, &map, &nmap, &flist, NULL);
144 if (!error && nmap < 1)
145 error = XFS_ERROR(ENOSPC);
149 * Free any blocks freed up in the transaction, then commit.
151 error = xfs_bmap_finish(&tp, &flist, &committed);
154 xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
156 * Now we need to clear the allocated blocks.
157 * Do this one block per transaction, to keep it simple.
160 for (bno = map.br_startoff, fsbno = map.br_startblock;
161 bno < map.br_startoff + map.br_blockcount;
163 tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_ZERO);
165 * Reserve log for one block zeroing.
167 if ((error = xfs_trans_reserve(tp, 0,
168 XFS_GROWRTZERO_LOG_RES(mp), 0, 0, 0)))
171 * Lock the bitmap inode.
173 if ((error = xfs_trans_iget(mp, tp, ino, 0,
174 XFS_ILOCK_EXCL, &ip)))
177 * Get a buffer for the block.
179 d = XFS_FSB_TO_DADDR(mp, fsbno);
180 bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, d,
183 error = XFS_ERROR(EIO);
186 memset(XFS_BUF_PTR(bp), 0, mp->m_sb.sb_blocksize);
187 xfs_trans_log_buf(tp, bp, 0, mp->m_sb.sb_blocksize - 1);
189 * Commit the transaction.
191 xfs_trans_commit(tp, 0);
194 * Go on to the next extent, if any.
196 oblocks = map.br_startoff + map.br_blockcount;
200 xfs_trans_cancel(tp, cancelflags);
205 * Attempt to allocate an extent minlen<=len<=maxlen starting from
206 * bitmap block bbno. If we don't get maxlen then use prod to trim
207 * the length, if given. Returns error; returns starting block in *rtblock.
208 * The lengths are all in rtextents.
210 STATIC int /* error */
211 xfs_rtallocate_extent_block(
212 xfs_mount_t *mp, /* file system mount point */
213 xfs_trans_t *tp, /* transaction pointer */
214 xfs_rtblock_t bbno, /* bitmap block number */
215 xfs_extlen_t minlen, /* minimum length to allocate */
216 xfs_extlen_t maxlen, /* maximum length to allocate */
217 xfs_extlen_t *len, /* out: actual length allocated */
218 xfs_rtblock_t *nextp, /* out: next block to try */
219 xfs_buf_t **rbpp, /* in/out: summary block buffer */
220 xfs_fsblock_t *rsb, /* in/out: summary block number */
221 xfs_extlen_t prod, /* extent product factor */
222 xfs_rtblock_t *rtblock) /* out: start block allocated */
224 xfs_rtblock_t besti; /* best rtblock found so far */
225 xfs_rtblock_t bestlen; /* best length found so far */
226 xfs_rtblock_t end; /* last rtblock in chunk */
227 int error; /* error value */
228 xfs_rtblock_t i; /* current rtblock trying */
229 xfs_rtblock_t next; /* next rtblock to try */
230 int stat; /* status from internal calls */
233 * Loop over all the extents starting in this bitmap block,
234 * looking for one that's long enough.
236 for (i = XFS_BLOCKTOBIT(mp, bbno), besti = -1, bestlen = 0,
237 end = XFS_BLOCKTOBIT(mp, bbno + 1) - 1;
241 * See if there's a free extent of maxlen starting at i.
242 * If it's not so then next will contain the first non-free.
244 error = xfs_rtcheck_range(mp, tp, i, maxlen, 1, &next, &stat);
250 * i for maxlen is all free, allocate and return that.
252 error = xfs_rtallocate_range(mp, tp, i, maxlen, rbpp,
262 * In the case where we have a variable-sized allocation
263 * request, figure out how big this free piece is,
264 * and if it's big enough for the minimum, and the best
265 * so far, remember it.
267 if (minlen < maxlen) {
268 xfs_rtblock_t thislen; /* this extent size */
271 if (thislen >= minlen && thislen > bestlen) {
277 * If not done yet, find the start of the next free space.
280 error = xfs_rtfind_forw(mp, tp, next, end, &i);
288 * Searched the whole thing & didn't find a maxlen free extent.
290 if (minlen < maxlen && besti != -1) {
291 xfs_extlen_t p; /* amount to trim length by */
294 * If size should be a multiple of prod, make that so.
296 if (prod > 1 && (p = do_mod(bestlen, prod)))
299 * Allocate besti for bestlen & return that.
301 error = xfs_rtallocate_range(mp, tp, besti, bestlen, rbpp, rsb);
310 * Allocation failed. Set *nextp to the next block to try.
313 *rtblock = NULLRTBLOCK;
318 * Allocate an extent of length minlen<=len<=maxlen, starting at block
319 * bno. If we don't get maxlen then use prod to trim the length, if given.
320 * Returns error; returns starting block in *rtblock.
321 * The lengths are all in rtextents.
323 STATIC int /* error */
324 xfs_rtallocate_extent_exact(
325 xfs_mount_t *mp, /* file system mount point */
326 xfs_trans_t *tp, /* transaction pointer */
327 xfs_rtblock_t bno, /* starting block number to allocate */
328 xfs_extlen_t minlen, /* minimum length to allocate */
329 xfs_extlen_t maxlen, /* maximum length to allocate */
330 xfs_extlen_t *len, /* out: actual length allocated */
331 xfs_buf_t **rbpp, /* in/out: summary block buffer */
332 xfs_fsblock_t *rsb, /* in/out: summary block number */
333 xfs_extlen_t prod, /* extent product factor */
334 xfs_rtblock_t *rtblock) /* out: start block allocated */
336 int error; /* error value */
337 xfs_extlen_t i; /* extent length trimmed due to prod */
338 int isfree; /* extent is free */
339 xfs_rtblock_t next; /* next block to try (dummy) */
341 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
343 * Check if the range in question (for maxlen) is free.
345 error = xfs_rtcheck_range(mp, tp, bno, maxlen, 1, &next, &isfree);
351 * If it is, allocate it and return success.
353 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
362 * If not, allocate what there is, if it's at least minlen.
365 if (maxlen < minlen) {
367 * Failed, return failure status.
369 *rtblock = NULLRTBLOCK;
373 * Trim off tail of extent, if prod is specified.
375 if (prod > 1 && (i = maxlen % prod)) {
377 if (maxlen < minlen) {
379 * Now we can't do it, return failure status.
381 *rtblock = NULLRTBLOCK;
386 * Allocate what we can and return it.
388 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
398 * Allocate an extent of length minlen<=len<=maxlen, starting as near
399 * to bno as possible. If we don't get maxlen then use prod to trim
400 * the length, if given. The lengths are all in rtextents.
402 STATIC int /* error */
403 xfs_rtallocate_extent_near(
404 xfs_mount_t *mp, /* file system mount point */
405 xfs_trans_t *tp, /* transaction pointer */
406 xfs_rtblock_t bno, /* starting block number to allocate */
407 xfs_extlen_t minlen, /* minimum length to allocate */
408 xfs_extlen_t maxlen, /* maximum length to allocate */
409 xfs_extlen_t *len, /* out: actual length allocated */
410 xfs_buf_t **rbpp, /* in/out: summary block buffer */
411 xfs_fsblock_t *rsb, /* in/out: summary block number */
412 xfs_extlen_t prod, /* extent product factor */
413 xfs_rtblock_t *rtblock) /* out: start block allocated */
415 int any; /* any useful extents from summary */
416 xfs_rtblock_t bbno; /* bitmap block number */
417 int error; /* error value */
418 int i; /* bitmap block offset (loop control) */
419 int j; /* secondary loop control */
420 int log2len; /* log2 of minlen */
421 xfs_rtblock_t n; /* next block to try */
422 xfs_rtblock_t r; /* result block */
424 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
426 * If the block number given is off the end, silently set it to
429 if (bno >= mp->m_sb.sb_rextents)
430 bno = mp->m_sb.sb_rextents - 1;
432 * Try the exact allocation first.
434 error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, len,
435 rbpp, rsb, prod, &r);
440 * If the exact allocation worked, return that.
442 if (r != NULLRTBLOCK) {
446 bbno = XFS_BITTOBLOCK(mp, bno);
448 log2len = xfs_highbit32(minlen);
450 * Loop over all bitmap blocks (bbno + i is current block).
454 * Get summary information of extents of all useful levels
455 * starting in this bitmap block.
457 error = xfs_rtany_summary(mp, tp, log2len, mp->m_rsumlevels - 1,
458 bbno + i, rbpp, rsb, &any);
463 * If there are any useful extents starting here, try
468 * On the positive side of the starting location.
472 * Try to allocate an extent starting in
475 error = xfs_rtallocate_extent_block(mp, tp,
476 bbno + i, minlen, maxlen, len, &n, rbpp,
482 * If it worked, return it.
484 if (r != NULLRTBLOCK) {
490 * On the negative side of the starting location.
494 * Loop backwards through the bitmap blocks from
495 * the starting point-1 up to where we are now.
496 * There should be an extent which ends in this
497 * bitmap block and is long enough.
499 for (j = -1; j > i; j--) {
501 * Grab the summary information for
504 error = xfs_rtany_summary(mp, tp,
505 log2len, mp->m_rsumlevels - 1,
506 bbno + j, rbpp, rsb, &any);
511 * If there's no extent given in the
512 * summary that means the extent we
513 * found must carry over from an
514 * earlier block. If there is an
515 * extent given, we've already tried
516 * that allocation, don't do it again.
520 error = xfs_rtallocate_extent_block(mp,
521 tp, bbno + j, minlen, maxlen,
522 len, &n, rbpp, rsb, prod, &r);
527 * If it works, return the extent.
529 if (r != NULLRTBLOCK) {
535 * There weren't intervening bitmap blocks
536 * with a long enough extent, or the
537 * allocation didn't work for some reason
538 * (i.e. it's a little * too short).
539 * Try to allocate from the summary block
542 error = xfs_rtallocate_extent_block(mp, tp,
543 bbno + i, minlen, maxlen, len, &n, rbpp,
549 * If it works, return the extent.
551 if (r != NULLRTBLOCK) {
558 * Loop control. If we were on the positive side, and there's
559 * still more blocks on the negative side, go there.
561 if (i > 0 && (int)bbno - i >= 0)
564 * If positive, and no more negative, but there are more
565 * positive, go there.
567 else if (i > 0 && (int)bbno + i < mp->m_sb.sb_rbmblocks - 1)
570 * If negative or 0 (just started), and there are positive
571 * blocks to go, go there. The 0 case moves to block 1.
573 else if (i <= 0 && (int)bbno - i < mp->m_sb.sb_rbmblocks - 1)
576 * If negative or 0 and there are more negative blocks,
579 else if (i <= 0 && (int)bbno + i > 0)
582 * Must be done. Return failure.
587 *rtblock = NULLRTBLOCK;
592 * Allocate an extent of length minlen<=len<=maxlen, with no position
593 * specified. If we don't get maxlen then use prod to trim
594 * the length, if given. The lengths are all in rtextents.
596 STATIC int /* error */
597 xfs_rtallocate_extent_size(
598 xfs_mount_t *mp, /* file system mount point */
599 xfs_trans_t *tp, /* transaction pointer */
600 xfs_extlen_t minlen, /* minimum length to allocate */
601 xfs_extlen_t maxlen, /* maximum length to allocate */
602 xfs_extlen_t *len, /* out: actual length allocated */
603 xfs_buf_t **rbpp, /* in/out: summary block buffer */
604 xfs_fsblock_t *rsb, /* in/out: summary block number */
605 xfs_extlen_t prod, /* extent product factor */
606 xfs_rtblock_t *rtblock) /* out: start block allocated */
608 int error; /* error value */
609 int i; /* bitmap block number */
610 int l; /* level number (loop control) */
611 xfs_rtblock_t n; /* next block to be tried */
612 xfs_rtblock_t r; /* result block number */
613 xfs_suminfo_t sum; /* summary information for extents */
615 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
617 * Loop over all the levels starting with maxlen.
618 * At each level, look at all the bitmap blocks, to see if there
619 * are extents starting there that are long enough (>= maxlen).
620 * Note, only on the initial level can the allocation fail if
621 * the summary says there's an extent.
623 for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) {
625 * Loop over all the bitmap blocks.
627 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
629 * Get the summary for this level/block.
631 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
637 * Nothing there, on to the next block.
642 * Try allocating the extent.
644 error = xfs_rtallocate_extent_block(mp, tp, i, maxlen,
645 maxlen, len, &n, rbpp, rsb, prod, &r);
650 * If it worked, return that.
652 if (r != NULLRTBLOCK) {
657 * If the "next block to try" returned from the
658 * allocator is beyond the next bitmap block,
659 * skip to that bitmap block.
661 if (XFS_BITTOBLOCK(mp, n) > i + 1)
662 i = XFS_BITTOBLOCK(mp, n) - 1;
666 * Didn't find any maxlen blocks. Try smaller ones, unless
667 * we're asking for a fixed size extent.
669 if (minlen > --maxlen) {
670 *rtblock = NULLRTBLOCK;
674 * Loop over sizes, from maxlen down to minlen.
675 * This time, when we do the allocations, allow smaller ones
678 for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) {
680 * Loop over all the bitmap blocks, try an allocation
681 * starting in that block.
683 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
685 * Get the summary information for this level/block.
687 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
693 * If nothing there, go on to next.
698 * Try the allocation. Make sure the specified
699 * minlen/maxlen are in the possible range for
700 * this summary level.
702 error = xfs_rtallocate_extent_block(mp, tp, i,
703 XFS_RTMAX(minlen, 1 << l),
704 XFS_RTMIN(maxlen, (1 << (l + 1)) - 1),
705 len, &n, rbpp, rsb, prod, &r);
710 * If it worked, return that extent.
712 if (r != NULLRTBLOCK) {
717 * If the "next block to try" returned from the
718 * allocator is beyond the next bitmap block,
719 * skip to that bitmap block.
721 if (XFS_BITTOBLOCK(mp, n) > i + 1)
722 i = XFS_BITTOBLOCK(mp, n) - 1;
726 * Got nothing, return failure.
728 *rtblock = NULLRTBLOCK;
733 * Mark an extent specified by start and len allocated.
734 * Updates all the summary information as well as the bitmap.
736 STATIC int /* error */
737 xfs_rtallocate_range(
738 xfs_mount_t *mp, /* file system mount point */
739 xfs_trans_t *tp, /* transaction pointer */
740 xfs_rtblock_t start, /* start block to allocate */
741 xfs_extlen_t len, /* length to allocate */
742 xfs_buf_t **rbpp, /* in/out: summary block buffer */
743 xfs_fsblock_t *rsb) /* in/out: summary block number */
745 xfs_rtblock_t end; /* end of the allocated extent */
746 int error; /* error value */
747 xfs_rtblock_t postblock; /* first block allocated > end */
748 xfs_rtblock_t preblock; /* first block allocated < start */
750 end = start + len - 1;
752 * Assume we're allocating out of the middle of a free extent.
753 * We need to find the beginning and end of the extent so we can
754 * properly update the summary.
756 error = xfs_rtfind_back(mp, tp, start, 0, &preblock);
761 * Find the next allocated block (end of free extent).
763 error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1,
769 * Decrement the summary information corresponding to the entire
772 error = xfs_rtmodify_summary(mp, tp,
773 XFS_RTBLOCKLOG(postblock + 1 - preblock),
774 XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb);
779 * If there are blocks not being allocated at the front of the
780 * old extent, add summary data for them to be free.
782 if (preblock < start) {
783 error = xfs_rtmodify_summary(mp, tp,
784 XFS_RTBLOCKLOG(start - preblock),
785 XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb);
791 * If there are blocks not being allocated at the end of the
792 * old extent, add summary data for them to be free.
794 if (postblock > end) {
795 error = xfs_rtmodify_summary(mp, tp,
796 XFS_RTBLOCKLOG(postblock - end),
797 XFS_BITTOBLOCK(mp, end + 1), 1, rbpp, rsb);
803 * Modify the bitmap to mark this extent allocated.
805 error = xfs_rtmodify_range(mp, tp, start, len, 0);
810 * Return whether there are any free extents in the size range given
811 * by low and high, for the bitmap block bbno.
813 STATIC int /* error */
815 xfs_mount_t *mp, /* file system mount structure */
816 xfs_trans_t *tp, /* transaction pointer */
817 int low, /* low log2 extent size */
818 int high, /* high log2 extent size */
819 xfs_rtblock_t bbno, /* bitmap block number */
820 xfs_buf_t **rbpp, /* in/out: summary block buffer */
821 xfs_fsblock_t *rsb, /* in/out: summary block number */
822 int *stat) /* out: any good extents here? */
824 int error; /* error value */
825 int log; /* loop counter, log2 of ext. size */
826 xfs_suminfo_t sum; /* summary data */
829 * Loop over logs of extent sizes. Order is irrelevant.
831 for (log = low; log <= high; log++) {
833 * Get one summary datum.
835 error = xfs_rtget_summary(mp, tp, log, bbno, rbpp, rsb, &sum);
840 * If there are any, return success.
848 * Found nothing, return failure.
855 * Get a buffer for the bitmap or summary file block specified.
856 * The buffer is returned read and locked.
858 STATIC int /* error */
860 xfs_mount_t *mp, /* file system mount structure */
861 xfs_trans_t *tp, /* transaction pointer */
862 xfs_rtblock_t block, /* block number in bitmap or summary */
863 int issum, /* is summary not bitmap */
864 xfs_buf_t **bpp) /* output: buffer for the block */
866 xfs_buf_t *bp; /* block buffer, result */
867 xfs_daddr_t d; /* disk addr of block */
868 int error; /* error value */
869 xfs_fsblock_t fsb; /* fs block number for block */
870 xfs_inode_t *ip; /* bitmap or summary inode */
872 ip = issum ? mp->m_rsumip : mp->m_rbmip;
874 * Map from the file offset (block) and inode number to the
877 error = xfs_bmapi_single(tp, ip, XFS_DATA_FORK, &fsb, block);
881 ASSERT(fsb != NULLFSBLOCK);
883 * Convert to disk address for buffer cache.
885 d = XFS_FSB_TO_DADDR(mp, fsb);
889 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, d,
890 mp->m_bsize, 0, &bp);
894 ASSERT(bp && !XFS_BUF_GETERROR(bp));
901 * Check that the given extent (block range) is allocated already.
903 STATIC int /* error */
904 xfs_rtcheck_alloc_range(
905 xfs_mount_t *mp, /* file system mount point */
906 xfs_trans_t *tp, /* transaction pointer */
907 xfs_rtblock_t bno, /* starting block number of extent */
908 xfs_extlen_t len, /* length of extent */
909 int *stat) /* out: 1 for allocated, 0 for not */
911 xfs_rtblock_t new; /* dummy for xfs_rtcheck_range */
913 return xfs_rtcheck_range(mp, tp, bno, len, 0, &new, stat);
918 * Check that the given range is either all allocated (val = 0) or
919 * all free (val = 1).
921 STATIC int /* error */
923 xfs_mount_t *mp, /* file system mount point */
924 xfs_trans_t *tp, /* transaction pointer */
925 xfs_rtblock_t start, /* starting block number of extent */
926 xfs_extlen_t len, /* length of extent */
927 int val, /* 1 for free, 0 for allocated */
928 xfs_rtblock_t *new, /* out: first block not matching */
929 int *stat) /* out: 1 for matches, 0 for not */
931 xfs_rtword_t *b; /* current word in buffer */
932 int bit; /* bit number in the word */
933 xfs_rtblock_t block; /* bitmap block number */
934 xfs_buf_t *bp; /* buf for the block */
935 xfs_rtword_t *bufp; /* starting word in buffer */
936 int error; /* error value */
937 xfs_rtblock_t i; /* current bit number rel. to start */
938 xfs_rtblock_t lastbit; /* last useful bit in word */
939 xfs_rtword_t mask; /* mask of relevant bits for value */
940 xfs_rtword_t wdiff; /* difference from wanted value */
941 int word; /* word number in the buffer */
944 * Compute starting bitmap block number
946 block = XFS_BITTOBLOCK(mp, start);
948 * Read the bitmap block.
950 error = xfs_rtbuf_get(mp, tp, block, 0, &bp);
954 bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
956 * Compute the starting word's address, and starting bit.
958 word = XFS_BITTOWORD(mp, start);
960 bit = (int)(start & (XFS_NBWORD - 1));
962 * 0 (allocated) => all zero's; 1 (free) => all one's.
966 * If not starting on a word boundary, deal with the first
971 * Compute first bit not examined.
973 lastbit = XFS_RTMIN(bit + len, XFS_NBWORD);
975 * Mask of relevant bits.
977 mask = (((xfs_rtword_t)1 << (lastbit - bit)) - 1) << bit;
979 * Compute difference between actual and desired value.
981 if ((wdiff = (*b ^ val) & mask)) {
983 * Different, compute first wrong bit and return.
985 xfs_trans_brelse(tp, bp);
986 i = XFS_RTLOBIT(wdiff) - bit;
993 * Go on to next block if that's where the next word is
994 * and we need the next word.
996 if (++word == XFS_BLOCKWSIZE(mp) && i < len) {
998 * If done with this block, get the next one.
1000 xfs_trans_brelse(tp, bp);
1001 error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp);
1005 b = bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1009 * Go on to the next word in the buffer.
1015 * Starting on a word boundary, no partial word.
1020 * Loop over whole words in buffers. When we use up one buffer
1021 * we move on to the next one.
1023 while (len - i >= XFS_NBWORD) {
1025 * Compute difference between actual and desired value.
1027 if ((wdiff = *b ^ val)) {
1029 * Different, compute first wrong bit and return.
1031 xfs_trans_brelse(tp, bp);
1032 i += XFS_RTLOBIT(wdiff);
1039 * Go on to next block if that's where the next word is
1040 * and we need the next word.
1042 if (++word == XFS_BLOCKWSIZE(mp) && i < len) {
1044 * If done with this block, get the next one.
1046 xfs_trans_brelse(tp, bp);
1047 error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp);
1051 b = bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1055 * Go on to the next word in the buffer.
1061 * If not ending on a word boundary, deal with the last
1064 if ((lastbit = len - i)) {
1066 * Mask of relevant bits.
1068 mask = ((xfs_rtword_t)1 << lastbit) - 1;
1070 * Compute difference between actual and desired value.
1072 if ((wdiff = (*b ^ val) & mask)) {
1074 * Different, compute first wrong bit and return.
1076 xfs_trans_brelse(tp, bp);
1077 i += XFS_RTLOBIT(wdiff);
1085 * Successful, return.
1087 xfs_trans_brelse(tp, bp);
1094 * Copy and transform the summary file, given the old and new
1095 * parameters in the mount structures.
1097 STATIC int /* error */
1099 xfs_mount_t *omp, /* old file system mount point */
1100 xfs_mount_t *nmp, /* new file system mount point */
1101 xfs_trans_t *tp) /* transaction pointer */
1103 xfs_rtblock_t bbno; /* bitmap block number */
1104 xfs_buf_t *bp; /* summary buffer */
1105 int error; /* error return value */
1106 int log; /* summary level number (log length) */
1107 xfs_suminfo_t sum; /* summary data */
1108 xfs_fsblock_t sumbno; /* summary block number */
1111 for (log = omp->m_rsumlevels - 1; log >= 0; log--) {
1112 for (bbno = omp->m_sb.sb_rbmblocks - 1;
1113 (xfs_srtblock_t)bbno >= 0;
1115 error = xfs_rtget_summary(omp, tp, log, bbno, &bp,
1121 error = xfs_rtmodify_summary(omp, tp, log, bbno, -sum,
1125 error = xfs_rtmodify_summary(nmp, tp, log, bbno, sum,
1136 * Searching backward from start to limit, find the first block whose
1137 * allocated/free state is different from start's.
1139 STATIC int /* error */
1141 xfs_mount_t *mp, /* file system mount point */
1142 xfs_trans_t *tp, /* transaction pointer */
1143 xfs_rtblock_t start, /* starting block to look at */
1144 xfs_rtblock_t limit, /* last block to look at */
1145 xfs_rtblock_t *rtblock) /* out: start block found */
1147 xfs_rtword_t *b; /* current word in buffer */
1148 int bit; /* bit number in the word */
1149 xfs_rtblock_t block; /* bitmap block number */
1150 xfs_buf_t *bp; /* buf for the block */
1151 xfs_rtword_t *bufp; /* starting word in buffer */
1152 int error; /* error value */
1153 xfs_rtblock_t firstbit; /* first useful bit in the word */
1154 xfs_rtblock_t i; /* current bit number rel. to start */
1155 xfs_rtblock_t len; /* length of inspected area */
1156 xfs_rtword_t mask; /* mask of relevant bits for value */
1157 xfs_rtword_t want; /* mask for "good" values */
1158 xfs_rtword_t wdiff; /* difference from wanted value */
1159 int word; /* word number in the buffer */
1162 * Compute and read in starting bitmap block for starting block.
1164 block = XFS_BITTOBLOCK(mp, start);
1165 error = xfs_rtbuf_get(mp, tp, block, 0, &bp);
1169 bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1171 * Get the first word's index & point to it.
1173 word = XFS_BITTOWORD(mp, start);
1175 bit = (int)(start & (XFS_NBWORD - 1));
1176 len = start - limit + 1;
1178 * Compute match value, based on the bit at start: if 1 (free)
1179 * then all-ones, else all-zeroes.
1181 want = (*b & ((xfs_rtword_t)1 << bit)) ? -1 : 0;
1183 * If the starting position is not word-aligned, deal with the
1186 if (bit < XFS_NBWORD - 1) {
1188 * Calculate first (leftmost) bit number to look at,
1189 * and mask for all the relevant bits in this word.
1191 firstbit = XFS_RTMAX((xfs_srtblock_t)(bit - len + 1), 0);
1192 mask = (((xfs_rtword_t)1 << (bit - firstbit + 1)) - 1) <<
1195 * Calculate the difference between the value there
1196 * and what we're looking for.
1198 if ((wdiff = (*b ^ want) & mask)) {
1200 * Different. Mark where we are and return.
1202 xfs_trans_brelse(tp, bp);
1203 i = bit - XFS_RTHIBIT(wdiff);
1204 *rtblock = start - i + 1;
1207 i = bit - firstbit + 1;
1209 * Go on to previous block if that's where the previous word is
1210 * and we need the previous word.
1212 if (--word == -1 && i < len) {
1214 * If done with this block, get the previous one.
1216 xfs_trans_brelse(tp, bp);
1217 error = xfs_rtbuf_get(mp, tp, --block, 0, &bp);
1221 bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1222 word = XFS_BLOCKWMASK(mp);
1226 * Go on to the previous word in the buffer.
1232 * Starting on a word boundary, no partial word.
1237 * Loop over whole words in buffers. When we use up one buffer
1238 * we move on to the previous one.
1240 while (len - i >= XFS_NBWORD) {
1242 * Compute difference between actual and desired value.
1244 if ((wdiff = *b ^ want)) {
1246 * Different, mark where we are and return.
1248 xfs_trans_brelse(tp, bp);
1249 i += XFS_NBWORD - 1 - XFS_RTHIBIT(wdiff);
1250 *rtblock = start - i + 1;
1255 * Go on to previous block if that's where the previous word is
1256 * and we need the previous word.
1258 if (--word == -1 && i < len) {
1260 * If done with this block, get the previous one.
1262 xfs_trans_brelse(tp, bp);
1263 error = xfs_rtbuf_get(mp, tp, --block, 0, &bp);
1267 bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1268 word = XFS_BLOCKWMASK(mp);
1272 * Go on to the previous word in the buffer.
1278 * If not ending on a word boundary, deal with the last
1283 * Calculate first (leftmost) bit number to look at,
1284 * and mask for all the relevant bits in this word.
1286 firstbit = XFS_NBWORD - (len - i);
1287 mask = (((xfs_rtword_t)1 << (len - i)) - 1) << firstbit;
1289 * Compute difference between actual and desired value.
1291 if ((wdiff = (*b ^ want) & mask)) {
1293 * Different, mark where we are and return.
1295 xfs_trans_brelse(tp, bp);
1296 i += XFS_NBWORD - 1 - XFS_RTHIBIT(wdiff);
1297 *rtblock = start - i + 1;
1303 * No match, return that we scanned the whole area.
1305 xfs_trans_brelse(tp, bp);
1306 *rtblock = start - i + 1;
1311 * Searching forward from start to limit, find the first block whose
1312 * allocated/free state is different from start's.
1314 STATIC int /* error */
1316 xfs_mount_t *mp, /* file system mount point */
1317 xfs_trans_t *tp, /* transaction pointer */
1318 xfs_rtblock_t start, /* starting block to look at */
1319 xfs_rtblock_t limit, /* last block to look at */
1320 xfs_rtblock_t *rtblock) /* out: start block found */
1322 xfs_rtword_t *b; /* current word in buffer */
1323 int bit; /* bit number in the word */
1324 xfs_rtblock_t block; /* bitmap block number */
1325 xfs_buf_t *bp; /* buf for the block */
1326 xfs_rtword_t *bufp; /* starting word in buffer */
1327 int error; /* error value */
1328 xfs_rtblock_t i; /* current bit number rel. to start */
1329 xfs_rtblock_t lastbit; /* last useful bit in the word */
1330 xfs_rtblock_t len; /* length of inspected area */
1331 xfs_rtword_t mask; /* mask of relevant bits for value */
1332 xfs_rtword_t want; /* mask for "good" values */
1333 xfs_rtword_t wdiff; /* difference from wanted value */
1334 int word; /* word number in the buffer */
1337 * Compute and read in starting bitmap block for starting block.
1339 block = XFS_BITTOBLOCK(mp, start);
1340 error = xfs_rtbuf_get(mp, tp, block, 0, &bp);
1344 bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1346 * Get the first word's index & point to it.
1348 word = XFS_BITTOWORD(mp, start);
1350 bit = (int)(start & (XFS_NBWORD - 1));
1351 len = limit - start + 1;
1353 * Compute match value, based on the bit at start: if 1 (free)
1354 * then all-ones, else all-zeroes.
1356 want = (*b & ((xfs_rtword_t)1 << bit)) ? -1 : 0;
1358 * If the starting position is not word-aligned, deal with the
1363 * Calculate last (rightmost) bit number to look at,
1364 * and mask for all the relevant bits in this word.
1366 lastbit = XFS_RTMIN(bit + len, XFS_NBWORD);
1367 mask = (((xfs_rtword_t)1 << (lastbit - bit)) - 1) << bit;
1369 * Calculate the difference between the value there
1370 * and what we're looking for.
1372 if ((wdiff = (*b ^ want) & mask)) {
1374 * Different. Mark where we are and return.
1376 xfs_trans_brelse(tp, bp);
1377 i = XFS_RTLOBIT(wdiff) - bit;
1378 *rtblock = start + i - 1;
1383 * Go on to next block if that's where the next word is
1384 * and we need the next word.
1386 if (++word == XFS_BLOCKWSIZE(mp) && i < len) {
1388 * If done with this block, get the previous one.
1390 xfs_trans_brelse(tp, bp);
1391 error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp);
1395 b = bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1399 * Go on to the previous word in the buffer.
1405 * Starting on a word boundary, no partial word.
1410 * Loop over whole words in buffers. When we use up one buffer
1411 * we move on to the next one.
1413 while (len - i >= XFS_NBWORD) {
1415 * Compute difference between actual and desired value.
1417 if ((wdiff = *b ^ want)) {
1419 * Different, mark where we are and return.
1421 xfs_trans_brelse(tp, bp);
1422 i += XFS_RTLOBIT(wdiff);
1423 *rtblock = start + i - 1;
1428 * Go on to next block if that's where the next word is
1429 * and we need the next word.
1431 if (++word == XFS_BLOCKWSIZE(mp) && i < len) {
1433 * If done with this block, get the next one.
1435 xfs_trans_brelse(tp, bp);
1436 error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp);
1440 b = bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1444 * Go on to the next word in the buffer.
1450 * If not ending on a word boundary, deal with the last
1453 if ((lastbit = len - i)) {
1455 * Calculate mask for all the relevant bits in this word.
1457 mask = ((xfs_rtword_t)1 << lastbit) - 1;
1459 * Compute difference between actual and desired value.
1461 if ((wdiff = (*b ^ want) & mask)) {
1463 * Different, mark where we are and return.
1465 xfs_trans_brelse(tp, bp);
1466 i += XFS_RTLOBIT(wdiff);
1467 *rtblock = start + i - 1;
1473 * No match, return that we scanned the whole area.
1475 xfs_trans_brelse(tp, bp);
1476 *rtblock = start + i - 1;
1481 * Mark an extent specified by start and len freed.
1482 * Updates all the summary information as well as the bitmap.
1484 STATIC int /* error */
1486 xfs_mount_t *mp, /* file system mount point */
1487 xfs_trans_t *tp, /* transaction pointer */
1488 xfs_rtblock_t start, /* starting block to free */
1489 xfs_extlen_t len, /* length to free */
1490 xfs_buf_t **rbpp, /* in/out: summary block buffer */
1491 xfs_fsblock_t *rsb) /* in/out: summary block number */
1493 xfs_rtblock_t end; /* end of the freed extent */
1494 int error; /* error value */
1495 xfs_rtblock_t postblock; /* first block freed > end */
1496 xfs_rtblock_t preblock; /* first block freed < start */
1498 end = start + len - 1;
1500 * Modify the bitmap to mark this extent freed.
1502 error = xfs_rtmodify_range(mp, tp, start, len, 1);
1507 * Assume we're freeing out of the middle of an allocated extent.
1508 * We need to find the beginning and end of the extent so we can
1509 * properly update the summary.
1511 error = xfs_rtfind_back(mp, tp, start, 0, &preblock);
1516 * Find the next allocated block (end of allocated extent).
1518 error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1,
1521 * If there are blocks not being freed at the front of the
1522 * old extent, add summary data for them to be allocated.
1524 if (preblock < start) {
1525 error = xfs_rtmodify_summary(mp, tp,
1526 XFS_RTBLOCKLOG(start - preblock),
1527 XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb);
1533 * If there are blocks not being freed at the end of the
1534 * old extent, add summary data for them to be allocated.
1536 if (postblock > end) {
1537 error = xfs_rtmodify_summary(mp, tp,
1538 XFS_RTBLOCKLOG(postblock - end),
1539 XFS_BITTOBLOCK(mp, end + 1), -1, rbpp, rsb);
1545 * Increment the summary information corresponding to the entire
1546 * (new) free extent.
1548 error = xfs_rtmodify_summary(mp, tp,
1549 XFS_RTBLOCKLOG(postblock + 1 - preblock),
1550 XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb);
1555 * Read and return the summary information for a given extent size,
1556 * bitmap block combination.
1557 * Keeps track of a current summary block, so we don't keep reading
1558 * it from the buffer cache.
1560 STATIC int /* error */
1562 xfs_mount_t *mp, /* file system mount structure */
1563 xfs_trans_t *tp, /* transaction pointer */
1564 int log, /* log2 of extent size */
1565 xfs_rtblock_t bbno, /* bitmap block number */
1566 xfs_buf_t **rbpp, /* in/out: summary block buffer */
1567 xfs_fsblock_t *rsb, /* in/out: summary block number */
1568 xfs_suminfo_t *sum) /* out: summary info for this block */
1570 xfs_buf_t *bp; /* buffer for summary block */
1571 int error; /* error value */
1572 xfs_fsblock_t sb; /* summary fsblock */
1573 int so; /* index into the summary file */
1574 xfs_suminfo_t *sp; /* pointer to returned data */
1577 * Compute entry number in the summary file.
1579 so = XFS_SUMOFFS(mp, log, bbno);
1581 * Compute the block number in the summary file.
1583 sb = XFS_SUMOFFSTOBLOCK(mp, so);
1585 * If we have an old buffer, and the block number matches, use that.
1587 if (rbpp && *rbpp && *rsb == sb)
1590 * Otherwise we have to get the buffer.
1594 * If there was an old one, get rid of it first.
1597 xfs_trans_brelse(tp, *rbpp);
1598 error = xfs_rtbuf_get(mp, tp, sb, 1, &bp);
1603 * Remember this buffer and block for the next call.
1611 * Point to the summary information & copy it out.
1613 sp = XFS_SUMPTR(mp, bp, so);
1616 * Drop the buffer if we're not asked to remember it.
1619 xfs_trans_brelse(tp, bp);
1624 * Set the given range of bitmap bits to the given value.
1625 * Do whatever I/O and logging is required.
1627 STATIC int /* error */
1629 xfs_mount_t *mp, /* file system mount point */
1630 xfs_trans_t *tp, /* transaction pointer */
1631 xfs_rtblock_t start, /* starting block to modify */
1632 xfs_extlen_t len, /* length of extent to modify */
1633 int val) /* 1 for free, 0 for allocated */
1635 xfs_rtword_t *b; /* current word in buffer */
1636 int bit; /* bit number in the word */
1637 xfs_rtblock_t block; /* bitmap block number */
1638 xfs_buf_t *bp; /* buf for the block */
1639 xfs_rtword_t *bufp; /* starting word in buffer */
1640 int error; /* error value */
1641 xfs_rtword_t *first; /* first used word in the buffer */
1642 int i; /* current bit number rel. to start */
1643 int lastbit; /* last useful bit in word */
1644 xfs_rtword_t mask; /* mask o frelevant bits for value */
1645 int word; /* word number in the buffer */
1648 * Compute starting bitmap block number.
1650 block = XFS_BITTOBLOCK(mp, start);
1652 * Read the bitmap block, and point to its data.
1654 error = xfs_rtbuf_get(mp, tp, block, 0, &bp);
1658 bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1660 * Compute the starting word's address, and starting bit.
1662 word = XFS_BITTOWORD(mp, start);
1663 first = b = &bufp[word];
1664 bit = (int)(start & (XFS_NBWORD - 1));
1666 * 0 (allocated) => all zeroes; 1 (free) => all ones.
1670 * If not starting on a word boundary, deal with the first
1675 * Compute first bit not changed and mask of relevant bits.
1677 lastbit = XFS_RTMIN(bit + len, XFS_NBWORD);
1678 mask = (((xfs_rtword_t)1 << (lastbit - bit)) - 1) << bit;
1680 * Set/clear the active bits.
1688 * Go on to the next block if that's where the next word is
1689 * and we need the next word.
1691 if (++word == XFS_BLOCKWSIZE(mp) && i < len) {
1693 * Log the changed part of this block.
1696 xfs_trans_log_buf(tp, bp,
1697 (uint)((char *)first - (char *)bufp),
1698 (uint)((char *)b - (char *)bufp));
1699 error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp);
1703 first = b = bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1707 * Go on to the next word in the buffer
1713 * Starting on a word boundary, no partial word.
1718 * Loop over whole words in buffers. When we use up one buffer
1719 * we move on to the next one.
1721 while (len - i >= XFS_NBWORD) {
1723 * Set the word value correctly.
1728 * Go on to the next block if that's where the next word is
1729 * and we need the next word.
1731 if (++word == XFS_BLOCKWSIZE(mp) && i < len) {
1733 * Log the changed part of this block.
1736 xfs_trans_log_buf(tp, bp,
1737 (uint)((char *)first - (char *)bufp),
1738 (uint)((char *)b - (char *)bufp));
1739 error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp);
1743 first = b = bufp = (xfs_rtword_t *)XFS_BUF_PTR(bp);
1747 * Go on to the next word in the buffer
1753 * If not ending on a word boundary, deal with the last
1756 if ((lastbit = len - i)) {
1758 * Compute a mask of relevant bits.
1761 mask = ((xfs_rtword_t)1 << lastbit) - 1;
1763 * Set/clear the active bits.
1772 * Log any remaining changed bytes.
1775 xfs_trans_log_buf(tp, bp, (uint)((char *)first - (char *)bufp),
1776 (uint)((char *)b - (char *)bufp - 1));
1781 * Read and modify the summary information for a given extent size,
1782 * bitmap block combination.
1783 * Keeps track of a current summary block, so we don't keep reading
1784 * it from the buffer cache.
1786 STATIC int /* error */
1787 xfs_rtmodify_summary(
1788 xfs_mount_t *mp, /* file system mount point */
1789 xfs_trans_t *tp, /* transaction pointer */
1790 int log, /* log2 of extent size */
1791 xfs_rtblock_t bbno, /* bitmap block number */
1792 int delta, /* change to make to summary info */
1793 xfs_buf_t **rbpp, /* in/out: summary block buffer */
1794 xfs_fsblock_t *rsb) /* in/out: summary block number */
1796 xfs_buf_t *bp; /* buffer for the summary block */
1797 int error; /* error value */
1798 xfs_fsblock_t sb; /* summary fsblock */
1799 int so; /* index into the summary file */
1800 xfs_suminfo_t *sp; /* pointer to returned data */
1803 * Compute entry number in the summary file.
1805 so = XFS_SUMOFFS(mp, log, bbno);
1807 * Compute the block number in the summary file.
1809 sb = XFS_SUMOFFSTOBLOCK(mp, so);
1811 * If we have an old buffer, and the block number matches, use that.
1813 if (rbpp && *rbpp && *rsb == sb)
1816 * Otherwise we have to get the buffer.
1820 * If there was an old one, get rid of it first.
1823 xfs_trans_brelse(tp, *rbpp);
1824 error = xfs_rtbuf_get(mp, tp, sb, 1, &bp);
1829 * Remember this buffer and block for the next call.
1837 * Point to the summary information, modify and log it.
1839 sp = XFS_SUMPTR(mp, bp, so);
1841 xfs_trans_log_buf(tp, bp, (uint)((char *)sp - (char *)XFS_BUF_PTR(bp)),
1842 (uint)((char *)sp - (char *)XFS_BUF_PTR(bp) + sizeof(*sp) - 1));
1847 * Visible (exported) functions.
1851 * Grow the realtime area of the filesystem.
1855 xfs_mount_t *mp, /* mount point for filesystem */
1856 xfs_growfs_rt_t *in) /* growfs rt input struct */
1858 xfs_rtblock_t bmbno; /* bitmap block number */
1859 xfs_buf_t *bp; /* temporary buffer */
1860 int cancelflags; /* flags for xfs_trans_cancel */
1861 int error; /* error return value */
1862 xfs_inode_t *ip; /* bitmap inode, used as lock */
1863 xfs_mount_t *nmp; /* new (fake) mount structure */
1864 xfs_drfsbno_t nrblocks; /* new number of realtime blocks */
1865 xfs_extlen_t nrbmblocks; /* new number of rt bitmap blocks */
1866 xfs_drtbno_t nrextents; /* new number of realtime extents */
1867 uint8_t nrextslog; /* new log2 of sb_rextents */
1868 xfs_extlen_t nrsumblocks; /* new number of summary blocks */
1869 uint nrsumlevels; /* new rt summary levels */
1870 uint nrsumsize; /* new size of rt summary, bytes */
1871 xfs_sb_t *nsbp; /* new superblock */
1872 xfs_extlen_t rbmblocks; /* current number of rt bitmap blocks */
1873 xfs_extlen_t rsumblocks; /* current number of rt summary blks */
1874 xfs_sb_t *sbp; /* old superblock */
1875 xfs_fsblock_t sumbno; /* summary block number */
1876 xfs_trans_t *tp; /* transaction pointer */
1880 * Initial error checking.
1882 if (mp->m_rtdev_targp == NULL || mp->m_rbmip == NULL ||
1883 (nrblocks = in->newblocks) <= sbp->sb_rblocks ||
1884 (sbp->sb_rblocks && (in->extsize != sbp->sb_rextsize)))
1885 return XFS_ERROR(EINVAL);
1886 if ((error = xfs_sb_validate_fsb_count(sbp, nrblocks)))
1889 * Read in the last block of the device, make sure it exists.
1891 error = xfs_read_buf(mp, mp->m_rtdev_targp,
1892 XFS_FSB_TO_BB(mp, nrblocks - 1),
1893 XFS_FSB_TO_BB(mp, 1), 0, &bp);
1899 * Calculate new parameters. These are the final values to be reached.
1901 nrextents = nrblocks;
1902 do_div(nrextents, in->extsize);
1903 nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize);
1904 nrextslog = xfs_highbit32(nrextents);
1905 nrsumlevels = nrextslog + 1;
1906 nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks;
1907 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
1908 nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
1910 * New summary size can't be more than half the size of
1911 * the log. This prevents us from getting a log overflow,
1912 * since we'll log basically the whole summary file at once.
1914 if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1))
1915 return XFS_ERROR(EINVAL);
1917 * Get the old block counts for bitmap and summary inodes.
1918 * These can't change since other growfs callers are locked out.
1920 rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_d.di_size);
1921 rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_d.di_size);
1923 * Allocate space to the bitmap and summary files, as necessary.
1925 if ((error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks,
1926 mp->m_sb.sb_rbmino)))
1928 if ((error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks,
1929 mp->m_sb.sb_rsumino)))
1932 * Allocate a new (fake) mount/sb.
1934 nmp = kmem_alloc(sizeof(*nmp), KM_SLEEP);
1936 * Loop over the bitmap blocks.
1937 * We will do everything one bitmap block at a time.
1938 * Skip the current block if it is exactly full.
1939 * This also deals with the case where there were no rtextents before.
1941 for (bmbno = sbp->sb_rbmblocks -
1942 ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0);
1948 * Calculate new sb and mount fields for this round.
1950 nsbp->sb_rextsize = in->extsize;
1951 nsbp->sb_rbmblocks = bmbno + 1;
1954 nsbp->sb_rbmblocks * NBBY *
1955 nsbp->sb_blocksize * nsbp->sb_rextsize);
1956 nsbp->sb_rextents = nsbp->sb_rblocks;
1957 do_div(nsbp->sb_rextents, nsbp->sb_rextsize);
1958 nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents);
1959 nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1;
1961 (uint)sizeof(xfs_suminfo_t) * nrsumlevels *
1963 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
1964 nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
1966 * Start a transaction, get the log reservation.
1968 tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_FREE);
1970 if ((error = xfs_trans_reserve(tp, 0,
1971 XFS_GROWRTFREE_LOG_RES(nmp), 0, 0, 0)))
1974 * Lock out other callers by grabbing the bitmap inode lock.
1976 if ((error = xfs_trans_iget(mp, tp, mp->m_sb.sb_rbmino, 0,
1977 XFS_ILOCK_EXCL, &ip)))
1979 ASSERT(ip == mp->m_rbmip);
1981 * Update the bitmap inode's size.
1983 mp->m_rbmip->i_d.di_size =
1984 nsbp->sb_rbmblocks * nsbp->sb_blocksize;
1985 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1986 cancelflags |= XFS_TRANS_ABORT;
1988 * Get the summary inode into the transaction.
1990 if ((error = xfs_trans_iget(mp, tp, mp->m_sb.sb_rsumino, 0,
1991 XFS_ILOCK_EXCL, &ip)))
1993 ASSERT(ip == mp->m_rsumip);
1995 * Update the summary inode's size.
1997 mp->m_rsumip->i_d.di_size = nmp->m_rsumsize;
1998 xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE);
2000 * Copy summary data from old to new sizes.
2001 * Do this when the real size (not block-aligned) changes.
2003 if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks ||
2004 mp->m_rsumlevels != nmp->m_rsumlevels) {
2005 error = xfs_rtcopy_summary(mp, nmp, tp);
2010 * Update superblock fields.
2012 if (nsbp->sb_rextsize != sbp->sb_rextsize)
2013 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE,
2014 nsbp->sb_rextsize - sbp->sb_rextsize);
2015 if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks)
2016 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS,
2017 nsbp->sb_rbmblocks - sbp->sb_rbmblocks);
2018 if (nsbp->sb_rblocks != sbp->sb_rblocks)
2019 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS,
2020 nsbp->sb_rblocks - sbp->sb_rblocks);
2021 if (nsbp->sb_rextents != sbp->sb_rextents)
2022 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS,
2023 nsbp->sb_rextents - sbp->sb_rextents);
2024 if (nsbp->sb_rextslog != sbp->sb_rextslog)
2025 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG,
2026 nsbp->sb_rextslog - sbp->sb_rextslog);
2031 error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents,
2032 nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno);
2036 * Mark more blocks free in the superblock.
2038 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS,
2039 nsbp->sb_rextents - sbp->sb_rextents);
2041 * Update mp values into the real mp structure.
2043 mp->m_rsumlevels = nrsumlevels;
2044 mp->m_rsumsize = nrsumsize;
2046 * Commit the transaction.
2048 xfs_trans_commit(tp, 0);
2052 xfs_trans_cancel(tp, cancelflags);
2055 * Free the fake mp structure.
2057 kmem_free(nmp, sizeof(*nmp));
2063 * Allocate an extent in the realtime subvolume, with the usual allocation
2064 * parameters. The length units are all in realtime extents, as is the
2065 * result block number.
2068 xfs_rtallocate_extent(
2069 xfs_trans_t *tp, /* transaction pointer */
2070 xfs_rtblock_t bno, /* starting block number to allocate */
2071 xfs_extlen_t minlen, /* minimum length to allocate */
2072 xfs_extlen_t maxlen, /* maximum length to allocate */
2073 xfs_extlen_t *len, /* out: actual length allocated */
2074 xfs_alloctype_t type, /* allocation type XFS_ALLOCTYPE... */
2075 int wasdel, /* was a delayed allocation extent */
2076 xfs_extlen_t prod, /* extent product factor */
2077 xfs_rtblock_t *rtblock) /* out: start block allocated */
2079 int error; /* error value */
2080 xfs_inode_t *ip; /* inode for bitmap file */
2081 xfs_mount_t *mp; /* file system mount structure */
2082 xfs_rtblock_t r; /* result allocated block */
2083 xfs_fsblock_t sb; /* summary file block number */
2084 xfs_buf_t *sumbp; /* summary file block buffer */
2086 ASSERT(minlen > 0 && minlen <= maxlen);
2089 * If prod is set then figure out what to do to minlen and maxlen.
2094 if ((i = maxlen % prod))
2096 if ((i = minlen % prod))
2098 if (maxlen < minlen) {
2099 *rtblock = NULLRTBLOCK;
2104 * Lock out other callers by grabbing the bitmap inode lock.
2106 if ((error = xfs_trans_iget(mp, tp, mp->m_sb.sb_rbmino, 0,
2107 XFS_ILOCK_EXCL, &ip)))
2111 * Allocate by size, or near another block, or exactly at some block.
2114 case XFS_ALLOCTYPE_ANY_AG:
2115 error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len,
2116 &sumbp, &sb, prod, &r);
2118 case XFS_ALLOCTYPE_NEAR_BNO:
2119 error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen,
2120 len, &sumbp, &sb, prod, &r);
2122 case XFS_ALLOCTYPE_THIS_BNO:
2123 error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen,
2124 len, &sumbp, &sb, prod, &r);
2133 * If it worked, update the superblock.
2135 if (r != NULLRTBLOCK) {
2136 long slen = (long)*len;
2138 ASSERT(*len >= minlen && *len <= maxlen);
2140 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen);
2142 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen);
2149 * Free an extent in the realtime subvolume. Length is expressed in
2150 * realtime extents, as is the block number.
2154 xfs_trans_t *tp, /* transaction pointer */
2155 xfs_rtblock_t bno, /* starting block number to free */
2156 xfs_extlen_t len) /* length of extent freed */
2158 int error; /* error value */
2159 xfs_inode_t *ip; /* bitmap file inode */
2160 xfs_mount_t *mp; /* file system mount structure */
2161 xfs_fsblock_t sb; /* summary file block number */
2162 xfs_buf_t *sumbp; /* summary file block buffer */
2166 * Synchronize by locking the bitmap inode.
2168 if ((error = xfs_trans_iget(mp, tp, mp->m_sb.sb_rbmino, 0,
2169 XFS_ILOCK_EXCL, &ip)))
2171 #if defined(__KERNEL__) && defined(DEBUG)
2173 * Check to see that this whole range is currently allocated.
2176 int stat; /* result from checking range */
2178 error = xfs_rtcheck_alloc_range(mp, tp, bno, len, &stat);
2187 * Free the range of realtime blocks.
2189 error = xfs_rtfree_range(mp, tp, bno, len, &sumbp, &sb);
2194 * Mark more blocks free in the superblock.
2196 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, (long)len);
2198 * If we've now freed all the blocks, reset the file sequence
2201 if (tp->t_frextents_delta + mp->m_sb.sb_frextents ==
2202 mp->m_sb.sb_rextents) {
2203 if (!(ip->i_d.di_flags & XFS_DIFLAG_NEWRTBM))
2204 ip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM;
2205 *(__uint64_t *)&ip->i_d.di_atime = 0;
2206 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
2212 * Initialize realtime fields in the mount structure.
2216 xfs_mount_t *mp) /* file system mount structure */
2218 xfs_buf_t *bp; /* buffer for last block of subvolume */
2219 xfs_daddr_t d; /* address of last block of subvolume */
2220 int error; /* error return value */
2221 xfs_sb_t *sbp; /* filesystem superblock copy in mount */
2224 if (sbp->sb_rblocks == 0)
2226 if (mp->m_rtdev_targp == NULL) {
2228 "XFS: This filesystem has a realtime volume, use rtdev=device option");
2229 return XFS_ERROR(ENODEV);
2231 mp->m_rsumlevels = sbp->sb_rextslog + 1;
2233 (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels *
2235 mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize);
2236 mp->m_rbmip = mp->m_rsumip = NULL;
2238 * Check that the realtime section is an ok size.
2240 d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks);
2241 if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) {
2242 cmn_err(CE_WARN, "XFS: realtime mount -- %llu != %llu",
2243 (unsigned long long) XFS_BB_TO_FSB(mp, d),
2244 (unsigned long long) mp->m_sb.sb_rblocks);
2245 return XFS_ERROR(E2BIG);
2247 error = xfs_read_buf(mp, mp->m_rtdev_targp,
2248 d - XFS_FSB_TO_BB(mp, 1),
2249 XFS_FSB_TO_BB(mp, 1), 0, &bp);
2252 "XFS: realtime mount -- xfs_read_buf failed, returned %d", error);
2253 if (error == ENOSPC)
2254 return XFS_ERROR(E2BIG);
2262 * Get the bitmap and summary inodes into the mount structure
2267 xfs_mount_t *mp) /* file system mount structure */
2269 int error; /* error return value */
2273 if (sbp->sb_rbmino == NULLFSINO)
2275 error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip, 0);
2278 ASSERT(mp->m_rbmip != NULL);
2279 ASSERT(sbp->sb_rsumino != NULLFSINO);
2280 error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip, 0);
2285 ASSERT(mp->m_rsumip != NULL);
2290 * Pick an extent for allocation at the start of a new realtime file.
2291 * Use the sequence number stored in the atime field of the bitmap inode.
2292 * Translate this to a fraction of the rtextents, and return the product
2293 * of rtextents and the fraction.
2294 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
2298 xfs_mount_t *mp, /* file system mount point */
2299 xfs_trans_t *tp, /* transaction pointer */
2300 xfs_extlen_t len, /* allocation length (rtextents) */
2301 xfs_rtblock_t *pick) /* result rt extent */
2303 xfs_rtblock_t b; /* result block */
2304 int error; /* error return value */
2305 xfs_inode_t *ip; /* bitmap incore inode */
2306 int log2; /* log of sequence number */
2307 __uint64_t resid; /* residual after log removed */
2308 __uint64_t seq; /* sequence number of file creation */
2309 __uint64_t *seqp; /* pointer to seqno in inode */
2311 if ((error = xfs_trans_iget(mp, tp, mp->m_sb.sb_rbmino, 0,
2312 XFS_ILOCK_EXCL, &ip)))
2314 ASSERT(ip == mp->m_rbmip);
2315 seqp = (__uint64_t *)&ip->i_d.di_atime;
2316 if (!(ip->i_d.di_flags & XFS_DIFLAG_NEWRTBM)) {
2317 ip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM;
2321 if ((log2 = xfs_highbit64(seq)) == -1)
2324 resid = seq - (1ULL << log2);
2325 b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >>
2327 if (b >= mp->m_sb.sb_rextents)
2328 b = do_mod(b, mp->m_sb.sb_rextents);
2329 if (b + len > mp->m_sb.sb_rextents)
2330 b = mp->m_sb.sb_rextents - len;
2333 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);