Loading...
1/*
2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
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.
8 *
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.
13 *
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
17 */
18#include "xfs.h"
19#include "xfs_fs.h"
20#include "xfs_shared.h"
21#include "xfs_format.h"
22#include "xfs_log_format.h"
23#include "xfs_trans_resv.h"
24#include "xfs_mount.h"
25#include "xfs_inode.h"
26#include "xfs_btree.h"
27#include "xfs_ialloc.h"
28#include "xfs_ialloc_btree.h"
29#include "xfs_itable.h"
30#include "xfs_error.h"
31#include "xfs_trace.h"
32#include "xfs_icache.h"
33
34/*
35 * Return stat information for one inode.
36 * Return 0 if ok, else errno.
37 */
38int
39xfs_bulkstat_one_int(
40 struct xfs_mount *mp, /* mount point for filesystem */
41 xfs_ino_t ino, /* inode to get data for */
42 void __user *buffer, /* buffer to place output in */
43 int ubsize, /* size of buffer */
44 bulkstat_one_fmt_pf formatter, /* formatter, copy to user */
45 int *ubused, /* bytes used by me */
46 int *stat) /* BULKSTAT_RV_... */
47{
48 struct xfs_icdinode *dic; /* dinode core info pointer */
49 struct xfs_inode *ip; /* incore inode pointer */
50 struct inode *inode;
51 struct xfs_bstat *buf; /* return buffer */
52 int error = 0; /* error value */
53
54 *stat = BULKSTAT_RV_NOTHING;
55
56 if (!buffer || xfs_internal_inum(mp, ino))
57 return -EINVAL;
58
59 buf = kmem_zalloc(sizeof(*buf), KM_SLEEP | KM_MAYFAIL);
60 if (!buf)
61 return -ENOMEM;
62
63 error = xfs_iget(mp, NULL, ino,
64 (XFS_IGET_DONTCACHE | XFS_IGET_UNTRUSTED),
65 XFS_ILOCK_SHARED, &ip);
66 if (error)
67 goto out_free;
68
69 ASSERT(ip != NULL);
70 ASSERT(ip->i_imap.im_blkno != 0);
71 inode = VFS_I(ip);
72
73 dic = &ip->i_d;
74
75 /* xfs_iget returns the following without needing
76 * further change.
77 */
78 buf->bs_projid_lo = dic->di_projid_lo;
79 buf->bs_projid_hi = dic->di_projid_hi;
80 buf->bs_ino = ino;
81 buf->bs_uid = dic->di_uid;
82 buf->bs_gid = dic->di_gid;
83 buf->bs_size = dic->di_size;
84
85 buf->bs_nlink = inode->i_nlink;
86 buf->bs_atime.tv_sec = inode->i_atime.tv_sec;
87 buf->bs_atime.tv_nsec = inode->i_atime.tv_nsec;
88 buf->bs_mtime.tv_sec = inode->i_mtime.tv_sec;
89 buf->bs_mtime.tv_nsec = inode->i_mtime.tv_nsec;
90 buf->bs_ctime.tv_sec = inode->i_ctime.tv_sec;
91 buf->bs_ctime.tv_nsec = inode->i_ctime.tv_nsec;
92 buf->bs_gen = inode->i_generation;
93 buf->bs_mode = inode->i_mode;
94
95 buf->bs_xflags = xfs_ip2xflags(ip);
96 buf->bs_extsize = dic->di_extsize << mp->m_sb.sb_blocklog;
97 buf->bs_extents = dic->di_nextents;
98 memset(buf->bs_pad, 0, sizeof(buf->bs_pad));
99 buf->bs_dmevmask = dic->di_dmevmask;
100 buf->bs_dmstate = dic->di_dmstate;
101 buf->bs_aextents = dic->di_anextents;
102 buf->bs_forkoff = XFS_IFORK_BOFF(ip);
103
104 if (dic->di_version == 3) {
105 if (dic->di_flags2 & XFS_DIFLAG2_COWEXTSIZE)
106 buf->bs_cowextsize = dic->di_cowextsize <<
107 mp->m_sb.sb_blocklog;
108 }
109
110 switch (dic->di_format) {
111 case XFS_DINODE_FMT_DEV:
112 buf->bs_rdev = sysv_encode_dev(inode->i_rdev);
113 buf->bs_blksize = BLKDEV_IOSIZE;
114 buf->bs_blocks = 0;
115 break;
116 case XFS_DINODE_FMT_LOCAL:
117 buf->bs_rdev = 0;
118 buf->bs_blksize = mp->m_sb.sb_blocksize;
119 buf->bs_blocks = 0;
120 break;
121 case XFS_DINODE_FMT_EXTENTS:
122 case XFS_DINODE_FMT_BTREE:
123 buf->bs_rdev = 0;
124 buf->bs_blksize = mp->m_sb.sb_blocksize;
125 buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks;
126 break;
127 }
128 xfs_iunlock(ip, XFS_ILOCK_SHARED);
129 IRELE(ip);
130
131 error = formatter(buffer, ubsize, ubused, buf);
132 if (!error)
133 *stat = BULKSTAT_RV_DIDONE;
134
135 out_free:
136 kmem_free(buf);
137 return error;
138}
139
140/* Return 0 on success or positive error */
141STATIC int
142xfs_bulkstat_one_fmt(
143 void __user *ubuffer,
144 int ubsize,
145 int *ubused,
146 const xfs_bstat_t *buffer)
147{
148 if (ubsize < sizeof(*buffer))
149 return -ENOMEM;
150 if (copy_to_user(ubuffer, buffer, sizeof(*buffer)))
151 return -EFAULT;
152 if (ubused)
153 *ubused = sizeof(*buffer);
154 return 0;
155}
156
157int
158xfs_bulkstat_one(
159 xfs_mount_t *mp, /* mount point for filesystem */
160 xfs_ino_t ino, /* inode number to get data for */
161 void __user *buffer, /* buffer to place output in */
162 int ubsize, /* size of buffer */
163 int *ubused, /* bytes used by me */
164 int *stat) /* BULKSTAT_RV_... */
165{
166 return xfs_bulkstat_one_int(mp, ino, buffer, ubsize,
167 xfs_bulkstat_one_fmt, ubused, stat);
168}
169
170/*
171 * Loop over all clusters in a chunk for a given incore inode allocation btree
172 * record. Do a readahead if there are any allocated inodes in that cluster.
173 */
174STATIC void
175xfs_bulkstat_ichunk_ra(
176 struct xfs_mount *mp,
177 xfs_agnumber_t agno,
178 struct xfs_inobt_rec_incore *irec)
179{
180 xfs_agblock_t agbno;
181 struct blk_plug plug;
182 int blks_per_cluster;
183 int inodes_per_cluster;
184 int i; /* inode chunk index */
185
186 agbno = XFS_AGINO_TO_AGBNO(mp, irec->ir_startino);
187 blks_per_cluster = xfs_icluster_size_fsb(mp);
188 inodes_per_cluster = blks_per_cluster << mp->m_sb.sb_inopblog;
189
190 blk_start_plug(&plug);
191 for (i = 0; i < XFS_INODES_PER_CHUNK;
192 i += inodes_per_cluster, agbno += blks_per_cluster) {
193 if (xfs_inobt_maskn(i, inodes_per_cluster) & ~irec->ir_free) {
194 xfs_btree_reada_bufs(mp, agno, agbno, blks_per_cluster,
195 &xfs_inode_buf_ops);
196 }
197 }
198 blk_finish_plug(&plug);
199}
200
201/*
202 * Lookup the inode chunk that the given inode lives in and then get the record
203 * if we found the chunk. If the inode was not the last in the chunk and there
204 * are some left allocated, update the data for the pointed-to record as well as
205 * return the count of grabbed inodes.
206 */
207STATIC int
208xfs_bulkstat_grab_ichunk(
209 struct xfs_btree_cur *cur, /* btree cursor */
210 xfs_agino_t agino, /* starting inode of chunk */
211 int *icount,/* return # of inodes grabbed */
212 struct xfs_inobt_rec_incore *irec) /* btree record */
213{
214 int idx; /* index into inode chunk */
215 int stat;
216 int error = 0;
217
218 /* Lookup the inode chunk that this inode lives in */
219 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &stat);
220 if (error)
221 return error;
222 if (!stat) {
223 *icount = 0;
224 return error;
225 }
226
227 /* Get the record, should always work */
228 error = xfs_inobt_get_rec(cur, irec, &stat);
229 if (error)
230 return error;
231 XFS_WANT_CORRUPTED_RETURN(cur->bc_mp, stat == 1);
232
233 /* Check if the record contains the inode in request */
234 if (irec->ir_startino + XFS_INODES_PER_CHUNK <= agino) {
235 *icount = 0;
236 return 0;
237 }
238
239 idx = agino - irec->ir_startino + 1;
240 if (idx < XFS_INODES_PER_CHUNK &&
241 (xfs_inobt_maskn(idx, XFS_INODES_PER_CHUNK - idx) & ~irec->ir_free)) {
242 int i;
243
244 /* We got a right chunk with some left inodes allocated at it.
245 * Grab the chunk record. Mark all the uninteresting inodes
246 * free -- because they're before our start point.
247 */
248 for (i = 0; i < idx; i++) {
249 if (XFS_INOBT_MASK(i) & ~irec->ir_free)
250 irec->ir_freecount++;
251 }
252
253 irec->ir_free |= xfs_inobt_maskn(0, idx);
254 *icount = irec->ir_count - irec->ir_freecount;
255 }
256
257 return 0;
258}
259
260#define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
261
262struct xfs_bulkstat_agichunk {
263 char __user **ac_ubuffer;/* pointer into user's buffer */
264 int ac_ubleft; /* bytes left in user's buffer */
265 int ac_ubelem; /* spaces used in user's buffer */
266};
267
268/*
269 * Process inodes in chunk with a pointer to a formatter function
270 * that will iget the inode and fill in the appropriate structure.
271 */
272static int
273xfs_bulkstat_ag_ichunk(
274 struct xfs_mount *mp,
275 xfs_agnumber_t agno,
276 struct xfs_inobt_rec_incore *irbp,
277 bulkstat_one_pf formatter,
278 size_t statstruct_size,
279 struct xfs_bulkstat_agichunk *acp,
280 xfs_agino_t *last_agino)
281{
282 char __user **ubufp = acp->ac_ubuffer;
283 int chunkidx;
284 int error = 0;
285 xfs_agino_t agino = irbp->ir_startino;
286
287 for (chunkidx = 0; chunkidx < XFS_INODES_PER_CHUNK;
288 chunkidx++, agino++) {
289 int fmterror;
290 int ubused;
291
292 /* inode won't fit in buffer, we are done */
293 if (acp->ac_ubleft < statstruct_size)
294 break;
295
296 /* Skip if this inode is free */
297 if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free)
298 continue;
299
300 /* Get the inode and fill in a single buffer */
301 ubused = statstruct_size;
302 error = formatter(mp, XFS_AGINO_TO_INO(mp, agno, agino),
303 *ubufp, acp->ac_ubleft, &ubused, &fmterror);
304
305 if (fmterror == BULKSTAT_RV_GIVEUP ||
306 (error && error != -ENOENT && error != -EINVAL)) {
307 acp->ac_ubleft = 0;
308 ASSERT(error);
309 break;
310 }
311
312 /* be careful not to leak error if at end of chunk */
313 if (fmterror == BULKSTAT_RV_NOTHING || error) {
314 error = 0;
315 continue;
316 }
317
318 *ubufp += ubused;
319 acp->ac_ubleft -= ubused;
320 acp->ac_ubelem++;
321 }
322
323 /*
324 * Post-update *last_agino. At this point, agino will always point one
325 * inode past the last inode we processed successfully. Hence we
326 * substract that inode when setting the *last_agino cursor so that we
327 * return the correct cookie to userspace. On the next bulkstat call,
328 * the inode under the lastino cookie will be skipped as we have already
329 * processed it here.
330 */
331 *last_agino = agino - 1;
332
333 return error;
334}
335
336/*
337 * Return stat information in bulk (by-inode) for the filesystem.
338 */
339int /* error status */
340xfs_bulkstat(
341 xfs_mount_t *mp, /* mount point for filesystem */
342 xfs_ino_t *lastinop, /* last inode returned */
343 int *ubcountp, /* size of buffer/count returned */
344 bulkstat_one_pf formatter, /* func that'd fill a single buf */
345 size_t statstruct_size, /* sizeof struct filling */
346 char __user *ubuffer, /* buffer with inode stats */
347 int *done) /* 1 if there are more stats to get */
348{
349 xfs_buf_t *agbp; /* agi header buffer */
350 xfs_agino_t agino; /* inode # in allocation group */
351 xfs_agnumber_t agno; /* allocation group number */
352 xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */
353 xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
354 int nirbuf; /* size of irbuf */
355 int ubcount; /* size of user's buffer */
356 struct xfs_bulkstat_agichunk ac;
357 int error = 0;
358
359 /*
360 * Get the last inode value, see if there's nothing to do.
361 */
362 agno = XFS_INO_TO_AGNO(mp, *lastinop);
363 agino = XFS_INO_TO_AGINO(mp, *lastinop);
364 if (agno >= mp->m_sb.sb_agcount ||
365 *lastinop != XFS_AGINO_TO_INO(mp, agno, agino)) {
366 *done = 1;
367 *ubcountp = 0;
368 return 0;
369 }
370
371 ubcount = *ubcountp; /* statstruct's */
372 ac.ac_ubuffer = &ubuffer;
373 ac.ac_ubleft = ubcount * statstruct_size; /* bytes */;
374 ac.ac_ubelem = 0;
375
376 *ubcountp = 0;
377 *done = 0;
378
379 irbuf = kmem_zalloc_large(PAGE_SIZE * 4, KM_SLEEP);
380 if (!irbuf)
381 return -ENOMEM;
382 nirbuf = (PAGE_SIZE * 4) / sizeof(*irbuf);
383
384 /*
385 * Loop over the allocation groups, starting from the last
386 * inode returned; 0 means start of the allocation group.
387 */
388 while (agno < mp->m_sb.sb_agcount) {
389 struct xfs_inobt_rec_incore *irbp = irbuf;
390 struct xfs_inobt_rec_incore *irbufend = irbuf + nirbuf;
391 bool end_of_ag = false;
392 int icount = 0;
393 int stat;
394
395 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
396 if (error)
397 break;
398 /*
399 * Allocate and initialize a btree cursor for ialloc btree.
400 */
401 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
402 XFS_BTNUM_INO);
403 if (agino > 0) {
404 /*
405 * In the middle of an allocation group, we need to get
406 * the remainder of the chunk we're in.
407 */
408 struct xfs_inobt_rec_incore r;
409
410 error = xfs_bulkstat_grab_ichunk(cur, agino, &icount, &r);
411 if (error)
412 goto del_cursor;
413 if (icount) {
414 irbp->ir_startino = r.ir_startino;
415 irbp->ir_holemask = r.ir_holemask;
416 irbp->ir_count = r.ir_count;
417 irbp->ir_freecount = r.ir_freecount;
418 irbp->ir_free = r.ir_free;
419 irbp++;
420 }
421 /* Increment to the next record */
422 error = xfs_btree_increment(cur, 0, &stat);
423 } else {
424 /* Start of ag. Lookup the first inode chunk */
425 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &stat);
426 }
427 if (error || stat == 0) {
428 end_of_ag = true;
429 goto del_cursor;
430 }
431
432 /*
433 * Loop through inode btree records in this ag,
434 * until we run out of inodes or space in the buffer.
435 */
436 while (irbp < irbufend && icount < ubcount) {
437 struct xfs_inobt_rec_incore r;
438
439 error = xfs_inobt_get_rec(cur, &r, &stat);
440 if (error || stat == 0) {
441 end_of_ag = true;
442 goto del_cursor;
443 }
444
445 /*
446 * If this chunk has any allocated inodes, save it.
447 * Also start read-ahead now for this chunk.
448 */
449 if (r.ir_freecount < r.ir_count) {
450 xfs_bulkstat_ichunk_ra(mp, agno, &r);
451 irbp->ir_startino = r.ir_startino;
452 irbp->ir_holemask = r.ir_holemask;
453 irbp->ir_count = r.ir_count;
454 irbp->ir_freecount = r.ir_freecount;
455 irbp->ir_free = r.ir_free;
456 irbp++;
457 icount += r.ir_count - r.ir_freecount;
458 }
459 error = xfs_btree_increment(cur, 0, &stat);
460 if (error || stat == 0) {
461 end_of_ag = true;
462 goto del_cursor;
463 }
464 cond_resched();
465 }
466
467 /*
468 * Drop the btree buffers and the agi buffer as we can't hold any
469 * of the locks these represent when calling iget. If there is a
470 * pending error, then we are done.
471 */
472del_cursor:
473 xfs_btree_del_cursor(cur, error ?
474 XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
475 xfs_buf_relse(agbp);
476 if (error)
477 break;
478 /*
479 * Now format all the good inodes into the user's buffer. The
480 * call to xfs_bulkstat_ag_ichunk() sets up the agino pointer
481 * for the next loop iteration.
482 */
483 irbufend = irbp;
484 for (irbp = irbuf;
485 irbp < irbufend && ac.ac_ubleft >= statstruct_size;
486 irbp++) {
487 error = xfs_bulkstat_ag_ichunk(mp, agno, irbp,
488 formatter, statstruct_size, &ac,
489 &agino);
490 if (error)
491 break;
492
493 cond_resched();
494 }
495
496 /*
497 * If we've run out of space or had a formatting error, we
498 * are now done
499 */
500 if (ac.ac_ubleft < statstruct_size || error)
501 break;
502
503 if (end_of_ag) {
504 agno++;
505 agino = 0;
506 }
507 }
508 /*
509 * Done, we're either out of filesystem or space to put the data.
510 */
511 kmem_free(irbuf);
512 *ubcountp = ac.ac_ubelem;
513
514 /*
515 * We found some inodes, so clear the error status and return them.
516 * The lastino pointer will point directly at the inode that triggered
517 * any error that occurred, so on the next call the error will be
518 * triggered again and propagated to userspace as there will be no
519 * formatted inodes in the buffer.
520 */
521 if (ac.ac_ubelem)
522 error = 0;
523
524 /*
525 * If we ran out of filesystem, lastino will point off the end of
526 * the filesystem so the next call will return immediately.
527 */
528 *lastinop = XFS_AGINO_TO_INO(mp, agno, agino);
529 if (agno >= mp->m_sb.sb_agcount)
530 *done = 1;
531
532 return error;
533}
534
535int
536xfs_inumbers_fmt(
537 void __user *ubuffer, /* buffer to write to */
538 const struct xfs_inogrp *buffer, /* buffer to read from */
539 long count, /* # of elements to read */
540 long *written) /* # of bytes written */
541{
542 if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
543 return -EFAULT;
544 *written = count * sizeof(*buffer);
545 return 0;
546}
547
548/*
549 * Return inode number table for the filesystem.
550 */
551int /* error status */
552xfs_inumbers(
553 struct xfs_mount *mp,/* mount point for filesystem */
554 xfs_ino_t *lastino,/* last inode returned */
555 int *count,/* size of buffer/count returned */
556 void __user *ubuffer,/* buffer with inode descriptions */
557 inumbers_fmt_pf formatter)
558{
559 xfs_agnumber_t agno = XFS_INO_TO_AGNO(mp, *lastino);
560 xfs_agino_t agino = XFS_INO_TO_AGINO(mp, *lastino);
561 struct xfs_btree_cur *cur = NULL;
562 struct xfs_buf *agbp = NULL;
563 struct xfs_inogrp *buffer;
564 int bcount;
565 int left = *count;
566 int bufidx = 0;
567 int error = 0;
568
569 *count = 0;
570 if (agno >= mp->m_sb.sb_agcount ||
571 *lastino != XFS_AGINO_TO_INO(mp, agno, agino))
572 return error;
573
574 bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
575 buffer = kmem_zalloc(bcount * sizeof(*buffer), KM_SLEEP);
576 do {
577 struct xfs_inobt_rec_incore r;
578 int stat;
579
580 if (!agbp) {
581 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
582 if (error)
583 break;
584
585 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
586 XFS_BTNUM_INO);
587 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE,
588 &stat);
589 if (error)
590 break;
591 if (!stat)
592 goto next_ag;
593 }
594
595 error = xfs_inobt_get_rec(cur, &r, &stat);
596 if (error)
597 break;
598 if (!stat)
599 goto next_ag;
600
601 agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1;
602 buffer[bufidx].xi_startino =
603 XFS_AGINO_TO_INO(mp, agno, r.ir_startino);
604 buffer[bufidx].xi_alloccount = r.ir_count - r.ir_freecount;
605 buffer[bufidx].xi_allocmask = ~r.ir_free;
606 if (++bufidx == bcount) {
607 long written;
608
609 error = formatter(ubuffer, buffer, bufidx, &written);
610 if (error)
611 break;
612 ubuffer += written;
613 *count += bufidx;
614 bufidx = 0;
615 }
616 if (!--left)
617 break;
618
619 error = xfs_btree_increment(cur, 0, &stat);
620 if (error)
621 break;
622 if (stat)
623 continue;
624
625next_ag:
626 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
627 cur = NULL;
628 xfs_buf_relse(agbp);
629 agbp = NULL;
630 agino = 0;
631 agno++;
632 } while (agno < mp->m_sb.sb_agcount);
633
634 if (!error) {
635 if (bufidx) {
636 long written;
637
638 error = formatter(ubuffer, buffer, bufidx, &written);
639 if (!error)
640 *count += bufidx;
641 }
642 *lastino = XFS_AGINO_TO_INO(mp, agno, agino);
643 }
644
645 kmem_free(buffer);
646 if (cur)
647 xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
648 XFS_BTREE_NOERROR));
649 if (agbp)
650 xfs_buf_relse(agbp);
651
652 return error;
653}
1/*
2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
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.
8 *
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.
13 *
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
17 */
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
38STATIC int
39xfs_internal_inum(
40 xfs_mount_t *mp,
41 xfs_ino_t ino)
42{
43 return (ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino ||
44 (xfs_sb_version_hasquota(&mp->m_sb) &&
45 (ino == mp->m_sb.sb_uquotino || ino == mp->m_sb.sb_gquotino)));
46}
47
48/*
49 * Return stat information for one inode.
50 * Return 0 if ok, else errno.
51 */
52int
53xfs_bulkstat_one_int(
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_... */
61{
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 */
66
67 *stat = BULKSTAT_RV_NOTHING;
68
69 if (!buffer || xfs_internal_inum(mp, ino))
70 return XFS_ERROR(EINVAL);
71
72 buf = kmem_alloc(sizeof(*buf), KM_SLEEP | KM_MAYFAIL);
73 if (!buf)
74 return XFS_ERROR(ENOMEM);
75
76 error = xfs_iget(mp, NULL, ino,
77 (XFS_IGET_DONTCACHE | XFS_IGET_UNTRUSTED),
78 XFS_ILOCK_SHARED, &ip);
79 if (error) {
80 *stat = BULKSTAT_RV_NOTHING;
81 goto out_free;
82 }
83
84 ASSERT(ip != NULL);
85 ASSERT(ip->i_imap.im_blkno != 0);
86
87 dic = &ip->i_d;
88
89 /* xfs_iget returns the following without needing
90 * further change.
91 */
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;
95 buf->bs_ino = ino;
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);
115
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;
120 buf->bs_blocks = 0;
121 break;
122 case XFS_DINODE_FMT_LOCAL:
123 case XFS_DINODE_FMT_UUID:
124 buf->bs_rdev = 0;
125 buf->bs_blksize = mp->m_sb.sb_blocksize;
126 buf->bs_blocks = 0;
127 break;
128 case XFS_DINODE_FMT_EXTENTS:
129 case XFS_DINODE_FMT_BTREE:
130 buf->bs_rdev = 0;
131 buf->bs_blksize = mp->m_sb.sb_blocksize;
132 buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks;
133 break;
134 }
135 xfs_iunlock(ip, XFS_ILOCK_SHARED);
136 IRELE(ip);
137
138 error = formatter(buffer, ubsize, ubused, buf);
139
140 if (!error)
141 *stat = BULKSTAT_RV_DIDONE;
142
143 out_free:
144 kmem_free(buf);
145 return error;
146}
147
148/* Return 0 on success or positive error */
149STATIC int
150xfs_bulkstat_one_fmt(
151 void __user *ubuffer,
152 int ubsize,
153 int *ubused,
154 const xfs_bstat_t *buffer)
155{
156 if (ubsize < sizeof(*buffer))
157 return XFS_ERROR(ENOMEM);
158 if (copy_to_user(ubuffer, buffer, sizeof(*buffer)))
159 return XFS_ERROR(EFAULT);
160 if (ubused)
161 *ubused = sizeof(*buffer);
162 return 0;
163}
164
165int
166xfs_bulkstat_one(
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_... */
173{
174 return xfs_bulkstat_one_int(mp, ino, buffer, ubsize,
175 xfs_bulkstat_one_fmt, ubused, stat);
176}
177
178#define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
179
180/*
181 * Return stat information in bulk (by-inode) for the filesystem.
182 */
183int /* error status */
184xfs_bulkstat(
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 */
192{
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 nbcluster; /* # of blocks in a cluster */
213 int nicluster; /* # of inodes in a cluster */
214 int nimask; /* mask for inode clusters */
215 int nirbuf; /* size of irbuf */
216 int rval; /* return value error code */
217 int tmp; /* result value from btree calls */
218 int ubcount; /* size of user's buffer */
219 int ubleft; /* bytes left in user's buffer */
220 char __user *ubufp; /* pointer into user's buffer */
221 int ubelem; /* spaces used in user's buffer */
222 int ubused; /* bytes used by formatter */
223 xfs_buf_t *bp; /* ptr to on-disk inode cluster buf */
224
225 /*
226 * Get the last inode value, see if there's nothing to do.
227 */
228 ino = (xfs_ino_t)*lastinop;
229 lastino = ino;
230 agno = XFS_INO_TO_AGNO(mp, ino);
231 agino = XFS_INO_TO_AGINO(mp, ino);
232 if (agno >= mp->m_sb.sb_agcount ||
233 ino != XFS_AGINO_TO_INO(mp, agno, agino)) {
234 *done = 1;
235 *ubcountp = 0;
236 return 0;
237 }
238 if (!ubcountp || *ubcountp <= 0) {
239 return EINVAL;
240 }
241 ubcount = *ubcountp; /* statstruct's */
242 ubleft = ubcount * statstruct_size; /* bytes */
243 *ubcountp = ubelem = 0;
244 *done = 0;
245 fmterror = 0;
246 ubufp = ubuffer;
247 nicluster = mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp) ?
248 mp->m_sb.sb_inopblock :
249 (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog);
250 nimask = ~(nicluster - 1);
251 nbcluster = nicluster >> mp->m_sb.sb_inopblog;
252 irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4);
253 if (!irbuf)
254 return ENOMEM;
255
256 nirbuf = irbsize / sizeof(*irbuf);
257
258 /*
259 * Loop over the allocation groups, starting from the last
260 * inode returned; 0 means start of the allocation group.
261 */
262 rval = 0;
263 while (XFS_BULKSTAT_UBLEFT(ubleft) && agno < mp->m_sb.sb_agcount) {
264 cond_resched();
265 bp = NULL;
266 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
267 if (error) {
268 /*
269 * Skip this allocation group and go to the next one.
270 */
271 agno++;
272 agino = 0;
273 continue;
274 }
275 agi = XFS_BUF_TO_AGI(agbp);
276 /*
277 * Allocate and initialize a btree cursor for ialloc btree.
278 */
279 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno);
280 irbp = irbuf;
281 irbufend = irbuf + nirbuf;
282 end_of_ag = 0;
283 /*
284 * If we're returning in the middle of an allocation group,
285 * we need to get the remainder of the chunk we're in.
286 */
287 if (agino > 0) {
288 xfs_inobt_rec_incore_t r;
289
290 /*
291 * Lookup the inode chunk that this inode lives in.
292 */
293 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE,
294 &tmp);
295 if (!error && /* no I/O error */
296 tmp && /* lookup succeeded */
297 /* got the record, should always work */
298 !(error = xfs_inobt_get_rec(cur, &r, &i)) &&
299 i == 1 &&
300 /* this is the right chunk */
301 agino < r.ir_startino + XFS_INODES_PER_CHUNK &&
302 /* lastino was not last in chunk */
303 (chunkidx = agino - r.ir_startino + 1) <
304 XFS_INODES_PER_CHUNK &&
305 /* there are some left allocated */
306 xfs_inobt_maskn(chunkidx,
307 XFS_INODES_PER_CHUNK - chunkidx) &
308 ~r.ir_free) {
309 /*
310 * Grab the chunk record. Mark all the
311 * uninteresting inodes (because they're
312 * before our start point) free.
313 */
314 for (i = 0; i < chunkidx; i++) {
315 if (XFS_INOBT_MASK(i) & ~r.ir_free)
316 r.ir_freecount++;
317 }
318 r.ir_free |= xfs_inobt_maskn(0, chunkidx);
319 irbp->ir_startino = r.ir_startino;
320 irbp->ir_freecount = r.ir_freecount;
321 irbp->ir_free = r.ir_free;
322 irbp++;
323 agino = r.ir_startino + XFS_INODES_PER_CHUNK;
324 icount = XFS_INODES_PER_CHUNK - r.ir_freecount;
325 } else {
326 /*
327 * If any of those tests failed, bump the
328 * inode number (just in case).
329 */
330 agino++;
331 icount = 0;
332 }
333 /*
334 * In any case, increment to the next record.
335 */
336 if (!error)
337 error = xfs_btree_increment(cur, 0, &tmp);
338 } else {
339 /*
340 * Start of ag. Lookup the first inode chunk.
341 */
342 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &tmp);
343 icount = 0;
344 }
345 /*
346 * Loop through inode btree records in this ag,
347 * until we run out of inodes or space in the buffer.
348 */
349 while (irbp < irbufend && icount < ubcount) {
350 xfs_inobt_rec_incore_t r;
351
352 /*
353 * Loop as long as we're unable to read the
354 * inode btree.
355 */
356 while (error) {
357 agino += XFS_INODES_PER_CHUNK;
358 if (XFS_AGINO_TO_AGBNO(mp, agino) >=
359 be32_to_cpu(agi->agi_length))
360 break;
361 error = xfs_inobt_lookup(cur, agino,
362 XFS_LOOKUP_GE, &tmp);
363 cond_resched();
364 }
365 /*
366 * If ran off the end of the ag either with an error,
367 * or the normal way, set end and stop collecting.
368 */
369 if (error) {
370 end_of_ag = 1;
371 break;
372 }
373
374 error = xfs_inobt_get_rec(cur, &r, &i);
375 if (error || i == 0) {
376 end_of_ag = 1;
377 break;
378 }
379
380 /*
381 * If this chunk has any allocated inodes, save it.
382 * Also start read-ahead now for this chunk.
383 */
384 if (r.ir_freecount < XFS_INODES_PER_CHUNK) {
385 /*
386 * Loop over all clusters in the next chunk.
387 * Do a readahead if there are any allocated
388 * inodes in that cluster.
389 */
390 agbno = XFS_AGINO_TO_AGBNO(mp, r.ir_startino);
391 for (chunkidx = 0;
392 chunkidx < XFS_INODES_PER_CHUNK;
393 chunkidx += nicluster,
394 agbno += nbcluster) {
395 if (xfs_inobt_maskn(chunkidx, nicluster)
396 & ~r.ir_free)
397 xfs_btree_reada_bufs(mp, agno,
398 agbno, nbcluster);
399 }
400 irbp->ir_startino = r.ir_startino;
401 irbp->ir_freecount = r.ir_freecount;
402 irbp->ir_free = r.ir_free;
403 irbp++;
404 icount += XFS_INODES_PER_CHUNK - r.ir_freecount;
405 }
406 /*
407 * Set agino to after this chunk and bump the cursor.
408 */
409 agino = r.ir_startino + XFS_INODES_PER_CHUNK;
410 error = xfs_btree_increment(cur, 0, &tmp);
411 cond_resched();
412 }
413 /*
414 * Drop the btree buffers and the agi buffer.
415 * We can't hold any of the locks these represent
416 * when calling iget.
417 */
418 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
419 xfs_buf_relse(agbp);
420 /*
421 * Now format all the good inodes into the user's buffer.
422 */
423 irbufend = irbp;
424 for (irbp = irbuf;
425 irbp < irbufend && XFS_BULKSTAT_UBLEFT(ubleft); irbp++) {
426 /*
427 * Now process this chunk of inodes.
428 */
429 for (agino = irbp->ir_startino, chunkidx = clustidx = 0;
430 XFS_BULKSTAT_UBLEFT(ubleft) &&
431 irbp->ir_freecount < XFS_INODES_PER_CHUNK;
432 chunkidx++, clustidx++, agino++) {
433 ASSERT(chunkidx < XFS_INODES_PER_CHUNK);
434 /*
435 * Recompute agbno if this is the
436 * first inode of the cluster.
437 *
438 * Careful with clustidx. There can be
439 * multiple clusters per chunk, a single
440 * cluster per chunk or a cluster that has
441 * inodes represented from several different
442 * chunks (if blocksize is large).
443 *
444 * Because of this, the starting clustidx is
445 * initialized to zero in this loop but must
446 * later be reset after reading in the cluster
447 * buffer.
448 */
449 if ((chunkidx & (nicluster - 1)) == 0) {
450 agbno = XFS_AGINO_TO_AGBNO(mp,
451 irbp->ir_startino) +
452 ((chunkidx & nimask) >>
453 mp->m_sb.sb_inopblog);
454 }
455 ino = XFS_AGINO_TO_INO(mp, agno, agino);
456 /*
457 * Skip if this inode is free.
458 */
459 if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) {
460 lastino = ino;
461 continue;
462 }
463 /*
464 * Count used inodes as free so we can tell
465 * when the chunk is used up.
466 */
467 irbp->ir_freecount++;
468
469 /*
470 * Get the inode and fill in a single buffer.
471 */
472 ubused = statstruct_size;
473 error = formatter(mp, ino, ubufp, ubleft,
474 &ubused, &fmterror);
475 if (fmterror == BULKSTAT_RV_NOTHING) {
476 if (error && error != ENOENT &&
477 error != EINVAL) {
478 ubleft = 0;
479 rval = error;
480 break;
481 }
482 lastino = ino;
483 continue;
484 }
485 if (fmterror == BULKSTAT_RV_GIVEUP) {
486 ubleft = 0;
487 ASSERT(error);
488 rval = error;
489 break;
490 }
491 if (ubufp)
492 ubufp += ubused;
493 ubleft -= ubused;
494 ubelem++;
495 lastino = ino;
496 }
497
498 cond_resched();
499 }
500
501 if (bp)
502 xfs_buf_relse(bp);
503
504 /*
505 * Set up for the next loop iteration.
506 */
507 if (XFS_BULKSTAT_UBLEFT(ubleft)) {
508 if (end_of_ag) {
509 agno++;
510 agino = 0;
511 } else
512 agino = XFS_INO_TO_AGINO(mp, lastino);
513 } else
514 break;
515 }
516 /*
517 * Done, we're either out of filesystem or space to put the data.
518 */
519 kmem_free_large(irbuf);
520 *ubcountp = ubelem;
521 /*
522 * Found some inodes, return them now and return the error next time.
523 */
524 if (ubelem)
525 rval = 0;
526 if (agno >= mp->m_sb.sb_agcount) {
527 /*
528 * If we ran out of filesystem, mark lastino as off
529 * the end of the filesystem, so the next call
530 * will return immediately.
531 */
532 *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0);
533 *done = 1;
534 } else
535 *lastinop = (xfs_ino_t)lastino;
536
537 return rval;
538}
539
540/*
541 * Return stat information in bulk (by-inode) for the filesystem.
542 * Special case for non-sequential one inode bulkstat.
543 */
544int /* error status */
545xfs_bulkstat_single(
546 xfs_mount_t *mp, /* mount point for filesystem */
547 xfs_ino_t *lastinop, /* inode to return */
548 char __user *buffer, /* buffer with inode stats */
549 int *done) /* 1 if there are more stats to get */
550{
551 int count; /* count value for bulkstat call */
552 int error; /* return value */
553 xfs_ino_t ino; /* filesystem inode number */
554 int res; /* result from bs1 */
555
556 /*
557 * note that requesting valid inode numbers which are not allocated
558 * to inodes will most likely cause xfs_itobp to generate warning
559 * messages about bad magic numbers. This is ok. The fact that
560 * the inode isn't actually an inode is handled by the
561 * error check below. Done this way to make the usual case faster
562 * at the expense of the error case.
563 */
564
565 ino = (xfs_ino_t)*lastinop;
566 error = xfs_bulkstat_one(mp, ino, buffer, sizeof(xfs_bstat_t), 0, &res);
567 if (error) {
568 /*
569 * Special case way failed, do it the "long" way
570 * to see if that works.
571 */
572 (*lastinop)--;
573 count = 1;
574 if (xfs_bulkstat(mp, lastinop, &count, xfs_bulkstat_one,
575 sizeof(xfs_bstat_t), buffer, done))
576 return error;
577 if (count == 0 || (xfs_ino_t)*lastinop != ino)
578 return error == EFSCORRUPTED ?
579 XFS_ERROR(EINVAL) : error;
580 else
581 return 0;
582 }
583 *done = 0;
584 return 0;
585}
586
587int
588xfs_inumbers_fmt(
589 void __user *ubuffer, /* buffer to write to */
590 const xfs_inogrp_t *buffer, /* buffer to read from */
591 long count, /* # of elements to read */
592 long *written) /* # of bytes written */
593{
594 if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
595 return -EFAULT;
596 *written = count * sizeof(*buffer);
597 return 0;
598}
599
600/*
601 * Return inode number table for the filesystem.
602 */
603int /* error status */
604xfs_inumbers(
605 xfs_mount_t *mp, /* mount point for filesystem */
606 xfs_ino_t *lastino, /* last inode returned */
607 int *count, /* size of buffer/count returned */
608 void __user *ubuffer,/* buffer with inode descriptions */
609 inumbers_fmt_pf formatter)
610{
611 xfs_buf_t *agbp;
612 xfs_agino_t agino;
613 xfs_agnumber_t agno;
614 int bcount;
615 xfs_inogrp_t *buffer;
616 int bufidx;
617 xfs_btree_cur_t *cur;
618 int error;
619 xfs_inobt_rec_incore_t r;
620 int i;
621 xfs_ino_t ino;
622 int left;
623 int tmp;
624
625 ino = (xfs_ino_t)*lastino;
626 agno = XFS_INO_TO_AGNO(mp, ino);
627 agino = XFS_INO_TO_AGINO(mp, ino);
628 left = *count;
629 *count = 0;
630 bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
631 buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP);
632 error = bufidx = 0;
633 cur = NULL;
634 agbp = NULL;
635 while (left > 0 && agno < mp->m_sb.sb_agcount) {
636 if (agbp == NULL) {
637 error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
638 if (error) {
639 /*
640 * If we can't read the AGI of this ag,
641 * then just skip to the next one.
642 */
643 ASSERT(cur == NULL);
644 agbp = NULL;
645 agno++;
646 agino = 0;
647 continue;
648 }
649 cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno);
650 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE,
651 &tmp);
652 if (error) {
653 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
654 cur = NULL;
655 xfs_buf_relse(agbp);
656 agbp = NULL;
657 /*
658 * Move up the last inode in the current
659 * chunk. The lookup_ge will always get
660 * us the first inode in the next chunk.
661 */
662 agino += XFS_INODES_PER_CHUNK - 1;
663 continue;
664 }
665 }
666 error = xfs_inobt_get_rec(cur, &r, &i);
667 if (error || i == 0) {
668 xfs_buf_relse(agbp);
669 agbp = NULL;
670 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
671 cur = NULL;
672 agno++;
673 agino = 0;
674 continue;
675 }
676 agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1;
677 buffer[bufidx].xi_startino =
678 XFS_AGINO_TO_INO(mp, agno, r.ir_startino);
679 buffer[bufidx].xi_alloccount =
680 XFS_INODES_PER_CHUNK - r.ir_freecount;
681 buffer[bufidx].xi_allocmask = ~r.ir_free;
682 bufidx++;
683 left--;
684 if (bufidx == bcount) {
685 long written;
686 if (formatter(ubuffer, buffer, bufidx, &written)) {
687 error = XFS_ERROR(EFAULT);
688 break;
689 }
690 ubuffer += written;
691 *count += bufidx;
692 bufidx = 0;
693 }
694 if (left) {
695 error = xfs_btree_increment(cur, 0, &tmp);
696 if (error) {
697 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
698 cur = NULL;
699 xfs_buf_relse(agbp);
700 agbp = NULL;
701 /*
702 * The agino value has already been bumped.
703 * Just try to skip up to it.
704 */
705 agino += XFS_INODES_PER_CHUNK;
706 continue;
707 }
708 }
709 }
710 if (!error) {
711 if (bufidx) {
712 long written;
713 if (formatter(ubuffer, buffer, bufidx, &written))
714 error = XFS_ERROR(EFAULT);
715 else
716 *count += bufidx;
717 }
718 *lastino = XFS_AGINO_TO_INO(mp, agno, agino);
719 }
720 kmem_free(buffer);
721 if (cur)
722 xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
723 XFS_BTREE_NOERROR));
724 if (agbp)
725 xfs_buf_relse(agbp);
726 return error;
727}