Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 | /* * Copyright (c) 2000-2002 Silicon Graphics, Inc. All Rights Reserved. * * This program is free software; you can redistribute it and/or modify it * under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * This program is distributed in the hope that it would be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. * * Further, this software is distributed without any warranty that it is * free of the rightful claim of any third person regarding infringement * or the like. Any license provided herein, whether implied or * otherwise, applies only to this software file. Patent licenses, if * any, provided herein do not apply to combinations of this program with * other software, or any other product whatsoever. * * You should have received a copy of the GNU General Public License along * with this program; if not, write the Free Software Foundation, Inc., 59 * Temple Place - Suite 330, Boston MA 02111-1307, USA. * * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy, * Mountain View, CA 94043, or: * * http://www.sgi.com * * For further information regarding this notice, see: * * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/ */ #include "xfs.h" #include "xfs_macros.h" #include "xfs_types.h" #include "xfs_inum.h" #include "xfs_log.h" #include "xfs_trans.h" #include "xfs_sb.h" #include "xfs_dir.h" #include "xfs_dir2.h" #include "xfs_dmapi.h" #include "xfs_mount.h" #include "xfs_ag.h" #include "xfs_alloc_btree.h" #include "xfs_bmap_btree.h" #include "xfs_ialloc_btree.h" #include "xfs_btree.h" #include "xfs_attr_sf.h" #include "xfs_dir_sf.h" #include "xfs_dir2_sf.h" #include "xfs_dinode.h" #include "xfs_inode.h" #include "xfs_ialloc.h" #include "xfs_itable.h" #include "xfs_error.h" /* * Return stat information for one inode. * Return 0 if ok, else errno. */ int /* error status */ xfs_bulkstat_one( xfs_mount_t *mp, /* mount point for filesystem */ xfs_trans_t *tp, /* transaction pointer */ xfs_ino_t ino, /* inode number to get data for */ void *buffer, /* buffer to place output in */ int ubsize, /* size of buffer */ void *private_data, /* my private data */ xfs_daddr_t bno, /* starting bno of inode cluster */ int *ubused, /* bytes used by me */ void *dibuff, /* on-disk inode buffer */ int *stat) /* BULKSTAT_RV_... */ { xfs_bstat_t *buf; /* return buffer */ int error; /* error value */ xfs_dinode_t *dip; /* dinode inode pointer */ xfs_dinode_core_t *dic; /* dinode core info pointer */ xfs_inode_t *ip = NULL; /* incore inode pointer */ xfs_arch_t arch; /* these are set according to */ __uint16_t di_flags; /* temp */ buf = (xfs_bstat_t *)buffer; dip = (xfs_dinode_t *)dibuff; if (! buf || ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino || (XFS_SB_VERSION_HASQUOTA(&mp->m_sb) && (ino == mp->m_sb.sb_uquotino || ino == mp->m_sb.sb_gquotino))) { *stat = BULKSTAT_RV_NOTHING; return XFS_ERROR(EINVAL); } if (ubsize < sizeof(*buf)) { *stat = BULKSTAT_RV_NOTHING; return XFS_ERROR(ENOMEM); } if (dip == NULL) { /* We're not being passed a pointer to a dinode. This happens * if BULKSTAT_FG_IGET is selected. Do the iget. */ error = xfs_iget(mp, tp, ino, XFS_ILOCK_SHARED, &ip, bno); if (error) { *stat = BULKSTAT_RV_NOTHING; return error; } ASSERT(ip != NULL); ASSERT(ip->i_blkno != (xfs_daddr_t)0); if (ip->i_d.di_mode == 0) { xfs_iput_new(ip, XFS_ILOCK_SHARED); *stat = BULKSTAT_RV_NOTHING; return XFS_ERROR(ENOENT); } dic = &ip->i_d; arch = ARCH_NOCONVERT; /* in-core! */ ASSERT(dic != NULL); /* xfs_iget returns the following without needing * further change. */ buf->bs_nlink = dic->di_nlink; buf->bs_projid = dic->di_projid; } else { dic = &dip->di_core; ASSERT(dic != NULL); /* buffer dinode_core is in on-disk arch */ arch = ARCH_CONVERT; /* * The inode format changed when we moved the link count and * made it 32 bits long. If this is an old format inode, * convert it in memory to look like a new one. If it gets * flushed to disk we will convert back before flushing or * logging it. We zero out the new projid field and the old link * count field. We'll handle clearing the pad field (the remains * of the old uuid field) when we actually convert the inode to * the new format. We don't change the version number so that we * can distinguish this from a real new format inode. */ if (INT_GET(dic->di_version, arch) == XFS_DINODE_VERSION_1) { buf->bs_nlink = INT_GET(dic->di_onlink, arch); buf->bs_projid = 0; } else { buf->bs_nlink = INT_GET(dic->di_nlink, arch); buf->bs_projid = INT_GET(dic->di_projid, arch); } } buf->bs_ino = ino; buf->bs_mode = INT_GET(dic->di_mode, arch); buf->bs_uid = INT_GET(dic->di_uid, arch); buf->bs_gid = INT_GET(dic->di_gid, arch); buf->bs_size = INT_GET(dic->di_size, arch); buf->bs_atime.tv_sec = INT_GET(dic->di_atime.t_sec, arch); buf->bs_atime.tv_nsec = INT_GET(dic->di_atime.t_nsec, arch); buf->bs_mtime.tv_sec = INT_GET(dic->di_mtime.t_sec, arch); buf->bs_mtime.tv_nsec = INT_GET(dic->di_mtime.t_nsec, arch); buf->bs_ctime.tv_sec = INT_GET(dic->di_ctime.t_sec, arch); buf->bs_ctime.tv_nsec = INT_GET(dic->di_ctime.t_nsec, arch); /* * convert di_flags to bs_xflags. */ di_flags = INT_GET(dic->di_flags, arch); buf->bs_xflags = ((di_flags & XFS_DIFLAG_REALTIME) ? XFS_XFLAG_REALTIME : 0) | ((di_flags & XFS_DIFLAG_PREALLOC) ? XFS_XFLAG_PREALLOC : 0) | ((di_flags & XFS_DIFLAG_IMMUTABLE) ? XFS_XFLAG_IMMUTABLE : 0) | ((di_flags & XFS_DIFLAG_APPEND) ? XFS_XFLAG_APPEND : 0) | ((di_flags & XFS_DIFLAG_SYNC) ? XFS_XFLAG_SYNC : 0) | ((di_flags & XFS_DIFLAG_NOATIME) ? XFS_XFLAG_NOATIME : 0) | ((di_flags & XFS_DIFLAG_NODUMP) ? XFS_XFLAG_NODUMP : 0) | (XFS_CFORK_Q_ARCH(dic, arch) ? XFS_XFLAG_HASATTR : 0); buf->bs_extsize = INT_GET(dic->di_extsize, arch) << mp->m_sb.sb_blocklog; buf->bs_extents = INT_GET(dic->di_nextents, arch); buf->bs_gen = INT_GET(dic->di_gen, arch); memset(buf->bs_pad, 0, sizeof(buf->bs_pad)); buf->bs_dmevmask = INT_GET(dic->di_dmevmask, arch); buf->bs_dmstate = INT_GET(dic->di_dmstate, arch); buf->bs_aextents = INT_GET(dic->di_anextents, arch); switch (INT_GET(dic->di_format, arch)) { case XFS_DINODE_FMT_DEV: if ( ip ) { buf->bs_rdev = ip->i_df.if_u2.if_rdev; } else { buf->bs_rdev = INT_GET(dip->di_u.di_dev, arch); } buf->bs_blksize = BLKDEV_IOSIZE; buf->bs_blocks = 0; break; case XFS_DINODE_FMT_LOCAL: case XFS_DINODE_FMT_UUID: buf->bs_rdev = 0; buf->bs_blksize = mp->m_sb.sb_blocksize; buf->bs_blocks = 0; break; case XFS_DINODE_FMT_EXTENTS: case XFS_DINODE_FMT_BTREE: buf->bs_rdev = 0; buf->bs_blksize = mp->m_sb.sb_blocksize; if ( ip ) { buf->bs_blocks = INT_GET(dic->di_nblocks, arch) + ip->i_delayed_blks; } else { buf->bs_blocks = INT_GET(dic->di_nblocks, arch); } break; } if (ip) { xfs_iput(ip, XFS_ILOCK_SHARED); } *stat = BULKSTAT_RV_DIDONE; if (ubused) *ubused = sizeof(*buf); return 0; } /* * Return stat information in bulk (by-inode) for the filesystem. */ int /* error status */ xfs_bulkstat( xfs_mount_t *mp, /* mount point for filesystem */ xfs_trans_t *tp, /* transaction pointer */ xfs_ino_t *lastinop, /* last inode returned */ int *ubcountp, /* size of buffer/count returned */ bulkstat_one_pf formatter, /* func that'd fill a single buf */ void *private_data,/* private data for formatter */ size_t statstruct_size, /* sizeof struct filling */ xfs_caddr_t ubuffer, /* buffer with inode stats */ int flags, /* defined in xfs_itable.h */ int *done) /* 1 if there're more stats to get */ { xfs_agblock_t agbno=0;/* allocation group block number */ xfs_buf_t *agbp; /* agi header buffer */ xfs_agi_t *agi; /* agi header data */ xfs_agino_t agino; /* inode # in allocation group */ xfs_agnumber_t agno; /* allocation group number */ xfs_daddr_t bno; /* inode cluster start daddr */ int chunkidx; /* current index into inode chunk */ int clustidx; /* current index into inode cluster */ xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */ int end_of_ag; /* set if we've seen the ag end */ int error; /* error code */ int fmterror;/* bulkstat formatter result */ __int32_t gcnt; /* current btree rec's count */ xfs_inofree_t gfree; /* current btree rec's free mask */ xfs_agino_t gino; /* current btree rec's start inode */ int i; /* loop index */ int icount; /* count of inodes good in irbuf */ xfs_ino_t ino; /* inode number (filesystem) */ xfs_inobt_rec_t *irbp; /* current irec buffer pointer */ xfs_inobt_rec_t *irbuf; /* start of irec buffer */ xfs_inobt_rec_t *irbufend; /* end of good irec buffer entries */ xfs_ino_t lastino=0; /* last inode number returned */ int nbcluster; /* # of blocks in a cluster */ int nicluster; /* # of inodes in a cluster */ int nimask; /* mask for inode clusters */ int nirbuf; /* size of irbuf */ int rval; /* return value error code */ int tmp; /* result value from btree calls */ int ubcount; /* size of user's buffer */ int ubleft; /* bytes left in user's buffer */ xfs_caddr_t ubufp; /* current pointer into user's buffer */ int ubelem; /* spaces used in user's buffer */ int ubused; /* bytes used by formatter */ xfs_buf_t *bp; /* ptr to on-disk inode cluster buf */ xfs_dinode_t *dip; /* ptr into bp for specific inode */ xfs_inode_t *ip; /* ptr to in-core inode struct */ /* * Get the last inode value, see if there's nothing to do. */ ino = (xfs_ino_t)*lastinop; dip = NULL; agno = XFS_INO_TO_AGNO(mp, ino); agino = XFS_INO_TO_AGINO(mp, ino); if (agno >= mp->m_sb.sb_agcount || ino != XFS_AGINO_TO_INO(mp, agno, agino)) { *done = 1; *ubcountp = 0; return 0; } ubcount = *ubcountp; /* statstruct's */ ubleft = ubcount * statstruct_size; /* bytes */ *ubcountp = ubelem = 0; *done = 0; fmterror = 0; ubufp = ubuffer; nicluster = mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp) ? mp->m_sb.sb_inopblock : (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog); nimask = ~(nicluster - 1); nbcluster = nicluster >> mp->m_sb.sb_inopblog; /* * Lock down the user's buffer. If a buffer was not sent, as in the case * disk quota code calls here, we skip this. */ #if defined(HAVE_USERACC) if (ubuffer && (error = useracc(ubuffer, ubcount * statstruct_size, (B_READ|B_PHYS), NULL))) { return error; } #endif /* * Allocate a page-sized buffer for inode btree records. * We could try allocating something smaller, but for normal * calls we'll always (potentially) need the whole page. */ irbuf = kmem_alloc(NBPC, KM_SLEEP); nirbuf = NBPC / sizeof(*irbuf); /* * Loop over the allocation groups, starting from the last * inode returned; 0 means start of the allocation group. */ rval = 0; while (ubleft >= statstruct_size && agno < mp->m_sb.sb_agcount) { bp = NULL; down_read(&mp->m_peraglock); error = xfs_ialloc_read_agi(mp, tp, agno, &agbp); up_read(&mp->m_peraglock); if (error) { /* * Skip this allocation group and go to the next one. */ agno++; agino = 0; continue; } agi = XFS_BUF_TO_AGI(agbp); /* * Allocate and initialize a btree cursor for ialloc btree. */ cur = xfs_btree_init_cursor(mp, tp, agbp, agno, XFS_BTNUM_INO, (xfs_inode_t *)0, 0); irbp = irbuf; irbufend = irbuf + nirbuf; end_of_ag = 0; /* * If we're returning in the middle of an allocation group, * we need to get the remainder of the chunk we're in. */ if (agino > 0) { /* * Lookup the inode chunk that this inode lives in. */ error = xfs_inobt_lookup_le(cur, agino, 0, 0, &tmp); if (!error && /* no I/O error */ tmp && /* lookup succeeded */ /* got the record, should always work */ !(error = xfs_inobt_get_rec(cur, &gino, &gcnt, &gfree, &i, ARCH_NOCONVERT)) && i == 1 && /* this is the right chunk */ agino < gino + XFS_INODES_PER_CHUNK && /* lastino was not last in chunk */ (chunkidx = agino - gino + 1) < XFS_INODES_PER_CHUNK && /* there are some left allocated */ XFS_INOBT_MASKN(chunkidx, XFS_INODES_PER_CHUNK - chunkidx) & ~gfree) { /* * Grab the chunk record. Mark all the * uninteresting inodes (because they're * before our start point) free. */ for (i = 0; i < chunkidx; i++) { if (XFS_INOBT_MASK(i) & ~gfree) gcnt++; } gfree |= XFS_INOBT_MASKN(0, chunkidx); INT_SET(irbp->ir_startino, ARCH_CONVERT, gino); INT_SET(irbp->ir_freecount, ARCH_CONVERT, gcnt); INT_SET(irbp->ir_free, ARCH_CONVERT, gfree); irbp++; agino = gino + XFS_INODES_PER_CHUNK; icount = XFS_INODES_PER_CHUNK - gcnt; } else { /* * If any of those tests failed, bump the * inode number (just in case). */ agino++; icount = 0; } /* * In any case, increment to the next record. */ if (!error) error = xfs_inobt_increment(cur, 0, &tmp); } else { /* * Start of ag. Lookup the first inode chunk. */ error = xfs_inobt_lookup_ge(cur, 0, 0, 0, &tmp); icount = 0; } /* * Loop through inode btree records in this ag, * until we run out of inodes or space in the buffer. */ while (irbp < irbufend && icount < ubcount) { /* * Loop as long as we're unable to read the * inode btree. */ while (error) { agino += XFS_INODES_PER_CHUNK; if (XFS_AGINO_TO_AGBNO(mp, agino) >= INT_GET(agi->agi_length, ARCH_CONVERT)) break; error = xfs_inobt_lookup_ge(cur, agino, 0, 0, &tmp); } /* * If ran off the end of the ag either with an error, * or the normal way, set end and stop collecting. */ if (error || (error = xfs_inobt_get_rec(cur, &gino, &gcnt, &gfree, &i, ARCH_NOCONVERT)) || i == 0) { end_of_ag = 1; break; } /* * If this chunk has any allocated inodes, save it. */ if (gcnt < XFS_INODES_PER_CHUNK) { INT_SET(irbp->ir_startino, ARCH_CONVERT, gino); INT_SET(irbp->ir_freecount, ARCH_CONVERT, gcnt); INT_SET(irbp->ir_free, ARCH_CONVERT, gfree); irbp++; icount += XFS_INODES_PER_CHUNK - gcnt; } /* * Set agino to after this chunk and bump the cursor. */ agino = gino + XFS_INODES_PER_CHUNK; error = xfs_inobt_increment(cur, 0, &tmp); } /* * Drop the btree buffers and the agi buffer. * We can't hold any of the locks these represent * when calling iget. */ xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); xfs_trans_brelse(tp, agbp); /* * Now format all the good inodes into the user's buffer. */ irbufend = irbp; for (irbp = irbuf; irbp < irbufend && ubleft >= statstruct_size; irbp++) { /* * Read-ahead the next chunk's worth of inodes. */ if (&irbp[1] < irbufend) { /* * Loop over all clusters in the next chunk. * Do a readahead if there are any allocated * inodes in that cluster. */ for (agbno = XFS_AGINO_TO_AGBNO(mp, INT_GET(irbp[1].ir_startino, ARCH_CONVERT)), chunkidx = 0; chunkidx < XFS_INODES_PER_CHUNK; chunkidx += nicluster, agbno += nbcluster) { if (XFS_INOBT_MASKN(chunkidx, nicluster) & ~(INT_GET(irbp[1].ir_free, ARCH_CONVERT))) xfs_btree_reada_bufs(mp, agno, agbno, nbcluster); } } /* * Now process this chunk of inodes. */ for (agino = INT_GET(irbp->ir_startino, ARCH_CONVERT), chunkidx = 0, clustidx = 0; ubleft > 0 && INT_GET(irbp->ir_freecount, ARCH_CONVERT) < XFS_INODES_PER_CHUNK; chunkidx++, clustidx++, agino++) { ASSERT(chunkidx < XFS_INODES_PER_CHUNK); /* * Recompute agbno if this is the * first inode of the cluster. * * Careful with clustidx. There can be * multple clusters per chunk, a single * cluster per chunk or a cluster that has * inodes represented from several different * chunks (if blocksize is large). * * Because of this, the starting clustidx is * initialized to zero in this loop but must * later be reset after reading in the cluster * buffer. */ if ((chunkidx & (nicluster - 1)) == 0) { agbno = XFS_AGINO_TO_AGBNO(mp, INT_GET(irbp->ir_startino, ARCH_CONVERT)) + ((chunkidx & nimask) >> mp->m_sb.sb_inopblog); if (flags & BULKSTAT_FG_QUICK) { ino = XFS_AGINO_TO_INO(mp, agno, agino); bno = XFS_AGB_TO_DADDR(mp, agno, agbno); /* * Get the inode cluster buffer */ ASSERT(xfs_inode_zone != NULL); ip = kmem_zone_zalloc(xfs_inode_zone, KM_SLEEP); ip->i_ino = ino; ip->i_mount = mp; if (bp) xfs_trans_brelse(tp, bp); error = xfs_itobp(mp, tp, ip, &dip, &bp, bno); if (!error) clustidx = ip->i_boffset / mp->m_sb.sb_inodesize; kmem_zone_free(xfs_inode_zone, ip); if (XFS_TEST_ERROR(error != 0, mp, XFS_ERRTAG_BULKSTAT_READ_CHUNK, XFS_RANDOM_BULKSTAT_READ_CHUNK)) { bp = NULL; break; } } } /* * Skip if this inode is free. */ if (XFS_INOBT_MASK(chunkidx) & INT_GET(irbp->ir_free, ARCH_CONVERT)) continue; /* * Count used inodes as free so we can tell * when the chunk is used up. */ INT_MOD(irbp->ir_freecount, ARCH_CONVERT, +1); ino = XFS_AGINO_TO_INO(mp, agno, agino); bno = XFS_AGB_TO_DADDR(mp, agno, agbno); if (flags & BULKSTAT_FG_QUICK) { dip = (xfs_dinode_t *)xfs_buf_offset(bp, (clustidx << mp->m_sb.sb_inodelog)); if (INT_GET(dip->di_core.di_magic, ARCH_CONVERT) != XFS_DINODE_MAGIC || !XFS_DINODE_GOOD_VERSION( INT_GET(dip->di_core.di_version, ARCH_CONVERT))) continue; } /* * Get the inode and fill in a single buffer. * BULKSTAT_FG_QUICK uses dip to fill it in. * BULKSTAT_FG_IGET uses igets. * See: xfs_bulkstat_one & xfs_dm_bulkstat_one. * This is also used to count inodes/blks, etc * in xfs_qm_quotacheck. */ ubused = statstruct_size; error = formatter(mp, tp, ino, ubufp, ubleft, private_data, bno, &ubused, dip, &fmterror); if (fmterror == BULKSTAT_RV_NOTHING) { if (error == ENOMEM) ubleft = 0; continue; } if (fmterror == BULKSTAT_RV_GIVEUP) { ubleft = 0; ASSERT(error); rval = error; break; } if (ubufp) ubufp += ubused; ubleft -= ubused; ubelem++; lastino = ino; } } if (bp) xfs_trans_brelse(tp, bp); /* * Set up for the next loop iteration. */ if (ubleft > 0) { if (end_of_ag) { agno++; agino = 0; } else agino = XFS_INO_TO_AGINO(mp, lastino); } else break; } /* * Done, we're either out of filesystem or space to put the data. */ kmem_free(irbuf, NBPC); #if defined(HAVE_USERACC) if (ubuffer) unuseracc(ubuffer, ubcount * statstruct_size, (B_READ|B_PHYS)); #endif *ubcountp = ubelem; if (agno >= mp->m_sb.sb_agcount) { /* * If we ran out of filesystem, mark lastino as off * the end of the filesystem, so the next call * will return immediately. */ *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0); *done = 1; } else *lastinop = (xfs_ino_t)lastino; return rval; } /* * Return stat information in bulk (by-inode) for the filesystem. * Special case for non-sequential one inode bulkstat. */ int /* error status */ xfs_bulkstat_single( xfs_mount_t *mp, /* mount point for filesystem */ xfs_ino_t *lastinop, /* inode to return */ xfs_caddr_t buffer, /* buffer with inode stats */ int *done) /* 1 if there're more stats to get */ { xfs_bstat_t bstat; /* one bulkstat result structure */ int count; /* count value for bulkstat call */ int error; /* return value */ xfs_ino_t ino; /* filesystem inode number */ int res; /* result from bs1 */ /* * note that requesting valid inode numbers which are not allocated * to inodes will most likely cause xfs_itobp to generate warning * messages about bad magic numbers. This is ok. The fact that * the inode isn't actually an inode is handled by the * error check below. Done this way to make the usual case faster * at the expense of the error case. */ ino = (xfs_ino_t)*lastinop; error = xfs_bulkstat_one(mp, NULL, ino, &bstat, sizeof(bstat), NULL, 0, NULL, NULL, &res); if (error) { /* * Special case way failed, do it the "long" way * to see if that works. */ (*lastinop)--; count = 1; if (xfs_bulkstat(mp, NULL, lastinop, &count, xfs_bulkstat_one, NULL, sizeof(bstat), buffer, BULKSTAT_FG_IGET, done)) return error; if (count == 0 || (xfs_ino_t)*lastinop != ino) return error == EFSCORRUPTED ? XFS_ERROR(EINVAL) : error; else return 0; } *done = 0; if (copy_to_user(buffer, &bstat, sizeof(bstat))) return XFS_ERROR(EFAULT); return 0; } /* * Return inode number table for the filesystem. */ int /* error status */ xfs_inumbers( xfs_mount_t *mp, /* mount point for filesystem */ xfs_trans_t *tp, /* transaction pointer */ xfs_ino_t *lastino, /* last inode returned */ int *count, /* size of buffer/count returned */ xfs_caddr_t ubuffer) /* buffer with inode descriptions */ { xfs_buf_t *agbp; xfs_agino_t agino; xfs_agnumber_t agno; int bcount; xfs_inogrp_t *buffer; int bufidx; xfs_btree_cur_t *cur; int error; __int32_t gcnt; xfs_inofree_t gfree; xfs_agino_t gino; int i; xfs_ino_t ino; int left; int tmp; ino = (xfs_ino_t)*lastino; agno = XFS_INO_TO_AGNO(mp, ino); agino = XFS_INO_TO_AGINO(mp, ino); left = *count; *count = 0; bcount = MIN(left, (int)(NBPP / sizeof(*buffer))); buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP); error = bufidx = 0; cur = NULL; agbp = NULL; while (left > 0 && agno < mp->m_sb.sb_agcount) { if (agbp == NULL) { down_read(&mp->m_peraglock); error = xfs_ialloc_read_agi(mp, tp, agno, &agbp); up_read(&mp->m_peraglock); if (error) { /* * If we can't read the AGI of this ag, * then just skip to the next one. */ ASSERT(cur == NULL); agbp = NULL; agno++; agino = 0; continue; } cur = xfs_btree_init_cursor(mp, tp, agbp, agno, XFS_BTNUM_INO, (xfs_inode_t *)0, 0); error = xfs_inobt_lookup_ge(cur, agino, 0, 0, &tmp); if (error) { xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); cur = NULL; xfs_trans_brelse(tp, agbp); agbp = NULL; /* * Move up the the last inode in the current * chunk. The lookup_ge will always get * us the first inode in the next chunk. */ agino += XFS_INODES_PER_CHUNK - 1; continue; } } if ((error = xfs_inobt_get_rec(cur, &gino, &gcnt, &gfree, &i, ARCH_NOCONVERT)) || i == 0) { xfs_trans_brelse(tp, agbp); agbp = NULL; xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); cur = NULL; agno++; agino = 0; continue; } agino = gino + XFS_INODES_PER_CHUNK - 1; buffer[bufidx].xi_startino = XFS_AGINO_TO_INO(mp, agno, gino); buffer[bufidx].xi_alloccount = XFS_INODES_PER_CHUNK - gcnt; buffer[bufidx].xi_allocmask = ~gfree; bufidx++; left--; if (bufidx == bcount) { if (copy_to_user(ubuffer, buffer, bufidx * sizeof(*buffer))) { error = XFS_ERROR(EFAULT); break; } ubuffer += bufidx * sizeof(*buffer); *count += bufidx; bufidx = 0; } if (left) { error = xfs_inobt_increment(cur, 0, &tmp); if (error) { xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); cur = NULL; xfs_trans_brelse(tp, agbp); agbp = NULL; /* * The agino value has already been bumped. * Just try to skip up to it. */ agino += XFS_INODES_PER_CHUNK; continue; } } } if (!error) { if (bufidx) { if (copy_to_user(ubuffer, buffer, bufidx * sizeof(*buffer))) error = XFS_ERROR(EFAULT); else *count += bufidx; } *lastino = XFS_AGINO_TO_INO(mp, agno, agino); } kmem_free(buffer, bcount * sizeof(*buffer)); if (cur) xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR)); if (agbp) xfs_trans_brelse(tp, agbp); return error; } |