1 /* 2 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc. 3 * All Rights Reserved. 4 * 5 * This program is free software; you can redistribute it and/or 6 * modify it under the terms of the GNU General Public License as 7 * published by the Free Software Foundation. 8 * 9 * This program is distributed in the hope that it would be useful, 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 * GNU General Public License for more details. 13 * 14 * You should have received a copy of the GNU General Public License 15 * along with this program; if not, write the Free Software Foundation, 16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 17 */ 18 #include "xfs.h" 19 #include "xfs_fs.h" 20 #include "xfs_shared.h" 21 #include "xfs_format.h" 22 #include "xfs_log_format.h" 23 #include "xfs_trans_resv.h" 24 #include "xfs_bit.h" 25 #include "xfs_sb.h" 26 #include "xfs_ag.h" 27 #include "xfs_mount.h" 28 #include "xfs_inode.h" 29 #include "xfs_trans.h" 30 #include "xfs_inode_item.h" 31 #include "xfs_alloc.h" 32 #include "xfs_btree.h" 33 #include "xfs_bmap_btree.h" 34 #include "xfs_bmap.h" 35 #include "xfs_error.h" 36 #include "xfs_quota.h" 37 #include "xfs_trace.h" 38 #include "xfs_cksum.h" 39 #include "xfs_dinode.h" 40 41 /* 42 * Determine the extent state. 43 */ 44 /* ARGSUSED */ 45 STATIC xfs_exntst_t 46 xfs_extent_state( 47 xfs_filblks_t blks, 48 int extent_flag) 49 { 50 if (extent_flag) { 51 ASSERT(blks != 0); /* saved for DMIG */ 52 return XFS_EXT_UNWRITTEN; 53 } 54 return XFS_EXT_NORM; 55 } 56 57 /* 58 * Convert on-disk form of btree root to in-memory form. 59 */ 60 void 61 xfs_bmdr_to_bmbt( 62 struct xfs_inode *ip, 63 xfs_bmdr_block_t *dblock, 64 int dblocklen, 65 struct xfs_btree_block *rblock, 66 int rblocklen) 67 { 68 struct xfs_mount *mp = ip->i_mount; 69 int dmxr; 70 xfs_bmbt_key_t *fkp; 71 __be64 *fpp; 72 xfs_bmbt_key_t *tkp; 73 __be64 *tpp; 74 75 if (xfs_sb_version_hascrc(&mp->m_sb)) 76 xfs_btree_init_block_int(mp, rblock, XFS_BUF_DADDR_NULL, 77 XFS_BMAP_CRC_MAGIC, 0, 0, ip->i_ino, 78 XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS); 79 else 80 xfs_btree_init_block_int(mp, rblock, XFS_BUF_DADDR_NULL, 81 XFS_BMAP_MAGIC, 0, 0, ip->i_ino, 82 XFS_BTREE_LONG_PTRS); 83 84 rblock->bb_level = dblock->bb_level; 85 ASSERT(be16_to_cpu(rblock->bb_level) > 0); 86 rblock->bb_numrecs = dblock->bb_numrecs; 87 dmxr = xfs_bmdr_maxrecs(dblocklen, 0); 88 fkp = XFS_BMDR_KEY_ADDR(dblock, 1); 89 tkp = XFS_BMBT_KEY_ADDR(mp, rblock, 1); 90 fpp = XFS_BMDR_PTR_ADDR(dblock, 1, dmxr); 91 tpp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, rblocklen); 92 dmxr = be16_to_cpu(dblock->bb_numrecs); 93 memcpy(tkp, fkp, sizeof(*fkp) * dmxr); 94 memcpy(tpp, fpp, sizeof(*fpp) * dmxr); 95 } 96 97 /* 98 * Convert a compressed bmap extent record to an uncompressed form. 99 * This code must be in sync with the routines xfs_bmbt_get_startoff, 100 * xfs_bmbt_get_startblock, xfs_bmbt_get_blockcount and xfs_bmbt_get_state. 101 */ 102 STATIC void 103 __xfs_bmbt_get_all( 104 __uint64_t l0, 105 __uint64_t l1, 106 xfs_bmbt_irec_t *s) 107 { 108 int ext_flag; 109 xfs_exntst_t st; 110 111 ext_flag = (int)(l0 >> (64 - BMBT_EXNTFLAG_BITLEN)); 112 s->br_startoff = ((xfs_fileoff_t)l0 & 113 xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9; 114 s->br_startblock = (((xfs_fsblock_t)l0 & xfs_mask64lo(9)) << 43) | 115 (((xfs_fsblock_t)l1) >> 21); 116 s->br_blockcount = (xfs_filblks_t)(l1 & xfs_mask64lo(21)); 117 /* This is xfs_extent_state() in-line */ 118 if (ext_flag) { 119 ASSERT(s->br_blockcount != 0); /* saved for DMIG */ 120 st = XFS_EXT_UNWRITTEN; 121 } else 122 st = XFS_EXT_NORM; 123 s->br_state = st; 124 } 125 126 void 127 xfs_bmbt_get_all( 128 xfs_bmbt_rec_host_t *r, 129 xfs_bmbt_irec_t *s) 130 { 131 __xfs_bmbt_get_all(r->l0, r->l1, s); 132 } 133 134 /* 135 * Extract the blockcount field from an in memory bmap extent record. 136 */ 137 xfs_filblks_t 138 xfs_bmbt_get_blockcount( 139 xfs_bmbt_rec_host_t *r) 140 { 141 return (xfs_filblks_t)(r->l1 & xfs_mask64lo(21)); 142 } 143 144 /* 145 * Extract the startblock field from an in memory bmap extent record. 146 */ 147 xfs_fsblock_t 148 xfs_bmbt_get_startblock( 149 xfs_bmbt_rec_host_t *r) 150 { 151 return (((xfs_fsblock_t)r->l0 & xfs_mask64lo(9)) << 43) | 152 (((xfs_fsblock_t)r->l1) >> 21); 153 } 154 155 /* 156 * Extract the startoff field from an in memory bmap extent record. 157 */ 158 xfs_fileoff_t 159 xfs_bmbt_get_startoff( 160 xfs_bmbt_rec_host_t *r) 161 { 162 return ((xfs_fileoff_t)r->l0 & 163 xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9; 164 } 165 166 xfs_exntst_t 167 xfs_bmbt_get_state( 168 xfs_bmbt_rec_host_t *r) 169 { 170 int ext_flag; 171 172 ext_flag = (int)((r->l0) >> (64 - BMBT_EXNTFLAG_BITLEN)); 173 return xfs_extent_state(xfs_bmbt_get_blockcount(r), 174 ext_flag); 175 } 176 177 /* 178 * Extract the blockcount field from an on disk bmap extent record. 179 */ 180 xfs_filblks_t 181 xfs_bmbt_disk_get_blockcount( 182 xfs_bmbt_rec_t *r) 183 { 184 return (xfs_filblks_t)(be64_to_cpu(r->l1) & xfs_mask64lo(21)); 185 } 186 187 /* 188 * Extract the startoff field from a disk format bmap extent record. 189 */ 190 xfs_fileoff_t 191 xfs_bmbt_disk_get_startoff( 192 xfs_bmbt_rec_t *r) 193 { 194 return ((xfs_fileoff_t)be64_to_cpu(r->l0) & 195 xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9; 196 } 197 198 199 /* 200 * Set all the fields in a bmap extent record from the arguments. 201 */ 202 void 203 xfs_bmbt_set_allf( 204 xfs_bmbt_rec_host_t *r, 205 xfs_fileoff_t startoff, 206 xfs_fsblock_t startblock, 207 xfs_filblks_t blockcount, 208 xfs_exntst_t state) 209 { 210 int extent_flag = (state == XFS_EXT_NORM) ? 0 : 1; 211 212 ASSERT(state == XFS_EXT_NORM || state == XFS_EXT_UNWRITTEN); 213 ASSERT((startoff & xfs_mask64hi(64-BMBT_STARTOFF_BITLEN)) == 0); 214 ASSERT((blockcount & xfs_mask64hi(64-BMBT_BLOCKCOUNT_BITLEN)) == 0); 215 216 ASSERT((startblock & xfs_mask64hi(64-BMBT_STARTBLOCK_BITLEN)) == 0); 217 218 r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) | 219 ((xfs_bmbt_rec_base_t)startoff << 9) | 220 ((xfs_bmbt_rec_base_t)startblock >> 43); 221 r->l1 = ((xfs_bmbt_rec_base_t)startblock << 21) | 222 ((xfs_bmbt_rec_base_t)blockcount & 223 (xfs_bmbt_rec_base_t)xfs_mask64lo(21)); 224 } 225 226 /* 227 * Set all the fields in a bmap extent record from the uncompressed form. 228 */ 229 void 230 xfs_bmbt_set_all( 231 xfs_bmbt_rec_host_t *r, 232 xfs_bmbt_irec_t *s) 233 { 234 xfs_bmbt_set_allf(r, s->br_startoff, s->br_startblock, 235 s->br_blockcount, s->br_state); 236 } 237 238 239 /* 240 * Set all the fields in a disk format bmap extent record from the arguments. 241 */ 242 void 243 xfs_bmbt_disk_set_allf( 244 xfs_bmbt_rec_t *r, 245 xfs_fileoff_t startoff, 246 xfs_fsblock_t startblock, 247 xfs_filblks_t blockcount, 248 xfs_exntst_t state) 249 { 250 int extent_flag = (state == XFS_EXT_NORM) ? 0 : 1; 251 252 ASSERT(state == XFS_EXT_NORM || state == XFS_EXT_UNWRITTEN); 253 ASSERT((startoff & xfs_mask64hi(64-BMBT_STARTOFF_BITLEN)) == 0); 254 ASSERT((blockcount & xfs_mask64hi(64-BMBT_BLOCKCOUNT_BITLEN)) == 0); 255 ASSERT((startblock & xfs_mask64hi(64-BMBT_STARTBLOCK_BITLEN)) == 0); 256 257 r->l0 = cpu_to_be64( 258 ((xfs_bmbt_rec_base_t)extent_flag << 63) | 259 ((xfs_bmbt_rec_base_t)startoff << 9) | 260 ((xfs_bmbt_rec_base_t)startblock >> 43)); 261 r->l1 = cpu_to_be64( 262 ((xfs_bmbt_rec_base_t)startblock << 21) | 263 ((xfs_bmbt_rec_base_t)blockcount & 264 (xfs_bmbt_rec_base_t)xfs_mask64lo(21))); 265 } 266 267 /* 268 * Set all the fields in a bmap extent record from the uncompressed form. 269 */ 270 STATIC void 271 xfs_bmbt_disk_set_all( 272 xfs_bmbt_rec_t *r, 273 xfs_bmbt_irec_t *s) 274 { 275 xfs_bmbt_disk_set_allf(r, s->br_startoff, s->br_startblock, 276 s->br_blockcount, s->br_state); 277 } 278 279 /* 280 * Set the blockcount field in a bmap extent record. 281 */ 282 void 283 xfs_bmbt_set_blockcount( 284 xfs_bmbt_rec_host_t *r, 285 xfs_filblks_t v) 286 { 287 ASSERT((v & xfs_mask64hi(43)) == 0); 288 r->l1 = (r->l1 & (xfs_bmbt_rec_base_t)xfs_mask64hi(43)) | 289 (xfs_bmbt_rec_base_t)(v & xfs_mask64lo(21)); 290 } 291 292 /* 293 * Set the startblock field in a bmap extent record. 294 */ 295 void 296 xfs_bmbt_set_startblock( 297 xfs_bmbt_rec_host_t *r, 298 xfs_fsblock_t v) 299 { 300 ASSERT((v & xfs_mask64hi(12)) == 0); 301 r->l0 = (r->l0 & (xfs_bmbt_rec_base_t)xfs_mask64hi(55)) | 302 (xfs_bmbt_rec_base_t)(v >> 43); 303 r->l1 = (r->l1 & (xfs_bmbt_rec_base_t)xfs_mask64lo(21)) | 304 (xfs_bmbt_rec_base_t)(v << 21); 305 } 306 307 /* 308 * Set the startoff field in a bmap extent record. 309 */ 310 void 311 xfs_bmbt_set_startoff( 312 xfs_bmbt_rec_host_t *r, 313 xfs_fileoff_t v) 314 { 315 ASSERT((v & xfs_mask64hi(9)) == 0); 316 r->l0 = (r->l0 & (xfs_bmbt_rec_base_t) xfs_mask64hi(1)) | 317 ((xfs_bmbt_rec_base_t)v << 9) | 318 (r->l0 & (xfs_bmbt_rec_base_t)xfs_mask64lo(9)); 319 } 320 321 /* 322 * Set the extent state field in a bmap extent record. 323 */ 324 void 325 xfs_bmbt_set_state( 326 xfs_bmbt_rec_host_t *r, 327 xfs_exntst_t v) 328 { 329 ASSERT(v == XFS_EXT_NORM || v == XFS_EXT_UNWRITTEN); 330 if (v == XFS_EXT_NORM) 331 r->l0 &= xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN); 332 else 333 r->l0 |= xfs_mask64hi(BMBT_EXNTFLAG_BITLEN); 334 } 335 336 /* 337 * Convert in-memory form of btree root to on-disk form. 338 */ 339 void 340 xfs_bmbt_to_bmdr( 341 struct xfs_mount *mp, 342 struct xfs_btree_block *rblock, 343 int rblocklen, 344 xfs_bmdr_block_t *dblock, 345 int dblocklen) 346 { 347 int dmxr; 348 xfs_bmbt_key_t *fkp; 349 __be64 *fpp; 350 xfs_bmbt_key_t *tkp; 351 __be64 *tpp; 352 353 if (xfs_sb_version_hascrc(&mp->m_sb)) { 354 ASSERT(rblock->bb_magic == cpu_to_be32(XFS_BMAP_CRC_MAGIC)); 355 ASSERT(uuid_equal(&rblock->bb_u.l.bb_uuid, &mp->m_sb.sb_uuid)); 356 ASSERT(rblock->bb_u.l.bb_blkno == 357 cpu_to_be64(XFS_BUF_DADDR_NULL)); 358 } else 359 ASSERT(rblock->bb_magic == cpu_to_be32(XFS_BMAP_MAGIC)); 360 ASSERT(rblock->bb_u.l.bb_leftsib == cpu_to_be64(NULLFSBLOCK)); 361 ASSERT(rblock->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK)); 362 ASSERT(rblock->bb_level != 0); 363 dblock->bb_level = rblock->bb_level; 364 dblock->bb_numrecs = rblock->bb_numrecs; 365 dmxr = xfs_bmdr_maxrecs(dblocklen, 0); 366 fkp = XFS_BMBT_KEY_ADDR(mp, rblock, 1); 367 tkp = XFS_BMDR_KEY_ADDR(dblock, 1); 368 fpp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, rblocklen); 369 tpp = XFS_BMDR_PTR_ADDR(dblock, 1, dmxr); 370 dmxr = be16_to_cpu(dblock->bb_numrecs); 371 memcpy(tkp, fkp, sizeof(*fkp) * dmxr); 372 memcpy(tpp, fpp, sizeof(*fpp) * dmxr); 373 } 374 375 /* 376 * Check extent records, which have just been read, for 377 * any bit in the extent flag field. ASSERT on debug 378 * kernels, as this condition should not occur. 379 * Return an error condition (1) if any flags found, 380 * otherwise return 0. 381 */ 382 383 int 384 xfs_check_nostate_extents( 385 xfs_ifork_t *ifp, 386 xfs_extnum_t idx, 387 xfs_extnum_t num) 388 { 389 for (; num > 0; num--, idx++) { 390 xfs_bmbt_rec_host_t *ep = xfs_iext_get_ext(ifp, idx); 391 if ((ep->l0 >> 392 (64 - BMBT_EXNTFLAG_BITLEN)) != 0) { 393 ASSERT(0); 394 return 1; 395 } 396 } 397 return 0; 398 } 399 400 401 STATIC struct xfs_btree_cur * 402 xfs_bmbt_dup_cursor( 403 struct xfs_btree_cur *cur) 404 { 405 struct xfs_btree_cur *new; 406 407 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, 408 cur->bc_private.b.ip, cur->bc_private.b.whichfork); 409 410 /* 411 * Copy the firstblock, flist, and flags values, 412 * since init cursor doesn't get them. 413 */ 414 new->bc_private.b.firstblock = cur->bc_private.b.firstblock; 415 new->bc_private.b.flist = cur->bc_private.b.flist; 416 new->bc_private.b.flags = cur->bc_private.b.flags; 417 418 return new; 419 } 420 421 STATIC void 422 xfs_bmbt_update_cursor( 423 struct xfs_btree_cur *src, 424 struct xfs_btree_cur *dst) 425 { 426 ASSERT((dst->bc_private.b.firstblock != NULLFSBLOCK) || 427 (dst->bc_private.b.ip->i_d.di_flags & XFS_DIFLAG_REALTIME)); 428 ASSERT(dst->bc_private.b.flist == src->bc_private.b.flist); 429 430 dst->bc_private.b.allocated += src->bc_private.b.allocated; 431 dst->bc_private.b.firstblock = src->bc_private.b.firstblock; 432 433 src->bc_private.b.allocated = 0; 434 } 435 436 STATIC int 437 xfs_bmbt_alloc_block( 438 struct xfs_btree_cur *cur, 439 union xfs_btree_ptr *start, 440 union xfs_btree_ptr *new, 441 int *stat) 442 { 443 xfs_alloc_arg_t args; /* block allocation args */ 444 int error; /* error return value */ 445 446 memset(&args, 0, sizeof(args)); 447 args.tp = cur->bc_tp; 448 args.mp = cur->bc_mp; 449 args.fsbno = cur->bc_private.b.firstblock; 450 args.firstblock = args.fsbno; 451 452 if (args.fsbno == NULLFSBLOCK) { 453 args.fsbno = be64_to_cpu(start->l); 454 args.type = XFS_ALLOCTYPE_START_BNO; 455 /* 456 * Make sure there is sufficient room left in the AG to 457 * complete a full tree split for an extent insert. If 458 * we are converting the middle part of an extent then 459 * we may need space for two tree splits. 460 * 461 * We are relying on the caller to make the correct block 462 * reservation for this operation to succeed. If the 463 * reservation amount is insufficient then we may fail a 464 * block allocation here and corrupt the filesystem. 465 */ 466 args.minleft = xfs_trans_get_block_res(args.tp); 467 } else if (cur->bc_private.b.flist->xbf_low) { 468 args.type = XFS_ALLOCTYPE_START_BNO; 469 } else { 470 args.type = XFS_ALLOCTYPE_NEAR_BNO; 471 } 472 473 args.minlen = args.maxlen = args.prod = 1; 474 args.wasdel = cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL; 475 if (!args.wasdel && xfs_trans_get_block_res(args.tp) == 0) { 476 error = -ENOSPC; 477 goto error0; 478 } 479 error = xfs_alloc_vextent(&args); 480 if (error) 481 goto error0; 482 483 if (args.fsbno == NULLFSBLOCK && args.minleft) { 484 /* 485 * Could not find an AG with enough free space to satisfy 486 * a full btree split. Try again without minleft and if 487 * successful activate the lowspace algorithm. 488 */ 489 args.fsbno = 0; 490 args.type = XFS_ALLOCTYPE_FIRST_AG; 491 args.minleft = 0; 492 error = xfs_alloc_vextent(&args); 493 if (error) 494 goto error0; 495 cur->bc_private.b.flist->xbf_low = 1; 496 } 497 if (args.fsbno == NULLFSBLOCK) { 498 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); 499 *stat = 0; 500 return 0; 501 } 502 ASSERT(args.len == 1); 503 cur->bc_private.b.firstblock = args.fsbno; 504 cur->bc_private.b.allocated++; 505 cur->bc_private.b.ip->i_d.di_nblocks++; 506 xfs_trans_log_inode(args.tp, cur->bc_private.b.ip, XFS_ILOG_CORE); 507 xfs_trans_mod_dquot_byino(args.tp, cur->bc_private.b.ip, 508 XFS_TRANS_DQ_BCOUNT, 1L); 509 510 new->l = cpu_to_be64(args.fsbno); 511 512 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); 513 *stat = 1; 514 return 0; 515 516 error0: 517 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR); 518 return error; 519 } 520 521 STATIC int 522 xfs_bmbt_free_block( 523 struct xfs_btree_cur *cur, 524 struct xfs_buf *bp) 525 { 526 struct xfs_mount *mp = cur->bc_mp; 527 struct xfs_inode *ip = cur->bc_private.b.ip; 528 struct xfs_trans *tp = cur->bc_tp; 529 xfs_fsblock_t fsbno = XFS_DADDR_TO_FSB(mp, XFS_BUF_ADDR(bp)); 530 531 xfs_bmap_add_free(fsbno, 1, cur->bc_private.b.flist, mp); 532 ip->i_d.di_nblocks--; 533 534 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); 535 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L); 536 xfs_trans_binval(tp, bp); 537 return 0; 538 } 539 540 STATIC int 541 xfs_bmbt_get_minrecs( 542 struct xfs_btree_cur *cur, 543 int level) 544 { 545 if (level == cur->bc_nlevels - 1) { 546 struct xfs_ifork *ifp; 547 548 ifp = XFS_IFORK_PTR(cur->bc_private.b.ip, 549 cur->bc_private.b.whichfork); 550 551 return xfs_bmbt_maxrecs(cur->bc_mp, 552 ifp->if_broot_bytes, level == 0) / 2; 553 } 554 555 return cur->bc_mp->m_bmap_dmnr[level != 0]; 556 } 557 558 int 559 xfs_bmbt_get_maxrecs( 560 struct xfs_btree_cur *cur, 561 int level) 562 { 563 if (level == cur->bc_nlevels - 1) { 564 struct xfs_ifork *ifp; 565 566 ifp = XFS_IFORK_PTR(cur->bc_private.b.ip, 567 cur->bc_private.b.whichfork); 568 569 return xfs_bmbt_maxrecs(cur->bc_mp, 570 ifp->if_broot_bytes, level == 0); 571 } 572 573 return cur->bc_mp->m_bmap_dmxr[level != 0]; 574 575 } 576 577 /* 578 * Get the maximum records we could store in the on-disk format. 579 * 580 * For non-root nodes this is equivalent to xfs_bmbt_get_maxrecs, but 581 * for the root node this checks the available space in the dinode fork 582 * so that we can resize the in-memory buffer to match it. After a 583 * resize to the maximum size this function returns the same value 584 * as xfs_bmbt_get_maxrecs for the root node, too. 585 */ 586 STATIC int 587 xfs_bmbt_get_dmaxrecs( 588 struct xfs_btree_cur *cur, 589 int level) 590 { 591 if (level != cur->bc_nlevels - 1) 592 return cur->bc_mp->m_bmap_dmxr[level != 0]; 593 return xfs_bmdr_maxrecs(cur->bc_private.b.forksize, level == 0); 594 } 595 596 STATIC void 597 xfs_bmbt_init_key_from_rec( 598 union xfs_btree_key *key, 599 union xfs_btree_rec *rec) 600 { 601 key->bmbt.br_startoff = 602 cpu_to_be64(xfs_bmbt_disk_get_startoff(&rec->bmbt)); 603 } 604 605 STATIC void 606 xfs_bmbt_init_rec_from_key( 607 union xfs_btree_key *key, 608 union xfs_btree_rec *rec) 609 { 610 ASSERT(key->bmbt.br_startoff != 0); 611 612 xfs_bmbt_disk_set_allf(&rec->bmbt, be64_to_cpu(key->bmbt.br_startoff), 613 0, 0, XFS_EXT_NORM); 614 } 615 616 STATIC void 617 xfs_bmbt_init_rec_from_cur( 618 struct xfs_btree_cur *cur, 619 union xfs_btree_rec *rec) 620 { 621 xfs_bmbt_disk_set_all(&rec->bmbt, &cur->bc_rec.b); 622 } 623 624 STATIC void 625 xfs_bmbt_init_ptr_from_cur( 626 struct xfs_btree_cur *cur, 627 union xfs_btree_ptr *ptr) 628 { 629 ptr->l = 0; 630 } 631 632 STATIC __int64_t 633 xfs_bmbt_key_diff( 634 struct xfs_btree_cur *cur, 635 union xfs_btree_key *key) 636 { 637 return (__int64_t)be64_to_cpu(key->bmbt.br_startoff) - 638 cur->bc_rec.b.br_startoff; 639 } 640 641 static bool 642 xfs_bmbt_verify( 643 struct xfs_buf *bp) 644 { 645 struct xfs_mount *mp = bp->b_target->bt_mount; 646 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp); 647 unsigned int level; 648 649 switch (block->bb_magic) { 650 case cpu_to_be32(XFS_BMAP_CRC_MAGIC): 651 if (!xfs_sb_version_hascrc(&mp->m_sb)) 652 return false; 653 if (!uuid_equal(&block->bb_u.l.bb_uuid, &mp->m_sb.sb_uuid)) 654 return false; 655 if (be64_to_cpu(block->bb_u.l.bb_blkno) != bp->b_bn) 656 return false; 657 /* 658 * XXX: need a better way of verifying the owner here. Right now 659 * just make sure there has been one set. 660 */ 661 if (be64_to_cpu(block->bb_u.l.bb_owner) == 0) 662 return false; 663 /* fall through */ 664 case cpu_to_be32(XFS_BMAP_MAGIC): 665 break; 666 default: 667 return false; 668 } 669 670 /* 671 * numrecs and level verification. 672 * 673 * We don't know what fork we belong to, so just verify that the level 674 * is less than the maximum of the two. Later checks will be more 675 * precise. 676 */ 677 level = be16_to_cpu(block->bb_level); 678 if (level > max(mp->m_bm_maxlevels[0], mp->m_bm_maxlevels[1])) 679 return false; 680 if (be16_to_cpu(block->bb_numrecs) > mp->m_bmap_dmxr[level != 0]) 681 return false; 682 683 /* sibling pointer verification */ 684 if (!block->bb_u.l.bb_leftsib || 685 (block->bb_u.l.bb_leftsib != cpu_to_be64(NULLFSBLOCK) && 686 !XFS_FSB_SANITY_CHECK(mp, be64_to_cpu(block->bb_u.l.bb_leftsib)))) 687 return false; 688 if (!block->bb_u.l.bb_rightsib || 689 (block->bb_u.l.bb_rightsib != cpu_to_be64(NULLFSBLOCK) && 690 !XFS_FSB_SANITY_CHECK(mp, be64_to_cpu(block->bb_u.l.bb_rightsib)))) 691 return false; 692 693 return true; 694 } 695 696 static void 697 xfs_bmbt_read_verify( 698 struct xfs_buf *bp) 699 { 700 if (!xfs_btree_lblock_verify_crc(bp)) 701 xfs_buf_ioerror(bp, -EFSBADCRC); 702 else if (!xfs_bmbt_verify(bp)) 703 xfs_buf_ioerror(bp, -EFSCORRUPTED); 704 705 if (bp->b_error) { 706 trace_xfs_btree_corrupt(bp, _RET_IP_); 707 xfs_verifier_error(bp); 708 } 709 } 710 711 static void 712 xfs_bmbt_write_verify( 713 struct xfs_buf *bp) 714 { 715 if (!xfs_bmbt_verify(bp)) { 716 trace_xfs_btree_corrupt(bp, _RET_IP_); 717 xfs_buf_ioerror(bp, -EFSCORRUPTED); 718 xfs_verifier_error(bp); 719 return; 720 } 721 xfs_btree_lblock_calc_crc(bp); 722 } 723 724 const struct xfs_buf_ops xfs_bmbt_buf_ops = { 725 .verify_read = xfs_bmbt_read_verify, 726 .verify_write = xfs_bmbt_write_verify, 727 }; 728 729 730 #if defined(DEBUG) || defined(XFS_WARN) 731 STATIC int 732 xfs_bmbt_keys_inorder( 733 struct xfs_btree_cur *cur, 734 union xfs_btree_key *k1, 735 union xfs_btree_key *k2) 736 { 737 return be64_to_cpu(k1->bmbt.br_startoff) < 738 be64_to_cpu(k2->bmbt.br_startoff); 739 } 740 741 STATIC int 742 xfs_bmbt_recs_inorder( 743 struct xfs_btree_cur *cur, 744 union xfs_btree_rec *r1, 745 union xfs_btree_rec *r2) 746 { 747 return xfs_bmbt_disk_get_startoff(&r1->bmbt) + 748 xfs_bmbt_disk_get_blockcount(&r1->bmbt) <= 749 xfs_bmbt_disk_get_startoff(&r2->bmbt); 750 } 751 #endif /* DEBUG */ 752 753 static const struct xfs_btree_ops xfs_bmbt_ops = { 754 .rec_len = sizeof(xfs_bmbt_rec_t), 755 .key_len = sizeof(xfs_bmbt_key_t), 756 757 .dup_cursor = xfs_bmbt_dup_cursor, 758 .update_cursor = xfs_bmbt_update_cursor, 759 .alloc_block = xfs_bmbt_alloc_block, 760 .free_block = xfs_bmbt_free_block, 761 .get_maxrecs = xfs_bmbt_get_maxrecs, 762 .get_minrecs = xfs_bmbt_get_minrecs, 763 .get_dmaxrecs = xfs_bmbt_get_dmaxrecs, 764 .init_key_from_rec = xfs_bmbt_init_key_from_rec, 765 .init_rec_from_key = xfs_bmbt_init_rec_from_key, 766 .init_rec_from_cur = xfs_bmbt_init_rec_from_cur, 767 .init_ptr_from_cur = xfs_bmbt_init_ptr_from_cur, 768 .key_diff = xfs_bmbt_key_diff, 769 .buf_ops = &xfs_bmbt_buf_ops, 770 #if defined(DEBUG) || defined(XFS_WARN) 771 .keys_inorder = xfs_bmbt_keys_inorder, 772 .recs_inorder = xfs_bmbt_recs_inorder, 773 #endif 774 }; 775 776 /* 777 * Allocate a new bmap btree cursor. 778 */ 779 struct xfs_btree_cur * /* new bmap btree cursor */ 780 xfs_bmbt_init_cursor( 781 struct xfs_mount *mp, /* file system mount point */ 782 struct xfs_trans *tp, /* transaction pointer */ 783 struct xfs_inode *ip, /* inode owning the btree */ 784 int whichfork) /* data or attr fork */ 785 { 786 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork); 787 struct xfs_btree_cur *cur; 788 789 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP); 790 791 cur->bc_tp = tp; 792 cur->bc_mp = mp; 793 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; 794 cur->bc_btnum = XFS_BTNUM_BMAP; 795 cur->bc_blocklog = mp->m_sb.sb_blocklog; 796 797 cur->bc_ops = &xfs_bmbt_ops; 798 cur->bc_flags = XFS_BTREE_LONG_PTRS | XFS_BTREE_ROOT_IN_INODE; 799 if (xfs_sb_version_hascrc(&mp->m_sb)) 800 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS; 801 802 cur->bc_private.b.forksize = XFS_IFORK_SIZE(ip, whichfork); 803 cur->bc_private.b.ip = ip; 804 cur->bc_private.b.firstblock = NULLFSBLOCK; 805 cur->bc_private.b.flist = NULL; 806 cur->bc_private.b.allocated = 0; 807 cur->bc_private.b.flags = 0; 808 cur->bc_private.b.whichfork = whichfork; 809 810 return cur; 811 } 812 813 /* 814 * Calculate number of records in a bmap btree block. 815 */ 816 int 817 xfs_bmbt_maxrecs( 818 struct xfs_mount *mp, 819 int blocklen, 820 int leaf) 821 { 822 blocklen -= XFS_BMBT_BLOCK_LEN(mp); 823 824 if (leaf) 825 return blocklen / sizeof(xfs_bmbt_rec_t); 826 return blocklen / (sizeof(xfs_bmbt_key_t) + sizeof(xfs_bmbt_ptr_t)); 827 } 828 829 /* 830 * Calculate number of records in a bmap btree inode root. 831 */ 832 int 833 xfs_bmdr_maxrecs( 834 int blocklen, 835 int leaf) 836 { 837 blocklen -= sizeof(xfs_bmdr_block_t); 838 839 if (leaf) 840 return blocklen / sizeof(xfs_bmdr_rec_t); 841 return blocklen / (sizeof(xfs_bmdr_key_t) + sizeof(xfs_bmdr_ptr_t)); 842 } 843 844 /* 845 * Change the owner of a btree format fork fo the inode passed in. Change it to 846 * the owner of that is passed in so that we can change owners before or after 847 * we switch forks between inodes. The operation that the caller is doing will 848 * determine whether is needs to change owner before or after the switch. 849 * 850 * For demand paged transactional modification, the fork switch should be done 851 * after reading in all the blocks, modifying them and pinning them in the 852 * transaction. For modification when the buffers are already pinned in memory, 853 * the fork switch can be done before changing the owner as we won't need to 854 * validate the owner until the btree buffers are unpinned and writes can occur 855 * again. 856 * 857 * For recovery based ownership change, there is no transactional context and 858 * so a buffer list must be supplied so that we can record the buffers that we 859 * modified for the caller to issue IO on. 860 */ 861 int 862 xfs_bmbt_change_owner( 863 struct xfs_trans *tp, 864 struct xfs_inode *ip, 865 int whichfork, 866 xfs_ino_t new_owner, 867 struct list_head *buffer_list) 868 { 869 struct xfs_btree_cur *cur; 870 int error; 871 872 ASSERT(tp || buffer_list); 873 ASSERT(!(tp && buffer_list)); 874 if (whichfork == XFS_DATA_FORK) 875 ASSERT(ip->i_d.di_format == XFS_DINODE_FMT_BTREE); 876 else 877 ASSERT(ip->i_d.di_aformat == XFS_DINODE_FMT_BTREE); 878 879 cur = xfs_bmbt_init_cursor(ip->i_mount, tp, ip, whichfork); 880 if (!cur) 881 return -ENOMEM; 882 883 error = xfs_btree_change_owner(cur, new_owner, buffer_list); 884 xfs_btree_del_cursor(cur, error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); 885 return error; 886 } 887