1 /* 2 * Copyright (c) 2000-2006 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_mount.h" 27 #include "xfs_defer.h" 28 #include "xfs_da_format.h" 29 #include "xfs_da_btree.h" 30 #include "xfs_dir2.h" 31 #include "xfs_inode.h" 32 #include "xfs_btree.h" 33 #include "xfs_trans.h" 34 #include "xfs_inode_item.h" 35 #include "xfs_extfree_item.h" 36 #include "xfs_alloc.h" 37 #include "xfs_bmap.h" 38 #include "xfs_bmap_util.h" 39 #include "xfs_bmap_btree.h" 40 #include "xfs_rtalloc.h" 41 #include "xfs_error.h" 42 #include "xfs_quota.h" 43 #include "xfs_trans_space.h" 44 #include "xfs_buf_item.h" 45 #include "xfs_trace.h" 46 #include "xfs_symlink.h" 47 #include "xfs_attr_leaf.h" 48 #include "xfs_filestream.h" 49 #include "xfs_rmap.h" 50 #include "xfs_ag_resv.h" 51 #include "xfs_refcount.h" 52 53 54 kmem_zone_t *xfs_bmap_free_item_zone; 55 56 /* 57 * Miscellaneous helper functions 58 */ 59 60 /* 61 * Compute and fill in the value of the maximum depth of a bmap btree 62 * in this filesystem. Done once, during mount. 63 */ 64 void 65 xfs_bmap_compute_maxlevels( 66 xfs_mount_t *mp, /* file system mount structure */ 67 int whichfork) /* data or attr fork */ 68 { 69 int level; /* btree level */ 70 uint maxblocks; /* max blocks at this level */ 71 uint maxleafents; /* max leaf entries possible */ 72 int maxrootrecs; /* max records in root block */ 73 int minleafrecs; /* min records in leaf block */ 74 int minnoderecs; /* min records in node block */ 75 int sz; /* root block size */ 76 77 /* 78 * The maximum number of extents in a file, hence the maximum 79 * number of leaf entries, is controlled by the type of di_nextents 80 * (a signed 32-bit number, xfs_extnum_t), or by di_anextents 81 * (a signed 16-bit number, xfs_aextnum_t). 82 * 83 * Note that we can no longer assume that if we are in ATTR1 that 84 * the fork offset of all the inodes will be 85 * (xfs_default_attroffset(ip) >> 3) because we could have mounted 86 * with ATTR2 and then mounted back with ATTR1, keeping the 87 * di_forkoff's fixed but probably at various positions. Therefore, 88 * for both ATTR1 and ATTR2 we have to assume the worst case scenario 89 * of a minimum size available. 90 */ 91 if (whichfork == XFS_DATA_FORK) { 92 maxleafents = MAXEXTNUM; 93 sz = XFS_BMDR_SPACE_CALC(MINDBTPTRS); 94 } else { 95 maxleafents = MAXAEXTNUM; 96 sz = XFS_BMDR_SPACE_CALC(MINABTPTRS); 97 } 98 maxrootrecs = xfs_bmdr_maxrecs(sz, 0); 99 minleafrecs = mp->m_bmap_dmnr[0]; 100 minnoderecs = mp->m_bmap_dmnr[1]; 101 maxblocks = (maxleafents + minleafrecs - 1) / minleafrecs; 102 for (level = 1; maxblocks > 1; level++) { 103 if (maxblocks <= maxrootrecs) 104 maxblocks = 1; 105 else 106 maxblocks = (maxblocks + minnoderecs - 1) / minnoderecs; 107 } 108 mp->m_bm_maxlevels[whichfork] = level; 109 } 110 111 STATIC int /* error */ 112 xfs_bmbt_lookup_eq( 113 struct xfs_btree_cur *cur, 114 xfs_fileoff_t off, 115 xfs_fsblock_t bno, 116 xfs_filblks_t len, 117 int *stat) /* success/failure */ 118 { 119 cur->bc_rec.b.br_startoff = off; 120 cur->bc_rec.b.br_startblock = bno; 121 cur->bc_rec.b.br_blockcount = len; 122 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat); 123 } 124 125 STATIC int /* error */ 126 xfs_bmbt_lookup_ge( 127 struct xfs_btree_cur *cur, 128 xfs_fileoff_t off, 129 xfs_fsblock_t bno, 130 xfs_filblks_t len, 131 int *stat) /* success/failure */ 132 { 133 cur->bc_rec.b.br_startoff = off; 134 cur->bc_rec.b.br_startblock = bno; 135 cur->bc_rec.b.br_blockcount = len; 136 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat); 137 } 138 139 /* 140 * Check if the inode needs to be converted to btree format. 141 */ 142 static inline bool xfs_bmap_needs_btree(struct xfs_inode *ip, int whichfork) 143 { 144 return whichfork != XFS_COW_FORK && 145 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS && 146 XFS_IFORK_NEXTENTS(ip, whichfork) > 147 XFS_IFORK_MAXEXT(ip, whichfork); 148 } 149 150 /* 151 * Check if the inode should be converted to extent format. 152 */ 153 static inline bool xfs_bmap_wants_extents(struct xfs_inode *ip, int whichfork) 154 { 155 return whichfork != XFS_COW_FORK && 156 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE && 157 XFS_IFORK_NEXTENTS(ip, whichfork) <= 158 XFS_IFORK_MAXEXT(ip, whichfork); 159 } 160 161 /* 162 * Update the record referred to by cur to the value given 163 * by [off, bno, len, state]. 164 * This either works (return 0) or gets an EFSCORRUPTED error. 165 */ 166 STATIC int 167 xfs_bmbt_update( 168 struct xfs_btree_cur *cur, 169 xfs_fileoff_t off, 170 xfs_fsblock_t bno, 171 xfs_filblks_t len, 172 xfs_exntst_t state) 173 { 174 union xfs_btree_rec rec; 175 176 xfs_bmbt_disk_set_allf(&rec.bmbt, off, bno, len, state); 177 return xfs_btree_update(cur, &rec); 178 } 179 180 /* 181 * Compute the worst-case number of indirect blocks that will be used 182 * for ip's delayed extent of length "len". 183 */ 184 STATIC xfs_filblks_t 185 xfs_bmap_worst_indlen( 186 xfs_inode_t *ip, /* incore inode pointer */ 187 xfs_filblks_t len) /* delayed extent length */ 188 { 189 int level; /* btree level number */ 190 int maxrecs; /* maximum record count at this level */ 191 xfs_mount_t *mp; /* mount structure */ 192 xfs_filblks_t rval; /* return value */ 193 194 mp = ip->i_mount; 195 maxrecs = mp->m_bmap_dmxr[0]; 196 for (level = 0, rval = 0; 197 level < XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK); 198 level++) { 199 len += maxrecs - 1; 200 do_div(len, maxrecs); 201 rval += len; 202 if (len == 1) 203 return rval + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) - 204 level - 1; 205 if (level == 0) 206 maxrecs = mp->m_bmap_dmxr[1]; 207 } 208 return rval; 209 } 210 211 /* 212 * Calculate the default attribute fork offset for newly created inodes. 213 */ 214 uint 215 xfs_default_attroffset( 216 struct xfs_inode *ip) 217 { 218 struct xfs_mount *mp = ip->i_mount; 219 uint offset; 220 221 if (mp->m_sb.sb_inodesize == 256) { 222 offset = XFS_LITINO(mp, ip->i_d.di_version) - 223 XFS_BMDR_SPACE_CALC(MINABTPTRS); 224 } else { 225 offset = XFS_BMDR_SPACE_CALC(6 * MINABTPTRS); 226 } 227 228 ASSERT(offset < XFS_LITINO(mp, ip->i_d.di_version)); 229 return offset; 230 } 231 232 /* 233 * Helper routine to reset inode di_forkoff field when switching 234 * attribute fork from local to extent format - we reset it where 235 * possible to make space available for inline data fork extents. 236 */ 237 STATIC void 238 xfs_bmap_forkoff_reset( 239 xfs_inode_t *ip, 240 int whichfork) 241 { 242 if (whichfork == XFS_ATTR_FORK && 243 ip->i_d.di_format != XFS_DINODE_FMT_DEV && 244 ip->i_d.di_format != XFS_DINODE_FMT_UUID && 245 ip->i_d.di_format != XFS_DINODE_FMT_BTREE) { 246 uint dfl_forkoff = xfs_default_attroffset(ip) >> 3; 247 248 if (dfl_forkoff > ip->i_d.di_forkoff) 249 ip->i_d.di_forkoff = dfl_forkoff; 250 } 251 } 252 253 #ifdef DEBUG 254 STATIC struct xfs_buf * 255 xfs_bmap_get_bp( 256 struct xfs_btree_cur *cur, 257 xfs_fsblock_t bno) 258 { 259 struct xfs_log_item_desc *lidp; 260 int i; 261 262 if (!cur) 263 return NULL; 264 265 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) { 266 if (!cur->bc_bufs[i]) 267 break; 268 if (XFS_BUF_ADDR(cur->bc_bufs[i]) == bno) 269 return cur->bc_bufs[i]; 270 } 271 272 /* Chase down all the log items to see if the bp is there */ 273 list_for_each_entry(lidp, &cur->bc_tp->t_items, lid_trans) { 274 struct xfs_buf_log_item *bip; 275 bip = (struct xfs_buf_log_item *)lidp->lid_item; 276 if (bip->bli_item.li_type == XFS_LI_BUF && 277 XFS_BUF_ADDR(bip->bli_buf) == bno) 278 return bip->bli_buf; 279 } 280 281 return NULL; 282 } 283 284 STATIC void 285 xfs_check_block( 286 struct xfs_btree_block *block, 287 xfs_mount_t *mp, 288 int root, 289 short sz) 290 { 291 int i, j, dmxr; 292 __be64 *pp, *thispa; /* pointer to block address */ 293 xfs_bmbt_key_t *prevp, *keyp; 294 295 ASSERT(be16_to_cpu(block->bb_level) > 0); 296 297 prevp = NULL; 298 for( i = 1; i <= xfs_btree_get_numrecs(block); i++) { 299 dmxr = mp->m_bmap_dmxr[0]; 300 keyp = XFS_BMBT_KEY_ADDR(mp, block, i); 301 302 if (prevp) { 303 ASSERT(be64_to_cpu(prevp->br_startoff) < 304 be64_to_cpu(keyp->br_startoff)); 305 } 306 prevp = keyp; 307 308 /* 309 * Compare the block numbers to see if there are dups. 310 */ 311 if (root) 312 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, i, sz); 313 else 314 pp = XFS_BMBT_PTR_ADDR(mp, block, i, dmxr); 315 316 for (j = i+1; j <= be16_to_cpu(block->bb_numrecs); j++) { 317 if (root) 318 thispa = XFS_BMAP_BROOT_PTR_ADDR(mp, block, j, sz); 319 else 320 thispa = XFS_BMBT_PTR_ADDR(mp, block, j, dmxr); 321 if (*thispa == *pp) { 322 xfs_warn(mp, "%s: thispa(%d) == pp(%d) %Ld", 323 __func__, j, i, 324 (unsigned long long)be64_to_cpu(*thispa)); 325 panic("%s: ptrs are equal in node\n", 326 __func__); 327 } 328 } 329 } 330 } 331 332 /* 333 * Check that the extents for the inode ip are in the right order in all 334 * btree leaves. THis becomes prohibitively expensive for large extent count 335 * files, so don't bother with inodes that have more than 10,000 extents in 336 * them. The btree record ordering checks will still be done, so for such large 337 * bmapbt constructs that is going to catch most corruptions. 338 */ 339 STATIC void 340 xfs_bmap_check_leaf_extents( 341 xfs_btree_cur_t *cur, /* btree cursor or null */ 342 xfs_inode_t *ip, /* incore inode pointer */ 343 int whichfork) /* data or attr fork */ 344 { 345 struct xfs_btree_block *block; /* current btree block */ 346 xfs_fsblock_t bno; /* block # of "block" */ 347 xfs_buf_t *bp; /* buffer for "block" */ 348 int error; /* error return value */ 349 xfs_extnum_t i=0, j; /* index into the extents list */ 350 xfs_ifork_t *ifp; /* fork structure */ 351 int level; /* btree level, for checking */ 352 xfs_mount_t *mp; /* file system mount structure */ 353 __be64 *pp; /* pointer to block address */ 354 xfs_bmbt_rec_t *ep; /* pointer to current extent */ 355 xfs_bmbt_rec_t last = {0, 0}; /* last extent in prev block */ 356 xfs_bmbt_rec_t *nextp; /* pointer to next extent */ 357 int bp_release = 0; 358 359 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) { 360 return; 361 } 362 363 /* skip large extent count inodes */ 364 if (ip->i_d.di_nextents > 10000) 365 return; 366 367 bno = NULLFSBLOCK; 368 mp = ip->i_mount; 369 ifp = XFS_IFORK_PTR(ip, whichfork); 370 block = ifp->if_broot; 371 /* 372 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out. 373 */ 374 level = be16_to_cpu(block->bb_level); 375 ASSERT(level > 0); 376 xfs_check_block(block, mp, 1, ifp->if_broot_bytes); 377 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes); 378 bno = be64_to_cpu(*pp); 379 380 ASSERT(bno != NULLFSBLOCK); 381 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount); 382 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks); 383 384 /* 385 * Go down the tree until leaf level is reached, following the first 386 * pointer (leftmost) at each level. 387 */ 388 while (level-- > 0) { 389 /* See if buf is in cur first */ 390 bp_release = 0; 391 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno)); 392 if (!bp) { 393 bp_release = 1; 394 error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp, 395 XFS_BMAP_BTREE_REF, 396 &xfs_bmbt_buf_ops); 397 if (error) 398 goto error_norelse; 399 } 400 block = XFS_BUF_TO_BLOCK(bp); 401 if (level == 0) 402 break; 403 404 /* 405 * Check this block for basic sanity (increasing keys and 406 * no duplicate blocks). 407 */ 408 409 xfs_check_block(block, mp, 0, 0); 410 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]); 411 bno = be64_to_cpu(*pp); 412 XFS_WANT_CORRUPTED_GOTO(mp, 413 XFS_FSB_SANITY_CHECK(mp, bno), error0); 414 if (bp_release) { 415 bp_release = 0; 416 xfs_trans_brelse(NULL, bp); 417 } 418 } 419 420 /* 421 * Here with bp and block set to the leftmost leaf node in the tree. 422 */ 423 i = 0; 424 425 /* 426 * Loop over all leaf nodes checking that all extents are in the right order. 427 */ 428 for (;;) { 429 xfs_fsblock_t nextbno; 430 xfs_extnum_t num_recs; 431 432 433 num_recs = xfs_btree_get_numrecs(block); 434 435 /* 436 * Read-ahead the next leaf block, if any. 437 */ 438 439 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib); 440 441 /* 442 * Check all the extents to make sure they are OK. 443 * If we had a previous block, the last entry should 444 * conform with the first entry in this one. 445 */ 446 447 ep = XFS_BMBT_REC_ADDR(mp, block, 1); 448 if (i) { 449 ASSERT(xfs_bmbt_disk_get_startoff(&last) + 450 xfs_bmbt_disk_get_blockcount(&last) <= 451 xfs_bmbt_disk_get_startoff(ep)); 452 } 453 for (j = 1; j < num_recs; j++) { 454 nextp = XFS_BMBT_REC_ADDR(mp, block, j + 1); 455 ASSERT(xfs_bmbt_disk_get_startoff(ep) + 456 xfs_bmbt_disk_get_blockcount(ep) <= 457 xfs_bmbt_disk_get_startoff(nextp)); 458 ep = nextp; 459 } 460 461 last = *ep; 462 i += num_recs; 463 if (bp_release) { 464 bp_release = 0; 465 xfs_trans_brelse(NULL, bp); 466 } 467 bno = nextbno; 468 /* 469 * If we've reached the end, stop. 470 */ 471 if (bno == NULLFSBLOCK) 472 break; 473 474 bp_release = 0; 475 bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno)); 476 if (!bp) { 477 bp_release = 1; 478 error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp, 479 XFS_BMAP_BTREE_REF, 480 &xfs_bmbt_buf_ops); 481 if (error) 482 goto error_norelse; 483 } 484 block = XFS_BUF_TO_BLOCK(bp); 485 } 486 487 return; 488 489 error0: 490 xfs_warn(mp, "%s: at error0", __func__); 491 if (bp_release) 492 xfs_trans_brelse(NULL, bp); 493 error_norelse: 494 xfs_warn(mp, "%s: BAD after btree leaves for %d extents", 495 __func__, i); 496 panic("%s: CORRUPTED BTREE OR SOMETHING", __func__); 497 return; 498 } 499 500 /* 501 * Add bmap trace insert entries for all the contents of the extent records. 502 */ 503 void 504 xfs_bmap_trace_exlist( 505 xfs_inode_t *ip, /* incore inode pointer */ 506 xfs_extnum_t cnt, /* count of entries in the list */ 507 int whichfork, /* data or attr fork */ 508 unsigned long caller_ip) 509 { 510 xfs_extnum_t idx; /* extent record index */ 511 xfs_ifork_t *ifp; /* inode fork pointer */ 512 int state = 0; 513 514 if (whichfork == XFS_ATTR_FORK) 515 state |= BMAP_ATTRFORK; 516 517 ifp = XFS_IFORK_PTR(ip, whichfork); 518 ASSERT(cnt == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))); 519 for (idx = 0; idx < cnt; idx++) 520 trace_xfs_extlist(ip, idx, whichfork, caller_ip); 521 } 522 523 /* 524 * Validate that the bmbt_irecs being returned from bmapi are valid 525 * given the caller's original parameters. Specifically check the 526 * ranges of the returned irecs to ensure that they only extend beyond 527 * the given parameters if the XFS_BMAPI_ENTIRE flag was set. 528 */ 529 STATIC void 530 xfs_bmap_validate_ret( 531 xfs_fileoff_t bno, 532 xfs_filblks_t len, 533 int flags, 534 xfs_bmbt_irec_t *mval, 535 int nmap, 536 int ret_nmap) 537 { 538 int i; /* index to map values */ 539 540 ASSERT(ret_nmap <= nmap); 541 542 for (i = 0; i < ret_nmap; i++) { 543 ASSERT(mval[i].br_blockcount > 0); 544 if (!(flags & XFS_BMAPI_ENTIRE)) { 545 ASSERT(mval[i].br_startoff >= bno); 546 ASSERT(mval[i].br_blockcount <= len); 547 ASSERT(mval[i].br_startoff + mval[i].br_blockcount <= 548 bno + len); 549 } else { 550 ASSERT(mval[i].br_startoff < bno + len); 551 ASSERT(mval[i].br_startoff + mval[i].br_blockcount > 552 bno); 553 } 554 ASSERT(i == 0 || 555 mval[i - 1].br_startoff + mval[i - 1].br_blockcount == 556 mval[i].br_startoff); 557 ASSERT(mval[i].br_startblock != DELAYSTARTBLOCK && 558 mval[i].br_startblock != HOLESTARTBLOCK); 559 ASSERT(mval[i].br_state == XFS_EXT_NORM || 560 mval[i].br_state == XFS_EXT_UNWRITTEN); 561 } 562 } 563 564 #else 565 #define xfs_bmap_check_leaf_extents(cur, ip, whichfork) do { } while (0) 566 #define xfs_bmap_validate_ret(bno,len,flags,mval,onmap,nmap) 567 #endif /* DEBUG */ 568 569 /* 570 * bmap free list manipulation functions 571 */ 572 573 /* 574 * Add the extent to the list of extents to be free at transaction end. 575 * The list is maintained sorted (by block number). 576 */ 577 void 578 xfs_bmap_add_free( 579 struct xfs_mount *mp, 580 struct xfs_defer_ops *dfops, 581 xfs_fsblock_t bno, 582 xfs_filblks_t len, 583 struct xfs_owner_info *oinfo) 584 { 585 struct xfs_extent_free_item *new; /* new element */ 586 #ifdef DEBUG 587 xfs_agnumber_t agno; 588 xfs_agblock_t agbno; 589 590 ASSERT(bno != NULLFSBLOCK); 591 ASSERT(len > 0); 592 ASSERT(len <= MAXEXTLEN); 593 ASSERT(!isnullstartblock(bno)); 594 agno = XFS_FSB_TO_AGNO(mp, bno); 595 agbno = XFS_FSB_TO_AGBNO(mp, bno); 596 ASSERT(agno < mp->m_sb.sb_agcount); 597 ASSERT(agbno < mp->m_sb.sb_agblocks); 598 ASSERT(len < mp->m_sb.sb_agblocks); 599 ASSERT(agbno + len <= mp->m_sb.sb_agblocks); 600 #endif 601 ASSERT(xfs_bmap_free_item_zone != NULL); 602 603 new = kmem_zone_alloc(xfs_bmap_free_item_zone, KM_SLEEP); 604 new->xefi_startblock = bno; 605 new->xefi_blockcount = (xfs_extlen_t)len; 606 if (oinfo) 607 new->xefi_oinfo = *oinfo; 608 else 609 xfs_rmap_skip_owner_update(&new->xefi_oinfo); 610 trace_xfs_bmap_free_defer(mp, XFS_FSB_TO_AGNO(mp, bno), 0, 611 XFS_FSB_TO_AGBNO(mp, bno), len); 612 xfs_defer_add(dfops, XFS_DEFER_OPS_TYPE_FREE, &new->xefi_list); 613 } 614 615 /* 616 * Inode fork format manipulation functions 617 */ 618 619 /* 620 * Transform a btree format file with only one leaf node, where the 621 * extents list will fit in the inode, into an extents format file. 622 * Since the file extents are already in-core, all we have to do is 623 * give up the space for the btree root and pitch the leaf block. 624 */ 625 STATIC int /* error */ 626 xfs_bmap_btree_to_extents( 627 xfs_trans_t *tp, /* transaction pointer */ 628 xfs_inode_t *ip, /* incore inode pointer */ 629 xfs_btree_cur_t *cur, /* btree cursor */ 630 int *logflagsp, /* inode logging flags */ 631 int whichfork) /* data or attr fork */ 632 { 633 /* REFERENCED */ 634 struct xfs_btree_block *cblock;/* child btree block */ 635 xfs_fsblock_t cbno; /* child block number */ 636 xfs_buf_t *cbp; /* child block's buffer */ 637 int error; /* error return value */ 638 xfs_ifork_t *ifp; /* inode fork data */ 639 xfs_mount_t *mp; /* mount point structure */ 640 __be64 *pp; /* ptr to block address */ 641 struct xfs_btree_block *rblock;/* root btree block */ 642 struct xfs_owner_info oinfo; 643 644 mp = ip->i_mount; 645 ifp = XFS_IFORK_PTR(ip, whichfork); 646 ASSERT(whichfork != XFS_COW_FORK); 647 ASSERT(ifp->if_flags & XFS_IFEXTENTS); 648 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE); 649 rblock = ifp->if_broot; 650 ASSERT(be16_to_cpu(rblock->bb_level) == 1); 651 ASSERT(be16_to_cpu(rblock->bb_numrecs) == 1); 652 ASSERT(xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0) == 1); 653 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, ifp->if_broot_bytes); 654 cbno = be64_to_cpu(*pp); 655 *logflagsp = 0; 656 #ifdef DEBUG 657 if ((error = xfs_btree_check_lptr(cur, cbno, 1))) 658 return error; 659 #endif 660 error = xfs_btree_read_bufl(mp, tp, cbno, 0, &cbp, XFS_BMAP_BTREE_REF, 661 &xfs_bmbt_buf_ops); 662 if (error) 663 return error; 664 cblock = XFS_BUF_TO_BLOCK(cbp); 665 if ((error = xfs_btree_check_block(cur, cblock, 0, cbp))) 666 return error; 667 xfs_rmap_ino_bmbt_owner(&oinfo, ip->i_ino, whichfork); 668 xfs_bmap_add_free(mp, cur->bc_private.b.dfops, cbno, 1, &oinfo); 669 ip->i_d.di_nblocks--; 670 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L); 671 xfs_trans_binval(tp, cbp); 672 if (cur->bc_bufs[0] == cbp) 673 cur->bc_bufs[0] = NULL; 674 xfs_iroot_realloc(ip, -1, whichfork); 675 ASSERT(ifp->if_broot == NULL); 676 ASSERT((ifp->if_flags & XFS_IFBROOT) == 0); 677 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS); 678 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fext(whichfork); 679 return 0; 680 } 681 682 /* 683 * Convert an extents-format file into a btree-format file. 684 * The new file will have a root block (in the inode) and a single child block. 685 */ 686 STATIC int /* error */ 687 xfs_bmap_extents_to_btree( 688 xfs_trans_t *tp, /* transaction pointer */ 689 xfs_inode_t *ip, /* incore inode pointer */ 690 xfs_fsblock_t *firstblock, /* first-block-allocated */ 691 struct xfs_defer_ops *dfops, /* blocks freed in xaction */ 692 xfs_btree_cur_t **curp, /* cursor returned to caller */ 693 int wasdel, /* converting a delayed alloc */ 694 int *logflagsp, /* inode logging flags */ 695 int whichfork) /* data or attr fork */ 696 { 697 struct xfs_btree_block *ablock; /* allocated (child) bt block */ 698 xfs_buf_t *abp; /* buffer for ablock */ 699 xfs_alloc_arg_t args; /* allocation arguments */ 700 xfs_bmbt_rec_t *arp; /* child record pointer */ 701 struct xfs_btree_block *block; /* btree root block */ 702 xfs_btree_cur_t *cur; /* bmap btree cursor */ 703 xfs_bmbt_rec_host_t *ep; /* extent record pointer */ 704 int error; /* error return value */ 705 xfs_extnum_t i, cnt; /* extent record index */ 706 xfs_ifork_t *ifp; /* inode fork pointer */ 707 xfs_bmbt_key_t *kp; /* root block key pointer */ 708 xfs_mount_t *mp; /* mount structure */ 709 xfs_extnum_t nextents; /* number of file extents */ 710 xfs_bmbt_ptr_t *pp; /* root block address pointer */ 711 712 mp = ip->i_mount; 713 ASSERT(whichfork != XFS_COW_FORK); 714 ifp = XFS_IFORK_PTR(ip, whichfork); 715 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS); 716 717 /* 718 * Make space in the inode incore. 719 */ 720 xfs_iroot_realloc(ip, 1, whichfork); 721 ifp->if_flags |= XFS_IFBROOT; 722 723 /* 724 * Fill in the root. 725 */ 726 block = ifp->if_broot; 727 if (xfs_sb_version_hascrc(&mp->m_sb)) 728 xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL, 729 XFS_BMAP_CRC_MAGIC, 1, 1, ip->i_ino, 730 XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS); 731 else 732 xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL, 733 XFS_BMAP_MAGIC, 1, 1, ip->i_ino, 734 XFS_BTREE_LONG_PTRS); 735 736 /* 737 * Need a cursor. Can't allocate until bb_level is filled in. 738 */ 739 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork); 740 cur->bc_private.b.firstblock = *firstblock; 741 cur->bc_private.b.dfops = dfops; 742 cur->bc_private.b.flags = wasdel ? XFS_BTCUR_BPRV_WASDEL : 0; 743 /* 744 * Convert to a btree with two levels, one record in root. 745 */ 746 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_BTREE); 747 memset(&args, 0, sizeof(args)); 748 args.tp = tp; 749 args.mp = mp; 750 xfs_rmap_ino_bmbt_owner(&args.oinfo, ip->i_ino, whichfork); 751 args.firstblock = *firstblock; 752 if (*firstblock == NULLFSBLOCK) { 753 args.type = XFS_ALLOCTYPE_START_BNO; 754 args.fsbno = XFS_INO_TO_FSB(mp, ip->i_ino); 755 } else if (dfops->dop_low) { 756 try_another_ag: 757 args.type = XFS_ALLOCTYPE_START_BNO; 758 args.fsbno = *firstblock; 759 } else { 760 args.type = XFS_ALLOCTYPE_NEAR_BNO; 761 args.fsbno = *firstblock; 762 } 763 args.minlen = args.maxlen = args.prod = 1; 764 args.wasdel = wasdel; 765 *logflagsp = 0; 766 if ((error = xfs_alloc_vextent(&args))) { 767 xfs_iroot_realloc(ip, -1, whichfork); 768 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); 769 return error; 770 } 771 772 /* 773 * During a CoW operation, the allocation and bmbt updates occur in 774 * different transactions. The mapping code tries to put new bmbt 775 * blocks near extents being mapped, but the only way to guarantee this 776 * is if the alloc and the mapping happen in a single transaction that 777 * has a block reservation. That isn't the case here, so if we run out 778 * of space we'll try again with another AG. 779 */ 780 if (xfs_sb_version_hasreflink(&cur->bc_mp->m_sb) && 781 args.fsbno == NULLFSBLOCK && 782 args.type == XFS_ALLOCTYPE_NEAR_BNO) { 783 dfops->dop_low = true; 784 goto try_another_ag; 785 } 786 /* 787 * Allocation can't fail, the space was reserved. 788 */ 789 ASSERT(args.fsbno != NULLFSBLOCK); 790 ASSERT(*firstblock == NULLFSBLOCK || 791 args.agno == XFS_FSB_TO_AGNO(mp, *firstblock) || 792 (dfops->dop_low && 793 args.agno > XFS_FSB_TO_AGNO(mp, *firstblock))); 794 *firstblock = cur->bc_private.b.firstblock = args.fsbno; 795 cur->bc_private.b.allocated++; 796 ip->i_d.di_nblocks++; 797 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, 1L); 798 abp = xfs_btree_get_bufl(mp, tp, args.fsbno, 0); 799 /* 800 * Fill in the child block. 801 */ 802 abp->b_ops = &xfs_bmbt_buf_ops; 803 ablock = XFS_BUF_TO_BLOCK(abp); 804 if (xfs_sb_version_hascrc(&mp->m_sb)) 805 xfs_btree_init_block_int(mp, ablock, abp->b_bn, 806 XFS_BMAP_CRC_MAGIC, 0, 0, ip->i_ino, 807 XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS); 808 else 809 xfs_btree_init_block_int(mp, ablock, abp->b_bn, 810 XFS_BMAP_MAGIC, 0, 0, ip->i_ino, 811 XFS_BTREE_LONG_PTRS); 812 813 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1); 814 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t); 815 for (cnt = i = 0; i < nextents; i++) { 816 ep = xfs_iext_get_ext(ifp, i); 817 if (!isnullstartblock(xfs_bmbt_get_startblock(ep))) { 818 arp->l0 = cpu_to_be64(ep->l0); 819 arp->l1 = cpu_to_be64(ep->l1); 820 arp++; cnt++; 821 } 822 } 823 ASSERT(cnt == XFS_IFORK_NEXTENTS(ip, whichfork)); 824 xfs_btree_set_numrecs(ablock, cnt); 825 826 /* 827 * Fill in the root key and pointer. 828 */ 829 kp = XFS_BMBT_KEY_ADDR(mp, block, 1); 830 arp = XFS_BMBT_REC_ADDR(mp, ablock, 1); 831 kp->br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(arp)); 832 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, xfs_bmbt_get_maxrecs(cur, 833 be16_to_cpu(block->bb_level))); 834 *pp = cpu_to_be64(args.fsbno); 835 836 /* 837 * Do all this logging at the end so that 838 * the root is at the right level. 839 */ 840 xfs_btree_log_block(cur, abp, XFS_BB_ALL_BITS); 841 xfs_btree_log_recs(cur, abp, 1, be16_to_cpu(ablock->bb_numrecs)); 842 ASSERT(*curp == NULL); 843 *curp = cur; 844 *logflagsp = XFS_ILOG_CORE | xfs_ilog_fbroot(whichfork); 845 return 0; 846 } 847 848 /* 849 * Convert a local file to an extents file. 850 * This code is out of bounds for data forks of regular files, 851 * since the file data needs to get logged so things will stay consistent. 852 * (The bmap-level manipulations are ok, though). 853 */ 854 void 855 xfs_bmap_local_to_extents_empty( 856 struct xfs_inode *ip, 857 int whichfork) 858 { 859 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork); 860 861 ASSERT(whichfork != XFS_COW_FORK); 862 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL); 863 ASSERT(ifp->if_bytes == 0); 864 ASSERT(XFS_IFORK_NEXTENTS(ip, whichfork) == 0); 865 866 xfs_bmap_forkoff_reset(ip, whichfork); 867 ifp->if_flags &= ~XFS_IFINLINE; 868 ifp->if_flags |= XFS_IFEXTENTS; 869 XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS); 870 } 871 872 873 STATIC int /* error */ 874 xfs_bmap_local_to_extents( 875 xfs_trans_t *tp, /* transaction pointer */ 876 xfs_inode_t *ip, /* incore inode pointer */ 877 xfs_fsblock_t *firstblock, /* first block allocated in xaction */ 878 xfs_extlen_t total, /* total blocks needed by transaction */ 879 int *logflagsp, /* inode logging flags */ 880 int whichfork, 881 void (*init_fn)(struct xfs_trans *tp, 882 struct xfs_buf *bp, 883 struct xfs_inode *ip, 884 struct xfs_ifork *ifp)) 885 { 886 int error = 0; 887 int flags; /* logging flags returned */ 888 xfs_ifork_t *ifp; /* inode fork pointer */ 889 xfs_alloc_arg_t args; /* allocation arguments */ 890 xfs_buf_t *bp; /* buffer for extent block */ 891 xfs_bmbt_rec_host_t *ep; /* extent record pointer */ 892 893 /* 894 * We don't want to deal with the case of keeping inode data inline yet. 895 * So sending the data fork of a regular inode is invalid. 896 */ 897 ASSERT(!(S_ISREG(VFS_I(ip)->i_mode) && whichfork == XFS_DATA_FORK)); 898 ifp = XFS_IFORK_PTR(ip, whichfork); 899 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL); 900 901 if (!ifp->if_bytes) { 902 xfs_bmap_local_to_extents_empty(ip, whichfork); 903 flags = XFS_ILOG_CORE; 904 goto done; 905 } 906 907 flags = 0; 908 error = 0; 909 ASSERT((ifp->if_flags & (XFS_IFINLINE|XFS_IFEXTENTS|XFS_IFEXTIREC)) == 910 XFS_IFINLINE); 911 memset(&args, 0, sizeof(args)); 912 args.tp = tp; 913 args.mp = ip->i_mount; 914 xfs_rmap_ino_owner(&args.oinfo, ip->i_ino, whichfork, 0); 915 args.firstblock = *firstblock; 916 /* 917 * Allocate a block. We know we need only one, since the 918 * file currently fits in an inode. 919 */ 920 if (*firstblock == NULLFSBLOCK) { 921 try_another_ag: 922 args.fsbno = XFS_INO_TO_FSB(args.mp, ip->i_ino); 923 args.type = XFS_ALLOCTYPE_START_BNO; 924 } else { 925 args.fsbno = *firstblock; 926 args.type = XFS_ALLOCTYPE_NEAR_BNO; 927 } 928 args.total = total; 929 args.minlen = args.maxlen = args.prod = 1; 930 error = xfs_alloc_vextent(&args); 931 if (error) 932 goto done; 933 934 /* 935 * During a CoW operation, the allocation and bmbt updates occur in 936 * different transactions. The mapping code tries to put new bmbt 937 * blocks near extents being mapped, but the only way to guarantee this 938 * is if the alloc and the mapping happen in a single transaction that 939 * has a block reservation. That isn't the case here, so if we run out 940 * of space we'll try again with another AG. 941 */ 942 if (xfs_sb_version_hasreflink(&ip->i_mount->m_sb) && 943 args.fsbno == NULLFSBLOCK && 944 args.type == XFS_ALLOCTYPE_NEAR_BNO) { 945 goto try_another_ag; 946 } 947 /* Can't fail, the space was reserved. */ 948 ASSERT(args.fsbno != NULLFSBLOCK); 949 ASSERT(args.len == 1); 950 *firstblock = args.fsbno; 951 bp = xfs_btree_get_bufl(args.mp, tp, args.fsbno, 0); 952 953 /* 954 * Initialize the block, copy the data and log the remote buffer. 955 * 956 * The callout is responsible for logging because the remote format 957 * might differ from the local format and thus we don't know how much to 958 * log here. Note that init_fn must also set the buffer log item type 959 * correctly. 960 */ 961 init_fn(tp, bp, ip, ifp); 962 963 /* account for the change in fork size */ 964 xfs_idata_realloc(ip, -ifp->if_bytes, whichfork); 965 xfs_bmap_local_to_extents_empty(ip, whichfork); 966 flags |= XFS_ILOG_CORE; 967 968 xfs_iext_add(ifp, 0, 1); 969 ep = xfs_iext_get_ext(ifp, 0); 970 xfs_bmbt_set_allf(ep, 0, args.fsbno, 1, XFS_EXT_NORM); 971 trace_xfs_bmap_post_update(ip, 0, 972 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0, 973 _THIS_IP_); 974 XFS_IFORK_NEXT_SET(ip, whichfork, 1); 975 ip->i_d.di_nblocks = 1; 976 xfs_trans_mod_dquot_byino(tp, ip, 977 XFS_TRANS_DQ_BCOUNT, 1L); 978 flags |= xfs_ilog_fext(whichfork); 979 980 done: 981 *logflagsp = flags; 982 return error; 983 } 984 985 /* 986 * Called from xfs_bmap_add_attrfork to handle btree format files. 987 */ 988 STATIC int /* error */ 989 xfs_bmap_add_attrfork_btree( 990 xfs_trans_t *tp, /* transaction pointer */ 991 xfs_inode_t *ip, /* incore inode pointer */ 992 xfs_fsblock_t *firstblock, /* first block allocated */ 993 struct xfs_defer_ops *dfops, /* blocks to free at commit */ 994 int *flags) /* inode logging flags */ 995 { 996 xfs_btree_cur_t *cur; /* btree cursor */ 997 int error; /* error return value */ 998 xfs_mount_t *mp; /* file system mount struct */ 999 int stat; /* newroot status */ 1000 1001 mp = ip->i_mount; 1002 if (ip->i_df.if_broot_bytes <= XFS_IFORK_DSIZE(ip)) 1003 *flags |= XFS_ILOG_DBROOT; 1004 else { 1005 cur = xfs_bmbt_init_cursor(mp, tp, ip, XFS_DATA_FORK); 1006 cur->bc_private.b.dfops = dfops; 1007 cur->bc_private.b.firstblock = *firstblock; 1008 if ((error = xfs_bmbt_lookup_ge(cur, 0, 0, 0, &stat))) 1009 goto error0; 1010 /* must be at least one entry */ 1011 XFS_WANT_CORRUPTED_GOTO(mp, stat == 1, error0); 1012 if ((error = xfs_btree_new_iroot(cur, flags, &stat))) 1013 goto error0; 1014 if (stat == 0) { 1015 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); 1016 return -ENOSPC; 1017 } 1018 *firstblock = cur->bc_private.b.firstblock; 1019 cur->bc_private.b.allocated = 0; 1020 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); 1021 } 1022 return 0; 1023 error0: 1024 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); 1025 return error; 1026 } 1027 1028 /* 1029 * Called from xfs_bmap_add_attrfork to handle extents format files. 1030 */ 1031 STATIC int /* error */ 1032 xfs_bmap_add_attrfork_extents( 1033 xfs_trans_t *tp, /* transaction pointer */ 1034 xfs_inode_t *ip, /* incore inode pointer */ 1035 xfs_fsblock_t *firstblock, /* first block allocated */ 1036 struct xfs_defer_ops *dfops, /* blocks to free at commit */ 1037 int *flags) /* inode logging flags */ 1038 { 1039 xfs_btree_cur_t *cur; /* bmap btree cursor */ 1040 int error; /* error return value */ 1041 1042 if (ip->i_d.di_nextents * sizeof(xfs_bmbt_rec_t) <= XFS_IFORK_DSIZE(ip)) 1043 return 0; 1044 cur = NULL; 1045 error = xfs_bmap_extents_to_btree(tp, ip, firstblock, dfops, &cur, 0, 1046 flags, XFS_DATA_FORK); 1047 if (cur) { 1048 cur->bc_private.b.allocated = 0; 1049 xfs_btree_del_cursor(cur, 1050 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); 1051 } 1052 return error; 1053 } 1054 1055 /* 1056 * Called from xfs_bmap_add_attrfork to handle local format files. Each 1057 * different data fork content type needs a different callout to do the 1058 * conversion. Some are basic and only require special block initialisation 1059 * callouts for the data formating, others (directories) are so specialised they 1060 * handle everything themselves. 1061 * 1062 * XXX (dgc): investigate whether directory conversion can use the generic 1063 * formatting callout. It should be possible - it's just a very complex 1064 * formatter. 1065 */ 1066 STATIC int /* error */ 1067 xfs_bmap_add_attrfork_local( 1068 xfs_trans_t *tp, /* transaction pointer */ 1069 xfs_inode_t *ip, /* incore inode pointer */ 1070 xfs_fsblock_t *firstblock, /* first block allocated */ 1071 struct xfs_defer_ops *dfops, /* blocks to free at commit */ 1072 int *flags) /* inode logging flags */ 1073 { 1074 xfs_da_args_t dargs; /* args for dir/attr code */ 1075 1076 if (ip->i_df.if_bytes <= XFS_IFORK_DSIZE(ip)) 1077 return 0; 1078 1079 if (S_ISDIR(VFS_I(ip)->i_mode)) { 1080 memset(&dargs, 0, sizeof(dargs)); 1081 dargs.geo = ip->i_mount->m_dir_geo; 1082 dargs.dp = ip; 1083 dargs.firstblock = firstblock; 1084 dargs.dfops = dfops; 1085 dargs.total = dargs.geo->fsbcount; 1086 dargs.whichfork = XFS_DATA_FORK; 1087 dargs.trans = tp; 1088 return xfs_dir2_sf_to_block(&dargs); 1089 } 1090 1091 if (S_ISLNK(VFS_I(ip)->i_mode)) 1092 return xfs_bmap_local_to_extents(tp, ip, firstblock, 1, 1093 flags, XFS_DATA_FORK, 1094 xfs_symlink_local_to_remote); 1095 1096 /* should only be called for types that support local format data */ 1097 ASSERT(0); 1098 return -EFSCORRUPTED; 1099 } 1100 1101 /* 1102 * Convert inode from non-attributed to attributed. 1103 * Must not be in a transaction, ip must not be locked. 1104 */ 1105 int /* error code */ 1106 xfs_bmap_add_attrfork( 1107 xfs_inode_t *ip, /* incore inode pointer */ 1108 int size, /* space new attribute needs */ 1109 int rsvd) /* xact may use reserved blks */ 1110 { 1111 xfs_fsblock_t firstblock; /* 1st block/ag allocated */ 1112 struct xfs_defer_ops dfops; /* freed extent records */ 1113 xfs_mount_t *mp; /* mount structure */ 1114 xfs_trans_t *tp; /* transaction pointer */ 1115 int blks; /* space reservation */ 1116 int version = 1; /* superblock attr version */ 1117 int logflags; /* logging flags */ 1118 int error; /* error return value */ 1119 1120 ASSERT(XFS_IFORK_Q(ip) == 0); 1121 1122 mp = ip->i_mount; 1123 ASSERT(!XFS_NOT_DQATTACHED(mp, ip)); 1124 1125 blks = XFS_ADDAFORK_SPACE_RES(mp); 1126 1127 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_addafork, blks, 0, 1128 rsvd ? XFS_TRANS_RESERVE : 0, &tp); 1129 if (error) 1130 return error; 1131 1132 xfs_ilock(ip, XFS_ILOCK_EXCL); 1133 error = xfs_trans_reserve_quota_nblks(tp, ip, blks, 0, rsvd ? 1134 XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES : 1135 XFS_QMOPT_RES_REGBLKS); 1136 if (error) 1137 goto trans_cancel; 1138 if (XFS_IFORK_Q(ip)) 1139 goto trans_cancel; 1140 if (ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS) { 1141 /* 1142 * For inodes coming from pre-6.2 filesystems. 1143 */ 1144 ASSERT(ip->i_d.di_aformat == 0); 1145 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS; 1146 } 1147 ASSERT(ip->i_d.di_anextents == 0); 1148 1149 xfs_trans_ijoin(tp, ip, 0); 1150 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); 1151 1152 switch (ip->i_d.di_format) { 1153 case XFS_DINODE_FMT_DEV: 1154 ip->i_d.di_forkoff = roundup(sizeof(xfs_dev_t), 8) >> 3; 1155 break; 1156 case XFS_DINODE_FMT_UUID: 1157 ip->i_d.di_forkoff = roundup(sizeof(uuid_t), 8) >> 3; 1158 break; 1159 case XFS_DINODE_FMT_LOCAL: 1160 case XFS_DINODE_FMT_EXTENTS: 1161 case XFS_DINODE_FMT_BTREE: 1162 ip->i_d.di_forkoff = xfs_attr_shortform_bytesfit(ip, size); 1163 if (!ip->i_d.di_forkoff) 1164 ip->i_d.di_forkoff = xfs_default_attroffset(ip) >> 3; 1165 else if (mp->m_flags & XFS_MOUNT_ATTR2) 1166 version = 2; 1167 break; 1168 default: 1169 ASSERT(0); 1170 error = -EINVAL; 1171 goto trans_cancel; 1172 } 1173 1174 ASSERT(ip->i_afp == NULL); 1175 ip->i_afp = kmem_zone_zalloc(xfs_ifork_zone, KM_SLEEP); 1176 ip->i_afp->if_flags = XFS_IFEXTENTS; 1177 logflags = 0; 1178 xfs_defer_init(&dfops, &firstblock); 1179 switch (ip->i_d.di_format) { 1180 case XFS_DINODE_FMT_LOCAL: 1181 error = xfs_bmap_add_attrfork_local(tp, ip, &firstblock, &dfops, 1182 &logflags); 1183 break; 1184 case XFS_DINODE_FMT_EXTENTS: 1185 error = xfs_bmap_add_attrfork_extents(tp, ip, &firstblock, 1186 &dfops, &logflags); 1187 break; 1188 case XFS_DINODE_FMT_BTREE: 1189 error = xfs_bmap_add_attrfork_btree(tp, ip, &firstblock, &dfops, 1190 &logflags); 1191 break; 1192 default: 1193 error = 0; 1194 break; 1195 } 1196 if (logflags) 1197 xfs_trans_log_inode(tp, ip, logflags); 1198 if (error) 1199 goto bmap_cancel; 1200 if (!xfs_sb_version_hasattr(&mp->m_sb) || 1201 (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2)) { 1202 bool log_sb = false; 1203 1204 spin_lock(&mp->m_sb_lock); 1205 if (!xfs_sb_version_hasattr(&mp->m_sb)) { 1206 xfs_sb_version_addattr(&mp->m_sb); 1207 log_sb = true; 1208 } 1209 if (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2) { 1210 xfs_sb_version_addattr2(&mp->m_sb); 1211 log_sb = true; 1212 } 1213 spin_unlock(&mp->m_sb_lock); 1214 if (log_sb) 1215 xfs_log_sb(tp); 1216 } 1217 1218 error = xfs_defer_finish(&tp, &dfops, NULL); 1219 if (error) 1220 goto bmap_cancel; 1221 error = xfs_trans_commit(tp); 1222 xfs_iunlock(ip, XFS_ILOCK_EXCL); 1223 return error; 1224 1225 bmap_cancel: 1226 xfs_defer_cancel(&dfops); 1227 trans_cancel: 1228 xfs_trans_cancel(tp); 1229 xfs_iunlock(ip, XFS_ILOCK_EXCL); 1230 return error; 1231 } 1232 1233 /* 1234 * Internal and external extent tree search functions. 1235 */ 1236 1237 /* 1238 * Read in the extents to if_extents. 1239 * All inode fields are set up by caller, we just traverse the btree 1240 * and copy the records in. If the file system cannot contain unwritten 1241 * extents, the records are checked for no "state" flags. 1242 */ 1243 int /* error */ 1244 xfs_bmap_read_extents( 1245 xfs_trans_t *tp, /* transaction pointer */ 1246 xfs_inode_t *ip, /* incore inode */ 1247 int whichfork) /* data or attr fork */ 1248 { 1249 struct xfs_btree_block *block; /* current btree block */ 1250 xfs_fsblock_t bno; /* block # of "block" */ 1251 xfs_buf_t *bp; /* buffer for "block" */ 1252 int error; /* error return value */ 1253 xfs_exntfmt_t exntf; /* XFS_EXTFMT_NOSTATE, if checking */ 1254 xfs_extnum_t i, j; /* index into the extents list */ 1255 xfs_ifork_t *ifp; /* fork structure */ 1256 int level; /* btree level, for checking */ 1257 xfs_mount_t *mp; /* file system mount structure */ 1258 __be64 *pp; /* pointer to block address */ 1259 /* REFERENCED */ 1260 xfs_extnum_t room; /* number of entries there's room for */ 1261 1262 bno = NULLFSBLOCK; 1263 mp = ip->i_mount; 1264 ifp = XFS_IFORK_PTR(ip, whichfork); 1265 exntf = (whichfork != XFS_DATA_FORK) ? XFS_EXTFMT_NOSTATE : 1266 XFS_EXTFMT_INODE(ip); 1267 block = ifp->if_broot; 1268 /* 1269 * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out. 1270 */ 1271 level = be16_to_cpu(block->bb_level); 1272 ASSERT(level > 0); 1273 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes); 1274 bno = be64_to_cpu(*pp); 1275 ASSERT(bno != NULLFSBLOCK); 1276 ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount); 1277 ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks); 1278 /* 1279 * Go down the tree until leaf level is reached, following the first 1280 * pointer (leftmost) at each level. 1281 */ 1282 while (level-- > 0) { 1283 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp, 1284 XFS_BMAP_BTREE_REF, &xfs_bmbt_buf_ops); 1285 if (error) 1286 return error; 1287 block = XFS_BUF_TO_BLOCK(bp); 1288 if (level == 0) 1289 break; 1290 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]); 1291 bno = be64_to_cpu(*pp); 1292 XFS_WANT_CORRUPTED_GOTO(mp, 1293 XFS_FSB_SANITY_CHECK(mp, bno), error0); 1294 xfs_trans_brelse(tp, bp); 1295 } 1296 /* 1297 * Here with bp and block set to the leftmost leaf node in the tree. 1298 */ 1299 room = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t); 1300 i = 0; 1301 /* 1302 * Loop over all leaf nodes. Copy information to the extent records. 1303 */ 1304 for (;;) { 1305 xfs_bmbt_rec_t *frp; 1306 xfs_fsblock_t nextbno; 1307 xfs_extnum_t num_recs; 1308 xfs_extnum_t start; 1309 1310 num_recs = xfs_btree_get_numrecs(block); 1311 if (unlikely(i + num_recs > room)) { 1312 ASSERT(i + num_recs <= room); 1313 xfs_warn(ip->i_mount, 1314 "corrupt dinode %Lu, (btree extents).", 1315 (unsigned long long) ip->i_ino); 1316 XFS_CORRUPTION_ERROR("xfs_bmap_read_extents(1)", 1317 XFS_ERRLEVEL_LOW, ip->i_mount, block); 1318 goto error0; 1319 } 1320 /* 1321 * Read-ahead the next leaf block, if any. 1322 */ 1323 nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib); 1324 if (nextbno != NULLFSBLOCK) 1325 xfs_btree_reada_bufl(mp, nextbno, 1, 1326 &xfs_bmbt_buf_ops); 1327 /* 1328 * Copy records into the extent records. 1329 */ 1330 frp = XFS_BMBT_REC_ADDR(mp, block, 1); 1331 start = i; 1332 for (j = 0; j < num_recs; j++, i++, frp++) { 1333 xfs_bmbt_rec_host_t *trp = xfs_iext_get_ext(ifp, i); 1334 trp->l0 = be64_to_cpu(frp->l0); 1335 trp->l1 = be64_to_cpu(frp->l1); 1336 } 1337 if (exntf == XFS_EXTFMT_NOSTATE) { 1338 /* 1339 * Check all attribute bmap btree records and 1340 * any "older" data bmap btree records for a 1341 * set bit in the "extent flag" position. 1342 */ 1343 if (unlikely(xfs_check_nostate_extents(ifp, 1344 start, num_recs))) { 1345 XFS_ERROR_REPORT("xfs_bmap_read_extents(2)", 1346 XFS_ERRLEVEL_LOW, 1347 ip->i_mount); 1348 goto error0; 1349 } 1350 } 1351 xfs_trans_brelse(tp, bp); 1352 bno = nextbno; 1353 /* 1354 * If we've reached the end, stop. 1355 */ 1356 if (bno == NULLFSBLOCK) 1357 break; 1358 error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp, 1359 XFS_BMAP_BTREE_REF, &xfs_bmbt_buf_ops); 1360 if (error) 1361 return error; 1362 block = XFS_BUF_TO_BLOCK(bp); 1363 } 1364 ASSERT(i == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))); 1365 ASSERT(i == XFS_IFORK_NEXTENTS(ip, whichfork)); 1366 XFS_BMAP_TRACE_EXLIST(ip, i, whichfork); 1367 return 0; 1368 error0: 1369 xfs_trans_brelse(tp, bp); 1370 return -EFSCORRUPTED; 1371 } 1372 1373 1374 /* 1375 * Search the extent records for the entry containing block bno. 1376 * If bno lies in a hole, point to the next entry. If bno lies 1377 * past eof, *eofp will be set, and *prevp will contain the last 1378 * entry (null if none). Else, *lastxp will be set to the index 1379 * of the found entry; *gotp will contain the entry. 1380 */ 1381 STATIC xfs_bmbt_rec_host_t * /* pointer to found extent entry */ 1382 xfs_bmap_search_multi_extents( 1383 xfs_ifork_t *ifp, /* inode fork pointer */ 1384 xfs_fileoff_t bno, /* block number searched for */ 1385 int *eofp, /* out: end of file found */ 1386 xfs_extnum_t *lastxp, /* out: last extent index */ 1387 xfs_bmbt_irec_t *gotp, /* out: extent entry found */ 1388 xfs_bmbt_irec_t *prevp) /* out: previous extent entry found */ 1389 { 1390 xfs_bmbt_rec_host_t *ep; /* extent record pointer */ 1391 xfs_extnum_t lastx; /* last extent index */ 1392 1393 /* 1394 * Initialize the extent entry structure to catch access to 1395 * uninitialized br_startblock field. 1396 */ 1397 gotp->br_startoff = 0xffa5a5a5a5a5a5a5LL; 1398 gotp->br_blockcount = 0xa55a5a5a5a5a5a5aLL; 1399 gotp->br_state = XFS_EXT_INVALID; 1400 gotp->br_startblock = 0xffffa5a5a5a5a5a5LL; 1401 prevp->br_startoff = NULLFILEOFF; 1402 1403 ep = xfs_iext_bno_to_ext(ifp, bno, &lastx); 1404 if (lastx > 0) { 1405 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx - 1), prevp); 1406 } 1407 if (lastx < (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))) { 1408 xfs_bmbt_get_all(ep, gotp); 1409 *eofp = 0; 1410 } else { 1411 if (lastx > 0) { 1412 *gotp = *prevp; 1413 } 1414 *eofp = 1; 1415 ep = NULL; 1416 } 1417 *lastxp = lastx; 1418 return ep; 1419 } 1420 1421 /* 1422 * Search the extents list for the inode, for the extent containing bno. 1423 * If bno lies in a hole, point to the next entry. If bno lies past eof, 1424 * *eofp will be set, and *prevp will contain the last entry (null if none). 1425 * Else, *lastxp will be set to the index of the found 1426 * entry; *gotp will contain the entry. 1427 */ 1428 xfs_bmbt_rec_host_t * /* pointer to found extent entry */ 1429 xfs_bmap_search_extents( 1430 xfs_inode_t *ip, /* incore inode pointer */ 1431 xfs_fileoff_t bno, /* block number searched for */ 1432 int fork, /* data or attr fork */ 1433 int *eofp, /* out: end of file found */ 1434 xfs_extnum_t *lastxp, /* out: last extent index */ 1435 xfs_bmbt_irec_t *gotp, /* out: extent entry found */ 1436 xfs_bmbt_irec_t *prevp) /* out: previous extent entry found */ 1437 { 1438 xfs_ifork_t *ifp; /* inode fork pointer */ 1439 xfs_bmbt_rec_host_t *ep; /* extent record pointer */ 1440 1441 XFS_STATS_INC(ip->i_mount, xs_look_exlist); 1442 ifp = XFS_IFORK_PTR(ip, fork); 1443 1444 ep = xfs_bmap_search_multi_extents(ifp, bno, eofp, lastxp, gotp, prevp); 1445 1446 if (unlikely(!(gotp->br_startblock) && (*lastxp != NULLEXTNUM) && 1447 !(XFS_IS_REALTIME_INODE(ip) && fork == XFS_DATA_FORK))) { 1448 xfs_alert_tag(ip->i_mount, XFS_PTAG_FSBLOCK_ZERO, 1449 "Access to block zero in inode %llu " 1450 "start_block: %llx start_off: %llx " 1451 "blkcnt: %llx extent-state: %x lastx: %x", 1452 (unsigned long long)ip->i_ino, 1453 (unsigned long long)gotp->br_startblock, 1454 (unsigned long long)gotp->br_startoff, 1455 (unsigned long long)gotp->br_blockcount, 1456 gotp->br_state, *lastxp); 1457 *lastxp = NULLEXTNUM; 1458 *eofp = 1; 1459 return NULL; 1460 } 1461 return ep; 1462 } 1463 1464 /* 1465 * Returns the file-relative block number of the first unused block(s) 1466 * in the file with at least "len" logically contiguous blocks free. 1467 * This is the lowest-address hole if the file has holes, else the first block 1468 * past the end of file. 1469 * Return 0 if the file is currently local (in-inode). 1470 */ 1471 int /* error */ 1472 xfs_bmap_first_unused( 1473 xfs_trans_t *tp, /* transaction pointer */ 1474 xfs_inode_t *ip, /* incore inode */ 1475 xfs_extlen_t len, /* size of hole to find */ 1476 xfs_fileoff_t *first_unused, /* unused block */ 1477 int whichfork) /* data or attr fork */ 1478 { 1479 int error; /* error return value */ 1480 int idx; /* extent record index */ 1481 xfs_ifork_t *ifp; /* inode fork pointer */ 1482 xfs_fileoff_t lastaddr; /* last block number seen */ 1483 xfs_fileoff_t lowest; /* lowest useful block */ 1484 xfs_fileoff_t max; /* starting useful block */ 1485 xfs_fileoff_t off; /* offset for this block */ 1486 xfs_extnum_t nextents; /* number of extent entries */ 1487 1488 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE || 1489 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS || 1490 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL); 1491 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) { 1492 *first_unused = 0; 1493 return 0; 1494 } 1495 ifp = XFS_IFORK_PTR(ip, whichfork); 1496 if (!(ifp->if_flags & XFS_IFEXTENTS) && 1497 (error = xfs_iread_extents(tp, ip, whichfork))) 1498 return error; 1499 lowest = *first_unused; 1500 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t); 1501 for (idx = 0, lastaddr = 0, max = lowest; idx < nextents; idx++) { 1502 xfs_bmbt_rec_host_t *ep = xfs_iext_get_ext(ifp, idx); 1503 off = xfs_bmbt_get_startoff(ep); 1504 /* 1505 * See if the hole before this extent will work. 1506 */ 1507 if (off >= lowest + len && off - max >= len) { 1508 *first_unused = max; 1509 return 0; 1510 } 1511 lastaddr = off + xfs_bmbt_get_blockcount(ep); 1512 max = XFS_FILEOFF_MAX(lastaddr, lowest); 1513 } 1514 *first_unused = max; 1515 return 0; 1516 } 1517 1518 /* 1519 * Returns the file-relative block number of the last block - 1 before 1520 * last_block (input value) in the file. 1521 * This is not based on i_size, it is based on the extent records. 1522 * Returns 0 for local files, as they do not have extent records. 1523 */ 1524 int /* error */ 1525 xfs_bmap_last_before( 1526 xfs_trans_t *tp, /* transaction pointer */ 1527 xfs_inode_t *ip, /* incore inode */ 1528 xfs_fileoff_t *last_block, /* last block */ 1529 int whichfork) /* data or attr fork */ 1530 { 1531 xfs_fileoff_t bno; /* input file offset */ 1532 int eof; /* hit end of file */ 1533 xfs_bmbt_rec_host_t *ep; /* pointer to last extent */ 1534 int error; /* error return value */ 1535 xfs_bmbt_irec_t got; /* current extent value */ 1536 xfs_ifork_t *ifp; /* inode fork pointer */ 1537 xfs_extnum_t lastx; /* last extent used */ 1538 xfs_bmbt_irec_t prev; /* previous extent value */ 1539 1540 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE && 1541 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && 1542 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL) 1543 return -EIO; 1544 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) { 1545 *last_block = 0; 1546 return 0; 1547 } 1548 ifp = XFS_IFORK_PTR(ip, whichfork); 1549 if (!(ifp->if_flags & XFS_IFEXTENTS) && 1550 (error = xfs_iread_extents(tp, ip, whichfork))) 1551 return error; 1552 bno = *last_block - 1; 1553 ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got, 1554 &prev); 1555 if (eof || xfs_bmbt_get_startoff(ep) > bno) { 1556 if (prev.br_startoff == NULLFILEOFF) 1557 *last_block = 0; 1558 else 1559 *last_block = prev.br_startoff + prev.br_blockcount; 1560 } 1561 /* 1562 * Otherwise *last_block is already the right answer. 1563 */ 1564 return 0; 1565 } 1566 1567 int 1568 xfs_bmap_last_extent( 1569 struct xfs_trans *tp, 1570 struct xfs_inode *ip, 1571 int whichfork, 1572 struct xfs_bmbt_irec *rec, 1573 int *is_empty) 1574 { 1575 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork); 1576 int error; 1577 int nextents; 1578 1579 if (!(ifp->if_flags & XFS_IFEXTENTS)) { 1580 error = xfs_iread_extents(tp, ip, whichfork); 1581 if (error) 1582 return error; 1583 } 1584 1585 nextents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t); 1586 if (nextents == 0) { 1587 *is_empty = 1; 1588 return 0; 1589 } 1590 1591 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, nextents - 1), rec); 1592 *is_empty = 0; 1593 return 0; 1594 } 1595 1596 /* 1597 * Check the last inode extent to determine whether this allocation will result 1598 * in blocks being allocated at the end of the file. When we allocate new data 1599 * blocks at the end of the file which do not start at the previous data block, 1600 * we will try to align the new blocks at stripe unit boundaries. 1601 * 1602 * Returns 1 in bma->aeof if the file (fork) is empty as any new write will be 1603 * at, or past the EOF. 1604 */ 1605 STATIC int 1606 xfs_bmap_isaeof( 1607 struct xfs_bmalloca *bma, 1608 int whichfork) 1609 { 1610 struct xfs_bmbt_irec rec; 1611 int is_empty; 1612 int error; 1613 1614 bma->aeof = 0; 1615 error = xfs_bmap_last_extent(NULL, bma->ip, whichfork, &rec, 1616 &is_empty); 1617 if (error) 1618 return error; 1619 1620 if (is_empty) { 1621 bma->aeof = 1; 1622 return 0; 1623 } 1624 1625 /* 1626 * Check if we are allocation or past the last extent, or at least into 1627 * the last delayed allocated extent. 1628 */ 1629 bma->aeof = bma->offset >= rec.br_startoff + rec.br_blockcount || 1630 (bma->offset >= rec.br_startoff && 1631 isnullstartblock(rec.br_startblock)); 1632 return 0; 1633 } 1634 1635 /* 1636 * Returns the file-relative block number of the first block past eof in 1637 * the file. This is not based on i_size, it is based on the extent records. 1638 * Returns 0 for local files, as they do not have extent records. 1639 */ 1640 int 1641 xfs_bmap_last_offset( 1642 struct xfs_inode *ip, 1643 xfs_fileoff_t *last_block, 1644 int whichfork) 1645 { 1646 struct xfs_bmbt_irec rec; 1647 int is_empty; 1648 int error; 1649 1650 *last_block = 0; 1651 1652 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) 1653 return 0; 1654 1655 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE && 1656 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS) 1657 return -EIO; 1658 1659 error = xfs_bmap_last_extent(NULL, ip, whichfork, &rec, &is_empty); 1660 if (error || is_empty) 1661 return error; 1662 1663 *last_block = rec.br_startoff + rec.br_blockcount; 1664 return 0; 1665 } 1666 1667 /* 1668 * Returns whether the selected fork of the inode has exactly one 1669 * block or not. For the data fork we check this matches di_size, 1670 * implying the file's range is 0..bsize-1. 1671 */ 1672 int /* 1=>1 block, 0=>otherwise */ 1673 xfs_bmap_one_block( 1674 xfs_inode_t *ip, /* incore inode */ 1675 int whichfork) /* data or attr fork */ 1676 { 1677 xfs_bmbt_rec_host_t *ep; /* ptr to fork's extent */ 1678 xfs_ifork_t *ifp; /* inode fork pointer */ 1679 int rval; /* return value */ 1680 xfs_bmbt_irec_t s; /* internal version of extent */ 1681 1682 #ifndef DEBUG 1683 if (whichfork == XFS_DATA_FORK) 1684 return XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize; 1685 #endif /* !DEBUG */ 1686 if (XFS_IFORK_NEXTENTS(ip, whichfork) != 1) 1687 return 0; 1688 if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS) 1689 return 0; 1690 ifp = XFS_IFORK_PTR(ip, whichfork); 1691 ASSERT(ifp->if_flags & XFS_IFEXTENTS); 1692 ep = xfs_iext_get_ext(ifp, 0); 1693 xfs_bmbt_get_all(ep, &s); 1694 rval = s.br_startoff == 0 && s.br_blockcount == 1; 1695 if (rval && whichfork == XFS_DATA_FORK) 1696 ASSERT(XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize); 1697 return rval; 1698 } 1699 1700 /* 1701 * Extent tree manipulation functions used during allocation. 1702 */ 1703 1704 /* 1705 * Convert a delayed allocation to a real allocation. 1706 */ 1707 STATIC int /* error */ 1708 xfs_bmap_add_extent_delay_real( 1709 struct xfs_bmalloca *bma, 1710 int whichfork) 1711 { 1712 struct xfs_bmbt_irec *new = &bma->got; 1713 int diff; /* temp value */ 1714 xfs_bmbt_rec_host_t *ep; /* extent entry for idx */ 1715 int error; /* error return value */ 1716 int i; /* temp state */ 1717 xfs_ifork_t *ifp; /* inode fork pointer */ 1718 xfs_fileoff_t new_endoff; /* end offset of new entry */ 1719 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */ 1720 /* left is 0, right is 1, prev is 2 */ 1721 int rval=0; /* return value (logging flags) */ 1722 int state = 0;/* state bits, accessed thru macros */ 1723 xfs_filblks_t da_new; /* new count del alloc blocks used */ 1724 xfs_filblks_t da_old; /* old count del alloc blocks used */ 1725 xfs_filblks_t temp=0; /* value for da_new calculations */ 1726 xfs_filblks_t temp2=0;/* value for da_new calculations */ 1727 int tmp_rval; /* partial logging flags */ 1728 struct xfs_mount *mp; 1729 xfs_extnum_t *nextents; 1730 1731 mp = bma->ip->i_mount; 1732 ifp = XFS_IFORK_PTR(bma->ip, whichfork); 1733 ASSERT(whichfork != XFS_ATTR_FORK); 1734 nextents = (whichfork == XFS_COW_FORK ? &bma->ip->i_cnextents : 1735 &bma->ip->i_d.di_nextents); 1736 1737 ASSERT(bma->idx >= 0); 1738 ASSERT(bma->idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec)); 1739 ASSERT(!isnullstartblock(new->br_startblock)); 1740 ASSERT(!bma->cur || 1741 (bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL)); 1742 1743 XFS_STATS_INC(mp, xs_add_exlist); 1744 1745 #define LEFT r[0] 1746 #define RIGHT r[1] 1747 #define PREV r[2] 1748 1749 if (whichfork == XFS_COW_FORK) 1750 state |= BMAP_COWFORK; 1751 1752 /* 1753 * Set up a bunch of variables to make the tests simpler. 1754 */ 1755 ep = xfs_iext_get_ext(ifp, bma->idx); 1756 xfs_bmbt_get_all(ep, &PREV); 1757 new_endoff = new->br_startoff + new->br_blockcount; 1758 ASSERT(PREV.br_startoff <= new->br_startoff); 1759 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff); 1760 1761 da_old = startblockval(PREV.br_startblock); 1762 da_new = 0; 1763 1764 /* 1765 * Set flags determining what part of the previous delayed allocation 1766 * extent is being replaced by a real allocation. 1767 */ 1768 if (PREV.br_startoff == new->br_startoff) 1769 state |= BMAP_LEFT_FILLING; 1770 if (PREV.br_startoff + PREV.br_blockcount == new_endoff) 1771 state |= BMAP_RIGHT_FILLING; 1772 1773 /* 1774 * Check and set flags if this segment has a left neighbor. 1775 * Don't set contiguous if the combined extent would be too large. 1776 */ 1777 if (bma->idx > 0) { 1778 state |= BMAP_LEFT_VALID; 1779 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &LEFT); 1780 1781 if (isnullstartblock(LEFT.br_startblock)) 1782 state |= BMAP_LEFT_DELAY; 1783 } 1784 1785 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) && 1786 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff && 1787 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock && 1788 LEFT.br_state == new->br_state && 1789 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN) 1790 state |= BMAP_LEFT_CONTIG; 1791 1792 /* 1793 * Check and set flags if this segment has a right neighbor. 1794 * Don't set contiguous if the combined extent would be too large. 1795 * Also check for all-three-contiguous being too large. 1796 */ 1797 if (bma->idx < ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) { 1798 state |= BMAP_RIGHT_VALID; 1799 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx + 1), &RIGHT); 1800 1801 if (isnullstartblock(RIGHT.br_startblock)) 1802 state |= BMAP_RIGHT_DELAY; 1803 } 1804 1805 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) && 1806 new_endoff == RIGHT.br_startoff && 1807 new->br_startblock + new->br_blockcount == RIGHT.br_startblock && 1808 new->br_state == RIGHT.br_state && 1809 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN && 1810 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING | 1811 BMAP_RIGHT_FILLING)) != 1812 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING | 1813 BMAP_RIGHT_FILLING) || 1814 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount 1815 <= MAXEXTLEN)) 1816 state |= BMAP_RIGHT_CONTIG; 1817 1818 error = 0; 1819 /* 1820 * Switch out based on the FILLING and CONTIG state bits. 1821 */ 1822 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | 1823 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) { 1824 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | 1825 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: 1826 /* 1827 * Filling in all of a previously delayed allocation extent. 1828 * The left and right neighbors are both contiguous with new. 1829 */ 1830 bma->idx--; 1831 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 1832 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx), 1833 LEFT.br_blockcount + PREV.br_blockcount + 1834 RIGHT.br_blockcount); 1835 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 1836 1837 xfs_iext_remove(bma->ip, bma->idx + 1, 2, state); 1838 (*nextents)--; 1839 if (bma->cur == NULL) 1840 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 1841 else { 1842 rval = XFS_ILOG_CORE; 1843 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff, 1844 RIGHT.br_startblock, 1845 RIGHT.br_blockcount, &i); 1846 if (error) 1847 goto done; 1848 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 1849 error = xfs_btree_delete(bma->cur, &i); 1850 if (error) 1851 goto done; 1852 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 1853 error = xfs_btree_decrement(bma->cur, 0, &i); 1854 if (error) 1855 goto done; 1856 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 1857 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff, 1858 LEFT.br_startblock, 1859 LEFT.br_blockcount + 1860 PREV.br_blockcount + 1861 RIGHT.br_blockcount, LEFT.br_state); 1862 if (error) 1863 goto done; 1864 } 1865 break; 1866 1867 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG: 1868 /* 1869 * Filling in all of a previously delayed allocation extent. 1870 * The left neighbor is contiguous, the right is not. 1871 */ 1872 bma->idx--; 1873 1874 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 1875 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx), 1876 LEFT.br_blockcount + PREV.br_blockcount); 1877 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 1878 1879 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state); 1880 if (bma->cur == NULL) 1881 rval = XFS_ILOG_DEXT; 1882 else { 1883 rval = 0; 1884 error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff, 1885 LEFT.br_startblock, LEFT.br_blockcount, 1886 &i); 1887 if (error) 1888 goto done; 1889 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 1890 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff, 1891 LEFT.br_startblock, 1892 LEFT.br_blockcount + 1893 PREV.br_blockcount, LEFT.br_state); 1894 if (error) 1895 goto done; 1896 } 1897 break; 1898 1899 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: 1900 /* 1901 * Filling in all of a previously delayed allocation extent. 1902 * The right neighbor is contiguous, the left is not. 1903 */ 1904 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 1905 xfs_bmbt_set_startblock(ep, new->br_startblock); 1906 xfs_bmbt_set_blockcount(ep, 1907 PREV.br_blockcount + RIGHT.br_blockcount); 1908 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 1909 1910 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state); 1911 if (bma->cur == NULL) 1912 rval = XFS_ILOG_DEXT; 1913 else { 1914 rval = 0; 1915 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff, 1916 RIGHT.br_startblock, 1917 RIGHT.br_blockcount, &i); 1918 if (error) 1919 goto done; 1920 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 1921 error = xfs_bmbt_update(bma->cur, PREV.br_startoff, 1922 new->br_startblock, 1923 PREV.br_blockcount + 1924 RIGHT.br_blockcount, PREV.br_state); 1925 if (error) 1926 goto done; 1927 } 1928 break; 1929 1930 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING: 1931 /* 1932 * Filling in all of a previously delayed allocation extent. 1933 * Neither the left nor right neighbors are contiguous with 1934 * the new one. 1935 */ 1936 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 1937 xfs_bmbt_set_startblock(ep, new->br_startblock); 1938 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 1939 1940 (*nextents)++; 1941 if (bma->cur == NULL) 1942 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 1943 else { 1944 rval = XFS_ILOG_CORE; 1945 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff, 1946 new->br_startblock, new->br_blockcount, 1947 &i); 1948 if (error) 1949 goto done; 1950 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done); 1951 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM; 1952 error = xfs_btree_insert(bma->cur, &i); 1953 if (error) 1954 goto done; 1955 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 1956 } 1957 break; 1958 1959 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG: 1960 /* 1961 * Filling in the first part of a previous delayed allocation. 1962 * The left neighbor is contiguous. 1963 */ 1964 trace_xfs_bmap_pre_update(bma->ip, bma->idx - 1, state, _THIS_IP_); 1965 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx - 1), 1966 LEFT.br_blockcount + new->br_blockcount); 1967 xfs_bmbt_set_startoff(ep, 1968 PREV.br_startoff + new->br_blockcount); 1969 trace_xfs_bmap_post_update(bma->ip, bma->idx - 1, state, _THIS_IP_); 1970 1971 temp = PREV.br_blockcount - new->br_blockcount; 1972 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 1973 xfs_bmbt_set_blockcount(ep, temp); 1974 if (bma->cur == NULL) 1975 rval = XFS_ILOG_DEXT; 1976 else { 1977 rval = 0; 1978 error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff, 1979 LEFT.br_startblock, LEFT.br_blockcount, 1980 &i); 1981 if (error) 1982 goto done; 1983 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 1984 error = xfs_bmbt_update(bma->cur, LEFT.br_startoff, 1985 LEFT.br_startblock, 1986 LEFT.br_blockcount + 1987 new->br_blockcount, 1988 LEFT.br_state); 1989 if (error) 1990 goto done; 1991 } 1992 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp), 1993 startblockval(PREV.br_startblock)); 1994 xfs_bmbt_set_startblock(ep, nullstartblock(da_new)); 1995 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 1996 1997 bma->idx--; 1998 break; 1999 2000 case BMAP_LEFT_FILLING: 2001 /* 2002 * Filling in the first part of a previous delayed allocation. 2003 * The left neighbor is not contiguous. 2004 */ 2005 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 2006 xfs_bmbt_set_startoff(ep, new_endoff); 2007 temp = PREV.br_blockcount - new->br_blockcount; 2008 xfs_bmbt_set_blockcount(ep, temp); 2009 xfs_iext_insert(bma->ip, bma->idx, 1, new, state); 2010 (*nextents)++; 2011 if (bma->cur == NULL) 2012 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2013 else { 2014 rval = XFS_ILOG_CORE; 2015 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff, 2016 new->br_startblock, new->br_blockcount, 2017 &i); 2018 if (error) 2019 goto done; 2020 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done); 2021 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM; 2022 error = xfs_btree_insert(bma->cur, &i); 2023 if (error) 2024 goto done; 2025 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2026 } 2027 2028 if (xfs_bmap_needs_btree(bma->ip, whichfork)) { 2029 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, 2030 bma->firstblock, bma->dfops, 2031 &bma->cur, 1, &tmp_rval, whichfork); 2032 rval |= tmp_rval; 2033 if (error) 2034 goto done; 2035 } 2036 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp), 2037 startblockval(PREV.br_startblock) - 2038 (bma->cur ? bma->cur->bc_private.b.allocated : 0)); 2039 ep = xfs_iext_get_ext(ifp, bma->idx + 1); 2040 xfs_bmbt_set_startblock(ep, nullstartblock(da_new)); 2041 trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_); 2042 break; 2043 2044 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: 2045 /* 2046 * Filling in the last part of a previous delayed allocation. 2047 * The right neighbor is contiguous with the new allocation. 2048 */ 2049 temp = PREV.br_blockcount - new->br_blockcount; 2050 trace_xfs_bmap_pre_update(bma->ip, bma->idx + 1, state, _THIS_IP_); 2051 xfs_bmbt_set_blockcount(ep, temp); 2052 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx + 1), 2053 new->br_startoff, new->br_startblock, 2054 new->br_blockcount + RIGHT.br_blockcount, 2055 RIGHT.br_state); 2056 trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_); 2057 if (bma->cur == NULL) 2058 rval = XFS_ILOG_DEXT; 2059 else { 2060 rval = 0; 2061 error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff, 2062 RIGHT.br_startblock, 2063 RIGHT.br_blockcount, &i); 2064 if (error) 2065 goto done; 2066 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2067 error = xfs_bmbt_update(bma->cur, new->br_startoff, 2068 new->br_startblock, 2069 new->br_blockcount + 2070 RIGHT.br_blockcount, 2071 RIGHT.br_state); 2072 if (error) 2073 goto done; 2074 } 2075 2076 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp), 2077 startblockval(PREV.br_startblock)); 2078 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 2079 xfs_bmbt_set_startblock(ep, nullstartblock(da_new)); 2080 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 2081 2082 bma->idx++; 2083 break; 2084 2085 case BMAP_RIGHT_FILLING: 2086 /* 2087 * Filling in the last part of a previous delayed allocation. 2088 * The right neighbor is not contiguous. 2089 */ 2090 temp = PREV.br_blockcount - new->br_blockcount; 2091 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 2092 xfs_bmbt_set_blockcount(ep, temp); 2093 xfs_iext_insert(bma->ip, bma->idx + 1, 1, new, state); 2094 (*nextents)++; 2095 if (bma->cur == NULL) 2096 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2097 else { 2098 rval = XFS_ILOG_CORE; 2099 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff, 2100 new->br_startblock, new->br_blockcount, 2101 &i); 2102 if (error) 2103 goto done; 2104 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done); 2105 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM; 2106 error = xfs_btree_insert(bma->cur, &i); 2107 if (error) 2108 goto done; 2109 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2110 } 2111 2112 if (xfs_bmap_needs_btree(bma->ip, whichfork)) { 2113 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, 2114 bma->firstblock, bma->dfops, &bma->cur, 1, 2115 &tmp_rval, whichfork); 2116 rval |= tmp_rval; 2117 if (error) 2118 goto done; 2119 } 2120 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp), 2121 startblockval(PREV.br_startblock) - 2122 (bma->cur ? bma->cur->bc_private.b.allocated : 0)); 2123 ep = xfs_iext_get_ext(ifp, bma->idx); 2124 xfs_bmbt_set_startblock(ep, nullstartblock(da_new)); 2125 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 2126 2127 bma->idx++; 2128 break; 2129 2130 case 0: 2131 /* 2132 * Filling in the middle part of a previous delayed allocation. 2133 * Contiguity is impossible here. 2134 * This case is avoided almost all the time. 2135 * 2136 * We start with a delayed allocation: 2137 * 2138 * +ddddddddddddddddddddddddddddddddddddddddddddddddddddddd+ 2139 * PREV @ idx 2140 * 2141 * and we are allocating: 2142 * +rrrrrrrrrrrrrrrrr+ 2143 * new 2144 * 2145 * and we set it up for insertion as: 2146 * +ddddddddddddddddddd+rrrrrrrrrrrrrrrrr+ddddddddddddddddd+ 2147 * new 2148 * PREV @ idx LEFT RIGHT 2149 * inserted at idx + 1 2150 */ 2151 temp = new->br_startoff - PREV.br_startoff; 2152 temp2 = PREV.br_startoff + PREV.br_blockcount - new_endoff; 2153 trace_xfs_bmap_pre_update(bma->ip, bma->idx, 0, _THIS_IP_); 2154 xfs_bmbt_set_blockcount(ep, temp); /* truncate PREV */ 2155 LEFT = *new; 2156 RIGHT.br_state = PREV.br_state; 2157 RIGHT.br_startblock = nullstartblock( 2158 (int)xfs_bmap_worst_indlen(bma->ip, temp2)); 2159 RIGHT.br_startoff = new_endoff; 2160 RIGHT.br_blockcount = temp2; 2161 /* insert LEFT (r[0]) and RIGHT (r[1]) at the same time */ 2162 xfs_iext_insert(bma->ip, bma->idx + 1, 2, &LEFT, state); 2163 (*nextents)++; 2164 if (bma->cur == NULL) 2165 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2166 else { 2167 rval = XFS_ILOG_CORE; 2168 error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff, 2169 new->br_startblock, new->br_blockcount, 2170 &i); 2171 if (error) 2172 goto done; 2173 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done); 2174 bma->cur->bc_rec.b.br_state = XFS_EXT_NORM; 2175 error = xfs_btree_insert(bma->cur, &i); 2176 if (error) 2177 goto done; 2178 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2179 } 2180 2181 if (xfs_bmap_needs_btree(bma->ip, whichfork)) { 2182 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, 2183 bma->firstblock, bma->dfops, &bma->cur, 2184 1, &tmp_rval, whichfork); 2185 rval |= tmp_rval; 2186 if (error) 2187 goto done; 2188 } 2189 temp = xfs_bmap_worst_indlen(bma->ip, temp); 2190 temp2 = xfs_bmap_worst_indlen(bma->ip, temp2); 2191 diff = (int)(temp + temp2 - startblockval(PREV.br_startblock) - 2192 (bma->cur ? bma->cur->bc_private.b.allocated : 0)); 2193 if (diff > 0) { 2194 error = xfs_mod_fdblocks(bma->ip->i_mount, 2195 -((int64_t)diff), false); 2196 ASSERT(!error); 2197 if (error) 2198 goto done; 2199 } 2200 2201 ep = xfs_iext_get_ext(ifp, bma->idx); 2202 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); 2203 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 2204 trace_xfs_bmap_pre_update(bma->ip, bma->idx + 2, state, _THIS_IP_); 2205 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, bma->idx + 2), 2206 nullstartblock((int)temp2)); 2207 trace_xfs_bmap_post_update(bma->ip, bma->idx + 2, state, _THIS_IP_); 2208 2209 bma->idx++; 2210 da_new = temp + temp2; 2211 break; 2212 2213 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: 2214 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: 2215 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG: 2216 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG: 2217 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: 2218 case BMAP_LEFT_CONTIG: 2219 case BMAP_RIGHT_CONTIG: 2220 /* 2221 * These cases are all impossible. 2222 */ 2223 ASSERT(0); 2224 } 2225 2226 /* add reverse mapping */ 2227 error = xfs_rmap_map_extent(mp, bma->dfops, bma->ip, whichfork, new); 2228 if (error) 2229 goto done; 2230 2231 /* convert to a btree if necessary */ 2232 if (xfs_bmap_needs_btree(bma->ip, whichfork)) { 2233 int tmp_logflags; /* partial log flag return val */ 2234 2235 ASSERT(bma->cur == NULL); 2236 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, 2237 bma->firstblock, bma->dfops, &bma->cur, 2238 da_old > 0, &tmp_logflags, whichfork); 2239 bma->logflags |= tmp_logflags; 2240 if (error) 2241 goto done; 2242 } 2243 2244 /* adjust for changes in reserved delayed indirect blocks */ 2245 if (da_old || da_new) { 2246 temp = da_new; 2247 if (bma->cur) 2248 temp += bma->cur->bc_private.b.allocated; 2249 ASSERT(temp <= da_old); 2250 if (temp < da_old) 2251 xfs_mod_fdblocks(bma->ip->i_mount, 2252 (int64_t)(da_old - temp), false); 2253 } 2254 2255 /* clear out the allocated field, done with it now in any case. */ 2256 if (bma->cur) 2257 bma->cur->bc_private.b.allocated = 0; 2258 2259 xfs_bmap_check_leaf_extents(bma->cur, bma->ip, whichfork); 2260 done: 2261 if (whichfork != XFS_COW_FORK) 2262 bma->logflags |= rval; 2263 return error; 2264 #undef LEFT 2265 #undef RIGHT 2266 #undef PREV 2267 } 2268 2269 /* 2270 * Convert an unwritten allocation to a real allocation or vice versa. 2271 */ 2272 STATIC int /* error */ 2273 xfs_bmap_add_extent_unwritten_real( 2274 struct xfs_trans *tp, 2275 xfs_inode_t *ip, /* incore inode pointer */ 2276 xfs_extnum_t *idx, /* extent number to update/insert */ 2277 xfs_btree_cur_t **curp, /* if *curp is null, not a btree */ 2278 xfs_bmbt_irec_t *new, /* new data to add to file extents */ 2279 xfs_fsblock_t *first, /* pointer to firstblock variable */ 2280 struct xfs_defer_ops *dfops, /* list of extents to be freed */ 2281 int *logflagsp) /* inode logging flags */ 2282 { 2283 xfs_btree_cur_t *cur; /* btree cursor */ 2284 xfs_bmbt_rec_host_t *ep; /* extent entry for idx */ 2285 int error; /* error return value */ 2286 int i; /* temp state */ 2287 xfs_ifork_t *ifp; /* inode fork pointer */ 2288 xfs_fileoff_t new_endoff; /* end offset of new entry */ 2289 xfs_exntst_t newext; /* new extent state */ 2290 xfs_exntst_t oldext; /* old extent state */ 2291 xfs_bmbt_irec_t r[3]; /* neighbor extent entries */ 2292 /* left is 0, right is 1, prev is 2 */ 2293 int rval=0; /* return value (logging flags) */ 2294 int state = 0;/* state bits, accessed thru macros */ 2295 struct xfs_mount *mp = tp->t_mountp; 2296 2297 *logflagsp = 0; 2298 2299 cur = *curp; 2300 ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK); 2301 2302 ASSERT(*idx >= 0); 2303 ASSERT(*idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec)); 2304 ASSERT(!isnullstartblock(new->br_startblock)); 2305 2306 XFS_STATS_INC(mp, xs_add_exlist); 2307 2308 #define LEFT r[0] 2309 #define RIGHT r[1] 2310 #define PREV r[2] 2311 2312 /* 2313 * Set up a bunch of variables to make the tests simpler. 2314 */ 2315 error = 0; 2316 ep = xfs_iext_get_ext(ifp, *idx); 2317 xfs_bmbt_get_all(ep, &PREV); 2318 newext = new->br_state; 2319 oldext = (newext == XFS_EXT_UNWRITTEN) ? 2320 XFS_EXT_NORM : XFS_EXT_UNWRITTEN; 2321 ASSERT(PREV.br_state == oldext); 2322 new_endoff = new->br_startoff + new->br_blockcount; 2323 ASSERT(PREV.br_startoff <= new->br_startoff); 2324 ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff); 2325 2326 /* 2327 * Set flags determining what part of the previous oldext allocation 2328 * extent is being replaced by a newext allocation. 2329 */ 2330 if (PREV.br_startoff == new->br_startoff) 2331 state |= BMAP_LEFT_FILLING; 2332 if (PREV.br_startoff + PREV.br_blockcount == new_endoff) 2333 state |= BMAP_RIGHT_FILLING; 2334 2335 /* 2336 * Check and set flags if this segment has a left neighbor. 2337 * Don't set contiguous if the combined extent would be too large. 2338 */ 2339 if (*idx > 0) { 2340 state |= BMAP_LEFT_VALID; 2341 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &LEFT); 2342 2343 if (isnullstartblock(LEFT.br_startblock)) 2344 state |= BMAP_LEFT_DELAY; 2345 } 2346 2347 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) && 2348 LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff && 2349 LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock && 2350 LEFT.br_state == newext && 2351 LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN) 2352 state |= BMAP_LEFT_CONTIG; 2353 2354 /* 2355 * Check and set flags if this segment has a right neighbor. 2356 * Don't set contiguous if the combined extent would be too large. 2357 * Also check for all-three-contiguous being too large. 2358 */ 2359 if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) { 2360 state |= BMAP_RIGHT_VALID; 2361 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx + 1), &RIGHT); 2362 if (isnullstartblock(RIGHT.br_startblock)) 2363 state |= BMAP_RIGHT_DELAY; 2364 } 2365 2366 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) && 2367 new_endoff == RIGHT.br_startoff && 2368 new->br_startblock + new->br_blockcount == RIGHT.br_startblock && 2369 newext == RIGHT.br_state && 2370 new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN && 2371 ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING | 2372 BMAP_RIGHT_FILLING)) != 2373 (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING | 2374 BMAP_RIGHT_FILLING) || 2375 LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount 2376 <= MAXEXTLEN)) 2377 state |= BMAP_RIGHT_CONTIG; 2378 2379 /* 2380 * Switch out based on the FILLING and CONTIG state bits. 2381 */ 2382 switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | 2383 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) { 2384 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | 2385 BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: 2386 /* 2387 * Setting all of a previous oldext extent to newext. 2388 * The left and right neighbors are both contiguous with new. 2389 */ 2390 --*idx; 2391 2392 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2393 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), 2394 LEFT.br_blockcount + PREV.br_blockcount + 2395 RIGHT.br_blockcount); 2396 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2397 2398 xfs_iext_remove(ip, *idx + 1, 2, state); 2399 ip->i_d.di_nextents -= 2; 2400 if (cur == NULL) 2401 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2402 else { 2403 rval = XFS_ILOG_CORE; 2404 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff, 2405 RIGHT.br_startblock, 2406 RIGHT.br_blockcount, &i))) 2407 goto done; 2408 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2409 if ((error = xfs_btree_delete(cur, &i))) 2410 goto done; 2411 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2412 if ((error = xfs_btree_decrement(cur, 0, &i))) 2413 goto done; 2414 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2415 if ((error = xfs_btree_delete(cur, &i))) 2416 goto done; 2417 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2418 if ((error = xfs_btree_decrement(cur, 0, &i))) 2419 goto done; 2420 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2421 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff, 2422 LEFT.br_startblock, 2423 LEFT.br_blockcount + PREV.br_blockcount + 2424 RIGHT.br_blockcount, LEFT.br_state))) 2425 goto done; 2426 } 2427 break; 2428 2429 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG: 2430 /* 2431 * Setting all of a previous oldext extent to newext. 2432 * The left neighbor is contiguous, the right is not. 2433 */ 2434 --*idx; 2435 2436 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2437 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), 2438 LEFT.br_blockcount + PREV.br_blockcount); 2439 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2440 2441 xfs_iext_remove(ip, *idx + 1, 1, state); 2442 ip->i_d.di_nextents--; 2443 if (cur == NULL) 2444 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2445 else { 2446 rval = XFS_ILOG_CORE; 2447 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, 2448 PREV.br_startblock, PREV.br_blockcount, 2449 &i))) 2450 goto done; 2451 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2452 if ((error = xfs_btree_delete(cur, &i))) 2453 goto done; 2454 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2455 if ((error = xfs_btree_decrement(cur, 0, &i))) 2456 goto done; 2457 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2458 if ((error = xfs_bmbt_update(cur, LEFT.br_startoff, 2459 LEFT.br_startblock, 2460 LEFT.br_blockcount + PREV.br_blockcount, 2461 LEFT.br_state))) 2462 goto done; 2463 } 2464 break; 2465 2466 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: 2467 /* 2468 * Setting all of a previous oldext extent to newext. 2469 * The right neighbor is contiguous, the left is not. 2470 */ 2471 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2472 xfs_bmbt_set_blockcount(ep, 2473 PREV.br_blockcount + RIGHT.br_blockcount); 2474 xfs_bmbt_set_state(ep, newext); 2475 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2476 xfs_iext_remove(ip, *idx + 1, 1, state); 2477 ip->i_d.di_nextents--; 2478 if (cur == NULL) 2479 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2480 else { 2481 rval = XFS_ILOG_CORE; 2482 if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff, 2483 RIGHT.br_startblock, 2484 RIGHT.br_blockcount, &i))) 2485 goto done; 2486 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2487 if ((error = xfs_btree_delete(cur, &i))) 2488 goto done; 2489 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2490 if ((error = xfs_btree_decrement(cur, 0, &i))) 2491 goto done; 2492 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2493 if ((error = xfs_bmbt_update(cur, new->br_startoff, 2494 new->br_startblock, 2495 new->br_blockcount + RIGHT.br_blockcount, 2496 newext))) 2497 goto done; 2498 } 2499 break; 2500 2501 case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING: 2502 /* 2503 * Setting all of a previous oldext extent to newext. 2504 * Neither the left nor right neighbors are contiguous with 2505 * the new one. 2506 */ 2507 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2508 xfs_bmbt_set_state(ep, newext); 2509 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2510 2511 if (cur == NULL) 2512 rval = XFS_ILOG_DEXT; 2513 else { 2514 rval = 0; 2515 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff, 2516 new->br_startblock, new->br_blockcount, 2517 &i))) 2518 goto done; 2519 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2520 if ((error = xfs_bmbt_update(cur, new->br_startoff, 2521 new->br_startblock, new->br_blockcount, 2522 newext))) 2523 goto done; 2524 } 2525 break; 2526 2527 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG: 2528 /* 2529 * Setting the first part of a previous oldext extent to newext. 2530 * The left neighbor is contiguous. 2531 */ 2532 trace_xfs_bmap_pre_update(ip, *idx - 1, state, _THIS_IP_); 2533 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx - 1), 2534 LEFT.br_blockcount + new->br_blockcount); 2535 xfs_bmbt_set_startoff(ep, 2536 PREV.br_startoff + new->br_blockcount); 2537 trace_xfs_bmap_post_update(ip, *idx - 1, state, _THIS_IP_); 2538 2539 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2540 xfs_bmbt_set_startblock(ep, 2541 new->br_startblock + new->br_blockcount); 2542 xfs_bmbt_set_blockcount(ep, 2543 PREV.br_blockcount - new->br_blockcount); 2544 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2545 2546 --*idx; 2547 2548 if (cur == NULL) 2549 rval = XFS_ILOG_DEXT; 2550 else { 2551 rval = 0; 2552 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, 2553 PREV.br_startblock, PREV.br_blockcount, 2554 &i))) 2555 goto done; 2556 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2557 if ((error = xfs_bmbt_update(cur, 2558 PREV.br_startoff + new->br_blockcount, 2559 PREV.br_startblock + new->br_blockcount, 2560 PREV.br_blockcount - new->br_blockcount, 2561 oldext))) 2562 goto done; 2563 if ((error = xfs_btree_decrement(cur, 0, &i))) 2564 goto done; 2565 error = xfs_bmbt_update(cur, LEFT.br_startoff, 2566 LEFT.br_startblock, 2567 LEFT.br_blockcount + new->br_blockcount, 2568 LEFT.br_state); 2569 if (error) 2570 goto done; 2571 } 2572 break; 2573 2574 case BMAP_LEFT_FILLING: 2575 /* 2576 * Setting the first part of a previous oldext extent to newext. 2577 * The left neighbor is not contiguous. 2578 */ 2579 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2580 ASSERT(ep && xfs_bmbt_get_state(ep) == oldext); 2581 xfs_bmbt_set_startoff(ep, new_endoff); 2582 xfs_bmbt_set_blockcount(ep, 2583 PREV.br_blockcount - new->br_blockcount); 2584 xfs_bmbt_set_startblock(ep, 2585 new->br_startblock + new->br_blockcount); 2586 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2587 2588 xfs_iext_insert(ip, *idx, 1, new, state); 2589 ip->i_d.di_nextents++; 2590 if (cur == NULL) 2591 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2592 else { 2593 rval = XFS_ILOG_CORE; 2594 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, 2595 PREV.br_startblock, PREV.br_blockcount, 2596 &i))) 2597 goto done; 2598 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2599 if ((error = xfs_bmbt_update(cur, 2600 PREV.br_startoff + new->br_blockcount, 2601 PREV.br_startblock + new->br_blockcount, 2602 PREV.br_blockcount - new->br_blockcount, 2603 oldext))) 2604 goto done; 2605 cur->bc_rec.b = *new; 2606 if ((error = xfs_btree_insert(cur, &i))) 2607 goto done; 2608 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2609 } 2610 break; 2611 2612 case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: 2613 /* 2614 * Setting the last part of a previous oldext extent to newext. 2615 * The right neighbor is contiguous with the new allocation. 2616 */ 2617 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2618 xfs_bmbt_set_blockcount(ep, 2619 PREV.br_blockcount - new->br_blockcount); 2620 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2621 2622 ++*idx; 2623 2624 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2625 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx), 2626 new->br_startoff, new->br_startblock, 2627 new->br_blockcount + RIGHT.br_blockcount, newext); 2628 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2629 2630 if (cur == NULL) 2631 rval = XFS_ILOG_DEXT; 2632 else { 2633 rval = 0; 2634 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, 2635 PREV.br_startblock, 2636 PREV.br_blockcount, &i))) 2637 goto done; 2638 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2639 if ((error = xfs_bmbt_update(cur, PREV.br_startoff, 2640 PREV.br_startblock, 2641 PREV.br_blockcount - new->br_blockcount, 2642 oldext))) 2643 goto done; 2644 if ((error = xfs_btree_increment(cur, 0, &i))) 2645 goto done; 2646 if ((error = xfs_bmbt_update(cur, new->br_startoff, 2647 new->br_startblock, 2648 new->br_blockcount + RIGHT.br_blockcount, 2649 newext))) 2650 goto done; 2651 } 2652 break; 2653 2654 case BMAP_RIGHT_FILLING: 2655 /* 2656 * Setting the last part of a previous oldext extent to newext. 2657 * The right neighbor is not contiguous. 2658 */ 2659 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2660 xfs_bmbt_set_blockcount(ep, 2661 PREV.br_blockcount - new->br_blockcount); 2662 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2663 2664 ++*idx; 2665 xfs_iext_insert(ip, *idx, 1, new, state); 2666 2667 ip->i_d.di_nextents++; 2668 if (cur == NULL) 2669 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2670 else { 2671 rval = XFS_ILOG_CORE; 2672 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, 2673 PREV.br_startblock, PREV.br_blockcount, 2674 &i))) 2675 goto done; 2676 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2677 if ((error = xfs_bmbt_update(cur, PREV.br_startoff, 2678 PREV.br_startblock, 2679 PREV.br_blockcount - new->br_blockcount, 2680 oldext))) 2681 goto done; 2682 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff, 2683 new->br_startblock, new->br_blockcount, 2684 &i))) 2685 goto done; 2686 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done); 2687 cur->bc_rec.b.br_state = XFS_EXT_NORM; 2688 if ((error = xfs_btree_insert(cur, &i))) 2689 goto done; 2690 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2691 } 2692 break; 2693 2694 case 0: 2695 /* 2696 * Setting the middle part of a previous oldext extent to 2697 * newext. Contiguity is impossible here. 2698 * One extent becomes three extents. 2699 */ 2700 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2701 xfs_bmbt_set_blockcount(ep, 2702 new->br_startoff - PREV.br_startoff); 2703 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2704 2705 r[0] = *new; 2706 r[1].br_startoff = new_endoff; 2707 r[1].br_blockcount = 2708 PREV.br_startoff + PREV.br_blockcount - new_endoff; 2709 r[1].br_startblock = new->br_startblock + new->br_blockcount; 2710 r[1].br_state = oldext; 2711 2712 ++*idx; 2713 xfs_iext_insert(ip, *idx, 2, &r[0], state); 2714 2715 ip->i_d.di_nextents += 2; 2716 if (cur == NULL) 2717 rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; 2718 else { 2719 rval = XFS_ILOG_CORE; 2720 if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, 2721 PREV.br_startblock, PREV.br_blockcount, 2722 &i))) 2723 goto done; 2724 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2725 /* new right extent - oldext */ 2726 if ((error = xfs_bmbt_update(cur, r[1].br_startoff, 2727 r[1].br_startblock, r[1].br_blockcount, 2728 r[1].br_state))) 2729 goto done; 2730 /* new left extent - oldext */ 2731 cur->bc_rec.b = PREV; 2732 cur->bc_rec.b.br_blockcount = 2733 new->br_startoff - PREV.br_startoff; 2734 if ((error = xfs_btree_insert(cur, &i))) 2735 goto done; 2736 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2737 /* 2738 * Reset the cursor to the position of the new extent 2739 * we are about to insert as we can't trust it after 2740 * the previous insert. 2741 */ 2742 if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff, 2743 new->br_startblock, new->br_blockcount, 2744 &i))) 2745 goto done; 2746 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done); 2747 /* new middle extent - newext */ 2748 cur->bc_rec.b.br_state = new->br_state; 2749 if ((error = xfs_btree_insert(cur, &i))) 2750 goto done; 2751 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 2752 } 2753 break; 2754 2755 case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: 2756 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: 2757 case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG: 2758 case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG: 2759 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: 2760 case BMAP_LEFT_CONTIG: 2761 case BMAP_RIGHT_CONTIG: 2762 /* 2763 * These cases are all impossible. 2764 */ 2765 ASSERT(0); 2766 } 2767 2768 /* update reverse mappings */ 2769 error = xfs_rmap_convert_extent(mp, dfops, ip, XFS_DATA_FORK, new); 2770 if (error) 2771 goto done; 2772 2773 /* convert to a btree if necessary */ 2774 if (xfs_bmap_needs_btree(ip, XFS_DATA_FORK)) { 2775 int tmp_logflags; /* partial log flag return val */ 2776 2777 ASSERT(cur == NULL); 2778 error = xfs_bmap_extents_to_btree(tp, ip, first, dfops, &cur, 2779 0, &tmp_logflags, XFS_DATA_FORK); 2780 *logflagsp |= tmp_logflags; 2781 if (error) 2782 goto done; 2783 } 2784 2785 /* clear out the allocated field, done with it now in any case. */ 2786 if (cur) { 2787 cur->bc_private.b.allocated = 0; 2788 *curp = cur; 2789 } 2790 2791 xfs_bmap_check_leaf_extents(*curp, ip, XFS_DATA_FORK); 2792 done: 2793 *logflagsp |= rval; 2794 return error; 2795 #undef LEFT 2796 #undef RIGHT 2797 #undef PREV 2798 } 2799 2800 /* 2801 * Convert a hole to a delayed allocation. 2802 */ 2803 STATIC void 2804 xfs_bmap_add_extent_hole_delay( 2805 xfs_inode_t *ip, /* incore inode pointer */ 2806 int whichfork, 2807 xfs_extnum_t *idx, /* extent number to update/insert */ 2808 xfs_bmbt_irec_t *new) /* new data to add to file extents */ 2809 { 2810 xfs_ifork_t *ifp; /* inode fork pointer */ 2811 xfs_bmbt_irec_t left; /* left neighbor extent entry */ 2812 xfs_filblks_t newlen=0; /* new indirect size */ 2813 xfs_filblks_t oldlen=0; /* old indirect size */ 2814 xfs_bmbt_irec_t right; /* right neighbor extent entry */ 2815 int state; /* state bits, accessed thru macros */ 2816 xfs_filblks_t temp=0; /* temp for indirect calculations */ 2817 2818 ifp = XFS_IFORK_PTR(ip, whichfork); 2819 state = 0; 2820 if (whichfork == XFS_COW_FORK) 2821 state |= BMAP_COWFORK; 2822 ASSERT(isnullstartblock(new->br_startblock)); 2823 2824 /* 2825 * Check and set flags if this segment has a left neighbor 2826 */ 2827 if (*idx > 0) { 2828 state |= BMAP_LEFT_VALID; 2829 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &left); 2830 2831 if (isnullstartblock(left.br_startblock)) 2832 state |= BMAP_LEFT_DELAY; 2833 } 2834 2835 /* 2836 * Check and set flags if the current (right) segment exists. 2837 * If it doesn't exist, we're converting the hole at end-of-file. 2838 */ 2839 if (*idx < ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) { 2840 state |= BMAP_RIGHT_VALID; 2841 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx), &right); 2842 2843 if (isnullstartblock(right.br_startblock)) 2844 state |= BMAP_RIGHT_DELAY; 2845 } 2846 2847 /* 2848 * Set contiguity flags on the left and right neighbors. 2849 * Don't let extents get too large, even if the pieces are contiguous. 2850 */ 2851 if ((state & BMAP_LEFT_VALID) && (state & BMAP_LEFT_DELAY) && 2852 left.br_startoff + left.br_blockcount == new->br_startoff && 2853 left.br_blockcount + new->br_blockcount <= MAXEXTLEN) 2854 state |= BMAP_LEFT_CONTIG; 2855 2856 if ((state & BMAP_RIGHT_VALID) && (state & BMAP_RIGHT_DELAY) && 2857 new->br_startoff + new->br_blockcount == right.br_startoff && 2858 new->br_blockcount + right.br_blockcount <= MAXEXTLEN && 2859 (!(state & BMAP_LEFT_CONTIG) || 2860 (left.br_blockcount + new->br_blockcount + 2861 right.br_blockcount <= MAXEXTLEN))) 2862 state |= BMAP_RIGHT_CONTIG; 2863 2864 /* 2865 * Switch out based on the contiguity flags. 2866 */ 2867 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) { 2868 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: 2869 /* 2870 * New allocation is contiguous with delayed allocations 2871 * on the left and on the right. 2872 * Merge all three into a single extent record. 2873 */ 2874 --*idx; 2875 temp = left.br_blockcount + new->br_blockcount + 2876 right.br_blockcount; 2877 2878 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2879 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp); 2880 oldlen = startblockval(left.br_startblock) + 2881 startblockval(new->br_startblock) + 2882 startblockval(right.br_startblock); 2883 newlen = xfs_bmap_worst_indlen(ip, temp); 2884 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx), 2885 nullstartblock((int)newlen)); 2886 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2887 2888 xfs_iext_remove(ip, *idx + 1, 1, state); 2889 break; 2890 2891 case BMAP_LEFT_CONTIG: 2892 /* 2893 * New allocation is contiguous with a delayed allocation 2894 * on the left. 2895 * Merge the new allocation with the left neighbor. 2896 */ 2897 --*idx; 2898 temp = left.br_blockcount + new->br_blockcount; 2899 2900 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2901 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp); 2902 oldlen = startblockval(left.br_startblock) + 2903 startblockval(new->br_startblock); 2904 newlen = xfs_bmap_worst_indlen(ip, temp); 2905 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx), 2906 nullstartblock((int)newlen)); 2907 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2908 break; 2909 2910 case BMAP_RIGHT_CONTIG: 2911 /* 2912 * New allocation is contiguous with a delayed allocation 2913 * on the right. 2914 * Merge the new allocation with the right neighbor. 2915 */ 2916 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 2917 temp = new->br_blockcount + right.br_blockcount; 2918 oldlen = startblockval(new->br_startblock) + 2919 startblockval(right.br_startblock); 2920 newlen = xfs_bmap_worst_indlen(ip, temp); 2921 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx), 2922 new->br_startoff, 2923 nullstartblock((int)newlen), temp, right.br_state); 2924 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 2925 break; 2926 2927 case 0: 2928 /* 2929 * New allocation is not contiguous with another 2930 * delayed allocation. 2931 * Insert a new entry. 2932 */ 2933 oldlen = newlen = 0; 2934 xfs_iext_insert(ip, *idx, 1, new, state); 2935 break; 2936 } 2937 if (oldlen != newlen) { 2938 ASSERT(oldlen > newlen); 2939 xfs_mod_fdblocks(ip->i_mount, (int64_t)(oldlen - newlen), 2940 false); 2941 /* 2942 * Nothing to do for disk quota accounting here. 2943 */ 2944 } 2945 } 2946 2947 /* 2948 * Convert a hole to a real allocation. 2949 */ 2950 STATIC int /* error */ 2951 xfs_bmap_add_extent_hole_real( 2952 struct xfs_bmalloca *bma, 2953 int whichfork) 2954 { 2955 struct xfs_bmbt_irec *new = &bma->got; 2956 int error; /* error return value */ 2957 int i; /* temp state */ 2958 xfs_ifork_t *ifp; /* inode fork pointer */ 2959 xfs_bmbt_irec_t left; /* left neighbor extent entry */ 2960 xfs_bmbt_irec_t right; /* right neighbor extent entry */ 2961 int rval=0; /* return value (logging flags) */ 2962 int state; /* state bits, accessed thru macros */ 2963 struct xfs_mount *mp; 2964 2965 mp = bma->ip->i_mount; 2966 ifp = XFS_IFORK_PTR(bma->ip, whichfork); 2967 2968 ASSERT(bma->idx >= 0); 2969 ASSERT(bma->idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec)); 2970 ASSERT(!isnullstartblock(new->br_startblock)); 2971 ASSERT(!bma->cur || 2972 !(bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL)); 2973 ASSERT(whichfork != XFS_COW_FORK); 2974 2975 XFS_STATS_INC(mp, xs_add_exlist); 2976 2977 state = 0; 2978 if (whichfork == XFS_ATTR_FORK) 2979 state |= BMAP_ATTRFORK; 2980 2981 /* 2982 * Check and set flags if this segment has a left neighbor. 2983 */ 2984 if (bma->idx > 0) { 2985 state |= BMAP_LEFT_VALID; 2986 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &left); 2987 if (isnullstartblock(left.br_startblock)) 2988 state |= BMAP_LEFT_DELAY; 2989 } 2990 2991 /* 2992 * Check and set flags if this segment has a current value. 2993 * Not true if we're inserting into the "hole" at eof. 2994 */ 2995 if (bma->idx < ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) { 2996 state |= BMAP_RIGHT_VALID; 2997 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &right); 2998 if (isnullstartblock(right.br_startblock)) 2999 state |= BMAP_RIGHT_DELAY; 3000 } 3001 3002 /* 3003 * We're inserting a real allocation between "left" and "right". 3004 * Set the contiguity flags. Don't let extents get too large. 3005 */ 3006 if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) && 3007 left.br_startoff + left.br_blockcount == new->br_startoff && 3008 left.br_startblock + left.br_blockcount == new->br_startblock && 3009 left.br_state == new->br_state && 3010 left.br_blockcount + new->br_blockcount <= MAXEXTLEN) 3011 state |= BMAP_LEFT_CONTIG; 3012 3013 if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) && 3014 new->br_startoff + new->br_blockcount == right.br_startoff && 3015 new->br_startblock + new->br_blockcount == right.br_startblock && 3016 new->br_state == right.br_state && 3017 new->br_blockcount + right.br_blockcount <= MAXEXTLEN && 3018 (!(state & BMAP_LEFT_CONTIG) || 3019 left.br_blockcount + new->br_blockcount + 3020 right.br_blockcount <= MAXEXTLEN)) 3021 state |= BMAP_RIGHT_CONTIG; 3022 3023 error = 0; 3024 /* 3025 * Select which case we're in here, and implement it. 3026 */ 3027 switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) { 3028 case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: 3029 /* 3030 * New allocation is contiguous with real allocations on the 3031 * left and on the right. 3032 * Merge all three into a single extent record. 3033 */ 3034 --bma->idx; 3035 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 3036 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx), 3037 left.br_blockcount + new->br_blockcount + 3038 right.br_blockcount); 3039 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 3040 3041 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state); 3042 3043 XFS_IFORK_NEXT_SET(bma->ip, whichfork, 3044 XFS_IFORK_NEXTENTS(bma->ip, whichfork) - 1); 3045 if (bma->cur == NULL) { 3046 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork); 3047 } else { 3048 rval = XFS_ILOG_CORE; 3049 error = xfs_bmbt_lookup_eq(bma->cur, right.br_startoff, 3050 right.br_startblock, right.br_blockcount, 3051 &i); 3052 if (error) 3053 goto done; 3054 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 3055 error = xfs_btree_delete(bma->cur, &i); 3056 if (error) 3057 goto done; 3058 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 3059 error = xfs_btree_decrement(bma->cur, 0, &i); 3060 if (error) 3061 goto done; 3062 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 3063 error = xfs_bmbt_update(bma->cur, left.br_startoff, 3064 left.br_startblock, 3065 left.br_blockcount + 3066 new->br_blockcount + 3067 right.br_blockcount, 3068 left.br_state); 3069 if (error) 3070 goto done; 3071 } 3072 break; 3073 3074 case BMAP_LEFT_CONTIG: 3075 /* 3076 * New allocation is contiguous with a real allocation 3077 * on the left. 3078 * Merge the new allocation with the left neighbor. 3079 */ 3080 --bma->idx; 3081 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 3082 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx), 3083 left.br_blockcount + new->br_blockcount); 3084 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 3085 3086 if (bma->cur == NULL) { 3087 rval = xfs_ilog_fext(whichfork); 3088 } else { 3089 rval = 0; 3090 error = xfs_bmbt_lookup_eq(bma->cur, left.br_startoff, 3091 left.br_startblock, left.br_blockcount, 3092 &i); 3093 if (error) 3094 goto done; 3095 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 3096 error = xfs_bmbt_update(bma->cur, left.br_startoff, 3097 left.br_startblock, 3098 left.br_blockcount + 3099 new->br_blockcount, 3100 left.br_state); 3101 if (error) 3102 goto done; 3103 } 3104 break; 3105 3106 case BMAP_RIGHT_CONTIG: 3107 /* 3108 * New allocation is contiguous with a real allocation 3109 * on the right. 3110 * Merge the new allocation with the right neighbor. 3111 */ 3112 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); 3113 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx), 3114 new->br_startoff, new->br_startblock, 3115 new->br_blockcount + right.br_blockcount, 3116 right.br_state); 3117 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); 3118 3119 if (bma->cur == NULL) { 3120 rval = xfs_ilog_fext(whichfork); 3121 } else { 3122 rval = 0; 3123 error = xfs_bmbt_lookup_eq(bma->cur, 3124 right.br_startoff, 3125 right.br_startblock, 3126 right.br_blockcount, &i); 3127 if (error) 3128 goto done; 3129 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 3130 error = xfs_bmbt_update(bma->cur, new->br_startoff, 3131 new->br_startblock, 3132 new->br_blockcount + 3133 right.br_blockcount, 3134 right.br_state); 3135 if (error) 3136 goto done; 3137 } 3138 break; 3139 3140 case 0: 3141 /* 3142 * New allocation is not contiguous with another 3143 * real allocation. 3144 * Insert a new entry. 3145 */ 3146 xfs_iext_insert(bma->ip, bma->idx, 1, new, state); 3147 XFS_IFORK_NEXT_SET(bma->ip, whichfork, 3148 XFS_IFORK_NEXTENTS(bma->ip, whichfork) + 1); 3149 if (bma->cur == NULL) { 3150 rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork); 3151 } else { 3152 rval = XFS_ILOG_CORE; 3153 error = xfs_bmbt_lookup_eq(bma->cur, 3154 new->br_startoff, 3155 new->br_startblock, 3156 new->br_blockcount, &i); 3157 if (error) 3158 goto done; 3159 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, done); 3160 bma->cur->bc_rec.b.br_state = new->br_state; 3161 error = xfs_btree_insert(bma->cur, &i); 3162 if (error) 3163 goto done; 3164 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 3165 } 3166 break; 3167 } 3168 3169 /* add reverse mapping */ 3170 error = xfs_rmap_map_extent(mp, bma->dfops, bma->ip, whichfork, new); 3171 if (error) 3172 goto done; 3173 3174 /* convert to a btree if necessary */ 3175 if (xfs_bmap_needs_btree(bma->ip, whichfork)) { 3176 int tmp_logflags; /* partial log flag return val */ 3177 3178 ASSERT(bma->cur == NULL); 3179 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, 3180 bma->firstblock, bma->dfops, &bma->cur, 3181 0, &tmp_logflags, whichfork); 3182 bma->logflags |= tmp_logflags; 3183 if (error) 3184 goto done; 3185 } 3186 3187 /* clear out the allocated field, done with it now in any case. */ 3188 if (bma->cur) 3189 bma->cur->bc_private.b.allocated = 0; 3190 3191 xfs_bmap_check_leaf_extents(bma->cur, bma->ip, whichfork); 3192 done: 3193 bma->logflags |= rval; 3194 return error; 3195 } 3196 3197 /* 3198 * Functions used in the extent read, allocate and remove paths 3199 */ 3200 3201 /* 3202 * Adjust the size of the new extent based on di_extsize and rt extsize. 3203 */ 3204 int 3205 xfs_bmap_extsize_align( 3206 xfs_mount_t *mp, 3207 xfs_bmbt_irec_t *gotp, /* next extent pointer */ 3208 xfs_bmbt_irec_t *prevp, /* previous extent pointer */ 3209 xfs_extlen_t extsz, /* align to this extent size */ 3210 int rt, /* is this a realtime inode? */ 3211 int eof, /* is extent at end-of-file? */ 3212 int delay, /* creating delalloc extent? */ 3213 int convert, /* overwriting unwritten extent? */ 3214 xfs_fileoff_t *offp, /* in/out: aligned offset */ 3215 xfs_extlen_t *lenp) /* in/out: aligned length */ 3216 { 3217 xfs_fileoff_t orig_off; /* original offset */ 3218 xfs_extlen_t orig_alen; /* original length */ 3219 xfs_fileoff_t orig_end; /* original off+len */ 3220 xfs_fileoff_t nexto; /* next file offset */ 3221 xfs_fileoff_t prevo; /* previous file offset */ 3222 xfs_fileoff_t align_off; /* temp for offset */ 3223 xfs_extlen_t align_alen; /* temp for length */ 3224 xfs_extlen_t temp; /* temp for calculations */ 3225 3226 if (convert) 3227 return 0; 3228 3229 orig_off = align_off = *offp; 3230 orig_alen = align_alen = *lenp; 3231 orig_end = orig_off + orig_alen; 3232 3233 /* 3234 * If this request overlaps an existing extent, then don't 3235 * attempt to perform any additional alignment. 3236 */ 3237 if (!delay && !eof && 3238 (orig_off >= gotp->br_startoff) && 3239 (orig_end <= gotp->br_startoff + gotp->br_blockcount)) { 3240 return 0; 3241 } 3242 3243 /* 3244 * If the file offset is unaligned vs. the extent size 3245 * we need to align it. This will be possible unless 3246 * the file was previously written with a kernel that didn't 3247 * perform this alignment, or if a truncate shot us in the 3248 * foot. 3249 */ 3250 temp = do_mod(orig_off, extsz); 3251 if (temp) { 3252 align_alen += temp; 3253 align_off -= temp; 3254 } 3255 3256 /* Same adjustment for the end of the requested area. */ 3257 temp = (align_alen % extsz); 3258 if (temp) 3259 align_alen += extsz - temp; 3260 3261 /* 3262 * For large extent hint sizes, the aligned extent might be larger than 3263 * MAXEXTLEN. In that case, reduce the size by an extsz so that it pulls 3264 * the length back under MAXEXTLEN. The outer allocation loops handle 3265 * short allocation just fine, so it is safe to do this. We only want to 3266 * do it when we are forced to, though, because it means more allocation 3267 * operations are required. 3268 */ 3269 while (align_alen > MAXEXTLEN) 3270 align_alen -= extsz; 3271 ASSERT(align_alen <= MAXEXTLEN); 3272 3273 /* 3274 * If the previous block overlaps with this proposed allocation 3275 * then move the start forward without adjusting the length. 3276 */ 3277 if (prevp->br_startoff != NULLFILEOFF) { 3278 if (prevp->br_startblock == HOLESTARTBLOCK) 3279 prevo = prevp->br_startoff; 3280 else 3281 prevo = prevp->br_startoff + prevp->br_blockcount; 3282 } else 3283 prevo = 0; 3284 if (align_off != orig_off && align_off < prevo) 3285 align_off = prevo; 3286 /* 3287 * If the next block overlaps with this proposed allocation 3288 * then move the start back without adjusting the length, 3289 * but not before offset 0. 3290 * This may of course make the start overlap previous block, 3291 * and if we hit the offset 0 limit then the next block 3292 * can still overlap too. 3293 */ 3294 if (!eof && gotp->br_startoff != NULLFILEOFF) { 3295 if ((delay && gotp->br_startblock == HOLESTARTBLOCK) || 3296 (!delay && gotp->br_startblock == DELAYSTARTBLOCK)) 3297 nexto = gotp->br_startoff + gotp->br_blockcount; 3298 else 3299 nexto = gotp->br_startoff; 3300 } else 3301 nexto = NULLFILEOFF; 3302 if (!eof && 3303 align_off + align_alen != orig_end && 3304 align_off + align_alen > nexto) 3305 align_off = nexto > align_alen ? nexto - align_alen : 0; 3306 /* 3307 * If we're now overlapping the next or previous extent that 3308 * means we can't fit an extsz piece in this hole. Just move 3309 * the start forward to the first valid spot and set 3310 * the length so we hit the end. 3311 */ 3312 if (align_off != orig_off && align_off < prevo) 3313 align_off = prevo; 3314 if (align_off + align_alen != orig_end && 3315 align_off + align_alen > nexto && 3316 nexto != NULLFILEOFF) { 3317 ASSERT(nexto > prevo); 3318 align_alen = nexto - align_off; 3319 } 3320 3321 /* 3322 * If realtime, and the result isn't a multiple of the realtime 3323 * extent size we need to remove blocks until it is. 3324 */ 3325 if (rt && (temp = (align_alen % mp->m_sb.sb_rextsize))) { 3326 /* 3327 * We're not covering the original request, or 3328 * we won't be able to once we fix the length. 3329 */ 3330 if (orig_off < align_off || 3331 orig_end > align_off + align_alen || 3332 align_alen - temp < orig_alen) 3333 return -EINVAL; 3334 /* 3335 * Try to fix it by moving the start up. 3336 */ 3337 if (align_off + temp <= orig_off) { 3338 align_alen -= temp; 3339 align_off += temp; 3340 } 3341 /* 3342 * Try to fix it by moving the end in. 3343 */ 3344 else if (align_off + align_alen - temp >= orig_end) 3345 align_alen -= temp; 3346 /* 3347 * Set the start to the minimum then trim the length. 3348 */ 3349 else { 3350 align_alen -= orig_off - align_off; 3351 align_off = orig_off; 3352 align_alen -= align_alen % mp->m_sb.sb_rextsize; 3353 } 3354 /* 3355 * Result doesn't cover the request, fail it. 3356 */ 3357 if (orig_off < align_off || orig_end > align_off + align_alen) 3358 return -EINVAL; 3359 } else { 3360 ASSERT(orig_off >= align_off); 3361 /* see MAXEXTLEN handling above */ 3362 ASSERT(orig_end <= align_off + align_alen || 3363 align_alen + extsz > MAXEXTLEN); 3364 } 3365 3366 #ifdef DEBUG 3367 if (!eof && gotp->br_startoff != NULLFILEOFF) 3368 ASSERT(align_off + align_alen <= gotp->br_startoff); 3369 if (prevp->br_startoff != NULLFILEOFF) 3370 ASSERT(align_off >= prevp->br_startoff + prevp->br_blockcount); 3371 #endif 3372 3373 *lenp = align_alen; 3374 *offp = align_off; 3375 return 0; 3376 } 3377 3378 #define XFS_ALLOC_GAP_UNITS 4 3379 3380 void 3381 xfs_bmap_adjacent( 3382 struct xfs_bmalloca *ap) /* bmap alloc argument struct */ 3383 { 3384 xfs_fsblock_t adjust; /* adjustment to block numbers */ 3385 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */ 3386 xfs_mount_t *mp; /* mount point structure */ 3387 int nullfb; /* true if ap->firstblock isn't set */ 3388 int rt; /* true if inode is realtime */ 3389 3390 #define ISVALID(x,y) \ 3391 (rt ? \ 3392 (x) < mp->m_sb.sb_rblocks : \ 3393 XFS_FSB_TO_AGNO(mp, x) == XFS_FSB_TO_AGNO(mp, y) && \ 3394 XFS_FSB_TO_AGNO(mp, x) < mp->m_sb.sb_agcount && \ 3395 XFS_FSB_TO_AGBNO(mp, x) < mp->m_sb.sb_agblocks) 3396 3397 mp = ap->ip->i_mount; 3398 nullfb = *ap->firstblock == NULLFSBLOCK; 3399 rt = XFS_IS_REALTIME_INODE(ap->ip) && 3400 xfs_alloc_is_userdata(ap->datatype); 3401 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock); 3402 /* 3403 * If allocating at eof, and there's a previous real block, 3404 * try to use its last block as our starting point. 3405 */ 3406 if (ap->eof && ap->prev.br_startoff != NULLFILEOFF && 3407 !isnullstartblock(ap->prev.br_startblock) && 3408 ISVALID(ap->prev.br_startblock + ap->prev.br_blockcount, 3409 ap->prev.br_startblock)) { 3410 ap->blkno = ap->prev.br_startblock + ap->prev.br_blockcount; 3411 /* 3412 * Adjust for the gap between prevp and us. 3413 */ 3414 adjust = ap->offset - 3415 (ap->prev.br_startoff + ap->prev.br_blockcount); 3416 if (adjust && 3417 ISVALID(ap->blkno + adjust, ap->prev.br_startblock)) 3418 ap->blkno += adjust; 3419 } 3420 /* 3421 * If not at eof, then compare the two neighbor blocks. 3422 * Figure out whether either one gives us a good starting point, 3423 * and pick the better one. 3424 */ 3425 else if (!ap->eof) { 3426 xfs_fsblock_t gotbno; /* right side block number */ 3427 xfs_fsblock_t gotdiff=0; /* right side difference */ 3428 xfs_fsblock_t prevbno; /* left side block number */ 3429 xfs_fsblock_t prevdiff=0; /* left side difference */ 3430 3431 /* 3432 * If there's a previous (left) block, select a requested 3433 * start block based on it. 3434 */ 3435 if (ap->prev.br_startoff != NULLFILEOFF && 3436 !isnullstartblock(ap->prev.br_startblock) && 3437 (prevbno = ap->prev.br_startblock + 3438 ap->prev.br_blockcount) && 3439 ISVALID(prevbno, ap->prev.br_startblock)) { 3440 /* 3441 * Calculate gap to end of previous block. 3442 */ 3443 adjust = prevdiff = ap->offset - 3444 (ap->prev.br_startoff + 3445 ap->prev.br_blockcount); 3446 /* 3447 * Figure the startblock based on the previous block's 3448 * end and the gap size. 3449 * Heuristic! 3450 * If the gap is large relative to the piece we're 3451 * allocating, or using it gives us an invalid block 3452 * number, then just use the end of the previous block. 3453 */ 3454 if (prevdiff <= XFS_ALLOC_GAP_UNITS * ap->length && 3455 ISVALID(prevbno + prevdiff, 3456 ap->prev.br_startblock)) 3457 prevbno += adjust; 3458 else 3459 prevdiff += adjust; 3460 /* 3461 * If the firstblock forbids it, can't use it, 3462 * must use default. 3463 */ 3464 if (!rt && !nullfb && 3465 XFS_FSB_TO_AGNO(mp, prevbno) != fb_agno) 3466 prevbno = NULLFSBLOCK; 3467 } 3468 /* 3469 * No previous block or can't follow it, just default. 3470 */ 3471 else 3472 prevbno = NULLFSBLOCK; 3473 /* 3474 * If there's a following (right) block, select a requested 3475 * start block based on it. 3476 */ 3477 if (!isnullstartblock(ap->got.br_startblock)) { 3478 /* 3479 * Calculate gap to start of next block. 3480 */ 3481 adjust = gotdiff = ap->got.br_startoff - ap->offset; 3482 /* 3483 * Figure the startblock based on the next block's 3484 * start and the gap size. 3485 */ 3486 gotbno = ap->got.br_startblock; 3487 /* 3488 * Heuristic! 3489 * If the gap is large relative to the piece we're 3490 * allocating, or using it gives us an invalid block 3491 * number, then just use the start of the next block 3492 * offset by our length. 3493 */ 3494 if (gotdiff <= XFS_ALLOC_GAP_UNITS * ap->length && 3495 ISVALID(gotbno - gotdiff, gotbno)) 3496 gotbno -= adjust; 3497 else if (ISVALID(gotbno - ap->length, gotbno)) { 3498 gotbno -= ap->length; 3499 gotdiff += adjust - ap->length; 3500 } else 3501 gotdiff += adjust; 3502 /* 3503 * If the firstblock forbids it, can't use it, 3504 * must use default. 3505 */ 3506 if (!rt && !nullfb && 3507 XFS_FSB_TO_AGNO(mp, gotbno) != fb_agno) 3508 gotbno = NULLFSBLOCK; 3509 } 3510 /* 3511 * No next block, just default. 3512 */ 3513 else 3514 gotbno = NULLFSBLOCK; 3515 /* 3516 * If both valid, pick the better one, else the only good 3517 * one, else ap->blkno is already set (to 0 or the inode block). 3518 */ 3519 if (prevbno != NULLFSBLOCK && gotbno != NULLFSBLOCK) 3520 ap->blkno = prevdiff <= gotdiff ? prevbno : gotbno; 3521 else if (prevbno != NULLFSBLOCK) 3522 ap->blkno = prevbno; 3523 else if (gotbno != NULLFSBLOCK) 3524 ap->blkno = gotbno; 3525 } 3526 #undef ISVALID 3527 } 3528 3529 static int 3530 xfs_bmap_longest_free_extent( 3531 struct xfs_trans *tp, 3532 xfs_agnumber_t ag, 3533 xfs_extlen_t *blen, 3534 int *notinit) 3535 { 3536 struct xfs_mount *mp = tp->t_mountp; 3537 struct xfs_perag *pag; 3538 xfs_extlen_t longest; 3539 int error = 0; 3540 3541 pag = xfs_perag_get(mp, ag); 3542 if (!pag->pagf_init) { 3543 error = xfs_alloc_pagf_init(mp, tp, ag, XFS_ALLOC_FLAG_TRYLOCK); 3544 if (error) 3545 goto out; 3546 3547 if (!pag->pagf_init) { 3548 *notinit = 1; 3549 goto out; 3550 } 3551 } 3552 3553 longest = xfs_alloc_longest_free_extent(mp, pag, 3554 xfs_alloc_min_freelist(mp, pag), 3555 xfs_ag_resv_needed(pag, XFS_AG_RESV_NONE)); 3556 if (*blen < longest) 3557 *blen = longest; 3558 3559 out: 3560 xfs_perag_put(pag); 3561 return error; 3562 } 3563 3564 static void 3565 xfs_bmap_select_minlen( 3566 struct xfs_bmalloca *ap, 3567 struct xfs_alloc_arg *args, 3568 xfs_extlen_t *blen, 3569 int notinit) 3570 { 3571 if (notinit || *blen < ap->minlen) { 3572 /* 3573 * Since we did a BUF_TRYLOCK above, it is possible that 3574 * there is space for this request. 3575 */ 3576 args->minlen = ap->minlen; 3577 } else if (*blen < args->maxlen) { 3578 /* 3579 * If the best seen length is less than the request length, 3580 * use the best as the minimum. 3581 */ 3582 args->minlen = *blen; 3583 } else { 3584 /* 3585 * Otherwise we've seen an extent as big as maxlen, use that 3586 * as the minimum. 3587 */ 3588 args->minlen = args->maxlen; 3589 } 3590 } 3591 3592 STATIC int 3593 xfs_bmap_btalloc_nullfb( 3594 struct xfs_bmalloca *ap, 3595 struct xfs_alloc_arg *args, 3596 xfs_extlen_t *blen) 3597 { 3598 struct xfs_mount *mp = ap->ip->i_mount; 3599 xfs_agnumber_t ag, startag; 3600 int notinit = 0; 3601 int error; 3602 3603 args->type = XFS_ALLOCTYPE_START_BNO; 3604 args->total = ap->total; 3605 3606 startag = ag = XFS_FSB_TO_AGNO(mp, args->fsbno); 3607 if (startag == NULLAGNUMBER) 3608 startag = ag = 0; 3609 3610 while (*blen < args->maxlen) { 3611 error = xfs_bmap_longest_free_extent(args->tp, ag, blen, 3612 ¬init); 3613 if (error) 3614 return error; 3615 3616 if (++ag == mp->m_sb.sb_agcount) 3617 ag = 0; 3618 if (ag == startag) 3619 break; 3620 } 3621 3622 xfs_bmap_select_minlen(ap, args, blen, notinit); 3623 return 0; 3624 } 3625 3626 STATIC int 3627 xfs_bmap_btalloc_filestreams( 3628 struct xfs_bmalloca *ap, 3629 struct xfs_alloc_arg *args, 3630 xfs_extlen_t *blen) 3631 { 3632 struct xfs_mount *mp = ap->ip->i_mount; 3633 xfs_agnumber_t ag; 3634 int notinit = 0; 3635 int error; 3636 3637 args->type = XFS_ALLOCTYPE_NEAR_BNO; 3638 args->total = ap->total; 3639 3640 ag = XFS_FSB_TO_AGNO(mp, args->fsbno); 3641 if (ag == NULLAGNUMBER) 3642 ag = 0; 3643 3644 error = xfs_bmap_longest_free_extent(args->tp, ag, blen, ¬init); 3645 if (error) 3646 return error; 3647 3648 if (*blen < args->maxlen) { 3649 error = xfs_filestream_new_ag(ap, &ag); 3650 if (error) 3651 return error; 3652 3653 error = xfs_bmap_longest_free_extent(args->tp, ag, blen, 3654 ¬init); 3655 if (error) 3656 return error; 3657 3658 } 3659 3660 xfs_bmap_select_minlen(ap, args, blen, notinit); 3661 3662 /* 3663 * Set the failure fallback case to look in the selected AG as stream 3664 * may have moved. 3665 */ 3666 ap->blkno = args->fsbno = XFS_AGB_TO_FSB(mp, ag, 0); 3667 return 0; 3668 } 3669 3670 STATIC int 3671 xfs_bmap_btalloc( 3672 struct xfs_bmalloca *ap) /* bmap alloc argument struct */ 3673 { 3674 xfs_mount_t *mp; /* mount point structure */ 3675 xfs_alloctype_t atype = 0; /* type for allocation routines */ 3676 xfs_extlen_t align = 0; /* minimum allocation alignment */ 3677 xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */ 3678 xfs_agnumber_t ag; 3679 xfs_alloc_arg_t args; 3680 xfs_extlen_t blen; 3681 xfs_extlen_t nextminlen = 0; 3682 int nullfb; /* true if ap->firstblock isn't set */ 3683 int isaligned; 3684 int tryagain; 3685 int error; 3686 int stripe_align; 3687 3688 ASSERT(ap->length); 3689 3690 mp = ap->ip->i_mount; 3691 3692 /* stripe alignment for allocation is determined by mount parameters */ 3693 stripe_align = 0; 3694 if (mp->m_swidth && (mp->m_flags & XFS_MOUNT_SWALLOC)) 3695 stripe_align = mp->m_swidth; 3696 else if (mp->m_dalign) 3697 stripe_align = mp->m_dalign; 3698 3699 if (ap->flags & XFS_BMAPI_COWFORK) 3700 align = xfs_get_cowextsz_hint(ap->ip); 3701 else if (xfs_alloc_is_userdata(ap->datatype)) 3702 align = xfs_get_extsz_hint(ap->ip); 3703 if (unlikely(align)) { 3704 error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev, 3705 align, 0, ap->eof, 0, ap->conv, 3706 &ap->offset, &ap->length); 3707 ASSERT(!error); 3708 ASSERT(ap->length); 3709 } 3710 3711 3712 nullfb = *ap->firstblock == NULLFSBLOCK; 3713 fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock); 3714 if (nullfb) { 3715 if (xfs_alloc_is_userdata(ap->datatype) && 3716 xfs_inode_is_filestream(ap->ip)) { 3717 ag = xfs_filestream_lookup_ag(ap->ip); 3718 ag = (ag != NULLAGNUMBER) ? ag : 0; 3719 ap->blkno = XFS_AGB_TO_FSB(mp, ag, 0); 3720 } else { 3721 ap->blkno = XFS_INO_TO_FSB(mp, ap->ip->i_ino); 3722 } 3723 } else 3724 ap->blkno = *ap->firstblock; 3725 3726 xfs_bmap_adjacent(ap); 3727 3728 /* 3729 * If allowed, use ap->blkno; otherwise must use firstblock since 3730 * it's in the right allocation group. 3731 */ 3732 if (nullfb || XFS_FSB_TO_AGNO(mp, ap->blkno) == fb_agno) 3733 ; 3734 else 3735 ap->blkno = *ap->firstblock; 3736 /* 3737 * Normal allocation, done through xfs_alloc_vextent. 3738 */ 3739 tryagain = isaligned = 0; 3740 memset(&args, 0, sizeof(args)); 3741 args.tp = ap->tp; 3742 args.mp = mp; 3743 args.fsbno = ap->blkno; 3744 xfs_rmap_skip_owner_update(&args.oinfo); 3745 3746 /* Trim the allocation back to the maximum an AG can fit. */ 3747 args.maxlen = MIN(ap->length, mp->m_ag_max_usable); 3748 args.firstblock = *ap->firstblock; 3749 blen = 0; 3750 if (nullfb) { 3751 /* 3752 * Search for an allocation group with a single extent large 3753 * enough for the request. If one isn't found, then adjust 3754 * the minimum allocation size to the largest space found. 3755 */ 3756 if (xfs_alloc_is_userdata(ap->datatype) && 3757 xfs_inode_is_filestream(ap->ip)) 3758 error = xfs_bmap_btalloc_filestreams(ap, &args, &blen); 3759 else 3760 error = xfs_bmap_btalloc_nullfb(ap, &args, &blen); 3761 if (error) 3762 return error; 3763 } else if (ap->dfops->dop_low) { 3764 if (xfs_inode_is_filestream(ap->ip)) 3765 args.type = XFS_ALLOCTYPE_FIRST_AG; 3766 else 3767 args.type = XFS_ALLOCTYPE_START_BNO; 3768 args.total = args.minlen = ap->minlen; 3769 } else { 3770 args.type = XFS_ALLOCTYPE_NEAR_BNO; 3771 args.total = ap->total; 3772 args.minlen = ap->minlen; 3773 } 3774 /* apply extent size hints if obtained earlier */ 3775 if (unlikely(align)) { 3776 args.prod = align; 3777 if ((args.mod = (xfs_extlen_t)do_mod(ap->offset, args.prod))) 3778 args.mod = (xfs_extlen_t)(args.prod - args.mod); 3779 } else if (mp->m_sb.sb_blocksize >= PAGE_SIZE) { 3780 args.prod = 1; 3781 args.mod = 0; 3782 } else { 3783 args.prod = PAGE_SIZE >> mp->m_sb.sb_blocklog; 3784 if ((args.mod = (xfs_extlen_t)(do_mod(ap->offset, args.prod)))) 3785 args.mod = (xfs_extlen_t)(args.prod - args.mod); 3786 } 3787 /* 3788 * If we are not low on available data blocks, and the 3789 * underlying logical volume manager is a stripe, and 3790 * the file offset is zero then try to allocate data 3791 * blocks on stripe unit boundary. 3792 * NOTE: ap->aeof is only set if the allocation length 3793 * is >= the stripe unit and the allocation offset is 3794 * at the end of file. 3795 */ 3796 if (!ap->dfops->dop_low && ap->aeof) { 3797 if (!ap->offset) { 3798 args.alignment = stripe_align; 3799 atype = args.type; 3800 isaligned = 1; 3801 /* 3802 * Adjust for alignment 3803 */ 3804 if (blen > args.alignment && blen <= args.maxlen) 3805 args.minlen = blen - args.alignment; 3806 args.minalignslop = 0; 3807 } else { 3808 /* 3809 * First try an exact bno allocation. 3810 * If it fails then do a near or start bno 3811 * allocation with alignment turned on. 3812 */ 3813 atype = args.type; 3814 tryagain = 1; 3815 args.type = XFS_ALLOCTYPE_THIS_BNO; 3816 args.alignment = 1; 3817 /* 3818 * Compute the minlen+alignment for the 3819 * next case. Set slop so that the value 3820 * of minlen+alignment+slop doesn't go up 3821 * between the calls. 3822 */ 3823 if (blen > stripe_align && blen <= args.maxlen) 3824 nextminlen = blen - stripe_align; 3825 else 3826 nextminlen = args.minlen; 3827 if (nextminlen + stripe_align > args.minlen + 1) 3828 args.minalignslop = 3829 nextminlen + stripe_align - 3830 args.minlen - 1; 3831 else 3832 args.minalignslop = 0; 3833 } 3834 } else { 3835 args.alignment = 1; 3836 args.minalignslop = 0; 3837 } 3838 args.minleft = ap->minleft; 3839 args.wasdel = ap->wasdel; 3840 args.resv = XFS_AG_RESV_NONE; 3841 args.datatype = ap->datatype; 3842 if (ap->datatype & XFS_ALLOC_USERDATA_ZERO) 3843 args.ip = ap->ip; 3844 3845 error = xfs_alloc_vextent(&args); 3846 if (error) 3847 return error; 3848 3849 if (tryagain && args.fsbno == NULLFSBLOCK) { 3850 /* 3851 * Exact allocation failed. Now try with alignment 3852 * turned on. 3853 */ 3854 args.type = atype; 3855 args.fsbno = ap->blkno; 3856 args.alignment = stripe_align; 3857 args.minlen = nextminlen; 3858 args.minalignslop = 0; 3859 isaligned = 1; 3860 if ((error = xfs_alloc_vextent(&args))) 3861 return error; 3862 } 3863 if (isaligned && args.fsbno == NULLFSBLOCK) { 3864 /* 3865 * allocation failed, so turn off alignment and 3866 * try again. 3867 */ 3868 args.type = atype; 3869 args.fsbno = ap->blkno; 3870 args.alignment = 0; 3871 if ((error = xfs_alloc_vextent(&args))) 3872 return error; 3873 } 3874 if (args.fsbno == NULLFSBLOCK && nullfb && 3875 args.minlen > ap->minlen) { 3876 args.minlen = ap->minlen; 3877 args.type = XFS_ALLOCTYPE_START_BNO; 3878 args.fsbno = ap->blkno; 3879 if ((error = xfs_alloc_vextent(&args))) 3880 return error; 3881 } 3882 if (args.fsbno == NULLFSBLOCK && nullfb) { 3883 args.fsbno = 0; 3884 args.type = XFS_ALLOCTYPE_FIRST_AG; 3885 args.total = ap->minlen; 3886 args.minleft = 0; 3887 if ((error = xfs_alloc_vextent(&args))) 3888 return error; 3889 ap->dfops->dop_low = true; 3890 } 3891 if (args.fsbno != NULLFSBLOCK) { 3892 /* 3893 * check the allocation happened at the same or higher AG than 3894 * the first block that was allocated. 3895 */ 3896 ASSERT(*ap->firstblock == NULLFSBLOCK || 3897 XFS_FSB_TO_AGNO(mp, *ap->firstblock) == 3898 XFS_FSB_TO_AGNO(mp, args.fsbno) || 3899 (ap->dfops->dop_low && 3900 XFS_FSB_TO_AGNO(mp, *ap->firstblock) < 3901 XFS_FSB_TO_AGNO(mp, args.fsbno))); 3902 3903 ap->blkno = args.fsbno; 3904 if (*ap->firstblock == NULLFSBLOCK) 3905 *ap->firstblock = args.fsbno; 3906 ASSERT(nullfb || fb_agno == args.agno || 3907 (ap->dfops->dop_low && fb_agno < args.agno)); 3908 ap->length = args.len; 3909 if (!(ap->flags & XFS_BMAPI_COWFORK)) 3910 ap->ip->i_d.di_nblocks += args.len; 3911 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE); 3912 if (ap->wasdel) 3913 ap->ip->i_delayed_blks -= args.len; 3914 /* 3915 * Adjust the disk quota also. This was reserved 3916 * earlier. 3917 */ 3918 xfs_trans_mod_dquot_byino(ap->tp, ap->ip, 3919 ap->wasdel ? XFS_TRANS_DQ_DELBCOUNT : 3920 XFS_TRANS_DQ_BCOUNT, 3921 (long) args.len); 3922 } else { 3923 ap->blkno = NULLFSBLOCK; 3924 ap->length = 0; 3925 } 3926 return 0; 3927 } 3928 3929 /* 3930 * For a remap operation, just "allocate" an extent at the address that the 3931 * caller passed in, and ensure that the AGFL is the right size. The caller 3932 * will then map the "allocated" extent into the file somewhere. 3933 */ 3934 STATIC int 3935 xfs_bmap_remap_alloc( 3936 struct xfs_bmalloca *ap) 3937 { 3938 struct xfs_trans *tp = ap->tp; 3939 struct xfs_mount *mp = tp->t_mountp; 3940 xfs_agblock_t bno; 3941 struct xfs_alloc_arg args; 3942 int error; 3943 3944 /* 3945 * validate that the block number is legal - the enables us to detect 3946 * and handle a silent filesystem corruption rather than crashing. 3947 */ 3948 memset(&args, 0, sizeof(struct xfs_alloc_arg)); 3949 args.tp = ap->tp; 3950 args.mp = ap->tp->t_mountp; 3951 bno = *ap->firstblock; 3952 args.agno = XFS_FSB_TO_AGNO(mp, bno); 3953 args.agbno = XFS_FSB_TO_AGBNO(mp, bno); 3954 if (args.agno >= mp->m_sb.sb_agcount || 3955 args.agbno >= mp->m_sb.sb_agblocks) 3956 return -EFSCORRUPTED; 3957 3958 /* "Allocate" the extent from the range we passed in. */ 3959 trace_xfs_bmap_remap_alloc(ap->ip, *ap->firstblock, ap->length); 3960 ap->blkno = bno; 3961 ap->ip->i_d.di_nblocks += ap->length; 3962 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE); 3963 3964 /* Fix the freelist, like a real allocator does. */ 3965 args.datatype = ap->datatype; 3966 args.pag = xfs_perag_get(args.mp, args.agno); 3967 ASSERT(args.pag); 3968 3969 /* 3970 * The freelist fixing code will decline the allocation if 3971 * the size and shape of the free space doesn't allow for 3972 * allocating the extent and updating all the metadata that 3973 * happens during an allocation. We're remapping, not 3974 * allocating, so skip that check by pretending to be freeing. 3975 */ 3976 error = xfs_alloc_fix_freelist(&args, XFS_ALLOC_FLAG_FREEING); 3977 if (error) 3978 goto error0; 3979 error0: 3980 xfs_perag_put(args.pag); 3981 if (error) 3982 trace_xfs_bmap_remap_alloc_error(ap->ip, error, _RET_IP_); 3983 return error; 3984 } 3985 3986 /* 3987 * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file. 3988 * It figures out where to ask the underlying allocator to put the new extent. 3989 */ 3990 STATIC int 3991 xfs_bmap_alloc( 3992 struct xfs_bmalloca *ap) /* bmap alloc argument struct */ 3993 { 3994 if (ap->flags & XFS_BMAPI_REMAP) 3995 return xfs_bmap_remap_alloc(ap); 3996 if (XFS_IS_REALTIME_INODE(ap->ip) && 3997 xfs_alloc_is_userdata(ap->datatype)) 3998 return xfs_bmap_rtalloc(ap); 3999 return xfs_bmap_btalloc(ap); 4000 } 4001 4002 /* 4003 * Trim the returned map to the required bounds 4004 */ 4005 STATIC void 4006 xfs_bmapi_trim_map( 4007 struct xfs_bmbt_irec *mval, 4008 struct xfs_bmbt_irec *got, 4009 xfs_fileoff_t *bno, 4010 xfs_filblks_t len, 4011 xfs_fileoff_t obno, 4012 xfs_fileoff_t end, 4013 int n, 4014 int flags) 4015 { 4016 if ((flags & XFS_BMAPI_ENTIRE) || 4017 got->br_startoff + got->br_blockcount <= obno) { 4018 *mval = *got; 4019 if (isnullstartblock(got->br_startblock)) 4020 mval->br_startblock = DELAYSTARTBLOCK; 4021 return; 4022 } 4023 4024 if (obno > *bno) 4025 *bno = obno; 4026 ASSERT((*bno >= obno) || (n == 0)); 4027 ASSERT(*bno < end); 4028 mval->br_startoff = *bno; 4029 if (isnullstartblock(got->br_startblock)) 4030 mval->br_startblock = DELAYSTARTBLOCK; 4031 else 4032 mval->br_startblock = got->br_startblock + 4033 (*bno - got->br_startoff); 4034 /* 4035 * Return the minimum of what we got and what we asked for for 4036 * the length. We can use the len variable here because it is 4037 * modified below and we could have been there before coming 4038 * here if the first part of the allocation didn't overlap what 4039 * was asked for. 4040 */ 4041 mval->br_blockcount = XFS_FILBLKS_MIN(end - *bno, 4042 got->br_blockcount - (*bno - got->br_startoff)); 4043 mval->br_state = got->br_state; 4044 ASSERT(mval->br_blockcount <= len); 4045 return; 4046 } 4047 4048 /* 4049 * Update and validate the extent map to return 4050 */ 4051 STATIC void 4052 xfs_bmapi_update_map( 4053 struct xfs_bmbt_irec **map, 4054 xfs_fileoff_t *bno, 4055 xfs_filblks_t *len, 4056 xfs_fileoff_t obno, 4057 xfs_fileoff_t end, 4058 int *n, 4059 int flags) 4060 { 4061 xfs_bmbt_irec_t *mval = *map; 4062 4063 ASSERT((flags & XFS_BMAPI_ENTIRE) || 4064 ((mval->br_startoff + mval->br_blockcount) <= end)); 4065 ASSERT((flags & XFS_BMAPI_ENTIRE) || (mval->br_blockcount <= *len) || 4066 (mval->br_startoff < obno)); 4067 4068 *bno = mval->br_startoff + mval->br_blockcount; 4069 *len = end - *bno; 4070 if (*n > 0 && mval->br_startoff == mval[-1].br_startoff) { 4071 /* update previous map with new information */ 4072 ASSERT(mval->br_startblock == mval[-1].br_startblock); 4073 ASSERT(mval->br_blockcount > mval[-1].br_blockcount); 4074 ASSERT(mval->br_state == mval[-1].br_state); 4075 mval[-1].br_blockcount = mval->br_blockcount; 4076 mval[-1].br_state = mval->br_state; 4077 } else if (*n > 0 && mval->br_startblock != DELAYSTARTBLOCK && 4078 mval[-1].br_startblock != DELAYSTARTBLOCK && 4079 mval[-1].br_startblock != HOLESTARTBLOCK && 4080 mval->br_startblock == mval[-1].br_startblock + 4081 mval[-1].br_blockcount && 4082 ((flags & XFS_BMAPI_IGSTATE) || 4083 mval[-1].br_state == mval->br_state)) { 4084 ASSERT(mval->br_startoff == 4085 mval[-1].br_startoff + mval[-1].br_blockcount); 4086 mval[-1].br_blockcount += mval->br_blockcount; 4087 } else if (*n > 0 && 4088 mval->br_startblock == DELAYSTARTBLOCK && 4089 mval[-1].br_startblock == DELAYSTARTBLOCK && 4090 mval->br_startoff == 4091 mval[-1].br_startoff + mval[-1].br_blockcount) { 4092 mval[-1].br_blockcount += mval->br_blockcount; 4093 mval[-1].br_state = mval->br_state; 4094 } else if (!((*n == 0) && 4095 ((mval->br_startoff + mval->br_blockcount) <= 4096 obno))) { 4097 mval++; 4098 (*n)++; 4099 } 4100 *map = mval; 4101 } 4102 4103 /* 4104 * Map file blocks to filesystem blocks without allocation. 4105 */ 4106 int 4107 xfs_bmapi_read( 4108 struct xfs_inode *ip, 4109 xfs_fileoff_t bno, 4110 xfs_filblks_t len, 4111 struct xfs_bmbt_irec *mval, 4112 int *nmap, 4113 int flags) 4114 { 4115 struct xfs_mount *mp = ip->i_mount; 4116 struct xfs_ifork *ifp; 4117 struct xfs_bmbt_irec got; 4118 struct xfs_bmbt_irec prev; 4119 xfs_fileoff_t obno; 4120 xfs_fileoff_t end; 4121 xfs_extnum_t lastx; 4122 int error; 4123 int eof; 4124 int n = 0; 4125 int whichfork = xfs_bmapi_whichfork(flags); 4126 4127 ASSERT(*nmap >= 1); 4128 ASSERT(!(flags & ~(XFS_BMAPI_ATTRFORK|XFS_BMAPI_ENTIRE| 4129 XFS_BMAPI_IGSTATE|XFS_BMAPI_COWFORK))); 4130 ASSERT(xfs_isilocked(ip, XFS_ILOCK_SHARED|XFS_ILOCK_EXCL)); 4131 4132 if (unlikely(XFS_TEST_ERROR( 4133 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && 4134 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE), 4135 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) { 4136 XFS_ERROR_REPORT("xfs_bmapi_read", XFS_ERRLEVEL_LOW, mp); 4137 return -EFSCORRUPTED; 4138 } 4139 4140 if (XFS_FORCED_SHUTDOWN(mp)) 4141 return -EIO; 4142 4143 XFS_STATS_INC(mp, xs_blk_mapr); 4144 4145 ifp = XFS_IFORK_PTR(ip, whichfork); 4146 4147 /* No CoW fork? Return a hole. */ 4148 if (whichfork == XFS_COW_FORK && !ifp) { 4149 mval->br_startoff = bno; 4150 mval->br_startblock = HOLESTARTBLOCK; 4151 mval->br_blockcount = len; 4152 mval->br_state = XFS_EXT_NORM; 4153 *nmap = 1; 4154 return 0; 4155 } 4156 4157 if (!(ifp->if_flags & XFS_IFEXTENTS)) { 4158 error = xfs_iread_extents(NULL, ip, whichfork); 4159 if (error) 4160 return error; 4161 } 4162 4163 xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got, &prev); 4164 end = bno + len; 4165 obno = bno; 4166 4167 while (bno < end && n < *nmap) { 4168 /* Reading past eof, act as though there's a hole up to end. */ 4169 if (eof) 4170 got.br_startoff = end; 4171 if (got.br_startoff > bno) { 4172 /* Reading in a hole. */ 4173 mval->br_startoff = bno; 4174 mval->br_startblock = HOLESTARTBLOCK; 4175 mval->br_blockcount = 4176 XFS_FILBLKS_MIN(len, got.br_startoff - bno); 4177 mval->br_state = XFS_EXT_NORM; 4178 bno += mval->br_blockcount; 4179 len -= mval->br_blockcount; 4180 mval++; 4181 n++; 4182 continue; 4183 } 4184 4185 /* set up the extent map to return. */ 4186 xfs_bmapi_trim_map(mval, &got, &bno, len, obno, end, n, flags); 4187 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags); 4188 4189 /* If we're done, stop now. */ 4190 if (bno >= end || n >= *nmap) 4191 break; 4192 4193 /* Else go on to the next record. */ 4194 if (++lastx < ifp->if_bytes / sizeof(xfs_bmbt_rec_t)) 4195 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx), &got); 4196 else 4197 eof = 1; 4198 } 4199 *nmap = n; 4200 return 0; 4201 } 4202 4203 int 4204 xfs_bmapi_reserve_delalloc( 4205 struct xfs_inode *ip, 4206 int whichfork, 4207 xfs_fileoff_t aoff, 4208 xfs_filblks_t len, 4209 struct xfs_bmbt_irec *got, 4210 struct xfs_bmbt_irec *prev, 4211 xfs_extnum_t *lastx, 4212 int eof) 4213 { 4214 struct xfs_mount *mp = ip->i_mount; 4215 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork); 4216 xfs_extlen_t alen; 4217 xfs_extlen_t indlen; 4218 char rt = XFS_IS_REALTIME_INODE(ip); 4219 xfs_extlen_t extsz; 4220 int error; 4221 4222 alen = XFS_FILBLKS_MIN(len, MAXEXTLEN); 4223 if (!eof) 4224 alen = XFS_FILBLKS_MIN(alen, got->br_startoff - aoff); 4225 4226 /* Figure out the extent size, adjust alen */ 4227 if (whichfork == XFS_COW_FORK) 4228 extsz = xfs_get_cowextsz_hint(ip); 4229 else 4230 extsz = xfs_get_extsz_hint(ip); 4231 if (extsz) { 4232 error = xfs_bmap_extsize_align(mp, got, prev, extsz, rt, eof, 4233 1, 0, &aoff, &alen); 4234 ASSERT(!error); 4235 } 4236 4237 if (rt) 4238 extsz = alen / mp->m_sb.sb_rextsize; 4239 4240 /* 4241 * Make a transaction-less quota reservation for delayed allocation 4242 * blocks. This number gets adjusted later. We return if we haven't 4243 * allocated blocks already inside this loop. 4244 */ 4245 error = xfs_trans_reserve_quota_nblks(NULL, ip, (long)alen, 0, 4246 rt ? XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS); 4247 if (error) 4248 return error; 4249 4250 /* 4251 * Split changing sb for alen and indlen since they could be coming 4252 * from different places. 4253 */ 4254 indlen = (xfs_extlen_t)xfs_bmap_worst_indlen(ip, alen); 4255 ASSERT(indlen > 0); 4256 4257 if (rt) { 4258 error = xfs_mod_frextents(mp, -((int64_t)extsz)); 4259 } else { 4260 error = xfs_mod_fdblocks(mp, -((int64_t)alen), false); 4261 } 4262 4263 if (error) 4264 goto out_unreserve_quota; 4265 4266 error = xfs_mod_fdblocks(mp, -((int64_t)indlen), false); 4267 if (error) 4268 goto out_unreserve_blocks; 4269 4270 4271 ip->i_delayed_blks += alen; 4272 4273 got->br_startoff = aoff; 4274 got->br_startblock = nullstartblock(indlen); 4275 got->br_blockcount = alen; 4276 got->br_state = XFS_EXT_NORM; 4277 xfs_bmap_add_extent_hole_delay(ip, whichfork, lastx, got); 4278 4279 /* 4280 * Update our extent pointer, given that xfs_bmap_add_extent_hole_delay 4281 * might have merged it into one of the neighbouring ones. 4282 */ 4283 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *lastx), got); 4284 4285 ASSERT(got->br_startoff <= aoff); 4286 ASSERT(got->br_startoff + got->br_blockcount >= aoff + alen); 4287 ASSERT(isnullstartblock(got->br_startblock)); 4288 ASSERT(got->br_state == XFS_EXT_NORM); 4289 return 0; 4290 4291 out_unreserve_blocks: 4292 if (rt) 4293 xfs_mod_frextents(mp, extsz); 4294 else 4295 xfs_mod_fdblocks(mp, alen, false); 4296 out_unreserve_quota: 4297 if (XFS_IS_QUOTA_ON(mp)) 4298 xfs_trans_unreserve_quota_nblks(NULL, ip, (long)alen, 0, rt ? 4299 XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS); 4300 return error; 4301 } 4302 4303 static int 4304 xfs_bmapi_allocate( 4305 struct xfs_bmalloca *bma) 4306 { 4307 struct xfs_mount *mp = bma->ip->i_mount; 4308 int whichfork = xfs_bmapi_whichfork(bma->flags); 4309 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork); 4310 int tmp_logflags = 0; 4311 int error; 4312 4313 ASSERT(bma->length > 0); 4314 4315 /* 4316 * For the wasdelay case, we could also just allocate the stuff asked 4317 * for in this bmap call but that wouldn't be as good. 4318 */ 4319 if (bma->wasdel) { 4320 bma->length = (xfs_extlen_t)bma->got.br_blockcount; 4321 bma->offset = bma->got.br_startoff; 4322 if (bma->idx != NULLEXTNUM && bma->idx) { 4323 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), 4324 &bma->prev); 4325 } 4326 } else { 4327 bma->length = XFS_FILBLKS_MIN(bma->length, MAXEXTLEN); 4328 if (!bma->eof) 4329 bma->length = XFS_FILBLKS_MIN(bma->length, 4330 bma->got.br_startoff - bma->offset); 4331 } 4332 4333 /* 4334 * Set the data type being allocated. For the data fork, the first data 4335 * in the file is treated differently to all other allocations. For the 4336 * attribute fork, we only need to ensure the allocated range is not on 4337 * the busy list. 4338 */ 4339 if (!(bma->flags & XFS_BMAPI_METADATA)) { 4340 bma->datatype = XFS_ALLOC_NOBUSY; 4341 if (whichfork == XFS_DATA_FORK) { 4342 if (bma->offset == 0) 4343 bma->datatype |= XFS_ALLOC_INITIAL_USER_DATA; 4344 else 4345 bma->datatype |= XFS_ALLOC_USERDATA; 4346 } 4347 if (bma->flags & XFS_BMAPI_ZERO) 4348 bma->datatype |= XFS_ALLOC_USERDATA_ZERO; 4349 } 4350 4351 bma->minlen = (bma->flags & XFS_BMAPI_CONTIG) ? bma->length : 1; 4352 4353 /* 4354 * Only want to do the alignment at the eof if it is userdata and 4355 * allocation length is larger than a stripe unit. 4356 */ 4357 if (mp->m_dalign && bma->length >= mp->m_dalign && 4358 !(bma->flags & XFS_BMAPI_METADATA) && whichfork == XFS_DATA_FORK) { 4359 error = xfs_bmap_isaeof(bma, whichfork); 4360 if (error) 4361 return error; 4362 } 4363 4364 error = xfs_bmap_alloc(bma); 4365 if (error) 4366 return error; 4367 4368 if (bma->dfops->dop_low) 4369 bma->minleft = 0; 4370 if (bma->cur) 4371 bma->cur->bc_private.b.firstblock = *bma->firstblock; 4372 if (bma->blkno == NULLFSBLOCK) 4373 return 0; 4374 if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) { 4375 bma->cur = xfs_bmbt_init_cursor(mp, bma->tp, bma->ip, whichfork); 4376 bma->cur->bc_private.b.firstblock = *bma->firstblock; 4377 bma->cur->bc_private.b.dfops = bma->dfops; 4378 } 4379 /* 4380 * Bump the number of extents we've allocated 4381 * in this call. 4382 */ 4383 bma->nallocs++; 4384 4385 if (bma->cur) 4386 bma->cur->bc_private.b.flags = 4387 bma->wasdel ? XFS_BTCUR_BPRV_WASDEL : 0; 4388 4389 bma->got.br_startoff = bma->offset; 4390 bma->got.br_startblock = bma->blkno; 4391 bma->got.br_blockcount = bma->length; 4392 bma->got.br_state = XFS_EXT_NORM; 4393 4394 /* 4395 * A wasdelay extent has been initialized, so shouldn't be flagged 4396 * as unwritten. 4397 */ 4398 if (!bma->wasdel && (bma->flags & XFS_BMAPI_PREALLOC) && 4399 xfs_sb_version_hasextflgbit(&mp->m_sb)) 4400 bma->got.br_state = XFS_EXT_UNWRITTEN; 4401 4402 if (bma->wasdel) 4403 error = xfs_bmap_add_extent_delay_real(bma, whichfork); 4404 else 4405 error = xfs_bmap_add_extent_hole_real(bma, whichfork); 4406 4407 bma->logflags |= tmp_logflags; 4408 if (error) 4409 return error; 4410 4411 /* 4412 * Update our extent pointer, given that xfs_bmap_add_extent_delay_real 4413 * or xfs_bmap_add_extent_hole_real might have merged it into one of 4414 * the neighbouring ones. 4415 */ 4416 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &bma->got); 4417 4418 ASSERT(bma->got.br_startoff <= bma->offset); 4419 ASSERT(bma->got.br_startoff + bma->got.br_blockcount >= 4420 bma->offset + bma->length); 4421 ASSERT(bma->got.br_state == XFS_EXT_NORM || 4422 bma->got.br_state == XFS_EXT_UNWRITTEN); 4423 return 0; 4424 } 4425 4426 STATIC int 4427 xfs_bmapi_convert_unwritten( 4428 struct xfs_bmalloca *bma, 4429 struct xfs_bmbt_irec *mval, 4430 xfs_filblks_t len, 4431 int flags) 4432 { 4433 int whichfork = xfs_bmapi_whichfork(flags); 4434 struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork); 4435 int tmp_logflags = 0; 4436 int error; 4437 4438 /* check if we need to do unwritten->real conversion */ 4439 if (mval->br_state == XFS_EXT_UNWRITTEN && 4440 (flags & XFS_BMAPI_PREALLOC)) 4441 return 0; 4442 4443 /* check if we need to do real->unwritten conversion */ 4444 if (mval->br_state == XFS_EXT_NORM && 4445 (flags & (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT)) != 4446 (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT)) 4447 return 0; 4448 4449 ASSERT(whichfork != XFS_COW_FORK); 4450 4451 /* 4452 * Modify (by adding) the state flag, if writing. 4453 */ 4454 ASSERT(mval->br_blockcount <= len); 4455 if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) { 4456 bma->cur = xfs_bmbt_init_cursor(bma->ip->i_mount, bma->tp, 4457 bma->ip, whichfork); 4458 bma->cur->bc_private.b.firstblock = *bma->firstblock; 4459 bma->cur->bc_private.b.dfops = bma->dfops; 4460 } 4461 mval->br_state = (mval->br_state == XFS_EXT_UNWRITTEN) 4462 ? XFS_EXT_NORM : XFS_EXT_UNWRITTEN; 4463 4464 /* 4465 * Before insertion into the bmbt, zero the range being converted 4466 * if required. 4467 */ 4468 if (flags & XFS_BMAPI_ZERO) { 4469 error = xfs_zero_extent(bma->ip, mval->br_startblock, 4470 mval->br_blockcount); 4471 if (error) 4472 return error; 4473 } 4474 4475 error = xfs_bmap_add_extent_unwritten_real(bma->tp, bma->ip, &bma->idx, 4476 &bma->cur, mval, bma->firstblock, bma->dfops, 4477 &tmp_logflags); 4478 /* 4479 * Log the inode core unconditionally in the unwritten extent conversion 4480 * path because the conversion might not have done so (e.g., if the 4481 * extent count hasn't changed). We need to make sure the inode is dirty 4482 * in the transaction for the sake of fsync(), even if nothing has 4483 * changed, because fsync() will not force the log for this transaction 4484 * unless it sees the inode pinned. 4485 */ 4486 bma->logflags |= tmp_logflags | XFS_ILOG_CORE; 4487 if (error) 4488 return error; 4489 4490 /* 4491 * Update our extent pointer, given that 4492 * xfs_bmap_add_extent_unwritten_real might have merged it into one 4493 * of the neighbouring ones. 4494 */ 4495 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &bma->got); 4496 4497 /* 4498 * We may have combined previously unwritten space with written space, 4499 * so generate another request. 4500 */ 4501 if (mval->br_blockcount < len) 4502 return -EAGAIN; 4503 return 0; 4504 } 4505 4506 /* 4507 * Map file blocks to filesystem blocks, and allocate blocks or convert the 4508 * extent state if necessary. Details behaviour is controlled by the flags 4509 * parameter. Only allocates blocks from a single allocation group, to avoid 4510 * locking problems. 4511 * 4512 * The returned value in "firstblock" from the first call in a transaction 4513 * must be remembered and presented to subsequent calls in "firstblock". 4514 * An upper bound for the number of blocks to be allocated is supplied to 4515 * the first call in "total"; if no allocation group has that many free 4516 * blocks then the call will fail (return NULLFSBLOCK in "firstblock"). 4517 */ 4518 int 4519 xfs_bmapi_write( 4520 struct xfs_trans *tp, /* transaction pointer */ 4521 struct xfs_inode *ip, /* incore inode */ 4522 xfs_fileoff_t bno, /* starting file offs. mapped */ 4523 xfs_filblks_t len, /* length to map in file */ 4524 int flags, /* XFS_BMAPI_... */ 4525 xfs_fsblock_t *firstblock, /* first allocated block 4526 controls a.g. for allocs */ 4527 xfs_extlen_t total, /* total blocks needed */ 4528 struct xfs_bmbt_irec *mval, /* output: map values */ 4529 int *nmap, /* i/o: mval size/count */ 4530 struct xfs_defer_ops *dfops) /* i/o: list extents to free */ 4531 { 4532 struct xfs_mount *mp = ip->i_mount; 4533 struct xfs_ifork *ifp; 4534 struct xfs_bmalloca bma = { NULL }; /* args for xfs_bmap_alloc */ 4535 xfs_fileoff_t end; /* end of mapped file region */ 4536 int eof; /* after the end of extents */ 4537 int error; /* error return */ 4538 int n; /* current extent index */ 4539 xfs_fileoff_t obno; /* old block number (offset) */ 4540 int whichfork; /* data or attr fork */ 4541 char inhole; /* current location is hole in file */ 4542 char wasdelay; /* old extent was delayed */ 4543 4544 #ifdef DEBUG 4545 xfs_fileoff_t orig_bno; /* original block number value */ 4546 int orig_flags; /* original flags arg value */ 4547 xfs_filblks_t orig_len; /* original value of len arg */ 4548 struct xfs_bmbt_irec *orig_mval; /* original value of mval */ 4549 int orig_nmap; /* original value of *nmap */ 4550 4551 orig_bno = bno; 4552 orig_len = len; 4553 orig_flags = flags; 4554 orig_mval = mval; 4555 orig_nmap = *nmap; 4556 #endif 4557 whichfork = xfs_bmapi_whichfork(flags); 4558 4559 ASSERT(*nmap >= 1); 4560 ASSERT(*nmap <= XFS_BMAP_MAX_NMAP); 4561 ASSERT(!(flags & XFS_BMAPI_IGSTATE)); 4562 ASSERT(tp != NULL); 4563 ASSERT(len > 0); 4564 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL); 4565 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL)); 4566 ASSERT(!(flags & XFS_BMAPI_REMAP) || whichfork == XFS_DATA_FORK); 4567 ASSERT(!(flags & XFS_BMAPI_PREALLOC) || !(flags & XFS_BMAPI_REMAP)); 4568 ASSERT(!(flags & XFS_BMAPI_CONVERT) || !(flags & XFS_BMAPI_REMAP)); 4569 ASSERT(!(flags & XFS_BMAPI_PREALLOC) || whichfork != XFS_COW_FORK); 4570 ASSERT(!(flags & XFS_BMAPI_CONVERT) || whichfork != XFS_COW_FORK); 4571 4572 /* zeroing is for currently only for data extents, not metadata */ 4573 ASSERT((flags & (XFS_BMAPI_METADATA | XFS_BMAPI_ZERO)) != 4574 (XFS_BMAPI_METADATA | XFS_BMAPI_ZERO)); 4575 /* 4576 * we can allocate unwritten extents or pre-zero allocated blocks, 4577 * but it makes no sense to do both at once. This would result in 4578 * zeroing the unwritten extent twice, but it still being an 4579 * unwritten extent.... 4580 */ 4581 ASSERT((flags & (XFS_BMAPI_PREALLOC | XFS_BMAPI_ZERO)) != 4582 (XFS_BMAPI_PREALLOC | XFS_BMAPI_ZERO)); 4583 4584 if (unlikely(XFS_TEST_ERROR( 4585 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && 4586 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE), 4587 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) { 4588 XFS_ERROR_REPORT("xfs_bmapi_write", XFS_ERRLEVEL_LOW, mp); 4589 return -EFSCORRUPTED; 4590 } 4591 4592 if (XFS_FORCED_SHUTDOWN(mp)) 4593 return -EIO; 4594 4595 ifp = XFS_IFORK_PTR(ip, whichfork); 4596 4597 XFS_STATS_INC(mp, xs_blk_mapw); 4598 4599 if (*firstblock == NULLFSBLOCK) { 4600 if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE) 4601 bma.minleft = be16_to_cpu(ifp->if_broot->bb_level) + 1; 4602 else 4603 bma.minleft = 1; 4604 } else { 4605 bma.minleft = 0; 4606 } 4607 4608 if (!(ifp->if_flags & XFS_IFEXTENTS)) { 4609 error = xfs_iread_extents(tp, ip, whichfork); 4610 if (error) 4611 goto error0; 4612 } 4613 4614 xfs_bmap_search_extents(ip, bno, whichfork, &eof, &bma.idx, &bma.got, 4615 &bma.prev); 4616 n = 0; 4617 end = bno + len; 4618 obno = bno; 4619 4620 bma.tp = tp; 4621 bma.ip = ip; 4622 bma.total = total; 4623 bma.datatype = 0; 4624 bma.dfops = dfops; 4625 bma.firstblock = firstblock; 4626 4627 while (bno < end && n < *nmap) { 4628 inhole = eof || bma.got.br_startoff > bno; 4629 wasdelay = !inhole && isnullstartblock(bma.got.br_startblock); 4630 4631 /* 4632 * Make sure we only reflink into a hole. 4633 */ 4634 if (flags & XFS_BMAPI_REMAP) 4635 ASSERT(inhole); 4636 if (flags & XFS_BMAPI_COWFORK) 4637 ASSERT(!inhole); 4638 4639 /* 4640 * First, deal with the hole before the allocated space 4641 * that we found, if any. 4642 */ 4643 if (inhole || wasdelay) { 4644 bma.eof = eof; 4645 bma.conv = !!(flags & XFS_BMAPI_CONVERT); 4646 bma.wasdel = wasdelay; 4647 bma.offset = bno; 4648 bma.flags = flags; 4649 4650 /* 4651 * There's a 32/64 bit type mismatch between the 4652 * allocation length request (which can be 64 bits in 4653 * length) and the bma length request, which is 4654 * xfs_extlen_t and therefore 32 bits. Hence we have to 4655 * check for 32-bit overflows and handle them here. 4656 */ 4657 if (len > (xfs_filblks_t)MAXEXTLEN) 4658 bma.length = MAXEXTLEN; 4659 else 4660 bma.length = len; 4661 4662 ASSERT(len > 0); 4663 ASSERT(bma.length > 0); 4664 error = xfs_bmapi_allocate(&bma); 4665 if (error) 4666 goto error0; 4667 if (bma.blkno == NULLFSBLOCK) 4668 break; 4669 4670 /* 4671 * If this is a CoW allocation, record the data in 4672 * the refcount btree for orphan recovery. 4673 */ 4674 if (whichfork == XFS_COW_FORK) { 4675 error = xfs_refcount_alloc_cow_extent(mp, dfops, 4676 bma.blkno, bma.length); 4677 if (error) 4678 goto error0; 4679 } 4680 } 4681 4682 /* Deal with the allocated space we found. */ 4683 xfs_bmapi_trim_map(mval, &bma.got, &bno, len, obno, 4684 end, n, flags); 4685 4686 /* Execute unwritten extent conversion if necessary */ 4687 error = xfs_bmapi_convert_unwritten(&bma, mval, len, flags); 4688 if (error == -EAGAIN) 4689 continue; 4690 if (error) 4691 goto error0; 4692 4693 /* update the extent map to return */ 4694 xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags); 4695 4696 /* 4697 * If we're done, stop now. Stop when we've allocated 4698 * XFS_BMAP_MAX_NMAP extents no matter what. Otherwise 4699 * the transaction may get too big. 4700 */ 4701 if (bno >= end || n >= *nmap || bma.nallocs >= *nmap) 4702 break; 4703 4704 /* Else go on to the next record. */ 4705 bma.prev = bma.got; 4706 if (++bma.idx < ifp->if_bytes / sizeof(xfs_bmbt_rec_t)) { 4707 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma.idx), 4708 &bma.got); 4709 } else 4710 eof = 1; 4711 } 4712 *nmap = n; 4713 4714 /* 4715 * Transform from btree to extents, give it cur. 4716 */ 4717 if (xfs_bmap_wants_extents(ip, whichfork)) { 4718 int tmp_logflags = 0; 4719 4720 ASSERT(bma.cur); 4721 error = xfs_bmap_btree_to_extents(tp, ip, bma.cur, 4722 &tmp_logflags, whichfork); 4723 bma.logflags |= tmp_logflags; 4724 if (error) 4725 goto error0; 4726 } 4727 4728 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE || 4729 XFS_IFORK_NEXTENTS(ip, whichfork) > 4730 XFS_IFORK_MAXEXT(ip, whichfork)); 4731 error = 0; 4732 error0: 4733 /* 4734 * Log everything. Do this after conversion, there's no point in 4735 * logging the extent records if we've converted to btree format. 4736 */ 4737 if ((bma.logflags & xfs_ilog_fext(whichfork)) && 4738 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS) 4739 bma.logflags &= ~xfs_ilog_fext(whichfork); 4740 else if ((bma.logflags & xfs_ilog_fbroot(whichfork)) && 4741 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) 4742 bma.logflags &= ~xfs_ilog_fbroot(whichfork); 4743 /* 4744 * Log whatever the flags say, even if error. Otherwise we might miss 4745 * detecting a case where the data is changed, there's an error, 4746 * and it's not logged so we don't shutdown when we should. 4747 */ 4748 if (bma.logflags) 4749 xfs_trans_log_inode(tp, ip, bma.logflags); 4750 4751 if (bma.cur) { 4752 if (!error) { 4753 ASSERT(*firstblock == NULLFSBLOCK || 4754 XFS_FSB_TO_AGNO(mp, *firstblock) == 4755 XFS_FSB_TO_AGNO(mp, 4756 bma.cur->bc_private.b.firstblock) || 4757 (dfops->dop_low && 4758 XFS_FSB_TO_AGNO(mp, *firstblock) < 4759 XFS_FSB_TO_AGNO(mp, 4760 bma.cur->bc_private.b.firstblock))); 4761 *firstblock = bma.cur->bc_private.b.firstblock; 4762 } 4763 xfs_btree_del_cursor(bma.cur, 4764 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); 4765 } 4766 if (!error) 4767 xfs_bmap_validate_ret(orig_bno, orig_len, orig_flags, orig_mval, 4768 orig_nmap, *nmap); 4769 return error; 4770 } 4771 4772 /* 4773 * When a delalloc extent is split (e.g., due to a hole punch), the original 4774 * indlen reservation must be shared across the two new extents that are left 4775 * behind. 4776 * 4777 * Given the original reservation and the worst case indlen for the two new 4778 * extents (as calculated by xfs_bmap_worst_indlen()), split the original 4779 * reservation fairly across the two new extents. If necessary, steal available 4780 * blocks from a deleted extent to make up a reservation deficiency (e.g., if 4781 * ores == 1). The number of stolen blocks is returned. The availability and 4782 * subsequent accounting of stolen blocks is the responsibility of the caller. 4783 */ 4784 static xfs_filblks_t 4785 xfs_bmap_split_indlen( 4786 xfs_filblks_t ores, /* original res. */ 4787 xfs_filblks_t *indlen1, /* ext1 worst indlen */ 4788 xfs_filblks_t *indlen2, /* ext2 worst indlen */ 4789 xfs_filblks_t avail) /* stealable blocks */ 4790 { 4791 xfs_filblks_t len1 = *indlen1; 4792 xfs_filblks_t len2 = *indlen2; 4793 xfs_filblks_t nres = len1 + len2; /* new total res. */ 4794 xfs_filblks_t stolen = 0; 4795 4796 /* 4797 * Steal as many blocks as we can to try and satisfy the worst case 4798 * indlen for both new extents. 4799 */ 4800 while (nres > ores && avail) { 4801 nres--; 4802 avail--; 4803 stolen++; 4804 } 4805 4806 /* 4807 * The only blocks available are those reserved for the original 4808 * extent and what we can steal from the extent being removed. 4809 * If this still isn't enough to satisfy the combined 4810 * requirements for the two new extents, skim blocks off of each 4811 * of the new reservations until they match what is available. 4812 */ 4813 while (nres > ores) { 4814 if (len1) { 4815 len1--; 4816 nres--; 4817 } 4818 if (nres == ores) 4819 break; 4820 if (len2) { 4821 len2--; 4822 nres--; 4823 } 4824 } 4825 4826 *indlen1 = len1; 4827 *indlen2 = len2; 4828 4829 return stolen; 4830 } 4831 4832 /* 4833 * Called by xfs_bmapi to update file extent records and the btree 4834 * after removing space (or undoing a delayed allocation). 4835 */ 4836 STATIC int /* error */ 4837 xfs_bmap_del_extent( 4838 xfs_inode_t *ip, /* incore inode pointer */ 4839 xfs_trans_t *tp, /* current transaction pointer */ 4840 xfs_extnum_t *idx, /* extent number to update/delete */ 4841 struct xfs_defer_ops *dfops, /* list of extents to be freed */ 4842 xfs_btree_cur_t *cur, /* if null, not a btree */ 4843 xfs_bmbt_irec_t *del, /* data to remove from extents */ 4844 int *logflagsp, /* inode logging flags */ 4845 int whichfork, /* data or attr fork */ 4846 int bflags) /* bmapi flags */ 4847 { 4848 xfs_filblks_t da_new; /* new delay-alloc indirect blocks */ 4849 xfs_filblks_t da_old; /* old delay-alloc indirect blocks */ 4850 xfs_fsblock_t del_endblock=0; /* first block past del */ 4851 xfs_fileoff_t del_endoff; /* first offset past del */ 4852 int delay; /* current block is delayed allocated */ 4853 int do_fx; /* free extent at end of routine */ 4854 xfs_bmbt_rec_host_t *ep; /* current extent entry pointer */ 4855 int error; /* error return value */ 4856 int flags; /* inode logging flags */ 4857 xfs_bmbt_irec_t got; /* current extent entry */ 4858 xfs_fileoff_t got_endoff; /* first offset past got */ 4859 int i; /* temp state */ 4860 xfs_ifork_t *ifp; /* inode fork pointer */ 4861 xfs_mount_t *mp; /* mount structure */ 4862 xfs_filblks_t nblks; /* quota/sb block count */ 4863 xfs_bmbt_irec_t new; /* new record to be inserted */ 4864 /* REFERENCED */ 4865 uint qfield; /* quota field to update */ 4866 xfs_filblks_t temp; /* for indirect length calculations */ 4867 xfs_filblks_t temp2; /* for indirect length calculations */ 4868 int state = 0; 4869 4870 mp = ip->i_mount; 4871 XFS_STATS_INC(mp, xs_del_exlist); 4872 4873 if (whichfork == XFS_ATTR_FORK) 4874 state |= BMAP_ATTRFORK; 4875 else if (whichfork == XFS_COW_FORK) 4876 state |= BMAP_COWFORK; 4877 4878 ifp = XFS_IFORK_PTR(ip, whichfork); 4879 ASSERT((*idx >= 0) && (*idx < ifp->if_bytes / 4880 (uint)sizeof(xfs_bmbt_rec_t))); 4881 ASSERT(del->br_blockcount > 0); 4882 ep = xfs_iext_get_ext(ifp, *idx); 4883 xfs_bmbt_get_all(ep, &got); 4884 ASSERT(got.br_startoff <= del->br_startoff); 4885 del_endoff = del->br_startoff + del->br_blockcount; 4886 got_endoff = got.br_startoff + got.br_blockcount; 4887 ASSERT(got_endoff >= del_endoff); 4888 delay = isnullstartblock(got.br_startblock); 4889 ASSERT(isnullstartblock(del->br_startblock) == delay); 4890 flags = 0; 4891 qfield = 0; 4892 error = 0; 4893 /* 4894 * If deleting a real allocation, must free up the disk space. 4895 */ 4896 if (!delay) { 4897 flags = XFS_ILOG_CORE; 4898 /* 4899 * Realtime allocation. Free it and record di_nblocks update. 4900 */ 4901 if (whichfork == XFS_DATA_FORK && XFS_IS_REALTIME_INODE(ip)) { 4902 xfs_fsblock_t bno; 4903 xfs_filblks_t len; 4904 4905 ASSERT(do_mod(del->br_blockcount, 4906 mp->m_sb.sb_rextsize) == 0); 4907 ASSERT(do_mod(del->br_startblock, 4908 mp->m_sb.sb_rextsize) == 0); 4909 bno = del->br_startblock; 4910 len = del->br_blockcount; 4911 do_div(bno, mp->m_sb.sb_rextsize); 4912 do_div(len, mp->m_sb.sb_rextsize); 4913 error = xfs_rtfree_extent(tp, bno, (xfs_extlen_t)len); 4914 if (error) 4915 goto done; 4916 do_fx = 0; 4917 nblks = len * mp->m_sb.sb_rextsize; 4918 qfield = XFS_TRANS_DQ_RTBCOUNT; 4919 } 4920 /* 4921 * Ordinary allocation. 4922 */ 4923 else { 4924 do_fx = 1; 4925 nblks = del->br_blockcount; 4926 qfield = XFS_TRANS_DQ_BCOUNT; 4927 } 4928 /* 4929 * Set up del_endblock and cur for later. 4930 */ 4931 del_endblock = del->br_startblock + del->br_blockcount; 4932 if (cur) { 4933 if ((error = xfs_bmbt_lookup_eq(cur, got.br_startoff, 4934 got.br_startblock, got.br_blockcount, 4935 &i))) 4936 goto done; 4937 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 4938 } 4939 da_old = da_new = 0; 4940 } else { 4941 da_old = startblockval(got.br_startblock); 4942 da_new = 0; 4943 nblks = 0; 4944 do_fx = 0; 4945 } 4946 4947 /* 4948 * Set flag value to use in switch statement. 4949 * Left-contig is 2, right-contig is 1. 4950 */ 4951 switch (((got.br_startoff == del->br_startoff) << 1) | 4952 (got_endoff == del_endoff)) { 4953 case 3: 4954 /* 4955 * Matches the whole extent. Delete the entry. 4956 */ 4957 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 4958 xfs_iext_remove(ip, *idx, 1, 4959 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0); 4960 --*idx; 4961 if (delay) 4962 break; 4963 4964 XFS_IFORK_NEXT_SET(ip, whichfork, 4965 XFS_IFORK_NEXTENTS(ip, whichfork) - 1); 4966 flags |= XFS_ILOG_CORE; 4967 if (!cur) { 4968 flags |= xfs_ilog_fext(whichfork); 4969 break; 4970 } 4971 if ((error = xfs_btree_delete(cur, &i))) 4972 goto done; 4973 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 4974 break; 4975 4976 case 2: 4977 /* 4978 * Deleting the first part of the extent. 4979 */ 4980 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 4981 xfs_bmbt_set_startoff(ep, del_endoff); 4982 temp = got.br_blockcount - del->br_blockcount; 4983 xfs_bmbt_set_blockcount(ep, temp); 4984 if (delay) { 4985 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp), 4986 da_old); 4987 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); 4988 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 4989 da_new = temp; 4990 break; 4991 } 4992 xfs_bmbt_set_startblock(ep, del_endblock); 4993 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 4994 if (!cur) { 4995 flags |= xfs_ilog_fext(whichfork); 4996 break; 4997 } 4998 if ((error = xfs_bmbt_update(cur, del_endoff, del_endblock, 4999 got.br_blockcount - del->br_blockcount, 5000 got.br_state))) 5001 goto done; 5002 break; 5003 5004 case 1: 5005 /* 5006 * Deleting the last part of the extent. 5007 */ 5008 temp = got.br_blockcount - del->br_blockcount; 5009 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 5010 xfs_bmbt_set_blockcount(ep, temp); 5011 if (delay) { 5012 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp), 5013 da_old); 5014 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); 5015 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 5016 da_new = temp; 5017 break; 5018 } 5019 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 5020 if (!cur) { 5021 flags |= xfs_ilog_fext(whichfork); 5022 break; 5023 } 5024 if ((error = xfs_bmbt_update(cur, got.br_startoff, 5025 got.br_startblock, 5026 got.br_blockcount - del->br_blockcount, 5027 got.br_state))) 5028 goto done; 5029 break; 5030 5031 case 0: 5032 /* 5033 * Deleting the middle of the extent. 5034 */ 5035 temp = del->br_startoff - got.br_startoff; 5036 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); 5037 xfs_bmbt_set_blockcount(ep, temp); 5038 new.br_startoff = del_endoff; 5039 temp2 = got_endoff - del_endoff; 5040 new.br_blockcount = temp2; 5041 new.br_state = got.br_state; 5042 if (!delay) { 5043 new.br_startblock = del_endblock; 5044 flags |= XFS_ILOG_CORE; 5045 if (cur) { 5046 if ((error = xfs_bmbt_update(cur, 5047 got.br_startoff, 5048 got.br_startblock, temp, 5049 got.br_state))) 5050 goto done; 5051 if ((error = xfs_btree_increment(cur, 0, &i))) 5052 goto done; 5053 cur->bc_rec.b = new; 5054 error = xfs_btree_insert(cur, &i); 5055 if (error && error != -ENOSPC) 5056 goto done; 5057 /* 5058 * If get no-space back from btree insert, 5059 * it tried a split, and we have a zero 5060 * block reservation. 5061 * Fix up our state and return the error. 5062 */ 5063 if (error == -ENOSPC) { 5064 /* 5065 * Reset the cursor, don't trust 5066 * it after any insert operation. 5067 */ 5068 if ((error = xfs_bmbt_lookup_eq(cur, 5069 got.br_startoff, 5070 got.br_startblock, 5071 temp, &i))) 5072 goto done; 5073 XFS_WANT_CORRUPTED_GOTO(mp, 5074 i == 1, done); 5075 /* 5076 * Update the btree record back 5077 * to the original value. 5078 */ 5079 if ((error = xfs_bmbt_update(cur, 5080 got.br_startoff, 5081 got.br_startblock, 5082 got.br_blockcount, 5083 got.br_state))) 5084 goto done; 5085 /* 5086 * Reset the extent record back 5087 * to the original value. 5088 */ 5089 xfs_bmbt_set_blockcount(ep, 5090 got.br_blockcount); 5091 flags = 0; 5092 error = -ENOSPC; 5093 goto done; 5094 } 5095 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, done); 5096 } else 5097 flags |= xfs_ilog_fext(whichfork); 5098 XFS_IFORK_NEXT_SET(ip, whichfork, 5099 XFS_IFORK_NEXTENTS(ip, whichfork) + 1); 5100 } else { 5101 xfs_filblks_t stolen; 5102 ASSERT(whichfork == XFS_DATA_FORK); 5103 5104 /* 5105 * Distribute the original indlen reservation across the 5106 * two new extents. Steal blocks from the deleted extent 5107 * if necessary. Stealing blocks simply fudges the 5108 * fdblocks accounting in xfs_bunmapi(). 5109 */ 5110 temp = xfs_bmap_worst_indlen(ip, got.br_blockcount); 5111 temp2 = xfs_bmap_worst_indlen(ip, new.br_blockcount); 5112 stolen = xfs_bmap_split_indlen(da_old, &temp, &temp2, 5113 del->br_blockcount); 5114 da_new = temp + temp2 - stolen; 5115 del->br_blockcount -= stolen; 5116 5117 /* 5118 * Set the reservation for each extent. Warn if either 5119 * is zero as this can lead to delalloc problems. 5120 */ 5121 WARN_ON_ONCE(!temp || !temp2); 5122 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); 5123 new.br_startblock = nullstartblock((int)temp2); 5124 } 5125 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); 5126 xfs_iext_insert(ip, *idx + 1, 1, &new, state); 5127 ++*idx; 5128 break; 5129 } 5130 5131 /* remove reverse mapping */ 5132 if (!delay) { 5133 error = xfs_rmap_unmap_extent(mp, dfops, ip, whichfork, del); 5134 if (error) 5135 goto done; 5136 } 5137 5138 /* 5139 * If we need to, add to list of extents to delete. 5140 */ 5141 if (do_fx && !(bflags & XFS_BMAPI_REMAP)) { 5142 if (xfs_is_reflink_inode(ip) && whichfork == XFS_DATA_FORK) { 5143 error = xfs_refcount_decrease_extent(mp, dfops, del); 5144 if (error) 5145 goto done; 5146 } else 5147 xfs_bmap_add_free(mp, dfops, del->br_startblock, 5148 del->br_blockcount, NULL); 5149 } 5150 5151 /* 5152 * Adjust inode # blocks in the file. 5153 */ 5154 if (nblks) 5155 ip->i_d.di_nblocks -= nblks; 5156 /* 5157 * Adjust quota data. 5158 */ 5159 if (qfield && !(bflags & XFS_BMAPI_REMAP)) 5160 xfs_trans_mod_dquot_byino(tp, ip, qfield, (long)-nblks); 5161 5162 /* 5163 * Account for change in delayed indirect blocks. 5164 * Nothing to do for disk quota accounting here. 5165 */ 5166 ASSERT(da_old >= da_new); 5167 if (da_old > da_new) 5168 xfs_mod_fdblocks(mp, (int64_t)(da_old - da_new), false); 5169 done: 5170 *logflagsp = flags; 5171 return error; 5172 } 5173 5174 /* Remove an extent from the CoW fork. Similar to xfs_bmap_del_extent. */ 5175 int 5176 xfs_bunmapi_cow( 5177 struct xfs_inode *ip, 5178 struct xfs_bmbt_irec *del) 5179 { 5180 xfs_filblks_t da_new; 5181 xfs_filblks_t da_old; 5182 xfs_fsblock_t del_endblock = 0; 5183 xfs_fileoff_t del_endoff; 5184 int delay; 5185 struct xfs_bmbt_rec_host *ep; 5186 int error; 5187 struct xfs_bmbt_irec got; 5188 xfs_fileoff_t got_endoff; 5189 struct xfs_ifork *ifp; 5190 struct xfs_mount *mp; 5191 xfs_filblks_t nblks; 5192 struct xfs_bmbt_irec new; 5193 /* REFERENCED */ 5194 uint qfield; 5195 xfs_filblks_t temp; 5196 xfs_filblks_t temp2; 5197 int state = BMAP_COWFORK; 5198 int eof; 5199 xfs_extnum_t eidx; 5200 5201 mp = ip->i_mount; 5202 XFS_STATS_INC(mp, xs_del_exlist); 5203 5204 ep = xfs_bmap_search_extents(ip, del->br_startoff, XFS_COW_FORK, &eof, 5205 &eidx, &got, &new); 5206 5207 ifp = XFS_IFORK_PTR(ip, XFS_COW_FORK); ifp = ifp; 5208 ASSERT((eidx >= 0) && (eidx < ifp->if_bytes / 5209 (uint)sizeof(xfs_bmbt_rec_t))); 5210 ASSERT(del->br_blockcount > 0); 5211 ASSERT(got.br_startoff <= del->br_startoff); 5212 del_endoff = del->br_startoff + del->br_blockcount; 5213 got_endoff = got.br_startoff + got.br_blockcount; 5214 ASSERT(got_endoff >= del_endoff); 5215 delay = isnullstartblock(got.br_startblock); 5216 ASSERT(isnullstartblock(del->br_startblock) == delay); 5217 qfield = 0; 5218 error = 0; 5219 /* 5220 * If deleting a real allocation, must free up the disk space. 5221 */ 5222 if (!delay) { 5223 nblks = del->br_blockcount; 5224 qfield = XFS_TRANS_DQ_BCOUNT; 5225 /* 5226 * Set up del_endblock and cur for later. 5227 */ 5228 del_endblock = del->br_startblock + del->br_blockcount; 5229 da_old = da_new = 0; 5230 } else { 5231 da_old = startblockval(got.br_startblock); 5232 da_new = 0; 5233 nblks = 0; 5234 } 5235 qfield = qfield; 5236 nblks = nblks; 5237 5238 /* 5239 * Set flag value to use in switch statement. 5240 * Left-contig is 2, right-contig is 1. 5241 */ 5242 switch (((got.br_startoff == del->br_startoff) << 1) | 5243 (got_endoff == del_endoff)) { 5244 case 3: 5245 /* 5246 * Matches the whole extent. Delete the entry. 5247 */ 5248 xfs_iext_remove(ip, eidx, 1, BMAP_COWFORK); 5249 --eidx; 5250 break; 5251 5252 case 2: 5253 /* 5254 * Deleting the first part of the extent. 5255 */ 5256 trace_xfs_bmap_pre_update(ip, eidx, state, _THIS_IP_); 5257 xfs_bmbt_set_startoff(ep, del_endoff); 5258 temp = got.br_blockcount - del->br_blockcount; 5259 xfs_bmbt_set_blockcount(ep, temp); 5260 if (delay) { 5261 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp), 5262 da_old); 5263 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); 5264 trace_xfs_bmap_post_update(ip, eidx, state, _THIS_IP_); 5265 da_new = temp; 5266 break; 5267 } 5268 xfs_bmbt_set_startblock(ep, del_endblock); 5269 trace_xfs_bmap_post_update(ip, eidx, state, _THIS_IP_); 5270 break; 5271 5272 case 1: 5273 /* 5274 * Deleting the last part of the extent. 5275 */ 5276 temp = got.br_blockcount - del->br_blockcount; 5277 trace_xfs_bmap_pre_update(ip, eidx, state, _THIS_IP_); 5278 xfs_bmbt_set_blockcount(ep, temp); 5279 if (delay) { 5280 temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp), 5281 da_old); 5282 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); 5283 trace_xfs_bmap_post_update(ip, eidx, state, _THIS_IP_); 5284 da_new = temp; 5285 break; 5286 } 5287 trace_xfs_bmap_post_update(ip, eidx, state, _THIS_IP_); 5288 break; 5289 5290 case 0: 5291 /* 5292 * Deleting the middle of the extent. 5293 */ 5294 temp = del->br_startoff - got.br_startoff; 5295 trace_xfs_bmap_pre_update(ip, eidx, state, _THIS_IP_); 5296 xfs_bmbt_set_blockcount(ep, temp); 5297 new.br_startoff = del_endoff; 5298 temp2 = got_endoff - del_endoff; 5299 new.br_blockcount = temp2; 5300 new.br_state = got.br_state; 5301 if (!delay) { 5302 new.br_startblock = del_endblock; 5303 } else { 5304 temp = xfs_bmap_worst_indlen(ip, temp); 5305 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); 5306 temp2 = xfs_bmap_worst_indlen(ip, temp2); 5307 new.br_startblock = nullstartblock((int)temp2); 5308 da_new = temp + temp2; 5309 while (da_new > da_old) { 5310 if (temp) { 5311 temp--; 5312 da_new--; 5313 xfs_bmbt_set_startblock(ep, 5314 nullstartblock((int)temp)); 5315 } 5316 if (da_new == da_old) 5317 break; 5318 if (temp2) { 5319 temp2--; 5320 da_new--; 5321 new.br_startblock = 5322 nullstartblock((int)temp2); 5323 } 5324 } 5325 } 5326 trace_xfs_bmap_post_update(ip, eidx, state, _THIS_IP_); 5327 xfs_iext_insert(ip, eidx + 1, 1, &new, state); 5328 ++eidx; 5329 break; 5330 } 5331 5332 /* 5333 * Account for change in delayed indirect blocks. 5334 * Nothing to do for disk quota accounting here. 5335 */ 5336 ASSERT(da_old >= da_new); 5337 if (da_old > da_new) 5338 xfs_mod_fdblocks(mp, (int64_t)(da_old - da_new), false); 5339 5340 return error; 5341 } 5342 5343 /* 5344 * Unmap (remove) blocks from a file. 5345 * If nexts is nonzero then the number of extents to remove is limited to 5346 * that value. If not all extents in the block range can be removed then 5347 * *done is set. 5348 */ 5349 int /* error */ 5350 __xfs_bunmapi( 5351 xfs_trans_t *tp, /* transaction pointer */ 5352 struct xfs_inode *ip, /* incore inode */ 5353 xfs_fileoff_t bno, /* starting offset to unmap */ 5354 xfs_filblks_t *rlen, /* i/o: amount remaining */ 5355 int flags, /* misc flags */ 5356 xfs_extnum_t nexts, /* number of extents max */ 5357 xfs_fsblock_t *firstblock, /* first allocated block 5358 controls a.g. for allocs */ 5359 struct xfs_defer_ops *dfops) /* i/o: deferred updates */ 5360 { 5361 xfs_btree_cur_t *cur; /* bmap btree cursor */ 5362 xfs_bmbt_irec_t del; /* extent being deleted */ 5363 int eof; /* is deleting at eof */ 5364 xfs_bmbt_rec_host_t *ep; /* extent record pointer */ 5365 int error; /* error return value */ 5366 xfs_extnum_t extno; /* extent number in list */ 5367 xfs_bmbt_irec_t got; /* current extent record */ 5368 xfs_ifork_t *ifp; /* inode fork pointer */ 5369 int isrt; /* freeing in rt area */ 5370 xfs_extnum_t lastx; /* last extent index used */ 5371 int logflags; /* transaction logging flags */ 5372 xfs_extlen_t mod; /* rt extent offset */ 5373 xfs_mount_t *mp; /* mount structure */ 5374 xfs_extnum_t nextents; /* number of file extents */ 5375 xfs_bmbt_irec_t prev; /* previous extent record */ 5376 xfs_fileoff_t start; /* first file offset deleted */ 5377 int tmp_logflags; /* partial logging flags */ 5378 int wasdel; /* was a delayed alloc extent */ 5379 int whichfork; /* data or attribute fork */ 5380 xfs_fsblock_t sum; 5381 xfs_filblks_t len = *rlen; /* length to unmap in file */ 5382 5383 trace_xfs_bunmap(ip, bno, len, flags, _RET_IP_); 5384 5385 whichfork = xfs_bmapi_whichfork(flags); 5386 ASSERT(whichfork != XFS_COW_FORK); 5387 ifp = XFS_IFORK_PTR(ip, whichfork); 5388 if (unlikely( 5389 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && 5390 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)) { 5391 XFS_ERROR_REPORT("xfs_bunmapi", XFS_ERRLEVEL_LOW, 5392 ip->i_mount); 5393 return -EFSCORRUPTED; 5394 } 5395 mp = ip->i_mount; 5396 if (XFS_FORCED_SHUTDOWN(mp)) 5397 return -EIO; 5398 5399 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL)); 5400 ASSERT(len > 0); 5401 ASSERT(nexts >= 0); 5402 5403 if (!(ifp->if_flags & XFS_IFEXTENTS) && 5404 (error = xfs_iread_extents(tp, ip, whichfork))) 5405 return error; 5406 nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t); 5407 if (nextents == 0) { 5408 *rlen = 0; 5409 return 0; 5410 } 5411 XFS_STATS_INC(mp, xs_blk_unmap); 5412 isrt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip); 5413 start = bno; 5414 bno = start + len - 1; 5415 ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got, 5416 &prev); 5417 5418 /* 5419 * Check to see if the given block number is past the end of the 5420 * file, back up to the last block if so... 5421 */ 5422 if (eof) { 5423 ep = xfs_iext_get_ext(ifp, --lastx); 5424 xfs_bmbt_get_all(ep, &got); 5425 bno = got.br_startoff + got.br_blockcount - 1; 5426 } 5427 logflags = 0; 5428 if (ifp->if_flags & XFS_IFBROOT) { 5429 ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE); 5430 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork); 5431 cur->bc_private.b.firstblock = *firstblock; 5432 cur->bc_private.b.dfops = dfops; 5433 cur->bc_private.b.flags = 0; 5434 } else 5435 cur = NULL; 5436 5437 if (isrt) { 5438 /* 5439 * Synchronize by locking the bitmap inode. 5440 */ 5441 xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL|XFS_ILOCK_RTBITMAP); 5442 xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL); 5443 xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL|XFS_ILOCK_RTSUM); 5444 xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL); 5445 } 5446 5447 extno = 0; 5448 while (bno != (xfs_fileoff_t)-1 && bno >= start && lastx >= 0 && 5449 (nexts == 0 || extno < nexts)) { 5450 /* 5451 * Is the found extent after a hole in which bno lives? 5452 * Just back up to the previous extent, if so. 5453 */ 5454 if (got.br_startoff > bno) { 5455 if (--lastx < 0) 5456 break; 5457 ep = xfs_iext_get_ext(ifp, lastx); 5458 xfs_bmbt_get_all(ep, &got); 5459 } 5460 /* 5461 * Is the last block of this extent before the range 5462 * we're supposed to delete? If so, we're done. 5463 */ 5464 bno = XFS_FILEOFF_MIN(bno, 5465 got.br_startoff + got.br_blockcount - 1); 5466 if (bno < start) 5467 break; 5468 /* 5469 * Then deal with the (possibly delayed) allocated space 5470 * we found. 5471 */ 5472 ASSERT(ep != NULL); 5473 del = got; 5474 wasdel = isnullstartblock(del.br_startblock); 5475 if (got.br_startoff < start) { 5476 del.br_startoff = start; 5477 del.br_blockcount -= start - got.br_startoff; 5478 if (!wasdel) 5479 del.br_startblock += start - got.br_startoff; 5480 } 5481 if (del.br_startoff + del.br_blockcount > bno + 1) 5482 del.br_blockcount = bno + 1 - del.br_startoff; 5483 sum = del.br_startblock + del.br_blockcount; 5484 if (isrt && 5485 (mod = do_mod(sum, mp->m_sb.sb_rextsize))) { 5486 /* 5487 * Realtime extent not lined up at the end. 5488 * The extent could have been split into written 5489 * and unwritten pieces, or we could just be 5490 * unmapping part of it. But we can't really 5491 * get rid of part of a realtime extent. 5492 */ 5493 if (del.br_state == XFS_EXT_UNWRITTEN || 5494 !xfs_sb_version_hasextflgbit(&mp->m_sb)) { 5495 /* 5496 * This piece is unwritten, or we're not 5497 * using unwritten extents. Skip over it. 5498 */ 5499 ASSERT(bno >= mod); 5500 bno -= mod > del.br_blockcount ? 5501 del.br_blockcount : mod; 5502 if (bno < got.br_startoff) { 5503 if (--lastx >= 0) 5504 xfs_bmbt_get_all(xfs_iext_get_ext( 5505 ifp, lastx), &got); 5506 } 5507 continue; 5508 } 5509 /* 5510 * It's written, turn it unwritten. 5511 * This is better than zeroing it. 5512 */ 5513 ASSERT(del.br_state == XFS_EXT_NORM); 5514 ASSERT(tp->t_blk_res > 0); 5515 /* 5516 * If this spans a realtime extent boundary, 5517 * chop it back to the start of the one we end at. 5518 */ 5519 if (del.br_blockcount > mod) { 5520 del.br_startoff += del.br_blockcount - mod; 5521 del.br_startblock += del.br_blockcount - mod; 5522 del.br_blockcount = mod; 5523 } 5524 del.br_state = XFS_EXT_UNWRITTEN; 5525 error = xfs_bmap_add_extent_unwritten_real(tp, ip, 5526 &lastx, &cur, &del, firstblock, dfops, 5527 &logflags); 5528 if (error) 5529 goto error0; 5530 goto nodelete; 5531 } 5532 if (isrt && (mod = do_mod(del.br_startblock, mp->m_sb.sb_rextsize))) { 5533 /* 5534 * Realtime extent is lined up at the end but not 5535 * at the front. We'll get rid of full extents if 5536 * we can. 5537 */ 5538 mod = mp->m_sb.sb_rextsize - mod; 5539 if (del.br_blockcount > mod) { 5540 del.br_blockcount -= mod; 5541 del.br_startoff += mod; 5542 del.br_startblock += mod; 5543 } else if ((del.br_startoff == start && 5544 (del.br_state == XFS_EXT_UNWRITTEN || 5545 tp->t_blk_res == 0)) || 5546 !xfs_sb_version_hasextflgbit(&mp->m_sb)) { 5547 /* 5548 * Can't make it unwritten. There isn't 5549 * a full extent here so just skip it. 5550 */ 5551 ASSERT(bno >= del.br_blockcount); 5552 bno -= del.br_blockcount; 5553 if (got.br_startoff > bno) { 5554 if (--lastx >= 0) { 5555 ep = xfs_iext_get_ext(ifp, 5556 lastx); 5557 xfs_bmbt_get_all(ep, &got); 5558 } 5559 } 5560 continue; 5561 } else if (del.br_state == XFS_EXT_UNWRITTEN) { 5562 /* 5563 * This one is already unwritten. 5564 * It must have a written left neighbor. 5565 * Unwrite the killed part of that one and 5566 * try again. 5567 */ 5568 ASSERT(lastx > 0); 5569 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, 5570 lastx - 1), &prev); 5571 ASSERT(prev.br_state == XFS_EXT_NORM); 5572 ASSERT(!isnullstartblock(prev.br_startblock)); 5573 ASSERT(del.br_startblock == 5574 prev.br_startblock + prev.br_blockcount); 5575 if (prev.br_startoff < start) { 5576 mod = start - prev.br_startoff; 5577 prev.br_blockcount -= mod; 5578 prev.br_startblock += mod; 5579 prev.br_startoff = start; 5580 } 5581 prev.br_state = XFS_EXT_UNWRITTEN; 5582 lastx--; 5583 error = xfs_bmap_add_extent_unwritten_real(tp, 5584 ip, &lastx, &cur, &prev, 5585 firstblock, dfops, &logflags); 5586 if (error) 5587 goto error0; 5588 goto nodelete; 5589 } else { 5590 ASSERT(del.br_state == XFS_EXT_NORM); 5591 del.br_state = XFS_EXT_UNWRITTEN; 5592 error = xfs_bmap_add_extent_unwritten_real(tp, 5593 ip, &lastx, &cur, &del, 5594 firstblock, dfops, &logflags); 5595 if (error) 5596 goto error0; 5597 goto nodelete; 5598 } 5599 } 5600 5601 /* 5602 * If it's the case where the directory code is running 5603 * with no block reservation, and the deleted block is in 5604 * the middle of its extent, and the resulting insert 5605 * of an extent would cause transformation to btree format, 5606 * then reject it. The calling code will then swap 5607 * blocks around instead. 5608 * We have to do this now, rather than waiting for the 5609 * conversion to btree format, since the transaction 5610 * will be dirty. 5611 */ 5612 if (!wasdel && tp->t_blk_res == 0 && 5613 XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS && 5614 XFS_IFORK_NEXTENTS(ip, whichfork) >= /* Note the >= */ 5615 XFS_IFORK_MAXEXT(ip, whichfork) && 5616 del.br_startoff > got.br_startoff && 5617 del.br_startoff + del.br_blockcount < 5618 got.br_startoff + got.br_blockcount) { 5619 error = -ENOSPC; 5620 goto error0; 5621 } 5622 5623 /* 5624 * Unreserve quota and update realtime free space, if 5625 * appropriate. If delayed allocation, update the inode delalloc 5626 * counter now and wait to update the sb counters as 5627 * xfs_bmap_del_extent() might need to borrow some blocks. 5628 */ 5629 if (wasdel) { 5630 ASSERT(startblockval(del.br_startblock) > 0); 5631 if (isrt) { 5632 xfs_filblks_t rtexts; 5633 5634 rtexts = XFS_FSB_TO_B(mp, del.br_blockcount); 5635 do_div(rtexts, mp->m_sb.sb_rextsize); 5636 xfs_mod_frextents(mp, (int64_t)rtexts); 5637 (void)xfs_trans_reserve_quota_nblks(NULL, 5638 ip, -((long)del.br_blockcount), 0, 5639 XFS_QMOPT_RES_RTBLKS); 5640 } else { 5641 (void)xfs_trans_reserve_quota_nblks(NULL, 5642 ip, -((long)del.br_blockcount), 0, 5643 XFS_QMOPT_RES_REGBLKS); 5644 } 5645 ip->i_delayed_blks -= del.br_blockcount; 5646 if (cur) 5647 cur->bc_private.b.flags |= 5648 XFS_BTCUR_BPRV_WASDEL; 5649 } else if (cur) 5650 cur->bc_private.b.flags &= ~XFS_BTCUR_BPRV_WASDEL; 5651 5652 error = xfs_bmap_del_extent(ip, tp, &lastx, dfops, cur, &del, 5653 &tmp_logflags, whichfork, flags); 5654 logflags |= tmp_logflags; 5655 if (error) 5656 goto error0; 5657 5658 if (!isrt && wasdel) 5659 xfs_mod_fdblocks(mp, (int64_t)del.br_blockcount, false); 5660 5661 bno = del.br_startoff - 1; 5662 nodelete: 5663 /* 5664 * If not done go on to the next (previous) record. 5665 */ 5666 if (bno != (xfs_fileoff_t)-1 && bno >= start) { 5667 if (lastx >= 0) { 5668 ep = xfs_iext_get_ext(ifp, lastx); 5669 if (xfs_bmbt_get_startoff(ep) > bno) { 5670 if (--lastx >= 0) 5671 ep = xfs_iext_get_ext(ifp, 5672 lastx); 5673 } 5674 xfs_bmbt_get_all(ep, &got); 5675 } 5676 extno++; 5677 } 5678 } 5679 if (bno == (xfs_fileoff_t)-1 || bno < start || lastx < 0) 5680 *rlen = 0; 5681 else 5682 *rlen = bno - start + 1; 5683 5684 /* 5685 * Convert to a btree if necessary. 5686 */ 5687 if (xfs_bmap_needs_btree(ip, whichfork)) { 5688 ASSERT(cur == NULL); 5689 error = xfs_bmap_extents_to_btree(tp, ip, firstblock, dfops, 5690 &cur, 0, &tmp_logflags, whichfork); 5691 logflags |= tmp_logflags; 5692 if (error) 5693 goto error0; 5694 } 5695 /* 5696 * transform from btree to extents, give it cur 5697 */ 5698 else if (xfs_bmap_wants_extents(ip, whichfork)) { 5699 ASSERT(cur != NULL); 5700 error = xfs_bmap_btree_to_extents(tp, ip, cur, &tmp_logflags, 5701 whichfork); 5702 logflags |= tmp_logflags; 5703 if (error) 5704 goto error0; 5705 } 5706 /* 5707 * transform from extents to local? 5708 */ 5709 error = 0; 5710 error0: 5711 /* 5712 * Log everything. Do this after conversion, there's no point in 5713 * logging the extent records if we've converted to btree format. 5714 */ 5715 if ((logflags & xfs_ilog_fext(whichfork)) && 5716 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS) 5717 logflags &= ~xfs_ilog_fext(whichfork); 5718 else if ((logflags & xfs_ilog_fbroot(whichfork)) && 5719 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) 5720 logflags &= ~xfs_ilog_fbroot(whichfork); 5721 /* 5722 * Log inode even in the error case, if the transaction 5723 * is dirty we'll need to shut down the filesystem. 5724 */ 5725 if (logflags) 5726 xfs_trans_log_inode(tp, ip, logflags); 5727 if (cur) { 5728 if (!error) { 5729 *firstblock = cur->bc_private.b.firstblock; 5730 cur->bc_private.b.allocated = 0; 5731 } 5732 xfs_btree_del_cursor(cur, 5733 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); 5734 } 5735 return error; 5736 } 5737 5738 /* Unmap a range of a file. */ 5739 int 5740 xfs_bunmapi( 5741 xfs_trans_t *tp, 5742 struct xfs_inode *ip, 5743 xfs_fileoff_t bno, 5744 xfs_filblks_t len, 5745 int flags, 5746 xfs_extnum_t nexts, 5747 xfs_fsblock_t *firstblock, 5748 struct xfs_defer_ops *dfops, 5749 int *done) 5750 { 5751 int error; 5752 5753 error = __xfs_bunmapi(tp, ip, bno, &len, flags, nexts, firstblock, 5754 dfops); 5755 *done = (len == 0); 5756 return error; 5757 } 5758 5759 /* 5760 * Determine whether an extent shift can be accomplished by a merge with the 5761 * extent that precedes the target hole of the shift. 5762 */ 5763 STATIC bool 5764 xfs_bmse_can_merge( 5765 struct xfs_bmbt_irec *left, /* preceding extent */ 5766 struct xfs_bmbt_irec *got, /* current extent to shift */ 5767 xfs_fileoff_t shift) /* shift fsb */ 5768 { 5769 xfs_fileoff_t startoff; 5770 5771 startoff = got->br_startoff - shift; 5772 5773 /* 5774 * The extent, once shifted, must be adjacent in-file and on-disk with 5775 * the preceding extent. 5776 */ 5777 if ((left->br_startoff + left->br_blockcount != startoff) || 5778 (left->br_startblock + left->br_blockcount != got->br_startblock) || 5779 (left->br_state != got->br_state) || 5780 (left->br_blockcount + got->br_blockcount > MAXEXTLEN)) 5781 return false; 5782 5783 return true; 5784 } 5785 5786 /* 5787 * A bmap extent shift adjusts the file offset of an extent to fill a preceding 5788 * hole in the file. If an extent shift would result in the extent being fully 5789 * adjacent to the extent that currently precedes the hole, we can merge with 5790 * the preceding extent rather than do the shift. 5791 * 5792 * This function assumes the caller has verified a shift-by-merge is possible 5793 * with the provided extents via xfs_bmse_can_merge(). 5794 */ 5795 STATIC int 5796 xfs_bmse_merge( 5797 struct xfs_inode *ip, 5798 int whichfork, 5799 xfs_fileoff_t shift, /* shift fsb */ 5800 int current_ext, /* idx of gotp */ 5801 struct xfs_bmbt_rec_host *gotp, /* extent to shift */ 5802 struct xfs_bmbt_rec_host *leftp, /* preceding extent */ 5803 struct xfs_btree_cur *cur, 5804 int *logflags) /* output */ 5805 { 5806 struct xfs_bmbt_irec got; 5807 struct xfs_bmbt_irec left; 5808 xfs_filblks_t blockcount; 5809 int error, i; 5810 struct xfs_mount *mp = ip->i_mount; 5811 5812 xfs_bmbt_get_all(gotp, &got); 5813 xfs_bmbt_get_all(leftp, &left); 5814 blockcount = left.br_blockcount + got.br_blockcount; 5815 5816 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL)); 5817 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL)); 5818 ASSERT(xfs_bmse_can_merge(&left, &got, shift)); 5819 5820 /* 5821 * Merge the in-core extents. Note that the host record pointers and 5822 * current_ext index are invalid once the extent has been removed via 5823 * xfs_iext_remove(). 5824 */ 5825 xfs_bmbt_set_blockcount(leftp, blockcount); 5826 xfs_iext_remove(ip, current_ext, 1, 0); 5827 5828 /* 5829 * Update the on-disk extent count, the btree if necessary and log the 5830 * inode. 5831 */ 5832 XFS_IFORK_NEXT_SET(ip, whichfork, 5833 XFS_IFORK_NEXTENTS(ip, whichfork) - 1); 5834 *logflags |= XFS_ILOG_CORE; 5835 if (!cur) { 5836 *logflags |= XFS_ILOG_DEXT; 5837 return 0; 5838 } 5839 5840 /* lookup and remove the extent to merge */ 5841 error = xfs_bmbt_lookup_eq(cur, got.br_startoff, got.br_startblock, 5842 got.br_blockcount, &i); 5843 if (error) 5844 return error; 5845 XFS_WANT_CORRUPTED_RETURN(mp, i == 1); 5846 5847 error = xfs_btree_delete(cur, &i); 5848 if (error) 5849 return error; 5850 XFS_WANT_CORRUPTED_RETURN(mp, i == 1); 5851 5852 /* lookup and update size of the previous extent */ 5853 error = xfs_bmbt_lookup_eq(cur, left.br_startoff, left.br_startblock, 5854 left.br_blockcount, &i); 5855 if (error) 5856 return error; 5857 XFS_WANT_CORRUPTED_RETURN(mp, i == 1); 5858 5859 left.br_blockcount = blockcount; 5860 5861 return xfs_bmbt_update(cur, left.br_startoff, left.br_startblock, 5862 left.br_blockcount, left.br_state); 5863 } 5864 5865 /* 5866 * Shift a single extent. 5867 */ 5868 STATIC int 5869 xfs_bmse_shift_one( 5870 struct xfs_inode *ip, 5871 int whichfork, 5872 xfs_fileoff_t offset_shift_fsb, 5873 int *current_ext, 5874 struct xfs_bmbt_rec_host *gotp, 5875 struct xfs_btree_cur *cur, 5876 int *logflags, 5877 enum shift_direction direction, 5878 struct xfs_defer_ops *dfops) 5879 { 5880 struct xfs_ifork *ifp; 5881 struct xfs_mount *mp; 5882 xfs_fileoff_t startoff; 5883 struct xfs_bmbt_rec_host *adj_irecp; 5884 struct xfs_bmbt_irec got; 5885 struct xfs_bmbt_irec adj_irec; 5886 int error; 5887 int i; 5888 int total_extents; 5889 5890 mp = ip->i_mount; 5891 ifp = XFS_IFORK_PTR(ip, whichfork); 5892 total_extents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t); 5893 5894 xfs_bmbt_get_all(gotp, &got); 5895 5896 /* delalloc extents should be prevented by caller */ 5897 XFS_WANT_CORRUPTED_RETURN(mp, !isnullstartblock(got.br_startblock)); 5898 5899 if (direction == SHIFT_LEFT) { 5900 startoff = got.br_startoff - offset_shift_fsb; 5901 5902 /* 5903 * Check for merge if we've got an extent to the left, 5904 * otherwise make sure there's enough room at the start 5905 * of the file for the shift. 5906 */ 5907 if (!*current_ext) { 5908 if (got.br_startoff < offset_shift_fsb) 5909 return -EINVAL; 5910 goto update_current_ext; 5911 } 5912 /* 5913 * grab the left extent and check for a large 5914 * enough hole. 5915 */ 5916 adj_irecp = xfs_iext_get_ext(ifp, *current_ext - 1); 5917 xfs_bmbt_get_all(adj_irecp, &adj_irec); 5918 5919 if (startoff < 5920 adj_irec.br_startoff + adj_irec.br_blockcount) 5921 return -EINVAL; 5922 5923 /* check whether to merge the extent or shift it down */ 5924 if (xfs_bmse_can_merge(&adj_irec, &got, 5925 offset_shift_fsb)) { 5926 error = xfs_bmse_merge(ip, whichfork, offset_shift_fsb, 5927 *current_ext, gotp, adj_irecp, 5928 cur, logflags); 5929 if (error) 5930 return error; 5931 adj_irec = got; 5932 goto update_rmap; 5933 } 5934 } else { 5935 startoff = got.br_startoff + offset_shift_fsb; 5936 /* nothing to move if this is the last extent */ 5937 if (*current_ext >= (total_extents - 1)) 5938 goto update_current_ext; 5939 /* 5940 * If this is not the last extent in the file, make sure there 5941 * is enough room between current extent and next extent for 5942 * accommodating the shift. 5943 */ 5944 adj_irecp = xfs_iext_get_ext(ifp, *current_ext + 1); 5945 xfs_bmbt_get_all(adj_irecp, &adj_irec); 5946 if (startoff + got.br_blockcount > adj_irec.br_startoff) 5947 return -EINVAL; 5948 /* 5949 * Unlike a left shift (which involves a hole punch), 5950 * a right shift does not modify extent neighbors 5951 * in any way. We should never find mergeable extents 5952 * in this scenario. Check anyways and warn if we 5953 * encounter two extents that could be one. 5954 */ 5955 if (xfs_bmse_can_merge(&got, &adj_irec, offset_shift_fsb)) 5956 WARN_ON_ONCE(1); 5957 } 5958 /* 5959 * Increment the extent index for the next iteration, update the start 5960 * offset of the in-core extent and update the btree if applicable. 5961 */ 5962 update_current_ext: 5963 if (direction == SHIFT_LEFT) 5964 (*current_ext)++; 5965 else 5966 (*current_ext)--; 5967 xfs_bmbt_set_startoff(gotp, startoff); 5968 *logflags |= XFS_ILOG_CORE; 5969 adj_irec = got; 5970 if (!cur) { 5971 *logflags |= XFS_ILOG_DEXT; 5972 goto update_rmap; 5973 } 5974 5975 error = xfs_bmbt_lookup_eq(cur, got.br_startoff, got.br_startblock, 5976 got.br_blockcount, &i); 5977 if (error) 5978 return error; 5979 XFS_WANT_CORRUPTED_RETURN(mp, i == 1); 5980 5981 got.br_startoff = startoff; 5982 error = xfs_bmbt_update(cur, got.br_startoff, got.br_startblock, 5983 got.br_blockcount, got.br_state); 5984 if (error) 5985 return error; 5986 5987 update_rmap: 5988 /* update reverse mapping */ 5989 error = xfs_rmap_unmap_extent(mp, dfops, ip, whichfork, &adj_irec); 5990 if (error) 5991 return error; 5992 adj_irec.br_startoff = startoff; 5993 return xfs_rmap_map_extent(mp, dfops, ip, whichfork, &adj_irec); 5994 } 5995 5996 /* 5997 * Shift extent records to the left/right to cover/create a hole. 5998 * 5999 * The maximum number of extents to be shifted in a single operation is 6000 * @num_exts. @stop_fsb specifies the file offset at which to stop shift and the 6001 * file offset where we've left off is returned in @next_fsb. @offset_shift_fsb 6002 * is the length by which each extent is shifted. If there is no hole to shift 6003 * the extents into, this will be considered invalid operation and we abort 6004 * immediately. 6005 */ 6006 int 6007 xfs_bmap_shift_extents( 6008 struct xfs_trans *tp, 6009 struct xfs_inode *ip, 6010 xfs_fileoff_t *next_fsb, 6011 xfs_fileoff_t offset_shift_fsb, 6012 int *done, 6013 xfs_fileoff_t stop_fsb, 6014 xfs_fsblock_t *firstblock, 6015 struct xfs_defer_ops *dfops, 6016 enum shift_direction direction, 6017 int num_exts) 6018 { 6019 struct xfs_btree_cur *cur = NULL; 6020 struct xfs_bmbt_rec_host *gotp; 6021 struct xfs_bmbt_irec got; 6022 struct xfs_mount *mp = ip->i_mount; 6023 struct xfs_ifork *ifp; 6024 xfs_extnum_t nexts = 0; 6025 xfs_extnum_t current_ext; 6026 xfs_extnum_t total_extents; 6027 xfs_extnum_t stop_extent; 6028 int error = 0; 6029 int whichfork = XFS_DATA_FORK; 6030 int logflags = 0; 6031 6032 if (unlikely(XFS_TEST_ERROR( 6033 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && 6034 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE), 6035 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) { 6036 XFS_ERROR_REPORT("xfs_bmap_shift_extents", 6037 XFS_ERRLEVEL_LOW, mp); 6038 return -EFSCORRUPTED; 6039 } 6040 6041 if (XFS_FORCED_SHUTDOWN(mp)) 6042 return -EIO; 6043 6044 ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL)); 6045 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL)); 6046 ASSERT(direction == SHIFT_LEFT || direction == SHIFT_RIGHT); 6047 ASSERT(*next_fsb != NULLFSBLOCK || direction == SHIFT_RIGHT); 6048 6049 ifp = XFS_IFORK_PTR(ip, whichfork); 6050 if (!(ifp->if_flags & XFS_IFEXTENTS)) { 6051 /* Read in all the extents */ 6052 error = xfs_iread_extents(tp, ip, whichfork); 6053 if (error) 6054 return error; 6055 } 6056 6057 if (ifp->if_flags & XFS_IFBROOT) { 6058 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork); 6059 cur->bc_private.b.firstblock = *firstblock; 6060 cur->bc_private.b.dfops = dfops; 6061 cur->bc_private.b.flags = 0; 6062 } 6063 6064 /* 6065 * There may be delalloc extents in the data fork before the range we 6066 * are collapsing out, so we cannot use the count of real extents here. 6067 * Instead we have to calculate it from the incore fork. 6068 */ 6069 total_extents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t); 6070 if (total_extents == 0) { 6071 *done = 1; 6072 goto del_cursor; 6073 } 6074 6075 /* 6076 * In case of first right shift, we need to initialize next_fsb 6077 */ 6078 if (*next_fsb == NULLFSBLOCK) { 6079 gotp = xfs_iext_get_ext(ifp, total_extents - 1); 6080 xfs_bmbt_get_all(gotp, &got); 6081 *next_fsb = got.br_startoff; 6082 if (stop_fsb > *next_fsb) { 6083 *done = 1; 6084 goto del_cursor; 6085 } 6086 } 6087 6088 /* Lookup the extent index at which we have to stop */ 6089 if (direction == SHIFT_RIGHT) { 6090 gotp = xfs_iext_bno_to_ext(ifp, stop_fsb, &stop_extent); 6091 /* Make stop_extent exclusive of shift range */ 6092 stop_extent--; 6093 } else 6094 stop_extent = total_extents; 6095 6096 /* 6097 * Look up the extent index for the fsb where we start shifting. We can 6098 * henceforth iterate with current_ext as extent list changes are locked 6099 * out via ilock. 6100 * 6101 * gotp can be null in 2 cases: 1) if there are no extents or 2) 6102 * *next_fsb lies in a hole beyond which there are no extents. Either 6103 * way, we are done. 6104 */ 6105 gotp = xfs_iext_bno_to_ext(ifp, *next_fsb, ¤t_ext); 6106 if (!gotp) { 6107 *done = 1; 6108 goto del_cursor; 6109 } 6110 6111 /* some sanity checking before we finally start shifting extents */ 6112 if ((direction == SHIFT_LEFT && current_ext >= stop_extent) || 6113 (direction == SHIFT_RIGHT && current_ext <= stop_extent)) { 6114 error = -EIO; 6115 goto del_cursor; 6116 } 6117 6118 while (nexts++ < num_exts) { 6119 error = xfs_bmse_shift_one(ip, whichfork, offset_shift_fsb, 6120 ¤t_ext, gotp, cur, &logflags, 6121 direction, dfops); 6122 if (error) 6123 goto del_cursor; 6124 /* 6125 * If there was an extent merge during the shift, the extent 6126 * count can change. Update the total and grade the next record. 6127 */ 6128 if (direction == SHIFT_LEFT) { 6129 total_extents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t); 6130 stop_extent = total_extents; 6131 } 6132 6133 if (current_ext == stop_extent) { 6134 *done = 1; 6135 *next_fsb = NULLFSBLOCK; 6136 break; 6137 } 6138 gotp = xfs_iext_get_ext(ifp, current_ext); 6139 } 6140 6141 if (!*done) { 6142 xfs_bmbt_get_all(gotp, &got); 6143 *next_fsb = got.br_startoff; 6144 } 6145 6146 del_cursor: 6147 if (cur) 6148 xfs_btree_del_cursor(cur, 6149 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); 6150 6151 if (logflags) 6152 xfs_trans_log_inode(tp, ip, logflags); 6153 6154 return error; 6155 } 6156 6157 /* 6158 * Splits an extent into two extents at split_fsb block such that it is 6159 * the first block of the current_ext. @current_ext is a target extent 6160 * to be split. @split_fsb is a block where the extents is split. 6161 * If split_fsb lies in a hole or the first block of extents, just return 0. 6162 */ 6163 STATIC int 6164 xfs_bmap_split_extent_at( 6165 struct xfs_trans *tp, 6166 struct xfs_inode *ip, 6167 xfs_fileoff_t split_fsb, 6168 xfs_fsblock_t *firstfsb, 6169 struct xfs_defer_ops *dfops) 6170 { 6171 int whichfork = XFS_DATA_FORK; 6172 struct xfs_btree_cur *cur = NULL; 6173 struct xfs_bmbt_rec_host *gotp; 6174 struct xfs_bmbt_irec got; 6175 struct xfs_bmbt_irec new; /* split extent */ 6176 struct xfs_mount *mp = ip->i_mount; 6177 struct xfs_ifork *ifp; 6178 xfs_fsblock_t gotblkcnt; /* new block count for got */ 6179 xfs_extnum_t current_ext; 6180 int error = 0; 6181 int logflags = 0; 6182 int i = 0; 6183 6184 if (unlikely(XFS_TEST_ERROR( 6185 (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && 6186 XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE), 6187 mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) { 6188 XFS_ERROR_REPORT("xfs_bmap_split_extent_at", 6189 XFS_ERRLEVEL_LOW, mp); 6190 return -EFSCORRUPTED; 6191 } 6192 6193 if (XFS_FORCED_SHUTDOWN(mp)) 6194 return -EIO; 6195 6196 ifp = XFS_IFORK_PTR(ip, whichfork); 6197 if (!(ifp->if_flags & XFS_IFEXTENTS)) { 6198 /* Read in all the extents */ 6199 error = xfs_iread_extents(tp, ip, whichfork); 6200 if (error) 6201 return error; 6202 } 6203 6204 /* 6205 * gotp can be null in 2 cases: 1) if there are no extents 6206 * or 2) split_fsb lies in a hole beyond which there are 6207 * no extents. Either way, we are done. 6208 */ 6209 gotp = xfs_iext_bno_to_ext(ifp, split_fsb, ¤t_ext); 6210 if (!gotp) 6211 return 0; 6212 6213 xfs_bmbt_get_all(gotp, &got); 6214 6215 /* 6216 * Check split_fsb lies in a hole or the start boundary offset 6217 * of the extent. 6218 */ 6219 if (got.br_startoff >= split_fsb) 6220 return 0; 6221 6222 gotblkcnt = split_fsb - got.br_startoff; 6223 new.br_startoff = split_fsb; 6224 new.br_startblock = got.br_startblock + gotblkcnt; 6225 new.br_blockcount = got.br_blockcount - gotblkcnt; 6226 new.br_state = got.br_state; 6227 6228 if (ifp->if_flags & XFS_IFBROOT) { 6229 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork); 6230 cur->bc_private.b.firstblock = *firstfsb; 6231 cur->bc_private.b.dfops = dfops; 6232 cur->bc_private.b.flags = 0; 6233 error = xfs_bmbt_lookup_eq(cur, got.br_startoff, 6234 got.br_startblock, 6235 got.br_blockcount, 6236 &i); 6237 if (error) 6238 goto del_cursor; 6239 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, del_cursor); 6240 } 6241 6242 xfs_bmbt_set_blockcount(gotp, gotblkcnt); 6243 got.br_blockcount = gotblkcnt; 6244 6245 logflags = XFS_ILOG_CORE; 6246 if (cur) { 6247 error = xfs_bmbt_update(cur, got.br_startoff, 6248 got.br_startblock, 6249 got.br_blockcount, 6250 got.br_state); 6251 if (error) 6252 goto del_cursor; 6253 } else 6254 logflags |= XFS_ILOG_DEXT; 6255 6256 /* Add new extent */ 6257 current_ext++; 6258 xfs_iext_insert(ip, current_ext, 1, &new, 0); 6259 XFS_IFORK_NEXT_SET(ip, whichfork, 6260 XFS_IFORK_NEXTENTS(ip, whichfork) + 1); 6261 6262 if (cur) { 6263 error = xfs_bmbt_lookup_eq(cur, new.br_startoff, 6264 new.br_startblock, new.br_blockcount, 6265 &i); 6266 if (error) 6267 goto del_cursor; 6268 XFS_WANT_CORRUPTED_GOTO(mp, i == 0, del_cursor); 6269 cur->bc_rec.b.br_state = new.br_state; 6270 6271 error = xfs_btree_insert(cur, &i); 6272 if (error) 6273 goto del_cursor; 6274 XFS_WANT_CORRUPTED_GOTO(mp, i == 1, del_cursor); 6275 } 6276 6277 /* 6278 * Convert to a btree if necessary. 6279 */ 6280 if (xfs_bmap_needs_btree(ip, whichfork)) { 6281 int tmp_logflags; /* partial log flag return val */ 6282 6283 ASSERT(cur == NULL); 6284 error = xfs_bmap_extents_to_btree(tp, ip, firstfsb, dfops, 6285 &cur, 0, &tmp_logflags, whichfork); 6286 logflags |= tmp_logflags; 6287 } 6288 6289 del_cursor: 6290 if (cur) { 6291 cur->bc_private.b.allocated = 0; 6292 xfs_btree_del_cursor(cur, 6293 error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); 6294 } 6295 6296 if (logflags) 6297 xfs_trans_log_inode(tp, ip, logflags); 6298 return error; 6299 } 6300 6301 int 6302 xfs_bmap_split_extent( 6303 struct xfs_inode *ip, 6304 xfs_fileoff_t split_fsb) 6305 { 6306 struct xfs_mount *mp = ip->i_mount; 6307 struct xfs_trans *tp; 6308 struct xfs_defer_ops dfops; 6309 xfs_fsblock_t firstfsb; 6310 int error; 6311 6312 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_write, 6313 XFS_DIOSTRAT_SPACE_RES(mp, 0), 0, 0, &tp); 6314 if (error) 6315 return error; 6316 6317 xfs_ilock(ip, XFS_ILOCK_EXCL); 6318 xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL); 6319 6320 xfs_defer_init(&dfops, &firstfsb); 6321 6322 error = xfs_bmap_split_extent_at(tp, ip, split_fsb, 6323 &firstfsb, &dfops); 6324 if (error) 6325 goto out; 6326 6327 error = xfs_defer_finish(&tp, &dfops, NULL); 6328 if (error) 6329 goto out; 6330 6331 return xfs_trans_commit(tp); 6332 6333 out: 6334 xfs_defer_cancel(&dfops); 6335 xfs_trans_cancel(tp); 6336 return error; 6337 } 6338 6339 /* Deferred mapping is only for real extents in the data fork. */ 6340 static bool 6341 xfs_bmap_is_update_needed( 6342 struct xfs_bmbt_irec *bmap) 6343 { 6344 return bmap->br_startblock != HOLESTARTBLOCK && 6345 bmap->br_startblock != DELAYSTARTBLOCK; 6346 } 6347 6348 /* Record a bmap intent. */ 6349 static int 6350 __xfs_bmap_add( 6351 struct xfs_mount *mp, 6352 struct xfs_defer_ops *dfops, 6353 enum xfs_bmap_intent_type type, 6354 struct xfs_inode *ip, 6355 int whichfork, 6356 struct xfs_bmbt_irec *bmap) 6357 { 6358 int error; 6359 struct xfs_bmap_intent *bi; 6360 6361 trace_xfs_bmap_defer(mp, 6362 XFS_FSB_TO_AGNO(mp, bmap->br_startblock), 6363 type, 6364 XFS_FSB_TO_AGBNO(mp, bmap->br_startblock), 6365 ip->i_ino, whichfork, 6366 bmap->br_startoff, 6367 bmap->br_blockcount, 6368 bmap->br_state); 6369 6370 bi = kmem_alloc(sizeof(struct xfs_bmap_intent), KM_SLEEP | KM_NOFS); 6371 INIT_LIST_HEAD(&bi->bi_list); 6372 bi->bi_type = type; 6373 bi->bi_owner = ip; 6374 bi->bi_whichfork = whichfork; 6375 bi->bi_bmap = *bmap; 6376 6377 error = xfs_defer_join(dfops, bi->bi_owner); 6378 if (error) { 6379 kmem_free(bi); 6380 return error; 6381 } 6382 6383 xfs_defer_add(dfops, XFS_DEFER_OPS_TYPE_BMAP, &bi->bi_list); 6384 return 0; 6385 } 6386 6387 /* Map an extent into a file. */ 6388 int 6389 xfs_bmap_map_extent( 6390 struct xfs_mount *mp, 6391 struct xfs_defer_ops *dfops, 6392 struct xfs_inode *ip, 6393 struct xfs_bmbt_irec *PREV) 6394 { 6395 if (!xfs_bmap_is_update_needed(PREV)) 6396 return 0; 6397 6398 return __xfs_bmap_add(mp, dfops, XFS_BMAP_MAP, ip, 6399 XFS_DATA_FORK, PREV); 6400 } 6401 6402 /* Unmap an extent out of a file. */ 6403 int 6404 xfs_bmap_unmap_extent( 6405 struct xfs_mount *mp, 6406 struct xfs_defer_ops *dfops, 6407 struct xfs_inode *ip, 6408 struct xfs_bmbt_irec *PREV) 6409 { 6410 if (!xfs_bmap_is_update_needed(PREV)) 6411 return 0; 6412 6413 return __xfs_bmap_add(mp, dfops, XFS_BMAP_UNMAP, ip, 6414 XFS_DATA_FORK, PREV); 6415 } 6416 6417 /* 6418 * Process one of the deferred bmap operations. We pass back the 6419 * btree cursor to maintain our lock on the bmapbt between calls. 6420 */ 6421 int 6422 xfs_bmap_finish_one( 6423 struct xfs_trans *tp, 6424 struct xfs_defer_ops *dfops, 6425 struct xfs_inode *ip, 6426 enum xfs_bmap_intent_type type, 6427 int whichfork, 6428 xfs_fileoff_t startoff, 6429 xfs_fsblock_t startblock, 6430 xfs_filblks_t blockcount, 6431 xfs_exntst_t state) 6432 { 6433 struct xfs_bmbt_irec bmap; 6434 int nimaps = 1; 6435 xfs_fsblock_t firstfsb; 6436 int flags = XFS_BMAPI_REMAP; 6437 int done; 6438 int error = 0; 6439 6440 bmap.br_startblock = startblock; 6441 bmap.br_startoff = startoff; 6442 bmap.br_blockcount = blockcount; 6443 bmap.br_state = state; 6444 6445 trace_xfs_bmap_deferred(tp->t_mountp, 6446 XFS_FSB_TO_AGNO(tp->t_mountp, startblock), type, 6447 XFS_FSB_TO_AGBNO(tp->t_mountp, startblock), 6448 ip->i_ino, whichfork, startoff, blockcount, state); 6449 6450 if (whichfork != XFS_DATA_FORK && whichfork != XFS_ATTR_FORK) 6451 return -EFSCORRUPTED; 6452 if (whichfork == XFS_ATTR_FORK) 6453 flags |= XFS_BMAPI_ATTRFORK; 6454 6455 if (XFS_TEST_ERROR(false, tp->t_mountp, 6456 XFS_ERRTAG_BMAP_FINISH_ONE, 6457 XFS_RANDOM_BMAP_FINISH_ONE)) 6458 return -EIO; 6459 6460 switch (type) { 6461 case XFS_BMAP_MAP: 6462 firstfsb = bmap.br_startblock; 6463 error = xfs_bmapi_write(tp, ip, bmap.br_startoff, 6464 bmap.br_blockcount, flags, &firstfsb, 6465 bmap.br_blockcount, &bmap, &nimaps, 6466 dfops); 6467 break; 6468 case XFS_BMAP_UNMAP: 6469 error = xfs_bunmapi(tp, ip, bmap.br_startoff, 6470 bmap.br_blockcount, flags, 1, &firstfsb, 6471 dfops, &done); 6472 ASSERT(done); 6473 break; 6474 default: 6475 ASSERT(0); 6476 error = -EFSCORRUPTED; 6477 } 6478 6479 return error; 6480 } 6481