| blob | a0dc6e5bc5b9fe5a7fa0fd2cc6e4be759c3399d9 |
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 * xfs_lowbit32: get low bit set out of 32-bit argument, -1 if none set.
78 */
79 STATIC int
81 __uint32_t v)
82 {
86 }
88 /*
89 * Allocate space to the bitmap or summary file, and zero it, for growfs.
90 */
97 {
113 /*
114 * Allocate space to the file, as necessary.
115 */
120 /*
121 * Reserve space & log for one extent added to the file.
122 */
125 XFS_TRANS_PERM_LOG_RES,
126 XFS_DEFAULT_PERM_LOG_COUNT)))
129 /*
130 * Lock the inode.
131 */
136 /*
137 * Allocate blocks to the bitmap file.
138 */
148 /*
149 * Free any blocks freed up in the transaction, then commit.
150 */
157 /*
158 * Now we need to clear the allocated blocks.
159 * Do this one block per transaction, to keep it simple.
160 */
166 /*
167 * Reserve log for one block zeroing.
168 */
172 /*
173 * Lock the bitmap inode.
174 */
178 /*
179 * Get a buffer for the block.
180 */
187 }
190 /*
191 * Commit the transaction.
192 */
196 }
197 /*
198 * Go on to the next extent, if any.
199 */
201 }
203 error_cancel:
205 error:
207 }
209 /*
210 * Attempt to allocate an extent minlen<=len<=maxlen starting from
211 * bitmap block bbno. If we don't get maxlen then use prod to trim
212 * the length, if given. Returns error; returns starting block in *rtblock.
213 * The lengths are all in rtextents.
214 */
228 {
237 /*
238 * Loop over all the extents starting in this bitmap block,
239 * looking for one that's long enough.
240 */
244 i++) {
245 /*
246 * See if there's a free extent of maxlen starting at i.
247 * If it's not so then next will contain the first non-free.
248 */
252 }
254 /*
255 * i for maxlen is all free, allocate and return that.
256 */
258 rsb);
261 }
265 }
266 /*
267 * In the case where we have a variable-sized allocation
268 * request, figure out how big this free piece is,
269 * and if it's big enough for the minimum, and the best
270 * so far, remember it.
271 */
279 }
280 }
281 /*
282 * If not done yet, find the start of the next free space.
283 */
288 }
291 }
292 /*
293 * Searched the whole thing & didn't find a maxlen free extent.
294 */
298 /*
299 * If size should be a multiple of prod, make that so.
300 */
303 /*
304 * Allocate besti for bestlen & return that.
305 */
309 }
313 }
314 /*
315 * Allocation failed. Set *nextp to the next block to try.
316 */
320 }
322 /*
323 * Allocate an extent of length minlen<=len<=maxlen, starting at block
324 * bno. If we don't get maxlen then use prod to trim the length, if given.
325 * Returns error; returns starting block in *rtblock.
326 * The lengths are all in rtextents.
327 */
340 {
347 /*
348 * Check if the range in question (for maxlen) is free.
349 */
353 }
355 /*
356 * If it is, allocate it and return success.
357 */
361 }
365 }
366 /*
367 * If not, allocate what there is, if it's at least minlen.
368 */
371 /*
372 * Failed, return failure status.
373 */
376 }
377 /*
378 * Trim off tail of extent, if prod is specified.
379 */
383 /*
384 * Now we can't do it, return failure status.
385 */
388 }
389 }
390 /*
391 * Allocate what we can and return it.
392 */
396 }
400 }
402 /*
403 * Allocate an extent of length minlen<=len<=maxlen, starting as near
404 * to bno as possible. If we don't get maxlen then use prod to trim
405 * the length, if given. The lengths are all in rtextents.
406 */
419 {
430 /*
431 * If the block number given is off the end, silently set it to
432 * the last block.
433 */
436 /*
437 * Try the exact allocation first.
438 */
443 }
444 /*
445 * If the exact allocation worked, return that.
446 */
450 }
454 /*
455 * Loop over all bitmap blocks (bbno + i is current block).
456 */
458 /*
459 * Get summary information of extents of all useful levels
460 * starting in this bitmap block.
461 */
466 }
467 /*
468 * If there are any useful extents starting here, try
469 * allocating one.
470 */
472 /*
473 * On the positive side of the starting location.
474 */
476 /*
477 * Try to allocate an extent starting in
478 * this block.
479 */
485 }
486 /*
487 * If it worked, return it.
488 */
492 }
493 }
494 /*
495 * On the negative side of the starting location.
496 */
498 /*
499 * Loop backwards through the bitmap blocks from
500 * the starting point-1 up to where we are now.
501 * There should be an extent which ends in this
502 * bitmap block and is long enough.
503 */
505 /*
506 * Grab the summary information for
507 * this bitmap block.
508 */
514 }
515 /*
516 * If there's no extent given in the
517 * summary that means the extent we
518 * found must carry over from an
519 * earlier block. If there is an
520 * extent given, we've already tried
521 * that allocation, don't do it again.
522 */
530 }
531 /*
532 * If it works, return the extent.
533 */
537 }
538 }
539 /*
540 * There weren't intervening bitmap blocks
541 * with a long enough extent, or the
542 * allocation didn't work for some reason
543 * (i.e. it's a little * too short).
544 * Try to allocate from the summary block
545 * that we found.
546 */
552 }
553 /*
554 * If it works, return the extent.
555 */
559 }
560 }
561 }
562 /*
563 * Loop control. If we were on the positive side, and there's
564 * still more blocks on the negative side, go there.
565 */
568 /*
569 * If positive, and no more negative, but there are more
570 * positive, go there.
571 */
573 i++;
574 /*
575 * If negative or 0 (just started), and there are positive
576 * blocks to go, go there. The 0 case moves to block 1.
577 */
580 /*
581 * If negative or 0 and there are more negative blocks,
582 * go there.
583 */
585 i--;
586 /*
587 * Must be done. Return failure.
588 */
589 else
591 }
594 }
596 /*
597 * Allocate an extent of length minlen<=len<=maxlen, with no position
598 * specified. If we don't get maxlen then use prod to trim
599 * the length, if given. The lengths are all in rtextents.
600 */
612 {
621 /*
622 * Loop over all the levels starting with maxlen.
623 * At each level, look at all the bitmap blocks, to see if there
624 * are extents starting there that are long enough (>= maxlen).
625 * Note, only on the initial level can the allocation fail if
626 * the summary says there's an extent.
627 */
629 /*
630 * Loop over all the bitmap blocks.
631 */
633 /*
634 * Get the summary for this level/block.
635 */
640 }
641 /*
642 * Nothing there, on to the next block.
643 */
646 /*
647 * Try allocating the extent.
648 */
653 }
654 /*
655 * If it worked, return that.
656 */
660 }
661 /*
662 * If the "next block to try" returned from the
663 * allocator is beyond the next bitmap block,
664 * skip to that bitmap block.
665 */
668 }
669 }
670 /*
671 * Didn't find any maxlen blocks. Try smaller ones, unless
672 * we're asking for a fixed size extent.
673 */
677 }
678 /*
679 * Loop over sizes, from maxlen down to minlen.
680 * This time, when we do the allocations, allow smaller ones
681 * to succeed.
682 */
684 /*
685 * Loop over all the bitmap blocks, try an allocation
686 * starting in that block.
687 */
689 /*
690 * Get the summary information for this level/block.
691 */
696 }
697 /*
698 * If nothing there, go on to next.
699 */
702 /*
703 * Try the allocation. Make sure the specified
704 * minlen/maxlen are in the possible range for
705 * this summary level.
706 */
713 }
714 /*
715 * If it worked, return that extent.
716 */
720 }
721 /*
722 * If the "next block to try" returned from the
723 * allocator is beyond the next bitmap block,
724 * skip to that bitmap block.
725 */
728 }
729 }
730 /*
731 * Got nothing, return failure.
732 */
735 }
737 /*
738 * Mark an extent specified by start and len allocated.
739 * Updates all the summary information as well as the bitmap.
740 */
749 {
756 /*
757 * Assume we're allocating out of the middle of a free extent.
758 * We need to find the beginning and end of the extent so we can
759 * properly update the summary.
760 */
764 }
765 /*
766 * Find the next allocated block (end of free extent).
767 */
772 }
773 /*
774 * Decrement the summary information corresponding to the entire
775 * (old) free extent.
776 */
782 }
783 /*
784 * If there are blocks not being allocated at the front of the
785 * old extent, add summary data for them to be free.
786 */
793 }
794 }
795 /*
796 * If there are blocks not being allocated at the end of the
797 * old extent, add summary data for them to be free.
798 */
805 }
806 }
807 /*
808 * Modify the bitmap to mark this extent allocated.
809 */
812 }
814 /*
815 * Return whether there are any free extents in the size range given
816 * by low and high, for the bitmap block bbno.
817 */
828 {
833 /*
834 * Loop over logs of extent sizes. Order is irrelevant.
835 */
837 /*
838 * Get one summary datum.
839 */
843 }
844 /*
845 * If there are any, return success.
846 */
850 }
851 }
852 /*
853 * Found nothing, return failure.
854 */
857 }
859 /*
860 * Get a buffer for the bitmap or summary file block specified.
861 * The buffer is returned read and locked.
862 */
870 {
878 /*
879 * Map from the file offset (block) and inode number to the
880 * file system block.
881 */
885 }
887 /*
888 * Convert to disk address for buffer cache.
889 */
891 /*
892 * Read the buffer.
893 */
898 }
902 }
904 #ifdef DEBUG
905 /*
906 * Check that the given extent (block range) is allocated already.
907 */
915 {
919 }
920 #endif
922 /*
923 * Check that the given range is either all allocated (val = 0) or
924 * all free (val = 1).
925 */
935 {
948 /*
949 * Compute starting bitmap block number
950 */
952 /*
953 * Read the bitmap block.
954 */
958 }
960 /*
961 * Compute the starting word's address, and starting bit.
962 */
966 /*
967 * 0 (allocated) => all zero's; 1 (free) => all one's.
968 */
970 /*
971 * If not starting on a word boundary, deal with the first
972 * (partial) word.
973 */
975 /*
976 * Compute first bit not examined.
977 */
979 /*
980 * Mask of relevant bits.
981 */
983 /*
984 * Compute difference between actual and desired value.
985 */
987 /*
988 * Different, compute first wrong bit and return.
989 */
995 }
997 /*
998 * Go on to next block if that's where the next word is
999 * and we need the next word.
1000 */
1002 /*
1003 * If done with this block, get the next one.
1004 */
1009 }
1013 /*
1014 * Go on to the next word in the buffer.
1015 */
1016 b++;
1017 }
1019 /*
1020 * Starting on a word boundary, no partial word.
1021 */
1023 }
1024 /*
1025 * Loop over whole words in buffers. When we use up one buffer
1026 * we move on to the next one.
1027 */
1029 /*
1030 * Compute difference between actual and desired value.
1031 */
1033 /*
1034 * Different, compute first wrong bit and return.
1035 */
1041 }
1043 /*
1044 * Go on to next block if that's where the next word is
1045 * and we need the next word.
1046 */
1048 /*
1049 * If done with this block, get the next one.
1050 */
1055 }
1059 /*
1060 * Go on to the next word in the buffer.
1061 */
1062 b++;
1063 }
1064 }
1065 /*
1066 * If not ending on a word boundary, deal with the last
1067 * (partial) word.
1068 */
1070 /*
1071 * Mask of relevant bits.
1072 */
1074 /*
1075 * Compute difference between actual and desired value.
1076 */
1078 /*
1079 * Different, compute first wrong bit and return.
1080 */
1088 }
1089 /*
1090 * Successful, return.
1091 */
1096 }
1098 /*
1099 * Copy and transform the summary file, given the old and new
1100 * parameters in the mount structures.
1101 */
1107 {
1119 bbno--) {
1135 }
1136 }
1138 }
1140 /*
1141 * Searching backward from start to limit, find the first block whose
1142 * allocated/free state is different from start's.
1143 */
1151 {
1166 /*
1167 * Compute and read in starting bitmap block for starting block.
1168 */
1173 }
1175 /*
1176 * Get the first word's index & point to it.
1177 */
1182 /*
1183 * Compute match value, based on the bit at start: if 1 (free)
1184 * then all-ones, else all-zeroes.
1185 */
1187 /*
1188 * If the starting position is not word-aligned, deal with the
1189 * partial word.
1190 */
1192 /*
1193 * Calculate first (leftmost) bit number to look at,
1194 * and mask for all the relevant bits in this word.
1195 */
1198 firstbit;
1199 /*
1200 * Calculate the difference between the value there
1201 * and what we're looking for.
1202 */
1204 /*
1205 * Different. Mark where we are and return.
1206 */
1211 }
1213 /*
1214 * Go on to previous block if that's where the previous word is
1215 * and we need the previous word.
1216 */
1218 /*
1219 * If done with this block, get the previous one.
1220 */
1225 }
1230 /*
1231 * Go on to the previous word in the buffer.
1232 */
1233 b--;
1234 }
1236 /*
1237 * Starting on a word boundary, no partial word.
1238 */
1240 }
1241 /*
1242 * Loop over whole words in buffers. When we use up one buffer
1243 * we move on to the previous one.
1244 */
1246 /*
1247 * Compute difference between actual and desired value.
1248 */
1250 /*
1251 * Different, mark where we are and return.
1252 */
1257 }
1259 /*
1260 * Go on to previous block if that's where the previous word is
1261 * and we need the previous word.
1262 */
1264 /*
1265 * If done with this block, get the previous one.
1266 */
1271 }
1276 /*
1277 * Go on to the previous word in the buffer.
1278 */
1279 b--;
1280 }
1281 }
1282 /*
1283 * If not ending on a word boundary, deal with the last
1284 * (partial) word.
1285 */
1287 /*
1288 * Calculate first (leftmost) bit number to look at,
1289 * and mask for all the relevant bits in this word.
1290 */
1293 /*
1294 * Compute difference between actual and desired value.
1295 */
1297 /*
1298 * Different, mark where we are and return.
1299 */
1306 }
1307 /*
1308 * No match, return that we scanned the whole area.
1309 */
1313 }
1315 /*
1316 * Searching forward from start to limit, find the first block whose
1317 * allocated/free state is different from start's.
1318 */
1326 {
1341 /*
1342 * Compute and read in starting bitmap block for starting block.
1343 */
1348 }
1350 /*
1351 * Get the first word's index & point to it.
1352 */
1357 /*
1358 * Compute match value, based on the bit at start: if 1 (free)
1359 * then all-ones, else all-zeroes.
1360 */
1362 /*
1363 * If the starting position is not word-aligned, deal with the
1364 * partial word.
1365 */
1367 /*
1368 * Calculate last (rightmost) bit number to look at,
1369 * and mask for all the relevant bits in this word.
1370 */
1373 /*
1374 * Calculate the difference between the value there
1375 * and what we're looking for.
1376 */
1378 /*
1379 * Different. Mark where we are and return.
1380 */
1385 }
1387 /*
1388 * Go on to next block if that's where the next word is
1389 * and we need the next word.
1390 */
1392 /*
1393 * If done with this block, get the previous one.
1394 */
1399 }
1403 /*
1404 * Go on to the previous word in the buffer.
1405 */
1406 b++;
1407 }
1409 /*
1410 * Starting on a word boundary, no partial word.
1411 */
1413 }
1414 /*
1415 * Loop over whole words in buffers. When we use up one buffer
1416 * we move on to the next one.
1417 */
1419 /*
1420 * Compute difference between actual and desired value.
1421 */
1423 /*
1424 * Different, mark where we are and return.
1425 */
1430 }
1432 /*
1433 * Go on to next block if that's where the next word is
1434 * and we need the next word.
1435 */
1437 /*
1438 * If done with this block, get the next one.
1439 */
1444 }
1448 /*
1449 * Go on to the next word in the buffer.
1450 */
1451 b++;
1452 }
1453 }
1454 /*
1455 * If not ending on a word boundary, deal with the last
1456 * (partial) word.
1457 */
1459 /*
1460 * Calculate mask for all the relevant bits in this word.
1461 */
1463 /*
1464 * Compute difference between actual and desired value.
1465 */
1467 /*
1468 * Different, mark where we are and return.
1469 */
1476 }
1477 /*
1478 * No match, return that we scanned the whole area.
1479 */
1483 }
1485 /*
1486 * Mark an extent specified by start and len freed.
1487 * Updates all the summary information as well as the bitmap.
1488 */
1497 {
1504 /*
1505 * Modify the bitmap to mark this extent freed.
1506 */
1510 }
1511 /*
1512 * Assume we're freeing out of the middle of an allocated extent.
1513 * We need to find the beginning and end of the extent so we can
1514 * properly update the summary.
1515 */
1519 }
1520 /*
1521 * Find the next allocated block (end of allocated extent).
1522 */
1525 /*
1526 * If there are blocks not being freed at the front of the
1527 * old extent, add summary data for them to be allocated.
1528 */
1535 }
1536 }
1537 /*
1538 * If there are blocks not being freed at the end of the
1539 * old extent, add summary data for them to be allocated.
1540 */
1547 }
1548 }
1549 /*
1550 * Increment the summary information corresponding to the entire
1551 * (new) free extent.
1552 */
1557 }
1559 /*
1560 * Read and return the summary information for a given extent size,
1561 * bitmap block combination.
1562 * Keeps track of a current summary block, so we don't keep reading
1563 * it from the buffer cache.
1564 */
1574 {
1581 /*
1582 * Compute entry number in the summary file.
1583 */
1585 /*
1586 * Compute the block number in the summary file.
1587 */
1589 /*
1590 * If we have an old buffer, and the block number matches, use that.
1591 */
1594 /*
1595 * Otherwise we have to get the buffer.
1596 */
1598 /*
1599 * If there was an old one, get rid of it first.
1600 */
1606 }
1607 /*
1608 * Remember this buffer and block for the next call.
1609 */
1613 }
1614 }
1615 /*
1616 * Point to the summary information & copy it out.
1617 */
1620 /*
1621 * Drop the buffer if we're not asked to remember it.
1622 */
1626 }
1628 /*
1629 * Set the given range of bitmap bits to the given value.
1630 * Do whatever I/O and logging is required.
1631 */
1639 {
1652 /*
1653 * Compute starting bitmap block number.
1654 */
1656 /*
1657 * Read the bitmap block, and point to its data.
1658 */
1662 }
1664 /*
1665 * Compute the starting word's address, and starting bit.
1666 */
1670 /*
1671 * 0 (allocated) => all zeroes; 1 (free) => all ones.
1672 */
1674 /*
1675 * If not starting on a word boundary, deal with the first
1676 * (partial) word.
1677 */
1679 /*
1680 * Compute first bit not changed and mask of relevant bits.
1681 */
1684 /*
1685 * Set/clear the active bits.
1686 */
1689 else
1692 /*
1693 * Go on to the next block if that's where the next word is
1694 * and we need the next word.
1695 */
1697 /*
1698 * Log the changed part of this block.
1699 * Get the next one.
1700 */
1707 }
1711 /*
1712 * Go on to the next word in the buffer
1713 */
1714 b++;
1715 }
1717 /*
1718 * Starting on a word boundary, no partial word.
1719 */
1721 }
1722 /*
1723 * Loop over whole words in buffers. When we use up one buffer
1724 * we move on to the next one.
1725 */
1727 /*
1728 * Set the word value correctly.
1729 */
1732 /*
1733 * Go on to the next block if that's where the next word is
1734 * and we need the next word.
1735 */
1737 /*
1738 * Log the changed part of this block.
1739 * Get the next one.
1740 */
1747 }
1751 /*
1752 * Go on to the next word in the buffer
1753 */
1754 b++;
1755 }
1756 }
1757 /*
1758 * If not ending on a word boundary, deal with the last
1759 * (partial) word.
1760 */
1762 /*
1763 * Compute a mask of relevant bits.
1764 */
1767 /*
1768 * Set/clear the active bits.
1769 */
1772 else
1774 b++;
1775 }
1776 /*
1777 * Log any remaining changed bytes.
1778 */
1783 }
1785 /*
1786 * Read and modify the summary information for a given extent size,
1787 * bitmap block combination.
1788 * Keeps track of a current summary block, so we don't keep reading
1789 * it from the buffer cache.
1790 */
1800 {
1807 /*
1808 * Compute entry number in the summary file.
1809 */
1811 /*
1812 * Compute the block number in the summary file.
1813 */
1815 /*
1816 * If we have an old buffer, and the block number matches, use that.
1817 */
1820 /*
1821 * Otherwise we have to get the buffer.
1822 */
1824 /*
1825 * If there was an old one, get rid of it first.
1826 */
1832 }
1833 /*
1834 * Remember this buffer and block for the next call.
1835 */
1839 }
1840 }
1841 /*
1842 * Point to the summary information, modify and log it.
1843 */
1849 }
1851 /*
1852 * Visible (exported) functions.
1853 */
1855 /*
1856 * Grow the realtime area of the filesystem.
1857 */
1858 int
1862 {
1885 /*
1886 * Initial error checking.
1887 */
1894 /*
1895 * Read in the last block of the device, make sure it exists.
1896 */
1904 /*
1905 * Calculate new parameters. These are the final values to be reached.
1906 */
1915 /*
1916 * New summary size can't be more than half the size of
1917 * the log. This prevents us from getting a log overflow,
1918 * since we'll log basically the whole summary file at once.
1919 */
1922 /*
1923 * Get the old block counts for bitmap and summary inodes.
1924 * These can't change since other growfs callers are locked out.
1925 */
1928 /*
1929 * Allocate space to the bitmap and summary files, as necessary.
1930 */
1937 /*
1938 * Allocate a new (fake) mount/sb.
1939 */
1941 /*
1942 * Loop over the bitmap blocks.
1943 * We will do everything one bitmap block at a time.
1944 * Skip the current block if it is exactly full.
1945 * This also deals with the case where there were no rtextents before.
1946 */
1950 bmbno++) {
1953 /*
1954 * Calculate new sb and mount fields for this round.
1955 */
1966 nrsumsize =
1971 /*
1972 * Start a transaction, get the log reservation.
1973 */
1979 /*
1980 * Lock out other callers by grabbing the bitmap inode lock.
1981 */
1986 /*
1987 * Update the bitmap inode's size.
1988 */
1993 /*
1994 * Get the summary inode into the transaction.
1995 */
2000 /*
2001 * Update the summary inode's size.
2002 */
2005 /*
2006 * Copy summary data from old to new sizes.
2007 * Do this when the real size (not block-aligned) changes.
2008 */
2014 }
2015 /*
2016 * Update superblock fields.
2017 */
2033 /*
2034 * Free new extent.
2035 */
2041 /*
2042 * Mark more blocks free in the superblock.
2043 */
2046 /*
2047 * Update mp values into the real mp structure.
2048 */
2056 }
2057 }
2062 /*
2063 * Free the fake mp structure.
2064 */
2068 }
2070 /*
2071 * Allocate an extent in the realtime subvolume, with the usual allocation
2072 * parameters. The length units are all in realtime extents, as is the
2073 * result block number.
2074 */
2086 {
2096 /*
2097 * If prod is set then figure out what to do to minlen and maxlen.
2098 */
2100 xfs_extlen_t i;
2109 }
2110 }
2111 /*
2112 * Lock out other callers by grabbing the bitmap inode lock.
2113 */
2118 /*
2119 * Allocate by size, or near another block, or exactly at some block.
2120 */
2136 }
2139 }
2140 /*
2141 * If it worked, update the superblock.
2142 */
2149 else
2151 }
2154 }
2156 /*
2157 * Free an extent in the realtime subvolume. Length is expressed in
2158 * realtime extents, as is the block number.
2159 */
2165 {
2173 /*
2174 * Synchronize by locking the bitmap inode.
2175 */
2179 #if defined(__KERNEL__) && defined(DEBUG)
2180 /*
2181 * Check to see that this whole range is currently allocated.
2182 */
2183 {
2189 }
2191 }
2192 #endif
2194 /*
2195 * Free the range of realtime blocks.
2196 */
2200 }
2201 /*
2202 * Mark more blocks free in the superblock.
2203 */
2205 /*
2206 * If we've now freed all the blocks, reset the file sequence
2207 * number to 0.
2208 */
2215 }
2217 }
2219 /*
2220 * Initialize realtime fields in the mount structure.
2221 */
2225 {
2238 }
2245 /*
2246 * Check that the realtime section is an ok size.
2247 */
2254 }
2264 }
2267 }
2269 /*
2270 * Get the bitmap and summary inodes into the mount structure
2271 * at mount time.
2272 */
2276 {
2292 }
2295 }
2297 /*
2298 * Pick an extent for allocation at the start of a new realtime file.
2299 * Use the sequence number stored in the atime field of the bitmap inode.
2300 * Translate this to a fraction of the rtextents, and return the product
2301 * of rtextents and the fraction.
2302 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
2303 */
2310 {
2327 }
2339 }
2344 }