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