| blob | e2f68de161599d28d7b33f3348fd6dea4680f5e7 |
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 */
50 /*
51 * Prototypes for internal functions.
52 */
72 /*
73 * Internal functions.
74 */
76 /*
77 * Allocate space to the bitmap or summary file, and zero it, for growfs.
78 */
85 {
101 /*
102 * Allocate space to the file, as necessary.
103 */
108 /*
109 * Reserve space & log for one extent added to the file.
110 */
113 XFS_TRANS_PERM_LOG_RES,
114 XFS_DEFAULT_PERM_LOG_COUNT)))
117 /*
118 * Lock the inode.
119 */
124 /*
125 * Allocate blocks to the bitmap file.
126 */
136 /*
137 * Free any blocks freed up in the transaction, then commit.
138 */
145 /*
146 * Now we need to clear the allocated blocks.
147 * Do this one block per transaction, to keep it simple.
148 */
154 /*
155 * Reserve log for one block zeroing.
156 */
160 /*
161 * Lock the bitmap inode.
162 */
166 /*
167 * Get a buffer for the block.
168 */
175 }
178 /*
179 * Commit the transaction.
180 */
184 }
185 /*
186 * Go on to the next extent, if any.
187 */
189 }
191 error_cancel:
193 error:
195 }
197 /*
198 * Attempt to allocate an extent minlen<=len<=maxlen starting from
199 * bitmap block bbno. If we don't get maxlen then use prod to trim
200 * the length, if given. Returns error; returns starting block in *rtblock.
201 * The lengths are all in rtextents.
202 */
216 {
225 /*
226 * Loop over all the extents starting in this bitmap block,
227 * looking for one that's long enough.
228 */
232 i++) {
233 /*
234 * See if there's a free extent of maxlen starting at i.
235 * If it's not so then next will contain the first non-free.
236 */
240 }
242 /*
243 * i for maxlen is all free, allocate and return that.
244 */
246 rsb);
249 }
253 }
254 /*
255 * In the case where we have a variable-sized allocation
256 * request, figure out how big this free piece is,
257 * and if it's big enough for the minimum, and the best
258 * so far, remember it.
259 */
267 }
268 }
269 /*
270 * If not done yet, find the start of the next free space.
271 */
276 }
279 }
280 /*
281 * Searched the whole thing & didn't find a maxlen free extent.
282 */
286 /*
287 * If size should be a multiple of prod, make that so.
288 */
291 /*
292 * Allocate besti for bestlen & return that.
293 */
297 }
301 }
302 /*
303 * Allocation failed. Set *nextp to the next block to try.
304 */
308 }
310 /*
311 * Allocate an extent of length minlen<=len<=maxlen, starting at block
312 * bno. If we don't get maxlen then use prod to trim the length, if given.
313 * Returns error; returns starting block in *rtblock.
314 * The lengths are all in rtextents.
315 */
328 {
335 /*
336 * Check if the range in question (for maxlen) is free.
337 */
341 }
343 /*
344 * If it is, allocate it and return success.
345 */
349 }
353 }
354 /*
355 * If not, allocate what there is, if it's at least minlen.
356 */
359 /*
360 * Failed, return failure status.
361 */
364 }
365 /*
366 * Trim off tail of extent, if prod is specified.
367 */
371 /*
372 * Now we can't do it, return failure status.
373 */
376 }
377 }
378 /*
379 * Allocate what we can and return it.
380 */
384 }
388 }
390 /*
391 * Allocate an extent of length minlen<=len<=maxlen, starting as near
392 * to bno as possible. If we don't get maxlen then use prod to trim
393 * the length, if given. The lengths are all in rtextents.
394 */
407 {
418 /*
419 * If the block number given is off the end, silently set it to
420 * the last block.
421 */
424 /*
425 * Try the exact allocation first.
426 */
431 }
432 /*
433 * If the exact allocation worked, return that.
434 */
438 }
443 /*
444 * Loop over all bitmap blocks (bbno + i is current block).
445 */
447 /*
448 * Get summary information of extents of all useful levels
449 * starting in this bitmap block.
450 */
455 }
456 /*
457 * If there are any useful extents starting here, try
458 * allocating one.
459 */
461 /*
462 * On the positive side of the starting location.
463 */
465 /*
466 * Try to allocate an extent starting in
467 * this block.
468 */
474 }
475 /*
476 * If it worked, return it.
477 */
481 }
482 }
483 /*
484 * On the negative side of the starting location.
485 */
487 /*
488 * Loop backwards through the bitmap blocks from
489 * the starting point-1 up to where we are now.
490 * There should be an extent which ends in this
491 * bitmap block and is long enough.
492 */
494 /*
495 * Grab the summary information for
496 * this bitmap block.
497 */
503 }
504 /*
505 * If there's no extent given in the
506 * summary that means the extent we
507 * found must carry over from an
508 * earlier block. If there is an
509 * extent given, we've already tried
510 * that allocation, don't do it again.
511 */
519 }
520 /*
521 * If it works, return the extent.
522 */
526 }
527 }
528 /*
529 * There weren't intervening bitmap blocks
530 * with a long enough extent, or the
531 * allocation didn't work for some reason
532 * (i.e. it's a little * too short).
533 * Try to allocate from the summary block
534 * that we found.
535 */
541 }
542 /*
543 * If it works, return the extent.
544 */
548 }
549 }
550 }
551 /*
552 * Loop control. If we were on the positive side, and there's
553 * still more blocks on the negative side, go there.
554 */
557 /*
558 * If positive, and no more negative, but there are more
559 * positive, go there.
560 */
562 i++;
563 /*
564 * If negative or 0 (just started), and there are positive
565 * blocks to go, go there. The 0 case moves to block 1.
566 */
569 /*
570 * If negative or 0 and there are more negative blocks,
571 * go there.
572 */
574 i--;
575 /*
576 * Must be done. Return failure.
577 */
578 else
580 }
583 }
585 /*
586 * Allocate an extent of length minlen<=len<=maxlen, with no position
587 * specified. If we don't get maxlen then use prod to trim
588 * the length, if given. The lengths are all in rtextents.
589 */
601 {
612 /*
613 * Loop over all the levels starting with maxlen.
614 * At each level, look at all the bitmap blocks, to see if there
615 * are extents starting there that are long enough (>= maxlen).
616 * Note, only on the initial level can the allocation fail if
617 * the summary says there's an extent.
618 */
620 /*
621 * Loop over all the bitmap blocks.
622 */
624 /*
625 * Get the summary for this level/block.
626 */
631 }
632 /*
633 * Nothing there, on to the next block.
634 */
637 /*
638 * Try allocating the extent.
639 */
644 }
645 /*
646 * If it worked, return that.
647 */
651 }
652 /*
653 * If the "next block to try" returned from the
654 * allocator is beyond the next bitmap block,
655 * skip to that bitmap block.
656 */
659 }
660 }
661 /*
662 * Didn't find any maxlen blocks. Try smaller ones, unless
663 * we're asking for a fixed size extent.
664 */
668 }
672 /*
673 * Loop over sizes, from maxlen down to minlen.
674 * This time, when we do the allocations, allow smaller ones
675 * to succeed.
676 */
678 /*
679 * Loop over all the bitmap blocks, try an allocation
680 * starting in that block.
681 */
683 /*
684 * Get the summary information for this level/block.
685 */
690 }
691 /*
692 * If nothing there, go on to next.
693 */
696 /*
697 * Try the allocation. Make sure the specified
698 * minlen/maxlen are in the possible range for
699 * this summary level.
700 */
707 }
708 /*
709 * If it worked, return that extent.
710 */
714 }
715 /*
716 * If the "next block to try" returned from the
717 * allocator is beyond the next bitmap block,
718 * skip to that bitmap block.
719 */
722 }
723 }
724 /*
725 * Got nothing, return failure.
726 */
729 }
731 /*
732 * Mark an extent specified by start and len allocated.
733 * Updates all the summary information as well as the bitmap.
734 */
743 {
750 /*
751 * Assume we're allocating out of the middle of a free extent.
752 * We need to find the beginning and end of the extent so we can
753 * properly update the summary.
754 */
758 }
759 /*
760 * Find the next allocated block (end of free extent).
761 */
766 }
767 /*
768 * Decrement the summary information corresponding to the entire
769 * (old) free extent.
770 */
776 }
777 /*
778 * If there are blocks not being allocated at the front of the
779 * old extent, add summary data for them to be free.
780 */
787 }
788 }
789 /*
790 * If there are blocks not being allocated at the end of the
791 * old extent, add summary data for them to be free.
792 */
799 }
800 }
801 /*
802 * Modify the bitmap to mark this extent allocated.
803 */
806 }
808 /*
809 * Return whether there are any free extents in the size range given
810 * by low and high, for the bitmap block bbno.
811 */
822 {
827 /*
828 * Loop over logs of extent sizes. Order is irrelevant.
829 */
831 /*
832 * Get one summary datum.
833 */
837 }
838 /*
839 * If there are any, return success.
840 */
844 }
845 }
846 /*
847 * Found nothing, return failure.
848 */
851 }
853 /*
854 * Get a buffer for the bitmap or summary file block specified.
855 * The buffer is returned read and locked.
856 */
864 {
872 /*
873 * Map from the file offset (block) and inode number to the
874 * file system block.
875 */
879 }
881 /*
882 * Convert to disk address for buffer cache.
883 */
885 /*
886 * Read the buffer.
887 */
892 }
896 }
898 #ifdef DEBUG
899 /*
900 * Check that the given extent (block range) is allocated already.
901 */
909 {
913 }
914 #endif
916 /*
917 * Check that the given range is either all allocated (val = 0) or
918 * all free (val = 1).
919 */
929 {
942 /*
943 * Compute starting bitmap block number
944 */
946 /*
947 * Read the bitmap block.
948 */
952 }
954 /*
955 * Compute the starting word's address, and starting bit.
956 */
960 /*
961 * 0 (allocated) => all zero's; 1 (free) => all one's.
962 */
964 /*
965 * If not starting on a word boundary, deal with the first
966 * (partial) word.
967 */
969 /*
970 * Compute first bit not examined.
971 */
973 /*
974 * Mask of relevant bits.
975 */
977 /*
978 * Compute difference between actual and desired value.
979 */
981 /*
982 * Different, compute first wrong bit and return.
983 */
989 }
991 /*
992 * Go on to next block if that's where the next word is
993 * and we need the next word.
994 */
996 /*
997 * If done with this block, get the next one.
998 */
1003 }
1007 /*
1008 * Go on to the next word in the buffer.
1009 */
1010 b++;
1011 }
1013 /*
1014 * Starting on a word boundary, no partial word.
1015 */
1017 }
1018 /*
1019 * Loop over whole words in buffers. When we use up one buffer
1020 * we move on to the next one.
1021 */
1023 /*
1024 * Compute difference between actual and desired value.
1025 */
1027 /*
1028 * Different, compute first wrong bit and return.
1029 */
1035 }
1037 /*
1038 * Go on to next block if that's where the next word is
1039 * and we need the next word.
1040 */
1042 /*
1043 * If done with this block, get the next one.
1044 */
1049 }
1053 /*
1054 * Go on to the next word in the buffer.
1055 */
1056 b++;
1057 }
1058 }
1059 /*
1060 * If not ending on a word boundary, deal with the last
1061 * (partial) word.
1062 */
1064 /*
1065 * Mask of relevant bits.
1066 */
1068 /*
1069 * Compute difference between actual and desired value.
1070 */
1072 /*
1073 * Different, compute first wrong bit and return.
1074 */
1082 }
1083 /*
1084 * Successful, return.
1085 */
1090 }
1092 /*
1093 * Copy and transform the summary file, given the old and new
1094 * parameters in the mount structures.
1095 */
1101 {
1113 bbno--) {
1129 }
1130 }
1132 }
1134 /*
1135 * Searching backward from start to limit, find the first block whose
1136 * allocated/free state is different from start's.
1137 */
1145 {
1160 /*
1161 * Compute and read in starting bitmap block for starting block.
1162 */
1167 }
1169 /*
1170 * Get the first word's index & point to it.
1171 */
1176 /*
1177 * Compute match value, based on the bit at start: if 1 (free)
1178 * then all-ones, else all-zeroes.
1179 */
1181 /*
1182 * If the starting position is not word-aligned, deal with the
1183 * partial word.
1184 */
1186 /*
1187 * Calculate first (leftmost) bit number to look at,
1188 * and mask for all the relevant bits in this word.
1189 */
1192 firstbit;
1193 /*
1194 * Calculate the difference between the value there
1195 * and what we're looking for.
1196 */
1198 /*
1199 * Different. Mark where we are and return.
1200 */
1205 }
1207 /*
1208 * Go on to previous block if that's where the previous word is
1209 * and we need the previous word.
1210 */
1212 /*
1213 * If done with this block, get the previous one.
1214 */
1219 }
1224 /*
1225 * Go on to the previous word in the buffer.
1226 */
1227 b--;
1228 }
1230 /*
1231 * Starting on a word boundary, no partial word.
1232 */
1234 }
1235 /*
1236 * Loop over whole words in buffers. When we use up one buffer
1237 * we move on to the previous one.
1238 */
1240 /*
1241 * Compute difference between actual and desired value.
1242 */
1244 /*
1245 * Different, mark where we are and return.
1246 */
1251 }
1253 /*
1254 * Go on to previous block if that's where the previous word is
1255 * and we need the previous word.
1256 */
1258 /*
1259 * If done with this block, get the previous one.
1260 */
1265 }
1270 /*
1271 * Go on to the previous word in the buffer.
1272 */
1273 b--;
1274 }
1275 }
1276 /*
1277 * If not ending on a word boundary, deal with the last
1278 * (partial) word.
1279 */
1281 /*
1282 * Calculate first (leftmost) bit number to look at,
1283 * and mask for all the relevant bits in this word.
1284 */
1287 /*
1288 * Compute difference between actual and desired value.
1289 */
1291 /*
1292 * Different, mark where we are and return.
1293 */
1300 }
1301 /*
1302 * No match, return that we scanned the whole area.
1303 */
1307 }
1309 /*
1310 * Searching forward from start to limit, find the first block whose
1311 * allocated/free state is different from start's.
1312 */
1320 {
1335 /*
1336 * Compute and read in starting bitmap block for starting block.
1337 */
1342 }
1344 /*
1345 * Get the first word's index & point to it.
1346 */
1351 /*
1352 * Compute match value, based on the bit at start: if 1 (free)
1353 * then all-ones, else all-zeroes.
1354 */
1356 /*
1357 * If the starting position is not word-aligned, deal with the
1358 * partial word.
1359 */
1361 /*
1362 * Calculate last (rightmost) bit number to look at,
1363 * and mask for all the relevant bits in this word.
1364 */
1367 /*
1368 * Calculate the difference between the value there
1369 * and what we're looking for.
1370 */
1372 /*
1373 * Different. Mark where we are and return.
1374 */
1379 }
1381 /*
1382 * Go on to next block if that's where the next word is
1383 * and we need the next word.
1384 */
1386 /*
1387 * If done with this block, get the previous one.
1388 */
1393 }
1397 /*
1398 * Go on to the previous word in the buffer.
1399 */
1400 b++;
1401 }
1403 /*
1404 * Starting on a word boundary, no partial word.
1405 */
1407 }
1408 /*
1409 * Loop over whole words in buffers. When we use up one buffer
1410 * we move on to the next one.
1411 */
1413 /*
1414 * Compute difference between actual and desired value.
1415 */
1417 /*
1418 * Different, mark where we are and return.
1419 */
1424 }
1426 /*
1427 * Go on to next block if that's where the next word is
1428 * and we need the next word.
1429 */
1431 /*
1432 * If done with this block, get the next one.
1433 */
1438 }
1442 /*
1443 * Go on to the next word in the buffer.
1444 */
1445 b++;
1446 }
1447 }
1448 /*
1449 * If not ending on a word boundary, deal with the last
1450 * (partial) word.
1451 */
1453 /*
1454 * Calculate mask for all the relevant bits in this word.
1455 */
1457 /*
1458 * Compute difference between actual and desired value.
1459 */
1461 /*
1462 * Different, mark where we are and return.
1463 */
1470 }
1471 /*
1472 * No match, return that we scanned the whole area.
1473 */
1477 }
1479 /*
1480 * Mark an extent specified by start and len freed.
1481 * Updates all the summary information as well as the bitmap.
1482 */
1491 {
1498 /*
1499 * Modify the bitmap to mark this extent freed.
1500 */
1504 }
1505 /*
1506 * Assume we're freeing out of the middle of an allocated extent.
1507 * We need to find the beginning and end of the extent so we can
1508 * properly update the summary.
1509 */
1513 }
1514 /*
1515 * Find the next allocated block (end of allocated extent).
1516 */
1519 /*
1520 * If there are blocks not being freed at the front of the
1521 * old extent, add summary data for them to be allocated.
1522 */
1529 }
1530 }
1531 /*
1532 * If there are blocks not being freed at the end of the
1533 * old extent, add summary data for them to be allocated.
1534 */
1541 }
1542 }
1543 /*
1544 * Increment the summary information corresponding to the entire
1545 * (new) free extent.
1546 */
1551 }
1553 /*
1554 * Read and return the summary information for a given extent size,
1555 * bitmap block combination.
1556 * Keeps track of a current summary block, so we don't keep reading
1557 * it from the buffer cache.
1558 */
1568 {
1575 /*
1576 * Compute entry number in the summary file.
1577 */
1579 /*
1580 * Compute the block number in the summary file.
1581 */
1583 /*
1584 * If we have an old buffer, and the block number matches, use that.
1585 */
1588 /*
1589 * Otherwise we have to get the buffer.
1590 */
1592 /*
1593 * If there was an old one, get rid of it first.
1594 */
1600 }
1601 /*
1602 * Remember this buffer and block for the next call.
1603 */
1607 }
1608 }
1609 /*
1610 * Point to the summary information & copy it out.
1611 */
1614 /*
1615 * Drop the buffer if we're not asked to remember it.
1616 */
1620 }
1622 /*
1623 * Set the given range of bitmap bits to the given value.
1624 * Do whatever I/O and logging is required.
1625 */
1633 {
1646 /*
1647 * Compute starting bitmap block number.
1648 */
1650 /*
1651 * Read the bitmap block, and point to its data.
1652 */
1656 }
1658 /*
1659 * Compute the starting word's address, and starting bit.
1660 */
1664 /*
1665 * 0 (allocated) => all zeroes; 1 (free) => all ones.
1666 */
1668 /*
1669 * If not starting on a word boundary, deal with the first
1670 * (partial) word.
1671 */
1673 /*
1674 * Compute first bit not changed and mask of relevant bits.
1675 */
1678 /*
1679 * Set/clear the active bits.
1680 */
1683 else
1686 /*
1687 * Go on to the next block if that's where the next word is
1688 * and we need the next word.
1689 */
1691 /*
1692 * Log the changed part of this block.
1693 * Get the next one.
1694 */
1701 }
1705 /*
1706 * Go on to the next word in the buffer
1707 */
1708 b++;
1709 }
1711 /*
1712 * Starting on a word boundary, no partial word.
1713 */
1715 }
1716 /*
1717 * Loop over whole words in buffers. When we use up one buffer
1718 * we move on to the next one.
1719 */
1721 /*
1722 * Set the word value correctly.
1723 */
1726 /*
1727 * Go on to the next block if that's where the next word is
1728 * and we need the next word.
1729 */
1731 /*
1732 * Log the changed part of this block.
1733 * Get the next one.
1734 */
1741 }
1745 /*
1746 * Go on to the next word in the buffer
1747 */
1748 b++;
1749 }
1750 }
1751 /*
1752 * If not ending on a word boundary, deal with the last
1753 * (partial) word.
1754 */
1756 /*
1757 * Compute a mask of relevant bits.
1758 */
1761 /*
1762 * Set/clear the active bits.
1763 */
1766 else
1768 b++;
1769 }
1770 /*
1771 * Log any remaining changed bytes.
1772 */
1777 }
1779 /*
1780 * Read and modify the summary information for a given extent size,
1781 * bitmap block combination.
1782 * Keeps track of a current summary block, so we don't keep reading
1783 * it from the buffer cache.
1784 */
1794 {
1801 /*
1802 * Compute entry number in the summary file.
1803 */
1805 /*
1806 * Compute the block number in the summary file.
1807 */
1809 /*
1810 * If we have an old buffer, and the block number matches, use that.
1811 */
1814 /*
1815 * Otherwise we have to get the buffer.
1816 */
1818 /*
1819 * If there was an old one, get rid of it first.
1820 */
1826 }
1827 /*
1828 * Remember this buffer and block for the next call.
1829 */
1833 }
1834 }
1835 /*
1836 * Point to the summary information, modify and log it.
1837 */
1843 }
1845 /*
1846 * Visible (exported) functions.
1847 */
1849 /*
1850 * Grow the realtime area of the filesystem.
1851 */
1852 int
1856 {
1879 /*
1880 * Initial error checking.
1881 */
1888 /*
1889 * Read in the last block of the device, make sure it exists.
1890 */
1898 /*
1899 * Calculate new parameters. These are the final values to be reached.
1900 */
1909 /*
1910 * New summary size can't be more than half the size of
1911 * the log. This prevents us from getting a log overflow,
1912 * since we'll log basically the whole summary file at once.
1913 */
1916 /*
1917 * Get the old block counts for bitmap and summary inodes.
1918 * These can't change since other growfs callers are locked out.
1919 */
1922 /*
1923 * Allocate space to the bitmap and summary files, as necessary.
1924 */
1931 /*
1932 * Allocate a new (fake) mount/sb.
1933 */
1935 /*
1936 * Loop over the bitmap blocks.
1937 * We will do everything one bitmap block at a time.
1938 * Skip the current block if it is exactly full.
1939 * This also deals with the case where there were no rtextents before.
1940 */
1944 bmbno++) {
1947 /*
1948 * Calculate new sb and mount fields for this round.
1949 */
1961 nrsumsize =
1966 /*
1967 * Start a transaction, get the log reservation.
1968 */
1974 /*
1975 * Lock out other callers by grabbing the bitmap inode lock.
1976 */
1981 /*
1982 * Update the bitmap inode's size.
1983 */
1988 /*
1989 * Get the summary inode into the transaction.
1990 */
1995 /*
1996 * Update the summary inode's size.
1997 */
2000 /*
2001 * Copy summary data from old to new sizes.
2002 * Do this when the real size (not block-aligned) changes.
2003 */
2009 }
2010 /*
2011 * Update superblock fields.
2012 */
2028 /*
2029 * Free new extent.
2030 */
2036 /*
2037 * Mark more blocks free in the superblock.
2038 */
2041 /*
2042 * Update mp values into the real mp structure.
2043 */
2051 }
2052 }
2057 /*
2058 * Free the fake mp structure.
2059 */
2063 }
2065 /*
2066 * Allocate an extent in the realtime subvolume, with the usual allocation
2067 * parameters. The length units are all in realtime extents, as is the
2068 * result block number.
2069 */
2081 {
2091 /*
2092 * If prod is set then figure out what to do to minlen and maxlen.
2093 */
2095 xfs_extlen_t i;
2104 }
2105 }
2106 /*
2107 * Lock out other callers by grabbing the bitmap inode lock.
2108 */
2113 /*
2114 * Allocate by size, or near another block, or exactly at some block.
2115 */
2131 }
2134 }
2135 /*
2136 * If it worked, update the superblock.
2137 */
2144 else
2146 }
2149 }
2151 /*
2152 * Free an extent in the realtime subvolume. Length is expressed in
2153 * realtime extents, as is the block number.
2154 */
2160 {
2168 /*
2169 * Synchronize by locking the bitmap inode.
2170 */
2174 #if defined(__KERNEL__) && defined(DEBUG)
2175 /*
2176 * Check to see that this whole range is currently allocated.
2177 */
2178 {
2184 }
2186 }
2187 #endif
2189 /*
2190 * Free the range of realtime blocks.
2191 */
2195 }
2196 /*
2197 * Mark more blocks free in the superblock.
2198 */
2200 /*
2201 * If we've now freed all the blocks, reset the file sequence
2202 * number to 0.
2203 */
2210 }
2212 }
2214 /*
2215 * Initialize realtime fields in the mount structure.
2216 */
2220 {
2233 }
2240 /*
2241 * Check that the realtime section is an ok size.
2242 */
2249 }
2259 }
2262 }
2264 /*
2265 * Get the bitmap and summary inodes into the mount structure
2266 * at mount time.
2267 */
2271 {
2287 }
2290 }
2292 /*
2293 * Pick an extent for allocation at the start of a new realtime file.
2294 * Use the sequence number stored in the atime field of the bitmap inode.
2295 * Translate this to a fraction of the rtextents, and return the product
2296 * of rtextents and the fraction.
2297 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
2298 */
2305 {
2322 }
2334 }
2339 }