| blob | 12a19138531048555651e28330ade938a1b2b36f |
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 {
94 /*
95 * Allocate space to the file, as necessary.
96 */
103 /*
104 * Reserve space & log for one extent added to the file.
105 */
108 XFS_TRANS_PERM_LOG_RES,
109 XFS_DEFAULT_PERM_LOG_COUNT)))
112 /*
113 * Lock the inode.
114 */
119 /*
120 * Allocate blocks to the bitmap file.
121 */
131 /*
132 * Free any blocks freed up in the transaction, then commit.
133 */
140 /*
141 * Now we need to clear the allocated blocks.
142 * Do this one block per transaction, to keep it simple.
143 */
149 /*
150 * Reserve log for one block zeroing.
151 */
155 /*
156 * Lock the bitmap inode.
157 */
161 /*
162 * Get a buffer for the block.
163 */
169 error_cancel:
172 }
175 /*
176 * Commit the transaction.
177 */
181 }
182 /*
183 * Go on to the next extent, if any.
184 */
186 }
188 error:
190 }
192 /*
193 * Attempt to allocate an extent minlen<=len<=maxlen starting from
194 * bitmap block bbno. If we don't get maxlen then use prod to trim
195 * the length, if given. Returns error; returns starting block in *rtblock.
196 * The lengths are all in rtextents.
197 */
211 {
220 /*
221 * Loop over all the extents starting in this bitmap block,
222 * looking for one that's long enough.
223 */
227 i++) {
228 /*
229 * See if there's a free extent of maxlen starting at i.
230 * If it's not so then next will contain the first non-free.
231 */
235 }
237 /*
238 * i for maxlen is all free, allocate and return that.
239 */
241 rsb);
244 }
248 }
249 /*
250 * In the case where we have a variable-sized allocation
251 * request, figure out how big this free piece is,
252 * and if it's big enough for the minimum, and the best
253 * so far, remember it.
254 */
262 }
263 }
264 /*
265 * If not done yet, find the start of the next free space.
266 */
271 }
274 }
275 /*
276 * Searched the whole thing & didn't find a maxlen free extent.
277 */
281 /*
282 * If size should be a multiple of prod, make that so.
283 */
286 /*
287 * Allocate besti for bestlen & return that.
288 */
292 }
296 }
297 /*
298 * Allocation failed. Set *nextp to the next block to try.
299 */
303 }
305 /*
306 * Allocate an extent of length minlen<=len<=maxlen, starting at block
307 * bno. If we don't get maxlen then use prod to trim the length, if given.
308 * Returns error; returns starting block in *rtblock.
309 * The lengths are all in rtextents.
310 */
323 {
330 /*
331 * Check if the range in question (for maxlen) is free.
332 */
336 }
338 /*
339 * If it is, allocate it and return success.
340 */
344 }
348 }
349 /*
350 * If not, allocate what there is, if it's at least minlen.
351 */
354 /*
355 * Failed, return failure status.
356 */
359 }
360 /*
361 * Trim off tail of extent, if prod is specified.
362 */
366 /*
367 * Now we can't do it, return failure status.
368 */
371 }
372 }
373 /*
374 * Allocate what we can and return it.
375 */
379 }
383 }
385 /*
386 * Allocate an extent of length minlen<=len<=maxlen, starting as near
387 * to bno as possible. If we don't get maxlen then use prod to trim
388 * the length, if given. The lengths are all in rtextents.
389 */
402 {
413 /*
414 * If the block number given is off the end, silently set it to
415 * the last block.
416 */
419 /*
420 * Try the exact allocation first.
421 */
426 }
427 /*
428 * If the exact allocation worked, return that.
429 */
433 }
438 /*
439 * Loop over all bitmap blocks (bbno + i is current block).
440 */
442 /*
443 * Get summary information of extents of all useful levels
444 * starting in this bitmap block.
445 */
450 }
451 /*
452 * If there are any useful extents starting here, try
453 * allocating one.
454 */
456 /*
457 * On the positive side of the starting location.
458 */
460 /*
461 * Try to allocate an extent starting in
462 * this block.
463 */
469 }
470 /*
471 * If it worked, return it.
472 */
476 }
477 }
478 /*
479 * On the negative side of the starting location.
480 */
482 /*
483 * Loop backwards through the bitmap blocks from
484 * the starting point-1 up to where we are now.
485 * There should be an extent which ends in this
486 * bitmap block and is long enough.
487 */
489 /*
490 * Grab the summary information for
491 * this bitmap block.
492 */
498 }
499 /*
500 * If there's no extent given in the
501 * summary that means the extent we
502 * found must carry over from an
503 * earlier block. If there is an
504 * extent given, we've already tried
505 * that allocation, don't do it again.
506 */
514 }
515 /*
516 * If it works, return the extent.
517 */
521 }
522 }
523 /*
524 * There weren't intervening bitmap blocks
525 * with a long enough extent, or the
526 * allocation didn't work for some reason
527 * (i.e. it's a little * too short).
528 * Try to allocate from the summary block
529 * that we found.
530 */
536 }
537 /*
538 * If it works, return the extent.
539 */
543 }
544 }
545 }
546 /*
547 * Loop control. If we were on the positive side, and there's
548 * still more blocks on the negative side, go there.
549 */
552 /*
553 * If positive, and no more negative, but there are more
554 * positive, go there.
555 */
557 i++;
558 /*
559 * If negative or 0 (just started), and there are positive
560 * blocks to go, go there. The 0 case moves to block 1.
561 */
564 /*
565 * If negative or 0 and there are more negative blocks,
566 * go there.
567 */
569 i--;
570 /*
571 * Must be done. Return failure.
572 */
573 else
575 }
578 }
580 /*
581 * Allocate an extent of length minlen<=len<=maxlen, with no position
582 * specified. If we don't get maxlen then use prod to trim
583 * the length, if given. The lengths are all in rtextents.
584 */
596 {
607 /*
608 * Loop over all the levels starting with maxlen.
609 * At each level, look at all the bitmap blocks, to see if there
610 * are extents starting there that are long enough (>= maxlen).
611 * Note, only on the initial level can the allocation fail if
612 * the summary says there's an extent.
613 */
615 /*
616 * Loop over all the bitmap blocks.
617 */
619 /*
620 * Get the summary for this level/block.
621 */
626 }
627 /*
628 * Nothing there, on to the next block.
629 */
632 /*
633 * Try allocating the extent.
634 */
639 }
640 /*
641 * If it worked, return that.
642 */
646 }
647 /*
648 * If the "next block to try" returned from the
649 * allocator is beyond the next bitmap block,
650 * skip to that bitmap block.
651 */
654 }
655 }
656 /*
657 * Didn't find any maxlen blocks. Try smaller ones, unless
658 * we're asking for a fixed size extent.
659 */
663 }
667 /*
668 * Loop over sizes, from maxlen down to minlen.
669 * This time, when we do the allocations, allow smaller ones
670 * to succeed.
671 */
673 /*
674 * Loop over all the bitmap blocks, try an allocation
675 * starting in that block.
676 */
678 /*
679 * Get the summary information for this level/block.
680 */
685 }
686 /*
687 * If nothing there, go on to next.
688 */
691 /*
692 * Try the allocation. Make sure the specified
693 * minlen/maxlen are in the possible range for
694 * this summary level.
695 */
702 }
703 /*
704 * If it worked, return that extent.
705 */
709 }
710 /*
711 * If the "next block to try" returned from the
712 * allocator is beyond the next bitmap block,
713 * skip to that bitmap block.
714 */
717 }
718 }
719 /*
720 * Got nothing, return failure.
721 */
724 }
726 /*
727 * Mark an extent specified by start and len allocated.
728 * Updates all the summary information as well as the bitmap.
729 */
738 {
745 /*
746 * Assume we're allocating out of the middle of a free extent.
747 * We need to find the beginning and end of the extent so we can
748 * properly update the summary.
749 */
753 }
754 /*
755 * Find the next allocated block (end of free extent).
756 */
761 }
762 /*
763 * Decrement the summary information corresponding to the entire
764 * (old) free extent.
765 */
771 }
772 /*
773 * If there are blocks not being allocated at the front of the
774 * old extent, add summary data for them to be free.
775 */
782 }
783 }
784 /*
785 * If there are blocks not being allocated at the end of the
786 * old extent, add summary data for them to be free.
787 */
794 }
795 }
796 /*
797 * Modify the bitmap to mark this extent allocated.
798 */
801 }
803 /*
804 * Return whether there are any free extents in the size range given
805 * by low and high, for the bitmap block bbno.
806 */
817 {
822 /*
823 * Loop over logs of extent sizes. Order is irrelevant.
824 */
826 /*
827 * Get one summary datum.
828 */
832 }
833 /*
834 * If there are any, return success.
835 */
839 }
840 }
841 /*
842 * Found nothing, return failure.
843 */
846 }
848 /*
849 * Get a buffer for the bitmap or summary file block specified.
850 * The buffer is returned read and locked.
851 */
859 {
867 /*
868 * Map from the file offset (block) and inode number to the
869 * file system block.
870 */
874 }
876 /*
877 * Convert to disk address for buffer cache.
878 */
880 /*
881 * Read the buffer.
882 */
887 }
891 }
893 #ifdef DEBUG
894 /*
895 * Check that the given extent (block range) is allocated already.
896 */
904 {
908 }
909 #endif
911 /*
912 * Check that the given range is either all allocated (val = 0) or
913 * all free (val = 1).
914 */
924 {
937 /*
938 * Compute starting bitmap block number
939 */
941 /*
942 * Read the bitmap block.
943 */
947 }
949 /*
950 * Compute the starting word's address, and starting bit.
951 */
955 /*
956 * 0 (allocated) => all zero's; 1 (free) => all one's.
957 */
959 /*
960 * If not starting on a word boundary, deal with the first
961 * (partial) word.
962 */
964 /*
965 * Compute first bit not examined.
966 */
968 /*
969 * Mask of relevant bits.
970 */
972 /*
973 * Compute difference between actual and desired value.
974 */
976 /*
977 * Different, compute first wrong bit and return.
978 */
984 }
986 /*
987 * Go on to next block if that's where the next word is
988 * and we need the next word.
989 */
991 /*
992 * If done with this block, get the next one.
993 */
998 }
1002 /*
1003 * Go on to the next word in the buffer.
1004 */
1005 b++;
1006 }
1008 /*
1009 * Starting on a word boundary, no partial word.
1010 */
1012 }
1013 /*
1014 * Loop over whole words in buffers. When we use up one buffer
1015 * we move on to the next one.
1016 */
1018 /*
1019 * Compute difference between actual and desired value.
1020 */
1022 /*
1023 * Different, compute first wrong bit and return.
1024 */
1030 }
1032 /*
1033 * Go on to next block if that's where the next word is
1034 * and we need the next word.
1035 */
1037 /*
1038 * If done with this block, get the next one.
1039 */
1044 }
1048 /*
1049 * Go on to the next word in the buffer.
1050 */
1051 b++;
1052 }
1053 }
1054 /*
1055 * If not ending on a word boundary, deal with the last
1056 * (partial) word.
1057 */
1059 /*
1060 * Mask of relevant bits.
1061 */
1063 /*
1064 * Compute difference between actual and desired value.
1065 */
1067 /*
1068 * Different, compute first wrong bit and return.
1069 */
1077 }
1078 /*
1079 * Successful, return.
1080 */
1085 }
1087 /*
1088 * Copy and transform the summary file, given the old and new
1089 * parameters in the mount structures.
1090 */
1096 {
1108 bbno--) {
1124 }
1125 }
1127 }
1129 /*
1130 * Searching backward from start to limit, find the first block whose
1131 * allocated/free state is different from start's.
1132 */
1140 {
1155 /*
1156 * Compute and read in starting bitmap block for starting block.
1157 */
1162 }
1164 /*
1165 * Get the first word's index & point to it.
1166 */
1171 /*
1172 * Compute match value, based on the bit at start: if 1 (free)
1173 * then all-ones, else all-zeroes.
1174 */
1176 /*
1177 * If the starting position is not word-aligned, deal with the
1178 * partial word.
1179 */
1181 /*
1182 * Calculate first (leftmost) bit number to look at,
1183 * and mask for all the relevant bits in this word.
1184 */
1187 firstbit;
1188 /*
1189 * Calculate the difference between the value there
1190 * and what we're looking for.
1191 */
1193 /*
1194 * Different. Mark where we are and return.
1195 */
1200 }
1202 /*
1203 * Go on to previous block if that's where the previous word is
1204 * and we need the previous word.
1205 */
1207 /*
1208 * If done with this block, get the previous one.
1209 */
1214 }
1219 /*
1220 * Go on to the previous word in the buffer.
1221 */
1222 b--;
1223 }
1225 /*
1226 * Starting on a word boundary, no partial word.
1227 */
1229 }
1230 /*
1231 * Loop over whole words in buffers. When we use up one buffer
1232 * we move on to the previous one.
1233 */
1235 /*
1236 * Compute difference between actual and desired value.
1237 */
1239 /*
1240 * Different, mark where we are and return.
1241 */
1246 }
1248 /*
1249 * Go on to previous block if that's where the previous word is
1250 * and we need the previous word.
1251 */
1253 /*
1254 * If done with this block, get the previous one.
1255 */
1260 }
1265 /*
1266 * Go on to the previous word in the buffer.
1267 */
1268 b--;
1269 }
1270 }
1271 /*
1272 * If not ending on a word boundary, deal with the last
1273 * (partial) word.
1274 */
1276 /*
1277 * Calculate first (leftmost) bit number to look at,
1278 * and mask for all the relevant bits in this word.
1279 */
1282 /*
1283 * Compute difference between actual and desired value.
1284 */
1286 /*
1287 * Different, mark where we are and return.
1288 */
1295 }
1296 /*
1297 * No match, return that we scanned the whole area.
1298 */
1302 }
1304 /*
1305 * Searching forward from start to limit, find the first block whose
1306 * allocated/free state is different from start's.
1307 */
1315 {
1330 /*
1331 * Compute and read in starting bitmap block for starting block.
1332 */
1337 }
1339 /*
1340 * Get the first word's index & point to it.
1341 */
1346 /*
1347 * Compute match value, based on the bit at start: if 1 (free)
1348 * then all-ones, else all-zeroes.
1349 */
1351 /*
1352 * If the starting position is not word-aligned, deal with the
1353 * partial word.
1354 */
1356 /*
1357 * Calculate last (rightmost) bit number to look at,
1358 * and mask for all the relevant bits in this word.
1359 */
1362 /*
1363 * Calculate the difference between the value there
1364 * and what we're looking for.
1365 */
1367 /*
1368 * Different. Mark where we are and return.
1369 */
1374 }
1376 /*
1377 * Go on to next block if that's where the next word is
1378 * and we need the next word.
1379 */
1381 /*
1382 * If done with this block, get the previous one.
1383 */
1388 }
1392 /*
1393 * Go on to the previous word in the buffer.
1394 */
1395 b++;
1396 }
1398 /*
1399 * Starting on a word boundary, no partial word.
1400 */
1402 }
1403 /*
1404 * Loop over whole words in buffers. When we use up one buffer
1405 * we move on to the next one.
1406 */
1408 /*
1409 * Compute difference between actual and desired value.
1410 */
1412 /*
1413 * Different, mark where we are and return.
1414 */
1419 }
1421 /*
1422 * Go on to next block if that's where the next word is
1423 * and we need the next word.
1424 */
1426 /*
1427 * If done with this block, get the next one.
1428 */
1433 }
1437 /*
1438 * Go on to the next word in the buffer.
1439 */
1440 b++;
1441 }
1442 }
1443 /*
1444 * If not ending on a word boundary, deal with the last
1445 * (partial) word.
1446 */
1448 /*
1449 * Calculate mask for all the relevant bits in this word.
1450 */
1452 /*
1453 * Compute difference between actual and desired value.
1454 */
1456 /*
1457 * Different, mark where we are and return.
1458 */
1465 }
1466 /*
1467 * No match, return that we scanned the whole area.
1468 */
1472 }
1474 /*
1475 * Mark an extent specified by start and len freed.
1476 * Updates all the summary information as well as the bitmap.
1477 */
1486 {
1493 /*
1494 * Modify the bitmap to mark this extent freed.
1495 */
1499 }
1500 /*
1501 * Assume we're freeing out of the middle of an allocated extent.
1502 * We need to find the beginning and end of the extent so we can
1503 * properly update the summary.
1504 */
1508 }
1509 /*
1510 * Find the next allocated block (end of allocated extent).
1511 */
1516 /*
1517 * If there are blocks not being freed at the front of the
1518 * old extent, add summary data for them to be allocated.
1519 */
1526 }
1527 }
1528 /*
1529 * If there are blocks not being freed at the end of the
1530 * old extent, add summary data for them to be allocated.
1531 */
1538 }
1539 }
1540 /*
1541 * Increment the summary information corresponding to the entire
1542 * (new) free extent.
1543 */
1548 }
1550 /*
1551 * Read and return the summary information for a given extent size,
1552 * bitmap block combination.
1553 * Keeps track of a current summary block, so we don't keep reading
1554 * it from the buffer cache.
1555 */
1565 {
1572 /*
1573 * Compute entry number in the summary file.
1574 */
1576 /*
1577 * Compute the block number in the summary file.
1578 */
1580 /*
1581 * If we have an old buffer, and the block number matches, use that.
1582 */
1585 /*
1586 * Otherwise we have to get the buffer.
1587 */
1589 /*
1590 * If there was an old one, get rid of it first.
1591 */
1597 }
1598 /*
1599 * Remember this buffer and block for the next call.
1600 */
1604 }
1605 }
1606 /*
1607 * Point to the summary information & copy it out.
1608 */
1611 /*
1612 * Drop the buffer if we're not asked to remember it.
1613 */
1617 }
1619 /*
1620 * Set the given range of bitmap bits to the given value.
1621 * Do whatever I/O and logging is required.
1622 */
1630 {
1643 /*
1644 * Compute starting bitmap block number.
1645 */
1647 /*
1648 * Read the bitmap block, and point to its data.
1649 */
1653 }
1655 /*
1656 * Compute the starting word's address, and starting bit.
1657 */
1661 /*
1662 * 0 (allocated) => all zeroes; 1 (free) => all ones.
1663 */
1665 /*
1666 * If not starting on a word boundary, deal with the first
1667 * (partial) word.
1668 */
1670 /*
1671 * Compute first bit not changed and mask of relevant bits.
1672 */
1675 /*
1676 * Set/clear the active bits.
1677 */
1680 else
1683 /*
1684 * Go on to the next block if that's where the next word is
1685 * and we need the next word.
1686 */
1688 /*
1689 * Log the changed part of this block.
1690 * Get the next one.
1691 */
1698 }
1702 /*
1703 * Go on to the next word in the buffer
1704 */
1705 b++;
1706 }
1708 /*
1709 * Starting on a word boundary, no partial word.
1710 */
1712 }
1713 /*
1714 * Loop over whole words in buffers. When we use up one buffer
1715 * we move on to the next one.
1716 */
1718 /*
1719 * Set the word value correctly.
1720 */
1723 /*
1724 * Go on to the next block if that's where the next word is
1725 * and we need the next word.
1726 */
1728 /*
1729 * Log the changed part of this block.
1730 * Get the next one.
1731 */
1738 }
1742 /*
1743 * Go on to the next word in the buffer
1744 */
1745 b++;
1746 }
1747 }
1748 /*
1749 * If not ending on a word boundary, deal with the last
1750 * (partial) word.
1751 */
1753 /*
1754 * Compute a mask of relevant bits.
1755 */
1758 /*
1759 * Set/clear the active bits.
1760 */
1763 else
1765 b++;
1766 }
1767 /*
1768 * Log any remaining changed bytes.
1769 */
1774 }
1776 /*
1777 * Read and modify the summary information for a given extent size,
1778 * bitmap block combination.
1779 * Keeps track of a current summary block, so we don't keep reading
1780 * it from the buffer cache.
1781 */
1791 {
1798 /*
1799 * Compute entry number in the summary file.
1800 */
1802 /*
1803 * Compute the block number in the summary file.
1804 */
1806 /*
1807 * If we have an old buffer, and the block number matches, use that.
1808 */
1811 /*
1812 * Otherwise we have to get the buffer.
1813 */
1815 /*
1816 * If there was an old one, get rid of it first.
1817 */
1823 }
1824 /*
1825 * Remember this buffer and block for the next call.
1826 */
1830 }
1831 }
1832 /*
1833 * Point to the summary information, modify and log it.
1834 */
1840 }
1842 /*
1843 * Visible (exported) functions.
1844 */
1846 /*
1847 * Grow the realtime area of the filesystem.
1848 */
1849 int
1853 {
1873 /*
1874 * Initial error checking.
1875 */
1884 /*
1885 * Read in the last block of the device, make sure it exists.
1886 */
1894 /*
1895 * Calculate new parameters. These are the final values to be reached.
1896 */
1905 /*
1906 * New summary size can't be more than half the size of
1907 * the log. This prevents us from getting a log overflow,
1908 * since we'll log basically the whole summary file at once.
1909 */
1912 /*
1913 * Get the old block counts for bitmap and summary inodes.
1914 * These can't change since other growfs callers are locked out.
1915 */
1918 /*
1919 * Allocate space to the bitmap and summary files, as necessary.
1920 */
1927 /*
1928 * Allocate a new (fake) mount/sb.
1929 */
1931 /*
1932 * Loop over the bitmap blocks.
1933 * We will do everything one bitmap block at a time.
1934 * Skip the current block if it is exactly full.
1935 * This also deals with the case where there were no rtextents before.
1936 */
1940 bmbno++) {
1946 /*
1947 * Calculate new sb and mount fields for this round.
1948 */
1960 nrsumsize =
1965 /*
1966 * Start a transaction, get the log reservation.
1967 */
1972 /*
1973 * Lock out other callers by grabbing the bitmap inode lock.
1974 */
1979 /*
1980 * Update the bitmap inode's size.
1981 */
1986 /*
1987 * Get the summary inode into the transaction.
1988 */
1993 /*
1994 * Update the summary inode's size.
1995 */
1998 /*
1999 * Copy summary data from old to new sizes.
2000 * Do this when the real size (not block-aligned) changes.
2001 */
2007 }
2008 /*
2009 * Update superblock fields.
2010 */
2026 /*
2027 * Free new extent.
2028 */
2033 error_cancel:
2036 }
2037 /*
2038 * Mark more blocks free in the superblock.
2039 */
2042 /*
2043 * Update mp values into the real mp structure.
2044 */
2051 }
2053 /*
2054 * Free the fake mp structure.
2055 */
2059 }
2061 /*
2062 * Allocate an extent in the realtime subvolume, with the usual allocation
2063 * parameters. The length units are all in realtime extents, as is the
2064 * result block number.
2065 */
2077 {
2087 /*
2088 * If prod is set then figure out what to do to minlen and maxlen.
2089 */
2091 xfs_extlen_t i;
2100 }
2101 }
2102 /*
2103 * Lock out other callers by grabbing the bitmap inode lock.
2104 */
2109 /*
2110 * Allocate by size, or near another block, or exactly at some block.
2111 */
2127 }
2130 }
2131 /*
2132 * If it worked, update the superblock.
2133 */
2140 else
2142 }
2145 }
2147 /*
2148 * Free an extent in the realtime subvolume. Length is expressed in
2149 * realtime extents, as is the block number.
2150 */
2156 {
2164 /*
2165 * Synchronize by locking the bitmap inode.
2166 */
2170 #if defined(__KERNEL__) && defined(DEBUG)
2171 /*
2172 * Check to see that this whole range is currently allocated.
2173 */
2174 {
2180 }
2182 }
2183 #endif
2185 /*
2186 * Free the range of realtime blocks.
2187 */
2191 }
2192 /*
2193 * Mark more blocks free in the superblock.
2194 */
2196 /*
2197 * If we've now freed all the blocks, reset the file sequence
2198 * number to 0.
2199 */
2206 }
2208 }
2210 /*
2211 * Initialize realtime fields in the mount structure.
2212 */
2216 {
2228 }
2235 /*
2236 * Check that the realtime section is an ok size.
2237 */
2244 }
2251 }
2254 }
2256 /*
2257 * Get the bitmap and summary inodes into the mount structure
2258 * at mount time.
2259 */
2263 {
2279 }
2282 }
2284 void
2287 {
2292 }
2294 /*
2295 * Pick an extent for allocation at the start of a new realtime file.
2296 * Use the sequence number stored in the atime field of the bitmap inode.
2297 * Translate this to a fraction of the rtextents, and return the product
2298 * of rtextents and the fraction.
2299 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
2300 */
2307 {
2324 }
2336 }
2341 }