1 // SPDX-License-Identifier: GPL-2.0 2 /* 3 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc. 4 * All Rights Reserved. 5 */ 6 #include "xfs.h" 7 #include "xfs_fs.h" 8 #include "xfs_shared.h" 9 #include "xfs_format.h" 10 #include "xfs_log_format.h" 11 #include "xfs_trans_resv.h" 12 #include "xfs_bit.h" 13 #include "xfs_mount.h" 14 #include "xfs_inode.h" 15 #include "xfs_trans.h" 16 #include "xfs_alloc.h" 17 #include "xfs_btree.h" 18 #include "xfs_bmap_btree.h" 19 #include "xfs_bmap.h" 20 #include "xfs_error.h" 21 #include "xfs_quota.h" 22 #include "xfs_trace.h" 23 #include "xfs_rmap.h" 24 25 static struct kmem_cache *xfs_bmbt_cur_cache; 26 27 /* 28 * Convert on-disk form of btree root to in-memory form. 29 */ 30 void 31 xfs_bmdr_to_bmbt( 32 struct xfs_inode *ip, 33 xfs_bmdr_block_t *dblock, 34 int dblocklen, 35 struct xfs_btree_block *rblock, 36 int rblocklen) 37 { 38 struct xfs_mount *mp = ip->i_mount; 39 int dmxr; 40 xfs_bmbt_key_t *fkp; 41 __be64 *fpp; 42 xfs_bmbt_key_t *tkp; 43 __be64 *tpp; 44 45 xfs_btree_init_block_int(mp, rblock, XFS_BUF_DADDR_NULL, 46 XFS_BTNUM_BMAP, 0, 0, ip->i_ino, 47 XFS_BTREE_LONG_PTRS); 48 rblock->bb_level = dblock->bb_level; 49 ASSERT(be16_to_cpu(rblock->bb_level) > 0); 50 rblock->bb_numrecs = dblock->bb_numrecs; 51 dmxr = xfs_bmdr_maxrecs(dblocklen, 0); 52 fkp = XFS_BMDR_KEY_ADDR(dblock, 1); 53 tkp = XFS_BMBT_KEY_ADDR(mp, rblock, 1); 54 fpp = XFS_BMDR_PTR_ADDR(dblock, 1, dmxr); 55 tpp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, rblocklen); 56 dmxr = be16_to_cpu(dblock->bb_numrecs); 57 memcpy(tkp, fkp, sizeof(*fkp) * dmxr); 58 memcpy(tpp, fpp, sizeof(*fpp) * dmxr); 59 } 60 61 void 62 xfs_bmbt_disk_get_all( 63 const struct xfs_bmbt_rec *rec, 64 struct xfs_bmbt_irec *irec) 65 { 66 uint64_t l0 = get_unaligned_be64(&rec->l0); 67 uint64_t l1 = get_unaligned_be64(&rec->l1); 68 69 irec->br_startoff = (l0 & xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9; 70 irec->br_startblock = ((l0 & xfs_mask64lo(9)) << 43) | (l1 >> 21); 71 irec->br_blockcount = l1 & xfs_mask64lo(21); 72 if (l0 >> (64 - BMBT_EXNTFLAG_BITLEN)) 73 irec->br_state = XFS_EXT_UNWRITTEN; 74 else 75 irec->br_state = XFS_EXT_NORM; 76 } 77 78 /* 79 * Extract the blockcount field from an on disk bmap extent record. 80 */ 81 xfs_filblks_t 82 xfs_bmbt_disk_get_blockcount( 83 const struct xfs_bmbt_rec *r) 84 { 85 return (xfs_filblks_t)(be64_to_cpu(r->l1) & xfs_mask64lo(21)); 86 } 87 88 /* 89 * Extract the startoff field from a disk format bmap extent record. 90 */ 91 xfs_fileoff_t 92 xfs_bmbt_disk_get_startoff( 93 const struct xfs_bmbt_rec *r) 94 { 95 return ((xfs_fileoff_t)be64_to_cpu(r->l0) & 96 xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9; 97 } 98 99 /* 100 * Set all the fields in a bmap extent record from the uncompressed form. 101 */ 102 void 103 xfs_bmbt_disk_set_all( 104 struct xfs_bmbt_rec *r, 105 struct xfs_bmbt_irec *s) 106 { 107 int extent_flag = (s->br_state != XFS_EXT_NORM); 108 109 ASSERT(s->br_state == XFS_EXT_NORM || s->br_state == XFS_EXT_UNWRITTEN); 110 ASSERT(!(s->br_startoff & xfs_mask64hi(64-BMBT_STARTOFF_BITLEN))); 111 ASSERT(!(s->br_blockcount & xfs_mask64hi(64-BMBT_BLOCKCOUNT_BITLEN))); 112 ASSERT(!(s->br_startblock & xfs_mask64hi(64-BMBT_STARTBLOCK_BITLEN))); 113 114 put_unaligned_be64( 115 ((xfs_bmbt_rec_base_t)extent_flag << 63) | 116 ((xfs_bmbt_rec_base_t)s->br_startoff << 9) | 117 ((xfs_bmbt_rec_base_t)s->br_startblock >> 43), &r->l0); 118 put_unaligned_be64( 119 ((xfs_bmbt_rec_base_t)s->br_startblock << 21) | 120 ((xfs_bmbt_rec_base_t)s->br_blockcount & 121 (xfs_bmbt_rec_base_t)xfs_mask64lo(21)), &r->l1); 122 } 123 124 /* 125 * Convert in-memory form of btree root to on-disk form. 126 */ 127 void 128 xfs_bmbt_to_bmdr( 129 struct xfs_mount *mp, 130 struct xfs_btree_block *rblock, 131 int rblocklen, 132 xfs_bmdr_block_t *dblock, 133 int dblocklen) 134 { 135 int dmxr; 136 xfs_bmbt_key_t *fkp; 137 __be64 *fpp; 138 xfs_bmbt_key_t *tkp; 139 __be64 *tpp; 140 141 if (xfs_has_crc(mp)) { 142 ASSERT(rblock->bb_magic == cpu_to_be32(XFS_BMAP_CRC_MAGIC)); 143 ASSERT(uuid_equal(&rblock->bb_u.l.bb_uuid, 144 &mp->m_sb.sb_meta_uuid)); 145 ASSERT(rblock->bb_u.l.bb_blkno == 146 cpu_to_be64(XFS_BUF_DADDR_NULL)); 147 } else 148 ASSERT(rblock->bb_magic == cpu_to_be32(XFS_BMAP_MAGIC)); 149 ASSERT(rblock->bb_u.l.bb_leftsib == cpu_to_be64(NULLFSBLOCK)); 150 ASSERT(rblock->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK)); 151 ASSERT(rblock->bb_level != 0); 152 dblock->bb_level = rblock->bb_level; 153 dblock->bb_numrecs = rblock->bb_numrecs; 154 dmxr = xfs_bmdr_maxrecs(dblocklen, 0); 155 fkp = XFS_BMBT_KEY_ADDR(mp, rblock, 1); 156 tkp = XFS_BMDR_KEY_ADDR(dblock, 1); 157 fpp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, rblocklen); 158 tpp = XFS_BMDR_PTR_ADDR(dblock, 1, dmxr); 159 dmxr = be16_to_cpu(dblock->bb_numrecs); 160 memcpy(tkp, fkp, sizeof(*fkp) * dmxr); 161 memcpy(tpp, fpp, sizeof(*fpp) * dmxr); 162 } 163 164 STATIC struct xfs_btree_cur * 165 xfs_bmbt_dup_cursor( 166 struct xfs_btree_cur *cur) 167 { 168 struct xfs_btree_cur *new; 169 170 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, 171 cur->bc_ino.ip, cur->bc_ino.whichfork); 172 173 /* 174 * Copy the firstblock, dfops, and flags values, 175 * since init cursor doesn't get them. 176 */ 177 new->bc_ino.flags = cur->bc_ino.flags; 178 179 return new; 180 } 181 182 STATIC void 183 xfs_bmbt_update_cursor( 184 struct xfs_btree_cur *src, 185 struct xfs_btree_cur *dst) 186 { 187 ASSERT((dst->bc_tp->t_firstblock != NULLFSBLOCK) || 188 (dst->bc_ino.ip->i_diflags & XFS_DIFLAG_REALTIME)); 189 190 dst->bc_ino.allocated += src->bc_ino.allocated; 191 dst->bc_tp->t_firstblock = src->bc_tp->t_firstblock; 192 193 src->bc_ino.allocated = 0; 194 } 195 196 STATIC int 197 xfs_bmbt_alloc_block( 198 struct xfs_btree_cur *cur, 199 const union xfs_btree_ptr *start, 200 union xfs_btree_ptr *new, 201 int *stat) 202 { 203 xfs_alloc_arg_t args; /* block allocation args */ 204 int error; /* error return value */ 205 206 memset(&args, 0, sizeof(args)); 207 args.tp = cur->bc_tp; 208 args.mp = cur->bc_mp; 209 args.fsbno = cur->bc_tp->t_firstblock; 210 xfs_rmap_ino_bmbt_owner(&args.oinfo, cur->bc_ino.ip->i_ino, 211 cur->bc_ino.whichfork); 212 213 if (args.fsbno == NULLFSBLOCK) { 214 args.fsbno = be64_to_cpu(start->l); 215 args.type = XFS_ALLOCTYPE_START_BNO; 216 217 /* 218 * If we are coming here from something like unwritten extent 219 * conversion, there has been no data extent allocation already 220 * done, so we have to ensure that we attempt to locate the 221 * entire set of bmbt allocations in the same AG, as 222 * xfs_bmapi_write() would have reserved. 223 */ 224 args.minleft = xfs_bmapi_minleft(cur->bc_tp, cur->bc_ino.ip, 225 cur->bc_ino.whichfork); 226 } else if (cur->bc_tp->t_flags & XFS_TRANS_LOWMODE) { 227 args.type = XFS_ALLOCTYPE_START_BNO; 228 } else { 229 args.type = XFS_ALLOCTYPE_NEAR_BNO; 230 } 231 232 args.minlen = args.maxlen = args.prod = 1; 233 args.wasdel = cur->bc_ino.flags & XFS_BTCUR_BMBT_WASDEL; 234 if (!args.wasdel && args.tp->t_blk_res == 0) { 235 error = -ENOSPC; 236 goto error0; 237 } 238 error = xfs_alloc_vextent(&args); 239 if (error) 240 goto error0; 241 242 if (args.fsbno == NULLFSBLOCK && args.minleft) { 243 /* 244 * Could not find an AG with enough free space to satisfy 245 * a full btree split. Try again and if 246 * successful activate the lowspace algorithm. 247 */ 248 args.fsbno = 0; 249 args.minleft = 0; 250 args.type = XFS_ALLOCTYPE_FIRST_AG; 251 error = xfs_alloc_vextent(&args); 252 if (error) 253 goto error0; 254 cur->bc_tp->t_flags |= XFS_TRANS_LOWMODE; 255 } 256 if (WARN_ON_ONCE(args.fsbno == NULLFSBLOCK)) { 257 *stat = 0; 258 return 0; 259 } 260 261 ASSERT(args.len == 1); 262 cur->bc_tp->t_firstblock = args.fsbno; 263 cur->bc_ino.allocated++; 264 cur->bc_ino.ip->i_nblocks++; 265 xfs_trans_log_inode(args.tp, cur->bc_ino.ip, XFS_ILOG_CORE); 266 xfs_trans_mod_dquot_byino(args.tp, cur->bc_ino.ip, 267 XFS_TRANS_DQ_BCOUNT, 1L); 268 269 new->l = cpu_to_be64(args.fsbno); 270 271 *stat = 1; 272 return 0; 273 274 error0: 275 return error; 276 } 277 278 STATIC int 279 xfs_bmbt_free_block( 280 struct xfs_btree_cur *cur, 281 struct xfs_buf *bp) 282 { 283 struct xfs_mount *mp = cur->bc_mp; 284 struct xfs_inode *ip = cur->bc_ino.ip; 285 struct xfs_trans *tp = cur->bc_tp; 286 xfs_fsblock_t fsbno = XFS_DADDR_TO_FSB(mp, xfs_buf_daddr(bp)); 287 struct xfs_owner_info oinfo; 288 289 xfs_rmap_ino_bmbt_owner(&oinfo, ip->i_ino, cur->bc_ino.whichfork); 290 xfs_free_extent_later(cur->bc_tp, fsbno, 1, &oinfo); 291 ip->i_nblocks--; 292 293 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); 294 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L); 295 return 0; 296 } 297 298 STATIC int 299 xfs_bmbt_get_minrecs( 300 struct xfs_btree_cur *cur, 301 int level) 302 { 303 if (level == cur->bc_nlevels - 1) { 304 struct xfs_ifork *ifp; 305 306 ifp = xfs_ifork_ptr(cur->bc_ino.ip, 307 cur->bc_ino.whichfork); 308 309 return xfs_bmbt_maxrecs(cur->bc_mp, 310 ifp->if_broot_bytes, level == 0) / 2; 311 } 312 313 return cur->bc_mp->m_bmap_dmnr[level != 0]; 314 } 315 316 int 317 xfs_bmbt_get_maxrecs( 318 struct xfs_btree_cur *cur, 319 int level) 320 { 321 if (level == cur->bc_nlevels - 1) { 322 struct xfs_ifork *ifp; 323 324 ifp = xfs_ifork_ptr(cur->bc_ino.ip, 325 cur->bc_ino.whichfork); 326 327 return xfs_bmbt_maxrecs(cur->bc_mp, 328 ifp->if_broot_bytes, level == 0); 329 } 330 331 return cur->bc_mp->m_bmap_dmxr[level != 0]; 332 333 } 334 335 /* 336 * Get the maximum records we could store in the on-disk format. 337 * 338 * For non-root nodes this is equivalent to xfs_bmbt_get_maxrecs, but 339 * for the root node this checks the available space in the dinode fork 340 * so that we can resize the in-memory buffer to match it. After a 341 * resize to the maximum size this function returns the same value 342 * as xfs_bmbt_get_maxrecs for the root node, too. 343 */ 344 STATIC int 345 xfs_bmbt_get_dmaxrecs( 346 struct xfs_btree_cur *cur, 347 int level) 348 { 349 if (level != cur->bc_nlevels - 1) 350 return cur->bc_mp->m_bmap_dmxr[level != 0]; 351 return xfs_bmdr_maxrecs(cur->bc_ino.forksize, level == 0); 352 } 353 354 STATIC void 355 xfs_bmbt_init_key_from_rec( 356 union xfs_btree_key *key, 357 const union xfs_btree_rec *rec) 358 { 359 key->bmbt.br_startoff = 360 cpu_to_be64(xfs_bmbt_disk_get_startoff(&rec->bmbt)); 361 } 362 363 STATIC void 364 xfs_bmbt_init_high_key_from_rec( 365 union xfs_btree_key *key, 366 const union xfs_btree_rec *rec) 367 { 368 key->bmbt.br_startoff = cpu_to_be64( 369 xfs_bmbt_disk_get_startoff(&rec->bmbt) + 370 xfs_bmbt_disk_get_blockcount(&rec->bmbt) - 1); 371 } 372 373 STATIC void 374 xfs_bmbt_init_rec_from_cur( 375 struct xfs_btree_cur *cur, 376 union xfs_btree_rec *rec) 377 { 378 xfs_bmbt_disk_set_all(&rec->bmbt, &cur->bc_rec.b); 379 } 380 381 STATIC void 382 xfs_bmbt_init_ptr_from_cur( 383 struct xfs_btree_cur *cur, 384 union xfs_btree_ptr *ptr) 385 { 386 ptr->l = 0; 387 } 388 389 STATIC int64_t 390 xfs_bmbt_key_diff( 391 struct xfs_btree_cur *cur, 392 const union xfs_btree_key *key) 393 { 394 return (int64_t)be64_to_cpu(key->bmbt.br_startoff) - 395 cur->bc_rec.b.br_startoff; 396 } 397 398 STATIC int64_t 399 xfs_bmbt_diff_two_keys( 400 struct xfs_btree_cur *cur, 401 const union xfs_btree_key *k1, 402 const union xfs_btree_key *k2) 403 { 404 uint64_t a = be64_to_cpu(k1->bmbt.br_startoff); 405 uint64_t b = be64_to_cpu(k2->bmbt.br_startoff); 406 407 /* 408 * Note: This routine previously casted a and b to int64 and subtracted 409 * them to generate a result. This lead to problems if b was the 410 * "maximum" key value (all ones) being signed incorrectly, hence this 411 * somewhat less efficient version. 412 */ 413 if (a > b) 414 return 1; 415 if (b > a) 416 return -1; 417 return 0; 418 } 419 420 static xfs_failaddr_t 421 xfs_bmbt_verify( 422 struct xfs_buf *bp) 423 { 424 struct xfs_mount *mp = bp->b_mount; 425 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp); 426 xfs_failaddr_t fa; 427 unsigned int level; 428 429 if (!xfs_verify_magic(bp, block->bb_magic)) 430 return __this_address; 431 432 if (xfs_has_crc(mp)) { 433 /* 434 * XXX: need a better way of verifying the owner here. Right now 435 * just make sure there has been one set. 436 */ 437 fa = xfs_btree_lblock_v5hdr_verify(bp, XFS_RMAP_OWN_UNKNOWN); 438 if (fa) 439 return fa; 440 } 441 442 /* 443 * numrecs and level verification. 444 * 445 * We don't know what fork we belong to, so just verify that the level 446 * is less than the maximum of the two. Later checks will be more 447 * precise. 448 */ 449 level = be16_to_cpu(block->bb_level); 450 if (level > max(mp->m_bm_maxlevels[0], mp->m_bm_maxlevels[1])) 451 return __this_address; 452 453 return xfs_btree_lblock_verify(bp, mp->m_bmap_dmxr[level != 0]); 454 } 455 456 static void 457 xfs_bmbt_read_verify( 458 struct xfs_buf *bp) 459 { 460 xfs_failaddr_t fa; 461 462 if (!xfs_btree_lblock_verify_crc(bp)) 463 xfs_verifier_error(bp, -EFSBADCRC, __this_address); 464 else { 465 fa = xfs_bmbt_verify(bp); 466 if (fa) 467 xfs_verifier_error(bp, -EFSCORRUPTED, fa); 468 } 469 470 if (bp->b_error) 471 trace_xfs_btree_corrupt(bp, _RET_IP_); 472 } 473 474 static void 475 xfs_bmbt_write_verify( 476 struct xfs_buf *bp) 477 { 478 xfs_failaddr_t fa; 479 480 fa = xfs_bmbt_verify(bp); 481 if (fa) { 482 trace_xfs_btree_corrupt(bp, _RET_IP_); 483 xfs_verifier_error(bp, -EFSCORRUPTED, fa); 484 return; 485 } 486 xfs_btree_lblock_calc_crc(bp); 487 } 488 489 const struct xfs_buf_ops xfs_bmbt_buf_ops = { 490 .name = "xfs_bmbt", 491 .magic = { cpu_to_be32(XFS_BMAP_MAGIC), 492 cpu_to_be32(XFS_BMAP_CRC_MAGIC) }, 493 .verify_read = xfs_bmbt_read_verify, 494 .verify_write = xfs_bmbt_write_verify, 495 .verify_struct = xfs_bmbt_verify, 496 }; 497 498 499 STATIC int 500 xfs_bmbt_keys_inorder( 501 struct xfs_btree_cur *cur, 502 const union xfs_btree_key *k1, 503 const union xfs_btree_key *k2) 504 { 505 return be64_to_cpu(k1->bmbt.br_startoff) < 506 be64_to_cpu(k2->bmbt.br_startoff); 507 } 508 509 STATIC int 510 xfs_bmbt_recs_inorder( 511 struct xfs_btree_cur *cur, 512 const union xfs_btree_rec *r1, 513 const union xfs_btree_rec *r2) 514 { 515 return xfs_bmbt_disk_get_startoff(&r1->bmbt) + 516 xfs_bmbt_disk_get_blockcount(&r1->bmbt) <= 517 xfs_bmbt_disk_get_startoff(&r2->bmbt); 518 } 519 520 static const struct xfs_btree_ops xfs_bmbt_ops = { 521 .rec_len = sizeof(xfs_bmbt_rec_t), 522 .key_len = sizeof(xfs_bmbt_key_t), 523 524 .dup_cursor = xfs_bmbt_dup_cursor, 525 .update_cursor = xfs_bmbt_update_cursor, 526 .alloc_block = xfs_bmbt_alloc_block, 527 .free_block = xfs_bmbt_free_block, 528 .get_maxrecs = xfs_bmbt_get_maxrecs, 529 .get_minrecs = xfs_bmbt_get_minrecs, 530 .get_dmaxrecs = xfs_bmbt_get_dmaxrecs, 531 .init_key_from_rec = xfs_bmbt_init_key_from_rec, 532 .init_high_key_from_rec = xfs_bmbt_init_high_key_from_rec, 533 .init_rec_from_cur = xfs_bmbt_init_rec_from_cur, 534 .init_ptr_from_cur = xfs_bmbt_init_ptr_from_cur, 535 .key_diff = xfs_bmbt_key_diff, 536 .diff_two_keys = xfs_bmbt_diff_two_keys, 537 .buf_ops = &xfs_bmbt_buf_ops, 538 .keys_inorder = xfs_bmbt_keys_inorder, 539 .recs_inorder = xfs_bmbt_recs_inorder, 540 }; 541 542 /* 543 * Allocate a new bmap btree cursor. 544 */ 545 struct xfs_btree_cur * /* new bmap btree cursor */ 546 xfs_bmbt_init_cursor( 547 struct xfs_mount *mp, /* file system mount point */ 548 struct xfs_trans *tp, /* transaction pointer */ 549 struct xfs_inode *ip, /* inode owning the btree */ 550 int whichfork) /* data or attr fork */ 551 { 552 struct xfs_ifork *ifp = xfs_ifork_ptr(ip, whichfork); 553 struct xfs_btree_cur *cur; 554 ASSERT(whichfork != XFS_COW_FORK); 555 556 cur = xfs_btree_alloc_cursor(mp, tp, XFS_BTNUM_BMAP, 557 mp->m_bm_maxlevels[whichfork], xfs_bmbt_cur_cache); 558 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; 559 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_bmbt_2); 560 561 cur->bc_ops = &xfs_bmbt_ops; 562 cur->bc_flags = XFS_BTREE_LONG_PTRS | XFS_BTREE_ROOT_IN_INODE; 563 if (xfs_has_crc(mp)) 564 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS; 565 566 cur->bc_ino.forksize = xfs_inode_fork_size(ip, whichfork); 567 cur->bc_ino.ip = ip; 568 cur->bc_ino.allocated = 0; 569 cur->bc_ino.flags = 0; 570 cur->bc_ino.whichfork = whichfork; 571 572 return cur; 573 } 574 575 /* Calculate number of records in a block mapping btree block. */ 576 static inline unsigned int 577 xfs_bmbt_block_maxrecs( 578 unsigned int blocklen, 579 bool leaf) 580 { 581 if (leaf) 582 return blocklen / sizeof(xfs_bmbt_rec_t); 583 return blocklen / (sizeof(xfs_bmbt_key_t) + sizeof(xfs_bmbt_ptr_t)); 584 } 585 586 /* 587 * Calculate number of records in a bmap btree block. 588 */ 589 int 590 xfs_bmbt_maxrecs( 591 struct xfs_mount *mp, 592 int blocklen, 593 int leaf) 594 { 595 blocklen -= XFS_BMBT_BLOCK_LEN(mp); 596 return xfs_bmbt_block_maxrecs(blocklen, leaf); 597 } 598 599 /* 600 * Calculate the maximum possible height of the btree that the on-disk format 601 * supports. This is used for sizing structures large enough to support every 602 * possible configuration of a filesystem that might get mounted. 603 */ 604 unsigned int 605 xfs_bmbt_maxlevels_ondisk(void) 606 { 607 unsigned int minrecs[2]; 608 unsigned int blocklen; 609 610 blocklen = min(XFS_MIN_BLOCKSIZE - XFS_BTREE_SBLOCK_LEN, 611 XFS_MIN_CRC_BLOCKSIZE - XFS_BTREE_SBLOCK_CRC_LEN); 612 613 minrecs[0] = xfs_bmbt_block_maxrecs(blocklen, true) / 2; 614 minrecs[1] = xfs_bmbt_block_maxrecs(blocklen, false) / 2; 615 616 /* One extra level for the inode root. */ 617 return xfs_btree_compute_maxlevels(minrecs, 618 XFS_MAX_EXTCNT_DATA_FORK_LARGE) + 1; 619 } 620 621 /* 622 * Calculate number of records in a bmap btree inode root. 623 */ 624 int 625 xfs_bmdr_maxrecs( 626 int blocklen, 627 int leaf) 628 { 629 blocklen -= sizeof(xfs_bmdr_block_t); 630 631 if (leaf) 632 return blocklen / sizeof(xfs_bmdr_rec_t); 633 return blocklen / (sizeof(xfs_bmdr_key_t) + sizeof(xfs_bmdr_ptr_t)); 634 } 635 636 /* 637 * Change the owner of a btree format fork fo the inode passed in. Change it to 638 * the owner of that is passed in so that we can change owners before or after 639 * we switch forks between inodes. The operation that the caller is doing will 640 * determine whether is needs to change owner before or after the switch. 641 * 642 * For demand paged transactional modification, the fork switch should be done 643 * after reading in all the blocks, modifying them and pinning them in the 644 * transaction. For modification when the buffers are already pinned in memory, 645 * the fork switch can be done before changing the owner as we won't need to 646 * validate the owner until the btree buffers are unpinned and writes can occur 647 * again. 648 * 649 * For recovery based ownership change, there is no transactional context and 650 * so a buffer list must be supplied so that we can record the buffers that we 651 * modified for the caller to issue IO on. 652 */ 653 int 654 xfs_bmbt_change_owner( 655 struct xfs_trans *tp, 656 struct xfs_inode *ip, 657 int whichfork, 658 xfs_ino_t new_owner, 659 struct list_head *buffer_list) 660 { 661 struct xfs_btree_cur *cur; 662 int error; 663 664 ASSERT(tp || buffer_list); 665 ASSERT(!(tp && buffer_list)); 666 ASSERT(xfs_ifork_ptr(ip, whichfork)->if_format == XFS_DINODE_FMT_BTREE); 667 668 cur = xfs_bmbt_init_cursor(ip->i_mount, tp, ip, whichfork); 669 cur->bc_ino.flags |= XFS_BTCUR_BMBT_INVALID_OWNER; 670 671 error = xfs_btree_change_owner(cur, new_owner, buffer_list); 672 xfs_btree_del_cursor(cur, error); 673 return error; 674 } 675 676 /* Calculate the bmap btree size for some records. */ 677 unsigned long long 678 xfs_bmbt_calc_size( 679 struct xfs_mount *mp, 680 unsigned long long len) 681 { 682 return xfs_btree_calc_size(mp->m_bmap_dmnr, len); 683 } 684 685 int __init 686 xfs_bmbt_init_cur_cache(void) 687 { 688 xfs_bmbt_cur_cache = kmem_cache_create("xfs_bmbt_cur", 689 xfs_btree_cur_sizeof(xfs_bmbt_maxlevels_ondisk()), 690 0, 0, NULL); 691 692 if (!xfs_bmbt_cur_cache) 693 return -ENOMEM; 694 return 0; 695 } 696 697 void 698 xfs_bmbt_destroy_cur_cache(void) 699 { 700 kmem_cache_destroy(xfs_bmbt_cur_cache); 701 xfs_bmbt_cur_cache = NULL; 702 } 703