2 * Copyright (c) 2000-2002 Silicon Graphics, Inc. All Rights Reserved.
4 * This program is free software; you can redistribute it and/or modify it
5 * under the terms of version 2 of the GNU General Public License as
6 * published by the Free Software Foundation.
8 * This program is distributed in the hope that it would be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
12 * Further, this software is distributed without any warranty that it is
13 * free of the rightful claim of any third person regarding infringement
14 * or the like. Any license provided herein, whether implied or
15 * otherwise, applies only to this software file. Patent licenses, if
16 * any, provided herein do not apply to combinations of this program with
17 * other software, or any other product whatsoever.
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write the Free Software Foundation, Inc., 59
21 * Temple Place - Suite 330, Boston MA 02111-1307, USA.
23 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
24 * Mountain View, CA 94043, or:
28 * For further information regarding this notice, see:
30 * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
34 #include "xfs_macros.h"
35 #include "xfs_types.h"
38 #include "xfs_trans.h"
42 #include "xfs_dmapi.h"
43 #include "xfs_mount.h"
45 #include "xfs_alloc_btree.h"
46 #include "xfs_bmap_btree.h"
47 #include "xfs_ialloc_btree.h"
48 #include "xfs_btree.h"
49 #include "xfs_attr_sf.h"
50 #include "xfs_dir_sf.h"
51 #include "xfs_dir2_sf.h"
52 #include "xfs_dinode.h"
53 #include "xfs_inode.h"
54 #include "xfs_ialloc.h"
55 #include "xfs_itable.h"
56 #include "xfs_error.h"
59 #define useracc(ubuffer, size, flags, foo) (0)
60 #define unuseracc(ubuffer, size, flags)
64 xfs_bulkstat_one_iget(
65 xfs_mount_t
*mp
, /* mount point for filesystem */
66 xfs_ino_t ino
, /* inode number to get data for */
67 xfs_daddr_t bno
, /* starting bno of inode cluster */
68 xfs_bstat_t
*buf
, /* return buffer */
69 int *stat
) /* BULKSTAT_RV_... */
71 xfs_dinode_core_t
*dic
; /* dinode core info pointer */
72 xfs_inode_t
*ip
; /* incore inode pointer */
75 error
= xfs_iget(mp
, NULL
, ino
, 0, XFS_ILOCK_SHARED
, &ip
, bno
);
77 *stat
= BULKSTAT_RV_NOTHING
;
82 ASSERT(ip
->i_blkno
!= (xfs_daddr_t
)0);
83 if (ip
->i_d
.di_mode
== 0) {
84 *stat
= BULKSTAT_RV_NOTHING
;
85 error
= XFS_ERROR(ENOENT
);
91 /* xfs_iget returns the following without needing
94 buf
->bs_nlink
= dic
->di_nlink
;
95 buf
->bs_projid
= dic
->di_projid
;
97 buf
->bs_mode
= dic
->di_mode
;
98 buf
->bs_uid
= dic
->di_uid
;
99 buf
->bs_gid
= dic
->di_gid
;
100 buf
->bs_size
= dic
->di_size
;
101 buf
->bs_atime
.tv_sec
= dic
->di_atime
.t_sec
;
102 buf
->bs_atime
.tv_nsec
= dic
->di_atime
.t_nsec
;
103 buf
->bs_mtime
.tv_sec
= dic
->di_mtime
.t_sec
;
104 buf
->bs_mtime
.tv_nsec
= dic
->di_mtime
.t_nsec
;
105 buf
->bs_ctime
.tv_sec
= dic
->di_ctime
.t_sec
;
106 buf
->bs_ctime
.tv_nsec
= dic
->di_ctime
.t_nsec
;
107 buf
->bs_xflags
= xfs_ip2xflags(ip
);
108 buf
->bs_extsize
= dic
->di_extsize
<< mp
->m_sb
.sb_blocklog
;
109 buf
->bs_extents
= dic
->di_nextents
;
110 buf
->bs_gen
= dic
->di_gen
;
111 memset(buf
->bs_pad
, 0, sizeof(buf
->bs_pad
));
112 buf
->bs_dmevmask
= dic
->di_dmevmask
;
113 buf
->bs_dmstate
= dic
->di_dmstate
;
114 buf
->bs_aextents
= dic
->di_anextents
;
116 switch (dic
->di_format
) {
117 case XFS_DINODE_FMT_DEV
:
118 buf
->bs_rdev
= ip
->i_df
.if_u2
.if_rdev
;
119 buf
->bs_blksize
= BLKDEV_IOSIZE
;
122 case XFS_DINODE_FMT_LOCAL
:
123 case XFS_DINODE_FMT_UUID
:
125 buf
->bs_blksize
= mp
->m_sb
.sb_blocksize
;
128 case XFS_DINODE_FMT_EXTENTS
:
129 case XFS_DINODE_FMT_BTREE
:
131 buf
->bs_blksize
= mp
->m_sb
.sb_blocksize
;
132 buf
->bs_blocks
= dic
->di_nblocks
+ ip
->i_delayed_blks
;
137 xfs_iput(ip
, XFS_ILOCK_SHARED
);
142 xfs_bulkstat_one_dinode(
143 xfs_mount_t
*mp
, /* mount point for filesystem */
144 xfs_ino_t ino
, /* inode number to get data for */
145 xfs_dinode_t
*dip
, /* dinode inode pointer */
146 xfs_bstat_t
*buf
) /* return buffer */
148 xfs_dinode_core_t
*dic
; /* dinode core info pointer */
153 * The inode format changed when we moved the link count and
154 * made it 32 bits long. If this is an old format inode,
155 * convert it in memory to look like a new one. If it gets
156 * flushed to disk we will convert back before flushing or
157 * logging it. We zero out the new projid field and the old link
158 * count field. We'll handle clearing the pad field (the remains
159 * of the old uuid field) when we actually convert the inode to
160 * the new format. We don't change the version number so that we
161 * can distinguish this from a real new format inode.
163 if (INT_GET(dic
->di_version
, ARCH_CONVERT
) == XFS_DINODE_VERSION_1
) {
164 buf
->bs_nlink
= INT_GET(dic
->di_onlink
, ARCH_CONVERT
);
167 buf
->bs_nlink
= INT_GET(dic
->di_nlink
, ARCH_CONVERT
);
168 buf
->bs_projid
= INT_GET(dic
->di_projid
, ARCH_CONVERT
);
172 buf
->bs_mode
= INT_GET(dic
->di_mode
, ARCH_CONVERT
);
173 buf
->bs_uid
= INT_GET(dic
->di_uid
, ARCH_CONVERT
);
174 buf
->bs_gid
= INT_GET(dic
->di_gid
, ARCH_CONVERT
);
175 buf
->bs_size
= INT_GET(dic
->di_size
, ARCH_CONVERT
);
176 buf
->bs_atime
.tv_sec
= INT_GET(dic
->di_atime
.t_sec
, ARCH_CONVERT
);
177 buf
->bs_atime
.tv_nsec
= INT_GET(dic
->di_atime
.t_nsec
, ARCH_CONVERT
);
178 buf
->bs_mtime
.tv_sec
= INT_GET(dic
->di_mtime
.t_sec
, ARCH_CONVERT
);
179 buf
->bs_mtime
.tv_nsec
= INT_GET(dic
->di_mtime
.t_nsec
, ARCH_CONVERT
);
180 buf
->bs_ctime
.tv_sec
= INT_GET(dic
->di_ctime
.t_sec
, ARCH_CONVERT
);
181 buf
->bs_ctime
.tv_nsec
= INT_GET(dic
->di_ctime
.t_nsec
, ARCH_CONVERT
);
182 buf
->bs_xflags
= xfs_dic2xflags(dic
);
183 buf
->bs_extsize
= INT_GET(dic
->di_extsize
, ARCH_CONVERT
) << mp
->m_sb
.sb_blocklog
;
184 buf
->bs_extents
= INT_GET(dic
->di_nextents
, ARCH_CONVERT
);
185 buf
->bs_gen
= INT_GET(dic
->di_gen
, ARCH_CONVERT
);
186 memset(buf
->bs_pad
, 0, sizeof(buf
->bs_pad
));
187 buf
->bs_dmevmask
= INT_GET(dic
->di_dmevmask
, ARCH_CONVERT
);
188 buf
->bs_dmstate
= INT_GET(dic
->di_dmstate
, ARCH_CONVERT
);
189 buf
->bs_aextents
= INT_GET(dic
->di_anextents
, ARCH_CONVERT
);
191 switch (INT_GET(dic
->di_format
, ARCH_CONVERT
)) {
192 case XFS_DINODE_FMT_DEV
:
193 buf
->bs_rdev
= INT_GET(dip
->di_u
.di_dev
, ARCH_CONVERT
);
194 buf
->bs_blksize
= BLKDEV_IOSIZE
;
197 case XFS_DINODE_FMT_LOCAL
:
198 case XFS_DINODE_FMT_UUID
:
200 buf
->bs_blksize
= mp
->m_sb
.sb_blocksize
;
203 case XFS_DINODE_FMT_EXTENTS
:
204 case XFS_DINODE_FMT_BTREE
:
206 buf
->bs_blksize
= mp
->m_sb
.sb_blocksize
;
207 buf
->bs_blocks
= INT_GET(dic
->di_nblocks
, ARCH_CONVERT
);
215 * Return stat information for one inode.
216 * Return 0 if ok, else errno.
218 int /* error status */
220 xfs_mount_t
*mp
, /* mount point for filesystem */
221 xfs_ino_t ino
, /* inode number to get data for */
222 void __user
*buffer
, /* buffer to place output in */
223 int ubsize
, /* size of buffer */
224 void *private_data
, /* my private data */
225 xfs_daddr_t bno
, /* starting bno of inode cluster */
226 int *ubused
, /* bytes used by me */
227 void *dibuff
, /* on-disk inode buffer */
228 int *stat
) /* BULKSTAT_RV_... */
230 xfs_bstat_t
*buf
; /* return buffer */
231 int error
= 0; /* error value */
232 xfs_dinode_t
*dip
; /* dinode inode pointer */
234 dip
= (xfs_dinode_t
*)dibuff
;
236 if (!buffer
|| ino
== mp
->m_sb
.sb_rbmino
|| ino
== mp
->m_sb
.sb_rsumino
||
237 (XFS_SB_VERSION_HASQUOTA(&mp
->m_sb
) &&
238 (ino
== mp
->m_sb
.sb_uquotino
|| ino
== mp
->m_sb
.sb_gquotino
))) {
239 *stat
= BULKSTAT_RV_NOTHING
;
240 return XFS_ERROR(EINVAL
);
242 if (ubsize
< sizeof(*buf
)) {
243 *stat
= BULKSTAT_RV_NOTHING
;
244 return XFS_ERROR(ENOMEM
);
247 buf
= kmem_alloc(sizeof(*buf
), KM_SLEEP
);
250 /* We're not being passed a pointer to a dinode. This happens
251 * if BULKSTAT_FG_IGET is selected. Do the iget.
253 error
= xfs_bulkstat_one_iget(mp
, ino
, bno
, buf
, stat
);
257 xfs_bulkstat_one_dinode(mp
, ino
, dip
, buf
);
260 if (copy_to_user(buffer
, buf
, sizeof(*buf
))) {
261 *stat
= BULKSTAT_RV_NOTHING
;
266 *stat
= BULKSTAT_RV_DIDONE
;
268 *ubused
= sizeof(*buf
);
271 kmem_free(buf
, sizeof(*buf
));
276 * Return stat information in bulk (by-inode) for the filesystem.
278 int /* error status */
280 xfs_mount_t
*mp
, /* mount point for filesystem */
281 xfs_ino_t
*lastinop
, /* last inode returned */
282 int *ubcountp
, /* size of buffer/count returned */
283 bulkstat_one_pf formatter
, /* func that'd fill a single buf */
284 void *private_data
,/* private data for formatter */
285 size_t statstruct_size
, /* sizeof struct filling */
286 char __user
*ubuffer
, /* buffer with inode stats */
287 int flags
, /* defined in xfs_itable.h */
288 int *done
) /* 1 if there're more stats to get */
290 xfs_agblock_t agbno
=0;/* allocation group block number */
291 xfs_buf_t
*agbp
; /* agi header buffer */
292 xfs_agi_t
*agi
; /* agi header data */
293 xfs_agino_t agino
; /* inode # in allocation group */
294 xfs_agnumber_t agno
; /* allocation group number */
295 xfs_daddr_t bno
; /* inode cluster start daddr */
296 int chunkidx
; /* current index into inode chunk */
297 int clustidx
; /* current index into inode cluster */
298 xfs_btree_cur_t
*cur
; /* btree cursor for ialloc btree */
299 int end_of_ag
; /* set if we've seen the ag end */
300 int error
; /* error code */
301 int fmterror
;/* bulkstat formatter result */
302 __int32_t gcnt
; /* current btree rec's count */
303 xfs_inofree_t gfree
; /* current btree rec's free mask */
304 xfs_agino_t gino
; /* current btree rec's start inode */
305 int i
; /* loop index */
306 int icount
; /* count of inodes good in irbuf */
307 xfs_ino_t ino
; /* inode number (filesystem) */
308 xfs_inobt_rec_t
*irbp
; /* current irec buffer pointer */
309 xfs_inobt_rec_t
*irbuf
; /* start of irec buffer */
310 xfs_inobt_rec_t
*irbufend
; /* end of good irec buffer entries */
311 xfs_ino_t lastino
=0; /* last inode number returned */
312 int nbcluster
; /* # of blocks in a cluster */
313 int nicluster
; /* # of inodes in a cluster */
314 int nimask
; /* mask for inode clusters */
315 int nirbuf
; /* size of irbuf */
316 int rval
; /* return value error code */
317 int tmp
; /* result value from btree calls */
318 int ubcount
; /* size of user's buffer */
319 int ubleft
; /* bytes left in user's buffer */
320 char __user
*ubufp
; /* pointer into user's buffer */
321 int ubelem
; /* spaces used in user's buffer */
322 int ubused
; /* bytes used by formatter */
323 xfs_buf_t
*bp
; /* ptr to on-disk inode cluster buf */
324 xfs_dinode_t
*dip
; /* ptr into bp for specific inode */
325 xfs_inode_t
*ip
; /* ptr to in-core inode struct */
328 * Get the last inode value, see if there's nothing to do.
330 ino
= (xfs_ino_t
)*lastinop
;
332 agno
= XFS_INO_TO_AGNO(mp
, ino
);
333 agino
= XFS_INO_TO_AGINO(mp
, ino
);
334 if (agno
>= mp
->m_sb
.sb_agcount
||
335 ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
340 ubcount
= *ubcountp
; /* statstruct's */
341 ubleft
= ubcount
* statstruct_size
; /* bytes */
342 *ubcountp
= ubelem
= 0;
346 nicluster
= mp
->m_sb
.sb_blocksize
>= XFS_INODE_CLUSTER_SIZE(mp
) ?
347 mp
->m_sb
.sb_inopblock
:
348 (XFS_INODE_CLUSTER_SIZE(mp
) >> mp
->m_sb
.sb_inodelog
);
349 nimask
= ~(nicluster
- 1);
350 nbcluster
= nicluster
>> mp
->m_sb
.sb_inopblog
;
352 * Lock down the user's buffer. If a buffer was not sent, as in the case
353 * disk quota code calls here, we skip this.
356 (error
= useracc(ubuffer
, ubcount
* statstruct_size
,
357 (B_READ
|B_PHYS
), NULL
))) {
361 * Allocate a page-sized buffer for inode btree records.
362 * We could try allocating something smaller, but for normal
363 * calls we'll always (potentially) need the whole page.
365 irbuf
= kmem_alloc(NBPC
, KM_SLEEP
);
366 nirbuf
= NBPC
/ sizeof(*irbuf
);
368 * Loop over the allocation groups, starting from the last
369 * inode returned; 0 means start of the allocation group.
372 while (ubleft
>= statstruct_size
&& agno
< mp
->m_sb
.sb_agcount
) {
374 down_read(&mp
->m_peraglock
);
375 error
= xfs_ialloc_read_agi(mp
, NULL
, agno
, &agbp
);
376 up_read(&mp
->m_peraglock
);
379 * Skip this allocation group and go to the next one.
385 agi
= XFS_BUF_TO_AGI(agbp
);
387 * Allocate and initialize a btree cursor for ialloc btree.
389 cur
= xfs_btree_init_cursor(mp
, NULL
, agbp
, agno
, XFS_BTNUM_INO
,
390 (xfs_inode_t
*)0, 0);
392 irbufend
= irbuf
+ nirbuf
;
395 * If we're returning in the middle of an allocation group,
396 * we need to get the remainder of the chunk we're in.
400 * Lookup the inode chunk that this inode lives in.
402 error
= xfs_inobt_lookup_le(cur
, agino
, 0, 0, &tmp
);
403 if (!error
&& /* no I/O error */
404 tmp
&& /* lookup succeeded */
405 /* got the record, should always work */
406 !(error
= xfs_inobt_get_rec(cur
, &gino
, &gcnt
,
409 /* this is the right chunk */
410 agino
< gino
+ XFS_INODES_PER_CHUNK
&&
411 /* lastino was not last in chunk */
412 (chunkidx
= agino
- gino
+ 1) <
413 XFS_INODES_PER_CHUNK
&&
414 /* there are some left allocated */
415 XFS_INOBT_MASKN(chunkidx
,
416 XFS_INODES_PER_CHUNK
- chunkidx
) & ~gfree
) {
418 * Grab the chunk record. Mark all the
419 * uninteresting inodes (because they're
420 * before our start point) free.
422 for (i
= 0; i
< chunkidx
; i
++) {
423 if (XFS_INOBT_MASK(i
) & ~gfree
)
426 gfree
|= XFS_INOBT_MASKN(0, chunkidx
);
427 INT_SET(irbp
->ir_startino
, ARCH_CONVERT
, gino
);
428 INT_SET(irbp
->ir_freecount
, ARCH_CONVERT
, gcnt
);
429 INT_SET(irbp
->ir_free
, ARCH_CONVERT
, gfree
);
431 agino
= gino
+ XFS_INODES_PER_CHUNK
;
432 icount
= XFS_INODES_PER_CHUNK
- gcnt
;
435 * If any of those tests failed, bump the
436 * inode number (just in case).
442 * In any case, increment to the next record.
445 error
= xfs_inobt_increment(cur
, 0, &tmp
);
448 * Start of ag. Lookup the first inode chunk.
450 error
= xfs_inobt_lookup_ge(cur
, 0, 0, 0, &tmp
);
454 * Loop through inode btree records in this ag,
455 * until we run out of inodes or space in the buffer.
457 while (irbp
< irbufend
&& icount
< ubcount
) {
459 * Loop as long as we're unable to read the
463 agino
+= XFS_INODES_PER_CHUNK
;
464 if (XFS_AGINO_TO_AGBNO(mp
, agino
) >=
465 INT_GET(agi
->agi_length
, ARCH_CONVERT
))
467 error
= xfs_inobt_lookup_ge(cur
, agino
, 0, 0,
471 * If ran off the end of the ag either with an error,
472 * or the normal way, set end and stop collecting.
475 (error
= xfs_inobt_get_rec(cur
, &gino
, &gcnt
,
482 * If this chunk has any allocated inodes, save it.
484 if (gcnt
< XFS_INODES_PER_CHUNK
) {
485 INT_SET(irbp
->ir_startino
, ARCH_CONVERT
, gino
);
486 INT_SET(irbp
->ir_freecount
, ARCH_CONVERT
, gcnt
);
487 INT_SET(irbp
->ir_free
, ARCH_CONVERT
, gfree
);
489 icount
+= XFS_INODES_PER_CHUNK
- gcnt
;
492 * Set agino to after this chunk and bump the cursor.
494 agino
= gino
+ XFS_INODES_PER_CHUNK
;
495 error
= xfs_inobt_increment(cur
, 0, &tmp
);
498 * Drop the btree buffers and the agi buffer.
499 * We can't hold any of the locks these represent
502 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
505 * Now format all the good inodes into the user's buffer.
509 irbp
< irbufend
&& ubleft
>= statstruct_size
; irbp
++) {
511 * Read-ahead the next chunk's worth of inodes.
513 if (&irbp
[1] < irbufend
) {
515 * Loop over all clusters in the next chunk.
516 * Do a readahead if there are any allocated
517 * inodes in that cluster.
519 for (agbno
= XFS_AGINO_TO_AGBNO(mp
,
520 INT_GET(irbp
[1].ir_startino
, ARCH_CONVERT
)),
522 chunkidx
< XFS_INODES_PER_CHUNK
;
523 chunkidx
+= nicluster
,
524 agbno
+= nbcluster
) {
525 if (XFS_INOBT_MASKN(chunkidx
,
527 ~(INT_GET(irbp
[1].ir_free
, ARCH_CONVERT
)))
528 xfs_btree_reada_bufs(mp
, agno
,
533 * Now process this chunk of inodes.
535 for (agino
= INT_GET(irbp
->ir_startino
, ARCH_CONVERT
), chunkidx
= 0, clustidx
= 0;
537 INT_GET(irbp
->ir_freecount
, ARCH_CONVERT
) < XFS_INODES_PER_CHUNK
;
538 chunkidx
++, clustidx
++, agino
++) {
539 ASSERT(chunkidx
< XFS_INODES_PER_CHUNK
);
541 * Recompute agbno if this is the
542 * first inode of the cluster.
544 * Careful with clustidx. There can be
545 * multple clusters per chunk, a single
546 * cluster per chunk or a cluster that has
547 * inodes represented from several different
548 * chunks (if blocksize is large).
550 * Because of this, the starting clustidx is
551 * initialized to zero in this loop but must
552 * later be reset after reading in the cluster
555 if ((chunkidx
& (nicluster
- 1)) == 0) {
556 agbno
= XFS_AGINO_TO_AGBNO(mp
,
557 INT_GET(irbp
->ir_startino
, ARCH_CONVERT
)) +
558 ((chunkidx
& nimask
) >>
559 mp
->m_sb
.sb_inopblog
);
561 if (flags
& BULKSTAT_FG_QUICK
) {
562 ino
= XFS_AGINO_TO_INO(mp
, agno
,
564 bno
= XFS_AGB_TO_DADDR(mp
, agno
,
568 * Get the inode cluster buffer
570 ASSERT(xfs_inode_zone
!= NULL
);
571 ip
= kmem_zone_zalloc(xfs_inode_zone
,
577 error
= xfs_itobp(mp
, NULL
, ip
,
580 clustidx
= ip
->i_boffset
/ mp
->m_sb
.sb_inodesize
;
581 kmem_zone_free(xfs_inode_zone
, ip
);
582 if (XFS_TEST_ERROR(error
!= 0,
583 mp
, XFS_ERRTAG_BULKSTAT_READ_CHUNK
,
584 XFS_RANDOM_BULKSTAT_READ_CHUNK
)) {
591 * Skip if this inode is free.
593 if (XFS_INOBT_MASK(chunkidx
) & INT_GET(irbp
->ir_free
, ARCH_CONVERT
))
596 * Count used inodes as free so we can tell
597 * when the chunk is used up.
599 INT_MOD(irbp
->ir_freecount
, ARCH_CONVERT
, +1);
600 ino
= XFS_AGINO_TO_INO(mp
, agno
, agino
);
601 bno
= XFS_AGB_TO_DADDR(mp
, agno
, agbno
);
602 if (flags
& BULKSTAT_FG_QUICK
) {
603 dip
= (xfs_dinode_t
*)xfs_buf_offset(bp
,
604 (clustidx
<< mp
->m_sb
.sb_inodelog
));
606 if (INT_GET(dip
->di_core
.di_magic
, ARCH_CONVERT
)
608 || !XFS_DINODE_GOOD_VERSION(
609 INT_GET(dip
->di_core
.di_version
, ARCH_CONVERT
)))
614 * Get the inode and fill in a single buffer.
615 * BULKSTAT_FG_QUICK uses dip to fill it in.
616 * BULKSTAT_FG_IGET uses igets.
617 * See: xfs_bulkstat_one & xfs_dm_bulkstat_one.
618 * This is also used to count inodes/blks, etc
619 * in xfs_qm_quotacheck.
621 ubused
= statstruct_size
;
622 error
= formatter(mp
, ino
, ubufp
,
623 ubleft
, private_data
,
624 bno
, &ubused
, dip
, &fmterror
);
625 if (fmterror
== BULKSTAT_RV_NOTHING
) {
630 if (fmterror
== BULKSTAT_RV_GIVEUP
) {
648 * Set up for the next loop iteration.
655 agino
= XFS_INO_TO_AGINO(mp
, lastino
);
660 * Done, we're either out of filesystem or space to put the data.
662 kmem_free(irbuf
, NBPC
);
664 unuseracc(ubuffer
, ubcount
* statstruct_size
, (B_READ
|B_PHYS
));
666 if (agno
>= mp
->m_sb
.sb_agcount
) {
668 * If we ran out of filesystem, mark lastino as off
669 * the end of the filesystem, so the next call
670 * will return immediately.
672 *lastinop
= (xfs_ino_t
)XFS_AGINO_TO_INO(mp
, agno
, 0);
675 *lastinop
= (xfs_ino_t
)lastino
;
681 * Return stat information in bulk (by-inode) for the filesystem.
682 * Special case for non-sequential one inode bulkstat.
684 int /* error status */
686 xfs_mount_t
*mp
, /* mount point for filesystem */
687 xfs_ino_t
*lastinop
, /* inode to return */
688 char __user
*buffer
, /* buffer with inode stats */
689 int *done
) /* 1 if there're more stats to get */
691 int count
; /* count value for bulkstat call */
692 int error
; /* return value */
693 xfs_ino_t ino
; /* filesystem inode number */
694 int res
; /* result from bs1 */
697 * note that requesting valid inode numbers which are not allocated
698 * to inodes will most likely cause xfs_itobp to generate warning
699 * messages about bad magic numbers. This is ok. The fact that
700 * the inode isn't actually an inode is handled by the
701 * error check below. Done this way to make the usual case faster
702 * at the expense of the error case.
705 ino
= (xfs_ino_t
)*lastinop
;
706 error
= xfs_bulkstat_one(mp
, ino
, buffer
, sizeof(xfs_bstat_t
),
707 NULL
, 0, NULL
, NULL
, &res
);
710 * Special case way failed, do it the "long" way
711 * to see if that works.
715 if (xfs_bulkstat(mp
, lastinop
, &count
, xfs_bulkstat_one
,
716 NULL
, sizeof(xfs_bstat_t
), buffer
,
717 BULKSTAT_FG_IGET
, done
))
719 if (count
== 0 || (xfs_ino_t
)*lastinop
!= ino
)
720 return error
== EFSCORRUPTED
?
721 XFS_ERROR(EINVAL
) : error
;
730 * Return inode number table for the filesystem.
732 int /* error status */
734 xfs_mount_t
*mp
, /* mount point for filesystem */
735 xfs_ino_t
*lastino
, /* last inode returned */
736 int *count
, /* size of buffer/count returned */
737 xfs_inogrp_t __user
*ubuffer
)/* buffer with inode descriptions */
743 xfs_inogrp_t
*buffer
;
745 xfs_btree_cur_t
*cur
;
755 ino
= (xfs_ino_t
)*lastino
;
756 agno
= XFS_INO_TO_AGNO(mp
, ino
);
757 agino
= XFS_INO_TO_AGINO(mp
, ino
);
760 bcount
= MIN(left
, (int)(NBPP
/ sizeof(*buffer
)));
761 buffer
= kmem_alloc(bcount
* sizeof(*buffer
), KM_SLEEP
);
765 while (left
> 0 && agno
< mp
->m_sb
.sb_agcount
) {
767 down_read(&mp
->m_peraglock
);
768 error
= xfs_ialloc_read_agi(mp
, NULL
, agno
, &agbp
);
769 up_read(&mp
->m_peraglock
);
772 * If we can't read the AGI of this ag,
773 * then just skip to the next one.
781 cur
= xfs_btree_init_cursor(mp
, NULL
, agbp
, agno
,
782 XFS_BTNUM_INO
, (xfs_inode_t
*)0, 0);
783 error
= xfs_inobt_lookup_ge(cur
, agino
, 0, 0, &tmp
);
785 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
790 * Move up the the last inode in the current
791 * chunk. The lookup_ge will always get
792 * us the first inode in the next chunk.
794 agino
+= XFS_INODES_PER_CHUNK
- 1;
798 if ((error
= xfs_inobt_get_rec(cur
, &gino
, &gcnt
, &gfree
,
803 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
809 agino
= gino
+ XFS_INODES_PER_CHUNK
- 1;
810 buffer
[bufidx
].xi_startino
= XFS_AGINO_TO_INO(mp
, agno
, gino
);
811 buffer
[bufidx
].xi_alloccount
= XFS_INODES_PER_CHUNK
- gcnt
;
812 buffer
[bufidx
].xi_allocmask
= ~gfree
;
815 if (bufidx
== bcount
) {
816 if (copy_to_user(ubuffer
, buffer
,
817 bufidx
* sizeof(*buffer
))) {
818 error
= XFS_ERROR(EFAULT
);
826 error
= xfs_inobt_increment(cur
, 0, &tmp
);
828 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
833 * The agino value has already been bumped.
834 * Just try to skip up to it.
836 agino
+= XFS_INODES_PER_CHUNK
;
843 if (copy_to_user(ubuffer
, buffer
,
844 bufidx
* sizeof(*buffer
)))
845 error
= XFS_ERROR(EFAULT
);
849 *lastino
= XFS_AGINO_TO_INO(mp
, agno
, agino
);
851 kmem_free(buffer
, bcount
* sizeof(*buffer
));
853 xfs_btree_del_cursor(cur
, (error
? XFS_BTREE_ERROR
: