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 */ 18 #include "xfs.h" 19 #include "xfs_fs.h" 20 #include "xfs_shared.h" 21 #include "xfs_format.h" 22 #include "xfs_log_format.h" 23 #include "xfs_trans_resv.h" 24 #include "xfs_bit.h" 25 #include "xfs_sb.h" 26 #include "xfs_ag.h" 27 #include "xfs_mount.h" 28 #include "xfs_inode.h" 29 #include "xfs_bmap.h" 30 #include "xfs_bmap_util.h" 31 #include "xfs_bmap_btree.h" 32 #include "xfs_alloc.h" 33 #include "xfs_error.h" 34 #include "xfs_trans.h" 35 #include "xfs_trans_space.h" 36 #include "xfs_trace.h" 37 #include "xfs_buf.h" 38 #include "xfs_icache.h" 39 #include "xfs_dinode.h" 40 #include "xfs_rtalloc.h" 41 42 43 /* 44 * Read and return the summary information for a given extent size, 45 * bitmap block combination. 46 * Keeps track of a current summary block, so we don't keep reading 47 * it from the buffer cache. 48 */ 49 static int 50 xfs_rtget_summary( 51 xfs_mount_t *mp, /* file system mount structure */ 52 xfs_trans_t *tp, /* transaction pointer */ 53 int log, /* log2 of extent size */ 54 xfs_rtblock_t bbno, /* bitmap block number */ 55 xfs_buf_t **rbpp, /* in/out: summary block buffer */ 56 xfs_fsblock_t *rsb, /* in/out: summary block number */ 57 xfs_suminfo_t *sum) /* out: summary info for this block */ 58 { 59 return xfs_rtmodify_summary_int(mp, tp, log, bbno, 0, rbpp, rsb, sum); 60 } 61 62 /* 63 * Return whether there are any free extents in the size range given 64 * by low and high, for the bitmap block bbno. 65 */ 66 STATIC int /* error */ 67 xfs_rtany_summary( 68 xfs_mount_t *mp, /* file system mount structure */ 69 xfs_trans_t *tp, /* transaction pointer */ 70 int low, /* low log2 extent size */ 71 int high, /* high log2 extent size */ 72 xfs_rtblock_t bbno, /* bitmap block number */ 73 xfs_buf_t **rbpp, /* in/out: summary block buffer */ 74 xfs_fsblock_t *rsb, /* in/out: summary block number */ 75 int *stat) /* out: any good extents here? */ 76 { 77 int error; /* error value */ 78 int log; /* loop counter, log2 of ext. size */ 79 xfs_suminfo_t sum; /* summary data */ 80 81 /* 82 * Loop over logs of extent sizes. Order is irrelevant. 83 */ 84 for (log = low; log <= high; log++) { 85 /* 86 * Get one summary datum. 87 */ 88 error = xfs_rtget_summary(mp, tp, log, bbno, rbpp, rsb, &sum); 89 if (error) { 90 return error; 91 } 92 /* 93 * If there are any, return success. 94 */ 95 if (sum) { 96 *stat = 1; 97 return 0; 98 } 99 } 100 /* 101 * Found nothing, return failure. 102 */ 103 *stat = 0; 104 return 0; 105 } 106 107 108 /* 109 * Copy and transform the summary file, given the old and new 110 * parameters in the mount structures. 111 */ 112 STATIC int /* error */ 113 xfs_rtcopy_summary( 114 xfs_mount_t *omp, /* old file system mount point */ 115 xfs_mount_t *nmp, /* new file system mount point */ 116 xfs_trans_t *tp) /* transaction pointer */ 117 { 118 xfs_rtblock_t bbno; /* bitmap block number */ 119 xfs_buf_t *bp; /* summary buffer */ 120 int error; /* error return value */ 121 int log; /* summary level number (log length) */ 122 xfs_suminfo_t sum; /* summary data */ 123 xfs_fsblock_t sumbno; /* summary block number */ 124 125 bp = NULL; 126 for (log = omp->m_rsumlevels - 1; log >= 0; log--) { 127 for (bbno = omp->m_sb.sb_rbmblocks - 1; 128 (xfs_srtblock_t)bbno >= 0; 129 bbno--) { 130 error = xfs_rtget_summary(omp, tp, log, bbno, &bp, 131 &sumbno, &sum); 132 if (error) 133 return error; 134 if (sum == 0) 135 continue; 136 error = xfs_rtmodify_summary(omp, tp, log, bbno, -sum, 137 &bp, &sumbno); 138 if (error) 139 return error; 140 error = xfs_rtmodify_summary(nmp, tp, log, bbno, sum, 141 &bp, &sumbno); 142 if (error) 143 return error; 144 ASSERT(sum > 0); 145 } 146 } 147 return 0; 148 } 149 /* 150 * Mark an extent specified by start and len allocated. 151 * Updates all the summary information as well as the bitmap. 152 */ 153 STATIC int /* error */ 154 xfs_rtallocate_range( 155 xfs_mount_t *mp, /* file system mount point */ 156 xfs_trans_t *tp, /* transaction pointer */ 157 xfs_rtblock_t start, /* start block to allocate */ 158 xfs_extlen_t len, /* length to allocate */ 159 xfs_buf_t **rbpp, /* in/out: summary block buffer */ 160 xfs_fsblock_t *rsb) /* in/out: summary block number */ 161 { 162 xfs_rtblock_t end; /* end of the allocated extent */ 163 int error; /* error value */ 164 xfs_rtblock_t postblock = 0; /* first block allocated > end */ 165 xfs_rtblock_t preblock = 0; /* first block allocated < start */ 166 167 end = start + len - 1; 168 /* 169 * Assume we're allocating out of the middle of a free extent. 170 * We need to find the beginning and end of the extent so we can 171 * properly update the summary. 172 */ 173 error = xfs_rtfind_back(mp, tp, start, 0, &preblock); 174 if (error) { 175 return error; 176 } 177 /* 178 * Find the next allocated block (end of free extent). 179 */ 180 error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1, 181 &postblock); 182 if (error) { 183 return error; 184 } 185 /* 186 * Decrement the summary information corresponding to the entire 187 * (old) free extent. 188 */ 189 error = xfs_rtmodify_summary(mp, tp, 190 XFS_RTBLOCKLOG(postblock + 1 - preblock), 191 XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb); 192 if (error) { 193 return error; 194 } 195 /* 196 * If there are blocks not being allocated at the front of the 197 * old extent, add summary data for them to be free. 198 */ 199 if (preblock < start) { 200 error = xfs_rtmodify_summary(mp, tp, 201 XFS_RTBLOCKLOG(start - preblock), 202 XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb); 203 if (error) { 204 return error; 205 } 206 } 207 /* 208 * If there are blocks not being allocated at the end of the 209 * old extent, add summary data for them to be free. 210 */ 211 if (postblock > end) { 212 error = xfs_rtmodify_summary(mp, tp, 213 XFS_RTBLOCKLOG(postblock - end), 214 XFS_BITTOBLOCK(mp, end + 1), 1, rbpp, rsb); 215 if (error) { 216 return error; 217 } 218 } 219 /* 220 * Modify the bitmap to mark this extent allocated. 221 */ 222 error = xfs_rtmodify_range(mp, tp, start, len, 0); 223 return error; 224 } 225 226 /* 227 * Attempt to allocate an extent minlen<=len<=maxlen starting from 228 * bitmap block bbno. If we don't get maxlen then use prod to trim 229 * the length, if given. Returns error; returns starting block in *rtblock. 230 * The lengths are all in rtextents. 231 */ 232 STATIC int /* error */ 233 xfs_rtallocate_extent_block( 234 xfs_mount_t *mp, /* file system mount point */ 235 xfs_trans_t *tp, /* transaction pointer */ 236 xfs_rtblock_t bbno, /* bitmap block number */ 237 xfs_extlen_t minlen, /* minimum length to allocate */ 238 xfs_extlen_t maxlen, /* maximum length to allocate */ 239 xfs_extlen_t *len, /* out: actual length allocated */ 240 xfs_rtblock_t *nextp, /* out: next block to try */ 241 xfs_buf_t **rbpp, /* in/out: summary block buffer */ 242 xfs_fsblock_t *rsb, /* in/out: summary block number */ 243 xfs_extlen_t prod, /* extent product factor */ 244 xfs_rtblock_t *rtblock) /* out: start block allocated */ 245 { 246 xfs_rtblock_t besti; /* best rtblock found so far */ 247 xfs_rtblock_t bestlen; /* best length found so far */ 248 xfs_rtblock_t end; /* last rtblock in chunk */ 249 int error; /* error value */ 250 xfs_rtblock_t i; /* current rtblock trying */ 251 xfs_rtblock_t next; /* next rtblock to try */ 252 int stat; /* status from internal calls */ 253 254 /* 255 * Loop over all the extents starting in this bitmap block, 256 * looking for one that's long enough. 257 */ 258 for (i = XFS_BLOCKTOBIT(mp, bbno), besti = -1, bestlen = 0, 259 end = XFS_BLOCKTOBIT(mp, bbno + 1) - 1; 260 i <= end; 261 i++) { 262 /* 263 * See if there's a free extent of maxlen starting at i. 264 * If it's not so then next will contain the first non-free. 265 */ 266 error = xfs_rtcheck_range(mp, tp, i, maxlen, 1, &next, &stat); 267 if (error) { 268 return error; 269 } 270 if (stat) { 271 /* 272 * i for maxlen is all free, allocate and return that. 273 */ 274 error = xfs_rtallocate_range(mp, tp, i, maxlen, rbpp, 275 rsb); 276 if (error) { 277 return error; 278 } 279 *len = maxlen; 280 *rtblock = i; 281 return 0; 282 } 283 /* 284 * In the case where we have a variable-sized allocation 285 * request, figure out how big this free piece is, 286 * and if it's big enough for the minimum, and the best 287 * so far, remember it. 288 */ 289 if (minlen < maxlen) { 290 xfs_rtblock_t thislen; /* this extent size */ 291 292 thislen = next - i; 293 if (thislen >= minlen && thislen > bestlen) { 294 besti = i; 295 bestlen = thislen; 296 } 297 } 298 /* 299 * If not done yet, find the start of the next free space. 300 */ 301 if (next < end) { 302 error = xfs_rtfind_forw(mp, tp, next, end, &i); 303 if (error) { 304 return error; 305 } 306 } else 307 break; 308 } 309 /* 310 * Searched the whole thing & didn't find a maxlen free extent. 311 */ 312 if (minlen < maxlen && besti != -1) { 313 xfs_extlen_t p; /* amount to trim length by */ 314 315 /* 316 * If size should be a multiple of prod, make that so. 317 */ 318 if (prod > 1 && (p = do_mod(bestlen, prod))) 319 bestlen -= p; 320 /* 321 * Allocate besti for bestlen & return that. 322 */ 323 error = xfs_rtallocate_range(mp, tp, besti, bestlen, rbpp, rsb); 324 if (error) { 325 return error; 326 } 327 *len = bestlen; 328 *rtblock = besti; 329 return 0; 330 } 331 /* 332 * Allocation failed. Set *nextp to the next block to try. 333 */ 334 *nextp = next; 335 *rtblock = NULLRTBLOCK; 336 return 0; 337 } 338 339 /* 340 * Allocate an extent of length minlen<=len<=maxlen, starting at block 341 * bno. If we don't get maxlen then use prod to trim the length, if given. 342 * Returns error; returns starting block in *rtblock. 343 * The lengths are all in rtextents. 344 */ 345 STATIC int /* error */ 346 xfs_rtallocate_extent_exact( 347 xfs_mount_t *mp, /* file system mount point */ 348 xfs_trans_t *tp, /* transaction pointer */ 349 xfs_rtblock_t bno, /* starting block number to allocate */ 350 xfs_extlen_t minlen, /* minimum length to allocate */ 351 xfs_extlen_t maxlen, /* maximum length to allocate */ 352 xfs_extlen_t *len, /* out: actual length allocated */ 353 xfs_buf_t **rbpp, /* in/out: summary block buffer */ 354 xfs_fsblock_t *rsb, /* in/out: summary block number */ 355 xfs_extlen_t prod, /* extent product factor */ 356 xfs_rtblock_t *rtblock) /* out: start block allocated */ 357 { 358 int error; /* error value */ 359 xfs_extlen_t i; /* extent length trimmed due to prod */ 360 int isfree; /* extent is free */ 361 xfs_rtblock_t next; /* next block to try (dummy) */ 362 363 ASSERT(minlen % prod == 0 && maxlen % prod == 0); 364 /* 365 * Check if the range in question (for maxlen) is free. 366 */ 367 error = xfs_rtcheck_range(mp, tp, bno, maxlen, 1, &next, &isfree); 368 if (error) { 369 return error; 370 } 371 if (isfree) { 372 /* 373 * If it is, allocate it and return success. 374 */ 375 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb); 376 if (error) { 377 return error; 378 } 379 *len = maxlen; 380 *rtblock = bno; 381 return 0; 382 } 383 /* 384 * If not, allocate what there is, if it's at least minlen. 385 */ 386 maxlen = next - bno; 387 if (maxlen < minlen) { 388 /* 389 * Failed, return failure status. 390 */ 391 *rtblock = NULLRTBLOCK; 392 return 0; 393 } 394 /* 395 * Trim off tail of extent, if prod is specified. 396 */ 397 if (prod > 1 && (i = maxlen % prod)) { 398 maxlen -= i; 399 if (maxlen < minlen) { 400 /* 401 * Now we can't do it, return failure status. 402 */ 403 *rtblock = NULLRTBLOCK; 404 return 0; 405 } 406 } 407 /* 408 * Allocate what we can and return it. 409 */ 410 error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb); 411 if (error) { 412 return error; 413 } 414 *len = maxlen; 415 *rtblock = bno; 416 return 0; 417 } 418 419 /* 420 * Allocate an extent of length minlen<=len<=maxlen, starting as near 421 * to bno as possible. If we don't get maxlen then use prod to trim 422 * the length, if given. The lengths are all in rtextents. 423 */ 424 STATIC int /* error */ 425 xfs_rtallocate_extent_near( 426 xfs_mount_t *mp, /* file system mount point */ 427 xfs_trans_t *tp, /* transaction pointer */ 428 xfs_rtblock_t bno, /* starting block number to allocate */ 429 xfs_extlen_t minlen, /* minimum length to allocate */ 430 xfs_extlen_t maxlen, /* maximum length to allocate */ 431 xfs_extlen_t *len, /* out: actual length allocated */ 432 xfs_buf_t **rbpp, /* in/out: summary block buffer */ 433 xfs_fsblock_t *rsb, /* in/out: summary block number */ 434 xfs_extlen_t prod, /* extent product factor */ 435 xfs_rtblock_t *rtblock) /* out: start block allocated */ 436 { 437 int any; /* any useful extents from summary */ 438 xfs_rtblock_t bbno; /* bitmap block number */ 439 int error; /* error value */ 440 int i; /* bitmap block offset (loop control) */ 441 int j; /* secondary loop control */ 442 int log2len; /* log2 of minlen */ 443 xfs_rtblock_t n; /* next block to try */ 444 xfs_rtblock_t r; /* result block */ 445 446 ASSERT(minlen % prod == 0 && maxlen % prod == 0); 447 /* 448 * If the block number given is off the end, silently set it to 449 * the last block. 450 */ 451 if (bno >= mp->m_sb.sb_rextents) 452 bno = mp->m_sb.sb_rextents - 1; 453 /* 454 * Try the exact allocation first. 455 */ 456 error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, len, 457 rbpp, rsb, prod, &r); 458 if (error) { 459 return error; 460 } 461 /* 462 * If the exact allocation worked, return that. 463 */ 464 if (r != NULLRTBLOCK) { 465 *rtblock = r; 466 return 0; 467 } 468 bbno = XFS_BITTOBLOCK(mp, bno); 469 i = 0; 470 ASSERT(minlen != 0); 471 log2len = xfs_highbit32(minlen); 472 /* 473 * Loop over all bitmap blocks (bbno + i is current block). 474 */ 475 for (;;) { 476 /* 477 * Get summary information of extents of all useful levels 478 * starting in this bitmap block. 479 */ 480 error = xfs_rtany_summary(mp, tp, log2len, mp->m_rsumlevels - 1, 481 bbno + i, rbpp, rsb, &any); 482 if (error) { 483 return error; 484 } 485 /* 486 * If there are any useful extents starting here, try 487 * allocating one. 488 */ 489 if (any) { 490 /* 491 * On the positive side of the starting location. 492 */ 493 if (i >= 0) { 494 /* 495 * Try to allocate an extent starting in 496 * this block. 497 */ 498 error = xfs_rtallocate_extent_block(mp, tp, 499 bbno + i, minlen, maxlen, len, &n, rbpp, 500 rsb, prod, &r); 501 if (error) { 502 return error; 503 } 504 /* 505 * If it worked, return it. 506 */ 507 if (r != NULLRTBLOCK) { 508 *rtblock = r; 509 return 0; 510 } 511 } 512 /* 513 * On the negative side of the starting location. 514 */ 515 else { /* i < 0 */ 516 /* 517 * Loop backwards through the bitmap blocks from 518 * the starting point-1 up to where we are now. 519 * There should be an extent which ends in this 520 * bitmap block and is long enough. 521 */ 522 for (j = -1; j > i; j--) { 523 /* 524 * Grab the summary information for 525 * this bitmap block. 526 */ 527 error = xfs_rtany_summary(mp, tp, 528 log2len, mp->m_rsumlevels - 1, 529 bbno + j, rbpp, rsb, &any); 530 if (error) { 531 return error; 532 } 533 /* 534 * If there's no extent given in the 535 * summary that means the extent we 536 * found must carry over from an 537 * earlier block. If there is an 538 * extent given, we've already tried 539 * that allocation, don't do it again. 540 */ 541 if (any) 542 continue; 543 error = xfs_rtallocate_extent_block(mp, 544 tp, bbno + j, minlen, maxlen, 545 len, &n, rbpp, rsb, prod, &r); 546 if (error) { 547 return error; 548 } 549 /* 550 * If it works, return the extent. 551 */ 552 if (r != NULLRTBLOCK) { 553 *rtblock = r; 554 return 0; 555 } 556 } 557 /* 558 * There weren't intervening bitmap blocks 559 * with a long enough extent, or the 560 * allocation didn't work for some reason 561 * (i.e. it's a little * too short). 562 * Try to allocate from the summary block 563 * that we found. 564 */ 565 error = xfs_rtallocate_extent_block(mp, tp, 566 bbno + i, minlen, maxlen, len, &n, rbpp, 567 rsb, prod, &r); 568 if (error) { 569 return error; 570 } 571 /* 572 * If it works, return the extent. 573 */ 574 if (r != NULLRTBLOCK) { 575 *rtblock = r; 576 return 0; 577 } 578 } 579 } 580 /* 581 * Loop control. If we were on the positive side, and there's 582 * still more blocks on the negative side, go there. 583 */ 584 if (i > 0 && (int)bbno - i >= 0) 585 i = -i; 586 /* 587 * If positive, and no more negative, but there are more 588 * positive, go there. 589 */ 590 else if (i > 0 && (int)bbno + i < mp->m_sb.sb_rbmblocks - 1) 591 i++; 592 /* 593 * If negative or 0 (just started), and there are positive 594 * blocks to go, go there. The 0 case moves to block 1. 595 */ 596 else if (i <= 0 && (int)bbno - i < mp->m_sb.sb_rbmblocks - 1) 597 i = 1 - i; 598 /* 599 * If negative or 0 and there are more negative blocks, 600 * go there. 601 */ 602 else if (i <= 0 && (int)bbno + i > 0) 603 i--; 604 /* 605 * Must be done. Return failure. 606 */ 607 else 608 break; 609 } 610 *rtblock = NULLRTBLOCK; 611 return 0; 612 } 613 614 /* 615 * Allocate an extent of length minlen<=len<=maxlen, with no position 616 * specified. If we don't get maxlen then use prod to trim 617 * the length, if given. The lengths are all in rtextents. 618 */ 619 STATIC int /* error */ 620 xfs_rtallocate_extent_size( 621 xfs_mount_t *mp, /* file system mount point */ 622 xfs_trans_t *tp, /* transaction pointer */ 623 xfs_extlen_t minlen, /* minimum length to allocate */ 624 xfs_extlen_t maxlen, /* maximum length to allocate */ 625 xfs_extlen_t *len, /* out: actual length allocated */ 626 xfs_buf_t **rbpp, /* in/out: summary block buffer */ 627 xfs_fsblock_t *rsb, /* in/out: summary block number */ 628 xfs_extlen_t prod, /* extent product factor */ 629 xfs_rtblock_t *rtblock) /* out: start block allocated */ 630 { 631 int error; /* error value */ 632 int i; /* bitmap block number */ 633 int l; /* level number (loop control) */ 634 xfs_rtblock_t n; /* next block to be tried */ 635 xfs_rtblock_t r; /* result block number */ 636 xfs_suminfo_t sum; /* summary information for extents */ 637 638 ASSERT(minlen % prod == 0 && maxlen % prod == 0); 639 ASSERT(maxlen != 0); 640 641 /* 642 * Loop over all the levels starting with maxlen. 643 * At each level, look at all the bitmap blocks, to see if there 644 * are extents starting there that are long enough (>= maxlen). 645 * Note, only on the initial level can the allocation fail if 646 * the summary says there's an extent. 647 */ 648 for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) { 649 /* 650 * Loop over all the bitmap blocks. 651 */ 652 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) { 653 /* 654 * Get the summary for this level/block. 655 */ 656 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, 657 &sum); 658 if (error) { 659 return error; 660 } 661 /* 662 * Nothing there, on to the next block. 663 */ 664 if (!sum) 665 continue; 666 /* 667 * Try allocating the extent. 668 */ 669 error = xfs_rtallocate_extent_block(mp, tp, i, maxlen, 670 maxlen, len, &n, rbpp, rsb, prod, &r); 671 if (error) { 672 return error; 673 } 674 /* 675 * If it worked, return that. 676 */ 677 if (r != NULLRTBLOCK) { 678 *rtblock = r; 679 return 0; 680 } 681 /* 682 * If the "next block to try" returned from the 683 * allocator is beyond the next bitmap block, 684 * skip to that bitmap block. 685 */ 686 if (XFS_BITTOBLOCK(mp, n) > i + 1) 687 i = XFS_BITTOBLOCK(mp, n) - 1; 688 } 689 } 690 /* 691 * Didn't find any maxlen blocks. Try smaller ones, unless 692 * we're asking for a fixed size extent. 693 */ 694 if (minlen > --maxlen) { 695 *rtblock = NULLRTBLOCK; 696 return 0; 697 } 698 ASSERT(minlen != 0); 699 ASSERT(maxlen != 0); 700 701 /* 702 * Loop over sizes, from maxlen down to minlen. 703 * This time, when we do the allocations, allow smaller ones 704 * to succeed. 705 */ 706 for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) { 707 /* 708 * Loop over all the bitmap blocks, try an allocation 709 * starting in that block. 710 */ 711 for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) { 712 /* 713 * Get the summary information for this level/block. 714 */ 715 error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, 716 &sum); 717 if (error) { 718 return error; 719 } 720 /* 721 * If nothing there, go on to next. 722 */ 723 if (!sum) 724 continue; 725 /* 726 * Try the allocation. Make sure the specified 727 * minlen/maxlen are in the possible range for 728 * this summary level. 729 */ 730 error = xfs_rtallocate_extent_block(mp, tp, i, 731 XFS_RTMAX(minlen, 1 << l), 732 XFS_RTMIN(maxlen, (1 << (l + 1)) - 1), 733 len, &n, rbpp, rsb, prod, &r); 734 if (error) { 735 return error; 736 } 737 /* 738 * If it worked, return that extent. 739 */ 740 if (r != NULLRTBLOCK) { 741 *rtblock = r; 742 return 0; 743 } 744 /* 745 * If the "next block to try" returned from the 746 * allocator is beyond the next bitmap block, 747 * skip to that bitmap block. 748 */ 749 if (XFS_BITTOBLOCK(mp, n) > i + 1) 750 i = XFS_BITTOBLOCK(mp, n) - 1; 751 } 752 } 753 /* 754 * Got nothing, return failure. 755 */ 756 *rtblock = NULLRTBLOCK; 757 return 0; 758 } 759 760 /* 761 * Allocate space to the bitmap or summary file, and zero it, for growfs. 762 */ 763 STATIC int /* error */ 764 xfs_growfs_rt_alloc( 765 xfs_mount_t *mp, /* file system mount point */ 766 xfs_extlen_t oblocks, /* old count of blocks */ 767 xfs_extlen_t nblocks, /* new count of blocks */ 768 xfs_inode_t *ip) /* inode (bitmap/summary) */ 769 { 770 xfs_fileoff_t bno; /* block number in file */ 771 xfs_buf_t *bp; /* temporary buffer for zeroing */ 772 int committed; /* transaction committed flag */ 773 xfs_daddr_t d; /* disk block address */ 774 int error; /* error return value */ 775 xfs_fsblock_t firstblock; /* first block allocated in xaction */ 776 xfs_bmap_free_t flist; /* list of freed blocks */ 777 xfs_fsblock_t fsbno; /* filesystem block for bno */ 778 xfs_bmbt_irec_t map; /* block map output */ 779 int nmap; /* number of block maps */ 780 int resblks; /* space reservation */ 781 782 /* 783 * Allocate space to the file, as necessary. 784 */ 785 while (oblocks < nblocks) { 786 int cancelflags = 0; 787 xfs_trans_t *tp; 788 789 tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_ALLOC); 790 resblks = XFS_GROWFSRT_SPACE_RES(mp, nblocks - oblocks); 791 /* 792 * Reserve space & log for one extent added to the file. 793 */ 794 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_growrtalloc, 795 resblks, 0); 796 if (error) 797 goto error_cancel; 798 cancelflags = XFS_TRANS_RELEASE_LOG_RES; 799 /* 800 * Lock the inode. 801 */ 802 xfs_ilock(ip, XFS_ILOCK_EXCL); 803 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL); 804 805 xfs_bmap_init(&flist, &firstblock); 806 /* 807 * Allocate blocks to the bitmap file. 808 */ 809 nmap = 1; 810 cancelflags |= XFS_TRANS_ABORT; 811 error = xfs_bmapi_write(tp, ip, oblocks, nblocks - oblocks, 812 XFS_BMAPI_METADATA, &firstblock, 813 resblks, &map, &nmap, &flist); 814 if (!error && nmap < 1) 815 error = -ENOSPC; 816 if (error) 817 goto error_cancel; 818 /* 819 * Free any blocks freed up in the transaction, then commit. 820 */ 821 error = xfs_bmap_finish(&tp, &flist, &committed); 822 if (error) 823 goto error_cancel; 824 error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES); 825 if (error) 826 goto error; 827 /* 828 * Now we need to clear the allocated blocks. 829 * Do this one block per transaction, to keep it simple. 830 */ 831 cancelflags = 0; 832 for (bno = map.br_startoff, fsbno = map.br_startblock; 833 bno < map.br_startoff + map.br_blockcount; 834 bno++, fsbno++) { 835 tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_ZERO); 836 /* 837 * Reserve log for one block zeroing. 838 */ 839 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_growrtzero, 840 0, 0); 841 if (error) 842 goto error_cancel; 843 /* 844 * Lock the bitmap inode. 845 */ 846 xfs_ilock(ip, XFS_ILOCK_EXCL); 847 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL); 848 /* 849 * Get a buffer for the block. 850 */ 851 d = XFS_FSB_TO_DADDR(mp, fsbno); 852 bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, d, 853 mp->m_bsize, 0); 854 if (bp == NULL) { 855 error = -EIO; 856 error_cancel: 857 xfs_trans_cancel(tp, cancelflags); 858 goto error; 859 } 860 memset(bp->b_addr, 0, mp->m_sb.sb_blocksize); 861 xfs_trans_log_buf(tp, bp, 0, mp->m_sb.sb_blocksize - 1); 862 /* 863 * Commit the transaction. 864 */ 865 error = xfs_trans_commit(tp, 0); 866 if (error) 867 goto error; 868 } 869 /* 870 * Go on to the next extent, if any. 871 */ 872 oblocks = map.br_startoff + map.br_blockcount; 873 } 874 return 0; 875 876 error: 877 return error; 878 } 879 880 /* 881 * Visible (exported) functions. 882 */ 883 884 /* 885 * Grow the realtime area of the filesystem. 886 */ 887 int 888 xfs_growfs_rt( 889 xfs_mount_t *mp, /* mount point for filesystem */ 890 xfs_growfs_rt_t *in) /* growfs rt input struct */ 891 { 892 xfs_rtblock_t bmbno; /* bitmap block number */ 893 xfs_buf_t *bp; /* temporary buffer */ 894 int error; /* error return value */ 895 xfs_mount_t *nmp; /* new (fake) mount structure */ 896 xfs_rfsblock_t nrblocks; /* new number of realtime blocks */ 897 xfs_extlen_t nrbmblocks; /* new number of rt bitmap blocks */ 898 xfs_rtblock_t nrextents; /* new number of realtime extents */ 899 uint8_t nrextslog; /* new log2 of sb_rextents */ 900 xfs_extlen_t nrsumblocks; /* new number of summary blocks */ 901 uint nrsumlevels; /* new rt summary levels */ 902 uint nrsumsize; /* new size of rt summary, bytes */ 903 xfs_sb_t *nsbp; /* new superblock */ 904 xfs_extlen_t rbmblocks; /* current number of rt bitmap blocks */ 905 xfs_extlen_t rsumblocks; /* current number of rt summary blks */ 906 xfs_sb_t *sbp; /* old superblock */ 907 xfs_fsblock_t sumbno; /* summary block number */ 908 909 sbp = &mp->m_sb; 910 /* 911 * Initial error checking. 912 */ 913 if (!capable(CAP_SYS_ADMIN)) 914 return -EPERM; 915 if (mp->m_rtdev_targp == NULL || mp->m_rbmip == NULL || 916 (nrblocks = in->newblocks) <= sbp->sb_rblocks || 917 (sbp->sb_rblocks && (in->extsize != sbp->sb_rextsize))) 918 return -EINVAL; 919 if ((error = xfs_sb_validate_fsb_count(sbp, nrblocks))) 920 return error; 921 /* 922 * Read in the last block of the device, make sure it exists. 923 */ 924 error = xfs_buf_read_uncached(mp->m_rtdev_targp, 925 XFS_FSB_TO_BB(mp, nrblocks - 1), 926 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL); 927 if (error) 928 return error; 929 xfs_buf_relse(bp); 930 931 /* 932 * Calculate new parameters. These are the final values to be reached. 933 */ 934 nrextents = nrblocks; 935 do_div(nrextents, in->extsize); 936 nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize); 937 nrextslog = xfs_highbit32(nrextents); 938 nrsumlevels = nrextslog + 1; 939 nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks; 940 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize); 941 nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks); 942 /* 943 * New summary size can't be more than half the size of 944 * the log. This prevents us from getting a log overflow, 945 * since we'll log basically the whole summary file at once. 946 */ 947 if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1)) 948 return -EINVAL; 949 /* 950 * Get the old block counts for bitmap and summary inodes. 951 * These can't change since other growfs callers are locked out. 952 */ 953 rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_d.di_size); 954 rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_d.di_size); 955 /* 956 * Allocate space to the bitmap and summary files, as necessary. 957 */ 958 error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks, mp->m_rbmip); 959 if (error) 960 return error; 961 error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks, mp->m_rsumip); 962 if (error) 963 return error; 964 /* 965 * Allocate a new (fake) mount/sb. 966 */ 967 nmp = kmem_alloc(sizeof(*nmp), KM_SLEEP); 968 /* 969 * Loop over the bitmap blocks. 970 * We will do everything one bitmap block at a time. 971 * Skip the current block if it is exactly full. 972 * This also deals with the case where there were no rtextents before. 973 */ 974 for (bmbno = sbp->sb_rbmblocks - 975 ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0); 976 bmbno < nrbmblocks; 977 bmbno++) { 978 xfs_trans_t *tp; 979 int cancelflags = 0; 980 981 *nmp = *mp; 982 nsbp = &nmp->m_sb; 983 /* 984 * Calculate new sb and mount fields for this round. 985 */ 986 nsbp->sb_rextsize = in->extsize; 987 nsbp->sb_rbmblocks = bmbno + 1; 988 nsbp->sb_rblocks = 989 XFS_RTMIN(nrblocks, 990 nsbp->sb_rbmblocks * NBBY * 991 nsbp->sb_blocksize * nsbp->sb_rextsize); 992 nsbp->sb_rextents = nsbp->sb_rblocks; 993 do_div(nsbp->sb_rextents, nsbp->sb_rextsize); 994 ASSERT(nsbp->sb_rextents != 0); 995 nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents); 996 nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1; 997 nrsumsize = 998 (uint)sizeof(xfs_suminfo_t) * nrsumlevels * 999 nsbp->sb_rbmblocks; 1000 nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize); 1001 nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks); 1002 /* 1003 * Start a transaction, get the log reservation. 1004 */ 1005 tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_FREE); 1006 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_growrtfree, 1007 0, 0); 1008 if (error) 1009 goto error_cancel; 1010 /* 1011 * Lock out other callers by grabbing the bitmap inode lock. 1012 */ 1013 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL); 1014 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL); 1015 /* 1016 * Update the bitmap inode's size. 1017 */ 1018 mp->m_rbmip->i_d.di_size = 1019 nsbp->sb_rbmblocks * nsbp->sb_blocksize; 1020 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE); 1021 cancelflags |= XFS_TRANS_ABORT; 1022 /* 1023 * Get the summary inode into the transaction. 1024 */ 1025 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL); 1026 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL); 1027 /* 1028 * Update the summary inode's size. 1029 */ 1030 mp->m_rsumip->i_d.di_size = nmp->m_rsumsize; 1031 xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE); 1032 /* 1033 * Copy summary data from old to new sizes. 1034 * Do this when the real size (not block-aligned) changes. 1035 */ 1036 if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks || 1037 mp->m_rsumlevels != nmp->m_rsumlevels) { 1038 error = xfs_rtcopy_summary(mp, nmp, tp); 1039 if (error) 1040 goto error_cancel; 1041 } 1042 /* 1043 * Update superblock fields. 1044 */ 1045 if (nsbp->sb_rextsize != sbp->sb_rextsize) 1046 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE, 1047 nsbp->sb_rextsize - sbp->sb_rextsize); 1048 if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks) 1049 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS, 1050 nsbp->sb_rbmblocks - sbp->sb_rbmblocks); 1051 if (nsbp->sb_rblocks != sbp->sb_rblocks) 1052 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS, 1053 nsbp->sb_rblocks - sbp->sb_rblocks); 1054 if (nsbp->sb_rextents != sbp->sb_rextents) 1055 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS, 1056 nsbp->sb_rextents - sbp->sb_rextents); 1057 if (nsbp->sb_rextslog != sbp->sb_rextslog) 1058 xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG, 1059 nsbp->sb_rextslog - sbp->sb_rextslog); 1060 /* 1061 * Free new extent. 1062 */ 1063 bp = NULL; 1064 error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents, 1065 nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno); 1066 if (error) { 1067 error_cancel: 1068 xfs_trans_cancel(tp, cancelflags); 1069 break; 1070 } 1071 /* 1072 * Mark more blocks free in the superblock. 1073 */ 1074 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, 1075 nsbp->sb_rextents - sbp->sb_rextents); 1076 /* 1077 * Update mp values into the real mp structure. 1078 */ 1079 mp->m_rsumlevels = nrsumlevels; 1080 mp->m_rsumsize = nrsumsize; 1081 1082 error = xfs_trans_commit(tp, 0); 1083 if (error) 1084 break; 1085 } 1086 1087 /* 1088 * Free the fake mp structure. 1089 */ 1090 kmem_free(nmp); 1091 1092 return error; 1093 } 1094 1095 /* 1096 * Allocate an extent in the realtime subvolume, with the usual allocation 1097 * parameters. The length units are all in realtime extents, as is the 1098 * result block number. 1099 */ 1100 int /* error */ 1101 xfs_rtallocate_extent( 1102 xfs_trans_t *tp, /* transaction pointer */ 1103 xfs_rtblock_t bno, /* starting block number to allocate */ 1104 xfs_extlen_t minlen, /* minimum length to allocate */ 1105 xfs_extlen_t maxlen, /* maximum length to allocate */ 1106 xfs_extlen_t *len, /* out: actual length allocated */ 1107 xfs_alloctype_t type, /* allocation type XFS_ALLOCTYPE... */ 1108 int wasdel, /* was a delayed allocation extent */ 1109 xfs_extlen_t prod, /* extent product factor */ 1110 xfs_rtblock_t *rtblock) /* out: start block allocated */ 1111 { 1112 xfs_mount_t *mp = tp->t_mountp; 1113 int error; /* error value */ 1114 xfs_rtblock_t r; /* result allocated block */ 1115 xfs_fsblock_t sb; /* summary file block number */ 1116 xfs_buf_t *sumbp; /* summary file block buffer */ 1117 1118 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL)); 1119 ASSERT(minlen > 0 && minlen <= maxlen); 1120 1121 /* 1122 * If prod is set then figure out what to do to minlen and maxlen. 1123 */ 1124 if (prod > 1) { 1125 xfs_extlen_t i; 1126 1127 if ((i = maxlen % prod)) 1128 maxlen -= i; 1129 if ((i = minlen % prod)) 1130 minlen += prod - i; 1131 if (maxlen < minlen) { 1132 *rtblock = NULLRTBLOCK; 1133 return 0; 1134 } 1135 } 1136 1137 sumbp = NULL; 1138 /* 1139 * Allocate by size, or near another block, or exactly at some block. 1140 */ 1141 switch (type) { 1142 case XFS_ALLOCTYPE_ANY_AG: 1143 error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len, 1144 &sumbp, &sb, prod, &r); 1145 break; 1146 case XFS_ALLOCTYPE_NEAR_BNO: 1147 error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen, 1148 len, &sumbp, &sb, prod, &r); 1149 break; 1150 case XFS_ALLOCTYPE_THIS_BNO: 1151 error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, 1152 len, &sumbp, &sb, prod, &r); 1153 break; 1154 default: 1155 error = -EIO; 1156 ASSERT(0); 1157 } 1158 if (error) 1159 return error; 1160 1161 /* 1162 * If it worked, update the superblock. 1163 */ 1164 if (r != NULLRTBLOCK) { 1165 long slen = (long)*len; 1166 1167 ASSERT(*len >= minlen && *len <= maxlen); 1168 if (wasdel) 1169 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen); 1170 else 1171 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen); 1172 } 1173 *rtblock = r; 1174 return 0; 1175 } 1176 1177 /* 1178 * Initialize realtime fields in the mount structure. 1179 */ 1180 int /* error */ 1181 xfs_rtmount_init( 1182 struct xfs_mount *mp) /* file system mount structure */ 1183 { 1184 struct xfs_buf *bp; /* buffer for last block of subvolume */ 1185 struct xfs_sb *sbp; /* filesystem superblock copy in mount */ 1186 xfs_daddr_t d; /* address of last block of subvolume */ 1187 int error; 1188 1189 sbp = &mp->m_sb; 1190 if (sbp->sb_rblocks == 0) 1191 return 0; 1192 if (mp->m_rtdev_targp == NULL) { 1193 xfs_warn(mp, 1194 "Filesystem has a realtime volume, use rtdev=device option"); 1195 return -ENODEV; 1196 } 1197 mp->m_rsumlevels = sbp->sb_rextslog + 1; 1198 mp->m_rsumsize = 1199 (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels * 1200 sbp->sb_rbmblocks; 1201 mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize); 1202 mp->m_rbmip = mp->m_rsumip = NULL; 1203 /* 1204 * Check that the realtime section is an ok size. 1205 */ 1206 d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks); 1207 if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) { 1208 xfs_warn(mp, "realtime mount -- %llu != %llu", 1209 (unsigned long long) XFS_BB_TO_FSB(mp, d), 1210 (unsigned long long) mp->m_sb.sb_rblocks); 1211 return -EFBIG; 1212 } 1213 error = xfs_buf_read_uncached(mp->m_rtdev_targp, 1214 d - XFS_FSB_TO_BB(mp, 1), 1215 XFS_FSB_TO_BB(mp, 1), 0, &bp, NULL); 1216 if (error) { 1217 xfs_warn(mp, "realtime device size check failed"); 1218 return error; 1219 } 1220 xfs_buf_relse(bp); 1221 return 0; 1222 } 1223 1224 /* 1225 * Get the bitmap and summary inodes into the mount structure 1226 * at mount time. 1227 */ 1228 int /* error */ 1229 xfs_rtmount_inodes( 1230 xfs_mount_t *mp) /* file system mount structure */ 1231 { 1232 int error; /* error return value */ 1233 xfs_sb_t *sbp; 1234 1235 sbp = &mp->m_sb; 1236 if (sbp->sb_rbmino == NULLFSINO) 1237 return 0; 1238 error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip); 1239 if (error) 1240 return error; 1241 ASSERT(mp->m_rbmip != NULL); 1242 ASSERT(sbp->sb_rsumino != NULLFSINO); 1243 error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip); 1244 if (error) { 1245 IRELE(mp->m_rbmip); 1246 return error; 1247 } 1248 ASSERT(mp->m_rsumip != NULL); 1249 return 0; 1250 } 1251 1252 void 1253 xfs_rtunmount_inodes( 1254 struct xfs_mount *mp) 1255 { 1256 if (mp->m_rbmip) 1257 IRELE(mp->m_rbmip); 1258 if (mp->m_rsumip) 1259 IRELE(mp->m_rsumip); 1260 } 1261 1262 /* 1263 * Pick an extent for allocation at the start of a new realtime file. 1264 * Use the sequence number stored in the atime field of the bitmap inode. 1265 * Translate this to a fraction of the rtextents, and return the product 1266 * of rtextents and the fraction. 1267 * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ... 1268 */ 1269 int /* error */ 1270 xfs_rtpick_extent( 1271 xfs_mount_t *mp, /* file system mount point */ 1272 xfs_trans_t *tp, /* transaction pointer */ 1273 xfs_extlen_t len, /* allocation length (rtextents) */ 1274 xfs_rtblock_t *pick) /* result rt extent */ 1275 { 1276 xfs_rtblock_t b; /* result block */ 1277 int log2; /* log of sequence number */ 1278 __uint64_t resid; /* residual after log removed */ 1279 __uint64_t seq; /* sequence number of file creation */ 1280 __uint64_t *seqp; /* pointer to seqno in inode */ 1281 1282 ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL)); 1283 1284 seqp = (__uint64_t *)&mp->m_rbmip->i_d.di_atime; 1285 if (!(mp->m_rbmip->i_d.di_flags & XFS_DIFLAG_NEWRTBM)) { 1286 mp->m_rbmip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM; 1287 *seqp = 0; 1288 } 1289 seq = *seqp; 1290 if ((log2 = xfs_highbit64(seq)) == -1) 1291 b = 0; 1292 else { 1293 resid = seq - (1ULL << log2); 1294 b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >> 1295 (log2 + 1); 1296 if (b >= mp->m_sb.sb_rextents) 1297 b = do_mod(b, mp->m_sb.sb_rextents); 1298 if (b + len > mp->m_sb.sb_rextents) 1299 b = mp->m_sb.sb_rextents - len; 1300 } 1301 *seqp = seq + 1; 1302 xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE); 1303 *pick = b; 1304 return 0; 1305 } 1306