2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "xfs_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
27 #include "xfs_mount.h"
28 #include "xfs_inode.h"
29 #include "xfs_btree.h"
30 #include "xfs_ialloc.h"
31 #include "xfs_ialloc_btree.h"
32 #include "xfs_itable.h"
33 #include "xfs_error.h"
34 #include "xfs_trace.h"
35 #include "xfs_icache.h"
36 #include "xfs_dinode.h"
43 return (ino
== mp
->m_sb
.sb_rbmino
|| ino
== mp
->m_sb
.sb_rsumino
||
44 (xfs_sb_version_hasquota(&mp
->m_sb
) &&
45 xfs_is_quota_inode(&mp
->m_sb
, ino
)));
49 * Return stat information for one inode.
50 * Return 0 if ok, else errno.
54 struct xfs_mount
*mp
, /* mount point for filesystem */
55 xfs_ino_t ino
, /* inode to get data for */
56 void __user
*buffer
, /* buffer to place output in */
57 int ubsize
, /* size of buffer */
58 bulkstat_one_fmt_pf formatter
, /* formatter, copy to user */
59 int *ubused
, /* bytes used by me */
60 int *stat
) /* BULKSTAT_RV_... */
62 struct xfs_icdinode
*dic
; /* dinode core info pointer */
63 struct xfs_inode
*ip
; /* incore inode pointer */
64 struct xfs_bstat
*buf
; /* return buffer */
65 int error
= 0; /* error value */
67 *stat
= BULKSTAT_RV_NOTHING
;
69 if (!buffer
|| xfs_internal_inum(mp
, ino
))
70 return XFS_ERROR(EINVAL
);
72 buf
= kmem_alloc(sizeof(*buf
), KM_SLEEP
| KM_MAYFAIL
);
74 return XFS_ERROR(ENOMEM
);
76 error
= xfs_iget(mp
, NULL
, ino
,
77 (XFS_IGET_DONTCACHE
| XFS_IGET_UNTRUSTED
),
78 XFS_ILOCK_SHARED
, &ip
);
80 *stat
= BULKSTAT_RV_NOTHING
;
85 ASSERT(ip
->i_imap
.im_blkno
!= 0);
89 /* xfs_iget returns the following without needing
92 buf
->bs_nlink
= dic
->di_nlink
;
93 buf
->bs_projid_lo
= dic
->di_projid_lo
;
94 buf
->bs_projid_hi
= dic
->di_projid_hi
;
96 buf
->bs_mode
= dic
->di_mode
;
97 buf
->bs_uid
= dic
->di_uid
;
98 buf
->bs_gid
= dic
->di_gid
;
99 buf
->bs_size
= dic
->di_size
;
100 buf
->bs_atime
.tv_sec
= dic
->di_atime
.t_sec
;
101 buf
->bs_atime
.tv_nsec
= dic
->di_atime
.t_nsec
;
102 buf
->bs_mtime
.tv_sec
= dic
->di_mtime
.t_sec
;
103 buf
->bs_mtime
.tv_nsec
= dic
->di_mtime
.t_nsec
;
104 buf
->bs_ctime
.tv_sec
= dic
->di_ctime
.t_sec
;
105 buf
->bs_ctime
.tv_nsec
= dic
->di_ctime
.t_nsec
;
106 buf
->bs_xflags
= xfs_ip2xflags(ip
);
107 buf
->bs_extsize
= dic
->di_extsize
<< mp
->m_sb
.sb_blocklog
;
108 buf
->bs_extents
= dic
->di_nextents
;
109 buf
->bs_gen
= dic
->di_gen
;
110 memset(buf
->bs_pad
, 0, sizeof(buf
->bs_pad
));
111 buf
->bs_dmevmask
= dic
->di_dmevmask
;
112 buf
->bs_dmstate
= dic
->di_dmstate
;
113 buf
->bs_aextents
= dic
->di_anextents
;
114 buf
->bs_forkoff
= XFS_IFORK_BOFF(ip
);
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
;
135 xfs_iunlock(ip
, XFS_ILOCK_SHARED
);
138 error
= formatter(buffer
, ubsize
, ubused
, buf
);
141 *stat
= BULKSTAT_RV_DIDONE
;
148 /* Return 0 on success or positive error */
150 xfs_bulkstat_one_fmt(
151 void __user
*ubuffer
,
154 const xfs_bstat_t
*buffer
)
156 if (ubsize
< sizeof(*buffer
))
157 return XFS_ERROR(ENOMEM
);
158 if (copy_to_user(ubuffer
, buffer
, sizeof(*buffer
)))
159 return XFS_ERROR(EFAULT
);
161 *ubused
= sizeof(*buffer
);
167 xfs_mount_t
*mp
, /* mount point for filesystem */
168 xfs_ino_t ino
, /* inode number to get data for */
169 void __user
*buffer
, /* buffer to place output in */
170 int ubsize
, /* size of buffer */
171 int *ubused
, /* bytes used by me */
172 int *stat
) /* BULKSTAT_RV_... */
174 return xfs_bulkstat_one_int(mp
, ino
, buffer
, ubsize
,
175 xfs_bulkstat_one_fmt
, ubused
, stat
);
178 #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
181 * Return stat information in bulk (by-inode) for the filesystem.
183 int /* error status */
185 xfs_mount_t
*mp
, /* mount point for filesystem */
186 xfs_ino_t
*lastinop
, /* last inode returned */
187 int *ubcountp
, /* size of buffer/count returned */
188 bulkstat_one_pf formatter
, /* func that'd fill a single buf */
189 size_t statstruct_size
, /* sizeof struct filling */
190 char __user
*ubuffer
, /* buffer with inode stats */
191 int *done
) /* 1 if there are more stats to get */
193 xfs_agblock_t agbno
=0;/* allocation group block number */
194 xfs_buf_t
*agbp
; /* agi header buffer */
195 xfs_agi_t
*agi
; /* agi header data */
196 xfs_agino_t agino
; /* inode # in allocation group */
197 xfs_agnumber_t agno
; /* allocation group number */
198 int chunkidx
; /* current index into inode chunk */
199 int clustidx
; /* current index into inode cluster */
200 xfs_btree_cur_t
*cur
; /* btree cursor for ialloc btree */
201 int end_of_ag
; /* set if we've seen the ag end */
202 int error
; /* error code */
203 int fmterror
;/* bulkstat formatter result */
204 int i
; /* loop index */
205 int icount
; /* count of inodes good in irbuf */
206 size_t irbsize
; /* size of irec buffer in bytes */
207 xfs_ino_t ino
; /* inode number (filesystem) */
208 xfs_inobt_rec_incore_t
*irbp
; /* current irec buffer pointer */
209 xfs_inobt_rec_incore_t
*irbuf
; /* start of irec buffer */
210 xfs_inobt_rec_incore_t
*irbufend
; /* end of good irec buffer entries */
211 xfs_ino_t lastino
; /* last inode number returned */
212 int blks_per_cluster
; /* # of blocks per cluster */
213 int inodes_per_cluster
;/* # of inodes per cluster */
214 int nirbuf
; /* size of irbuf */
215 int rval
; /* return value error code */
216 int tmp
; /* result value from btree calls */
217 int ubcount
; /* size of user's buffer */
218 int ubleft
; /* bytes left in user's buffer */
219 char __user
*ubufp
; /* pointer into user's buffer */
220 int ubelem
; /* spaces used in user's buffer */
221 int ubused
; /* bytes used by formatter */
224 * Get the last inode value, see if there's nothing to do.
226 ino
= (xfs_ino_t
)*lastinop
;
228 agno
= XFS_INO_TO_AGNO(mp
, ino
);
229 agino
= XFS_INO_TO_AGINO(mp
, ino
);
230 if (agno
>= mp
->m_sb
.sb_agcount
||
231 ino
!= XFS_AGINO_TO_INO(mp
, agno
, agino
)) {
236 if (!ubcountp
|| *ubcountp
<= 0) {
239 ubcount
= *ubcountp
; /* statstruct's */
240 ubleft
= ubcount
* statstruct_size
; /* bytes */
241 *ubcountp
= ubelem
= 0;
245 blks_per_cluster
= xfs_icluster_size_fsb(mp
);
246 inodes_per_cluster
= blks_per_cluster
<< mp
->m_sb
.sb_inopblog
;
247 irbuf
= kmem_zalloc_greedy(&irbsize
, PAGE_SIZE
, PAGE_SIZE
* 4);
251 nirbuf
= irbsize
/ sizeof(*irbuf
);
254 * Loop over the allocation groups, starting from the last
255 * inode returned; 0 means start of the allocation group.
258 while (XFS_BULKSTAT_UBLEFT(ubleft
) && agno
< mp
->m_sb
.sb_agcount
) {
260 error
= xfs_ialloc_read_agi(mp
, NULL
, agno
, &agbp
);
263 * Skip this allocation group and go to the next one.
269 agi
= XFS_BUF_TO_AGI(agbp
);
271 * Allocate and initialize a btree cursor for ialloc btree.
273 cur
= xfs_inobt_init_cursor(mp
, NULL
, agbp
, agno
);
275 irbufend
= irbuf
+ nirbuf
;
278 * If we're returning in the middle of an allocation group,
279 * we need to get the remainder of the chunk we're in.
282 xfs_inobt_rec_incore_t r
;
285 * Lookup the inode chunk that this inode lives in.
287 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_LE
,
289 if (!error
&& /* no I/O error */
290 tmp
&& /* lookup succeeded */
291 /* got the record, should always work */
292 !(error
= xfs_inobt_get_rec(cur
, &r
, &i
)) &&
294 /* this is the right chunk */
295 agino
< r
.ir_startino
+ XFS_INODES_PER_CHUNK
&&
296 /* lastino was not last in chunk */
297 (chunkidx
= agino
- r
.ir_startino
+ 1) <
298 XFS_INODES_PER_CHUNK
&&
299 /* there are some left allocated */
300 xfs_inobt_maskn(chunkidx
,
301 XFS_INODES_PER_CHUNK
- chunkidx
) &
304 * Grab the chunk record. Mark all the
305 * uninteresting inodes (because they're
306 * before our start point) free.
308 for (i
= 0; i
< chunkidx
; i
++) {
309 if (XFS_INOBT_MASK(i
) & ~r
.ir_free
)
312 r
.ir_free
|= xfs_inobt_maskn(0, chunkidx
);
313 irbp
->ir_startino
= r
.ir_startino
;
314 irbp
->ir_freecount
= r
.ir_freecount
;
315 irbp
->ir_free
= r
.ir_free
;
317 agino
= r
.ir_startino
+ XFS_INODES_PER_CHUNK
;
318 icount
= XFS_INODES_PER_CHUNK
- r
.ir_freecount
;
321 * If any of those tests failed, bump the
322 * inode number (just in case).
328 * In any case, increment to the next record.
331 error
= xfs_btree_increment(cur
, 0, &tmp
);
334 * Start of ag. Lookup the first inode chunk.
336 error
= xfs_inobt_lookup(cur
, 0, XFS_LOOKUP_GE
, &tmp
);
340 * Loop through inode btree records in this ag,
341 * until we run out of inodes or space in the buffer.
343 while (irbp
< irbufend
&& icount
< ubcount
) {
344 xfs_inobt_rec_incore_t r
;
347 * Loop as long as we're unable to read the
351 agino
+= XFS_INODES_PER_CHUNK
;
352 if (XFS_AGINO_TO_AGBNO(mp
, agino
) >=
353 be32_to_cpu(agi
->agi_length
))
355 error
= xfs_inobt_lookup(cur
, agino
,
356 XFS_LOOKUP_GE
, &tmp
);
360 * If ran off the end of the ag either with an error,
361 * or the normal way, set end and stop collecting.
368 error
= xfs_inobt_get_rec(cur
, &r
, &i
);
369 if (error
|| i
== 0) {
375 * If this chunk has any allocated inodes, save it.
376 * Also start read-ahead now for this chunk.
378 if (r
.ir_freecount
< XFS_INODES_PER_CHUNK
) {
379 struct blk_plug plug
;
381 * Loop over all clusters in the next chunk.
382 * Do a readahead if there are any allocated
383 * inodes in that cluster.
385 blk_start_plug(&plug
);
386 agbno
= XFS_AGINO_TO_AGBNO(mp
, r
.ir_startino
);
388 chunkidx
< XFS_INODES_PER_CHUNK
;
389 chunkidx
+= inodes_per_cluster
,
390 agbno
+= blks_per_cluster
) {
391 if (xfs_inobt_maskn(chunkidx
,
392 inodes_per_cluster
) & ~r
.ir_free
)
393 xfs_btree_reada_bufs(mp
, agno
,
394 agbno
, blks_per_cluster
,
397 blk_finish_plug(&plug
);
398 irbp
->ir_startino
= r
.ir_startino
;
399 irbp
->ir_freecount
= r
.ir_freecount
;
400 irbp
->ir_free
= r
.ir_free
;
402 icount
+= XFS_INODES_PER_CHUNK
- r
.ir_freecount
;
405 * Set agino to after this chunk and bump the cursor.
407 agino
= r
.ir_startino
+ XFS_INODES_PER_CHUNK
;
408 error
= xfs_btree_increment(cur
, 0, &tmp
);
412 * Drop the btree buffers and the agi buffer.
413 * We can't hold any of the locks these represent
416 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
419 * Now format all the good inodes into the user's buffer.
423 irbp
< irbufend
&& XFS_BULKSTAT_UBLEFT(ubleft
); irbp
++) {
425 * Now process this chunk of inodes.
427 for (agino
= irbp
->ir_startino
, chunkidx
= clustidx
= 0;
428 XFS_BULKSTAT_UBLEFT(ubleft
) &&
429 irbp
->ir_freecount
< XFS_INODES_PER_CHUNK
;
430 chunkidx
++, clustidx
++, agino
++) {
431 ASSERT(chunkidx
< XFS_INODES_PER_CHUNK
);
433 ino
= XFS_AGINO_TO_INO(mp
, agno
, agino
);
435 * Skip if this inode is free.
437 if (XFS_INOBT_MASK(chunkidx
) & irbp
->ir_free
) {
442 * Count used inodes as free so we can tell
443 * when the chunk is used up.
445 irbp
->ir_freecount
++;
448 * Get the inode and fill in a single buffer.
450 ubused
= statstruct_size
;
451 error
= formatter(mp
, ino
, ubufp
, ubleft
,
453 if (fmterror
== BULKSTAT_RV_NOTHING
) {
454 if (error
&& error
!= ENOENT
&&
463 if (fmterror
== BULKSTAT_RV_GIVEUP
) {
479 * Set up for the next loop iteration.
481 if (XFS_BULKSTAT_UBLEFT(ubleft
)) {
486 agino
= XFS_INO_TO_AGINO(mp
, lastino
);
491 * Done, we're either out of filesystem or space to put the data.
496 * Found some inodes, return them now and return the error next time.
500 if (agno
>= mp
->m_sb
.sb_agcount
) {
502 * If we ran out of filesystem, mark lastino as off
503 * the end of the filesystem, so the next call
504 * will return immediately.
506 *lastinop
= (xfs_ino_t
)XFS_AGINO_TO_INO(mp
, agno
, 0);
509 *lastinop
= (xfs_ino_t
)lastino
;
515 * Return stat information in bulk (by-inode) for the filesystem.
516 * Special case for non-sequential one inode bulkstat.
518 int /* error status */
520 xfs_mount_t
*mp
, /* mount point for filesystem */
521 xfs_ino_t
*lastinop
, /* inode to return */
522 char __user
*buffer
, /* buffer with inode stats */
523 int *done
) /* 1 if there are more stats to get */
525 int count
; /* count value for bulkstat call */
526 int error
; /* return value */
527 xfs_ino_t ino
; /* filesystem inode number */
528 int res
; /* result from bs1 */
531 * note that requesting valid inode numbers which are not allocated
532 * to inodes will most likely cause xfs_imap_to_bp to generate warning
533 * messages about bad magic numbers. This is ok. The fact that
534 * the inode isn't actually an inode is handled by the
535 * error check below. Done this way to make the usual case faster
536 * at the expense of the error case.
540 error
= xfs_bulkstat_one(mp
, ino
, buffer
, sizeof(xfs_bstat_t
),
544 * Special case way failed, do it the "long" way
545 * to see if that works.
549 if (xfs_bulkstat(mp
, lastinop
, &count
, xfs_bulkstat_one
,
550 sizeof(xfs_bstat_t
), buffer
, done
))
552 if (count
== 0 || (xfs_ino_t
)*lastinop
!= ino
)
553 return error
== EFSCORRUPTED
?
554 XFS_ERROR(EINVAL
) : error
;
564 void __user
*ubuffer
, /* buffer to write to */
565 const xfs_inogrp_t
*buffer
, /* buffer to read from */
566 long count
, /* # of elements to read */
567 long *written
) /* # of bytes written */
569 if (copy_to_user(ubuffer
, buffer
, count
* sizeof(*buffer
)))
571 *written
= count
* sizeof(*buffer
);
576 * Return inode number table for the filesystem.
578 int /* error status */
580 xfs_mount_t
*mp
, /* mount point for filesystem */
581 xfs_ino_t
*lastino
, /* last inode returned */
582 int *count
, /* size of buffer/count returned */
583 void __user
*ubuffer
,/* buffer with inode descriptions */
584 inumbers_fmt_pf formatter
)
590 xfs_inogrp_t
*buffer
;
592 xfs_btree_cur_t
*cur
;
594 xfs_inobt_rec_incore_t r
;
600 ino
= (xfs_ino_t
)*lastino
;
601 agno
= XFS_INO_TO_AGNO(mp
, ino
);
602 agino
= XFS_INO_TO_AGINO(mp
, ino
);
605 bcount
= MIN(left
, (int)(PAGE_SIZE
/ sizeof(*buffer
)));
606 buffer
= kmem_alloc(bcount
* sizeof(*buffer
), KM_SLEEP
);
610 while (left
> 0 && agno
< mp
->m_sb
.sb_agcount
) {
612 error
= xfs_ialloc_read_agi(mp
, NULL
, agno
, &agbp
);
615 * If we can't read the AGI of this ag,
616 * then just skip to the next one.
624 cur
= xfs_inobt_init_cursor(mp
, NULL
, agbp
, agno
);
625 error
= xfs_inobt_lookup(cur
, agino
, XFS_LOOKUP_GE
,
628 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
633 * Move up the last inode in the current
634 * chunk. The lookup_ge will always get
635 * us the first inode in the next chunk.
637 agino
+= XFS_INODES_PER_CHUNK
- 1;
641 error
= xfs_inobt_get_rec(cur
, &r
, &i
);
642 if (error
|| i
== 0) {
645 xfs_btree_del_cursor(cur
, XFS_BTREE_NOERROR
);
651 agino
= r
.ir_startino
+ XFS_INODES_PER_CHUNK
- 1;
652 buffer
[bufidx
].xi_startino
=
653 XFS_AGINO_TO_INO(mp
, agno
, r
.ir_startino
);
654 buffer
[bufidx
].xi_alloccount
=
655 XFS_INODES_PER_CHUNK
- r
.ir_freecount
;
656 buffer
[bufidx
].xi_allocmask
= ~r
.ir_free
;
659 if (bufidx
== bcount
) {
661 if (formatter(ubuffer
, buffer
, bufidx
, &written
)) {
662 error
= XFS_ERROR(EFAULT
);
670 error
= xfs_btree_increment(cur
, 0, &tmp
);
672 xfs_btree_del_cursor(cur
, XFS_BTREE_ERROR
);
677 * The agino value has already been bumped.
678 * Just try to skip up to it.
680 agino
+= XFS_INODES_PER_CHUNK
;
688 if (formatter(ubuffer
, buffer
, bufidx
, &written
))
689 error
= XFS_ERROR(EFAULT
);
693 *lastino
= XFS_AGINO_TO_INO(mp
, agno
, agino
);
697 xfs_btree_del_cursor(cur
, (error
? XFS_BTREE_ERROR
: