| blob | a2d32ce335aa681c3beab111f4c844873353f6af |
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 */
51 /*
52 * Prototypes for internal functions.
53 */
73 /*
74 * Internal functions.
75 */
77 /*
78 * Allocate space to the bitmap or summary file, and zero it, for growfs.
79 */
86 {
100 /*
101 * Allocate space to the file, as necessary.
102 */
109 /*
110 * Reserve space & log for one extent added to the file.
111 */
114 XFS_TRANS_PERM_LOG_RES,
115 XFS_DEFAULT_PERM_LOG_COUNT)))
118 /*
119 * Lock the inode.
120 */
125 /*
126 * Allocate blocks to the bitmap file.
127 */
137 /*
138 * Free any blocks freed up in the transaction, then commit.
139 */
146 /*
147 * Now we need to clear the allocated blocks.
148 * Do this one block per transaction, to keep it simple.
149 */
155 /*
156 * Reserve log for one block zeroing.
157 */
161 /*
162 * Lock the bitmap inode.
163 */
167 /*
168 * Get a buffer for the block.
169 */
175 error_cancel:
178 }
181 /*
182 * Commit the transaction.
183 */
187 }
188 /*
189 * Go on to the next extent, if any.
190 */
192 }
194 error:
196 }
198 /*
199 * Attempt to allocate an extent minlen<=len<=maxlen starting from
200 * bitmap block bbno. If we don't get maxlen then use prod to trim
201 * the length, if given. Returns error; returns starting block in *rtblock.
202 * The lengths are all in rtextents.
203 */
217 {
226 /*
227 * Loop over all the extents starting in this bitmap block,
228 * looking for one that's long enough.
229 */
233 i++) {
234 /*
235 * See if there's a free extent of maxlen starting at i.
236 * If it's not so then next will contain the first non-free.
237 */
241 }
243 /*
244 * i for maxlen is all free, allocate and return that.
245 */
247 rsb);
250 }
254 }
255 /*
256 * In the case where we have a variable-sized allocation
257 * request, figure out how big this free piece is,
258 * and if it's big enough for the minimum, and the best
259 * so far, remember it.
260 */
268 }
269 }
270 /*
271 * If not done yet, find the start of the next free space.
272 */
277 }
280 }
281 /*
282 * Searched the whole thing & didn't find a maxlen free extent.
283 */
287 /*
288 * If size should be a multiple of prod, make that so.
289 */
292 /*
293 * Allocate besti for bestlen & return that.
294 */
298 }
302 }
303 /*
304 * Allocation failed. Set *nextp to the next block to try.
305 */
309 }
311 /*
312 * Allocate an extent of length minlen<=len<=maxlen, starting at block
313 * bno. If we don't get maxlen then use prod to trim the length, if given.
314 * Returns error; returns starting block in *rtblock.
315 * The lengths are all in rtextents.
316 */
329 {
336 /*
337 * Check if the range in question (for maxlen) is free.
338 */
342 }
344 /*
345 * If it is, allocate it and return success.
346 */
350 }
354 }
355 /*
356 * If not, allocate what there is, if it's at least minlen.
357 */
360 /*
361 * Failed, return failure status.
362 */
365 }
366 /*
367 * Trim off tail of extent, if prod is specified.
368 */
372 /*
373 * Now we can't do it, return failure status.
374 */
377 }
378 }
379 /*
380 * Allocate what we can and return it.
381 */
385 }
389 }
391 /*
392 * Allocate an extent of length minlen<=len<=maxlen, starting as near
393 * to bno as possible. If we don't get maxlen then use prod to trim
394 * the length, if given. The lengths are all in rtextents.
395 */
408 {
419 /*
420 * If the block number given is off the end, silently set it to
421 * the last block.
422 */
425 /*
426 * Try the exact allocation first.
427 */
432 }
433 /*
434 * If the exact allocation worked, return that.
435 */
439 }
444 /*
445 * Loop over all bitmap blocks (bbno + i is current block).
446 */
448 /*
449 * Get summary information of extents of all useful levels
450 * starting in this bitmap block.
451 */
456 }
457 /*
458 * If there are any useful extents starting here, try
459 * allocating one.
460 */
462 /*
463 * On the positive side of the starting location.
464 */
466 /*
467 * Try to allocate an extent starting in
468 * this block.
469 */
475 }
476 /*
477 * If it worked, return it.
478 */
482 }
483 }
484 /*
485 * On the negative side of the starting location.
486 */
488 /*
489 * Loop backwards through the bitmap blocks from
490 * the starting point-1 up to where we are now.
491 * There should be an extent which ends in this
492 * bitmap block and is long enough.
493 */
495 /*
496 * Grab the summary information for
497 * this bitmap block.
498 */
504 }
505 /*
506 * If there's no extent given in the
507 * summary that means the extent we
508 * found must carry over from an
509 * earlier block. If there is an
510 * extent given, we've already tried
511 * that allocation, don't do it again.
512 */
520 }
521 /*
522 * If it works, return the extent.
523 */
527 }
528 }
529 /*
530 * There weren't intervening bitmap blocks
531 * with a long enough extent, or the
532 * allocation didn't work for some reason
533 * (i.e. it's a little * too short).
534 * Try to allocate from the summary block
535 * that we found.
536 */
542 }
543 /*
544 * If it works, return the extent.
545 */
549 }
550 }
551 }
552 /*
553 * Loop control. If we were on the positive side, and there's
554 * still more blocks on the negative side, go there.
555 */
558 /*
559 * If positive, and no more negative, but there are more
560 * positive, go there.
561 */
563 i++;
564 /*
565 * If negative or 0 (just started), and there are positive
566 * blocks to go, go there. The 0 case moves to block 1.
567 */
570 /*
571 * If negative or 0 and there are more negative blocks,
572 * go there.
573 */
575 i--;
576 /*
577 * Must be done. Return failure.
578 */
579 else
581 }
584 }
586 /*
587 * Allocate an extent of length minlen<=len<=maxlen, with no position
588 * specified. If we don't get maxlen then use prod to trim
589 * the length, if given. The lengths are all in rtextents.
590 */
602 {
613 /*
614 * Loop over all the levels starting with maxlen.
615 * At each level, look at all the bitmap blocks, to see if there
616 * are extents starting there that are long enough (>= maxlen).
617 * Note, only on the initial level can the allocation fail if
618 * the summary says there's an extent.
619 */
621 /*
622 * Loop over all the bitmap blocks.
623 */
625 /*
626 * Get the summary for this level/block.
627 */
632 }
633 /*
634 * Nothing there, on to the next block.
635 */
638 /*
639 * Try allocating the extent.
640 */
645 }
646 /*
647 * If it worked, return that.
648 */
652 }
653 /*
654 * If the "next block to try" returned from the
655 * allocator is beyond the next bitmap block,
656 * skip to that bitmap block.
657 */
660 }
661 }
662 /*
663 * Didn't find any maxlen blocks. Try smaller ones, unless
664 * we're asking for a fixed size extent.
665 */
669 }
673 /*
674 * Loop over sizes, from maxlen down to minlen.
675 * This time, when we do the allocations, allow smaller ones
676 * to succeed.
677 */
679 /*
680 * Loop over all the bitmap blocks, try an allocation
681 * starting in that block.
682 */
684 /*
685 * Get the summary information for this level/block.
686 */
691 }
692 /*
693 * If nothing there, go on to next.
694 */
697 /*
698 * Try the allocation. Make sure the specified
699 * minlen/maxlen are in the possible range for
700 * this summary level.
701 */
708 }
709 /*
710 * If it worked, return that extent.
711 */
715 }
716 /*
717 * If the "next block to try" returned from the
718 * allocator is beyond the next bitmap block,
719 * skip to that bitmap block.
720 */
723 }
724 }
725 /*
726 * Got nothing, return failure.
727 */
730 }
732 /*
733 * Mark an extent specified by start and len allocated.
734 * Updates all the summary information as well as the bitmap.
735 */
744 {
751 /*
752 * Assume we're allocating out of the middle of a free extent.
753 * We need to find the beginning and end of the extent so we can
754 * properly update the summary.
755 */
759 }
760 /*
761 * Find the next allocated block (end of free extent).
762 */
767 }
768 /*
769 * Decrement the summary information corresponding to the entire
770 * (old) free extent.
771 */
777 }
778 /*
779 * If there are blocks not being allocated at the front of the
780 * old extent, add summary data for them to be free.
781 */
788 }
789 }
790 /*
791 * If there are blocks not being allocated at the end of the
792 * old extent, add summary data for them to be free.
793 */
800 }
801 }
802 /*
803 * Modify the bitmap to mark this extent allocated.
804 */
807 }
809 /*
810 * Return whether there are any free extents in the size range given
811 * by low and high, for the bitmap block bbno.
812 */
823 {
828 /*
829 * Loop over logs of extent sizes. Order is irrelevant.
830 */
832 /*
833 * Get one summary datum.
834 */
838 }
839 /*
840 * If there are any, return success.
841 */
845 }
846 }
847 /*
848 * Found nothing, return failure.
849 */
852 }
854 /*
855 * Get a buffer for the bitmap or summary file block specified.
856 * The buffer is returned read and locked.
857 */
865 {
873 /*
874 * Map from the file offset (block) and inode number to the
875 * file system block.
876 */
880 }
882 /*
883 * Convert to disk address for buffer cache.
884 */
886 /*
887 * Read the buffer.
888 */
893 }
897 }
899 #ifdef DEBUG
900 /*
901 * Check that the given extent (block range) is allocated already.
902 */
910 {
914 }
915 #endif
917 /*
918 * Check that the given range is either all allocated (val = 0) or
919 * all free (val = 1).
920 */
930 {
943 /*
944 * Compute starting bitmap block number
945 */
947 /*
948 * Read the bitmap block.
949 */
953 }
955 /*
956 * Compute the starting word's address, and starting bit.
957 */
961 /*
962 * 0 (allocated) => all zero's; 1 (free) => all one's.
963 */
965 /*
966 * If not starting on a word boundary, deal with the first
967 * (partial) word.
968 */
970 /*
971 * Compute first bit not examined.
972 */
974 /*
975 * Mask of relevant bits.
976 */
978 /*
979 * Compute difference between actual and desired value.
980 */
982 /*
983 * Different, compute first wrong bit and return.
984 */
990 }
992 /*
993 * Go on to next block if that's where the next word is
994 * and we need the next word.
995 */
997 /*
998 * If done with this block, get the next one.
999 */
1004 }
1008 /*
1009 * Go on to the next word in the buffer.
1010 */
1011 b++;
1012 }
1014 /*
1015 * Starting on a word boundary, no partial word.
1016 */
1018 }
1019 /*
1020 * Loop over whole words in buffers. When we use up one buffer
1021 * we move on to the next one.
1022 */
1024 /*
1025 * Compute difference between actual and desired value.
1026 */
1028 /*
1029 * Different, compute first wrong bit and return.
1030 */
1036 }
1038 /*
1039 * Go on to next block if that's where the next word is
1040 * and we need the next word.
1041 */
1043 /*
1044 * If done with this block, get the next one.
1045 */
1050 }
1054 /*
1055 * Go on to the next word in the buffer.
1056 */
1057 b++;
1058 }
1059 }
1060 /*
1061 * If not ending on a word boundary, deal with the last
1062 * (partial) word.
1063 */
1065 /*
1066 * Mask of relevant bits.
1067 */
1069 /*
1070 * Compute difference between actual and desired value.
1071 */
1073 /*
1074 * Different, compute first wrong bit and return.
1075 */
1083 }
1084 /*
1085 * Successful, return.
1086 */
1091 }
1093 /*
1094 * Copy and transform the summary file, given the old and new
1095 * parameters in the mount structures.
1096 */
1102 {
1114 bbno--) {
1130 }
1131 }
1133 }
1135 /*
1136 * Searching backward from start to limit, find the first block whose
1137 * allocated/free state is different from start's.
1138 */
1146 {
1161 /*
1162 * Compute and read in starting bitmap block for starting block.
1163 */
1168 }
1170 /*
1171 * Get the first word's index & point to it.
1172 */
1177 /*
1178 * Compute match value, based on the bit at start: if 1 (free)
1179 * then all-ones, else all-zeroes.
1180 */
1182 /*
1183 * If the starting position is not word-aligned, deal with the
1184 * partial word.
1185 */
1187 /*
1188 * Calculate first (leftmost) bit number to look at,
1189 * and mask for all the relevant bits in this word.
1190 */
1193 firstbit;
1194 /*
1195 * Calculate the difference between the value there
1196 * and what we're looking for.
1197 */
1199 /*
1200 * Different. Mark where we are and return.
1201 */
1206 }
1208 /*
1209 * Go on to previous block if that's where the previous word is
1210 * and we need the previous word.
1211 */
1213 /*
1214 * If done with this block, get the previous one.
1215 */
1220 }
1225 /*
1226 * Go on to the previous word in the buffer.
1227 */
1228 b--;
1229 }
1231 /*
1232 * Starting on a word boundary, no partial word.
1233 */
1235 }
1236 /*
1237 * Loop over whole words in buffers. When we use up one buffer
1238 * we move on to the previous one.
1239 */
1241 /*
1242 * Compute difference between actual and desired value.
1243 */
1245 /*
1246 * Different, mark where we are and return.
1247 */
1252 }
1254 /*
1255 * Go on to previous block if that's where the previous word is
1256 * and we need the previous word.
1257 */
1259 /*
1260 * If done with this block, get the previous one.
1261 */
1266 }
1271 /*
1272 * Go on to the previous word in the buffer.
1273 */
1274 b--;
1275 }
1276 }
1277 /*
1278 * If not ending on a word boundary, deal with the last
1279 * (partial) word.
1280 */
1282 /*
1283 * Calculate first (leftmost) bit number to look at,
1284 * and mask for all the relevant bits in this word.
1285 */
1288 /*
1289 * Compute difference between actual and desired value.
1290 */
1292 /*
1293 * Different, mark where we are and return.
1294 */
1301 }
1302 /*
1303 * No match, return that we scanned the whole area.
1304 */
1308 }
1310 /*
1311 * Searching forward from start to limit, find the first block whose
1312 * allocated/free state is different from start's.
1313 */
1321 {
1336 /*
1337 * Compute and read in starting bitmap block for starting block.
1338 */
1343 }
1345 /*
1346 * Get the first word's index & point to it.
1347 */
1352 /*
1353 * Compute match value, based on the bit at start: if 1 (free)
1354 * then all-ones, else all-zeroes.
1355 */
1357 /*
1358 * If the starting position is not word-aligned, deal with the
1359 * partial word.
1360 */
1362 /*
1363 * Calculate last (rightmost) bit number to look at,
1364 * and mask for all the relevant bits in this word.
1365 */
1368 /*
1369 * Calculate the difference between the value there
1370 * and what we're looking for.
1371 */
1373 /*
1374 * Different. Mark where we are and return.
1375 */
1380 }
1382 /*
1383 * Go on to next block if that's where the next word is
1384 * and we need the next word.
1385 */
1387 /*
1388 * If done with this block, get the previous one.
1389 */
1394 }
1398 /*
1399 * Go on to the previous word in the buffer.
1400 */
1401 b++;
1402 }
1404 /*
1405 * Starting on a word boundary, no partial word.
1406 */
1408 }
1409 /*
1410 * Loop over whole words in buffers. When we use up one buffer
1411 * we move on to the next one.
1412 */
1414 /*
1415 * Compute difference between actual and desired value.
1416 */
1418 /*
1419 * Different, mark where we are and return.
1420 */
1425 }
1427 /*
1428 * Go on to next block if that's where the next word is
1429 * and we need the next word.
1430 */
1432 /*
1433 * If done with this block, get the next one.
1434 */
1439 }
1443 /*
1444 * Go on to the next word in the buffer.
1445 */
1446 b++;
1447 }
1448 }
1449 /*
1450 * If not ending on a word boundary, deal with the last
1451 * (partial) word.
1452 */
1454 /*
1455 * Calculate mask for all the relevant bits in this word.
1456 */
1458 /*
1459 * Compute difference between actual and desired value.
1460 */
1462 /*
1463 * Different, mark where we are and return.
1464 */
1471 }
1472 /*
1473 * No match, return that we scanned the whole area.
1474 */
1478 }
1480 /*
1481 * Mark an extent specified by start and len freed.
1482 * Updates all the summary information as well as the bitmap.
1483 */
1492 {
1499 /*
1500 * Modify the bitmap to mark this extent freed.
1501 */
1505 }
1506 /*
1507 * Assume we're freeing out of the middle of an allocated extent.
1508 * We need to find the beginning and end of the extent so we can
1509 * properly update the summary.
1510 */
1514 }
1515 /*
1516 * Find the next allocated block (end of allocated extent).
1517 */
1522 /*
1523 * If there are blocks not being freed at the front of the
1524 * old extent, add summary data for them to be allocated.
1525 */
1532 }
1533 }
1534 /*
1535 * If there are blocks not being freed at the end of the
1536 * old extent, add summary data for them to be allocated.
1537 */
1544 }
1545 }
1546 /*
1547 * Increment the summary information corresponding to the entire
1548 * (new) free extent.
1549 */
1554 }
1556 /*
1557 * Read and return the summary information for a given extent size,
1558 * bitmap block combination.
1559 * Keeps track of a current summary block, so we don't keep reading
1560 * it from the buffer cache.
1561 */
1571 {
1578 /*
1579 * Compute entry number in the summary file.
1580 */
1582 /*
1583 * Compute the block number in the summary file.
1584 */
1586 /*
1587 * If we have an old buffer, and the block number matches, use that.
1588 */
1591 /*
1592 * Otherwise we have to get the buffer.
1593 */
1595 /*
1596 * If there was an old one, get rid of it first.
1597 */
1603 }
1604 /*
1605 * Remember this buffer and block for the next call.
1606 */
1610 }
1611 }
1612 /*
1613 * Point to the summary information & copy it out.
1614 */
1617 /*
1618 * Drop the buffer if we're not asked to remember it.
1619 */
1623 }
1625 /*
1626 * Set the given range of bitmap bits to the given value.
1627 * Do whatever I/O and logging is required.
1628 */
1636 {
1649 /*
1650 * Compute starting bitmap block number.
1651 */
1653 /*
1654 * Read the bitmap block, and point to its data.
1655 */
1659 }
1661 /*
1662 * Compute the starting word's address, and starting bit.
1663 */
1667 /*
1668 * 0 (allocated) => all zeroes; 1 (free) => all ones.
1669 */
1671 /*
1672 * If not starting on a word boundary, deal with the first
1673 * (partial) word.
1674 */
1676 /*
1677 * Compute first bit not changed and mask of relevant bits.
1678 */
1681 /*
1682 * Set/clear the active bits.
1683 */
1686 else
1689 /*
1690 * Go on to the next block if that's where the next word is
1691 * and we need the next word.
1692 */
1694 /*
1695 * Log the changed part of this block.
1696 * Get the next one.
1697 */
1704 }
1708 /*
1709 * Go on to the next word in the buffer
1710 */
1711 b++;
1712 }
1714 /*
1715 * Starting on a word boundary, no partial word.
1716 */
1718 }
1719 /*
1720 * Loop over whole words in buffers. When we use up one buffer
1721 * we move on to the next one.
1722 */
1724 /*
1725 * Set the word value correctly.
1726 */
1729 /*
1730 * Go on to the next block if that's where the next word is
1731 * and we need the next word.
1732 */
1734 /*
1735 * Log the changed part of this block.
1736 * Get the next one.
1737 */
1744 }
1748 /*
1749 * Go on to the next word in the buffer
1750 */
1751 b++;
1752 }
1753 }
1754 /*
1755 * If not ending on a word boundary, deal with the last
1756 * (partial) word.
1757 */
1759 /*
1760 * Compute a mask of relevant bits.
1761 */
1764 /*
1765 * Set/clear the active bits.
1766 */
1769 else
1771 b++;
1772 }
1773 /*
1774 * Log any remaining changed bytes.
1775 */
1780 }
1782 /*
1783 * Read and modify the summary information for a given extent size,
1784 * bitmap block combination.
1785 * Keeps track of a current summary block, so we don't keep reading
1786 * it from the buffer cache.
1787 */
1797 {
1804 /*
1805 * Compute entry number in the summary file.
1806 */
1808 /*
1809 * Compute the block number in the summary file.
1810 */
1812 /*
1813 * If we have an old buffer, and the block number matches, use that.
1814 */
1817 /*
1818 * Otherwise we have to get the buffer.
1819 */
1821 /*
1822 * If there was an old one, get rid of it first.
1823 */
1829 }
1830 /*
1831 * Remember this buffer and block for the next call.
1832 */
1836 }
1837 }
1838 /*
1839 * Point to the summary information, modify and log it.
1840 */
1846 }
1848 /*
1849 * Visible (exported) functions.
1850 */
1852 /*
1853 * Grow the realtime area of the filesystem.
1854 */
1855 int
1859 {
1879 /*
1880 * Initial error checking.
1881 */
1890 /*
1891 * Read in the last block of the device, make sure it exists.
1892 */
1900 /*
1901 * Calculate new parameters. These are the final values to be reached.
1902 */
1911 /*
1912 * New summary size can't be more than half the size of
1913 * the log. This prevents us from getting a log overflow,
1914 * since we'll log basically the whole summary file at once.
1915 */
1918 /*
1919 * Get the old block counts for bitmap and summary inodes.
1920 * These can't change since other growfs callers are locked out.
1921 */
1924 /*
1925 * Allocate space to the bitmap and summary files, as necessary.
1926 */
1933 /*
1934 * Allocate a new (fake) mount/sb.
1935 */
1937 /*
1938 * Loop over the bitmap blocks.
1939 * We will do everything one bitmap block at a time.
1940 * Skip the current block if it is exactly full.
1941 * This also deals with the case where there were no rtextents before.
1942 */
1946 bmbno++) {
1952 /*
1953 * Calculate new sb and mount fields for this round.
1954 */
1966 nrsumsize =
1971 /*
1972 * Start a transaction, get the log reservation.
1973 */
1978 /*
1979 * Lock out other callers by grabbing the bitmap inode lock.
1980 */
1985 /*
1986 * Update the bitmap inode's size.
1987 */
1992 /*
1993 * Get the summary inode into the transaction.
1994 */
1999 /*
2000 * Update the summary inode's size.
2001 */
2004 /*
2005 * Copy summary data from old to new sizes.
2006 * Do this when the real size (not block-aligned) changes.
2007 */
2013 }
2014 /*
2015 * Update superblock fields.
2016 */
2032 /*
2033 * Free new extent.
2034 */
2039 error_cancel:
2042 }
2043 /*
2044 * Mark more blocks free in the superblock.
2045 */
2048 /*
2049 * Update mp values into the real mp structure.
2050 */
2057 }
2059 /*
2060 * Free the fake mp structure.
2061 */
2065 }
2067 /*
2068 * Allocate an extent in the realtime subvolume, with the usual allocation
2069 * parameters. The length units are all in realtime extents, as is the
2070 * result block number.
2071 */
2083 {
2093 /*
2094 * If prod is set then figure out what to do to minlen and maxlen.
2095 */
2097 xfs_extlen_t i;
2106 }
2107 }
2108 /*
2109 * Lock out other callers by grabbing the bitmap inode lock.
2110 */
2115 /*
2116 * Allocate by size, or near another block, or exactly at some block.
2117 */
2133 }
2136 }
2137 /*
2138 * If it worked, update the superblock.
2139 */
2146 else
2148 }
2151 }
2153 /*
2154 * Free an extent in the realtime subvolume. Length is expressed in
2155 * realtime extents, as is the block number.
2156 */
2162 {
2170 /*
2171 * Synchronize by locking the bitmap inode.
2172 */
2176 #if defined(__KERNEL__) && defined(DEBUG)
2177 /*
2178 * Check to see that this whole range is currently allocated.
2179 */
2180 {
2186 }
2188 }
2189 #endif
2191 /*
2192 * Free the range of realtime blocks.
2193 */
2197 }
2198 /*
2199 * Mark more blocks free in the superblock.
2200 */
2202 /*
2203 * If we've now freed all the blocks, reset the file sequence
2204 * number to 0.
2205 */
2212 }
2214 }
2216 /*
2217 * Initialize realtime fields in the mount structure.
2218 */
2222 {
2235 }
2242 /*
2243 * Check that the realtime section is an ok size.
2244 */
2251 }
2261 }
2264 }
2266 /*
2267 * Get the bitmap and summary inodes into the mount structure
2268 * at mount time.
2269 */
2273 {
2289 }
2292 }
2294 void
2297 {
2302 }
2304 /*
2305 * Pick an extent for allocation at the start of a new realtime file.
2306 * Use the sequence number stored in the atime field of the bitmap inode.
2307 * Translate this to a fraction of the rtextents, and return the product
2308 * of rtextents and the fraction.
2309 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
2310 */
2317 {
2334 }
2346 }
2351 }