Loading...
1/*
2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
8 *
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
17 */
18#include "xfs.h"
19#include "xfs_fs.h"
20#include "xfs_shared.h"
21#include "xfs_format.h"
22#include "xfs_log_format.h"
23#include "xfs_trans_resv.h"
24#include "xfs_bit.h"
25#include "xfs_mount.h"
26#include "xfs_defer.h"
27#include "xfs_inode.h"
28#include "xfs_bmap.h"
29#include "xfs_bmap_util.h"
30#include "xfs_bmap_btree.h"
31#include "xfs_alloc.h"
32#include "xfs_error.h"
33#include "xfs_trans.h"
34#include "xfs_trans_space.h"
35#include "xfs_trace.h"
36#include "xfs_buf.h"
37#include "xfs_icache.h"
38#include "xfs_rtalloc.h"
39
40
41/*
42 * Read and return the summary information for a given extent size,
43 * bitmap block combination.
44 * Keeps track of a current summary block, so we don't keep reading
45 * it from the buffer cache.
46 */
47static int
48xfs_rtget_summary(
49 xfs_mount_t *mp, /* file system mount structure */
50 xfs_trans_t *tp, /* transaction pointer */
51 int log, /* log2 of 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 xfs_suminfo_t *sum) /* out: summary info for this block */
56{
57 return xfs_rtmodify_summary_int(mp, tp, log, bbno, 0, rbpp, rsb, sum);
58}
59
60/*
61 * Return whether there are any free extents in the size range given
62 * by low and high, for the bitmap block bbno.
63 */
64STATIC int /* error */
65xfs_rtany_summary(
66 xfs_mount_t *mp, /* file system mount structure */
67 xfs_trans_t *tp, /* transaction pointer */
68 int low, /* low log2 extent size */
69 int high, /* high log2 extent size */
70 xfs_rtblock_t bbno, /* bitmap block number */
71 xfs_buf_t **rbpp, /* in/out: summary block buffer */
72 xfs_fsblock_t *rsb, /* in/out: summary block number */
73 int *stat) /* out: any good extents here? */
74{
75 int error; /* error value */
76 int log; /* loop counter, log2 of ext. size */
77 xfs_suminfo_t sum; /* summary data */
78
79 /*
80 * Loop over logs of extent sizes. Order is irrelevant.
81 */
82 for (log = low; log <= high; log++) {
83 /*
84 * Get one summary datum.
85 */
86 error = xfs_rtget_summary(mp, tp, log, bbno, rbpp, rsb, &sum);
87 if (error) {
88 return error;
89 }
90 /*
91 * If there are any, return success.
92 */
93 if (sum) {
94 *stat = 1;
95 return 0;
96 }
97 }
98 /*
99 * Found nothing, return failure.
100 */
101 *stat = 0;
102 return 0;
103}
104
105
106/*
107 * Copy and transform the summary file, given the old and new
108 * parameters in the mount structures.
109 */
110STATIC int /* error */
111xfs_rtcopy_summary(
112 xfs_mount_t *omp, /* old file system mount point */
113 xfs_mount_t *nmp, /* new file system mount point */
114 xfs_trans_t *tp) /* transaction pointer */
115{
116 xfs_rtblock_t bbno; /* bitmap block number */
117 xfs_buf_t *bp; /* summary buffer */
118 int error; /* error return value */
119 int log; /* summary level number (log length) */
120 xfs_suminfo_t sum; /* summary data */
121 xfs_fsblock_t sumbno; /* summary block number */
122
123 bp = NULL;
124 for (log = omp->m_rsumlevels - 1; log >= 0; log--) {
125 for (bbno = omp->m_sb.sb_rbmblocks - 1;
126 (xfs_srtblock_t)bbno >= 0;
127 bbno--) {
128 error = xfs_rtget_summary(omp, tp, log, bbno, &bp,
129 &sumbno, &sum);
130 if (error)
131 return error;
132 if (sum == 0)
133 continue;
134 error = xfs_rtmodify_summary(omp, tp, log, bbno, -sum,
135 &bp, &sumbno);
136 if (error)
137 return error;
138 error = xfs_rtmodify_summary(nmp, tp, log, bbno, sum,
139 &bp, &sumbno);
140 if (error)
141 return error;
142 ASSERT(sum > 0);
143 }
144 }
145 return 0;
146}
147/*
148 * Mark an extent specified by start and len allocated.
149 * Updates all the summary information as well as the bitmap.
150 */
151STATIC int /* error */
152xfs_rtallocate_range(
153 xfs_mount_t *mp, /* file system mount point */
154 xfs_trans_t *tp, /* transaction pointer */
155 xfs_rtblock_t start, /* start block to allocate */
156 xfs_extlen_t len, /* length to allocate */
157 xfs_buf_t **rbpp, /* in/out: summary block buffer */
158 xfs_fsblock_t *rsb) /* in/out: summary block number */
159{
160 xfs_rtblock_t end; /* end of the allocated extent */
161 int error; /* error value */
162 xfs_rtblock_t postblock = 0; /* first block allocated > end */
163 xfs_rtblock_t preblock = 0; /* first block allocated < start */
164
165 end = start + len - 1;
166 /*
167 * Assume we're allocating out of the middle of a free extent.
168 * We need to find the beginning and end of the extent so we can
169 * properly update the summary.
170 */
171 error = xfs_rtfind_back(mp, tp, start, 0, &preblock);
172 if (error) {
173 return error;
174 }
175 /*
176 * Find the next allocated block (end of free extent).
177 */
178 error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1,
179 &postblock);
180 if (error) {
181 return error;
182 }
183 /*
184 * Decrement the summary information corresponding to the entire
185 * (old) free extent.
186 */
187 error = xfs_rtmodify_summary(mp, tp,
188 XFS_RTBLOCKLOG(postblock + 1 - preblock),
189 XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb);
190 if (error) {
191 return error;
192 }
193 /*
194 * If there are blocks not being allocated at the front of the
195 * old extent, add summary data for them to be free.
196 */
197 if (preblock < start) {
198 error = xfs_rtmodify_summary(mp, tp,
199 XFS_RTBLOCKLOG(start - preblock),
200 XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb);
201 if (error) {
202 return error;
203 }
204 }
205 /*
206 * If there are blocks not being allocated at the end of the
207 * old extent, add summary data for them to be free.
208 */
209 if (postblock > end) {
210 error = xfs_rtmodify_summary(mp, tp,
211 XFS_RTBLOCKLOG(postblock - end),
212 XFS_BITTOBLOCK(mp, end + 1), 1, rbpp, rsb);
213 if (error) {
214 return error;
215 }
216 }
217 /*
218 * Modify the bitmap to mark this extent allocated.
219 */
220 error = xfs_rtmodify_range(mp, tp, start, len, 0);
221 return error;
222}
223
224/*
225 * Attempt to allocate an extent minlen<=len<=maxlen starting from
226 * bitmap block bbno. If we don't get maxlen then use prod to trim
227 * the length, if given. Returns error; returns starting block in *rtblock.
228 * The lengths are all in rtextents.
229 */
230STATIC int /* error */
231xfs_rtallocate_extent_block(
232 xfs_mount_t *mp, /* file system mount point */
233 xfs_trans_t *tp, /* transaction pointer */
234 xfs_rtblock_t bbno, /* bitmap block number */
235 xfs_extlen_t minlen, /* minimum length to allocate */
236 xfs_extlen_t maxlen, /* maximum length to allocate */
237 xfs_extlen_t *len, /* out: actual length allocated */
238 xfs_rtblock_t *nextp, /* out: next block to try */
239 xfs_buf_t **rbpp, /* in/out: summary block buffer */
240 xfs_fsblock_t *rsb, /* in/out: summary block number */
241 xfs_extlen_t prod, /* extent product factor */
242 xfs_rtblock_t *rtblock) /* out: start block allocated */
243{
244 xfs_rtblock_t besti; /* best rtblock found so far */
245 xfs_rtblock_t bestlen; /* best length found so far */
246 xfs_rtblock_t end; /* last rtblock in chunk */
247 int error; /* error value */
248 xfs_rtblock_t i; /* current rtblock trying */
249 xfs_rtblock_t next; /* next rtblock to try */
250 int stat; /* status from internal calls */
251
252 /*
253 * Loop over all the extents starting in this bitmap block,
254 * looking for one that's long enough.
255 */
256 for (i = XFS_BLOCKTOBIT(mp, bbno), besti = -1, bestlen = 0,
257 end = XFS_BLOCKTOBIT(mp, bbno + 1) - 1;
258 i <= end;
259 i++) {
260 /*
261 * See if there's a free extent of maxlen starting at i.
262 * If it's not so then next will contain the first non-free.
263 */
264 error = xfs_rtcheck_range(mp, tp, i, maxlen, 1, &next, &stat);
265 if (error) {
266 return error;
267 }
268 if (stat) {
269 /*
270 * i for maxlen is all free, allocate and return that.
271 */
272 error = xfs_rtallocate_range(mp, tp, i, maxlen, rbpp,
273 rsb);
274 if (error) {
275 return error;
276 }
277 *len = maxlen;
278 *rtblock = i;
279 return 0;
280 }
281 /*
282 * In the case where we have a variable-sized allocation
283 * request, figure out how big this free piece is,
284 * and if it's big enough for the minimum, and the best
285 * so far, remember it.
286 */
287 if (minlen < maxlen) {
288 xfs_rtblock_t thislen; /* this extent size */
289
290 thislen = next - i;
291 if (thislen >= minlen && thislen > bestlen) {
292 besti = i;
293 bestlen = thislen;
294 }
295 }
296 /*
297 * If not done yet, find the start of the next free space.
298 */
299 if (next < end) {
300 error = xfs_rtfind_forw(mp, tp, next, end, &i);
301 if (error) {
302 return error;
303 }
304 } else
305 break;
306 }
307 /*
308 * Searched the whole thing & didn't find a maxlen free extent.
309 */
310 if (minlen < maxlen && besti != -1) {
311 xfs_extlen_t p; /* amount to trim length by */
312
313 /*
314 * If size should be a multiple of prod, make that so.
315 */
316 if (prod > 1 && (p = do_mod(bestlen, prod)))
317 bestlen -= p;
318 /*
319 * Allocate besti for bestlen & return that.
320 */
321 error = xfs_rtallocate_range(mp, tp, besti, bestlen, rbpp, rsb);
322 if (error) {
323 return error;
324 }
325 *len = bestlen;
326 *rtblock = besti;
327 return 0;
328 }
329 /*
330 * Allocation failed. Set *nextp to the next block to try.
331 */
332 *nextp = next;
333 *rtblock = NULLRTBLOCK;
334 return 0;
335}
336
337/*
338 * Allocate an extent of length minlen<=len<=maxlen, starting at block
339 * bno. If we don't get maxlen then use prod to trim the length, if given.
340 * Returns error; returns starting block in *rtblock.
341 * The lengths are all in rtextents.
342 */
343STATIC int /* error */
344xfs_rtallocate_extent_exact(
345 xfs_mount_t *mp, /* file system mount point */
346 xfs_trans_t *tp, /* transaction pointer */
347 xfs_rtblock_t bno, /* starting block number to allocate */
348 xfs_extlen_t minlen, /* minimum length to allocate */
349 xfs_extlen_t maxlen, /* maximum length to allocate */
350 xfs_extlen_t *len, /* out: actual length allocated */
351 xfs_buf_t **rbpp, /* in/out: summary block buffer */
352 xfs_fsblock_t *rsb, /* in/out: summary block number */
353 xfs_extlen_t prod, /* extent product factor */
354 xfs_rtblock_t *rtblock) /* out: start block allocated */
355{
356 int error; /* error value */
357 xfs_extlen_t i; /* extent length trimmed due to prod */
358 int isfree; /* extent is free */
359 xfs_rtblock_t next; /* next block to try (dummy) */
360
361 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
362 /*
363 * Check if the range in question (for maxlen) is free.
364 */
365 error = xfs_rtcheck_range(mp, tp, bno, maxlen, 1, &next, &isfree);
366 if (error) {
367 return error;
368 }
369 if (isfree) {
370 /*
371 * If it is, allocate it and return success.
372 */
373 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
374 if (error) {
375 return error;
376 }
377 *len = maxlen;
378 *rtblock = bno;
379 return 0;
380 }
381 /*
382 * If not, allocate what there is, if it's at least minlen.
383 */
384 maxlen = next - bno;
385 if (maxlen < minlen) {
386 /*
387 * Failed, return failure status.
388 */
389 *rtblock = NULLRTBLOCK;
390 return 0;
391 }
392 /*
393 * Trim off tail of extent, if prod is specified.
394 */
395 if (prod > 1 && (i = maxlen % prod)) {
396 maxlen -= i;
397 if (maxlen < minlen) {
398 /*
399 * Now we can't do it, return failure status.
400 */
401 *rtblock = NULLRTBLOCK;
402 return 0;
403 }
404 }
405 /*
406 * Allocate what we can and return it.
407 */
408 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
409 if (error) {
410 return error;
411 }
412 *len = maxlen;
413 *rtblock = bno;
414 return 0;
415}
416
417/*
418 * Allocate an extent of length minlen<=len<=maxlen, starting as near
419 * to bno as possible. If we don't get maxlen then use prod to trim
420 * the length, if given. The lengths are all in rtextents.
421 */
422STATIC int /* error */
423xfs_rtallocate_extent_near(
424 xfs_mount_t *mp, /* file system mount point */
425 xfs_trans_t *tp, /* transaction pointer */
426 xfs_rtblock_t bno, /* starting block number to allocate */
427 xfs_extlen_t minlen, /* minimum length to allocate */
428 xfs_extlen_t maxlen, /* maximum length to allocate */
429 xfs_extlen_t *len, /* out: actual length allocated */
430 xfs_buf_t **rbpp, /* in/out: summary block buffer */
431 xfs_fsblock_t *rsb, /* in/out: summary block number */
432 xfs_extlen_t prod, /* extent product factor */
433 xfs_rtblock_t *rtblock) /* out: start block allocated */
434{
435 int any; /* any useful extents from summary */
436 xfs_rtblock_t bbno; /* bitmap block number */
437 int error; /* error value */
438 int i; /* bitmap block offset (loop control) */
439 int j; /* secondary loop control */
440 int log2len; /* log2 of minlen */
441 xfs_rtblock_t n; /* next block to try */
442 xfs_rtblock_t r; /* result block */
443
444 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
445 /*
446 * If the block number given is off the end, silently set it to
447 * the last block.
448 */
449 if (bno >= mp->m_sb.sb_rextents)
450 bno = mp->m_sb.sb_rextents - 1;
451 /*
452 * Try the exact allocation first.
453 */
454 error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, len,
455 rbpp, rsb, prod, &r);
456 if (error) {
457 return error;
458 }
459 /*
460 * If the exact allocation worked, return that.
461 */
462 if (r != NULLRTBLOCK) {
463 *rtblock = r;
464 return 0;
465 }
466 bbno = XFS_BITTOBLOCK(mp, bno);
467 i = 0;
468 ASSERT(minlen != 0);
469 log2len = xfs_highbit32(minlen);
470 /*
471 * Loop over all bitmap blocks (bbno + i is current block).
472 */
473 for (;;) {
474 /*
475 * Get summary information of extents of all useful levels
476 * starting in this bitmap block.
477 */
478 error = xfs_rtany_summary(mp, tp, log2len, mp->m_rsumlevels - 1,
479 bbno + i, rbpp, rsb, &any);
480 if (error) {
481 return error;
482 }
483 /*
484 * If there are any useful extents starting here, try
485 * allocating one.
486 */
487 if (any) {
488 /*
489 * On the positive side of the starting location.
490 */
491 if (i >= 0) {
492 /*
493 * Try to allocate an extent starting in
494 * this block.
495 */
496 error = xfs_rtallocate_extent_block(mp, tp,
497 bbno + i, minlen, maxlen, len, &n, rbpp,
498 rsb, prod, &r);
499 if (error) {
500 return error;
501 }
502 /*
503 * If it worked, return it.
504 */
505 if (r != NULLRTBLOCK) {
506 *rtblock = r;
507 return 0;
508 }
509 }
510 /*
511 * On the negative side of the starting location.
512 */
513 else { /* i < 0 */
514 /*
515 * Loop backwards through the bitmap blocks from
516 * the starting point-1 up to where we are now.
517 * There should be an extent which ends in this
518 * bitmap block and is long enough.
519 */
520 for (j = -1; j > i; j--) {
521 /*
522 * Grab the summary information for
523 * this bitmap block.
524 */
525 error = xfs_rtany_summary(mp, tp,
526 log2len, mp->m_rsumlevels - 1,
527 bbno + j, rbpp, rsb, &any);
528 if (error) {
529 return error;
530 }
531 /*
532 * If there's no extent given in the
533 * summary that means the extent we
534 * found must carry over from an
535 * earlier block. If there is an
536 * extent given, we've already tried
537 * that allocation, don't do it again.
538 */
539 if (any)
540 continue;
541 error = xfs_rtallocate_extent_block(mp,
542 tp, bbno + j, minlen, maxlen,
543 len, &n, rbpp, rsb, prod, &r);
544 if (error) {
545 return error;
546 }
547 /*
548 * If it works, return the extent.
549 */
550 if (r != NULLRTBLOCK) {
551 *rtblock = r;
552 return 0;
553 }
554 }
555 /*
556 * There weren't intervening bitmap blocks
557 * with a long enough extent, or the
558 * allocation didn't work for some reason
559 * (i.e. it's a little * too short).
560 * Try to allocate from the summary block
561 * that we found.
562 */
563 error = xfs_rtallocate_extent_block(mp, tp,
564 bbno + i, minlen, maxlen, len, &n, rbpp,
565 rsb, prod, &r);
566 if (error) {
567 return error;
568 }
569 /*
570 * If it works, return the extent.
571 */
572 if (r != NULLRTBLOCK) {
573 *rtblock = r;
574 return 0;
575 }
576 }
577 }
578 /*
579 * Loop control. If we were on the positive side, and there's
580 * still more blocks on the negative side, go there.
581 */
582 if (i > 0 && (int)bbno - i >= 0)
583 i = -i;
584 /*
585 * If positive, and no more negative, but there are more
586 * positive, go there.
587 */
588 else if (i > 0 && (int)bbno + i < mp->m_sb.sb_rbmblocks - 1)
589 i++;
590 /*
591 * If negative or 0 (just started), and there are positive
592 * blocks to go, go there. The 0 case moves to block 1.
593 */
594 else if (i <= 0 && (int)bbno - i < mp->m_sb.sb_rbmblocks - 1)
595 i = 1 - i;
596 /*
597 * If negative or 0 and there are more negative blocks,
598 * go there.
599 */
600 else if (i <= 0 && (int)bbno + i > 0)
601 i--;
602 /*
603 * Must be done. Return failure.
604 */
605 else
606 break;
607 }
608 *rtblock = NULLRTBLOCK;
609 return 0;
610}
611
612/*
613 * Allocate an extent of length minlen<=len<=maxlen, with no position
614 * specified. If we don't get maxlen then use prod to trim
615 * the length, if given. The lengths are all in rtextents.
616 */
617STATIC int /* error */
618xfs_rtallocate_extent_size(
619 xfs_mount_t *mp, /* file system mount point */
620 xfs_trans_t *tp, /* transaction pointer */
621 xfs_extlen_t minlen, /* minimum length to allocate */
622 xfs_extlen_t maxlen, /* maximum length to allocate */
623 xfs_extlen_t *len, /* out: actual length allocated */
624 xfs_buf_t **rbpp, /* in/out: summary block buffer */
625 xfs_fsblock_t *rsb, /* in/out: summary block number */
626 xfs_extlen_t prod, /* extent product factor */
627 xfs_rtblock_t *rtblock) /* out: start block allocated */
628{
629 int error; /* error value */
630 int i; /* bitmap block number */
631 int l; /* level number (loop control) */
632 xfs_rtblock_t n; /* next block to be tried */
633 xfs_rtblock_t r; /* result block number */
634 xfs_suminfo_t sum; /* summary information for extents */
635
636 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
637 ASSERT(maxlen != 0);
638
639 /*
640 * Loop over all the levels starting with maxlen.
641 * At each level, look at all the bitmap blocks, to see if there
642 * are extents starting there that are long enough (>= maxlen).
643 * Note, only on the initial level can the allocation fail if
644 * the summary says there's an extent.
645 */
646 for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) {
647 /*
648 * Loop over all the bitmap blocks.
649 */
650 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
651 /*
652 * Get the summary for this level/block.
653 */
654 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
655 &sum);
656 if (error) {
657 return error;
658 }
659 /*
660 * Nothing there, on to the next block.
661 */
662 if (!sum)
663 continue;
664 /*
665 * Try allocating the extent.
666 */
667 error = xfs_rtallocate_extent_block(mp, tp, i, maxlen,
668 maxlen, len, &n, rbpp, rsb, prod, &r);
669 if (error) {
670 return error;
671 }
672 /*
673 * If it worked, return that.
674 */
675 if (r != NULLRTBLOCK) {
676 *rtblock = r;
677 return 0;
678 }
679 /*
680 * If the "next block to try" returned from the
681 * allocator is beyond the next bitmap block,
682 * skip to that bitmap block.
683 */
684 if (XFS_BITTOBLOCK(mp, n) > i + 1)
685 i = XFS_BITTOBLOCK(mp, n) - 1;
686 }
687 }
688 /*
689 * Didn't find any maxlen blocks. Try smaller ones, unless
690 * we're asking for a fixed size extent.
691 */
692 if (minlen > --maxlen) {
693 *rtblock = NULLRTBLOCK;
694 return 0;
695 }
696 ASSERT(minlen != 0);
697 ASSERT(maxlen != 0);
698
699 /*
700 * Loop over sizes, from maxlen down to minlen.
701 * This time, when we do the allocations, allow smaller ones
702 * to succeed.
703 */
704 for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) {
705 /*
706 * Loop over all the bitmap blocks, try an allocation
707 * starting in that block.
708 */
709 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
710 /*
711 * Get the summary information for this level/block.
712 */
713 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
714 &sum);
715 if (error) {
716 return error;
717 }
718 /*
719 * If nothing there, go on to next.
720 */
721 if (!sum)
722 continue;
723 /*
724 * Try the allocation. Make sure the specified
725 * minlen/maxlen are in the possible range for
726 * this summary level.
727 */
728 error = xfs_rtallocate_extent_block(mp, tp, i,
729 XFS_RTMAX(minlen, 1 << l),
730 XFS_RTMIN(maxlen, (1 << (l + 1)) - 1),
731 len, &n, rbpp, rsb, prod, &r);
732 if (error) {
733 return error;
734 }
735 /*
736 * If it worked, return that extent.
737 */
738 if (r != NULLRTBLOCK) {
739 *rtblock = r;
740 return 0;
741 }
742 /*
743 * If the "next block to try" returned from the
744 * allocator is beyond the next bitmap block,
745 * skip to that bitmap block.
746 */
747 if (XFS_BITTOBLOCK(mp, n) > i + 1)
748 i = XFS_BITTOBLOCK(mp, n) - 1;
749 }
750 }
751 /*
752 * Got nothing, return failure.
753 */
754 *rtblock = NULLRTBLOCK;
755 return 0;
756}
757
758/*
759 * Allocate space to the bitmap or summary file, and zero it, for growfs.
760 */
761STATIC int
762xfs_growfs_rt_alloc(
763 struct xfs_mount *mp, /* file system mount point */
764 xfs_extlen_t oblocks, /* old count of blocks */
765 xfs_extlen_t nblocks, /* new count of blocks */
766 struct xfs_inode *ip) /* inode (bitmap/summary) */
767{
768 xfs_fileoff_t bno; /* block number in file */
769 struct xfs_buf *bp; /* temporary buffer for zeroing */
770 xfs_daddr_t d; /* disk block address */
771 int error; /* error return value */
772 xfs_fsblock_t firstblock;/* first block allocated in xaction */
773 struct xfs_defer_ops dfops; /* list of freed blocks */
774 xfs_fsblock_t fsbno; /* filesystem block for bno */
775 struct xfs_bmbt_irec map; /* block map output */
776 int nmap; /* number of block maps */
777 int resblks; /* space reservation */
778 struct xfs_trans *tp;
779
780 /*
781 * Allocate space to the file, as necessary.
782 */
783 while (oblocks < nblocks) {
784 resblks = XFS_GROWFSRT_SPACE_RES(mp, nblocks - oblocks);
785 /*
786 * Reserve space & log for one extent added to the file.
787 */
788 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtalloc, resblks,
789 0, 0, &tp);
790 if (error)
791 return error;
792 /*
793 * Lock the inode.
794 */
795 xfs_ilock(ip, XFS_ILOCK_EXCL);
796 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
797
798 xfs_defer_init(&dfops, &firstblock);
799 /*
800 * Allocate blocks to the bitmap file.
801 */
802 nmap = 1;
803 error = xfs_bmapi_write(tp, ip, oblocks, nblocks - oblocks,
804 XFS_BMAPI_METADATA, &firstblock,
805 resblks, &map, &nmap, &dfops);
806 if (!error && nmap < 1)
807 error = -ENOSPC;
808 if (error)
809 goto out_bmap_cancel;
810 /*
811 * Free any blocks freed up in the transaction, then commit.
812 */
813 error = xfs_defer_finish(&tp, &dfops);
814 if (error)
815 goto out_bmap_cancel;
816 error = xfs_trans_commit(tp);
817 if (error)
818 return error;
819 /*
820 * Now we need to clear the allocated blocks.
821 * Do this one block per transaction, to keep it simple.
822 */
823 for (bno = map.br_startoff, fsbno = map.br_startblock;
824 bno < map.br_startoff + map.br_blockcount;
825 bno++, fsbno++) {
826 /*
827 * Reserve log for one block zeroing.
828 */
829 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtzero,
830 0, 0, 0, &tp);
831 if (error)
832 return error;
833 /*
834 * Lock the bitmap inode.
835 */
836 xfs_ilock(ip, XFS_ILOCK_EXCL);
837 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
838 /*
839 * Get a buffer for the block.
840 */
841 d = XFS_FSB_TO_DADDR(mp, fsbno);
842 bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, d,
843 mp->m_bsize, 0);
844 if (bp == NULL) {
845 error = -EIO;
846 goto out_trans_cancel;
847 }
848 memset(bp->b_addr, 0, mp->m_sb.sb_blocksize);
849 xfs_trans_log_buf(tp, bp, 0, mp->m_sb.sb_blocksize - 1);
850 /*
851 * Commit the transaction.
852 */
853 error = xfs_trans_commit(tp);
854 if (error)
855 return error;
856 }
857 /*
858 * Go on to the next extent, if any.
859 */
860 oblocks = map.br_startoff + map.br_blockcount;
861 }
862
863 return 0;
864
865out_bmap_cancel:
866 xfs_defer_cancel(&dfops);
867out_trans_cancel:
868 xfs_trans_cancel(tp);
869 return error;
870}
871
872/*
873 * Visible (exported) functions.
874 */
875
876/*
877 * Grow the realtime area of the filesystem.
878 */
879int
880xfs_growfs_rt(
881 xfs_mount_t *mp, /* mount point for filesystem */
882 xfs_growfs_rt_t *in) /* growfs rt input struct */
883{
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
901 sbp = &mp->m_sb;
902 /*
903 * Initial error checking.
904 */
905 if (!capable(CAP_SYS_ADMIN))
906 return -EPERM;
907 if (mp->m_rtdev_targp == NULL || mp->m_rbmip == NULL ||
908 (nrblocks = in->newblocks) <= sbp->sb_rblocks ||
909 (sbp->sb_rblocks && (in->extsize != sbp->sb_rextsize)))
910 return -EINVAL;
911 if ((error = xfs_sb_validate_fsb_count(sbp, nrblocks)))
912 return error;
913 /*
914 * Read in the last block of the device, make sure it exists.
915 */
916 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
917 XFS_FSB_TO_BB(mp, nrblocks - 1),
918 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
919 if (error)
920 return error;
921 xfs_buf_relse(bp);
922
923 /*
924 * Calculate new parameters. These are the final values to be reached.
925 */
926 nrextents = nrblocks;
927 do_div(nrextents, in->extsize);
928 nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize);
929 nrextslog = xfs_highbit32(nrextents);
930 nrsumlevels = nrextslog + 1;
931 nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks;
932 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
933 nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
934 /*
935 * New summary size can't be more than half the size of
936 * the log. This prevents us from getting a log overflow,
937 * since we'll log basically the whole summary file at once.
938 */
939 if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1))
940 return -EINVAL;
941 /*
942 * Get the old block counts for bitmap and summary inodes.
943 * These can't change since other growfs callers are locked out.
944 */
945 rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_d.di_size);
946 rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_d.di_size);
947 /*
948 * Allocate space to the bitmap and summary files, as necessary.
949 */
950 error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks, mp->m_rbmip);
951 if (error)
952 return error;
953 error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks, mp->m_rsumip);
954 if (error)
955 return error;
956 /*
957 * Allocate a new (fake) mount/sb.
958 */
959 nmp = kmem_alloc(sizeof(*nmp), KM_SLEEP);
960 /*
961 * Loop over the bitmap blocks.
962 * We will do everything one bitmap block at a time.
963 * Skip the current block if it is exactly full.
964 * This also deals with the case where there were no rtextents before.
965 */
966 for (bmbno = sbp->sb_rbmblocks -
967 ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0);
968 bmbno < nrbmblocks;
969 bmbno++) {
970 xfs_trans_t *tp;
971
972 *nmp = *mp;
973 nsbp = &nmp->m_sb;
974 /*
975 * Calculate new sb and mount fields for this round.
976 */
977 nsbp->sb_rextsize = in->extsize;
978 nsbp->sb_rbmblocks = bmbno + 1;
979 nsbp->sb_rblocks =
980 XFS_RTMIN(nrblocks,
981 nsbp->sb_rbmblocks * NBBY *
982 nsbp->sb_blocksize * nsbp->sb_rextsize);
983 nsbp->sb_rextents = nsbp->sb_rblocks;
984 do_div(nsbp->sb_rextents, nsbp->sb_rextsize);
985 ASSERT(nsbp->sb_rextents != 0);
986 nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents);
987 nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1;
988 nrsumsize =
989 (uint)sizeof(xfs_suminfo_t) * nrsumlevels *
990 nsbp->sb_rbmblocks;
991 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
992 nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
993 /*
994 * Start a transaction, get the log reservation.
995 */
996 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtfree, 0, 0, 0,
997 &tp);
998 if (error)
999 break;
1000 /*
1001 * Lock out other callers by grabbing the bitmap inode lock.
1002 */
1003 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL);
1004 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL);
1005 /*
1006 * Update the bitmap inode's size.
1007 */
1008 mp->m_rbmip->i_d.di_size =
1009 nsbp->sb_rbmblocks * nsbp->sb_blocksize;
1010 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1011 /*
1012 * Get the summary inode into the transaction.
1013 */
1014 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL);
1015 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL);
1016 /*
1017 * Update the summary inode's size.
1018 */
1019 mp->m_rsumip->i_d.di_size = nmp->m_rsumsize;
1020 xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE);
1021 /*
1022 * Copy summary data from old to new sizes.
1023 * Do this when the real size (not block-aligned) changes.
1024 */
1025 if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks ||
1026 mp->m_rsumlevels != nmp->m_rsumlevels) {
1027 error = xfs_rtcopy_summary(mp, nmp, tp);
1028 if (error)
1029 goto error_cancel;
1030 }
1031 /*
1032 * Update superblock fields.
1033 */
1034 if (nsbp->sb_rextsize != sbp->sb_rextsize)
1035 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE,
1036 nsbp->sb_rextsize - sbp->sb_rextsize);
1037 if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks)
1038 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS,
1039 nsbp->sb_rbmblocks - sbp->sb_rbmblocks);
1040 if (nsbp->sb_rblocks != sbp->sb_rblocks)
1041 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS,
1042 nsbp->sb_rblocks - sbp->sb_rblocks);
1043 if (nsbp->sb_rextents != sbp->sb_rextents)
1044 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS,
1045 nsbp->sb_rextents - sbp->sb_rextents);
1046 if (nsbp->sb_rextslog != sbp->sb_rextslog)
1047 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG,
1048 nsbp->sb_rextslog - sbp->sb_rextslog);
1049 /*
1050 * Free new extent.
1051 */
1052 bp = NULL;
1053 error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents,
1054 nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno);
1055 if (error) {
1056error_cancel:
1057 xfs_trans_cancel(tp);
1058 break;
1059 }
1060 /*
1061 * Mark more blocks free in the superblock.
1062 */
1063 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS,
1064 nsbp->sb_rextents - sbp->sb_rextents);
1065 /*
1066 * Update mp values into the real mp structure.
1067 */
1068 mp->m_rsumlevels = nrsumlevels;
1069 mp->m_rsumsize = nrsumsize;
1070
1071 error = xfs_trans_commit(tp);
1072 if (error)
1073 break;
1074 }
1075
1076 /*
1077 * Free the fake mp structure.
1078 */
1079 kmem_free(nmp);
1080
1081 return error;
1082}
1083
1084/*
1085 * Allocate an extent in the realtime subvolume, with the usual allocation
1086 * parameters. The length units are all in realtime extents, as is the
1087 * result block number.
1088 */
1089int /* error */
1090xfs_rtallocate_extent(
1091 xfs_trans_t *tp, /* transaction pointer */
1092 xfs_rtblock_t bno, /* starting block number to allocate */
1093 xfs_extlen_t minlen, /* minimum length to allocate */
1094 xfs_extlen_t maxlen, /* maximum length to allocate */
1095 xfs_extlen_t *len, /* out: actual length allocated */
1096 int wasdel, /* was a delayed allocation extent */
1097 xfs_extlen_t prod, /* extent product factor */
1098 xfs_rtblock_t *rtblock) /* out: start block allocated */
1099{
1100 xfs_mount_t *mp = tp->t_mountp;
1101 int error; /* error value */
1102 xfs_rtblock_t r; /* result allocated block */
1103 xfs_fsblock_t sb; /* summary file block number */
1104 xfs_buf_t *sumbp; /* summary file block buffer */
1105
1106 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1107 ASSERT(minlen > 0 && minlen <= maxlen);
1108
1109 /*
1110 * If prod is set then figure out what to do to minlen and maxlen.
1111 */
1112 if (prod > 1) {
1113 xfs_extlen_t i;
1114
1115 if ((i = maxlen % prod))
1116 maxlen -= i;
1117 if ((i = minlen % prod))
1118 minlen += prod - i;
1119 if (maxlen < minlen) {
1120 *rtblock = NULLRTBLOCK;
1121 return 0;
1122 }
1123 }
1124
1125retry:
1126 sumbp = NULL;
1127 if (bno == 0) {
1128 error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len,
1129 &sumbp, &sb, prod, &r);
1130 } else {
1131 error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen,
1132 len, &sumbp, &sb, prod, &r);
1133 }
1134
1135 if (error)
1136 return error;
1137
1138 /*
1139 * If it worked, update the superblock.
1140 */
1141 if (r != NULLRTBLOCK) {
1142 long slen = (long)*len;
1143
1144 ASSERT(*len >= minlen && *len <= maxlen);
1145 if (wasdel)
1146 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen);
1147 else
1148 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen);
1149 } else if (prod > 1) {
1150 prod = 1;
1151 goto retry;
1152 }
1153
1154 *rtblock = r;
1155 return 0;
1156}
1157
1158/*
1159 * Initialize realtime fields in the mount structure.
1160 */
1161int /* error */
1162xfs_rtmount_init(
1163 struct xfs_mount *mp) /* file system mount structure */
1164{
1165 struct xfs_buf *bp; /* buffer for last block of subvolume */
1166 struct xfs_sb *sbp; /* filesystem superblock copy in mount */
1167 xfs_daddr_t d; /* address of last block of subvolume */
1168 int error;
1169
1170 sbp = &mp->m_sb;
1171 if (sbp->sb_rblocks == 0)
1172 return 0;
1173 if (mp->m_rtdev_targp == NULL) {
1174 xfs_warn(mp,
1175 "Filesystem has a realtime volume, use rtdev=device option");
1176 return -ENODEV;
1177 }
1178 mp->m_rsumlevels = sbp->sb_rextslog + 1;
1179 mp->m_rsumsize =
1180 (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels *
1181 sbp->sb_rbmblocks;
1182 mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize);
1183 mp->m_rbmip = mp->m_rsumip = NULL;
1184 /*
1185 * Check that the realtime section is an ok size.
1186 */
1187 d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks);
1188 if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) {
1189 xfs_warn(mp, "realtime mount -- %llu != %llu",
1190 (unsigned long long) XFS_BB_TO_FSB(mp, d),
1191 (unsigned long long) mp->m_sb.sb_rblocks);
1192 return -EFBIG;
1193 }
1194 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
1195 d - XFS_FSB_TO_BB(mp, 1),
1196 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
1197 if (error) {
1198 xfs_warn(mp, "realtime device size check failed");
1199 return error;
1200 }
1201 xfs_buf_relse(bp);
1202 return 0;
1203}
1204
1205/*
1206 * Get the bitmap and summary inodes into the mount structure
1207 * at mount time.
1208 */
1209int /* error */
1210xfs_rtmount_inodes(
1211 xfs_mount_t *mp) /* file system mount structure */
1212{
1213 int error; /* error return value */
1214 xfs_sb_t *sbp;
1215
1216 sbp = &mp->m_sb;
1217 if (sbp->sb_rbmino == NULLFSINO)
1218 return 0;
1219 error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip);
1220 if (error)
1221 return error;
1222 ASSERT(mp->m_rbmip != NULL);
1223 ASSERT(sbp->sb_rsumino != NULLFSINO);
1224 error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip);
1225 if (error) {
1226 IRELE(mp->m_rbmip);
1227 return error;
1228 }
1229 ASSERT(mp->m_rsumip != NULL);
1230 return 0;
1231}
1232
1233void
1234xfs_rtunmount_inodes(
1235 struct xfs_mount *mp)
1236{
1237 if (mp->m_rbmip)
1238 IRELE(mp->m_rbmip);
1239 if (mp->m_rsumip)
1240 IRELE(mp->m_rsumip);
1241}
1242
1243/*
1244 * Pick an extent for allocation at the start of a new realtime file.
1245 * Use the sequence number stored in the atime field of the bitmap inode.
1246 * Translate this to a fraction of the rtextents, and return the product
1247 * of rtextents and the fraction.
1248 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
1249 */
1250int /* error */
1251xfs_rtpick_extent(
1252 xfs_mount_t *mp, /* file system mount point */
1253 xfs_trans_t *tp, /* transaction pointer */
1254 xfs_extlen_t len, /* allocation length (rtextents) */
1255 xfs_rtblock_t *pick) /* result rt extent */
1256{
1257 xfs_rtblock_t b; /* result block */
1258 int log2; /* log of sequence number */
1259 uint64_t resid; /* residual after log removed */
1260 uint64_t seq; /* sequence number of file creation */
1261 uint64_t *seqp; /* pointer to seqno in inode */
1262
1263 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1264
1265 seqp = (uint64_t *)&VFS_I(mp->m_rbmip)->i_atime;
1266 if (!(mp->m_rbmip->i_d.di_flags & XFS_DIFLAG_NEWRTBM)) {
1267 mp->m_rbmip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM;
1268 *seqp = 0;
1269 }
1270 seq = *seqp;
1271 if ((log2 = xfs_highbit64(seq)) == -1)
1272 b = 0;
1273 else {
1274 resid = seq - (1ULL << log2);
1275 b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >>
1276 (log2 + 1);
1277 if (b >= mp->m_sb.sb_rextents)
1278 b = do_mod(b, mp->m_sb.sb_rextents);
1279 if (b + len > mp->m_sb.sb_rextents)
1280 b = mp->m_sb.sb_rextents - len;
1281 }
1282 *seqp = seq + 1;
1283 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1284 *pick = b;
1285 return 0;
1286}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6#include "xfs.h"
7#include "xfs_fs.h"
8#include "xfs_shared.h"
9#include "xfs_format.h"
10#include "xfs_log_format.h"
11#include "xfs_trans_resv.h"
12#include "xfs_bit.h"
13#include "xfs_mount.h"
14#include "xfs_inode.h"
15#include "xfs_bmap.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"
21#include "xfs_sb.h"
22
23/*
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.
28 */
29static int
30xfs_rtget_summary(
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 */
38{
39 return xfs_rtmodify_summary_int(mp, tp, log, bbno, 0, rbpp, rsb, sum);
40}
41
42/*
43 * Return whether there are any free extents in the size range given
44 * by low and high, for the bitmap block bbno.
45 */
46STATIC int /* error */
47xfs_rtany_summary(
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? */
56{
57 int error; /* error value */
58 int log; /* loop counter, log2 of ext. size */
59 xfs_suminfo_t sum; /* summary data */
60
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];
64
65 /*
66 * Loop over logs of extent sizes.
67 */
68 for (log = low; log <= high; log++) {
69 /*
70 * Get one summary datum.
71 */
72 error = xfs_rtget_summary(mp, tp, log, bbno, rbpp, rsb, &sum);
73 if (error) {
74 return error;
75 }
76 /*
77 * If there are any, return success.
78 */
79 if (sum) {
80 *stat = 1;
81 goto out;
82 }
83 }
84 /*
85 * Found nothing, return failure.
86 */
87 *stat = 0;
88out:
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;
92 return 0;
93}
94
95
96/*
97 * Copy and transform the summary file, given the old and new
98 * parameters in the mount structures.
99 */
100STATIC int /* error */
101xfs_rtcopy_summary(
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 */
105{
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 */
112
113 bp = NULL;
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;
117 bbno--) {
118 error = xfs_rtget_summary(omp, tp, log, bbno, &bp,
119 &sumbno, &sum);
120 if (error)
121 return error;
122 if (sum == 0)
123 continue;
124 error = xfs_rtmodify_summary(omp, tp, log, bbno, -sum,
125 &bp, &sumbno);
126 if (error)
127 return error;
128 error = xfs_rtmodify_summary(nmp, tp, log, bbno, sum,
129 &bp, &sumbno);
130 if (error)
131 return error;
132 ASSERT(sum > 0);
133 }
134 }
135 return 0;
136}
137/*
138 * Mark an extent specified by start and len allocated.
139 * Updates all the summary information as well as the bitmap.
140 */
141STATIC int /* error */
142xfs_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 */
149{
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 */
154
155 end = start + len - 1;
156 /*
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.
160 */
161 error = xfs_rtfind_back(mp, tp, start, 0, &preblock);
162 if (error) {
163 return error;
164 }
165 /*
166 * Find the next allocated block (end of free extent).
167 */
168 error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1,
169 &postblock);
170 if (error) {
171 return error;
172 }
173 /*
174 * Decrement the summary information corresponding to the entire
175 * (old) free extent.
176 */
177 error = xfs_rtmodify_summary(mp, tp,
178 XFS_RTBLOCKLOG(postblock + 1 - preblock),
179 XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb);
180 if (error) {
181 return error;
182 }
183 /*
184 * If there are blocks not being allocated at the front of the
185 * old extent, add summary data for them to be free.
186 */
187 if (preblock < start) {
188 error = xfs_rtmodify_summary(mp, tp,
189 XFS_RTBLOCKLOG(start - preblock),
190 XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb);
191 if (error) {
192 return error;
193 }
194 }
195 /*
196 * If there are blocks not being allocated at the end of the
197 * old extent, add summary data for them to be free.
198 */
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);
203 if (error) {
204 return error;
205 }
206 }
207 /*
208 * Modify the bitmap to mark this extent allocated.
209 */
210 error = xfs_rtmodify_range(mp, tp, start, len, 0);
211 return error;
212}
213
214/*
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.
219 */
220STATIC int /* error */
221xfs_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 */
233{
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 */
241
242 /*
243 * Loop over all the extents starting in this bitmap block,
244 * looking for one that's long enough.
245 */
246 for (i = XFS_BLOCKTOBIT(mp, bbno), besti = -1, bestlen = 0,
247 end = XFS_BLOCKTOBIT(mp, bbno + 1) - 1;
248 i <= end;
249 i++) {
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;
252
253 /*
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.
256 */
257 error = xfs_rtcheck_range(mp, tp, i, maxlen, 1, &next, &stat);
258 if (error) {
259 return error;
260 }
261 if (stat) {
262 /*
263 * i for maxlen is all free, allocate and return that.
264 */
265 error = xfs_rtallocate_range(mp, tp, i, maxlen, rbpp,
266 rsb);
267 if (error) {
268 return error;
269 }
270 *len = maxlen;
271 *rtblock = i;
272 return 0;
273 }
274 /*
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.
279 */
280 if (minlen < maxlen) {
281 xfs_rtblock_t thislen; /* this extent size */
282
283 thislen = next - i;
284 if (thislen >= minlen && thislen > bestlen) {
285 besti = i;
286 bestlen = thislen;
287 }
288 }
289 /*
290 * If not done yet, find the start of the next free space.
291 */
292 if (next < end) {
293 error = xfs_rtfind_forw(mp, tp, next, end, &i);
294 if (error) {
295 return error;
296 }
297 } else
298 break;
299 }
300 /*
301 * Searched the whole thing & didn't find a maxlen free extent.
302 */
303 if (minlen < maxlen && besti != -1) {
304 xfs_extlen_t p; /* amount to trim length by */
305
306 /*
307 * If size should be a multiple of prod, make that so.
308 */
309 if (prod > 1) {
310 div_u64_rem(bestlen, prod, &p);
311 if (p)
312 bestlen -= p;
313 }
314
315 /*
316 * Allocate besti for bestlen & return that.
317 */
318 error = xfs_rtallocate_range(mp, tp, besti, bestlen, rbpp, rsb);
319 if (error) {
320 return error;
321 }
322 *len = bestlen;
323 *rtblock = besti;
324 return 0;
325 }
326 /*
327 * Allocation failed. Set *nextp to the next block to try.
328 */
329 *nextp = next;
330 *rtblock = NULLRTBLOCK;
331 return 0;
332}
333
334/*
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.
339 */
340STATIC int /* error */
341xfs_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 */
352{
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) */
357
358 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
359 /*
360 * Check if the range in question (for maxlen) is free.
361 */
362 error = xfs_rtcheck_range(mp, tp, bno, maxlen, 1, &next, &isfree);
363 if (error) {
364 return error;
365 }
366 if (isfree) {
367 /*
368 * If it is, allocate it and return success.
369 */
370 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
371 if (error) {
372 return error;
373 }
374 *len = maxlen;
375 *rtblock = bno;
376 return 0;
377 }
378 /*
379 * If not, allocate what there is, if it's at least minlen.
380 */
381 maxlen = next - bno;
382 if (maxlen < minlen) {
383 /*
384 * Failed, return failure status.
385 */
386 *rtblock = NULLRTBLOCK;
387 return 0;
388 }
389 /*
390 * Trim off tail of extent, if prod is specified.
391 */
392 if (prod > 1 && (i = maxlen % prod)) {
393 maxlen -= i;
394 if (maxlen < minlen) {
395 /*
396 * Now we can't do it, return failure status.
397 */
398 *rtblock = NULLRTBLOCK;
399 return 0;
400 }
401 }
402 /*
403 * Allocate what we can and return it.
404 */
405 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb);
406 if (error) {
407 return error;
408 }
409 *len = maxlen;
410 *rtblock = bno;
411 return 0;
412}
413
414/*
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.
418 */
419STATIC int /* error */
420xfs_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 */
431{
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 */
440
441 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
442 /*
443 * If the block number given is off the end, silently set it to
444 * the last block.
445 */
446 if (bno >= mp->m_sb.sb_rextents)
447 bno = mp->m_sb.sb_rextents - 1;
448
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;
453 return 0;
454 }
455
456 /*
457 * Try the exact allocation first.
458 */
459 error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, len,
460 rbpp, rsb, prod, &r);
461 if (error) {
462 return error;
463 }
464 /*
465 * If the exact allocation worked, return that.
466 */
467 if (r != NULLRTBLOCK) {
468 *rtblock = r;
469 return 0;
470 }
471 bbno = XFS_BITTOBLOCK(mp, bno);
472 i = 0;
473 ASSERT(minlen != 0);
474 log2len = xfs_highbit32(minlen);
475 /*
476 * Loop over all bitmap blocks (bbno + i is current block).
477 */
478 for (;;) {
479 /*
480 * Get summary information of extents of all useful levels
481 * starting in this bitmap block.
482 */
483 error = xfs_rtany_summary(mp, tp, log2len, mp->m_rsumlevels - 1,
484 bbno + i, rbpp, rsb, &any);
485 if (error) {
486 return error;
487 }
488 /*
489 * If there are any useful extents starting here, try
490 * allocating one.
491 */
492 if (any) {
493 /*
494 * On the positive side of the starting location.
495 */
496 if (i >= 0) {
497 /*
498 * Try to allocate an extent starting in
499 * this block.
500 */
501 error = xfs_rtallocate_extent_block(mp, tp,
502 bbno + i, minlen, maxlen, len, &n, rbpp,
503 rsb, prod, &r);
504 if (error) {
505 return error;
506 }
507 /*
508 * If it worked, return it.
509 */
510 if (r != NULLRTBLOCK) {
511 *rtblock = r;
512 return 0;
513 }
514 }
515 /*
516 * On the negative side of the starting location.
517 */
518 else { /* i < 0 */
519 /*
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.
524 */
525 for (j = -1; j > i; j--) {
526 /*
527 * Grab the summary information for
528 * this bitmap block.
529 */
530 error = xfs_rtany_summary(mp, tp,
531 log2len, mp->m_rsumlevels - 1,
532 bbno + j, rbpp, rsb, &any);
533 if (error) {
534 return error;
535 }
536 /*
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.
543 */
544 if (any)
545 continue;
546 error = xfs_rtallocate_extent_block(mp,
547 tp, bbno + j, minlen, maxlen,
548 len, &n, rbpp, rsb, prod, &r);
549 if (error) {
550 return error;
551 }
552 /*
553 * If it works, return the extent.
554 */
555 if (r != NULLRTBLOCK) {
556 *rtblock = r;
557 return 0;
558 }
559 }
560 /*
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
566 * that we found.
567 */
568 error = xfs_rtallocate_extent_block(mp, tp,
569 bbno + i, minlen, maxlen, len, &n, rbpp,
570 rsb, prod, &r);
571 if (error) {
572 return error;
573 }
574 /*
575 * If it works, return the extent.
576 */
577 if (r != NULLRTBLOCK) {
578 *rtblock = r;
579 return 0;
580 }
581 }
582 }
583 /*
584 * Loop control. If we were on the positive side, and there's
585 * still more blocks on the negative side, go there.
586 */
587 if (i > 0 && (int)bbno - i >= 0)
588 i = -i;
589 /*
590 * If positive, and no more negative, but there are more
591 * positive, go there.
592 */
593 else if (i > 0 && (int)bbno + i < mp->m_sb.sb_rbmblocks - 1)
594 i++;
595 /*
596 * If negative or 0 (just started), and there are positive
597 * blocks to go, go there. The 0 case moves to block 1.
598 */
599 else if (i <= 0 && (int)bbno - i < mp->m_sb.sb_rbmblocks - 1)
600 i = 1 - i;
601 /*
602 * If negative or 0 and there are more negative blocks,
603 * go there.
604 */
605 else if (i <= 0 && (int)bbno + i > 0)
606 i--;
607 /*
608 * Must be done. Return failure.
609 */
610 else
611 break;
612 }
613 *rtblock = NULLRTBLOCK;
614 return 0;
615}
616
617/*
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.
621 */
622STATIC int /* error */
623xfs_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 */
633{
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 */
640
641 ASSERT(minlen % prod == 0 && maxlen % prod == 0);
642 ASSERT(maxlen != 0);
643
644 /*
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.
650 */
651 for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) {
652 /*
653 * Loop over all the bitmap blocks.
654 */
655 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
656 /*
657 * Get the summary for this level/block.
658 */
659 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
660 &sum);
661 if (error) {
662 return error;
663 }
664 /*
665 * Nothing there, on to the next block.
666 */
667 if (!sum)
668 continue;
669 /*
670 * Try allocating the extent.
671 */
672 error = xfs_rtallocate_extent_block(mp, tp, i, maxlen,
673 maxlen, len, &n, rbpp, rsb, prod, &r);
674 if (error) {
675 return error;
676 }
677 /*
678 * If it worked, return that.
679 */
680 if (r != NULLRTBLOCK) {
681 *rtblock = r;
682 return 0;
683 }
684 /*
685 * If the "next block to try" returned from the
686 * allocator is beyond the next bitmap block,
687 * skip to that bitmap block.
688 */
689 if (XFS_BITTOBLOCK(mp, n) > i + 1)
690 i = XFS_BITTOBLOCK(mp, n) - 1;
691 }
692 }
693 /*
694 * Didn't find any maxlen blocks. Try smaller ones, unless
695 * we're asking for a fixed size extent.
696 */
697 if (minlen > --maxlen) {
698 *rtblock = NULLRTBLOCK;
699 return 0;
700 }
701 ASSERT(minlen != 0);
702 ASSERT(maxlen != 0);
703
704 /*
705 * Loop over sizes, from maxlen down to minlen.
706 * This time, when we do the allocations, allow smaller ones
707 * to succeed.
708 */
709 for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) {
710 /*
711 * Loop over all the bitmap blocks, try an allocation
712 * starting in that block.
713 */
714 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) {
715 /*
716 * Get the summary information for this level/block.
717 */
718 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb,
719 &sum);
720 if (error) {
721 return error;
722 }
723 /*
724 * If nothing there, go on to next.
725 */
726 if (!sum)
727 continue;
728 /*
729 * Try the allocation. Make sure the specified
730 * minlen/maxlen are in the possible range for
731 * this summary level.
732 */
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);
737 if (error) {
738 return error;
739 }
740 /*
741 * If it worked, return that extent.
742 */
743 if (r != NULLRTBLOCK) {
744 *rtblock = r;
745 return 0;
746 }
747 /*
748 * If the "next block to try" returned from the
749 * allocator is beyond the next bitmap block,
750 * skip to that bitmap block.
751 */
752 if (XFS_BITTOBLOCK(mp, n) > i + 1)
753 i = XFS_BITTOBLOCK(mp, n) - 1;
754 }
755 }
756 /*
757 * Got nothing, return failure.
758 */
759 *rtblock = NULLRTBLOCK;
760 return 0;
761}
762
763/*
764 * Allocate space to the bitmap or summary file, and zero it, for growfs.
765 */
766STATIC int
767xfs_growfs_rt_alloc(
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) */
772{
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;
783
784 if (ip == mp->m_rsumip)
785 buf_type = XFS_BLFT_RTSUMMARY_BUF;
786 else
787 buf_type = XFS_BLFT_RTBITMAP_BUF;
788
789 /*
790 * Allocate space to the file, as necessary.
791 */
792 while (oblocks < nblocks) {
793 resblks = XFS_GROWFSRT_SPACE_RES(mp, nblocks - oblocks);
794 /*
795 * Reserve space & log for one extent added to the file.
796 */
797 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtalloc, resblks,
798 0, 0, &tp);
799 if (error)
800 return error;
801 /*
802 * Lock the inode.
803 */
804 xfs_ilock(ip, XFS_ILOCK_EXCL);
805 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
806
807 error = xfs_iext_count_may_overflow(ip, XFS_DATA_FORK,
808 XFS_IEXT_ADD_NOSPLIT_CNT);
809 if (error)
810 goto out_trans_cancel;
811
812 /*
813 * Allocate blocks to the bitmap file.
814 */
815 nmap = 1;
816 error = xfs_bmapi_write(tp, ip, oblocks, nblocks - oblocks,
817 XFS_BMAPI_METADATA, 0, &map, &nmap);
818 if (!error && nmap < 1)
819 error = -ENOSPC;
820 if (error)
821 goto out_trans_cancel;
822 /*
823 * Free any blocks freed up in the transaction, then commit.
824 */
825 error = xfs_trans_commit(tp);
826 if (error)
827 return error;
828 /*
829 * Now we need to clear the allocated blocks.
830 * Do this one block per transaction, to keep it simple.
831 */
832 for (bno = map.br_startoff, fsbno = map.br_startblock;
833 bno < map.br_startoff + map.br_blockcount;
834 bno++, fsbno++) {
835 /*
836 * Reserve log for one block zeroing.
837 */
838 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtzero,
839 0, 0, 0, &tp);
840 if (error)
841 return error;
842 /*
843 * Lock the bitmap inode.
844 */
845 xfs_ilock(ip, XFS_ILOCK_EXCL);
846 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
847 /*
848 * Get a buffer for the block.
849 */
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);
853 if (error)
854 goto out_trans_cancel;
855
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);
860 /*
861 * Commit the transaction.
862 */
863 error = xfs_trans_commit(tp);
864 if (error)
865 return error;
866 }
867 /*
868 * Go on to the next extent, if any.
869 */
870 oblocks = map.br_startoff + map.br_blockcount;
871 }
872
873 return 0;
874
875out_trans_cancel:
876 xfs_trans_cancel(tp);
877 return error;
878}
879
880static void
881xfs_alloc_rsum_cache(
882 xfs_mount_t *mp, /* file system mount structure */
883 xfs_extlen_t rbmblocks) /* number of rt bitmap blocks */
884{
885 /*
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.
889 */
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");
893}
894
895/*
896 * Visible (exported) functions.
897 */
898
899/*
900 * Grow the realtime area of the filesystem.
901 */
902int
903xfs_growfs_rt(
904 xfs_mount_t *mp, /* mount point for filesystem */
905 xfs_growfs_rt_t *in) /* growfs rt input struct */
906{
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 */
924
925 sbp = &mp->m_sb;
926
927 if (!capable(CAP_SYS_ADMIN))
928 return -EPERM;
929
930 /* Needs to have been mounted with an rt device. */
931 if (!XFS_IS_REALTIME_MOUNT(mp))
932 return -EINVAL;
933 /*
934 * Mount should fail if the rt bitmap/summary files don't load, but
935 * we'll check anyway.
936 */
937 if (!mp->m_rbmip || !mp->m_rsumip)
938 return -EINVAL;
939
940 /* Shrink not supported. */
941 if (in->newblocks <= sbp->sb_rblocks)
942 return -EINVAL;
943
944 /* Can only change rt extent size when adding rt volume. */
945 if (sbp->sb_rblocks > 0 && in->extsize != sbp->sb_rextsize)
946 return -EINVAL;
947
948 /* Range check the extent size. */
949 if (XFS_FSB_TO_B(mp, in->extsize) > XFS_MAX_RTEXTSIZE ||
950 XFS_FSB_TO_B(mp, in->extsize) < XFS_MIN_RTEXTSIZE)
951 return -EINVAL;
952
953 /* Unsupported realtime features. */
954 if (xfs_sb_version_hasrmapbt(&mp->m_sb) ||
955 xfs_sb_version_hasreflink(&mp->m_sb))
956 return -EOPNOTSUPP;
957
958 nrblocks = in->newblocks;
959 error = xfs_sb_validate_fsb_count(sbp, nrblocks);
960 if (error)
961 return error;
962 /*
963 * Read in the last block of the device, make sure it exists.
964 */
965 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
966 XFS_FSB_TO_BB(mp, nrblocks - 1),
967 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
968 if (error)
969 return error;
970 xfs_buf_relse(bp);
971
972 /*
973 * Calculate new parameters. These are the final values to be reached.
974 */
975 nrextents = nrblocks;
976 do_div(nrextents, in->extsize);
977 nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize);
978 nrextslog = xfs_highbit32(nrextents);
979 nrsumlevels = nrextslog + 1;
980 nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks;
981 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
982 nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
983 /*
984 * New summary size can't be more than half the size of
985 * the log. This prevents us from getting a log overflow,
986 * since we'll log basically the whole summary file at once.
987 */
988 if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1))
989 return -EINVAL;
990 /*
991 * Get the old block counts for bitmap and summary inodes.
992 * These can't change since other growfs callers are locked out.
993 */
994 rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_disk_size);
995 rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_disk_size);
996 /*
997 * Allocate space to the bitmap and summary files, as necessary.
998 */
999 error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks, mp->m_rbmip);
1000 if (error)
1001 return error;
1002 error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks, mp->m_rsumip);
1003 if (error)
1004 return error;
1005
1006 rsum_cache = mp->m_rsum_cache;
1007 if (nrbmblocks != sbp->sb_rbmblocks)
1008 xfs_alloc_rsum_cache(mp, nrbmblocks);
1009
1010 /*
1011 * Allocate a new (fake) mount/sb.
1012 */
1013 nmp = kmem_alloc(sizeof(*nmp), 0);
1014 /*
1015 * Loop over the bitmap blocks.
1016 * We will do everything one bitmap block at a time.
1017 * Skip the current block if it is exactly full.
1018 * This also deals with the case where there were no rtextents before.
1019 */
1020 for (bmbno = sbp->sb_rbmblocks -
1021 ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0);
1022 bmbno < nrbmblocks;
1023 bmbno++) {
1024 struct xfs_trans *tp;
1025 xfs_rfsblock_t nrblocks_step;
1026
1027 *nmp = *mp;
1028 nsbp = &nmp->m_sb;
1029 /*
1030 * Calculate new sb and mount fields for this round.
1031 */
1032 nsbp->sb_rextsize = in->extsize;
1033 nsbp->sb_rbmblocks = bmbno + 1;
1034 nrblocks_step = (bmbno + 1) * NBBY * nsbp->sb_blocksize *
1035 nsbp->sb_rextsize;
1036 nsbp->sb_rblocks = min(nrblocks, nrblocks_step);
1037 nsbp->sb_rextents = nsbp->sb_rblocks;
1038 do_div(nsbp->sb_rextents, nsbp->sb_rextsize);
1039 ASSERT(nsbp->sb_rextents != 0);
1040 nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents);
1041 nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1;
1042 nrsumsize =
1043 (uint)sizeof(xfs_suminfo_t) * nrsumlevels *
1044 nsbp->sb_rbmblocks;
1045 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
1046 nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
1047 /*
1048 * Start a transaction, get the log reservation.
1049 */
1050 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtfree, 0, 0, 0,
1051 &tp);
1052 if (error)
1053 break;
1054 /*
1055 * Lock out other callers by grabbing the bitmap inode lock.
1056 */
1057 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL | XFS_ILOCK_RTBITMAP);
1058 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL);
1059 /*
1060 * Update the bitmap inode's size ondisk and incore. We need
1061 * to update the incore size so that inode inactivation won't
1062 * punch what it thinks are "posteof" blocks.
1063 */
1064 mp->m_rbmip->i_disk_size =
1065 nsbp->sb_rbmblocks * nsbp->sb_blocksize;
1066 i_size_write(VFS_I(mp->m_rbmip), mp->m_rbmip->i_disk_size);
1067 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1068 /*
1069 * Get the summary inode into the transaction.
1070 */
1071 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL | XFS_ILOCK_RTSUM);
1072 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL);
1073 /*
1074 * Update the summary inode's size. We need to update the
1075 * incore size so that inode inactivation won't punch what it
1076 * thinks are "posteof" blocks.
1077 */
1078 mp->m_rsumip->i_disk_size = nmp->m_rsumsize;
1079 i_size_write(VFS_I(mp->m_rsumip), mp->m_rsumip->i_disk_size);
1080 xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE);
1081 /*
1082 * Copy summary data from old to new sizes.
1083 * Do this when the real size (not block-aligned) changes.
1084 */
1085 if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks ||
1086 mp->m_rsumlevels != nmp->m_rsumlevels) {
1087 error = xfs_rtcopy_summary(mp, nmp, tp);
1088 if (error)
1089 goto error_cancel;
1090 }
1091 /*
1092 * Update superblock fields.
1093 */
1094 if (nsbp->sb_rextsize != sbp->sb_rextsize)
1095 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE,
1096 nsbp->sb_rextsize - sbp->sb_rextsize);
1097 if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks)
1098 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS,
1099 nsbp->sb_rbmblocks - sbp->sb_rbmblocks);
1100 if (nsbp->sb_rblocks != sbp->sb_rblocks)
1101 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS,
1102 nsbp->sb_rblocks - sbp->sb_rblocks);
1103 if (nsbp->sb_rextents != sbp->sb_rextents)
1104 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS,
1105 nsbp->sb_rextents - sbp->sb_rextents);
1106 if (nsbp->sb_rextslog != sbp->sb_rextslog)
1107 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG,
1108 nsbp->sb_rextslog - sbp->sb_rextslog);
1109 /*
1110 * Free new extent.
1111 */
1112 bp = NULL;
1113 error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents,
1114 nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno);
1115 if (error) {
1116error_cancel:
1117 xfs_trans_cancel(tp);
1118 break;
1119 }
1120 /*
1121 * Mark more blocks free in the superblock.
1122 */
1123 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS,
1124 nsbp->sb_rextents - sbp->sb_rextents);
1125 /*
1126 * Update mp values into the real mp structure.
1127 */
1128 mp->m_rsumlevels = nrsumlevels;
1129 mp->m_rsumsize = nrsumsize;
1130
1131 error = xfs_trans_commit(tp);
1132 if (error)
1133 break;
1134 }
1135 if (error)
1136 goto out_free;
1137
1138 /* Update secondary superblocks now the physical grow has completed */
1139 error = xfs_update_secondary_sbs(mp);
1140
1141out_free:
1142 /*
1143 * Free the fake mp structure.
1144 */
1145 kmem_free(nmp);
1146
1147 /*
1148 * If we had to allocate a new rsum_cache, we either need to free the
1149 * old one (if we succeeded) or free the new one and restore the old one
1150 * (if there was an error).
1151 */
1152 if (rsum_cache != mp->m_rsum_cache) {
1153 if (error) {
1154 kmem_free(mp->m_rsum_cache);
1155 mp->m_rsum_cache = rsum_cache;
1156 } else {
1157 kmem_free(rsum_cache);
1158 }
1159 }
1160
1161 return error;
1162}
1163
1164/*
1165 * Allocate an extent in the realtime subvolume, with the usual allocation
1166 * parameters. The length units are all in realtime extents, as is the
1167 * result block number.
1168 */
1169int /* error */
1170xfs_rtallocate_extent(
1171 xfs_trans_t *tp, /* transaction pointer */
1172 xfs_rtblock_t bno, /* starting block number to allocate */
1173 xfs_extlen_t minlen, /* minimum length to allocate */
1174 xfs_extlen_t maxlen, /* maximum length to allocate */
1175 xfs_extlen_t *len, /* out: actual length allocated */
1176 int wasdel, /* was a delayed allocation extent */
1177 xfs_extlen_t prod, /* extent product factor */
1178 xfs_rtblock_t *rtblock) /* out: start block allocated */
1179{
1180 xfs_mount_t *mp = tp->t_mountp;
1181 int error; /* error value */
1182 xfs_rtblock_t r; /* result allocated block */
1183 xfs_fsblock_t sb; /* summary file block number */
1184 struct xfs_buf *sumbp; /* summary file block buffer */
1185
1186 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1187 ASSERT(minlen > 0 && minlen <= maxlen);
1188
1189 /*
1190 * If prod is set then figure out what to do to minlen and maxlen.
1191 */
1192 if (prod > 1) {
1193 xfs_extlen_t i;
1194
1195 if ((i = maxlen % prod))
1196 maxlen -= i;
1197 if ((i = minlen % prod))
1198 minlen += prod - i;
1199 if (maxlen < minlen) {
1200 *rtblock = NULLRTBLOCK;
1201 return 0;
1202 }
1203 }
1204
1205retry:
1206 sumbp = NULL;
1207 if (bno == 0) {
1208 error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len,
1209 &sumbp, &sb, prod, &r);
1210 } else {
1211 error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen,
1212 len, &sumbp, &sb, prod, &r);
1213 }
1214
1215 if (error)
1216 return error;
1217
1218 /*
1219 * If it worked, update the superblock.
1220 */
1221 if (r != NULLRTBLOCK) {
1222 long slen = (long)*len;
1223
1224 ASSERT(*len >= minlen && *len <= maxlen);
1225 if (wasdel)
1226 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen);
1227 else
1228 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen);
1229 } else if (prod > 1) {
1230 prod = 1;
1231 goto retry;
1232 }
1233
1234 *rtblock = r;
1235 return 0;
1236}
1237
1238/*
1239 * Initialize realtime fields in the mount structure.
1240 */
1241int /* error */
1242xfs_rtmount_init(
1243 struct xfs_mount *mp) /* file system mount structure */
1244{
1245 struct xfs_buf *bp; /* buffer for last block of subvolume */
1246 struct xfs_sb *sbp; /* filesystem superblock copy in mount */
1247 xfs_daddr_t d; /* address of last block of subvolume */
1248 int error;
1249
1250 sbp = &mp->m_sb;
1251 if (sbp->sb_rblocks == 0)
1252 return 0;
1253 if (mp->m_rtdev_targp == NULL) {
1254 xfs_warn(mp,
1255 "Filesystem has a realtime volume, use rtdev=device option");
1256 return -ENODEV;
1257 }
1258 mp->m_rsumlevels = sbp->sb_rextslog + 1;
1259 mp->m_rsumsize =
1260 (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels *
1261 sbp->sb_rbmblocks;
1262 mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize);
1263 mp->m_rbmip = mp->m_rsumip = NULL;
1264 /*
1265 * Check that the realtime section is an ok size.
1266 */
1267 d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks);
1268 if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) {
1269 xfs_warn(mp, "realtime mount -- %llu != %llu",
1270 (unsigned long long) XFS_BB_TO_FSB(mp, d),
1271 (unsigned long long) mp->m_sb.sb_rblocks);
1272 return -EFBIG;
1273 }
1274 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
1275 d - XFS_FSB_TO_BB(mp, 1),
1276 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
1277 if (error) {
1278 xfs_warn(mp, "realtime device size check failed");
1279 return error;
1280 }
1281 xfs_buf_relse(bp);
1282 return 0;
1283}
1284
1285/*
1286 * Get the bitmap and summary inodes and the summary cache into the mount
1287 * structure at mount time.
1288 */
1289int /* error */
1290xfs_rtmount_inodes(
1291 xfs_mount_t *mp) /* file system mount structure */
1292{
1293 int error; /* error return value */
1294 xfs_sb_t *sbp;
1295
1296 sbp = &mp->m_sb;
1297 error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip);
1298 if (error)
1299 return error;
1300 ASSERT(mp->m_rbmip != NULL);
1301
1302 error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip);
1303 if (error) {
1304 xfs_irele(mp->m_rbmip);
1305 return error;
1306 }
1307 ASSERT(mp->m_rsumip != NULL);
1308 xfs_alloc_rsum_cache(mp, sbp->sb_rbmblocks);
1309 return 0;
1310}
1311
1312void
1313xfs_rtunmount_inodes(
1314 struct xfs_mount *mp)
1315{
1316 kmem_free(mp->m_rsum_cache);
1317 if (mp->m_rbmip)
1318 xfs_irele(mp->m_rbmip);
1319 if (mp->m_rsumip)
1320 xfs_irele(mp->m_rsumip);
1321}
1322
1323/*
1324 * Pick an extent for allocation at the start of a new realtime file.
1325 * Use the sequence number stored in the atime field of the bitmap inode.
1326 * Translate this to a fraction of the rtextents, and return the product
1327 * of rtextents and the fraction.
1328 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
1329 */
1330int /* error */
1331xfs_rtpick_extent(
1332 xfs_mount_t *mp, /* file system mount point */
1333 xfs_trans_t *tp, /* transaction pointer */
1334 xfs_extlen_t len, /* allocation length (rtextents) */
1335 xfs_rtblock_t *pick) /* result rt extent */
1336{
1337 xfs_rtblock_t b; /* result block */
1338 int log2; /* log of sequence number */
1339 uint64_t resid; /* residual after log removed */
1340 uint64_t seq; /* sequence number of file creation */
1341 uint64_t *seqp; /* pointer to seqno in inode */
1342
1343 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1344
1345 seqp = (uint64_t *)&VFS_I(mp->m_rbmip)->i_atime;
1346 if (!(mp->m_rbmip->i_diflags & XFS_DIFLAG_NEWRTBM)) {
1347 mp->m_rbmip->i_diflags |= XFS_DIFLAG_NEWRTBM;
1348 *seqp = 0;
1349 }
1350 seq = *seqp;
1351 if ((log2 = xfs_highbit64(seq)) == -1)
1352 b = 0;
1353 else {
1354 resid = seq - (1ULL << log2);
1355 b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >>
1356 (log2 + 1);
1357 if (b >= mp->m_sb.sb_rextents)
1358 div64_u64_rem(b, mp->m_sb.sb_rextents, &b);
1359 if (b + len > mp->m_sb.sb_rextents)
1360 b = mp->m_sb.sb_rextents - len;
1361 }
1362 *seqp = seq + 1;
1363 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1364 *pick = b;
1365 return 0;
1366}