| blob | 8f76fdff4f4688484fac811a23f97cf23f91d23a |
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 */
45 /*
46 * Prototypes for internal functions.
47 */
67 /*
68 * Internal functions.
69 */
71 /*
72 * Allocate space to the bitmap or summary file, and zero it, for growfs.
73 */
80 {
93 /*
94 * Allocate space to the file, as necessary.
95 */
102 /*
103 * Reserve space & log for one extent added to the file.
104 */
107 XFS_TRANS_PERM_LOG_RES,
108 XFS_DEFAULT_PERM_LOG_COUNT)))
111 /*
112 * Lock the inode.
113 */
118 /*
119 * Allocate blocks to the bitmap file.
120 */
130 /*
131 * Free any blocks freed up in the transaction, then commit.
132 */
139 /*
140 * Now we need to clear the allocated blocks.
141 * Do this one block per transaction, to keep it simple.
142 */
148 /*
149 * Reserve log for one block zeroing.
150 */
154 /*
155 * Lock the bitmap inode.
156 */
159 /*
160 * Get a buffer for the block.
161 */
167 error_cancel:
170 }
173 /*
174 * Commit the transaction.
175 */
179 }
180 /*
181 * Go on to the next extent, if any.
182 */
184 }
186 error:
188 }
190 /*
191 * Attempt to allocate an extent minlen<=len<=maxlen starting from
192 * bitmap block bbno. If we don't get maxlen then use prod to trim
193 * the length, if given. Returns error; returns starting block in *rtblock.
194 * The lengths are all in rtextents.
195 */
209 {
218 /*
219 * Loop over all the extents starting in this bitmap block,
220 * looking for one that's long enough.
221 */
225 i++) {
226 /*
227 * See if there's a free extent of maxlen starting at i.
228 * If it's not so then next will contain the first non-free.
229 */
233 }
235 /*
236 * i for maxlen is all free, allocate and return that.
237 */
239 rsb);
242 }
246 }
247 /*
248 * In the case where we have a variable-sized allocation
249 * request, figure out how big this free piece is,
250 * and if it's big enough for the minimum, and the best
251 * so far, remember it.
252 */
260 }
261 }
262 /*
263 * If not done yet, find the start of the next free space.
264 */
269 }
272 }
273 /*
274 * Searched the whole thing & didn't find a maxlen free extent.
275 */
279 /*
280 * If size should be a multiple of prod, make that so.
281 */
284 /*
285 * Allocate besti for bestlen & return that.
286 */
290 }
294 }
295 /*
296 * Allocation failed. Set *nextp to the next block to try.
297 */
301 }
303 /*
304 * Allocate an extent of length minlen<=len<=maxlen, starting at block
305 * bno. If we don't get maxlen then use prod to trim the length, if given.
306 * Returns error; returns starting block in *rtblock.
307 * The lengths are all in rtextents.
308 */
321 {
328 /*
329 * Check if the range in question (for maxlen) is free.
330 */
334 }
336 /*
337 * If it is, allocate it and return success.
338 */
342 }
346 }
347 /*
348 * If not, allocate what there is, if it's at least minlen.
349 */
352 /*
353 * Failed, return failure status.
354 */
357 }
358 /*
359 * Trim off tail of extent, if prod is specified.
360 */
364 /*
365 * Now we can't do it, return failure status.
366 */
369 }
370 }
371 /*
372 * Allocate what we can and return it.
373 */
377 }
381 }
383 /*
384 * Allocate an extent of length minlen<=len<=maxlen, starting as near
385 * to bno as possible. If we don't get maxlen then use prod to trim
386 * the length, if given. The lengths are all in rtextents.
387 */
400 {
411 /*
412 * If the block number given is off the end, silently set it to
413 * the last block.
414 */
417 /*
418 * Try the exact allocation first.
419 */
424 }
425 /*
426 * If the exact allocation worked, return that.
427 */
431 }
436 /*
437 * Loop over all bitmap blocks (bbno + i is current block).
438 */
440 /*
441 * Get summary information of extents of all useful levels
442 * starting in this bitmap block.
443 */
448 }
449 /*
450 * If there are any useful extents starting here, try
451 * allocating one.
452 */
454 /*
455 * On the positive side of the starting location.
456 */
458 /*
459 * Try to allocate an extent starting in
460 * this block.
461 */
467 }
468 /*
469 * If it worked, return it.
470 */
474 }
475 }
476 /*
477 * On the negative side of the starting location.
478 */
480 /*
481 * Loop backwards through the bitmap blocks from
482 * the starting point-1 up to where we are now.
483 * There should be an extent which ends in this
484 * bitmap block and is long enough.
485 */
487 /*
488 * Grab the summary information for
489 * this bitmap block.
490 */
496 }
497 /*
498 * If there's no extent given in the
499 * summary that means the extent we
500 * found must carry over from an
501 * earlier block. If there is an
502 * extent given, we've already tried
503 * that allocation, don't do it again.
504 */
512 }
513 /*
514 * If it works, return the extent.
515 */
519 }
520 }
521 /*
522 * There weren't intervening bitmap blocks
523 * with a long enough extent, or the
524 * allocation didn't work for some reason
525 * (i.e. it's a little * too short).
526 * Try to allocate from the summary block
527 * that we found.
528 */
534 }
535 /*
536 * If it works, return the extent.
537 */
541 }
542 }
543 }
544 /*
545 * Loop control. If we were on the positive side, and there's
546 * still more blocks on the negative side, go there.
547 */
550 /*
551 * If positive, and no more negative, but there are more
552 * positive, go there.
553 */
555 i++;
556 /*
557 * If negative or 0 (just started), and there are positive
558 * blocks to go, go there. The 0 case moves to block 1.
559 */
562 /*
563 * If negative or 0 and there are more negative blocks,
564 * go there.
565 */
567 i--;
568 /*
569 * Must be done. Return failure.
570 */
571 else
573 }
576 }
578 /*
579 * Allocate an extent of length minlen<=len<=maxlen, with no position
580 * specified. If we don't get maxlen then use prod to trim
581 * the length, if given. The lengths are all in rtextents.
582 */
594 {
605 /*
606 * Loop over all the levels starting with maxlen.
607 * At each level, look at all the bitmap blocks, to see if there
608 * are extents starting there that are long enough (>= maxlen).
609 * Note, only on the initial level can the allocation fail if
610 * the summary says there's an extent.
611 */
613 /*
614 * Loop over all the bitmap blocks.
615 */
617 /*
618 * Get the summary for this level/block.
619 */
624 }
625 /*
626 * Nothing there, on to the next block.
627 */
630 /*
631 * Try allocating the extent.
632 */
637 }
638 /*
639 * If it worked, return that.
640 */
644 }
645 /*
646 * If the "next block to try" returned from the
647 * allocator is beyond the next bitmap block,
648 * skip to that bitmap block.
649 */
652 }
653 }
654 /*
655 * Didn't find any maxlen blocks. Try smaller ones, unless
656 * we're asking for a fixed size extent.
657 */
661 }
665 /*
666 * Loop over sizes, from maxlen down to minlen.
667 * This time, when we do the allocations, allow smaller ones
668 * to succeed.
669 */
671 /*
672 * Loop over all the bitmap blocks, try an allocation
673 * starting in that block.
674 */
676 /*
677 * Get the summary information for this level/block.
678 */
683 }
684 /*
685 * If nothing there, go on to next.
686 */
689 /*
690 * Try the allocation. Make sure the specified
691 * minlen/maxlen are in the possible range for
692 * this summary level.
693 */
700 }
701 /*
702 * If it worked, return that extent.
703 */
707 }
708 /*
709 * If the "next block to try" returned from the
710 * allocator is beyond the next bitmap block,
711 * skip to that bitmap block.
712 */
715 }
716 }
717 /*
718 * Got nothing, return failure.
719 */
722 }
724 /*
725 * Mark an extent specified by start and len allocated.
726 * Updates all the summary information as well as the bitmap.
727 */
736 {
743 /*
744 * Assume we're allocating out of the middle of a free extent.
745 * We need to find the beginning and end of the extent so we can
746 * properly update the summary.
747 */
751 }
752 /*
753 * Find the next allocated block (end of free extent).
754 */
759 }
760 /*
761 * Decrement the summary information corresponding to the entire
762 * (old) free extent.
763 */
769 }
770 /*
771 * If there are blocks not being allocated at the front of the
772 * old extent, add summary data for them to be free.
773 */
780 }
781 }
782 /*
783 * If there are blocks not being allocated at the end of the
784 * old extent, add summary data for them to be free.
785 */
792 }
793 }
794 /*
795 * Modify the bitmap to mark this extent allocated.
796 */
799 }
801 /*
802 * Return whether there are any free extents in the size range given
803 * by low and high, for the bitmap block bbno.
804 */
815 {
820 /*
821 * Loop over logs of extent sizes. Order is irrelevant.
822 */
824 /*
825 * Get one summary datum.
826 */
830 }
831 /*
832 * If there are any, return success.
833 */
837 }
838 }
839 /*
840 * Found nothing, return failure.
841 */
844 }
846 /*
847 * Get a buffer for the bitmap or summary file block specified.
848 * The buffer is returned read and locked.
849 */
857 {
865 /*
866 * Map from the file offset (block) and inode number to the
867 * file system block.
868 */
872 }
874 /*
875 * Convert to disk address for buffer cache.
876 */
878 /*
879 * Read the buffer.
880 */
885 }
889 }
891 #ifdef DEBUG
892 /*
893 * Check that the given extent (block range) is allocated already.
894 */
902 {
906 }
907 #endif
909 /*
910 * Check that the given range is either all allocated (val = 0) or
911 * all free (val = 1).
912 */
922 {
935 /*
936 * Compute starting bitmap block number
937 */
939 /*
940 * Read the bitmap block.
941 */
945 }
947 /*
948 * Compute the starting word's address, and starting bit.
949 */
953 /*
954 * 0 (allocated) => all zero's; 1 (free) => all one's.
955 */
957 /*
958 * If not starting on a word boundary, deal with the first
959 * (partial) word.
960 */
962 /*
963 * Compute first bit not examined.
964 */
966 /*
967 * Mask of relevant bits.
968 */
970 /*
971 * Compute difference between actual and desired value.
972 */
974 /*
975 * Different, compute first wrong bit and return.
976 */
982 }
984 /*
985 * Go on to next block if that's where the next word is
986 * and we need the next word.
987 */
989 /*
990 * If done with this block, get the next one.
991 */
996 }
1000 /*
1001 * Go on to the next word in the buffer.
1002 */
1003 b++;
1004 }
1006 /*
1007 * Starting on a word boundary, no partial word.
1008 */
1010 }
1011 /*
1012 * Loop over whole words in buffers. When we use up one buffer
1013 * we move on to the next one.
1014 */
1016 /*
1017 * Compute difference between actual and desired value.
1018 */
1020 /*
1021 * Different, compute first wrong bit and return.
1022 */
1028 }
1030 /*
1031 * Go on to next block if that's where the next word is
1032 * and we need the next word.
1033 */
1035 /*
1036 * If done with this block, get the next one.
1037 */
1042 }
1046 /*
1047 * Go on to the next word in the buffer.
1048 */
1049 b++;
1050 }
1051 }
1052 /*
1053 * If not ending on a word boundary, deal with the last
1054 * (partial) word.
1055 */
1057 /*
1058 * Mask of relevant bits.
1059 */
1061 /*
1062 * Compute difference between actual and desired value.
1063 */
1065 /*
1066 * Different, compute first wrong bit and return.
1067 */
1075 }
1076 /*
1077 * Successful, return.
1078 */
1083 }
1085 /*
1086 * Copy and transform the summary file, given the old and new
1087 * parameters in the mount structures.
1088 */
1094 {
1106 bbno--) {
1122 }
1123 }
1125 }
1127 /*
1128 * Searching backward from start to limit, find the first block whose
1129 * allocated/free state is different from start's.
1130 */
1138 {
1153 /*
1154 * Compute and read in starting bitmap block for starting block.
1155 */
1160 }
1162 /*
1163 * Get the first word's index & point to it.
1164 */
1169 /*
1170 * Compute match value, based on the bit at start: if 1 (free)
1171 * then all-ones, else all-zeroes.
1172 */
1174 /*
1175 * If the starting position is not word-aligned, deal with the
1176 * partial word.
1177 */
1179 /*
1180 * Calculate first (leftmost) bit number to look at,
1181 * and mask for all the relevant bits in this word.
1182 */
1185 firstbit;
1186 /*
1187 * Calculate the difference between the value there
1188 * and what we're looking for.
1189 */
1191 /*
1192 * Different. Mark where we are and return.
1193 */
1198 }
1200 /*
1201 * Go on to previous block if that's where the previous word is
1202 * and we need the previous word.
1203 */
1205 /*
1206 * If done with this block, get the previous one.
1207 */
1212 }
1217 /*
1218 * Go on to the previous word in the buffer.
1219 */
1220 b--;
1221 }
1223 /*
1224 * Starting on a word boundary, no partial word.
1225 */
1227 }
1228 /*
1229 * Loop over whole words in buffers. When we use up one buffer
1230 * we move on to the previous one.
1231 */
1233 /*
1234 * Compute difference between actual and desired value.
1235 */
1237 /*
1238 * Different, mark where we are and return.
1239 */
1244 }
1246 /*
1247 * Go on to previous block if that's where the previous word is
1248 * and we need the previous word.
1249 */
1251 /*
1252 * If done with this block, get the previous one.
1253 */
1258 }
1263 /*
1264 * Go on to the previous word in the buffer.
1265 */
1266 b--;
1267 }
1268 }
1269 /*
1270 * If not ending on a word boundary, deal with the last
1271 * (partial) word.
1272 */
1274 /*
1275 * Calculate first (leftmost) bit number to look at,
1276 * and mask for all the relevant bits in this word.
1277 */
1280 /*
1281 * Compute difference between actual and desired value.
1282 */
1284 /*
1285 * Different, mark where we are and return.
1286 */
1293 }
1294 /*
1295 * No match, return that we scanned the whole area.
1296 */
1300 }
1302 /*
1303 * Searching forward from start to limit, find the first block whose
1304 * allocated/free state is different from start's.
1305 */
1313 {
1328 /*
1329 * Compute and read in starting bitmap block for starting block.
1330 */
1335 }
1337 /*
1338 * Get the first word's index & point to it.
1339 */
1344 /*
1345 * Compute match value, based on the bit at start: if 1 (free)
1346 * then all-ones, else all-zeroes.
1347 */
1349 /*
1350 * If the starting position is not word-aligned, deal with the
1351 * partial word.
1352 */
1354 /*
1355 * Calculate last (rightmost) bit number to look at,
1356 * and mask for all the relevant bits in this word.
1357 */
1360 /*
1361 * Calculate the difference between the value there
1362 * and what we're looking for.
1363 */
1365 /*
1366 * Different. Mark where we are and return.
1367 */
1372 }
1374 /*
1375 * Go on to next block if that's where the next word is
1376 * and we need the next word.
1377 */
1379 /*
1380 * If done with this block, get the previous one.
1381 */
1386 }
1390 /*
1391 * Go on to the previous word in the buffer.
1392 */
1393 b++;
1394 }
1396 /*
1397 * Starting on a word boundary, no partial word.
1398 */
1400 }
1401 /*
1402 * Loop over whole words in buffers. When we use up one buffer
1403 * we move on to the next one.
1404 */
1406 /*
1407 * Compute difference between actual and desired value.
1408 */
1410 /*
1411 * Different, mark where we are and return.
1412 */
1417 }
1419 /*
1420 * Go on to next block if that's where the next word is
1421 * and we need the next word.
1422 */
1424 /*
1425 * If done with this block, get the next one.
1426 */
1431 }
1435 /*
1436 * Go on to the next word in the buffer.
1437 */
1438 b++;
1439 }
1440 }
1441 /*
1442 * If not ending on a word boundary, deal with the last
1443 * (partial) word.
1444 */
1446 /*
1447 * Calculate mask for all the relevant bits in this word.
1448 */
1450 /*
1451 * Compute difference between actual and desired value.
1452 */
1454 /*
1455 * Different, mark where we are and return.
1456 */
1463 }
1464 /*
1465 * No match, return that we scanned the whole area.
1466 */
1470 }
1472 /*
1473 * Mark an extent specified by start and len freed.
1474 * Updates all the summary information as well as the bitmap.
1475 */
1484 {
1491 /*
1492 * Modify the bitmap to mark this extent freed.
1493 */
1497 }
1498 /*
1499 * Assume we're freeing out of the middle of an allocated extent.
1500 * We need to find the beginning and end of the extent so we can
1501 * properly update the summary.
1502 */
1506 }
1507 /*
1508 * Find the next allocated block (end of allocated extent).
1509 */
1514 /*
1515 * If there are blocks not being freed at the front of the
1516 * old extent, add summary data for them to be allocated.
1517 */
1524 }
1525 }
1526 /*
1527 * If there are blocks not being freed at the end of the
1528 * old extent, add summary data for them to be allocated.
1529 */
1536 }
1537 }
1538 /*
1539 * Increment the summary information corresponding to the entire
1540 * (new) free extent.
1541 */
1546 }
1548 /*
1549 * Read and return the summary information for a given extent size,
1550 * bitmap block combination.
1551 * Keeps track of a current summary block, so we don't keep reading
1552 * it from the buffer cache.
1553 */
1563 {
1570 /*
1571 * Compute entry number in the summary file.
1572 */
1574 /*
1575 * Compute the block number in the summary file.
1576 */
1578 /*
1579 * If we have an old buffer, and the block number matches, use that.
1580 */
1583 /*
1584 * Otherwise we have to get the buffer.
1585 */
1587 /*
1588 * If there was an old one, get rid of it first.
1589 */
1595 }
1596 /*
1597 * Remember this buffer and block for the next call.
1598 */
1602 }
1603 }
1604 /*
1605 * Point to the summary information & copy it out.
1606 */
1609 /*
1610 * Drop the buffer if we're not asked to remember it.
1611 */
1615 }
1617 /*
1618 * Set the given range of bitmap bits to the given value.
1619 * Do whatever I/O and logging is required.
1620 */
1628 {
1641 /*
1642 * Compute starting bitmap block number.
1643 */
1645 /*
1646 * Read the bitmap block, and point to its data.
1647 */
1651 }
1653 /*
1654 * Compute the starting word's address, and starting bit.
1655 */
1659 /*
1660 * 0 (allocated) => all zeroes; 1 (free) => all ones.
1661 */
1663 /*
1664 * If not starting on a word boundary, deal with the first
1665 * (partial) word.
1666 */
1668 /*
1669 * Compute first bit not changed and mask of relevant bits.
1670 */
1673 /*
1674 * Set/clear the active bits.
1675 */
1678 else
1681 /*
1682 * Go on to the next block if that's where the next word is
1683 * and we need the next word.
1684 */
1686 /*
1687 * Log the changed part of this block.
1688 * Get the next one.
1689 */
1696 }
1700 /*
1701 * Go on to the next word in the buffer
1702 */
1703 b++;
1704 }
1706 /*
1707 * Starting on a word boundary, no partial word.
1708 */
1710 }
1711 /*
1712 * Loop over whole words in buffers. When we use up one buffer
1713 * we move on to the next one.
1714 */
1716 /*
1717 * Set the word value correctly.
1718 */
1721 /*
1722 * Go on to the next block if that's where the next word is
1723 * and we need the next word.
1724 */
1726 /*
1727 * Log the changed part of this block.
1728 * Get the next one.
1729 */
1736 }
1740 /*
1741 * Go on to the next word in the buffer
1742 */
1743 b++;
1744 }
1745 }
1746 /*
1747 * If not ending on a word boundary, deal with the last
1748 * (partial) word.
1749 */
1751 /*
1752 * Compute a mask of relevant bits.
1753 */
1756 /*
1757 * Set/clear the active bits.
1758 */
1761 else
1763 b++;
1764 }
1765 /*
1766 * Log any remaining changed bytes.
1767 */
1772 }
1774 /*
1775 * Read and modify the summary information for a given extent size,
1776 * bitmap block combination.
1777 * Keeps track of a current summary block, so we don't keep reading
1778 * it from the buffer cache.
1779 */
1789 {
1796 /*
1797 * Compute entry number in the summary file.
1798 */
1800 /*
1801 * Compute the block number in the summary file.
1802 */
1804 /*
1805 * If we have an old buffer, and the block number matches, use that.
1806 */
1809 /*
1810 * Otherwise we have to get the buffer.
1811 */
1813 /*
1814 * If there was an old one, get rid of it first.
1815 */
1821 }
1822 /*
1823 * Remember this buffer and block for the next call.
1824 */
1828 }
1829 }
1830 /*
1831 * Point to the summary information, modify and log it.
1832 */
1838 }
1840 /*
1841 * Visible (exported) functions.
1842 */
1844 /*
1845 * Grow the realtime area of the filesystem.
1846 */
1847 int
1851 {
1870 /*
1871 * Initial error checking.
1872 */
1881 /*
1882 * Read in the last block of the device, make sure it exists.
1883 */
1891 /*
1892 * Calculate new parameters. These are the final values to be reached.
1893 */
1902 /*
1903 * New summary size can't be more than half the size of
1904 * the log. This prevents us from getting a log overflow,
1905 * since we'll log basically the whole summary file at once.
1906 */
1909 /*
1910 * Get the old block counts for bitmap and summary inodes.
1911 * These can't change since other growfs callers are locked out.
1912 */
1915 /*
1916 * Allocate space to the bitmap and summary files, as necessary.
1917 */
1924 /*
1925 * Allocate a new (fake) mount/sb.
1926 */
1928 /*
1929 * Loop over the bitmap blocks.
1930 * We will do everything one bitmap block at a time.
1931 * Skip the current block if it is exactly full.
1932 * This also deals with the case where there were no rtextents before.
1933 */
1937 bmbno++) {
1943 /*
1944 * Calculate new sb and mount fields for this round.
1945 */
1957 nrsumsize =
1962 /*
1963 * Start a transaction, get the log reservation.
1964 */
1969 /*
1970 * Lock out other callers by grabbing the bitmap inode lock.
1971 */
1974 /*
1975 * Update the bitmap inode's size.
1976 */
1981 /*
1982 * Get the summary inode into the transaction.
1983 */
1986 /*
1987 * Update the summary inode's size.
1988 */
1991 /*
1992 * Copy summary data from old to new sizes.
1993 * Do this when the real size (not block-aligned) changes.
1994 */
2000 }
2001 /*
2002 * Update superblock fields.
2003 */
2019 /*
2020 * Free new extent.
2021 */
2026 error_cancel:
2029 }
2030 /*
2031 * Mark more blocks free in the superblock.
2032 */
2035 /*
2036 * Update mp values into the real mp structure.
2037 */
2044 }
2046 /*
2047 * Free the fake mp structure.
2048 */
2052 }
2054 /*
2055 * Allocate an extent in the realtime subvolume, with the usual allocation
2056 * parameters. The length units are all in realtime extents, as is the
2057 * result block number.
2058 */
2070 {
2080 /*
2081 * If prod is set then figure out what to do to minlen and maxlen.
2082 */
2084 xfs_extlen_t i;
2093 }
2094 }
2097 /*
2098 * Allocate by size, or near another block, or exactly at some block.
2099 */
2116 }
2120 /*
2121 * If it worked, update the superblock.
2122 */
2129 else
2131 }
2134 }
2136 /*
2137 * Free an extent in the realtime subvolume. Length is expressed in
2138 * realtime extents, as is the block number.
2139 */
2145 {
2152 /*
2153 * Synchronize by locking the bitmap inode.
2154 */
2158 #if defined(__KERNEL__) && defined(DEBUG)
2159 /*
2160 * Check to see that this whole range is currently allocated.
2161 */
2162 {
2168 }
2170 }
2171 #endif
2173 /*
2174 * Free the range of realtime blocks.
2175 */
2179 }
2180 /*
2181 * Mark more blocks free in the superblock.
2182 */
2184 /*
2185 * If we've now freed all the blocks, reset the file sequence
2186 * number to 0.
2187 */
2194 }
2196 }
2198 /*
2199 * Initialize realtime fields in the mount structure.
2200 */
2204 {
2216 }
2223 /*
2224 * Check that the realtime section is an ok size.
2225 */
2232 }
2239 }
2242 }
2244 /*
2245 * Get the bitmap and summary inodes into the mount structure
2246 * at mount time.
2247 */
2251 {
2267 }
2270 }
2272 void
2275 {
2280 }
2282 /*
2283 * Pick an extent for allocation at the start of a new realtime file.
2284 * Use the sequence number stored in the atime field of the bitmap inode.
2285 * Translate this to a fraction of the rtextents, and return the product
2286 * of rtextents and the fraction.
2287 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
2288 */
2295 {
2308 }
2320 }
2325 }