[XFS] Don't block pdflush when writing back inodes
[linux-2.6/libata-dev.git] / fs / xfs / xfs_itable.c
blob45d8776408ef2a4f0829c25caf9130adf6e57169
1 /*
2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
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
18 #include "xfs.h"
19 #include "xfs_fs.h"
20 #include "xfs_types.h"
21 #include "xfs_bit.h"
22 #include "xfs_log.h"
23 #include "xfs_inum.h"
24 #include "xfs_trans.h"
25 #include "xfs_sb.h"
26 #include "xfs_ag.h"
27 #include "xfs_dir2.h"
28 #include "xfs_dmapi.h"
29 #include "xfs_mount.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_alloc_btree.h"
32 #include "xfs_ialloc_btree.h"
33 #include "xfs_dir2_sf.h"
34 #include "xfs_attr_sf.h"
35 #include "xfs_dinode.h"
36 #include "xfs_inode.h"
37 #include "xfs_ialloc.h"
38 #include "xfs_itable.h"
39 #include "xfs_error.h"
40 #include "xfs_btree.h"
42 int
43 xfs_internal_inum(
44 xfs_mount_t *mp,
45 xfs_ino_t ino)
47 return (ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino ||
48 (xfs_sb_version_hasquota(&mp->m_sb) &&
49 (ino == mp->m_sb.sb_uquotino || ino == mp->m_sb.sb_gquotino)));
52 STATIC int
53 xfs_bulkstat_one_iget(
54 xfs_mount_t *mp, /* mount point for filesystem */
55 xfs_ino_t ino, /* inode number to get data for */
56 xfs_daddr_t bno, /* starting bno of inode cluster */
57 xfs_bstat_t *buf, /* return buffer */
58 int *stat) /* BULKSTAT_RV_... */
60 xfs_icdinode_t *dic; /* dinode core info pointer */
61 xfs_inode_t *ip; /* incore inode pointer */
62 bhv_vnode_t *vp;
63 int error;
65 error = xfs_iget(mp, NULL, ino,
66 XFS_IGET_BULKSTAT, XFS_ILOCK_SHARED, &ip, bno);
67 if (error) {
68 *stat = BULKSTAT_RV_NOTHING;
69 return error;
72 ASSERT(ip != NULL);
73 ASSERT(ip->i_blkno != (xfs_daddr_t)0);
74 if (ip->i_d.di_mode == 0) {
75 *stat = BULKSTAT_RV_NOTHING;
76 error = XFS_ERROR(ENOENT);
77 goto out_iput;
80 vp = XFS_ITOV(ip);
81 dic = &ip->i_d;
83 /* xfs_iget returns the following without needing
84 * further change.
86 buf->bs_nlink = dic->di_nlink;
87 buf->bs_projid = dic->di_projid;
88 buf->bs_ino = ino;
89 buf->bs_mode = dic->di_mode;
90 buf->bs_uid = dic->di_uid;
91 buf->bs_gid = dic->di_gid;
92 buf->bs_size = dic->di_size;
93 vn_atime_to_bstime(vp, &buf->bs_atime);
94 buf->bs_mtime.tv_sec = dic->di_mtime.t_sec;
95 buf->bs_mtime.tv_nsec = dic->di_mtime.t_nsec;
96 buf->bs_ctime.tv_sec = dic->di_ctime.t_sec;
97 buf->bs_ctime.tv_nsec = dic->di_ctime.t_nsec;
98 buf->bs_xflags = xfs_ip2xflags(ip);
99 buf->bs_extsize = dic->di_extsize << mp->m_sb.sb_blocklog;
100 buf->bs_extents = dic->di_nextents;
101 buf->bs_gen = dic->di_gen;
102 memset(buf->bs_pad, 0, sizeof(buf->bs_pad));
103 buf->bs_dmevmask = dic->di_dmevmask;
104 buf->bs_dmstate = dic->di_dmstate;
105 buf->bs_aextents = dic->di_anextents;
107 switch (dic->di_format) {
108 case XFS_DINODE_FMT_DEV:
109 buf->bs_rdev = ip->i_df.if_u2.if_rdev;
110 buf->bs_blksize = BLKDEV_IOSIZE;
111 buf->bs_blocks = 0;
112 break;
113 case XFS_DINODE_FMT_LOCAL:
114 case XFS_DINODE_FMT_UUID:
115 buf->bs_rdev = 0;
116 buf->bs_blksize = mp->m_sb.sb_blocksize;
117 buf->bs_blocks = 0;
118 break;
119 case XFS_DINODE_FMT_EXTENTS:
120 case XFS_DINODE_FMT_BTREE:
121 buf->bs_rdev = 0;
122 buf->bs_blksize = mp->m_sb.sb_blocksize;
123 buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks;
124 break;
127 out_iput:
128 xfs_iput(ip, XFS_ILOCK_SHARED);
129 return error;
132 STATIC int
133 xfs_bulkstat_one_dinode(
134 xfs_mount_t *mp, /* mount point for filesystem */
135 xfs_ino_t ino, /* inode number to get data for */
136 xfs_dinode_t *dip, /* dinode inode pointer */
137 xfs_bstat_t *buf) /* return buffer */
139 xfs_dinode_core_t *dic; /* dinode core info pointer */
141 dic = &dip->di_core;
144 * The inode format changed when we moved the link count and
145 * made it 32 bits long. If this is an old format inode,
146 * convert it in memory to look like a new one. If it gets
147 * flushed to disk we will convert back before flushing or
148 * logging it. We zero out the new projid field and the old link
149 * count field. We'll handle clearing the pad field (the remains
150 * of the old uuid field) when we actually convert the inode to
151 * the new format. We don't change the version number so that we
152 * can distinguish this from a real new format inode.
154 if (dic->di_version == XFS_DINODE_VERSION_1) {
155 buf->bs_nlink = be16_to_cpu(dic->di_onlink);
156 buf->bs_projid = 0;
157 } else {
158 buf->bs_nlink = be32_to_cpu(dic->di_nlink);
159 buf->bs_projid = be16_to_cpu(dic->di_projid);
162 buf->bs_ino = ino;
163 buf->bs_mode = be16_to_cpu(dic->di_mode);
164 buf->bs_uid = be32_to_cpu(dic->di_uid);
165 buf->bs_gid = be32_to_cpu(dic->di_gid);
166 buf->bs_size = be64_to_cpu(dic->di_size);
167 buf->bs_atime.tv_sec = be32_to_cpu(dic->di_atime.t_sec);
168 buf->bs_atime.tv_nsec = be32_to_cpu(dic->di_atime.t_nsec);
169 buf->bs_mtime.tv_sec = be32_to_cpu(dic->di_mtime.t_sec);
170 buf->bs_mtime.tv_nsec = be32_to_cpu(dic->di_mtime.t_nsec);
171 buf->bs_ctime.tv_sec = be32_to_cpu(dic->di_ctime.t_sec);
172 buf->bs_ctime.tv_nsec = be32_to_cpu(dic->di_ctime.t_nsec);
173 buf->bs_xflags = xfs_dic2xflags(dip);
174 buf->bs_extsize = be32_to_cpu(dic->di_extsize) << mp->m_sb.sb_blocklog;
175 buf->bs_extents = be32_to_cpu(dic->di_nextents);
176 buf->bs_gen = be32_to_cpu(dic->di_gen);
177 memset(buf->bs_pad, 0, sizeof(buf->bs_pad));
178 buf->bs_dmevmask = be32_to_cpu(dic->di_dmevmask);
179 buf->bs_dmstate = be16_to_cpu(dic->di_dmstate);
180 buf->bs_aextents = be16_to_cpu(dic->di_anextents);
182 switch (dic->di_format) {
183 case XFS_DINODE_FMT_DEV:
184 buf->bs_rdev = be32_to_cpu(dip->di_u.di_dev);
185 buf->bs_blksize = BLKDEV_IOSIZE;
186 buf->bs_blocks = 0;
187 break;
188 case XFS_DINODE_FMT_LOCAL:
189 case XFS_DINODE_FMT_UUID:
190 buf->bs_rdev = 0;
191 buf->bs_blksize = mp->m_sb.sb_blocksize;
192 buf->bs_blocks = 0;
193 break;
194 case XFS_DINODE_FMT_EXTENTS:
195 case XFS_DINODE_FMT_BTREE:
196 buf->bs_rdev = 0;
197 buf->bs_blksize = mp->m_sb.sb_blocksize;
198 buf->bs_blocks = be64_to_cpu(dic->di_nblocks);
199 break;
202 return 0;
205 STATIC int
206 xfs_bulkstat_one_fmt(
207 void __user *ubuffer,
208 const xfs_bstat_t *buffer)
210 if (copy_to_user(ubuffer, buffer, sizeof(*buffer)))
211 return -EFAULT;
212 return sizeof(*buffer);
216 * Return stat information for one inode.
217 * Return 0 if ok, else errno.
219 int /* error status */
220 xfs_bulkstat_one(
221 xfs_mount_t *mp, /* mount point for filesystem */
222 xfs_ino_t ino, /* inode number to get data for */
223 void __user *buffer, /* buffer to place output in */
224 int ubsize, /* size of buffer */
225 void *private_data, /* my private data */
226 xfs_daddr_t bno, /* starting bno of inode cluster */
227 int *ubused, /* bytes used by me */
228 void *dibuff, /* on-disk inode buffer */
229 int *stat) /* BULKSTAT_RV_... */
231 xfs_bstat_t *buf; /* return buffer */
232 int error = 0; /* error value */
233 xfs_dinode_t *dip; /* dinode inode pointer */
234 bulkstat_one_fmt_pf formatter = private_data ? : xfs_bulkstat_one_fmt;
236 dip = (xfs_dinode_t *)dibuff;
237 *stat = BULKSTAT_RV_NOTHING;
239 if (!buffer || xfs_internal_inum(mp, ino))
240 return XFS_ERROR(EINVAL);
241 if (ubsize < sizeof(*buf))
242 return XFS_ERROR(ENOMEM);
244 buf = kmem_alloc(sizeof(*buf), KM_SLEEP);
246 if (dip == NULL) {
247 /* We're not being passed a pointer to a dinode. This happens
248 * if BULKSTAT_FG_IGET is selected. Do the iget.
250 error = xfs_bulkstat_one_iget(mp, ino, bno, buf, stat);
251 if (error)
252 goto out_free;
253 } else {
254 xfs_bulkstat_one_dinode(mp, ino, dip, buf);
257 error = formatter(buffer, buf);
258 if (error < 0) {
259 error = EFAULT;
260 goto out_free;
263 *stat = BULKSTAT_RV_DIDONE;
264 if (ubused)
265 *ubused = error;
267 out_free:
268 kmem_free(buf, sizeof(*buf));
269 return error;
273 * Test to see whether we can use the ondisk inode directly, based
274 * on the given bulkstat flags, filling in dipp accordingly.
275 * Returns zero if the inode is dodgey.
277 STATIC int
278 xfs_bulkstat_use_dinode(
279 xfs_mount_t *mp,
280 int flags,
281 xfs_buf_t *bp,
282 int clustidx,
283 xfs_dinode_t **dipp)
285 xfs_dinode_t *dip;
286 unsigned int aformat;
288 *dipp = NULL;
289 if (!bp || (flags & BULKSTAT_FG_IGET))
290 return 1;
291 dip = (xfs_dinode_t *)
292 xfs_buf_offset(bp, clustidx << mp->m_sb.sb_inodelog);
294 * Check the buffer containing the on-disk inode for di_mode == 0.
295 * This is to prevent xfs_bulkstat from picking up just reclaimed
296 * inodes that have their in-core state initialized but not flushed
297 * to disk yet. This is a temporary hack that would require a proper
298 * fix in the future.
300 if (be16_to_cpu(dip->di_core.di_magic) != XFS_DINODE_MAGIC ||
301 !XFS_DINODE_GOOD_VERSION(dip->di_core.di_version) ||
302 !dip->di_core.di_mode)
303 return 0;
304 if (flags & BULKSTAT_FG_QUICK) {
305 *dipp = dip;
306 return 1;
308 /* BULKSTAT_FG_INLINE: if attr fork is local, or not there, use it */
309 aformat = dip->di_core.di_aformat;
310 if ((XFS_DFORK_Q(dip) == 0) ||
311 (aformat == XFS_DINODE_FMT_LOCAL) ||
312 (aformat == XFS_DINODE_FMT_EXTENTS && !dip->di_core.di_anextents)) {
313 *dipp = dip;
314 return 1;
316 return 1;
319 #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
322 * Return stat information in bulk (by-inode) for the filesystem.
324 int /* error status */
325 xfs_bulkstat(
326 xfs_mount_t *mp, /* mount point for filesystem */
327 xfs_ino_t *lastinop, /* last inode returned */
328 int *ubcountp, /* size of buffer/count returned */
329 bulkstat_one_pf formatter, /* func that'd fill a single buf */
330 void *private_data,/* private data for formatter */
331 size_t statstruct_size, /* sizeof struct filling */
332 char __user *ubuffer, /* buffer with inode stats */
333 int flags, /* defined in xfs_itable.h */
334 int *done) /* 1 if there are more stats to get */
336 xfs_agblock_t agbno=0;/* allocation group block number */
337 xfs_buf_t *agbp; /* agi header buffer */
338 xfs_agi_t *agi; /* agi header data */
339 xfs_agino_t agino; /* inode # in allocation group */
340 xfs_agnumber_t agno; /* allocation group number */
341 xfs_daddr_t bno; /* inode cluster start daddr */
342 int chunkidx; /* current index into inode chunk */
343 int clustidx; /* current index into inode cluster */
344 xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */
345 int end_of_ag; /* set if we've seen the ag end */
346 int error; /* error code */
347 int fmterror;/* bulkstat formatter result */
348 __int32_t gcnt; /* current btree rec's count */
349 xfs_inofree_t gfree; /* current btree rec's free mask */
350 xfs_agino_t gino; /* current btree rec's start inode */
351 int i; /* loop index */
352 int icount; /* count of inodes good in irbuf */
353 size_t irbsize; /* size of irec buffer in bytes */
354 xfs_ino_t ino; /* inode number (filesystem) */
355 xfs_inobt_rec_incore_t *irbp; /* current irec buffer pointer */
356 xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
357 xfs_inobt_rec_incore_t *irbufend; /* end of good irec buffer entries */
358 xfs_ino_t lastino; /* last inode number returned */
359 int nbcluster; /* # of blocks in a cluster */
360 int nicluster; /* # of inodes in a cluster */
361 int nimask; /* mask for inode clusters */
362 int nirbuf; /* size of irbuf */
363 int rval; /* return value error code */
364 int tmp; /* result value from btree calls */
365 int ubcount; /* size of user's buffer */
366 int ubleft; /* bytes left in user's buffer */
367 char __user *ubufp; /* pointer into user's buffer */
368 int ubelem; /* spaces used in user's buffer */
369 int ubused; /* bytes used by formatter */
370 xfs_buf_t *bp; /* ptr to on-disk inode cluster buf */
371 xfs_dinode_t *dip; /* ptr into bp for specific inode */
372 xfs_inode_t *ip; /* ptr to in-core inode struct */
375 * Get the last inode value, see if there's nothing to do.
377 ino = (xfs_ino_t)*lastinop;
378 lastino = ino;
379 dip = NULL;
380 agno = XFS_INO_TO_AGNO(mp, ino);
381 agino = XFS_INO_TO_AGINO(mp, ino);
382 if (agno >= mp->m_sb.sb_agcount ||
383 ino != XFS_AGINO_TO_INO(mp, agno, agino)) {
384 *done = 1;
385 *ubcountp = 0;
386 return 0;
388 if (!ubcountp || *ubcountp <= 0) {
389 return EINVAL;
391 ubcount = *ubcountp; /* statstruct's */
392 ubleft = ubcount * statstruct_size; /* bytes */
393 *ubcountp = ubelem = 0;
394 *done = 0;
395 fmterror = 0;
396 ubufp = ubuffer;
397 nicluster = mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp) ?
398 mp->m_sb.sb_inopblock :
399 (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog);
400 nimask = ~(nicluster - 1);
401 nbcluster = nicluster >> mp->m_sb.sb_inopblog;
402 irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4,
403 KM_SLEEP | KM_MAYFAIL | KM_LARGE);
404 nirbuf = irbsize / sizeof(*irbuf);
407 * Loop over the allocation groups, starting from the last
408 * inode returned; 0 means start of the allocation group.
410 rval = 0;
411 while (XFS_BULKSTAT_UBLEFT(ubleft) && agno < mp->m_sb.sb_agcount) {
412 cond_resched();
413 bp = NULL;
414 down_read(&mp->m_peraglock);
415 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
416 up_read(&mp->m_peraglock);
417 if (error) {
419 * Skip this allocation group and go to the next one.
421 agno++;
422 agino = 0;
423 continue;
425 agi = XFS_BUF_TO_AGI(agbp);
427 * Allocate and initialize a btree cursor for ialloc btree.
429 cur = xfs_btree_init_cursor(mp, NULL, agbp, agno, XFS_BTNUM_INO,
430 (xfs_inode_t *)0, 0);
431 irbp = irbuf;
432 irbufend = irbuf + nirbuf;
433 end_of_ag = 0;
435 * If we're returning in the middle of an allocation group,
436 * we need to get the remainder of the chunk we're in.
438 if (agino > 0) {
440 * Lookup the inode chunk that this inode lives in.
442 error = xfs_inobt_lookup_le(cur, agino, 0, 0, &tmp);
443 if (!error && /* no I/O error */
444 tmp && /* lookup succeeded */
445 /* got the record, should always work */
446 !(error = xfs_inobt_get_rec(cur, &gino, &gcnt,
447 &gfree, &i)) &&
448 i == 1 &&
449 /* this is the right chunk */
450 agino < gino + XFS_INODES_PER_CHUNK &&
451 /* lastino was not last in chunk */
452 (chunkidx = agino - gino + 1) <
453 XFS_INODES_PER_CHUNK &&
454 /* there are some left allocated */
455 XFS_INOBT_MASKN(chunkidx,
456 XFS_INODES_PER_CHUNK - chunkidx) & ~gfree) {
458 * Grab the chunk record. Mark all the
459 * uninteresting inodes (because they're
460 * before our start point) free.
462 for (i = 0; i < chunkidx; i++) {
463 if (XFS_INOBT_MASK(i) & ~gfree)
464 gcnt++;
466 gfree |= XFS_INOBT_MASKN(0, chunkidx);
467 irbp->ir_startino = gino;
468 irbp->ir_freecount = gcnt;
469 irbp->ir_free = gfree;
470 irbp++;
471 agino = gino + XFS_INODES_PER_CHUNK;
472 icount = XFS_INODES_PER_CHUNK - gcnt;
473 } else {
475 * If any of those tests failed, bump the
476 * inode number (just in case).
478 agino++;
479 icount = 0;
482 * In any case, increment to the next record.
484 if (!error)
485 error = xfs_inobt_increment(cur, 0, &tmp);
486 } else {
488 * Start of ag. Lookup the first inode chunk.
490 error = xfs_inobt_lookup_ge(cur, 0, 0, 0, &tmp);
491 icount = 0;
494 * Loop through inode btree records in this ag,
495 * until we run out of inodes or space in the buffer.
497 while (irbp < irbufend && icount < ubcount) {
499 * Loop as long as we're unable to read the
500 * inode btree.
502 while (error) {
503 agino += XFS_INODES_PER_CHUNK;
504 if (XFS_AGINO_TO_AGBNO(mp, agino) >=
505 be32_to_cpu(agi->agi_length))
506 break;
507 error = xfs_inobt_lookup_ge(cur, agino, 0, 0,
508 &tmp);
509 cond_resched();
512 * If ran off the end of the ag either with an error,
513 * or the normal way, set end and stop collecting.
515 if (error ||
516 (error = xfs_inobt_get_rec(cur, &gino, &gcnt,
517 &gfree, &i)) ||
518 i == 0) {
519 end_of_ag = 1;
520 break;
523 * If this chunk has any allocated inodes, save it.
524 * Also start read-ahead now for this chunk.
526 if (gcnt < XFS_INODES_PER_CHUNK) {
528 * Loop over all clusters in the next chunk.
529 * Do a readahead if there are any allocated
530 * inodes in that cluster.
532 for (agbno = XFS_AGINO_TO_AGBNO(mp, gino),
533 chunkidx = 0;
534 chunkidx < XFS_INODES_PER_CHUNK;
535 chunkidx += nicluster,
536 agbno += nbcluster) {
537 if (XFS_INOBT_MASKN(chunkidx,
538 nicluster) & ~gfree)
539 xfs_btree_reada_bufs(mp, agno,
540 agbno, nbcluster);
542 irbp->ir_startino = gino;
543 irbp->ir_freecount = gcnt;
544 irbp->ir_free = gfree;
545 irbp++;
546 icount += XFS_INODES_PER_CHUNK - gcnt;
549 * Set agino to after this chunk and bump the cursor.
551 agino = gino + XFS_INODES_PER_CHUNK;
552 error = xfs_inobt_increment(cur, 0, &tmp);
553 cond_resched();
556 * Drop the btree buffers and the agi buffer.
557 * We can't hold any of the locks these represent
558 * when calling iget.
560 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
561 xfs_buf_relse(agbp);
563 * Now format all the good inodes into the user's buffer.
565 irbufend = irbp;
566 for (irbp = irbuf;
567 irbp < irbufend && XFS_BULKSTAT_UBLEFT(ubleft); irbp++) {
569 * Now process this chunk of inodes.
571 for (agino = irbp->ir_startino, chunkidx = clustidx = 0;
572 XFS_BULKSTAT_UBLEFT(ubleft) &&
573 irbp->ir_freecount < XFS_INODES_PER_CHUNK;
574 chunkidx++, clustidx++, agino++) {
575 ASSERT(chunkidx < XFS_INODES_PER_CHUNK);
577 * Recompute agbno if this is the
578 * first inode of the cluster.
580 * Careful with clustidx. There can be
581 * multple clusters per chunk, a single
582 * cluster per chunk or a cluster that has
583 * inodes represented from several different
584 * chunks (if blocksize is large).
586 * Because of this, the starting clustidx is
587 * initialized to zero in this loop but must
588 * later be reset after reading in the cluster
589 * buffer.
591 if ((chunkidx & (nicluster - 1)) == 0) {
592 agbno = XFS_AGINO_TO_AGBNO(mp,
593 irbp->ir_startino) +
594 ((chunkidx & nimask) >>
595 mp->m_sb.sb_inopblog);
597 if (flags & (BULKSTAT_FG_QUICK |
598 BULKSTAT_FG_INLINE)) {
599 ino = XFS_AGINO_TO_INO(mp, agno,
600 agino);
601 bno = XFS_AGB_TO_DADDR(mp, agno,
602 agbno);
605 * Get the inode cluster buffer
607 ASSERT(xfs_inode_zone != NULL);
608 ip = kmem_zone_zalloc(xfs_inode_zone,
609 KM_SLEEP);
610 ip->i_ino = ino;
611 ip->i_mount = mp;
612 spin_lock_init(&ip->i_flags_lock);
613 if (bp)
614 xfs_buf_relse(bp);
615 error = xfs_itobp(mp, NULL, ip,
616 &dip, &bp, bno,
617 XFS_IMAP_BULKSTAT,
618 XFS_BUF_LOCK);
619 if (!error)
620 clustidx = ip->i_boffset / mp->m_sb.sb_inodesize;
621 kmem_zone_free(xfs_inode_zone, ip);
622 if (XFS_TEST_ERROR(error != 0,
623 mp, XFS_ERRTAG_BULKSTAT_READ_CHUNK,
624 XFS_RANDOM_BULKSTAT_READ_CHUNK)) {
625 bp = NULL;
626 ubleft = 0;
627 rval = error;
628 break;
632 ino = XFS_AGINO_TO_INO(mp, agno, agino);
633 bno = XFS_AGB_TO_DADDR(mp, agno, agbno);
635 * Skip if this inode is free.
637 if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) {
638 lastino = ino;
639 continue;
642 * Count used inodes as free so we can tell
643 * when the chunk is used up.
645 irbp->ir_freecount++;
646 if (!xfs_bulkstat_use_dinode(mp, flags, bp,
647 clustidx, &dip)) {
648 lastino = ino;
649 continue;
652 * If we need to do an iget, cannot hold bp.
653 * Drop it, until starting the next cluster.
655 if ((flags & BULKSTAT_FG_INLINE) && !dip) {
656 if (bp)
657 xfs_buf_relse(bp);
658 bp = NULL;
662 * Get the inode and fill in a single buffer.
663 * BULKSTAT_FG_QUICK uses dip to fill it in.
664 * BULKSTAT_FG_IGET uses igets.
665 * BULKSTAT_FG_INLINE uses dip if we have an
666 * inline attr fork, else igets.
667 * See: xfs_bulkstat_one & xfs_dm_bulkstat_one.
668 * This is also used to count inodes/blks, etc
669 * in xfs_qm_quotacheck.
671 ubused = statstruct_size;
672 error = formatter(mp, ino, ubufp,
673 ubleft, private_data,
674 bno, &ubused, dip, &fmterror);
675 if (fmterror == BULKSTAT_RV_NOTHING) {
676 if (error && error != ENOENT &&
677 error != EINVAL) {
678 ubleft = 0;
679 rval = error;
680 break;
682 lastino = ino;
683 continue;
685 if (fmterror == BULKSTAT_RV_GIVEUP) {
686 ubleft = 0;
687 ASSERT(error);
688 rval = error;
689 break;
691 if (ubufp)
692 ubufp += ubused;
693 ubleft -= ubused;
694 ubelem++;
695 lastino = ino;
698 cond_resched();
701 if (bp)
702 xfs_buf_relse(bp);
705 * Set up for the next loop iteration.
707 if (XFS_BULKSTAT_UBLEFT(ubleft)) {
708 if (end_of_ag) {
709 agno++;
710 agino = 0;
711 } else
712 agino = XFS_INO_TO_AGINO(mp, lastino);
713 } else
714 break;
717 * Done, we're either out of filesystem or space to put the data.
719 kmem_free(irbuf, irbsize);
720 *ubcountp = ubelem;
722 * Found some inodes, return them now and return the error next time.
724 if (ubelem)
725 rval = 0;
726 if (agno >= mp->m_sb.sb_agcount) {
728 * If we ran out of filesystem, mark lastino as off
729 * the end of the filesystem, so the next call
730 * will return immediately.
732 *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0);
733 *done = 1;
734 } else
735 *lastinop = (xfs_ino_t)lastino;
737 return rval;
741 * Return stat information in bulk (by-inode) for the filesystem.
742 * Special case for non-sequential one inode bulkstat.
744 int /* error status */
745 xfs_bulkstat_single(
746 xfs_mount_t *mp, /* mount point for filesystem */
747 xfs_ino_t *lastinop, /* inode to return */
748 char __user *buffer, /* buffer with inode stats */
749 int *done) /* 1 if there are more stats to get */
751 int count; /* count value for bulkstat call */
752 int error; /* return value */
753 xfs_ino_t ino; /* filesystem inode number */
754 int res; /* result from bs1 */
757 * note that requesting valid inode numbers which are not allocated
758 * to inodes will most likely cause xfs_itobp to generate warning
759 * messages about bad magic numbers. This is ok. The fact that
760 * the inode isn't actually an inode is handled by the
761 * error check below. Done this way to make the usual case faster
762 * at the expense of the error case.
765 ino = (xfs_ino_t)*lastinop;
766 error = xfs_bulkstat_one(mp, ino, buffer, sizeof(xfs_bstat_t),
767 NULL, 0, NULL, NULL, &res);
768 if (error) {
770 * Special case way failed, do it the "long" way
771 * to see if that works.
773 (*lastinop)--;
774 count = 1;
775 if (xfs_bulkstat(mp, lastinop, &count, xfs_bulkstat_one,
776 NULL, sizeof(xfs_bstat_t), buffer,
777 BULKSTAT_FG_IGET, done))
778 return error;
779 if (count == 0 || (xfs_ino_t)*lastinop != ino)
780 return error == EFSCORRUPTED ?
781 XFS_ERROR(EINVAL) : error;
782 else
783 return 0;
785 *done = 0;
786 return 0;
790 xfs_inumbers_fmt(
791 void __user *ubuffer, /* buffer to write to */
792 const xfs_inogrp_t *buffer, /* buffer to read from */
793 long count, /* # of elements to read */
794 long *written) /* # of bytes written */
796 if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
797 return -EFAULT;
798 *written = count * sizeof(*buffer);
799 return 0;
803 * Return inode number table for the filesystem.
805 int /* error status */
806 xfs_inumbers(
807 xfs_mount_t *mp, /* mount point for filesystem */
808 xfs_ino_t *lastino, /* last inode returned */
809 int *count, /* size of buffer/count returned */
810 void __user *ubuffer,/* buffer with inode descriptions */
811 inumbers_fmt_pf formatter)
813 xfs_buf_t *agbp;
814 xfs_agino_t agino;
815 xfs_agnumber_t agno;
816 int bcount;
817 xfs_inogrp_t *buffer;
818 int bufidx;
819 xfs_btree_cur_t *cur;
820 int error;
821 __int32_t gcnt;
822 xfs_inofree_t gfree;
823 xfs_agino_t gino;
824 int i;
825 xfs_ino_t ino;
826 int left;
827 int tmp;
829 ino = (xfs_ino_t)*lastino;
830 agno = XFS_INO_TO_AGNO(mp, ino);
831 agino = XFS_INO_TO_AGINO(mp, ino);
832 left = *count;
833 *count = 0;
834 bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
835 buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP);
836 error = bufidx = 0;
837 cur = NULL;
838 agbp = NULL;
839 while (left > 0 && agno < mp->m_sb.sb_agcount) {
840 if (agbp == NULL) {
841 down_read(&mp->m_peraglock);
842 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
843 up_read(&mp->m_peraglock);
844 if (error) {
846 * If we can't read the AGI of this ag,
847 * then just skip to the next one.
849 ASSERT(cur == NULL);
850 agbp = NULL;
851 agno++;
852 agino = 0;
853 continue;
855 cur = xfs_btree_init_cursor(mp, NULL, agbp, agno,
856 XFS_BTNUM_INO, (xfs_inode_t *)0, 0);
857 error = xfs_inobt_lookup_ge(cur, agino, 0, 0, &tmp);
858 if (error) {
859 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
860 cur = NULL;
861 xfs_buf_relse(agbp);
862 agbp = NULL;
864 * Move up the last inode in the current
865 * chunk. The lookup_ge will always get
866 * us the first inode in the next chunk.
868 agino += XFS_INODES_PER_CHUNK - 1;
869 continue;
872 if ((error = xfs_inobt_get_rec(cur, &gino, &gcnt, &gfree,
873 &i)) ||
874 i == 0) {
875 xfs_buf_relse(agbp);
876 agbp = NULL;
877 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
878 cur = NULL;
879 agno++;
880 agino = 0;
881 continue;
883 agino = gino + XFS_INODES_PER_CHUNK - 1;
884 buffer[bufidx].xi_startino = XFS_AGINO_TO_INO(mp, agno, gino);
885 buffer[bufidx].xi_alloccount = XFS_INODES_PER_CHUNK - gcnt;
886 buffer[bufidx].xi_allocmask = ~gfree;
887 bufidx++;
888 left--;
889 if (bufidx == bcount) {
890 long written;
891 if (formatter(ubuffer, buffer, bufidx, &written)) {
892 error = XFS_ERROR(EFAULT);
893 break;
895 ubuffer += written;
896 *count += bufidx;
897 bufidx = 0;
899 if (left) {
900 error = xfs_inobt_increment(cur, 0, &tmp);
901 if (error) {
902 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
903 cur = NULL;
904 xfs_buf_relse(agbp);
905 agbp = NULL;
907 * The agino value has already been bumped.
908 * Just try to skip up to it.
910 agino += XFS_INODES_PER_CHUNK;
911 continue;
915 if (!error) {
916 if (bufidx) {
917 long written;
918 if (formatter(ubuffer, buffer, bufidx, &written))
919 error = XFS_ERROR(EFAULT);
920 else
921 *count += bufidx;
923 *lastino = XFS_AGINO_TO_INO(mp, agno, agino);
925 kmem_free(buffer, bcount * sizeof(*buffer));
926 if (cur)
927 xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
928 XFS_BTREE_NOERROR));
929 if (agbp)
930 xfs_buf_relse(agbp);
931 return error;