| blob | 87323f1ded6466482f40b019d81fbbcc4905e400 |
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 {
93 /*
94 * Allocate space to the file, as necessary.
95 */
102 /*
103 * Reserve space & log for one extent added to the file.
104 */
107 XFS_TRANS_PERM_LOG_RES,
108 XFS_DEFAULT_PERM_LOG_COUNT)))
111 /*
112 * Lock the inode.
113 */
118 /*
119 * Allocate blocks to the bitmap file.
120 */
130 /*
131 * Free any blocks freed up in the transaction, then commit.
132 */
139 /*
140 * Now we need to clear the allocated blocks.
141 * Do this one block per transaction, to keep it simple.
142 */
148 /*
149 * Reserve log for one block zeroing.
150 */
154 /*
155 * Lock the bitmap inode.
156 */
159 /*
160 * Get a buffer for the block.
161 */
167 error_cancel:
170 }
173 /*
174 * Commit the transaction.
175 */
179 }
180 /*
181 * Go on to the next extent, if any.
182 */
184 }
186 error:
188 }
190 /*
191 * Attempt to allocate an extent minlen<=len<=maxlen starting from
192 * bitmap block bbno. If we don't get maxlen then use prod to trim
193 * the length, if given. Returns error; returns starting block in *rtblock.
194 * The lengths are all in rtextents.
195 */
209 {
218 /*
219 * Loop over all the extents starting in this bitmap block,
220 * looking for one that's long enough.
221 */
225 i++) {
226 /*
227 * See if there's a free extent of maxlen starting at i.
228 * If it's not so then next will contain the first non-free.
229 */
233 }
235 /*
236 * i for maxlen is all free, allocate and return that.
237 */
239 rsb);
242 }
246 }
247 /*
248 * In the case where we have a variable-sized allocation
249 * request, figure out how big this free piece is,
250 * and if it's big enough for the minimum, and the best
251 * so far, remember it.
252 */
260 }
261 }
262 /*
263 * If not done yet, find the start of the next free space.
264 */
269 }
272 }
273 /*
274 * Searched the whole thing & didn't find a maxlen free extent.
275 */
279 /*
280 * If size should be a multiple of prod, make that so.
281 */
284 /*
285 * Allocate besti for bestlen & return that.
286 */
290 }
294 }
295 /*
296 * Allocation failed. Set *nextp to the next block to try.
297 */
301 }
303 /*
304 * Allocate an extent of length minlen<=len<=maxlen, starting at block
305 * bno. If we don't get maxlen then use prod to trim the length, if given.
306 * Returns error; returns starting block in *rtblock.
307 * The lengths are all in rtextents.
308 */
321 {
328 /*
329 * Check if the range in question (for maxlen) is free.
330 */
334 }
336 /*
337 * If it is, allocate it and return success.
338 */
342 }
346 }
347 /*
348 * If not, allocate what there is, if it's at least minlen.
349 */
352 /*
353 * Failed, return failure status.
354 */
357 }
358 /*
359 * Trim off tail of extent, if prod is specified.
360 */
364 /*
365 * Now we can't do it, return failure status.
366 */
369 }
370 }
371 /*
372 * Allocate what we can and return it.
373 */
377 }
381 }
383 /*
384 * Allocate an extent of length minlen<=len<=maxlen, starting as near
385 * to bno as possible. If we don't get maxlen then use prod to trim
386 * the length, if given. The lengths are all in rtextents.
387 */
400 {
411 /*
412 * If the block number given is off the end, silently set it to
413 * the last block.
414 */
417 /*
418 * Try the exact allocation first.
419 */
424 }
425 /*
426 * If the exact allocation worked, return that.
427 */
431 }
436 /*
437 * Loop over all bitmap blocks (bbno + i is current block).
438 */
440 /*
441 * Get summary information of extents of all useful levels
442 * starting in this bitmap block.
443 */
448 }
449 /*
450 * If there are any useful extents starting here, try
451 * allocating one.
452 */
454 /*
455 * On the positive side of the starting location.
456 */
458 /*
459 * Try to allocate an extent starting in
460 * this block.
461 */
467 }
468 /*
469 * If it worked, return it.
470 */
474 }
475 }
476 /*
477 * On the negative side of the starting location.
478 */
480 /*
481 * Loop backwards through the bitmap blocks from
482 * the starting point-1 up to where we are now.
483 * There should be an extent which ends in this
484 * bitmap block and is long enough.
485 */
487 /*
488 * Grab the summary information for
489 * this bitmap block.
490 */
496 }
497 /*
498 * If there's no extent given in the
499 * summary that means the extent we
500 * found must carry over from an
501 * earlier block. If there is an
502 * extent given, we've already tried
503 * that allocation, don't do it again.
504 */
512 }
513 /*
514 * If it works, return the extent.
515 */
519 }
520 }
521 /*
522 * There weren't intervening bitmap blocks
523 * with a long enough extent, or the
524 * allocation didn't work for some reason
525 * (i.e. it's a little * too short).
526 * Try to allocate from the summary block
527 * that we found.
528 */
534 }
535 /*
536 * If it works, return the extent.
537 */
541 }
542 }
543 }
544 /*
545 * Loop control. If we were on the positive side, and there's
546 * still more blocks on the negative side, go there.
547 */
550 /*
551 * If positive, and no more negative, but there are more
552 * positive, go there.
553 */
555 i++;
556 /*
557 * If negative or 0 (just started), and there are positive
558 * blocks to go, go there. The 0 case moves to block 1.
559 */
562 /*
563 * If negative or 0 and there are more negative blocks,
564 * go there.
565 */
567 i--;
568 /*
569 * Must be done. Return failure.
570 */
571 else
573 }
576 }
578 /*
579 * Allocate an extent of length minlen<=len<=maxlen, with no position
580 * specified. If we don't get maxlen then use prod to trim
581 * the length, if given. The lengths are all in rtextents.
582 */
594 {
605 /*
606 * Loop over all the levels starting with maxlen.
607 * At each level, look at all the bitmap blocks, to see if there
608 * are extents starting there that are long enough (>= maxlen).
609 * Note, only on the initial level can the allocation fail if
610 * the summary says there's an extent.
611 */
613 /*
614 * Loop over all the bitmap blocks.
615 */
617 /*
618 * Get the summary for this level/block.
619 */
624 }
625 /*
626 * Nothing there, on to the next block.
627 */
630 /*
631 * Try allocating the extent.
632 */
637 }
638 /*
639 * If it worked, return that.
640 */
644 }
645 /*
646 * If the "next block to try" returned from the
647 * allocator is beyond the next bitmap block,
648 * skip to that bitmap block.
649 */
652 }
653 }
654 /*
655 * Didn't find any maxlen blocks. Try smaller ones, unless
656 * we're asking for a fixed size extent.
657 */
661 }
665 /*
666 * Loop over sizes, from maxlen down to minlen.
667 * This time, when we do the allocations, allow smaller ones
668 * to succeed.
669 */
671 /*
672 * Loop over all the bitmap blocks, try an allocation
673 * starting in that block.
674 */
676 /*
677 * Get the summary information for this level/block.
678 */
683 }
684 /*
685 * If nothing there, go on to next.
686 */
689 /*
690 * Try the allocation. Make sure the specified
691 * minlen/maxlen are in the possible range for
692 * this summary level.
693 */
700 }
701 /*
702 * If it worked, return that extent.
703 */
707 }
708 /*
709 * If the "next block to try" returned from the
710 * allocator is beyond the next bitmap block,
711 * skip to that bitmap block.
712 */
715 }
716 }
717 /*
718 * Got nothing, return failure.
719 */
722 }
724 /*
725 * Mark an extent specified by start and len allocated.
726 * Updates all the summary information as well as the bitmap.
727 */
736 {
743 /*
744 * Assume we're allocating out of the middle of a free extent.
745 * We need to find the beginning and end of the extent so we can
746 * properly update the summary.
747 */
751 }
752 /*
753 * Find the next allocated block (end of free extent).
754 */
759 }
760 /*
761 * Decrement the summary information corresponding to the entire
762 * (old) free extent.
763 */
769 }
770 /*
771 * If there are blocks not being allocated at the front of the
772 * old extent, add summary data for them to be free.
773 */
780 }
781 }
782 /*
783 * If there are blocks not being allocated at the end of the
784 * old extent, add summary data for them to be free.
785 */
792 }
793 }
794 /*
795 * Modify the bitmap to mark this extent allocated.
796 */
799 }
801 /*
802 * Return whether there are any free extents in the size range given
803 * by low and high, for the bitmap block bbno.
804 */
815 {
820 /*
821 * Loop over logs of extent sizes. Order is irrelevant.
822 */
824 /*
825 * Get one summary datum.
826 */
830 }
831 /*
832 * If there are any, return success.
833 */
837 }
838 }
839 /*
840 * Found nothing, return failure.
841 */
844 }
846 /*
847 * Get a buffer for the bitmap or summary file block specified.
848 * The buffer is returned read and locked.
849 */
857 {
860 xfs_bmbt_irec_t map;
879 }
881 #ifdef DEBUG
882 /*
883 * Check that the given extent (block range) is allocated already.
884 */
892 {
896 }
897 #endif
899 /*
900 * Check that the given range is either all allocated (val = 0) or
901 * all free (val = 1).
902 */
912 {
925 /*
926 * Compute starting bitmap block number
927 */
929 /*
930 * Read the bitmap block.
931 */
935 }
937 /*
938 * Compute the starting word's address, and starting bit.
939 */
943 /*
944 * 0 (allocated) => all zero's; 1 (free) => all one's.
945 */
947 /*
948 * If not starting on a word boundary, deal with the first
949 * (partial) word.
950 */
952 /*
953 * Compute first bit not examined.
954 */
956 /*
957 * Mask of relevant bits.
958 */
960 /*
961 * Compute difference between actual and desired value.
962 */
964 /*
965 * Different, compute first wrong bit and return.
966 */
972 }
974 /*
975 * Go on to next block if that's where the next word is
976 * and we need the next word.
977 */
979 /*
980 * If done with this block, get the next one.
981 */
986 }
990 /*
991 * Go on to the next word in the buffer.
992 */
993 b++;
994 }
996 /*
997 * Starting on a word boundary, no partial word.
998 */
1000 }
1001 /*
1002 * Loop over whole words in buffers. When we use up one buffer
1003 * we move on to the next one.
1004 */
1006 /*
1007 * Compute difference between actual and desired value.
1008 */
1010 /*
1011 * Different, compute first wrong bit and return.
1012 */
1018 }
1020 /*
1021 * Go on to next block if that's where the next word is
1022 * and we need the next word.
1023 */
1025 /*
1026 * If done with this block, get the next one.
1027 */
1032 }
1036 /*
1037 * Go on to the next word in the buffer.
1038 */
1039 b++;
1040 }
1041 }
1042 /*
1043 * If not ending on a word boundary, deal with the last
1044 * (partial) word.
1045 */
1047 /*
1048 * Mask of relevant bits.
1049 */
1051 /*
1052 * Compute difference between actual and desired value.
1053 */
1055 /*
1056 * Different, compute first wrong bit and return.
1057 */
1065 }
1066 /*
1067 * Successful, return.
1068 */
1073 }
1075 /*
1076 * Copy and transform the summary file, given the old and new
1077 * parameters in the mount structures.
1078 */
1084 {
1096 bbno--) {
1112 }
1113 }
1115 }
1117 /*
1118 * Searching backward from start to limit, find the first block whose
1119 * allocated/free state is different from start's.
1120 */
1128 {
1143 /*
1144 * Compute and read in starting bitmap block for starting block.
1145 */
1150 }
1152 /*
1153 * Get the first word's index & point to it.
1154 */
1159 /*
1160 * Compute match value, based on the bit at start: if 1 (free)
1161 * then all-ones, else all-zeroes.
1162 */
1164 /*
1165 * If the starting position is not word-aligned, deal with the
1166 * partial word.
1167 */
1169 /*
1170 * Calculate first (leftmost) bit number to look at,
1171 * and mask for all the relevant bits in this word.
1172 */
1175 firstbit;
1176 /*
1177 * Calculate the difference between the value there
1178 * and what we're looking for.
1179 */
1181 /*
1182 * Different. Mark where we are and return.
1183 */
1188 }
1190 /*
1191 * Go on to previous block if that's where the previous word is
1192 * and we need the previous word.
1193 */
1195 /*
1196 * If done with this block, get the previous one.
1197 */
1202 }
1207 /*
1208 * Go on to the previous word in the buffer.
1209 */
1210 b--;
1211 }
1213 /*
1214 * Starting on a word boundary, no partial word.
1215 */
1217 }
1218 /*
1219 * Loop over whole words in buffers. When we use up one buffer
1220 * we move on to the previous one.
1221 */
1223 /*
1224 * Compute difference between actual and desired value.
1225 */
1227 /*
1228 * Different, mark where we are and return.
1229 */
1234 }
1236 /*
1237 * Go on to previous block if that's where the previous word is
1238 * and we need the previous word.
1239 */
1241 /*
1242 * If done with this block, get the previous one.
1243 */
1248 }
1253 /*
1254 * Go on to the previous word in the buffer.
1255 */
1256 b--;
1257 }
1258 }
1259 /*
1260 * If not ending on a word boundary, deal with the last
1261 * (partial) word.
1262 */
1264 /*
1265 * Calculate first (leftmost) bit number to look at,
1266 * and mask for all the relevant bits in this word.
1267 */
1270 /*
1271 * Compute difference between actual and desired value.
1272 */
1274 /*
1275 * Different, mark where we are and return.
1276 */
1283 }
1284 /*
1285 * No match, return that we scanned the whole area.
1286 */
1290 }
1292 /*
1293 * Searching forward from start to limit, find the first block whose
1294 * allocated/free state is different from start's.
1295 */
1303 {
1318 /*
1319 * Compute and read in starting bitmap block for starting block.
1320 */
1325 }
1327 /*
1328 * Get the first word's index & point to it.
1329 */
1334 /*
1335 * Compute match value, based on the bit at start: if 1 (free)
1336 * then all-ones, else all-zeroes.
1337 */
1339 /*
1340 * If the starting position is not word-aligned, deal with the
1341 * partial word.
1342 */
1344 /*
1345 * Calculate last (rightmost) bit number to look at,
1346 * and mask for all the relevant bits in this word.
1347 */
1350 /*
1351 * Calculate the difference between the value there
1352 * and what we're looking for.
1353 */
1355 /*
1356 * Different. Mark where we are and return.
1357 */
1362 }
1364 /*
1365 * Go on to next block if that's where the next word is
1366 * and we need the next word.
1367 */
1369 /*
1370 * If done with this block, get the previous one.
1371 */
1376 }
1380 /*
1381 * Go on to the previous word in the buffer.
1382 */
1383 b++;
1384 }
1386 /*
1387 * Starting on a word boundary, no partial word.
1388 */
1390 }
1391 /*
1392 * Loop over whole words in buffers. When we use up one buffer
1393 * we move on to the next one.
1394 */
1396 /*
1397 * Compute difference between actual and desired value.
1398 */
1400 /*
1401 * Different, mark where we are and return.
1402 */
1407 }
1409 /*
1410 * Go on to next block if that's where the next word is
1411 * and we need the next word.
1412 */
1414 /*
1415 * If done with this block, get the next one.
1416 */
1421 }
1425 /*
1426 * Go on to the next word in the buffer.
1427 */
1428 b++;
1429 }
1430 }
1431 /*
1432 * If not ending on a word boundary, deal with the last
1433 * (partial) word.
1434 */
1436 /*
1437 * Calculate mask for all the relevant bits in this word.
1438 */
1440 /*
1441 * Compute difference between actual and desired value.
1442 */
1444 /*
1445 * Different, mark where we are and return.
1446 */
1453 }
1454 /*
1455 * No match, return that we scanned the whole area.
1456 */
1460 }
1462 /*
1463 * Mark an extent specified by start and len freed.
1464 * Updates all the summary information as well as the bitmap.
1465 */
1474 {
1481 /*
1482 * Modify the bitmap to mark this extent freed.
1483 */
1487 }
1488 /*
1489 * Assume we're freeing out of the middle of an allocated extent.
1490 * We need to find the beginning and end of the extent so we can
1491 * properly update the summary.
1492 */
1496 }
1497 /*
1498 * Find the next allocated block (end of allocated extent).
1499 */
1504 /*
1505 * If there are blocks not being freed at the front of the
1506 * old extent, add summary data for them to be allocated.
1507 */
1514 }
1515 }
1516 /*
1517 * If there are blocks not being freed at the end of the
1518 * old extent, add summary data for them to be allocated.
1519 */
1526 }
1527 }
1528 /*
1529 * Increment the summary information corresponding to the entire
1530 * (new) free extent.
1531 */
1536 }
1538 /*
1539 * Read and return the summary information for a given extent size,
1540 * bitmap block combination.
1541 * Keeps track of a current summary block, so we don't keep reading
1542 * it from the buffer cache.
1543 */
1553 {
1560 /*
1561 * Compute entry number in the summary file.
1562 */
1564 /*
1565 * Compute the block number in the summary file.
1566 */
1568 /*
1569 * If we have an old buffer, and the block number matches, use that.
1570 */
1573 /*
1574 * Otherwise we have to get the buffer.
1575 */
1577 /*
1578 * If there was an old one, get rid of it first.
1579 */
1585 }
1586 /*
1587 * Remember this buffer and block for the next call.
1588 */
1592 }
1593 }
1594 /*
1595 * Point to the summary information & copy it out.
1596 */
1599 /*
1600 * Drop the buffer if we're not asked to remember it.
1601 */
1605 }
1607 /*
1608 * Set the given range of bitmap bits to the given value.
1609 * Do whatever I/O and logging is required.
1610 */
1618 {
1631 /*
1632 * Compute starting bitmap block number.
1633 */
1635 /*
1636 * Read the bitmap block, and point to its data.
1637 */
1641 }
1643 /*
1644 * Compute the starting word's address, and starting bit.
1645 */
1649 /*
1650 * 0 (allocated) => all zeroes; 1 (free) => all ones.
1651 */
1653 /*
1654 * If not starting on a word boundary, deal with the first
1655 * (partial) word.
1656 */
1658 /*
1659 * Compute first bit not changed and mask of relevant bits.
1660 */
1663 /*
1664 * Set/clear the active bits.
1665 */
1668 else
1671 /*
1672 * Go on to the next block if that's where the next word is
1673 * and we need the next word.
1674 */
1676 /*
1677 * Log the changed part of this block.
1678 * Get the next one.
1679 */
1686 }
1690 /*
1691 * Go on to the next word in the buffer
1692 */
1693 b++;
1694 }
1696 /*
1697 * Starting on a word boundary, no partial word.
1698 */
1700 }
1701 /*
1702 * Loop over whole words in buffers. When we use up one buffer
1703 * we move on to the next one.
1704 */
1706 /*
1707 * Set the word value correctly.
1708 */
1711 /*
1712 * Go on to the next block if that's where the next word is
1713 * and we need the next word.
1714 */
1716 /*
1717 * Log the changed part of this block.
1718 * Get the next one.
1719 */
1726 }
1730 /*
1731 * Go on to the next word in the buffer
1732 */
1733 b++;
1734 }
1735 }
1736 /*
1737 * If not ending on a word boundary, deal with the last
1738 * (partial) word.
1739 */
1741 /*
1742 * Compute a mask of relevant bits.
1743 */
1746 /*
1747 * Set/clear the active bits.
1748 */
1751 else
1753 b++;
1754 }
1755 /*
1756 * Log any remaining changed bytes.
1757 */
1762 }
1764 /*
1765 * Read and modify the summary information for a given extent size,
1766 * bitmap block combination.
1767 * Keeps track of a current summary block, so we don't keep reading
1768 * it from the buffer cache.
1769 */
1779 {
1786 /*
1787 * Compute entry number in the summary file.
1788 */
1790 /*
1791 * Compute the block number in the summary file.
1792 */
1794 /*
1795 * If we have an old buffer, and the block number matches, use that.
1796 */
1799 /*
1800 * Otherwise we have to get the buffer.
1801 */
1803 /*
1804 * If there was an old one, get rid of it first.
1805 */
1811 }
1812 /*
1813 * Remember this buffer and block for the next call.
1814 */
1818 }
1819 }
1820 /*
1821 * Point to the summary information, modify and log it.
1822 */
1828 }
1830 /*
1831 * Visible (exported) functions.
1832 */
1834 /*
1835 * Grow the realtime area of the filesystem.
1836 */
1837 int
1841 {
1860 /*
1861 * Initial error checking.
1862 */
1871 /*
1872 * Read in the last block of the device, make sure it exists.
1873 */
1881 /*
1882 * Calculate new parameters. These are the final values to be reached.
1883 */
1892 /*
1893 * New summary size can't be more than half the size of
1894 * the log. This prevents us from getting a log overflow,
1895 * since we'll log basically the whole summary file at once.
1896 */
1899 /*
1900 * Get the old block counts for bitmap and summary inodes.
1901 * These can't change since other growfs callers are locked out.
1902 */
1905 /*
1906 * Allocate space to the bitmap and summary files, as necessary.
1907 */
1914 /*
1915 * Allocate a new (fake) mount/sb.
1916 */
1918 /*
1919 * Loop over the bitmap blocks.
1920 * We will do everything one bitmap block at a time.
1921 * Skip the current block if it is exactly full.
1922 * This also deals with the case where there were no rtextents before.
1923 */
1927 bmbno++) {
1933 /*
1934 * Calculate new sb and mount fields for this round.
1935 */
1947 nrsumsize =
1952 /*
1953 * Start a transaction, get the log reservation.
1954 */
1959 /*
1960 * Lock out other callers by grabbing the bitmap inode lock.
1961 */
1964 /*
1965 * Update the bitmap inode's size.
1966 */
1971 /*
1972 * Get the summary inode into the transaction.
1973 */
1976 /*
1977 * Update the summary inode's size.
1978 */
1981 /*
1982 * Copy summary data from old to new sizes.
1983 * Do this when the real size (not block-aligned) changes.
1984 */
1990 }
1991 /*
1992 * Update superblock fields.
1993 */
2009 /*
2010 * Free new extent.
2011 */
2016 error_cancel:
2019 }
2020 /*
2021 * Mark more blocks free in the superblock.
2022 */
2025 /*
2026 * Update mp values into the real mp structure.
2027 */
2034 }
2036 /*
2037 * Free the fake mp structure.
2038 */
2042 }
2044 /*
2045 * Allocate an extent in the realtime subvolume, with the usual allocation
2046 * parameters. The length units are all in realtime extents, as is the
2047 * result block number.
2048 */
2060 {
2070 /*
2071 * If prod is set then figure out what to do to minlen and maxlen.
2072 */
2074 xfs_extlen_t i;
2083 }
2084 }
2087 /*
2088 * Allocate by size, or near another block, or exactly at some block.
2089 */
2106 }
2110 /*
2111 * If it worked, update the superblock.
2112 */
2119 else
2121 }
2124 }
2126 /*
2127 * Free an extent in the realtime subvolume. Length is expressed in
2128 * realtime extents, as is the block number.
2129 */
2135 {
2142 /*
2143 * Synchronize by locking the bitmap inode.
2144 */
2148 #if defined(__KERNEL__) && defined(DEBUG)
2149 /*
2150 * Check to see that this whole range is currently allocated.
2151 */
2152 {
2158 }
2160 }
2161 #endif
2163 /*
2164 * Free the range of realtime blocks.
2165 */
2169 }
2170 /*
2171 * Mark more blocks free in the superblock.
2172 */
2174 /*
2175 * If we've now freed all the blocks, reset the file sequence
2176 * number to 0.
2177 */
2184 }
2186 }
2188 /*
2189 * Initialize realtime fields in the mount structure.
2190 */
2194 {
2206 }
2213 /*
2214 * Check that the realtime section is an ok size.
2215 */
2222 }
2229 }
2232 }
2234 /*
2235 * Get the bitmap and summary inodes into the mount structure
2236 * at mount time.
2237 */
2241 {
2257 }
2260 }
2262 void
2265 {
2270 }
2272 /*
2273 * Pick an extent for allocation at the start of a new realtime file.
2274 * Use the sequence number stored in the atime field of the bitmap inode.
2275 * Translate this to a fraction of the rtextents, and return the product
2276 * of rtextents and the fraction.
2277 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ...
2278 */
2285 {
2298 }
2310 }
2315 }