Merge tag 'for-3.11-rc1' of git://gitorious.org/linux-pwm/linux-pwm
[linux-2.6.git] / fs / xfs / xfs_itable.c
blobbc92c5306a170afd58ca55945bc9471287933699
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_log.h"
22 #include "xfs_inum.h"
23 #include "xfs_trans.h"
24 #include "xfs_sb.h"
25 #include "xfs_ag.h"
26 #include "xfs_mount.h"
27 #include "xfs_bmap_btree.h"
28 #include "xfs_alloc_btree.h"
29 #include "xfs_ialloc_btree.h"
30 #include "xfs_dinode.h"
31 #include "xfs_inode.h"
32 #include "xfs_ialloc.h"
33 #include "xfs_itable.h"
34 #include "xfs_error.h"
35 #include "xfs_btree.h"
36 #include "xfs_trace.h"
37 #include "xfs_icache.h"
39 STATIC int
40 xfs_internal_inum(
41 xfs_mount_t *mp,
42 xfs_ino_t ino)
44 return (ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino ||
45 (xfs_sb_version_hasquota(&mp->m_sb) &&
46 xfs_is_quota_inode(&mp->m_sb, ino)));
50 * Return stat information for one inode.
51 * Return 0 if ok, else errno.
53 int
54 xfs_bulkstat_one_int(
55 struct xfs_mount *mp, /* mount point for filesystem */
56 xfs_ino_t ino, /* inode to get data for */
57 void __user *buffer, /* buffer to place output in */
58 int ubsize, /* size of buffer */
59 bulkstat_one_fmt_pf formatter, /* formatter, copy to user */
60 int *ubused, /* bytes used by me */
61 int *stat) /* BULKSTAT_RV_... */
63 struct xfs_icdinode *dic; /* dinode core info pointer */
64 struct xfs_inode *ip; /* incore inode pointer */
65 struct xfs_bstat *buf; /* return buffer */
66 int error = 0; /* error value */
68 *stat = BULKSTAT_RV_NOTHING;
70 if (!buffer || xfs_internal_inum(mp, ino))
71 return XFS_ERROR(EINVAL);
73 buf = kmem_alloc(sizeof(*buf), KM_SLEEP | KM_MAYFAIL);
74 if (!buf)
75 return XFS_ERROR(ENOMEM);
77 error = xfs_iget(mp, NULL, ino,
78 (XFS_IGET_DONTCACHE | XFS_IGET_UNTRUSTED),
79 XFS_ILOCK_SHARED, &ip);
80 if (error) {
81 *stat = BULKSTAT_RV_NOTHING;
82 goto out_free;
85 ASSERT(ip != NULL);
86 ASSERT(ip->i_imap.im_blkno != 0);
88 dic = &ip->i_d;
90 /* xfs_iget returns the following without needing
91 * further change.
93 buf->bs_nlink = dic->di_nlink;
94 buf->bs_projid_lo = dic->di_projid_lo;
95 buf->bs_projid_hi = dic->di_projid_hi;
96 buf->bs_ino = ino;
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;
115 buf->bs_forkoff = XFS_IFORK_BOFF(ip);
117 switch (dic->di_format) {
118 case XFS_DINODE_FMT_DEV:
119 buf->bs_rdev = ip->i_df.if_u2.if_rdev;
120 buf->bs_blksize = BLKDEV_IOSIZE;
121 buf->bs_blocks = 0;
122 break;
123 case XFS_DINODE_FMT_LOCAL:
124 case XFS_DINODE_FMT_UUID:
125 buf->bs_rdev = 0;
126 buf->bs_blksize = mp->m_sb.sb_blocksize;
127 buf->bs_blocks = 0;
128 break;
129 case XFS_DINODE_FMT_EXTENTS:
130 case XFS_DINODE_FMT_BTREE:
131 buf->bs_rdev = 0;
132 buf->bs_blksize = mp->m_sb.sb_blocksize;
133 buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks;
134 break;
136 xfs_iunlock(ip, XFS_ILOCK_SHARED);
137 IRELE(ip);
139 error = formatter(buffer, ubsize, ubused, buf);
141 if (!error)
142 *stat = BULKSTAT_RV_DIDONE;
144 out_free:
145 kmem_free(buf);
146 return error;
149 /* Return 0 on success or positive error */
150 STATIC int
151 xfs_bulkstat_one_fmt(
152 void __user *ubuffer,
153 int ubsize,
154 int *ubused,
155 const xfs_bstat_t *buffer)
157 if (ubsize < sizeof(*buffer))
158 return XFS_ERROR(ENOMEM);
159 if (copy_to_user(ubuffer, buffer, sizeof(*buffer)))
160 return XFS_ERROR(EFAULT);
161 if (ubused)
162 *ubused = sizeof(*buffer);
163 return 0;
167 xfs_bulkstat_one(
168 xfs_mount_t *mp, /* mount point for filesystem */
169 xfs_ino_t ino, /* inode number to get data for */
170 void __user *buffer, /* buffer to place output in */
171 int ubsize, /* size of buffer */
172 int *ubused, /* bytes used by me */
173 int *stat) /* BULKSTAT_RV_... */
175 return xfs_bulkstat_one_int(mp, ino, buffer, ubsize,
176 xfs_bulkstat_one_fmt, ubused, stat);
179 #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
182 * Return stat information in bulk (by-inode) for the filesystem.
184 int /* error status */
185 xfs_bulkstat(
186 xfs_mount_t *mp, /* mount point for filesystem */
187 xfs_ino_t *lastinop, /* last inode returned */
188 int *ubcountp, /* size of buffer/count returned */
189 bulkstat_one_pf formatter, /* func that'd fill a single buf */
190 size_t statstruct_size, /* sizeof struct filling */
191 char __user *ubuffer, /* buffer with inode stats */
192 int *done) /* 1 if there are more stats to get */
194 xfs_agblock_t agbno=0;/* allocation group block number */
195 xfs_buf_t *agbp; /* agi header buffer */
196 xfs_agi_t *agi; /* agi header data */
197 xfs_agino_t agino; /* inode # in allocation group */
198 xfs_agnumber_t agno; /* allocation group number */
199 int chunkidx; /* current index into inode chunk */
200 int clustidx; /* current index into inode cluster */
201 xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */
202 int end_of_ag; /* set if we've seen the ag end */
203 int error; /* error code */
204 int fmterror;/* bulkstat formatter result */
205 int i; /* loop index */
206 int icount; /* count of inodes good in irbuf */
207 size_t irbsize; /* size of irec buffer in bytes */
208 xfs_ino_t ino; /* inode number (filesystem) */
209 xfs_inobt_rec_incore_t *irbp; /* current irec buffer pointer */
210 xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
211 xfs_inobt_rec_incore_t *irbufend; /* end of good irec buffer entries */
212 xfs_ino_t lastino; /* last inode number returned */
213 int nbcluster; /* # of blocks in a cluster */
214 int nicluster; /* # of inodes in a cluster */
215 int nimask; /* mask for inode clusters */
216 int nirbuf; /* size of irbuf */
217 int rval; /* return value error code */
218 int tmp; /* result value from btree calls */
219 int ubcount; /* size of user's buffer */
220 int ubleft; /* bytes left in user's buffer */
221 char __user *ubufp; /* pointer into user's buffer */
222 int ubelem; /* spaces used in user's buffer */
223 int ubused; /* bytes used by formatter */
224 xfs_buf_t *bp; /* ptr to on-disk inode cluster buf */
227 * Get the last inode value, see if there's nothing to do.
229 ino = (xfs_ino_t)*lastinop;
230 lastino = ino;
231 agno = XFS_INO_TO_AGNO(mp, ino);
232 agino = XFS_INO_TO_AGINO(mp, ino);
233 if (agno >= mp->m_sb.sb_agcount ||
234 ino != XFS_AGINO_TO_INO(mp, agno, agino)) {
235 *done = 1;
236 *ubcountp = 0;
237 return 0;
239 if (!ubcountp || *ubcountp <= 0) {
240 return EINVAL;
242 ubcount = *ubcountp; /* statstruct's */
243 ubleft = ubcount * statstruct_size; /* bytes */
244 *ubcountp = ubelem = 0;
245 *done = 0;
246 fmterror = 0;
247 ubufp = ubuffer;
248 nicluster = mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp) ?
249 mp->m_sb.sb_inopblock :
250 (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog);
251 nimask = ~(nicluster - 1);
252 nbcluster = nicluster >> mp->m_sb.sb_inopblog;
253 irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4);
254 if (!irbuf)
255 return ENOMEM;
257 nirbuf = irbsize / sizeof(*irbuf);
260 * Loop over the allocation groups, starting from the last
261 * inode returned; 0 means start of the allocation group.
263 rval = 0;
264 while (XFS_BULKSTAT_UBLEFT(ubleft) && agno < mp->m_sb.sb_agcount) {
265 cond_resched();
266 bp = NULL;
267 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
268 if (error) {
270 * Skip this allocation group and go to the next one.
272 agno++;
273 agino = 0;
274 continue;
276 agi = XFS_BUF_TO_AGI(agbp);
278 * Allocate and initialize a btree cursor for ialloc btree.
280 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno);
281 irbp = irbuf;
282 irbufend = irbuf + nirbuf;
283 end_of_ag = 0;
285 * If we're returning in the middle of an allocation group,
286 * we need to get the remainder of the chunk we're in.
288 if (agino > 0) {
289 xfs_inobt_rec_incore_t r;
292 * Lookup the inode chunk that this inode lives in.
294 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE,
295 &tmp);
296 if (!error && /* no I/O error */
297 tmp && /* lookup succeeded */
298 /* got the record, should always work */
299 !(error = xfs_inobt_get_rec(cur, &r, &i)) &&
300 i == 1 &&
301 /* this is the right chunk */
302 agino < r.ir_startino + XFS_INODES_PER_CHUNK &&
303 /* lastino was not last in chunk */
304 (chunkidx = agino - r.ir_startino + 1) <
305 XFS_INODES_PER_CHUNK &&
306 /* there are some left allocated */
307 xfs_inobt_maskn(chunkidx,
308 XFS_INODES_PER_CHUNK - chunkidx) &
309 ~r.ir_free) {
311 * Grab the chunk record. Mark all the
312 * uninteresting inodes (because they're
313 * before our start point) free.
315 for (i = 0; i < chunkidx; i++) {
316 if (XFS_INOBT_MASK(i) & ~r.ir_free)
317 r.ir_freecount++;
319 r.ir_free |= xfs_inobt_maskn(0, chunkidx);
320 irbp->ir_startino = r.ir_startino;
321 irbp->ir_freecount = r.ir_freecount;
322 irbp->ir_free = r.ir_free;
323 irbp++;
324 agino = r.ir_startino + XFS_INODES_PER_CHUNK;
325 icount = XFS_INODES_PER_CHUNK - r.ir_freecount;
326 } else {
328 * If any of those tests failed, bump the
329 * inode number (just in case).
331 agino++;
332 icount = 0;
335 * In any case, increment to the next record.
337 if (!error)
338 error = xfs_btree_increment(cur, 0, &tmp);
339 } else {
341 * Start of ag. Lookup the first inode chunk.
343 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &tmp);
344 icount = 0;
347 * Loop through inode btree records in this ag,
348 * until we run out of inodes or space in the buffer.
350 while (irbp < irbufend && icount < ubcount) {
351 xfs_inobt_rec_incore_t r;
354 * Loop as long as we're unable to read the
355 * inode btree.
357 while (error) {
358 agino += XFS_INODES_PER_CHUNK;
359 if (XFS_AGINO_TO_AGBNO(mp, agino) >=
360 be32_to_cpu(agi->agi_length))
361 break;
362 error = xfs_inobt_lookup(cur, agino,
363 XFS_LOOKUP_GE, &tmp);
364 cond_resched();
367 * If ran off the end of the ag either with an error,
368 * or the normal way, set end and stop collecting.
370 if (error) {
371 end_of_ag = 1;
372 break;
375 error = xfs_inobt_get_rec(cur, &r, &i);
376 if (error || i == 0) {
377 end_of_ag = 1;
378 break;
382 * If this chunk has any allocated inodes, save it.
383 * Also start read-ahead now for this chunk.
385 if (r.ir_freecount < XFS_INODES_PER_CHUNK) {
386 struct blk_plug plug;
388 * Loop over all clusters in the next chunk.
389 * Do a readahead if there are any allocated
390 * inodes in that cluster.
392 blk_start_plug(&plug);
393 agbno = XFS_AGINO_TO_AGBNO(mp, r.ir_startino);
394 for (chunkidx = 0;
395 chunkidx < XFS_INODES_PER_CHUNK;
396 chunkidx += nicluster,
397 agbno += nbcluster) {
398 if (xfs_inobt_maskn(chunkidx, nicluster)
399 & ~r.ir_free)
400 xfs_btree_reada_bufs(mp, agno,
401 agbno, nbcluster,
402 &xfs_inode_buf_ops);
404 blk_finish_plug(&plug);
405 irbp->ir_startino = r.ir_startino;
406 irbp->ir_freecount = r.ir_freecount;
407 irbp->ir_free = r.ir_free;
408 irbp++;
409 icount += XFS_INODES_PER_CHUNK - r.ir_freecount;
412 * Set agino to after this chunk and bump the cursor.
414 agino = r.ir_startino + XFS_INODES_PER_CHUNK;
415 error = xfs_btree_increment(cur, 0, &tmp);
416 cond_resched();
419 * Drop the btree buffers and the agi buffer.
420 * We can't hold any of the locks these represent
421 * when calling iget.
423 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
424 xfs_buf_relse(agbp);
426 * Now format all the good inodes into the user's buffer.
428 irbufend = irbp;
429 for (irbp = irbuf;
430 irbp < irbufend && XFS_BULKSTAT_UBLEFT(ubleft); irbp++) {
432 * Now process this chunk of inodes.
434 for (agino = irbp->ir_startino, chunkidx = clustidx = 0;
435 XFS_BULKSTAT_UBLEFT(ubleft) &&
436 irbp->ir_freecount < XFS_INODES_PER_CHUNK;
437 chunkidx++, clustidx++, agino++) {
438 ASSERT(chunkidx < XFS_INODES_PER_CHUNK);
440 * Recompute agbno if this is the
441 * first inode of the cluster.
443 * Careful with clustidx. There can be
444 * multiple clusters per chunk, a single
445 * cluster per chunk or a cluster that has
446 * inodes represented from several different
447 * chunks (if blocksize is large).
449 * Because of this, the starting clustidx is
450 * initialized to zero in this loop but must
451 * later be reset after reading in the cluster
452 * buffer.
454 if ((chunkidx & (nicluster - 1)) == 0) {
455 agbno = XFS_AGINO_TO_AGBNO(mp,
456 irbp->ir_startino) +
457 ((chunkidx & nimask) >>
458 mp->m_sb.sb_inopblog);
460 ino = XFS_AGINO_TO_INO(mp, agno, agino);
462 * Skip if this inode is free.
464 if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) {
465 lastino = ino;
466 continue;
469 * Count used inodes as free so we can tell
470 * when the chunk is used up.
472 irbp->ir_freecount++;
475 * Get the inode and fill in a single buffer.
477 ubused = statstruct_size;
478 error = formatter(mp, ino, ubufp, ubleft,
479 &ubused, &fmterror);
480 if (fmterror == BULKSTAT_RV_NOTHING) {
481 if (error && error != ENOENT &&
482 error != EINVAL) {
483 ubleft = 0;
484 rval = error;
485 break;
487 lastino = ino;
488 continue;
490 if (fmterror == BULKSTAT_RV_GIVEUP) {
491 ubleft = 0;
492 ASSERT(error);
493 rval = error;
494 break;
496 if (ubufp)
497 ubufp += ubused;
498 ubleft -= ubused;
499 ubelem++;
500 lastino = ino;
503 cond_resched();
506 if (bp)
507 xfs_buf_relse(bp);
510 * Set up for the next loop iteration.
512 if (XFS_BULKSTAT_UBLEFT(ubleft)) {
513 if (end_of_ag) {
514 agno++;
515 agino = 0;
516 } else
517 agino = XFS_INO_TO_AGINO(mp, lastino);
518 } else
519 break;
522 * Done, we're either out of filesystem or space to put the data.
524 kmem_free_large(irbuf);
525 *ubcountp = ubelem;
527 * Found some inodes, return them now and return the error next time.
529 if (ubelem)
530 rval = 0;
531 if (agno >= mp->m_sb.sb_agcount) {
533 * If we ran out of filesystem, mark lastino as off
534 * the end of the filesystem, so the next call
535 * will return immediately.
537 *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0);
538 *done = 1;
539 } else
540 *lastinop = (xfs_ino_t)lastino;
542 return rval;
546 * Return stat information in bulk (by-inode) for the filesystem.
547 * Special case for non-sequential one inode bulkstat.
549 int /* error status */
550 xfs_bulkstat_single(
551 xfs_mount_t *mp, /* mount point for filesystem */
552 xfs_ino_t *lastinop, /* inode to return */
553 char __user *buffer, /* buffer with inode stats */
554 int *done) /* 1 if there are more stats to get */
556 int count; /* count value for bulkstat call */
557 int error; /* return value */
558 xfs_ino_t ino; /* filesystem inode number */
559 int res; /* result from bs1 */
562 * note that requesting valid inode numbers which are not allocated
563 * to inodes will most likely cause xfs_imap_to_bp to generate warning
564 * messages about bad magic numbers. This is ok. The fact that
565 * the inode isn't actually an inode is handled by the
566 * error check below. Done this way to make the usual case faster
567 * at the expense of the error case.
570 ino = (xfs_ino_t)*lastinop;
571 error = xfs_bulkstat_one(mp, ino, buffer, sizeof(xfs_bstat_t), 0, &res);
572 if (error) {
574 * Special case way failed, do it the "long" way
575 * to see if that works.
577 (*lastinop)--;
578 count = 1;
579 if (xfs_bulkstat(mp, lastinop, &count, xfs_bulkstat_one,
580 sizeof(xfs_bstat_t), buffer, done))
581 return error;
582 if (count == 0 || (xfs_ino_t)*lastinop != ino)
583 return error == EFSCORRUPTED ?
584 XFS_ERROR(EINVAL) : error;
585 else
586 return 0;
588 *done = 0;
589 return 0;
593 xfs_inumbers_fmt(
594 void __user *ubuffer, /* buffer to write to */
595 const xfs_inogrp_t *buffer, /* buffer to read from */
596 long count, /* # of elements to read */
597 long *written) /* # of bytes written */
599 if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
600 return -EFAULT;
601 *written = count * sizeof(*buffer);
602 return 0;
606 * Return inode number table for the filesystem.
608 int /* error status */
609 xfs_inumbers(
610 xfs_mount_t *mp, /* mount point for filesystem */
611 xfs_ino_t *lastino, /* last inode returned */
612 int *count, /* size of buffer/count returned */
613 void __user *ubuffer,/* buffer with inode descriptions */
614 inumbers_fmt_pf formatter)
616 xfs_buf_t *agbp;
617 xfs_agino_t agino;
618 xfs_agnumber_t agno;
619 int bcount;
620 xfs_inogrp_t *buffer;
621 int bufidx;
622 xfs_btree_cur_t *cur;
623 int error;
624 xfs_inobt_rec_incore_t r;
625 int i;
626 xfs_ino_t ino;
627 int left;
628 int tmp;
630 ino = (xfs_ino_t)*lastino;
631 agno = XFS_INO_TO_AGNO(mp, ino);
632 agino = XFS_INO_TO_AGINO(mp, ino);
633 left = *count;
634 *count = 0;
635 bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
636 buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP);
637 error = bufidx = 0;
638 cur = NULL;
639 agbp = NULL;
640 while (left > 0 && agno < mp->m_sb.sb_agcount) {
641 if (agbp == NULL) {
642 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
643 if (error) {
645 * If we can't read the AGI of this ag,
646 * then just skip to the next one.
648 ASSERT(cur == NULL);
649 agbp = NULL;
650 agno++;
651 agino = 0;
652 continue;
654 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno);
655 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE,
656 &tmp);
657 if (error) {
658 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
659 cur = NULL;
660 xfs_buf_relse(agbp);
661 agbp = NULL;
663 * Move up the last inode in the current
664 * chunk. The lookup_ge will always get
665 * us the first inode in the next chunk.
667 agino += XFS_INODES_PER_CHUNK - 1;
668 continue;
671 error = xfs_inobt_get_rec(cur, &r, &i);
672 if (error || i == 0) {
673 xfs_buf_relse(agbp);
674 agbp = NULL;
675 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
676 cur = NULL;
677 agno++;
678 agino = 0;
679 continue;
681 agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1;
682 buffer[bufidx].xi_startino =
683 XFS_AGINO_TO_INO(mp, agno, r.ir_startino);
684 buffer[bufidx].xi_alloccount =
685 XFS_INODES_PER_CHUNK - r.ir_freecount;
686 buffer[bufidx].xi_allocmask = ~r.ir_free;
687 bufidx++;
688 left--;
689 if (bufidx == bcount) {
690 long written;
691 if (formatter(ubuffer, buffer, bufidx, &written)) {
692 error = XFS_ERROR(EFAULT);
693 break;
695 ubuffer += written;
696 *count += bufidx;
697 bufidx = 0;
699 if (left) {
700 error = xfs_btree_increment(cur, 0, &tmp);
701 if (error) {
702 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
703 cur = NULL;
704 xfs_buf_relse(agbp);
705 agbp = NULL;
707 * The agino value has already been bumped.
708 * Just try to skip up to it.
710 agino += XFS_INODES_PER_CHUNK;
711 continue;
715 if (!error) {
716 if (bufidx) {
717 long written;
718 if (formatter(ubuffer, buffer, bufidx, &written))
719 error = XFS_ERROR(EFAULT);
720 else
721 *count += bufidx;
723 *lastino = XFS_AGINO_TO_INO(mp, agno, agino);
725 kmem_free(buffer);
726 if (cur)
727 xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
728 XFS_BTREE_NOERROR));
729 if (agbp)
730 xfs_buf_relse(agbp);
731 return error;