?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
WIP FPC-III support
[linux/fpc-iii.git] / fs / xfs / xfs_rtalloc.c
blobb4999fb01ff7aa8d3eaefd4f2539ab6cd5058a2b
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 */
29 static int
30 xfs_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 */
46 STATIC int /* error */
47 xfs_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;
88 out:
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 */
100 STATIC int /* error */
101 xfs_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 */
141 STATIC int /* error */
142 xfs_rtallocate_range(
143 xfs_mount_t *mp, /* file system mount point */
144 xfs_trans_t *tp, /* transaction pointer */
145 xfs_rtblock_t start, /* start block to allocate */
146 xfs_extlen_t len, /* length to allocate */
147 struct xfs_buf **rbpp, /* in/out: summary block buffer */
148 xfs_fsblock_t *rsb) /* in/out: summary block number */
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 */
220 STATIC int /* error */
221 xfs_rtallocate_extent_block(
222 xfs_mount_t *mp, /* file system mount point */
223 xfs_trans_t *tp, /* transaction pointer */
224 xfs_rtblock_t bbno, /* bitmap block number */
225 xfs_extlen_t minlen, /* minimum length to allocate */
226 xfs_extlen_t maxlen, /* maximum length to allocate */
227 xfs_extlen_t *len, /* out: actual length allocated */
228 xfs_rtblock_t *nextp, /* out: next block to try */
229 struct xfs_buf **rbpp, /* in/out: summary block buffer */
230 xfs_fsblock_t *rsb, /* in/out: summary block number */
231 xfs_extlen_t prod, /* extent product factor */
232 xfs_rtblock_t *rtblock) /* out: start block allocated */
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 */
340 STATIC int /* error */
341 xfs_rtallocate_extent_exact(
342 xfs_mount_t *mp, /* file system mount point */
343 xfs_trans_t *tp, /* transaction pointer */
344 xfs_rtblock_t bno, /* starting block number to allocate */
345 xfs_extlen_t minlen, /* minimum length to allocate */
346 xfs_extlen_t maxlen, /* maximum length to allocate */
347 xfs_extlen_t *len, /* out: actual length allocated */
348 struct xfs_buf **rbpp, /* in/out: summary block buffer */
349 xfs_fsblock_t *rsb, /* in/out: summary block number */
350 xfs_extlen_t prod, /* extent product factor */
351 xfs_rtblock_t *rtblock) /* out: start block allocated */
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 */
419 STATIC int /* error */
420 xfs_rtallocate_extent_near(
421 xfs_mount_t *mp, /* file system mount point */
422 xfs_trans_t *tp, /* transaction pointer */
423 xfs_rtblock_t bno, /* starting block number to allocate */
424 xfs_extlen_t minlen, /* minimum length to allocate */
425 xfs_extlen_t maxlen, /* maximum length to allocate */
426 xfs_extlen_t *len, /* out: actual length allocated */
427 struct xfs_buf **rbpp, /* in/out: summary block buffer */
428 xfs_fsblock_t *rsb, /* in/out: summary block number */
429 xfs_extlen_t prod, /* extent product factor */
430 xfs_rtblock_t *rtblock) /* out: start block allocated */
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 */
622 STATIC int /* error */
623 xfs_rtallocate_extent_size(
624 xfs_mount_t *mp, /* file system mount point */
625 xfs_trans_t *tp, /* transaction pointer */
626 xfs_extlen_t minlen, /* minimum length to allocate */
627 xfs_extlen_t maxlen, /* maximum length to allocate */
628 xfs_extlen_t *len, /* out: actual length allocated */
629 struct xfs_buf **rbpp, /* in/out: summary block buffer */
630 xfs_fsblock_t *rsb, /* in/out: summary block number */
631 xfs_extlen_t prod, /* extent product factor */
632 xfs_rtblock_t *rtblock) /* out: start block allocated */
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 */
766 STATIC int
767 xfs_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 /*
808 * Allocate blocks to the bitmap file.
809 */
810 nmap = 1;
811 error = xfs_bmapi_write(tp, ip, oblocks, nblocks - oblocks,
812 XFS_BMAPI_METADATA, 0, &map, &nmap);
813 if (!error && nmap < 1)
814 error = -ENOSPC;
815 if (error)
816 goto out_trans_cancel;
817 /*
818 * Free any blocks freed up in the transaction, then commit.
819 */
820 error = xfs_trans_commit(tp);
821 if (error)
822 return error;
823 /*
824 * Now we need to clear the allocated blocks.
825 * Do this one block per transaction, to keep it simple.
826 */
827 for (bno = map.br_startoff, fsbno = map.br_startblock;
828 bno < map.br_startoff + map.br_blockcount;
829 bno++, fsbno++) {
830 /*
831 * Reserve log for one block zeroing.
832 */
833 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtzero,
834 0, 0, 0, &tp);
835 if (error)
836 return error;
837 /*
838 * Lock the bitmap inode.
839 */
840 xfs_ilock(ip, XFS_ILOCK_EXCL);
841 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
842 /*
843 * Get a buffer for the block.
844 */
845 d = XFS_FSB_TO_DADDR(mp, fsbno);
846 error = xfs_trans_get_buf(tp, mp->m_ddev_targp, d,
847 mp->m_bsize, 0, &bp);
848 if (error)
849 goto out_trans_cancel;
850
851 xfs_trans_buf_set_type(tp, bp, buf_type);
852 bp->b_ops = &xfs_rtbuf_ops;
853 memset(bp->b_addr, 0, mp->m_sb.sb_blocksize);
854 xfs_trans_log_buf(tp, bp, 0, mp->m_sb.sb_blocksize - 1);
855 /*
856 * Commit the transaction.
857 */
858 error = xfs_trans_commit(tp);
859 if (error)
860 return error;
861 }
862 /*
863 * Go on to the next extent, if any.
864 */
865 oblocks = map.br_startoff + map.br_blockcount;
866 }
867
868 return 0;
869
870 out_trans_cancel:
871 xfs_trans_cancel(tp);
872 return error;
873 }
874
875 static void
876 xfs_alloc_rsum_cache(
877 xfs_mount_t *mp, /* file system mount structure */
878 xfs_extlen_t rbmblocks) /* number of rt bitmap blocks */
879 {
880 /*
881 * The rsum cache is initialized to all zeroes, which is trivially a
882 * lower bound on the minimum level with any free extents. We can
883 * continue without the cache if it couldn't be allocated.
884 */
885 mp->m_rsum_cache = kvzalloc(rbmblocks, GFP_KERNEL);
886 if (!mp->m_rsum_cache)
887 xfs_warn(mp, "could not allocate realtime summary cache");
888 }
889
890 /*
891 * Visible (exported) functions.
892 */
893
894 /*
895 * Grow the realtime area of the filesystem.
896 */
897 int
898 xfs_growfs_rt(
899 xfs_mount_t *mp, /* mount point for filesystem */
900 xfs_growfs_rt_t *in) /* growfs rt input struct */
901 {
902 xfs_rtblock_t bmbno; /* bitmap block number */
903 struct xfs_buf *bp; /* temporary buffer */
904 int error; /* error return value */
905 xfs_mount_t *nmp; /* new (fake) mount structure */
906 xfs_rfsblock_t nrblocks; /* new number of realtime blocks */
907 xfs_extlen_t nrbmblocks; /* new number of rt bitmap blocks */
908 xfs_rtblock_t nrextents; /* new number of realtime extents */
909 uint8_t nrextslog; /* new log2 of sb_rextents */
910 xfs_extlen_t nrsumblocks; /* new number of summary blocks */
911 uint nrsumlevels; /* new rt summary levels */
912 uint nrsumsize; /* new size of rt summary, bytes */
913 xfs_sb_t *nsbp; /* new superblock */
914 xfs_extlen_t rbmblocks; /* current number of rt bitmap blocks */
915 xfs_extlen_t rsumblocks; /* current number of rt summary blks */
916 xfs_sb_t *sbp; /* old superblock */
917 xfs_fsblock_t sumbno; /* summary block number */
918 uint8_t *rsum_cache; /* old summary cache */
919
920 sbp = &mp->m_sb;
921 /*
922 * Initial error checking.
923 */
924 if (!capable(CAP_SYS_ADMIN))
925 return -EPERM;
926 if (mp->m_rtdev_targp == NULL || mp->m_rbmip == NULL ||
927 (nrblocks = in->newblocks) <= sbp->sb_rblocks ||
928 (sbp->sb_rblocks && (in->extsize != sbp->sb_rextsize)))
929 return -EINVAL;
930 if ((error = xfs_sb_validate_fsb_count(sbp, nrblocks)))
931 return error;
932 /*
933 * Read in the last block of the device, make sure it exists.
934 */
935 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
936 XFS_FSB_TO_BB(mp, nrblocks - 1),
937 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
938 if (error)
939 return error;
940 xfs_buf_relse(bp);
941
942 /*
943 * Calculate new parameters. These are the final values to be reached.
944 */
945 nrextents = nrblocks;
946 do_div(nrextents, in->extsize);
947 nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize);
948 nrextslog = xfs_highbit32(nrextents);
949 nrsumlevels = nrextslog + 1;
950 nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks;
951 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
952 nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
953 /*
954 * New summary size can't be more than half the size of
955 * the log. This prevents us from getting a log overflow,
956 * since we'll log basically the whole summary file at once.
957 */
958 if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1))
959 return -EINVAL;
960 /*
961 * Get the old block counts for bitmap and summary inodes.
962 * These can't change since other growfs callers are locked out.
963 */
964 rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_d.di_size);
965 rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_d.di_size);
966 /*
967 * Allocate space to the bitmap and summary files, as necessary.
968 */
969 error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks, mp->m_rbmip);
970 if (error)
971 return error;
972 error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks, mp->m_rsumip);
973 if (error)
974 return error;
975
976 rsum_cache = mp->m_rsum_cache;
977 if (nrbmblocks != sbp->sb_rbmblocks)
978 xfs_alloc_rsum_cache(mp, nrbmblocks);
979
980 /*
981 * Allocate a new (fake) mount/sb.
982 */
983 nmp = kmem_alloc(sizeof(*nmp), 0);
984 /*
985 * Loop over the bitmap blocks.
986 * We will do everything one bitmap block at a time.
987 * Skip the current block if it is exactly full.
988 * This also deals with the case where there were no rtextents before.
989 */
990 for (bmbno = sbp->sb_rbmblocks -
991 ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0);
992 bmbno < nrbmblocks;
993 bmbno++) {
994 xfs_trans_t *tp;
995
996 *nmp = *mp;
997 nsbp = &nmp->m_sb;
998 /*
999 * Calculate new sb and mount fields for this round.
1000 */
1001 nsbp->sb_rextsize = in->extsize;
1002 nsbp->sb_rbmblocks = bmbno + 1;
1003 nsbp->sb_rblocks =
1004 XFS_RTMIN(nrblocks,
1005 nsbp->sb_rbmblocks * NBBY *
1006 nsbp->sb_blocksize * nsbp->sb_rextsize);
1007 nsbp->sb_rextents = nsbp->sb_rblocks;
1008 do_div(nsbp->sb_rextents, nsbp->sb_rextsize);
1009 ASSERT(nsbp->sb_rextents != 0);
1010 nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents);
1011 nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1;
1012 nrsumsize =
1013 (uint)sizeof(xfs_suminfo_t) * nrsumlevels *
1014 nsbp->sb_rbmblocks;
1015 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize);
1016 nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks);
1017 /*
1018 * Start a transaction, get the log reservation.
1019 */
1020 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_growrtfree, 0, 0, 0,
1021 &tp);
1022 if (error)
1023 break;
1024 /*
1025 * Lock out other callers by grabbing the bitmap inode lock.
1026 */
1027 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL | XFS_ILOCK_RTBITMAP);
1028 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL);
1029 /*
1030 * Update the bitmap inode's size ondisk and incore. We need
1031 * to update the incore size so that inode inactivation won't
1032 * punch what it thinks are "posteof" blocks.
1033 */
1034 mp->m_rbmip->i_d.di_size =
1035 nsbp->sb_rbmblocks * nsbp->sb_blocksize;
1036 i_size_write(VFS_I(mp->m_rbmip), mp->m_rbmip->i_d.di_size);
1037 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1038 /*
1039 * Get the summary inode into the transaction.
1040 */
1041 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL | XFS_ILOCK_RTSUM);
1042 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL);
1043 /*
1044 * Update the summary inode's size. We need to update the
1045 * incore size so that inode inactivation won't punch what it
1046 * thinks are "posteof" blocks.
1047 */
1048 mp->m_rsumip->i_d.di_size = nmp->m_rsumsize;
1049 i_size_write(VFS_I(mp->m_rsumip), mp->m_rsumip->i_d.di_size);
1050 xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE);
1051 /*
1052 * Copy summary data from old to new sizes.
1053 * Do this when the real size (not block-aligned) changes.
1054 */
1055 if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks ||
1056 mp->m_rsumlevels != nmp->m_rsumlevels) {
1057 error = xfs_rtcopy_summary(mp, nmp, tp);
1058 if (error)
1059 goto error_cancel;
1060 }
1061 /*
1062 * Update superblock fields.
1063 */
1064 if (nsbp->sb_rextsize != sbp->sb_rextsize)
1065 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE,
1066 nsbp->sb_rextsize - sbp->sb_rextsize);
1067 if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks)
1068 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS,
1069 nsbp->sb_rbmblocks - sbp->sb_rbmblocks);
1070 if (nsbp->sb_rblocks != sbp->sb_rblocks)
1071 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS,
1072 nsbp->sb_rblocks - sbp->sb_rblocks);
1073 if (nsbp->sb_rextents != sbp->sb_rextents)
1074 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS,
1075 nsbp->sb_rextents - sbp->sb_rextents);
1076 if (nsbp->sb_rextslog != sbp->sb_rextslog)
1077 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG,
1078 nsbp->sb_rextslog - sbp->sb_rextslog);
1079 /*
1080 * Free new extent.
1081 */
1082 bp = NULL;
1083 error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents,
1084 nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno);
1085 if (error) {
1086 error_cancel:
1087 xfs_trans_cancel(tp);
1088 break;
1089 }
1090 /*
1091 * Mark more blocks free in the superblock.
1092 */
1093 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS,
1094 nsbp->sb_rextents - sbp->sb_rextents);
1095 /*
1096 * Update mp values into the real mp structure.
1097 */
1098 mp->m_rsumlevels = nrsumlevels;
1099 mp->m_rsumsize = nrsumsize;
1100
1101 error = xfs_trans_commit(tp);
1102 if (error)
1103 break;
1104 }
1105 if (error)
1106 goto out_free;
1107
1108 /* Update secondary superblocks now the physical grow has completed */
1109 error = xfs_update_secondary_sbs(mp);
1110
1111 out_free:
1112 /*
1113 * Free the fake mp structure.
1114 */
1115 kmem_free(nmp);
1116
1117 /*
1118 * If we had to allocate a new rsum_cache, we either need to free the
1119 * old one (if we succeeded) or free the new one and restore the old one
1120 * (if there was an error).
1121 */
1122 if (rsum_cache != mp->m_rsum_cache) {
1123 if (error) {
1124 kmem_free(mp->m_rsum_cache);
1125 mp->m_rsum_cache = rsum_cache;
1126 } else {
1127 kmem_free(rsum_cache);
1128 }
1129 }
1130
1131 return error;
1132 }
1133
1134 /*
1135 * Allocate an extent in the realtime subvolume, with the usual allocation
1136 * parameters. The length units are all in realtime extents, as is the
1137 * result block number.
1138 */
1139 int /* error */
1140 xfs_rtallocate_extent(
1141 xfs_trans_t *tp, /* transaction pointer */
1142 xfs_rtblock_t bno, /* starting block number to allocate */
1143 xfs_extlen_t minlen, /* minimum length to allocate */
1144 xfs_extlen_t maxlen, /* maximum length to allocate */
1145 xfs_extlen_t *len, /* out: actual length allocated */
1146 int wasdel, /* was a delayed allocation extent */
1147 xfs_extlen_t prod, /* extent product factor */
1148 xfs_rtblock_t *rtblock) /* out: start block allocated */
1149 {
1150 xfs_mount_t *mp = tp->t_mountp;
1151 int error; /* error value */
1152 xfs_rtblock_t r; /* result allocated block */
1153 xfs_fsblock_t sb; /* summary file block number */
1154 struct xfs_buf *sumbp; /* summary file block buffer */
1155
1156 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1157 ASSERT(minlen > 0 && minlen <= maxlen);
1158
1159 /*
1160 * If prod is set then figure out what to do to minlen and maxlen.
1161 */
1162 if (prod > 1) {
1163 xfs_extlen_t i;
1164
1165 if ((i = maxlen % prod))
1166 maxlen -= i;
1167 if ((i = minlen % prod))
1168 minlen += prod - i;
1169 if (maxlen < minlen) {
1170 *rtblock = NULLRTBLOCK;
1171 return 0;
1172 }
1173 }
1174
1175 retry:
1176 sumbp = NULL;
1177 if (bno == 0) {
1178 error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len,
1179 &sumbp, &sb, prod, &r);
1180 } else {
1181 error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen,
1182 len, &sumbp, &sb, prod, &r);
1183 }
1184
1185 if (error)
1186 return error;
1187
1188 /*
1189 * If it worked, update the superblock.
1190 */
1191 if (r != NULLRTBLOCK) {
1192 long slen = (long)*len;
1193
1194 ASSERT(*len >= minlen && *len <= maxlen);
1195 if (wasdel)
1196 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen);
1197 else
1198 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen);
1199 } else if (prod > 1) {
1200 prod = 1;
1201 goto retry;
1202 }
1203
1204 *rtblock = r;
1205 return 0;
1206 }
1207
1208 /*
1209 * Initialize realtime fields in the mount structure.
1210 */
1211 int /* error */
1212 xfs_rtmount_init(
1213 struct xfs_mount *mp) /* file system mount structure */
1214 {
1215 struct xfs_buf *bp; /* buffer for last block of subvolume */
1216 struct xfs_sb *sbp; /* filesystem superblock copy in mount */
1217 xfs_daddr_t d; /* address of last block of subvolume */
1218 int error;
1219
1220 sbp = &mp->m_sb;
1221 if (sbp->sb_rblocks == 0)
1222 return 0;
1223 if (mp->m_rtdev_targp == NULL) {
1224 xfs_warn(mp,
1225 "Filesystem has a realtime volume, use rtdev=device option");
1226 return -ENODEV;
1227 }
1228 mp->m_rsumlevels = sbp->sb_rextslog + 1;
1229 mp->m_rsumsize =
1230 (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels *
1231 sbp->sb_rbmblocks;
1232 mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize);
1233 mp->m_rbmip = mp->m_rsumip = NULL;
1234 /*
1235 * Check that the realtime section is an ok size.
1236 */
1237 d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks);
1238 if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) {
1239 xfs_warn(mp, "realtime mount -- %llu != %llu",
1240 (unsigned long long) XFS_BB_TO_FSB(mp, d),
1241 (unsigned long long) mp->m_sb.sb_rblocks);
1242 return -EFBIG;
1243 }
1244 error = xfs_buf_read_uncached(mp->m_rtdev_targp,
1245 d - XFS_FSB_TO_BB(mp, 1),
1246 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL);
1247 if (error) {
1248 xfs_warn(mp, "realtime device size check failed");
1249 return error;
1250 }
1251 xfs_buf_relse(bp);
1252 return 0;
1253 }
1254
1255 /*
1256 * Get the bitmap and summary inodes and the summary cache into the mount
1257 * structure at mount time.
1258 */
1259 int /* error */
1260 xfs_rtmount_inodes(
1261 xfs_mount_t *mp) /* file system mount structure */
1262 {
1263 int error; /* error return value */
1264 xfs_sb_t *sbp;
1265
1266 sbp = &mp->m_sb;
1267 error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip);
1268 if (error)
1269 return error;
1270 ASSERT(mp->m_rbmip != NULL);
1271
1272 error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip);
1273 if (error) {
1274 xfs_irele(mp->m_rbmip);
1275 return error;
1276 }
1277 ASSERT(mp->m_rsumip != NULL);
1278 xfs_alloc_rsum_cache(mp, sbp->sb_rbmblocks);
1279 return 0;
1280 }
1281
1282 void
1283 xfs_rtunmount_inodes(
1284 struct xfs_mount *mp)
1285 {
1286 kmem_free(mp->m_rsum_cache);
1287 if (mp->m_rbmip)
1288 xfs_irele(mp->m_rbmip);
1289 if (mp->m_rsumip)
1290 xfs_irele(mp->m_rsumip);
1291 }
1292
1293 /*
1294 * Pick an extent for allocation at the start of a new realtime file.
1295 * Use the sequence number stored in the atime field of the bitmap inode.
1296 * Translate this to a fraction of the rtextents, and return the product
1297 * of rtextents and the fraction.
1298 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
1299 */
1300 int /* error */
1301 xfs_rtpick_extent(
1302 xfs_mount_t *mp, /* file system mount point */
1303 xfs_trans_t *tp, /* transaction pointer */
1304 xfs_extlen_t len, /* allocation length (rtextents) */
1305 xfs_rtblock_t *pick) /* result rt extent */
1306 {
1307 xfs_rtblock_t b; /* result block */
1308 int log2; /* log of sequence number */
1309 uint64_t resid; /* residual after log removed */
1310 uint64_t seq; /* sequence number of file creation */
1311 uint64_t *seqp; /* pointer to seqno in inode */
1312
1313 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL));
1314
1315 seqp = (uint64_t *)&VFS_I(mp->m_rbmip)->i_atime;
1316 if (!(mp->m_rbmip->i_d.di_flags & XFS_DIFLAG_NEWRTBM)) {
1317 mp->m_rbmip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM;
1318 *seqp = 0;
1319 }
1320 seq = *seqp;
1321 if ((log2 = xfs_highbit64(seq)) == -1)
1322 b = 0;
1323 else {
1324 resid = seq - (1ULL << log2);
1325 b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >>
1326 (log2 + 1);
1327 if (b >= mp->m_sb.sb_rextents)
1328 div64_u64_rem(b, mp->m_sb.sb_rextents, &b);
1329 if (b + len > mp->m_sb.sb_rextents)
1330 b = mp->m_sb.sb_rextents - len;
1331 }
1332 *seqp = seq + 1;
1333 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE);
1334 *pick = b;
1335 return 0;
1336 }
Linux with added FPC-III support