2005-04-16 16:20:36 -06:00
|
|
|
/*
|
2005-11-01 20:58:39 -07:00
|
|
|
* Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
|
|
|
|
* All Rights Reserved.
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
2005-11-01 20:58:39 -07:00
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License as
|
2005-04-16 16:20:36 -06:00
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
2005-11-01 20:58:39 -07:00
|
|
|
* 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. See the
|
|
|
|
* GNU General Public License for more details.
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
2005-11-01 20:58:39 -07:00
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write the Free Software Foundation,
|
|
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
#include "xfs.h"
|
2005-11-01 20:38:42 -07:00
|
|
|
#include "xfs_fs.h"
|
2013-10-22 17:36:05 -06:00
|
|
|
#include "xfs_shared.h"
|
2013-10-22 17:51:50 -06:00
|
|
|
#include "xfs_format.h"
|
2013-10-22 17:50:10 -06:00
|
|
|
#include "xfs_log_format.h"
|
|
|
|
#include "xfs_trans_resv.h"
|
2005-04-16 16:20:36 -06:00
|
|
|
#include "xfs_mount.h"
|
|
|
|
#include "xfs_inode.h"
|
2013-10-22 17:51:50 -06:00
|
|
|
#include "xfs_btree.h"
|
2005-04-16 16:20:36 -06:00
|
|
|
#include "xfs_ialloc.h"
|
2013-10-22 17:51:50 -06:00
|
|
|
#include "xfs_ialloc_btree.h"
|
2005-04-16 16:20:36 -06:00
|
|
|
#include "xfs_itable.h"
|
|
|
|
#include "xfs_error.h"
|
2010-06-23 19:52:50 -06:00
|
|
|
#include "xfs_trace.h"
|
2012-10-08 04:56:11 -06:00
|
|
|
#include "xfs_icache.h"
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2010-06-23 02:11:11 -06:00
|
|
|
/*
|
|
|
|
* Return stat information for one inode.
|
|
|
|
* Return 0 if ok, else errno.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
xfs_bulkstat_one_int(
|
|
|
|
struct xfs_mount *mp, /* mount point for filesystem */
|
|
|
|
xfs_ino_t ino, /* inode to get data for */
|
|
|
|
void __user *buffer, /* buffer to place output in */
|
|
|
|
int ubsize, /* size of buffer */
|
|
|
|
bulkstat_one_fmt_pf formatter, /* formatter, copy to user */
|
|
|
|
int *ubused, /* bytes used by me */
|
|
|
|
int *stat) /* BULKSTAT_RV_... */
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2010-06-23 02:11:11 -06:00
|
|
|
struct xfs_icdinode *dic; /* dinode core info pointer */
|
|
|
|
struct xfs_inode *ip; /* incore inode pointer */
|
2016-02-08 22:54:58 -07:00
|
|
|
struct inode *inode;
|
2010-06-23 02:11:11 -06:00
|
|
|
struct xfs_bstat *buf; /* return buffer */
|
|
|
|
int error = 0; /* error value */
|
|
|
|
|
|
|
|
*stat = BULKSTAT_RV_NOTHING;
|
|
|
|
|
|
|
|
if (!buffer || xfs_internal_inum(mp, ino))
|
2014-06-24 22:58:08 -06:00
|
|
|
return -EINVAL;
|
2010-06-23 02:11:11 -06:00
|
|
|
|
2016-10-03 10:11:43 -06:00
|
|
|
buf = kmem_zalloc(sizeof(*buf), KM_SLEEP | KM_MAYFAIL);
|
2010-06-23 02:11:11 -06:00
|
|
|
if (!buf)
|
2014-06-24 22:58:08 -06:00
|
|
|
return -ENOMEM;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-09-27 19:02:23 -06:00
|
|
|
error = xfs_iget(mp, NULL, ino,
|
2012-03-21 23:15:10 -06:00
|
|
|
(XFS_IGET_DONTCACHE | XFS_IGET_UNTRUSTED),
|
|
|
|
XFS_ILOCK_SHARED, &ip);
|
2014-07-23 19:33:28 -06:00
|
|
|
if (error)
|
2010-06-23 02:11:11 -06:00
|
|
|
goto out_free;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
ASSERT(ip != NULL);
|
2008-11-27 20:23:41 -07:00
|
|
|
ASSERT(ip->i_imap.im_blkno != 0);
|
2016-02-08 22:54:58 -07:00
|
|
|
inode = VFS_I(ip);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
dic = &ip->i_d;
|
|
|
|
|
|
|
|
/* xfs_iget returns the following without needing
|
|
|
|
* further change.
|
|
|
|
*/
|
2010-09-26 00:10:18 -06:00
|
|
|
buf->bs_projid_lo = dic->di_projid_lo;
|
|
|
|
buf->bs_projid_hi = dic->di_projid_hi;
|
2005-04-16 16:20:36 -06:00
|
|
|
buf->bs_ino = ino;
|
|
|
|
buf->bs_uid = dic->di_uid;
|
|
|
|
buf->bs_gid = dic->di_gid;
|
|
|
|
buf->bs_size = dic->di_size;
|
2016-02-08 22:54:58 -07:00
|
|
|
|
2016-02-08 22:54:58 -07:00
|
|
|
buf->bs_nlink = inode->i_nlink;
|
2016-02-08 22:54:58 -07:00
|
|
|
buf->bs_atime.tv_sec = inode->i_atime.tv_sec;
|
|
|
|
buf->bs_atime.tv_nsec = inode->i_atime.tv_nsec;
|
|
|
|
buf->bs_mtime.tv_sec = inode->i_mtime.tv_sec;
|
|
|
|
buf->bs_mtime.tv_nsec = inode->i_mtime.tv_nsec;
|
|
|
|
buf->bs_ctime.tv_sec = inode->i_ctime.tv_sec;
|
|
|
|
buf->bs_ctime.tv_nsec = inode->i_ctime.tv_nsec;
|
2016-02-08 22:54:58 -07:00
|
|
|
buf->bs_gen = inode->i_generation;
|
2016-02-08 22:54:58 -07:00
|
|
|
buf->bs_mode = inode->i_mode;
|
2016-02-08 22:54:58 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
buf->bs_xflags = xfs_ip2xflags(ip);
|
|
|
|
buf->bs_extsize = dic->di_extsize << mp->m_sb.sb_blocklog;
|
|
|
|
buf->bs_extents = dic->di_nextents;
|
|
|
|
memset(buf->bs_pad, 0, sizeof(buf->bs_pad));
|
|
|
|
buf->bs_dmevmask = dic->di_dmevmask;
|
|
|
|
buf->bs_dmstate = dic->di_dmstate;
|
|
|
|
buf->bs_aextents = dic->di_anextents;
|
2010-03-04 21:41:14 -07:00
|
|
|
buf->bs_forkoff = XFS_IFORK_BOFF(ip);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2016-10-03 10:11:43 -06:00
|
|
|
if (dic->di_version == 3) {
|
|
|
|
if (dic->di_flags2 & XFS_DIFLAG2_COWEXTSIZE)
|
|
|
|
buf->bs_cowextsize = dic->di_cowextsize <<
|
|
|
|
mp->m_sb.sb_blocklog;
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
switch (dic->di_format) {
|
|
|
|
case XFS_DINODE_FMT_DEV:
|
2017-10-19 12:07:09 -06:00
|
|
|
buf->bs_rdev = sysv_encode_dev(inode->i_rdev);
|
2005-04-16 16:20:36 -06:00
|
|
|
buf->bs_blksize = BLKDEV_IOSIZE;
|
|
|
|
buf->bs_blocks = 0;
|
|
|
|
break;
|
|
|
|
case XFS_DINODE_FMT_LOCAL:
|
|
|
|
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;
|
|
|
|
buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks;
|
|
|
|
break;
|
|
|
|
}
|
2010-06-23 19:52:50 -06:00
|
|
|
xfs_iunlock(ip, XFS_ILOCK_SHARED);
|
|
|
|
IRELE(ip);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2010-06-23 02:11:11 -06:00
|
|
|
error = formatter(buffer, ubsize, ubused, buf);
|
|
|
|
if (!error)
|
|
|
|
*stat = BULKSTAT_RV_DIDONE;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2010-06-23 02:11:11 -06:00
|
|
|
out_free:
|
|
|
|
kmem_free(buf);
|
|
|
|
return error;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2008-11-25 20:20:12 -07:00
|
|
|
/* Return 0 on success or positive error */
|
2007-07-10 19:10:19 -06:00
|
|
|
STATIC int
|
|
|
|
xfs_bulkstat_one_fmt(
|
|
|
|
void __user *ubuffer,
|
2008-11-25 20:20:12 -07:00
|
|
|
int ubsize,
|
|
|
|
int *ubused,
|
2007-07-10 19:10:19 -06:00
|
|
|
const xfs_bstat_t *buffer)
|
|
|
|
{
|
2008-11-25 20:20:12 -07:00
|
|
|
if (ubsize < sizeof(*buffer))
|
2014-06-24 22:58:08 -06:00
|
|
|
return -ENOMEM;
|
2007-07-10 19:10:19 -06:00
|
|
|
if (copy_to_user(ubuffer, buffer, sizeof(*buffer)))
|
2014-06-24 22:58:08 -06:00
|
|
|
return -EFAULT;
|
2008-11-25 20:20:12 -07:00
|
|
|
if (ubused)
|
|
|
|
*ubused = sizeof(*buffer);
|
|
|
|
return 0;
|
2007-07-10 19:10:19 -06:00
|
|
|
}
|
|
|
|
|
2008-11-25 20:20:11 -07:00
|
|
|
int
|
|
|
|
xfs_bulkstat_one(
|
|
|
|
xfs_mount_t *mp, /* mount point for filesystem */
|
|
|
|
xfs_ino_t ino, /* inode number to get data for */
|
|
|
|
void __user *buffer, /* buffer to place output in */
|
|
|
|
int ubsize, /* size of buffer */
|
|
|
|
int *ubused, /* bytes used by me */
|
|
|
|
int *stat) /* BULKSTAT_RV_... */
|
|
|
|
{
|
|
|
|
return xfs_bulkstat_one_int(mp, ino, buffer, ubsize,
|
2010-06-23 19:35:17 -06:00
|
|
|
xfs_bulkstat_one_fmt, ubused, stat);
|
2006-09-27 19:01:46 -06:00
|
|
|
}
|
|
|
|
|
2014-07-24 02:41:18 -06:00
|
|
|
/*
|
|
|
|
* Loop over all clusters in a chunk for a given incore inode allocation btree
|
|
|
|
* record. Do a readahead if there are any allocated inodes in that cluster.
|
|
|
|
*/
|
|
|
|
STATIC void
|
|
|
|
xfs_bulkstat_ichunk_ra(
|
|
|
|
struct xfs_mount *mp,
|
|
|
|
xfs_agnumber_t agno,
|
|
|
|
struct xfs_inobt_rec_incore *irec)
|
|
|
|
{
|
|
|
|
xfs_agblock_t agbno;
|
|
|
|
struct blk_plug plug;
|
|
|
|
int blks_per_cluster;
|
|
|
|
int inodes_per_cluster;
|
|
|
|
int i; /* inode chunk index */
|
|
|
|
|
|
|
|
agbno = XFS_AGINO_TO_AGBNO(mp, irec->ir_startino);
|
|
|
|
blks_per_cluster = xfs_icluster_size_fsb(mp);
|
|
|
|
inodes_per_cluster = blks_per_cluster << mp->m_sb.sb_inopblog;
|
|
|
|
|
|
|
|
blk_start_plug(&plug);
|
|
|
|
for (i = 0; i < XFS_INODES_PER_CHUNK;
|
|
|
|
i += inodes_per_cluster, agbno += blks_per_cluster) {
|
|
|
|
if (xfs_inobt_maskn(i, inodes_per_cluster) & ~irec->ir_free) {
|
|
|
|
xfs_btree_reada_bufs(mp, agno, agbno, blks_per_cluster,
|
|
|
|
&xfs_inode_buf_ops);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
blk_finish_plug(&plug);
|
|
|
|
}
|
|
|
|
|
2014-07-24 02:42:21 -06:00
|
|
|
/*
|
|
|
|
* Lookup the inode chunk that the given inode lives in and then get the record
|
|
|
|
* if we found the chunk. If the inode was not the last in the chunk and there
|
|
|
|
* are some left allocated, update the data for the pointed-to record as well as
|
|
|
|
* return the count of grabbed inodes.
|
|
|
|
*/
|
|
|
|
STATIC int
|
|
|
|
xfs_bulkstat_grab_ichunk(
|
|
|
|
struct xfs_btree_cur *cur, /* btree cursor */
|
|
|
|
xfs_agino_t agino, /* starting inode of chunk */
|
|
|
|
int *icount,/* return # of inodes grabbed */
|
|
|
|
struct xfs_inobt_rec_incore *irec) /* btree record */
|
|
|
|
{
|
|
|
|
int idx; /* index into inode chunk */
|
|
|
|
int stat;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
/* Lookup the inode chunk that this inode lives in */
|
|
|
|
error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &stat);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
if (!stat) {
|
|
|
|
*icount = 0;
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the record, should always work */
|
|
|
|
error = xfs_inobt_get_rec(cur, irec, &stat);
|
|
|
|
if (error)
|
|
|
|
return error;
|
2015-02-23 04:39:13 -07:00
|
|
|
XFS_WANT_CORRUPTED_RETURN(cur->bc_mp, stat == 1);
|
2014-07-24 02:42:21 -06:00
|
|
|
|
|
|
|
/* Check if the record contains the inode in request */
|
2014-11-06 14:31:15 -07:00
|
|
|
if (irec->ir_startino + XFS_INODES_PER_CHUNK <= agino) {
|
|
|
|
*icount = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
2014-07-24 02:42:21 -06:00
|
|
|
|
|
|
|
idx = agino - irec->ir_startino + 1;
|
|
|
|
if (idx < XFS_INODES_PER_CHUNK &&
|
|
|
|
(xfs_inobt_maskn(idx, XFS_INODES_PER_CHUNK - idx) & ~irec->ir_free)) {
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* We got a right chunk with some left inodes allocated at it.
|
|
|
|
* Grab the chunk record. Mark all the uninteresting inodes
|
|
|
|
* free -- because they're before our start point.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < idx; i++) {
|
|
|
|
if (XFS_INOBT_MASK(i) & ~irec->ir_free)
|
|
|
|
irec->ir_freecount++;
|
|
|
|
}
|
|
|
|
|
|
|
|
irec->ir_free |= xfs_inobt_maskn(0, idx);
|
2015-05-28 17:04:19 -06:00
|
|
|
*icount = irec->ir_count - irec->ir_freecount;
|
2014-07-24 02:42:21 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-11-22 22:30:32 -07:00
|
|
|
#define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
|
|
|
|
|
2014-11-06 14:30:30 -07:00
|
|
|
struct xfs_bulkstat_agichunk {
|
|
|
|
char __user **ac_ubuffer;/* pointer into user's buffer */
|
|
|
|
int ac_ubleft; /* bytes left in user's buffer */
|
|
|
|
int ac_ubelem; /* spaces used in user's buffer */
|
|
|
|
};
|
|
|
|
|
2014-08-03 19:22:31 -06:00
|
|
|
/*
|
|
|
|
* Process inodes in chunk with a pointer to a formatter function
|
|
|
|
* that will iget the inode and fill in the appropriate structure.
|
|
|
|
*/
|
2014-11-06 14:30:30 -07:00
|
|
|
static int
|
2014-08-03 19:22:31 -06:00
|
|
|
xfs_bulkstat_ag_ichunk(
|
|
|
|
struct xfs_mount *mp,
|
|
|
|
xfs_agnumber_t agno,
|
|
|
|
struct xfs_inobt_rec_incore *irbp,
|
|
|
|
bulkstat_one_pf formatter,
|
|
|
|
size_t statstruct_size,
|
2014-11-06 14:30:30 -07:00
|
|
|
struct xfs_bulkstat_agichunk *acp,
|
2014-11-06 14:33:52 -07:00
|
|
|
xfs_agino_t *last_agino)
|
2014-08-03 19:22:31 -06:00
|
|
|
{
|
|
|
|
char __user **ubufp = acp->ac_ubuffer;
|
2014-11-06 14:30:58 -07:00
|
|
|
int chunkidx;
|
2014-08-03 19:22:31 -06:00
|
|
|
int error = 0;
|
2014-11-06 14:33:52 -07:00
|
|
|
xfs_agino_t agino = irbp->ir_startino;
|
2014-08-03 19:22:31 -06:00
|
|
|
|
2014-11-06 14:30:58 -07:00
|
|
|
for (chunkidx = 0; chunkidx < XFS_INODES_PER_CHUNK;
|
|
|
|
chunkidx++, agino++) {
|
|
|
|
int fmterror;
|
2014-08-03 19:22:31 -06:00
|
|
|
int ubused;
|
2014-11-06 14:33:52 -07:00
|
|
|
|
|
|
|
/* inode won't fit in buffer, we are done */
|
|
|
|
if (acp->ac_ubleft < statstruct_size)
|
|
|
|
break;
|
2014-08-03 19:22:31 -06:00
|
|
|
|
|
|
|
/* Skip if this inode is free */
|
2014-11-06 14:33:52 -07:00
|
|
|
if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free)
|
2014-08-03 19:22:31 -06:00
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Get the inode and fill in a single buffer */
|
|
|
|
ubused = statstruct_size;
|
2014-11-06 14:33:52 -07:00
|
|
|
error = formatter(mp, XFS_AGINO_TO_INO(mp, agno, agino),
|
|
|
|
*ubufp, acp->ac_ubleft, &ubused, &fmterror);
|
|
|
|
|
2014-11-06 14:30:58 -07:00
|
|
|
if (fmterror == BULKSTAT_RV_GIVEUP ||
|
|
|
|
(error && error != -ENOENT && error != -EINVAL)) {
|
|
|
|
acp->ac_ubleft = 0;
|
2014-08-03 19:22:31 -06:00
|
|
|
ASSERT(error);
|
|
|
|
break;
|
|
|
|
}
|
2014-11-06 14:30:58 -07:00
|
|
|
|
|
|
|
/* be careful not to leak error if at end of chunk */
|
|
|
|
if (fmterror == BULKSTAT_RV_NOTHING || error) {
|
|
|
|
error = 0;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
*ubufp += ubused;
|
|
|
|
acp->ac_ubleft -= ubused;
|
|
|
|
acp->ac_ubelem++;
|
|
|
|
}
|
2014-08-03 19:22:31 -06:00
|
|
|
|
2014-11-06 14:33:52 -07:00
|
|
|
/*
|
|
|
|
* Post-update *last_agino. At this point, agino will always point one
|
|
|
|
* inode past the last inode we processed successfully. Hence we
|
|
|
|
* substract that inode when setting the *last_agino cursor so that we
|
|
|
|
* return the correct cookie to userspace. On the next bulkstat call,
|
|
|
|
* the inode under the lastino cookie will be skipped as we have already
|
|
|
|
* processed it here.
|
|
|
|
*/
|
|
|
|
*last_agino = agino - 1;
|
|
|
|
|
2014-08-03 19:22:31 -06:00
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Return stat information in bulk (by-inode) for the filesystem.
|
|
|
|
*/
|
|
|
|
int /* error status */
|
|
|
|
xfs_bulkstat(
|
|
|
|
xfs_mount_t *mp, /* mount point for filesystem */
|
|
|
|
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 */
|
|
|
|
size_t statstruct_size, /* sizeof struct filling */
|
|
|
|
char __user *ubuffer, /* buffer with inode stats */
|
2006-03-28 15:55:14 -07:00
|
|
|
int *done) /* 1 if there are more stats to get */
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
xfs_buf_t *agbp; /* agi header buffer */
|
|
|
|
xfs_agino_t agino; /* inode # in allocation group */
|
|
|
|
xfs_agnumber_t agno; /* allocation group number */
|
|
|
|
xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */
|
2006-09-27 19:02:03 -06:00
|
|
|
xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
|
2005-04-16 16:20:36 -06:00
|
|
|
int nirbuf; /* size of irbuf */
|
|
|
|
int ubcount; /* size of user's buffer */
|
2014-11-06 14:30:30 -07:00
|
|
|
struct xfs_bulkstat_agichunk ac;
|
2014-11-06 14:31:13 -07:00
|
|
|
int error = 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Get the last inode value, see if there's nothing to do.
|
|
|
|
*/
|
2014-11-06 14:33:52 -07:00
|
|
|
agno = XFS_INO_TO_AGNO(mp, *lastinop);
|
|
|
|
agino = XFS_INO_TO_AGINO(mp, *lastinop);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (agno >= mp->m_sb.sb_agcount ||
|
2014-11-06 14:33:52 -07:00
|
|
|
*lastinop != XFS_AGINO_TO_INO(mp, agno, agino)) {
|
2005-04-16 16:20:36 -06:00
|
|
|
*done = 1;
|
|
|
|
*ubcountp = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
2014-07-24 02:40:26 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
ubcount = *ubcountp; /* statstruct's */
|
2014-11-06 14:30:30 -07:00
|
|
|
ac.ac_ubuffer = &ubuffer;
|
|
|
|
ac.ac_ubleft = ubcount * statstruct_size; /* bytes */;
|
|
|
|
ac.ac_ubelem = 0;
|
|
|
|
|
|
|
|
*ubcountp = 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
*done = 0;
|
2014-11-06 14:30:30 -07:00
|
|
|
|
2017-03-06 12:58:20 -07:00
|
|
|
irbuf = kmem_zalloc_large(PAGE_SIZE * 4, KM_SLEEP);
|
2010-01-20 14:55:30 -07:00
|
|
|
if (!irbuf)
|
2014-06-24 22:58:08 -06:00
|
|
|
return -ENOMEM;
|
2017-03-06 12:58:20 -07:00
|
|
|
nirbuf = (PAGE_SIZE * 4) / sizeof(*irbuf);
|
2006-09-27 19:02:09 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Loop over the allocation groups, starting from the last
|
|
|
|
* inode returned; 0 means start of the allocation group.
|
|
|
|
*/
|
2014-11-06 14:31:13 -07:00
|
|
|
while (agno < mp->m_sb.sb_agcount) {
|
|
|
|
struct xfs_inobt_rec_incore *irbp = irbuf;
|
|
|
|
struct xfs_inobt_rec_incore *irbufend = irbuf + nirbuf;
|
|
|
|
bool end_of_ag = false;
|
|
|
|
int icount = 0;
|
|
|
|
int stat;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
|
2014-07-24 02:40:43 -06:00
|
|
|
if (error)
|
|
|
|
break;
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Allocate and initialize a btree cursor for ialloc btree.
|
|
|
|
*/
|
2014-04-24 00:00:50 -06:00
|
|
|
cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
|
|
|
|
XFS_BTNUM_INO);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (agino > 0) {
|
|
|
|
/*
|
2014-07-24 02:42:21 -06:00
|
|
|
* In the middle of an allocation group, we need to get
|
|
|
|
* the remainder of the chunk we're in.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2014-07-24 02:42:21 -06:00
|
|
|
struct xfs_inobt_rec_incore r;
|
|
|
|
|
|
|
|
error = xfs_bulkstat_grab_ichunk(cur, agino, &icount, &r);
|
|
|
|
if (error)
|
2014-10-28 15:22:18 -06:00
|
|
|
goto del_cursor;
|
2014-07-24 02:42:21 -06:00
|
|
|
if (icount) {
|
2009-08-31 17:56:58 -06:00
|
|
|
irbp->ir_startino = r.ir_startino;
|
2015-05-28 17:04:19 -06:00
|
|
|
irbp->ir_holemask = r.ir_holemask;
|
|
|
|
irbp->ir_count = r.ir_count;
|
2009-08-31 17:56:58 -06:00
|
|
|
irbp->ir_freecount = r.ir_freecount;
|
|
|
|
irbp->ir_free = r.ir_free;
|
2005-04-16 16:20:36 -06:00
|
|
|
irbp++;
|
|
|
|
}
|
2014-07-24 02:42:21 -06:00
|
|
|
/* Increment to the next record */
|
2014-11-06 14:29:57 -07:00
|
|
|
error = xfs_btree_increment(cur, 0, &stat);
|
2005-04-16 16:20:36 -06:00
|
|
|
} else {
|
2014-07-24 02:42:21 -06:00
|
|
|
/* Start of ag. Lookup the first inode chunk */
|
2014-11-06 14:29:57 -07:00
|
|
|
error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &stat);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2014-11-06 14:29:57 -07:00
|
|
|
if (error || stat == 0) {
|
2014-11-06 14:31:13 -07:00
|
|
|
end_of_ag = true;
|
2014-10-28 15:22:18 -06:00
|
|
|
goto del_cursor;
|
2014-11-06 14:29:57 -07:00
|
|
|
}
|
2014-07-24 02:40:43 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Loop through inode btree records in this ag,
|
|
|
|
* until we run out of inodes or space in the buffer.
|
|
|
|
*/
|
|
|
|
while (irbp < irbufend && icount < ubcount) {
|
2014-07-24 02:40:43 -06:00
|
|
|
struct xfs_inobt_rec_incore r;
|
2009-08-31 17:56:58 -06:00
|
|
|
|
2014-11-06 14:29:57 -07:00
|
|
|
error = xfs_inobt_get_rec(cur, &r, &stat);
|
|
|
|
if (error || stat == 0) {
|
2014-11-06 14:31:13 -07:00
|
|
|
end_of_ag = true;
|
2014-10-28 15:22:18 -06:00
|
|
|
goto del_cursor;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2009-08-31 17:56:58 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* If this chunk has any allocated inodes, save it.
|
2006-09-27 19:02:03 -06:00
|
|
|
* Also start read-ahead now for this chunk.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2015-05-28 17:04:19 -06:00
|
|
|
if (r.ir_freecount < r.ir_count) {
|
2014-07-24 02:41:18 -06:00
|
|
|
xfs_bulkstat_ichunk_ra(mp, agno, &r);
|
2009-08-31 17:56:58 -06:00
|
|
|
irbp->ir_startino = r.ir_startino;
|
2015-05-28 17:04:19 -06:00
|
|
|
irbp->ir_holemask = r.ir_holemask;
|
|
|
|
irbp->ir_count = r.ir_count;
|
2009-08-31 17:56:58 -06:00
|
|
|
irbp->ir_freecount = r.ir_freecount;
|
|
|
|
irbp->ir_free = r.ir_free;
|
2005-04-16 16:20:36 -06:00
|
|
|
irbp++;
|
2015-05-28 17:04:19 -06:00
|
|
|
icount += r.ir_count - r.ir_freecount;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2014-11-06 14:29:57 -07:00
|
|
|
error = xfs_btree_increment(cur, 0, &stat);
|
|
|
|
if (error || stat == 0) {
|
2014-11-06 14:31:13 -07:00
|
|
|
end_of_ag = true;
|
2014-10-29 17:34:52 -06:00
|
|
|
goto del_cursor;
|
|
|
|
}
|
2007-11-22 22:30:32 -07:00
|
|
|
cond_resched();
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2014-10-28 15:22:18 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
2014-10-28 15:22:18 -06:00
|
|
|
* Drop the btree buffers and the agi buffer as we can't hold any
|
|
|
|
* of the locks these represent when calling iget. If there is a
|
|
|
|
* pending error, then we are done.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2014-10-28 15:22:18 -06:00
|
|
|
del_cursor:
|
2015-08-18 18:00:53 -06:00
|
|
|
xfs_btree_del_cursor(cur, error ?
|
|
|
|
XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
|
2005-04-16 16:20:36 -06:00
|
|
|
xfs_buf_relse(agbp);
|
2014-10-28 15:22:18 -06:00
|
|
|
if (error)
|
|
|
|
break;
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
2014-11-06 14:33:52 -07:00
|
|
|
* Now format all the good inodes into the user's buffer. The
|
|
|
|
* call to xfs_bulkstat_ag_ichunk() sets up the agino pointer
|
|
|
|
* for the next loop iteration.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
irbufend = irbp;
|
|
|
|
for (irbp = irbuf;
|
2014-11-06 14:31:13 -07:00
|
|
|
irbp < irbufend && ac.ac_ubleft >= statstruct_size;
|
2014-11-06 14:30:30 -07:00
|
|
|
irbp++) {
|
2014-08-03 19:22:31 -06:00
|
|
|
error = xfs_bulkstat_ag_ichunk(mp, agno, irbp,
|
2014-11-06 14:30:30 -07:00
|
|
|
formatter, statstruct_size, &ac,
|
2014-11-06 14:33:52 -07:00
|
|
|
&agino);
|
2014-08-03 19:22:31 -06:00
|
|
|
if (error)
|
2014-11-06 14:31:15 -07:00
|
|
|
break;
|
2014-08-03 19:22:31 -06:00
|
|
|
|
2007-11-22 22:30:32 -07:00
|
|
|
cond_resched();
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2014-11-06 14:30:30 -07:00
|
|
|
|
2014-11-06 14:31:15 -07:00
|
|
|
/*
|
|
|
|
* If we've run out of space or had a formatting error, we
|
|
|
|
* are now done
|
|
|
|
*/
|
|
|
|
if (ac.ac_ubleft < statstruct_size || error)
|
2005-04-16 16:20:36 -06:00
|
|
|
break;
|
2014-11-06 14:31:13 -07:00
|
|
|
|
|
|
|
if (end_of_ag) {
|
|
|
|
agno++;
|
|
|
|
agino = 0;
|
2014-11-06 14:33:52 -07:00
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Done, we're either out of filesystem or space to put the data.
|
|
|
|
*/
|
2013-09-02 04:53:00 -06:00
|
|
|
kmem_free(irbuf);
|
2014-11-06 14:30:30 -07:00
|
|
|
*ubcountp = ac.ac_ubelem;
|
2014-11-06 14:31:15 -07:00
|
|
|
|
2007-11-22 22:30:32 -07:00
|
|
|
/*
|
2014-11-06 14:31:15 -07:00
|
|
|
* We found some inodes, so clear the error status and return them.
|
|
|
|
* The lastino pointer will point directly at the inode that triggered
|
|
|
|
* any error that occurred, so on the next call the error will be
|
|
|
|
* triggered again and propagated to userspace as there will be no
|
|
|
|
* formatted inodes in the buffer.
|
2007-11-22 22:30:32 -07:00
|
|
|
*/
|
2014-11-06 14:30:30 -07:00
|
|
|
if (ac.ac_ubelem)
|
2014-11-06 14:31:15 -07:00
|
|
|
error = 0;
|
|
|
|
|
2014-11-06 14:33:52 -07:00
|
|
|
/*
|
|
|
|
* If we ran out of filesystem, lastino will point off the end of
|
|
|
|
* the filesystem so the next call will return immediately.
|
|
|
|
*/
|
|
|
|
*lastinop = XFS_AGINO_TO_INO(mp, agno, agino);
|
|
|
|
if (agno >= mp->m_sb.sb_agcount)
|
2005-04-16 16:20:36 -06:00
|
|
|
*done = 1;
|
|
|
|
|
2014-11-06 14:31:15 -07:00
|
|
|
return error;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2007-07-10 19:10:19 -06:00
|
|
|
int
|
|
|
|
xfs_inumbers_fmt(
|
|
|
|
void __user *ubuffer, /* buffer to write to */
|
2014-07-23 20:11:47 -06:00
|
|
|
const struct xfs_inogrp *buffer, /* buffer to read from */
|
2007-07-10 19:10:19 -06:00
|
|
|
long count, /* # of elements to read */
|
|
|
|
long *written) /* # of bytes written */
|
|
|
|
{
|
|
|
|
if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
|
|
|
|
return -EFAULT;
|
|
|
|
*written = count * sizeof(*buffer);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Return inode number table for the filesystem.
|
|
|
|
*/
|
|
|
|
int /* error status */
|
|
|
|
xfs_inumbers(
|
2014-07-23 20:11:47 -06:00
|
|
|
struct xfs_mount *mp,/* mount point for filesystem */
|
|
|
|
xfs_ino_t *lastino,/* last inode returned */
|
|
|
|
int *count,/* size of buffer/count returned */
|
|
|
|
void __user *ubuffer,/* buffer with inode descriptions */
|
|
|
|
inumbers_fmt_pf formatter)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2014-07-23 20:11:47 -06:00
|
|
|
xfs_agnumber_t agno = XFS_INO_TO_AGNO(mp, *lastino);
|
|
|
|
xfs_agino_t agino = XFS_INO_TO_AGINO(mp, *lastino);
|
|
|
|
struct xfs_btree_cur *cur = NULL;
|
2014-07-23 20:18:47 -06:00
|
|
|
struct xfs_buf *agbp = NULL;
|
2014-07-23 20:11:47 -06:00
|
|
|
struct xfs_inogrp *buffer;
|
|
|
|
int bcount;
|
|
|
|
int left = *count;
|
|
|
|
int bufidx = 0;
|
|
|
|
int error = 0;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
*count = 0;
|
2014-07-23 20:11:47 -06:00
|
|
|
if (agno >= mp->m_sb.sb_agcount ||
|
|
|
|
*lastino != XFS_AGINO_TO_INO(mp, agno, agino))
|
|
|
|
return error;
|
|
|
|
|
2007-11-22 22:30:42 -07:00
|
|
|
bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
|
2017-04-03 13:22:39 -06:00
|
|
|
buffer = kmem_zalloc(bcount * sizeof(*buffer), KM_SLEEP);
|
2014-07-23 20:18:47 -06:00
|
|
|
do {
|
2014-07-23 20:11:47 -06:00
|
|
|
struct xfs_inobt_rec_incore r;
|
|
|
|
int stat;
|
|
|
|
|
2014-07-23 20:18:47 -06:00
|
|
|
if (!agbp) {
|
2005-04-16 16:20:36 -06:00
|
|
|
error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
|
2014-07-23 20:18:47 -06:00
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
|
2014-04-24 00:00:50 -06:00
|
|
|
cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
|
|
|
|
XFS_BTNUM_INO);
|
2009-08-31 17:58:21 -06:00
|
|
|
error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE,
|
2014-07-23 20:11:47 -06:00
|
|
|
&stat);
|
2014-07-23 20:18:47 -06:00
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (!stat)
|
|
|
|
goto next_ag;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2014-07-23 20:18:47 -06:00
|
|
|
|
2014-07-23 20:11:47 -06:00
|
|
|
error = xfs_inobt_get_rec(cur, &r, &stat);
|
2014-07-23 20:18:47 -06:00
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (!stat)
|
|
|
|
goto next_ag;
|
|
|
|
|
2009-08-31 17:56:58 -06:00
|
|
|
agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1;
|
|
|
|
buffer[bufidx].xi_startino =
|
|
|
|
XFS_AGINO_TO_INO(mp, agno, r.ir_startino);
|
2015-05-28 17:04:19 -06:00
|
|
|
buffer[bufidx].xi_alloccount = r.ir_count - r.ir_freecount;
|
2009-08-31 17:56:58 -06:00
|
|
|
buffer[bufidx].xi_allocmask = ~r.ir_free;
|
2014-07-23 20:18:47 -06:00
|
|
|
if (++bufidx == bcount) {
|
|
|
|
long written;
|
|
|
|
|
2014-07-23 20:11:47 -06:00
|
|
|
error = formatter(ubuffer, buffer, bufidx, &written);
|
|
|
|
if (error)
|
2005-04-16 16:20:36 -06:00
|
|
|
break;
|
2007-07-10 19:10:19 -06:00
|
|
|
ubuffer += written;
|
2005-04-16 16:20:36 -06:00
|
|
|
*count += bufidx;
|
|
|
|
bufidx = 0;
|
|
|
|
}
|
2014-07-23 20:18:47 -06:00
|
|
|
if (!--left)
|
|
|
|
break;
|
|
|
|
|
|
|
|
error = xfs_btree_increment(cur, 0, &stat);
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (stat)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
next_ag:
|
|
|
|
xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
|
|
|
|
cur = NULL;
|
|
|
|
xfs_buf_relse(agbp);
|
|
|
|
agbp = NULL;
|
|
|
|
agino = 0;
|
2014-10-12 17:21:53 -06:00
|
|
|
agno++;
|
|
|
|
} while (agno < mp->m_sb.sb_agcount);
|
2014-07-23 20:18:47 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
if (!error) {
|
|
|
|
if (bufidx) {
|
2014-07-23 20:18:47 -06:00
|
|
|
long written;
|
|
|
|
|
2014-07-23 20:11:47 -06:00
|
|
|
error = formatter(ubuffer, buffer, bufidx, &written);
|
|
|
|
if (!error)
|
2005-04-16 16:20:36 -06:00
|
|
|
*count += bufidx;
|
|
|
|
}
|
|
|
|
*lastino = XFS_AGINO_TO_INO(mp, agno, agino);
|
|
|
|
}
|
2014-07-23 20:18:47 -06:00
|
|
|
|
2008-05-19 00:31:57 -06:00
|
|
|
kmem_free(buffer);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (cur)
|
|
|
|
xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
|
|
|
|
XFS_BTREE_NOERROR));
|
|
|
|
if (agbp)
|
|
|
|
xfs_buf_relse(agbp);
|
2014-07-23 20:18:47 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
return error;
|
|
|
|
}
|