| blob | ca83ddf72af4569ab8cfa1b3cdfcbbf16c80ffb6 |
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 */
49 /*
50 * Prototypes for internal functions.
51 */
71 /*
72 * Internal functions.
73 */
75 /*
76 * Allocate space to the bitmap or summary file, and zero it, for growfs.
77 */
84 {
100 /*
101 * Allocate space to the file, as necessary.
102 */
107 /*
108 * Reserve space & log for one extent added to the file.
109 */
112 XFS_TRANS_PERM_LOG_RES,
113 XFS_DEFAULT_PERM_LOG_COUNT)))
116 /*
117 * Lock the inode.
118 */
123 /*
124 * Allocate blocks to the bitmap file.
125 */
135 /*
136 * Free any blocks freed up in the transaction, then commit.
137 */
142 /*
143 * Now we need to clear the allocated blocks.
144 * Do this one block per transaction, to keep it simple.
145 */
151 /*
152 * Reserve log for one block zeroing.
153 */
157 /*
158 * Lock the bitmap inode.
159 */
163 /*
164 * Get a buffer for the block.
165 */
172 }
175 /*
176 * Commit the transaction.
177 */
179 }
180 /*
181 * Go on to the next extent, if any.
182 */
184 }
186 error_exit:
189 }
191 /*
192 * Attempt to allocate an extent minlen<=len<=maxlen starting from
193 * bitmap block bbno. If we don't get maxlen then use prod to trim
194 * the length, if given. Returns error; returns starting block in *rtblock.
195 * The lengths are all in rtextents.
196 */
210 {
219 /*
220 * Loop over all the extents starting in this bitmap block,
221 * looking for one that's long enough.
222 */
226 i++) {
227 /*
228 * See if there's a free extent of maxlen starting at i.
229 * If it's not so then next will contain the first non-free.
230 */
234 }
236 /*
237 * i for maxlen is all free, allocate and return that.
238 */
240 rsb);
243 }
247 }
248 /*
249 * In the case where we have a variable-sized allocation
250 * request, figure out how big this free piece is,
251 * and if it's big enough for the minimum, and the best
252 * so far, remember it.
253 */
261 }
262 }
263 /*
264 * If not done yet, find the start of the next free space.
265 */
270 }
273 }
274 /*
275 * Searched the whole thing & didn't find a maxlen free extent.
276 */
280 /*
281 * If size should be a multiple of prod, make that so.
282 */
285 /*
286 * Allocate besti for bestlen & return that.
287 */
291 }
295 }
296 /*
297 * Allocation failed. Set *nextp to the next block to try.
298 */
302 }
304 /*
305 * Allocate an extent of length minlen<=len<=maxlen, starting at block
306 * bno. If we don't get maxlen then use prod to trim the length, if given.
307 * Returns error; returns starting block in *rtblock.
308 * The lengths are all in rtextents.
309 */
322 {
329 /*
330 * Check if the range in question (for maxlen) is free.
331 */
335 }
337 /*
338 * If it is, allocate it and return success.
339 */
343 }
347 }
348 /*
349 * If not, allocate what there is, if it's at least minlen.
350 */
353 /*
354 * Failed, return failure status.
355 */
358 }
359 /*
360 * Trim off tail of extent, if prod is specified.
361 */
365 /*
366 * Now we can't do it, return failure status.
367 */
370 }
371 }
372 /*
373 * Allocate what we can and return it.
374 */
378 }
382 }
384 /*
385 * Allocate an extent of length minlen<=len<=maxlen, starting as near
386 * to bno as possible. If we don't get maxlen then use prod to trim
387 * the length, if given. The lengths are all in rtextents.
388 */
401 {
412 /*
413 * If the block number given is off the end, silently set it to
414 * the last block.
415 */
418 /*
419 * Try the exact allocation first.
420 */
425 }
426 /*
427 * If the exact allocation worked, return that.
428 */
432 }
437 /*
438 * Loop over all bitmap blocks (bbno + i is current block).
439 */
441 /*
442 * Get summary information of extents of all useful levels
443 * starting in this bitmap block.
444 */
449 }
450 /*
451 * If there are any useful extents starting here, try
452 * allocating one.
453 */
455 /*
456 * On the positive side of the starting location.
457 */
459 /*
460 * Try to allocate an extent starting in
461 * this block.
462 */
468 }
469 /*
470 * If it worked, return it.
471 */
475 }
476 }
477 /*
478 * On the negative side of the starting location.
479 */
481 /*
482 * Loop backwards through the bitmap blocks from
483 * the starting point-1 up to where we are now.
484 * There should be an extent which ends in this
485 * bitmap block and is long enough.
486 */
488 /*
489 * Grab the summary information for
490 * this bitmap block.
491 */
497 }
498 /*
499 * If there's no extent given in the
500 * summary that means the extent we
501 * found must carry over from an
502 * earlier block. If there is an
503 * extent given, we've already tried
504 * that allocation, don't do it again.
505 */
513 }
514 /*
515 * If it works, return the extent.
516 */
520 }
521 }
522 /*
523 * There weren't intervening bitmap blocks
524 * with a long enough extent, or the
525 * allocation didn't work for some reason
526 * (i.e. it's a little * too short).
527 * Try to allocate from the summary block
528 * that we found.
529 */
535 }
536 /*
537 * If it works, return the extent.
538 */
542 }
543 }
544 }
545 /*
546 * Loop control. If we were on the positive side, and there's
547 * still more blocks on the negative side, go there.
548 */
551 /*
552 * If positive, and no more negative, but there are more
553 * positive, go there.
554 */
556 i++;
557 /*
558 * If negative or 0 (just started), and there are positive
559 * blocks to go, go there. The 0 case moves to block 1.
560 */
563 /*
564 * If negative or 0 and there are more negative blocks,
565 * go there.
566 */
568 i--;
569 /*
570 * Must be done. Return failure.
571 */
572 else
574 }
577 }
579 /*
580 * Allocate an extent of length minlen<=len<=maxlen, with no position
581 * specified. If we don't get maxlen then use prod to trim
582 * the length, if given. The lengths are all in rtextents.
583 */
595 {
606 /*
607 * Loop over all the levels starting with maxlen.
608 * At each level, look at all the bitmap blocks, to see if there
609 * are extents starting there that are long enough (>= maxlen).
610 * Note, only on the initial level can the allocation fail if
611 * the summary says there's an extent.
612 */
614 /*
615 * Loop over all the bitmap blocks.
616 */
618 /*
619 * Get the summary for this level/block.
620 */
625 }
626 /*
627 * Nothing there, on to the next block.
628 */
631 /*
632 * Try allocating the extent.
633 */
638 }
639 /*
640 * If it worked, return that.
641 */
645 }
646 /*
647 * If the "next block to try" returned from the
648 * allocator is beyond the next bitmap block,
649 * skip to that bitmap block.
650 */
653 }
654 }
655 /*
656 * Didn't find any maxlen blocks. Try smaller ones, unless
657 * we're asking for a fixed size extent.
658 */
662 }
666 /*
667 * Loop over sizes, from maxlen down to minlen.
668 * This time, when we do the allocations, allow smaller ones
669 * to succeed.
670 */
672 /*
673 * Loop over all the bitmap blocks, try an allocation
674 * starting in that block.
675 */
677 /*
678 * Get the summary information for this level/block.
679 */
684 }
685 /*
686 * If nothing there, go on to next.
687 */
690 /*
691 * Try the allocation. Make sure the specified
692 * minlen/maxlen are in the possible range for
693 * this summary level.
694 */
701 }
702 /*
703 * If it worked, return that extent.
704 */
708 }
709 /*
710 * If the "next block to try" returned from the
711 * allocator is beyond the next bitmap block,
712 * skip to that bitmap block.
713 */
716 }
717 }
718 /*
719 * Got nothing, return failure.
720 */
723 }
725 /*
726 * Mark an extent specified by start and len allocated.
727 * Updates all the summary information as well as the bitmap.
728 */
737 {
744 /*
745 * Assume we're allocating out of the middle of a free extent.
746 * We need to find the beginning and end of the extent so we can
747 * properly update the summary.
748 */
752 }
753 /*
754 * Find the next allocated block (end of free extent).
755 */
760 }
761 /*
762 * Decrement the summary information corresponding to the entire
763 * (old) free extent.
764 */
770 }
771 /*
772 * If there are blocks not being allocated at the front of the
773 * old extent, add summary data for them to be free.
774 */
781 }
782 }
783 /*
784 * If there are blocks not being allocated at the end of the
785 * old extent, add summary data for them to be free.
786 */
793 }
794 }
795 /*
796 * Modify the bitmap to mark this extent allocated.
797 */
800 }
802 /*
803 * Return whether there are any free extents in the size range given
804 * by low and high, for the bitmap block bbno.
805 */
816 {
821 /*
822 * Loop over logs of extent sizes. Order is irrelevant.
823 */
825 /*
826 * Get one summary datum.
827 */
831 }
832 /*
833 * If there are any, return success.
834 */
838 }
839 }
840 /*
841 * Found nothing, return failure.
842 */
845 }
847 /*
848 * Get a buffer for the bitmap or summary file block specified.
849 * The buffer is returned read and locked.
850 */
858 {
866 /*
867 * Map from the file offset (block) and inode number to the
868 * file system block.
869 */
873 }
875 /*
876 * Convert to disk address for buffer cache.
877 */
879 /*
880 * Read the buffer.
881 */
886 }
890 }
892 #ifdef DEBUG
893 /*
894 * Check that the given extent (block range) is allocated already.
895 */
903 {
907 }
908 #endif
910 /*
911 * Check that the given range is either all allocated (val = 0) or
912 * all free (val = 1).
913 */
923 {
936 /*
937 * Compute starting bitmap block number
938 */
940 /*
941 * Read the bitmap block.
942 */
946 }
948 /*
949 * Compute the starting word's address, and starting bit.
950 */
954 /*
955 * 0 (allocated) => all zero's; 1 (free) => all one's.
956 */
958 /*
959 * If not starting on a word boundary, deal with the first
960 * (partial) word.
961 */
963 /*
964 * Compute first bit not examined.
965 */
967 /*
968 * Mask of relevant bits.
969 */
971 /*
972 * Compute difference between actual and desired value.
973 */
975 /*
976 * Different, compute first wrong bit and return.
977 */
983 }
985 /*
986 * Go on to next block if that's where the next word is
987 * and we need the next word.
988 */
990 /*
991 * If done with this block, get the next one.
992 */
997 }
1001 /*
1002 * Go on to the next word in the buffer.
1003 */
1004 b++;
1005 }
1007 /*
1008 * Starting on a word boundary, no partial word.
1009 */
1011 }
1012 /*
1013 * Loop over whole words in buffers. When we use up one buffer
1014 * we move on to the next one.
1015 */
1017 /*
1018 * Compute difference between actual and desired value.
1019 */
1021 /*
1022 * Different, compute first wrong bit and return.
1023 */
1029 }
1031 /*
1032 * Go on to next block if that's where the next word is
1033 * and we need the next word.
1034 */
1036 /*
1037 * If done with this block, get the next one.
1038 */
1043 }
1047 /*
1048 * Go on to the next word in the buffer.
1049 */
1050 b++;
1051 }
1052 }
1053 /*
1054 * If not ending on a word boundary, deal with the last
1055 * (partial) word.
1056 */
1058 /*
1059 * Mask of relevant bits.
1060 */
1062 /*
1063 * Compute difference between actual and desired value.
1064 */
1066 /*
1067 * Different, compute first wrong bit and return.
1068 */
1076 }
1077 /*
1078 * Successful, return.
1079 */
1084 }
1086 /*
1087 * Copy and transform the summary file, given the old and new
1088 * parameters in the mount structures.
1089 */
1095 {
1107 bbno--) {
1123 }
1124 }
1126 }
1128 /*
1129 * Searching backward from start to limit, find the first block whose
1130 * allocated/free state is different from start's.
1131 */
1139 {
1154 /*
1155 * Compute and read in starting bitmap block for starting block.
1156 */
1161 }
1163 /*
1164 * Get the first word's index & point to it.
1165 */
1170 /*
1171 * Compute match value, based on the bit at start: if 1 (free)
1172 * then all-ones, else all-zeroes.
1173 */
1175 /*
1176 * If the starting position is not word-aligned, deal with the
1177 * partial word.
1178 */
1180 /*
1181 * Calculate first (leftmost) bit number to look at,
1182 * and mask for all the relevant bits in this word.
1183 */
1186 firstbit;
1187 /*
1188 * Calculate the difference between the value there
1189 * and what we're looking for.
1190 */
1192 /*
1193 * Different. Mark where we are and return.
1194 */
1199 }
1201 /*
1202 * Go on to previous block if that's where the previous word is
1203 * and we need the previous word.
1204 */
1206 /*
1207 * If done with this block, get the previous one.
1208 */
1213 }
1218 /*
1219 * Go on to the previous word in the buffer.
1220 */
1221 b--;
1222 }
1224 /*
1225 * Starting on a word boundary, no partial word.
1226 */
1228 }
1229 /*
1230 * Loop over whole words in buffers. When we use up one buffer
1231 * we move on to the previous one.
1232 */
1234 /*
1235 * Compute difference between actual and desired value.
1236 */
1238 /*
1239 * Different, mark where we are and return.
1240 */
1245 }
1247 /*
1248 * Go on to previous block if that's where the previous word is
1249 * and we need the previous word.
1250 */
1252 /*
1253 * If done with this block, get the previous one.
1254 */
1259 }
1264 /*
1265 * Go on to the previous word in the buffer.
1266 */
1267 b--;
1268 }
1269 }
1270 /*
1271 * If not ending on a word boundary, deal with the last
1272 * (partial) word.
1273 */
1275 /*
1276 * Calculate first (leftmost) bit number to look at,
1277 * and mask for all the relevant bits in this word.
1278 */
1281 /*
1282 * Compute difference between actual and desired value.
1283 */
1285 /*
1286 * Different, mark where we are and return.
1287 */
1294 }
1295 /*
1296 * No match, return that we scanned the whole area.
1297 */
1301 }
1303 /*
1304 * Searching forward from start to limit, find the first block whose
1305 * allocated/free state is different from start's.
1306 */
1314 {
1329 /*
1330 * Compute and read in starting bitmap block for starting block.
1331 */
1336 }
1338 /*
1339 * Get the first word's index & point to it.
1340 */
1345 /*
1346 * Compute match value, based on the bit at start: if 1 (free)
1347 * then all-ones, else all-zeroes.
1348 */
1350 /*
1351 * If the starting position is not word-aligned, deal with the
1352 * partial word.
1353 */
1355 /*
1356 * Calculate last (rightmost) bit number to look at,
1357 * and mask for all the relevant bits in this word.
1358 */
1361 /*
1362 * Calculate the difference between the value there
1363 * and what we're looking for.
1364 */
1366 /*
1367 * Different. Mark where we are and return.
1368 */
1373 }
1375 /*
1376 * Go on to next block if that's where the next word is
1377 * and we need the next word.
1378 */
1380 /*
1381 * If done with this block, get the previous one.
1382 */
1387 }
1391 /*
1392 * Go on to the previous word in the buffer.
1393 */
1394 b++;
1395 }
1397 /*
1398 * Starting on a word boundary, no partial word.
1399 */
1401 }
1402 /*
1403 * Loop over whole words in buffers. When we use up one buffer
1404 * we move on to the next one.
1405 */
1407 /*
1408 * Compute difference between actual and desired value.
1409 */
1411 /*
1412 * Different, mark where we are and return.
1413 */
1418 }
1420 /*
1421 * Go on to next block if that's where the next word is
1422 * and we need the next word.
1423 */
1425 /*
1426 * If done with this block, get the next one.
1427 */
1432 }
1436 /*
1437 * Go on to the next word in the buffer.
1438 */
1439 b++;
1440 }
1441 }
1442 /*
1443 * If not ending on a word boundary, deal with the last
1444 * (partial) word.
1445 */
1447 /*
1448 * Calculate mask for all the relevant bits in this word.
1449 */
1451 /*
1452 * Compute difference between actual and desired value.
1453 */
1455 /*
1456 * Different, mark where we are and return.
1457 */
1464 }
1465 /*
1466 * No match, return that we scanned the whole area.
1467 */
1471 }
1473 /*
1474 * Mark an extent specified by start and len freed.
1475 * Updates all the summary information as well as the bitmap.
1476 */
1485 {
1492 /*
1493 * Modify the bitmap to mark this extent freed.
1494 */
1498 }
1499 /*
1500 * Assume we're freeing out of the middle of an allocated extent.
1501 * We need to find the beginning and end of the extent so we can
1502 * properly update the summary.
1503 */
1507 }
1508 /*
1509 * Find the next allocated block (end of allocated extent).
1510 */
1513 /*
1514 * If there are blocks not being freed at the front of the
1515 * old extent, add summary data for them to be allocated.
1516 */
1523 }
1524 }
1525 /*
1526 * If there are blocks not being freed at the end of the
1527 * old extent, add summary data for them to be allocated.
1528 */
1535 }
1536 }
1537 /*
1538 * Increment the summary information corresponding to the entire
1539 * (new) free extent.
1540 */
1545 }
1547 /*
1548 * Read and return the summary information for a given extent size,
1549 * bitmap block combination.
1550 * Keeps track of a current summary block, so we don't keep reading
1551 * it from the buffer cache.
1552 */
1562 {
1569 /*
1570 * Compute entry number in the summary file.
1571 */
1573 /*
1574 * Compute the block number in the summary file.
1575 */
1577 /*
1578 * If we have an old buffer, and the block number matches, use that.
1579 */
1582 /*
1583 * Otherwise we have to get the buffer.
1584 */
1586 /*
1587 * If there was an old one, get rid of it first.
1588 */
1594 }
1595 /*
1596 * Remember this buffer and block for the next call.
1597 */
1601 }
1602 }
1603 /*
1604 * Point to the summary information & copy it out.
1605 */
1608 /*
1609 * Drop the buffer if we're not asked to remember it.
1610 */
1614 }
1616 /*
1617 * Set the given range of bitmap bits to the given value.
1618 * Do whatever I/O and logging is required.
1619 */
1627 {
1640 /*
1641 * Compute starting bitmap block number.
1642 */
1644 /*
1645 * Read the bitmap block, and point to its data.
1646 */
1650 }
1652 /*
1653 * Compute the starting word's address, and starting bit.
1654 */
1658 /*
1659 * 0 (allocated) => all zeroes; 1 (free) => all ones.
1660 */
1662 /*
1663 * If not starting on a word boundary, deal with the first
1664 * (partial) word.
1665 */
1667 /*
1668 * Compute first bit not changed and mask of relevant bits.
1669 */
1672 /*
1673 * Set/clear the active bits.
1674 */
1677 else
1680 /*
1681 * Go on to the next block if that's where the next word is
1682 * and we need the next word.
1683 */
1685 /*
1686 * Log the changed part of this block.
1687 * Get the next one.
1688 */
1695 }
1699 /*
1700 * Go on to the next word in the buffer
1701 */
1702 b++;
1703 }
1705 /*
1706 * Starting on a word boundary, no partial word.
1707 */
1709 }
1710 /*
1711 * Loop over whole words in buffers. When we use up one buffer
1712 * we move on to the next one.
1713 */
1715 /*
1716 * Set the word value correctly.
1717 */
1720 /*
1721 * Go on to the next block if that's where the next word is
1722 * and we need the next word.
1723 */
1725 /*
1726 * Log the changed part of this block.
1727 * Get the next one.
1728 */
1735 }
1739 /*
1740 * Go on to the next word in the buffer
1741 */
1742 b++;
1743 }
1744 }
1745 /*
1746 * If not ending on a word boundary, deal with the last
1747 * (partial) word.
1748 */
1750 /*
1751 * Compute a mask of relevant bits.
1752 */
1755 /*
1756 * Set/clear the active bits.
1757 */
1760 else
1762 b++;
1763 }
1764 /*
1765 * Log any remaining changed bytes.
1766 */
1771 }
1773 /*
1774 * Read and modify the summary information for a given extent size,
1775 * bitmap block combination.
1776 * Keeps track of a current summary block, so we don't keep reading
1777 * it from the buffer cache.
1778 */
1788 {
1795 /*
1796 * Compute entry number in the summary file.
1797 */
1799 /*
1800 * Compute the block number in the summary file.
1801 */
1803 /*
1804 * If we have an old buffer, and the block number matches, use that.
1805 */
1808 /*
1809 * Otherwise we have to get the buffer.
1810 */
1812 /*
1813 * If there was an old one, get rid of it first.
1814 */
1820 }
1821 /*
1822 * Remember this buffer and block for the next call.
1823 */
1827 }
1828 }
1829 /*
1830 * Point to the summary information, modify and log it.
1831 */
1837 }
1839 /*
1840 * Visible (exported) functions.
1841 */
1843 /*
1844 * Grow the realtime area of the filesystem.
1845 */
1846 int
1850 {
1872 /*
1873 * Initial error checking.
1874 */
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++) {
1940 /*
1941 * Calculate new sb and mount fields for this round.
1942 */
1954 nrsumsize =
1959 /*
1960 * Start a transaction, get the log reservation.
1961 */
1967 /*
1968 * Lock out other callers by grabbing the bitmap inode lock.
1969 */
1974 /*
1975 * Update the bitmap inode's size.
1976 */
1981 /*
1982 * Get the summary inode into the transaction.
1983 */
1988 /*
1989 * Update the summary inode's size.
1990 */
1993 /*
1994 * Copy summary data from old to new sizes.
1995 * Do this when the real size (not block-aligned) changes.
1996 */
2002 }
2003 /*
2004 * Update superblock fields.
2005 */
2021 /*
2022 * Free new extent.
2023 */
2029 /*
2030 * Mark more blocks free in the superblock.
2031 */
2034 /*
2035 * Update mp values into the real mp structure.
2036 */
2039 /*
2040 * Commit the transaction.
2041 */
2043 }
2048 /*
2049 * Free the fake mp structure.
2050 */
2054 }
2056 /*
2057 * Allocate an extent in the realtime subvolume, with the usual allocation
2058 * parameters. The length units are all in realtime extents, as is the
2059 * result block number.
2060 */
2072 {
2082 /*
2083 * If prod is set then figure out what to do to minlen and maxlen.
2084 */
2086 xfs_extlen_t i;
2095 }
2096 }
2097 /*
2098 * Lock out other callers by grabbing the bitmap inode lock.
2099 */
2104 /*
2105 * Allocate by size, or near another block, or exactly at some block.
2106 */
2122 }
2125 }
2126 /*
2127 * If it worked, update the superblock.
2128 */
2135 else
2137 }
2140 }
2142 /*
2143 * Free an extent in the realtime subvolume. Length is expressed in
2144 * realtime extents, as is the block number.
2145 */
2151 {
2159 /*
2160 * Synchronize by locking the bitmap inode.
2161 */
2165 #if defined(__KERNEL__) && defined(DEBUG)
2166 /*
2167 * Check to see that this whole range is currently allocated.
2168 */
2169 {
2175 }
2177 }
2178 #endif
2180 /*
2181 * Free the range of realtime blocks.
2182 */
2186 }
2187 /*
2188 * Mark more blocks free in the superblock.
2189 */
2191 /*
2192 * If we've now freed all the blocks, reset the file sequence
2193 * number to 0.
2194 */
2201 }
2203 }
2205 /*
2206 * Initialize realtime fields in the mount structure.
2207 */
2211 {
2224 }
2231 /*
2232 * Check that the realtime section is an ok size.
2233 */
2240 }
2250 }
2253 }
2255 /*
2256 * Get the bitmap and summary inodes into the mount structure
2257 * at mount time.
2258 */
2262 {
2278 }
2281 }
2283 /*
2284 * Pick an extent for allocation at the start of a new realtime file.
2285 * Use the sequence number stored in the atime field of the bitmap inode.
2286 * Translate this to a fraction of the rtextents, and return the product
2287 * of rtextents and the fraction.
2288 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
2289 */
2296 {
2313 }
2325 }
2330 }